Home
last modified time | relevance | path

Searched refs:TRIE_LIST_USED (Results 1 – 4 of 4) sorted by relevance

/dports/lang/perl5.30/perl-5.30.3/
H A Dregcomp.c2149 #define TRIE_LIST_USED(idx) ( trie->states[state].trans.list \ macro
2299 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()
/dports/lang/perl5.34/perl-5.34.0/
H A Dregcomp.c2230 #define TRIE_LIST_USED(idx) ( trie->states[state].trans.list \ macro
2380 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()
/dports/lang/perl5-devel/perl5-5.35.4-102-ge43d289c7c/
H A Dregcomp.c2230 #define TRIE_LIST_USED(idx) ( trie->states[state].trans.list \ macro
2380 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()
/dports/lang/perl5.32/perl-5.32.1/
H A Dregcomp.c2246 #define TRIE_LIST_USED(idx) ( trie->states[state].trans.list \ macro
2396 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()