Lines Matching full:match_last
659 Idx match_last = REG_MISSING;
865 match_last = check_matching (&mctx, fl_longest_match,
867 if (match_last != REG_MISSING)
869 if (BE (match_last == REG_ERROR, 0))
876 mctx.match_last = match_last;
879 re_dfastate_t *pstate = mctx.state_log[match_last];
881 match_last);
891 match_last = REG_MISSING;
902 assert (match_last != REG_MISSING);
917 pmatch[0].rm_eo = mctx.match_last;
918 /* FIXME: This function should fail if mctx.match_last exceeds
984 Idx halt_node, match_last;
992 match_last = mctx->match_last;
996 if (BE (SIZE_MAX / sizeof (re_dfastate_t *) <= match_last, 0))
999 sifted_states = re_malloc (re_dfastate_t *, match_last + 1);
1007 lim_states = re_malloc (re_dfastate_t *, match_last + 1);
1016 sizeof (re_dfastate_t *) * (match_last + 1));
1018 match_last);
1027 --match_last;
1028 if (! REG_VALID_INDEX (match_last))
1033 } while (mctx->state_log[match_last] == NULL
1034 || !mctx->state_log[match_last]->halt);
1036 mctx->state_log[match_last],
1037 match_last);
1040 match_last + 1);
1048 sift_ctx_init (&sctx, sifted_states, lim_states, halt_node, match_last);
1063 mctx->match_last = match_last;
1125 Idx match_last = REG_MISSING;
1172 match_last = cur_str_idx;
1230 match_last = re_string_cur_idx (&mctx->input);
1244 return match_last;
1381 if (fs && (*pidx > mctx->match_last || mctx->state_log[*pidx] == NULL
1617 MATCH_LAST(the last index in the state_log):
1620 2. When 0 <= STR_IDX < MATCH_LAST and `a' accepts
1626 3. When 0 <= STR_IDX < MATCH_LAST and 'a' epsilon transit to 'b':
4200 mctx->match_last = REG_MISSING;
