Lines Matching defs:state
140 /* TODO: do check that DEF state recursion terminates */
284 * aa_dfa_match_len - traverse @dfa to find state @str stops at
286 * @start: the state of the dfa to start matching in
290 * aa_dfa_match_len will match @str against the dfa and return the state it
291 * finished matching in. The final state can be used to look up the accepting
292 * label, or as the start state of a continuing match.
297 * Returns: final state reached after input is consumed
306 unsigned int state = start, pos;
308 if (state == 0)
311 /* current state is <state>, matching character *str */
315 /* default is direct to next state */
317 pos = base[state] + equiv[(u8) *str++];
318 if (check[pos] == state)
319 state = next[pos];
321 state = def[state];
324 /* default is direct to next state */
326 pos = base[state] + (u8) *str++;
327 if (check[pos] == state)
328 state = next[pos];
330 state = def[state];
334 return state;
338 * aa_dfa_next_state - traverse @dfa to find state @str stops at
340 * @start: the state of the dfa to start matching in
343 * aa_dfa_next_state will match @str against the dfa and return the state it
344 * finished matching in. The final state can be used to look up the accepting
345 * label, or as the start state of a continuing match.
347 * Returns: final state reached after input is consumed