Searched refs:SBC_MAX (Results 1 – 3 of 3) sorted by relevance
127 #define SBC_MAX (UCHAR_MAX + 1) macro201 #define BITSET_WORDS ((SBC_MAX + BITSET_WORD_BITS - 1) / BITSET_WORD_BITS)742 memset (set, -1, sizeof (bitset_word_t) * (SBC_MAX / BITSET_WORD_BITS)); in bitset_set_all()743 if (SBC_MAX % BITSET_WORD_BITS != 0) in bitset_set_all()745 ((bitset_word_t) 1 << SBC_MAX % BITSET_WORD_BITS) - 1; in bitset_set_all()758 for (bitset_i = 0; bitset_i < SBC_MAX / BITSET_WORD_BITS; ++bitset_i) in bitset_not()760 if (SBC_MAX % BITSET_WORD_BITS != 0) in bitset_not()762 ((((bitset_word_t) 1 << SBC_MAX % BITSET_WORD_BITS) - 1) in bitset_not()
269 memset (fastmap, '\0', sizeof (char) * SBC_MAX); in weak_alias()362 for (i = 0; i < SBC_MAX; ++i) in re_compile_fastmap_iter()416 memset (fastmap, '\1', sizeof (char) * SBC_MAX); in re_compile_fastmap_iter()472 preg->fastmap = re_malloc (char, SBC_MAX); in regcomp()574 >> (SBC_MAX % BITSET_WORD_BITS == 02781 for (wc = 0; wc < SBC_MAX; ++wc) in build_range_exp()2799 for (ch = 0; ch < SBC_MAX; ++ch) in build_range_exp()3009 for (ch = 0; ch < SBC_MAX; ch++) in build_range_exp()3529 for (ch = 0; ch < SBC_MAX; ++ch) in build_equiv_class()3621 for (i = 0; i < SBC_MAX; ++i) \ in build_charclass()[all …]
2252 return trtable[ch + SBC_MAX]; in transit_state()3270 re_dfastate_t *dest_states[SBC_MAX]; in build_trtable()3271 re_dfastate_t *dest_states_word[SBC_MAX]; in build_trtable()3272 re_dfastate_t *dest_states_nl[SBC_MAX]; in build_trtable()3280 re_node_set dests_node[SBC_MAX]; in build_trtable()3281 bitset_t dests_ch[SBC_MAX]; in build_trtable()3295 calloc (sizeof (re_dfastate_t *), SBC_MAX); in build_trtable()3367 (re_dfastate_t **) calloc (sizeof (re_dfastate_t *), SBC_MAX); in build_trtable()3416 trtable[ch + SBC_MAX] = dest_states_word[j]; in build_trtable()3430 trtable[NEWLINE_CHAR + SBC_MAX] = dest_states_nl[j]; in build_trtable()[all …]
Completed in 21 milliseconds