656   Idx match_last = REG_MISSING;  in re_search_internal()  local
862       match_last = check_matching (&mctx, fl_longest_match,  in re_search_internal()
864       if (match_last != REG_MISSING)  in re_search_internal()
866 	  if (BE (match_last == REG_ERROR, 0))  in re_search_internal()
873 	      mctx.match_last = match_last;  in re_search_internal()
876 		  re_dfastate_t *pstate = mctx.state_log[match_last];  in re_search_internal()
878 							     match_last);  in re_search_internal()
888 		  match_last = REG_MISSING;  in re_search_internal()
899   assert (match_last != REG_MISSING);  in re_search_internal()
914       pmatch[0].rm_eo = mctx.match_last;  in re_search_internal()
981   Idx halt_node, match_last;  in prune_impossible_nodes()  local
989   match_last = mctx->match_last;  in prune_impossible_nodes()
993   if (BE (SIZE_MAX / sizeof (re_dfastate_t *) <= match_last, 0))  in prune_impossible_nodes()
996   sifted_states = re_malloc (re_dfastate_t *, match_last + 1);  in prune_impossible_nodes()
1004       lim_states = re_malloc (re_dfastate_t *, match_last + 1);  in prune_impossible_nodes()
1013 		  sizeof (re_dfastate_t *) * (match_last + 1));  in prune_impossible_nodes()
1015 			 match_last);  in prune_impossible_nodes()
1024 	      --match_last;  in prune_impossible_nodes()
1025 	      if (! REG_VALID_INDEX (match_last))  in prune_impossible_nodes()
1030 	    } while (mctx->state_log[match_last] == NULL  in prune_impossible_nodes()
1031 		     || !mctx->state_log[match_last]->halt);  in prune_impossible_nodes()
1033 						mctx->state_log[match_last],  in prune_impossible_nodes()
1034 						match_last);  in prune_impossible_nodes()
1037 			       match_last + 1);  in prune_impossible_nodes()
1045       sift_ctx_init (&sctx, sifted_states, lim_states, halt_node, match_last);  in prune_impossible_nodes()
1060   mctx->match_last = match_last;  in prune_impossible_nodes()
1122   Idx match_last = REG_MISSING;  in check_matching()  local
1169 	      match_last = cur_str_idx;  in check_matching()
1227 	      match_last = re_string_cur_idx (&mctx->input);  in check_matching()
1241   return match_last;  in check_matching()
1378 	  if (fs && (*pidx > mctx->match_last || mctx->state_log[*pidx] == NULL  in proceed_next_node()
4195   mctx->match_last = REG_MISSING;  in match_ctx_init()