2 ==================================================================================
3 Copyright (c) 2019 Nokia
4 Copyright (c) 2018-2019 AT&T Intellectual Property.
6 Licensed under the Apache License, Version 2.0 (the "License");
7 you may not use this file except in compliance with the License.
8 You may obtain a copy of the License at
10 http://www.apache.org/licenses/LICENSE-2.0
12 Unless required by applicable law or agreed to in writing, software
13 distributed under the License is distributed on an "AS IS" BASIS,
14 WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
15 See the License for the specific language governing permissions and
16 limitations under the License.
17 ==================================================================================
22 Mnemonic: symtab_static_test.c
23 Abstract: This is the static function that should be included by
24 any test that wants to test the symbol table. It must
25 be included in the compile, and not built to object.
28 Author: E. Scott Daniels
31 #include "rmr_symtab.h"
32 // -- parent must include if needed #include "../src/common/src/symtab.c"
40 int symtab_state = GOOD; // overall pass/fail state 0==fail
41 int symtab_counter = 0; // global counter for for-each tests
43 static void st_fetch( void* st, char* key, int class, int expected ) {
46 val = rmr_sym_get( st, key, class );
48 fprintf( stderr, "<%s> get returns key=%s val=%s\n", !expected ? "FAIL" : "OK", key, val );
54 fprintf( stderr, "<%s> string key st_fetch return nil\n", expected ? "FAIL" : "OK" );
61 static void st_nfetch( void* st, int key, int expected ) {
64 val = rmr_sym_pull( st, key );
66 fprintf( stderr, "<%s> get returns key=%d val=%s\n", !expected ? "FAIL" : "OK", key, val );
71 fprintf( stderr, "<%s> get return nil for key=%d\n", expected ? "FAIL" : "OK", key );
80 Driven by foreach class -- just incr the counter.
82 static void each_counter( void* a, void* b, const char* c, void* d, void* e ) {
86 static int symtab_test( ) {
90 char* goo = "goo"; // name not in symtab
97 st = rmr_sym_alloc( 10 ); // alloc with small value to force adjustment inside
98 errors += fail_if_nil( st, "symtab pointer" );
100 s = rmr_sym_put( st, foo, class, bar ); // add entry with string key; returns 1 if it was inserted
101 errors += fail_if_false( s, "insert foo existed" );
103 s = rmr_sym_put( st, foo, class+1, bar ); // add to table with a different class
104 errors += fail_if_false( s, "insert foo existed" );
106 s = rmr_sym_put( st, foo, class, bar ); // inserted above, should return not inserted (0)
107 errors += fail_if_true( s, "insert foo existed" );
109 st_fetch( st, foo, class, 1 );
110 st_fetch( st, goo, class, 0 ); // st_fetch non existant
111 rmr_sym_stats( st, 4 ); // early stats at verbose level 4 so chatter is minimised
114 for( i = 2000; i < 3000; i++ ) { // bunch of dummy things to force chains in the table
115 rmr_sym_map( st, i, foo ); // add entry with unsigned integer key
117 rmr_sym_stats( st, 0 ); // just the small facts to verify the 1000 we stuffed in
118 rmr_sym_ndel( st, 2001 ); // force a numeric key delete
119 rmr_sym_ndel( st, 12001 ); // delete numeric key not there
121 s = rmr_sym_map( st, 1234, foo ); // add known entries with unsigned integer key
122 errors += fail_if_false( s, "numeric add of key 1234 should not have existed" );
123 s = rmr_sym_map( st, 2345, bar );
124 errors += fail_if_true( s, "numeric add of key 2345 should have existed" );
127 rmr_sym_foreach_class( st, 0, each_counter, NULL );
128 errors += fail_if_false( symtab_counter, "expected counter after foreach to be non-zero" );
130 st_nfetch( st, 1234, 1 );
131 st_nfetch( st, 2345, 1 );
133 rmr_sym_del( st, foo, 0 ); // drive for coverage
134 rmr_sym_stats( st, 0 );
136 rmr_sym_free( NULL ); // ensure it doesn't barf when given a nil pointer
139 return !!( errors + symtab_state );