Searched refs:TRIE_LIST_USED (Results 1 – 4 of 4) sorted by relevance
2149 #define TRIE_LIST_USED(idx) ( trie->states[state].trans.list \ macro2299 for( charid = 1 ; charid <= TRIE_LIST_USED( state ) ; charid++ ) { in S_dump_trie_interim_list()3043 check <= TRIE_LIST_USED( state ); in S_make_trie()3110 for( idx = 2 ; idx <= TRIE_LIST_USED( state ) ; idx++ ) { in S_make_trie()3149 for ( idx=1; idx <= TRIE_LIST_USED( state ) ; idx++ ) { in S_make_trie()
2230 #define TRIE_LIST_USED(idx) ( trie->states[state].trans.list \ macro2380 for( charid = 1 ; charid <= TRIE_LIST_USED( state ) ; charid++ ) { in S_dump_trie_interim_list()3123 check <= TRIE_LIST_USED( state ); in S_make_trie()3190 for( idx = 2 ; idx <= TRIE_LIST_USED( state ) ; idx++ ) { in S_make_trie()3229 for ( idx=1; idx <= TRIE_LIST_USED( state ) ; idx++ ) { in S_make_trie()
2246 #define TRIE_LIST_USED(idx) ( trie->states[state].trans.list \ macro2396 for( charid = 1 ; charid <= TRIE_LIST_USED( state ) ; charid++ ) { in S_dump_trie_interim_list()3141 check <= TRIE_LIST_USED( state ); in S_make_trie()3208 for( idx = 2 ; idx <= TRIE_LIST_USED( state ) ; idx++ ) { in S_make_trie()3247 for ( idx=1; idx <= TRIE_LIST_USED( state ) ; idx++ ) { in S_make_trie()