Home
last modified time | relevance | path

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

/ndk/sources/host-tools/sed-4.2.1/lib/
Dregex_internal.h159 typedef unsigned long int bitset_word_t; typedef
196 typedef bitset_word_t bitset_t[BITSET_WORDS];
197 typedef bitset_word_t *re_bitset_ptr_t;
198 typedef const bitset_word_t *re_const_bitset_ptr_t;
685 bitset_word_t used_bkref_map;
686 bitset_word_t completed_bkref_map;
741 set[i / BITSET_WORD_BITS] |= (bitset_word_t) 1 << i % BITSET_WORD_BITS; in bitset_set()
747 set[i / BITSET_WORD_BITS] &= ~ ((bitset_word_t) 1 << i % BITSET_WORD_BITS); in bitset_clear()
765 memset (set, -1, sizeof (bitset_word_t) * (SBC_MAX / BITSET_WORD_BITS)); in bitset_set_all()
768 ((bitset_word_t) 1 << SBC_MAX % BITSET_WORD_BITS) - 1; in bitset_set_all()
[all …]
Dregexec.c1992 & ((bitset_word_t) 1 << subexp_idx))) in check_dst_limits_calc_pos_1()
2020 &= ~((bitset_word_t) 1 << subexp_idx); in check_dst_limits_calc_pos_1()
2480 & ((bitset_word_t) 1 << dfa->nodes[node].opr.idx))) in check_subexp_matching_top()
3357 bitset_word_t elem, mask; in build_trtable()
3662 bitset_word_t any_set = 0; in group_nodes_into_DFAstates()
3681 bitset_word_t any_set = 0; in group_nodes_into_DFAstates()
3707 bitset_word_t has_intersec, not_subset, not_consumed; in group_nodes_into_DFAstates()
Dregcomp.c353 bitset_word_t w = dfa->nodes[node].opr.sbcset[i]; in re_compile_fastmap_iter()
355 if (w & ((bitset_word_t) 1 << j)) in re_compile_fastmap_iter()
925 dfa->sb_char[i] |= (bitset_word_t) 1 << j; in init_dfa()
953 dfa->word_char[i] |= (bitset_word_t) 1 << j; in init_word_char()
1290 dfa->used_bkref_map &= ~((bitset_word_t) 1 << other_idx); in optimize_subexps()
1335 & ((bitset_word_t) 1 << node->token.opr.idx)))) in lower_subexp()