| /third_party/rust/crates/aho-corasick/src/ |
| H A D | automaton.rs | 3 use crate::state_id::{dead_id, fail_id, StateID};
182 /// N.B. This does not report a match if `state_id` is given as a matching
190 state_id: &mut Self::ID, in standard_find_at()
198 state_id, in standard_find_at()
201 self.standard_find_at_imp(prestate, None, haystack, at, state_id) in standard_find_at()
215 state_id: &mut Self::ID, in standard_find_at_imp()
219 if prestate.is_effective(at) && *state_id == self.start_state() in standard_find_at_imp()
233 // `state_id`. `state_id` either comes from the caller (in which in standard_find_at_imp()
236 *state_id in standard_find_at_imp()
419 let mut state_id = self.start_state(); leftmost_find_at_no_state_imp() variables
[all...] |
| H A D | ahocorasick.rs | 10 use crate::state_id::StateID;
1090 state_id: &mut S, in overlapping_find_at()
1098 state_id, in overlapping_find_at()
1105 state_id, in overlapping_find_at()
1117 state_id: &mut S, in earliest_find_at()
1121 nfa.earliest_find_at(prestate, haystack, at, state_id) in earliest_find_at()
1124 dfa.earliest_find_at(prestate, haystack, at, state_id) in earliest_find_at()
1222 state_id: S,
1241 state_id: ac.imp.start_state(), in new()
1255 &mut self.state_id, in next()
[all...] |
| H A D | dfa.rs | 9 use crate::state_id::{dead_id, fail_id, premultiply_overflow_error, StateID};
60 state_id: &mut S, in overlapping_find_at()
68 state_id, in overlapping_find_at()
75 state_id, in overlapping_find_at()
82 state_id, in overlapping_find_at()
89 state_id, in overlapping_find_at()
101 state_id: &mut S, in earliest_find_at()
105 dfa.earliest_find_at(prestate, haystack, at, state_id) in earliest_find_at()
108 dfa.earliest_find_at(prestate, haystack, at, state_id) in earliest_find_at()
111 dfa.earliest_find_at(prestate, haystack, at, state_id) in earliest_find_at()
[all...] |
| H A D | nfa.rs | 12 use crate::state_id::{dead_id, fail_id, usize_to_state_id, StateID};
491 state_id: S,
496 fn new(nfa: &'a mut NFA<S>, state_id: S) -> IterTransitionsMut<'a, S> { in new()
497 IterTransitionsMut { nfa, state_id, cur: 0 } in new()
509 match self.nfa.states[self.state_id.to_usize()].trans { in next()
1066 fn insert(&mut self, state_id: S) { in insert()
1068 set.insert(state_id); in insert()
1074 fn contains(&self, state_id: S) -> bool { in contains()
1077 Some(ref set) => set.contains(&state_id), in contains()
|
| H A D | lib.rs | 201 pub use crate::state_id::StateID;
213 mod state_id; modules
|
| /third_party/musl/porting/liteos_m/kernel/src/regex/ |
| H A D | regexec.c | 279 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel()
306 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel()
307 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel()
404 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel()
411 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel()
412 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel()
429 assert(reach_pos[trans_i->state_id].pos == pos); in tre_tnfa_run_parallel()
435 *reach_pos[trans_i->state_id].tags)) in tre_tnfa_run_parallel()
438 tmp_iptr = *reach_pos[trans_i->state_id].tags; in tre_tnfa_run_parallel()
439 *reach_pos[trans_i->state_id] in tre_tnfa_run_parallel()
496 int state_id; global() member
[all...] |
| H A D | tre.h | 101 int state_id; member
|
| H A D | regcomp.c | 2509 if (trans->state_id == p2->position) in tre_make_trans()
2524 trans->state_id = p2->position; in tre_make_trans()
2858 initial[i].state_id = p->position; in regcomp()
|
| /third_party/musl/porting/liteos_m_iccarm/kernel/src/regex/ |
| H A D | regexec.c | 279 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel()
306 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel()
307 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel()
404 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel()
411 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel()
412 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel()
429 assert(reach_pos[trans_i->state_id].pos == pos); in tre_tnfa_run_parallel()
435 *reach_pos[trans_i->state_id].tags)) in tre_tnfa_run_parallel()
438 tmp_iptr = *reach_pos[trans_i->state_id].tags; in tre_tnfa_run_parallel()
439 *reach_pos[trans_i->state_id] in tre_tnfa_run_parallel()
496 int state_id; global() member
[all...] |
| H A D | tre.h | 102 int state_id; member
|
| H A D | regcomp.c | 2510 if (trans->state_id == p2->position) in tre_make_trans()
2525 trans->state_id = p2->position; in tre_make_trans()
2859 initial[i].state_id = p->position; in regcomp()
|
| /third_party/musl/porting/uniproton/kernel/src/regex/ |
| H A D | regexec.c | 279 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel()
306 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel()
307 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel()
404 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel()
411 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel()
412 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel()
429 assert(reach_pos[trans_i->state_id].pos == pos); in tre_tnfa_run_parallel()
435 *reach_pos[trans_i->state_id].tags)) in tre_tnfa_run_parallel()
438 tmp_iptr = *reach_pos[trans_i->state_id].tags; in tre_tnfa_run_parallel()
439 *reach_pos[trans_i->state_id] in tre_tnfa_run_parallel()
496 int state_id; global() member
[all...] |
| H A D | tre.h | 101 int state_id; member
|
| H A D | regcomp.c | 2509 if (trans->state_id == p2->position) in tre_make_trans()
2524 trans->state_id = p2->position; in tre_make_trans()
2858 initial[i].state_id = p->position; in regcomp()
|
| /third_party/musl/src/regex/ |
| H A D | regexec.c | 279 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel()
306 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel()
307 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel()
404 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel()
411 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel()
412 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel()
429 assert(reach_pos[trans_i->state_id].pos == pos); in tre_tnfa_run_parallel()
435 *reach_pos[trans_i->state_id].tags)) in tre_tnfa_run_parallel()
438 tmp_iptr = *reach_pos[trans_i->state_id].tags; in tre_tnfa_run_parallel()
439 *reach_pos[trans_i->state_id] in tre_tnfa_run_parallel()
496 int state_id; global() member
[all...] |
| H A D | tre.h | 100 int state_id; member
|
| H A D | regcomp.c | 2509 if (trans->state_id == p2->position) in tre_make_trans()
2524 trans->state_id = p2->position; in tre_make_trans()
2858 initial[i].state_id = p->position; in regcomp()
|
| /third_party/mesa3d/src/gallium/drivers/freedreno/a6xx/ |
| H A D | fd6_emit.c | 489 enum fd6_state_id state_id; member
499 assert(s[type].state_id);
523 fd6_emit_add_group(emit, tex->stateobj, s[type].state_id,
544 fd6_emit_take_group(emit, stateobj, s[type].state_id,
|
| /third_party/node/deps/v8/src/compiler/backend/ |
| H A D | instruction.cc | 985 int state_id) {
986 return deoptimization_entries_[state_id];
|
| H A D | code-generator.cc | 996 int const state_id = i.InputInt32(frame_state_offset); in GetDeoptimizationEntry() local
997 return instructions()->GetDeoptimizationEntry(state_id); in GetDeoptimizationEntry()
|
| H A D | instruction-selector.cc | 897 int const state_id = sequence()->AddDeoptimizationEntry( in AppendDeoptimizeArguments() local
899 args->push_back(g.TempImmediate(state_id)); in AppendDeoptimizeArguments()
1089 int const state_id = sequence()->AddDeoptimizationEntry( in InitializeCallBuffer() variable
1092 buffer->instruction_args.push_back(g.TempImmediate(state_id)); in InitializeCallBuffer()
|