Home
last modified time | relevance | path

Searched refs:bitset_word_t (Results 1 – 3 of 3) sorted by relevance

/l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/regex/
A Dregex_internal.h91 typedef unsigned long int bitset_word_t; typedef
95 #define BITSET_WORD_BITS (sizeof (bitset_word_t) * CHAR_BIT)
98 typedef bitset_word_t bitset_t[BITSET_WORDS];
99 typedef bitset_word_t *re_bitset_ptr_t;
100 typedef const bitset_word_t *re_const_bitset_ptr_t;
103 (set[i / BITSET_WORD_BITS] |= (bitset_word_t) 1 << i % BITSET_WORD_BITS)
105 (set[i / BITSET_WORD_BITS] &= ~((bitset_word_t) 1 << i % BITSET_WORD_BITS))
107 (set[i / BITSET_WORD_BITS] & ((bitset_word_t) 1 << i % BITSET_WORD_BITS))
579 bitset_word_t used_bkref_map;
580 bitset_word_t completed_bkref_map;
A Dregcomp.c332 bitset_word_t w = dfa->nodes[node].opr.sbcset[i]; in re_compile_fastmap_iter()
334 if (w & ((bitset_word_t) 1 << j)) in re_compile_fastmap_iter()
871 dfa->sb_char[i] |= (bitset_word_t) 1 << j; in init_dfa()
899 dfa->word_char[i] |= (bitset_word_t) 1 << j; in init_word_char()
1224 dfa->used_bkref_map &= ~((bitset_word_t) 1 << other_idx); in optimize_subexps()
1269 & ((bitset_word_t) 1 << node->token.opr.idx)))) in lower_subexp()
A Dregexec.c1863 & ((bitset_word_t) 1 << subexp_idx))) in check_dst_limits_calc_pos_1()
1891 &= ~((bitset_word_t) 1 << subexp_idx); in check_dst_limits_calc_pos_1()
2351 & ((bitset_word_t) 1 << dfa->nodes[node].opr.idx))) in check_subexp_matching_top()
3222 bitset_word_t elem, mask; in build_trtable()
3516 bitset_word_t any_set = 0; in group_nodes_into_DFAstates()
3535 bitset_word_t any_set = 0; in group_nodes_into_DFAstates()
3561 bitset_word_t has_intersec, not_subset, not_consumed; in group_nodes_into_DFAstates()

Completed in 16 milliseconds