Lines Matching full:state
144 /* Returns true if an nfa state has an epsilon out-transition slot
147 #define FREE_EPSILON(state) \
148 (transchar[state] == SYM_EPSILON && \
149 trans2[state] == NO_TRANSITION && \
150 finalst[state] != state)
152 /* Returns true if an nfa state has an epsilon out-transition character
155 #define SUPER_FREE_EPSILON(state) \
156 (transchar[state] == SYM_EPSILON && \
157 trans1[state] == NO_TRANSITION) \
159 /* Maximum number of NFA states that can comprise a DFA state. It's real
160 * big because if there's a lot of rules, the initial state will have a
213 #define JAMSTATE -32766 /* marks a reference to the state that always jams */
218 /* Enough so that if it's subtracted from an NFA state number, the result
237 #define SAME_TRANS -1 /* transition is the same as "default" entry for state */
241 * The percentage the number of out-transitions a state must be of the
247 /* The percentage the number of homogeneous out-transitions of a state
248 * must be of the number of total out-transitions of the state in order
249 * that the state's transition table is first compared with a potential
255 /* The percentage the number of differences between a state's transition
257 * number of out-transitions of the state in order to keep the first
262 /* The percentage the number of differences between a state's transition
263 * table and the most similar proto must be of the state's total number
268 /* The percentage the number of homogeneous out-transitions of a state
269 * must be of the number of total out-transitions of the state in order
270 * to consider making a template from the state.
274 /* The percentage the number of differences between a state's transition
275 * table and the most similar proto must be of the state's total number
276 * of out-transitions to create a new proto from the state.
280 /* The percentage the total number of out-transitions of a state must be
293 /* Maximum number of out-transitions a state can have that we'll rummage
300 * with a DFA state.
355 * fulltbl - if true (-Cf flag), don't compress the DFA state table
448 * onestate - state number
450 * onenext - target state
461 * num_rules - number of the last accepting state; also is number of
466 * lastnfa - last nfa state number created
467 * firstst - physically the first state of a fragment
468 * lastst - last physical state of fragment
469 * finalst - last logical state of fragment
471 * trans1 - transition state
472 * trans2 - 2nd transition state for epsilons
474 * assoc_rule - rule associated with this NFA state (or 0 if none)
475 * state_type - a STATE_xxx type identifying whether the state is part
476 * of a normal rule, the leading state in a trailing context
477 * rule (i.e., the state which marks the transition from
479 * the trailing context), or a subsequent state in a trailing
500 /* Global holding current type of state we're making. */
520 * protcomst - common state of proto
523 * protsave contains the entire state array for protos
575 * lastdfa - last dfa state number created
576 * nxt - state to enter upon reading character
579 * base - offset into "nxt" for given state
581 * nultrans - NUL transition for each state
585 * dss - nfa state set for each dfa
586 * dfasiz - size of nfa state set for each dfa
587 * dfaacc - accepting set for each dfa state (if using REJECT), or accepting
589 * accsiz - size of accepting set for each dfa state
590 * dhash - dfa state hash value
594 * numsnpairs - number of state/nextstate transition pairs
596 * jamstate - state number corresponding to "jam" state
597 * end_of_buffer_state - end-of-buffer dfa state number
722 /* Check a DFA state for backing up. */
725 /* Check to see if NFA state set constitutes "dangerous" trailing context. */
736 /* Converts a set of ndfa states into a dfa state. */
773 /* Generate the code to find the next compressed-table state. */
779 /* Generate the code to find the next state. */
785 /* Generate the code to find the start state. */
918 /* Add an accepting state to a machine. */
933 /* Mark each "beginning" state in a machine as being a "normal" (i.e.,
934 * not trailing context associated) state.
952 /* Create a state with a transition on a given symbol. */
1023 /* Build table entries for dfa state. */
1028 /* Finds a space in the table for a state to be placed. */
1034 /* Create table entries for a state (or state fragment) which has
1039 /* Place a state into full speed transition table. */
