1 // : vi ts=4 sw=4 noet :
3 ==================================================================================
4 Copyright (c) 2019 Nokia
5 Copyright (c) 2018-2019 AT&T Intellectual Property.
7 Licensed under the Apache License, Version 2.0 (the "License");
8 you may not use this file except in compliance with the License.
9 You may obtain a copy of the License at
11 http://www.apache.org/licenses/LICENSE-2.0
13 Unless required by applicable law or agreed to in writing, software
14 distributed under the License is distributed on an "AS IS" BASIS,
15 WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
16 See the License for the specific language governing permissions and
17 limitations under the License.
18 ==================================================================================
22 Mmemonic: ring_static_test.c
23 Abstract: Test the ring funcitons. These are meant to be included at compile
24 time by the test driver.
26 Author: E. Scott Daniels
38 #include <semaphore.h>
41 #include "rmr_agnostic.h"
45 Conduct a series of interleaved tests inserting i-factor
46 values before beginning to pull values (i-factor must be
47 size - 2 smaller than the ring.
48 Returns 0 on success, 1 on insert failure and 2 on pull failure.
50 static int ie_test( void* r, int i_factor, long inserts ) {
55 for( i = 0; i < inserts; i++ ) {
57 if( ! uta_ring_insert( r, &data[i%29] ) ) {
58 fprintf( stderr, "<FAIL> interleaved insert failed on ifactor=%d i=%d\n", i_factor, i );
61 if( i > i_factor-1 ) {
62 dp = uta_ring_extract( r );
63 if( *dp != data[(i-i_factor)%29] ) {
64 fprintf( stderr, "<FAIL> interleaved exctract failed on ifactor=%d i=%d expected=%d got=%d\n", i_factor, i, data[(i-i_factor)%29], *dp );
69 //fprintf( stderr, "<OK> interleaved insert/extract test passed for insert factor %d\n", i_factor );
74 static int ring_test( ) {
81 int pfd = -1; // pollable file descriptor for the ring
84 r = uta_mk_ring( 0 ); // should return nil
86 fprintf( stderr, "<FAIL> attempt to make a ring with size 0 returned a pointer\n" );
89 r = uta_mk_ring( -1 ); // should also return nil
91 fprintf( stderr, "<FAIL> attempt to make a ring with size <0 returned a pointer\n" );
95 r = uta_mk_ring( 18 );
97 fprintf( stderr, "<FAIL> unable to make ring with 17 entries\n" );
101 pfd = uta_ring_getpfd( r ); // get pollable file descriptor
103 fprintf( stderr, "<FAIL> expected a pollable file descriptor >= 0, but got: %d\n", pfd );
107 pfd = uta_ring_config( r, 0x03 ); // turn on locking for reads and writes
109 fprintf( stderr, "<FAIL> config attempt to enable locking failed\n" );
114 for( i = 0; i < 20; i++ ) { // test to ensure it reports full when head/tail start at 0
116 if( ! uta_ring_insert( r, &data[i] ) ) {
122 fprintf( stderr, "<FAIL> didn not report table full: i=%d\n", i );
126 fprintf( stderr, "<OK> reported table full at i=%d as expected\n", i );
129 for( i = 0; i < size + 3; i++ ) { // ensure they all come back in order, and we don't get 'extras'
130 if( (dp = uta_ring_extract( r )) == NULL ) {
132 fprintf( stderr, "<FAIL> nil pointer at i=%d\n", i );
140 fprintf( stderr, "<FAIL> data at i=% isnt right; expected %d got %d\n", i, i, *dp );
144 fprintf( stderr, "<FAIL> got too many values on extract: %d\n", i );
147 fprintf( stderr, "<OK> extracted values were sane, got: %d\n", i-1 );
149 uta_ring_free( NULL ); // ensure this doesn't blow up
151 for( i = 2; i < 15; i++ ) {
152 r = uta_mk_ring( 16 );
153 if( ie_test( r, i, 101 ) != 0 ) { // modest number of inserts
154 fprintf( stderr, "<FAIL> ie test for 101 inserts didn't return 0\n" );
160 fprintf( stderr, "<OK> all modest insert/exctract tests pass\n" );
163 for( j = 0; j < 20; j++ ) {
164 for( i = 2; i < size - 2; i++ ) {
165 r = uta_mk_ring( size );
166 if( ie_test( r, i, 66000 ) != 0 ) { // should force the 16bit head/tail indexes to roll over
167 fprintf( stderr, "<FAIL> ie test for 66K inserts didn't return 0\n" );
173 fprintf( stderr, "<OK> all large insert/exctract tests pass ring size=%d\n", size );
178 fprintf( stderr, "<INFO> all ring tests pass\n" );