Lines Matching defs:transitions
1435 /* A simple set of transition labels. Most transitions have a singleton
1514 /* Links to other transitions for T. Always null for boolean tests. */
1653 /* Remove any optional transitions from S that turned out not to be useful. */
1748 When returning true, add all transitions like COMMON in D to WHERE.
1894 transitions it has. */
2210 /* Remove optional transitions that turned out not to be worthwhile. */
2321 transitions. TRANSITIONS[I] describes the subpattern for transition
2324 auto_vec <merge_pattern_transition *, 1> transitions;
2342 transitions.safe_grow_cleared (num_transitions, true);
2390 /* The number of transitions in S. */
2433 match the corresponding transitions of PAT. */
2439 if (merge_pattern_transition *ptrans = pat->transitions[j])
2469 if (sinfo->to_states[j].res && !pat->transitions[j])
2667 /* An array for recording changes to PAT->transitions[?].params.
2691 if (merge_pattern_transition *ptrans = pat->transitions[i])
2758 /* Match the transitions. */
2860 but leave the caller to add the transitions to it. Initialize CPI
2991 /* Fill in the transitions of NEWD. */
2997 if (merge_pattern_transition *ptrans = pat->transitions[i])
3060 transitions for SINFO and its substates to USE. */
3075 if (pat->transitions[i])
3278 new_pat->transitions[j] = ptrans;
3340 if (merge_pattern_transition *ptrans = pat->transitions[j])
3531 transitions. */
3547 /* Look for any transitions from D1 that have the same labels as
3596 /* Get a list of the transitions that intersect TRANS2. */
3691 subset of those required. If both transitions are optional,
3693 for both transitions. It isn't worth preserving the original
3694 transitions since we know that they can't be merged; we would
3696 we might be able to merge the targets of the transitions
3754 Those transitions are successfully dividing the matching space
3758 it go to a state that has the original transitions. */
Indexes created Mon Mar 30 00:23:01 UTC 2026