Lines Matching refs:state
146 more paths reach the same state, exactly one is chosen according to
159 tre_tnfa_transition_t *state;
277 while (trans_i->state != NULL)
288 reach_next_i->state = trans_i->state;
299 if (reach_next_i->state == tnfa->final)
312 reach_next_i->state = NULL;
331 /* For each state in `reach', weed out states that don't fulfill the
337 for (reach_i = reach; reach_i->state; reach_i++)
358 reach_next_i->state = reach_i->state;
365 reach_next_i->state = NULL;
373 /* For each state in `reach' see if there is a transition leaving with
374 the current input symbol to a state not yet in `reach_next', and
377 for (reach_i = reach; reach_i->state; reach_i++)
379 for (trans_i = reach_i->state; trans_i->state; trans_i++)
407 reach_next_i->state = trans_i->state;
414 if (reach_next_i->state == tnfa->final
430 /* Another path has also reached this state. We choose
440 if (trans_i->state == tnfa->final)
453 reach_next_i->state = NULL;
495 tre_tnfa_transition_t *state;
564 stack->item.state = (_state); \
580 state = stack->item.state; \
623 /* Current TNFA state. */
624 tre_tnfa_transition_t *state;
693 state = NULL;
705 for (trans_i = tnfa->initial; trans_i->state; trans_i++)
711 if (state == NULL)
713 /* Start from this state. */
714 state = trans_i->state;
719 /* Backtrack to this state. */
720 BT_STACK_PUSH(pos, str_byte, 0, trans_i->state,
736 if (state == NULL)
744 if (state == tnfa->final)
759 /* Our TNFAs never have transitions leaving from the final state,
766 trans_i = state;
767 if (trans_i->state && trans_i->assertions & ASSERT_BACKREF)
769 /* This is a back reference state. All transitions leaving from
770 this state have the same back reference "assertion". Instead
822 for (trans_i = state; trans_i->state; trans_i++)
837 next_state = trans_i->state;
846 BT_STACK_PUSH(pos, str_byte, 0, trans_i->state,
864 state = next_state;
877 if (stack->item.state->assertions & ASSERT_BACKREF)