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 ==================================================================================
23 Abstract: Test the ring funcitons.
24 Author: E. Scott Daniels
36 #include "../src/common/include/rmr.h"
37 #include "../src/common/include/rmr_agnostic.h"
38 #include "../src/common/src/ring_static.c"
42 Conduct a series of interleaved tests inserting i-factor
43 values before beginning to pull values (i-factor must be
44 size - 2 smaller than the ring.
45 Returns 0 on success, 1 on insert failure and 2 on pull failure.
47 static int ie_test( void* r, int i_factor, long inserts ) {
52 for( i = 0; i < inserts; i++ ) {
54 if( ! uta_ring_insert( r, &data[i%29] ) ) {
55 fprintf( stderr, "[FAIL] interleaved insert failed on ifactor=%d i=%d\n", i_factor, i );
58 if( i > i_factor-1 ) {
59 dp = uta_ring_extract( r );
60 if( *dp != data[(i-i_factor)%29] ) {
61 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 );
66 //fprintf( stderr, "[OK] interleaved insert/extract test passed for insert factor %d\n", i_factor );
79 r = uta_mk_ring( 0 ); // should return nil
81 fprintf( stderr, "[FAIL] attempt to make a ring with size 0 returned a pointer\n" );
84 r = uta_mk_ring( -1 ); // should also return nil
86 fprintf( stderr, "[FAIL] attempt to make a ring with size <0 returned a pointer\n" );
90 r = uta_mk_ring( 18 );
92 fprintf( stderr, "[FAIL] unable to make ring with 17 entries\n" );
96 for( i = 0; i < 20; i++ ) { // test to ensure it reports full when head/tail start at 0
98 if( ! uta_ring_insert( r, &data[i] ) ) {
104 fprintf( stderr, "[FAIL] didn not report table full: i=%d\n", i );
108 fprintf( stderr, "[OK] reported table full at i=%d as expected\n", i );
111 for( i = 0; i < size + 3; i++ ) { // ensure they all come back in order, and we don't get 'extras'
112 if( (dp = uta_ring_extract( r )) == NULL ) {
114 fprintf( stderr, "[FAIL] nil pointer at i=%d\n", i );
122 fprintf( stderr, "[FAIL] data at i=% isnt right; expected %d got %d\n", i, i, *dp );
126 fprintf( stderr, "[FAIL] got too many values on extract: %d\n", i );
129 fprintf( stderr, "[OK] extracted values were sane, got: %d\n", i-1 );
131 uta_ring_free( NULL ); // ensure this doesn't blow up
133 for( i = 2; i < 15; i++ ) {
134 r = uta_mk_ring( 16 );
135 if( ie_test( r, i, 101 ) != 0 ) { // modest number of inserts
141 fprintf( stderr, "[OK] all modest insert/exctract tests pass\n" );
144 for( j = 0; j < 20; j++ ) {
145 for( i = 2; i < size - 2; i++ ) {
146 r = uta_mk_ring( size );
147 if( ie_test( r, i, 66000 ) != 0 ) { // should force the 16bit head/tail indexes to roll over
153 fprintf( stderr, "[OK] all large insert/exctract tests pass ring size=%d\n", size );