731       mctx.state_log = re_malloc (re_dfastate_t *, mctx.input.bufs_len + 1);  in re_search_internal()
732       if (BE (mctx.state_log == NULL, 0))  in re_search_internal()
739     mctx.state_log = NULL;  in re_search_internal()
876 		  re_dfastate_t *pstate = mctx.state_log[match_last];  in re_search_internal()
969   re_free (mctx.state_log);  in re_search_internal()
987   assert (mctx->state_log != NULL);  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()
1056   re_free (mctx->state_log);  in prune_impossible_nodes()
1057   mctx->state_log = sifted_states;  in prune_impossible_nodes()
1137   if (mctx->state_log != NULL)  in check_matching()
1139       mctx->state_log[cur_str_idx] = cur_state;  in check_matching()
1193       if (mctx->state_log != NULL)  in check_matching()
1204 	  if (mctx->state_log == NULL  in check_matching()
1298       re_node_set *cur_nodes = &mctx->state_log[*pidx]->nodes;  in proceed_next_node()
1367 	      if (re_node_set_contains (&mctx->state_log[*pidx]->nodes,  in proceed_next_node()
1378 	  if (fs && (*pidx > mctx->match_last || mctx->state_log[*pidx] == NULL  in proceed_next_node()
1379 		     || !re_node_set_contains (&mctx->state_log[*pidx]->nodes,  in proceed_next_node()
1451   assert (mctx->state_log != NULL);  in set_regs()
1642   assert (mctx->state_log != NULL && mctx->state_log[str_idx] != NULL);  in sift_states_backward()
1669       if (mctx->state_log[str_idx])  in sift_states_backward()
1696   const re_node_set *cur_src = &mctx->state_log[str_idx]->non_eps_nodes;  in build_sifted_states()
1770       memset (mctx->state_log + top + 1, '\0',  in clean_state_log_if_needed()
1813   candidates = ((mctx->state_log[str_idx] == NULL) ? NULL  in update_cur_sifted_state()
1814 		: &mctx->state_log[str_idx]->nodes);  in update_cur_sifted_state()
1843   if (candidates && mctx->state_log[str_idx]->has_backref)  in update_cur_sifted_state()
2360       mctx->state_log[cur_idx] = next_state;  in merge_state_with_log()
2363   else if (mctx->state_log[cur_idx] == 0)  in merge_state_with_log()
2365       mctx->state_log[cur_idx] = next_state;  in merge_state_with_log()
2376       pstate = mctx->state_log[cur_idx];  in merge_state_with_log()
2394       next_state = mctx->state_log[cur_idx]  in merge_state_with_log()
2419 	  next_state = mctx->state_log[cur_idx];  in merge_state_with_log()
2445       while (mctx->state_log[cur_str_idx] == NULL);  in find_recover_state()
2581       dest_state = mctx->state_log[dest_idx];  in transit_state_mb()
2593       mctx->state_log[dest_idx]  in transit_state_mb()
2597       if (BE (mctx->state_log[dest_idx] == NULL && err != REG_NOERROR, 0))  in transit_state_mb()
2661 	  dest_state = mctx->state_log[dest_str_idx];  in transit_state_bkref()
2662 	  prev_nelem = ((mctx->state_log[cur_str_idx] == NULL) ? 0  in transit_state_bkref()
2663 			: mctx->state_log[cur_str_idx]->nodes.nelem);  in transit_state_bkref()
2667 	      mctx->state_log[dest_str_idx]  in transit_state_bkref()
2670 	      if (BE (mctx->state_log[dest_str_idx] == NULL  in transit_state_bkref()
2685 	      mctx->state_log[dest_str_idx]  in transit_state_bkref()
2688 	      if (BE (mctx->state_log[dest_str_idx] == NULL  in transit_state_bkref()
2695 	      && mctx->state_log[cur_str_idx]->nodes.nelem > prev_nelem)  in transit_state_bkref()
2826 	  if (mctx->state_log[sl_str] == NULL)  in get_subexp()
2829 	  nodes = &mctx->state_log[sl_str]->nodes;  in get_subexp()
2954   backup_state_log = mctx->state_log;  in check_arrival()
2956   mctx->state_log = path->array;  in check_arrival()
2975       cur_state = mctx->state_log[str_idx];  in check_arrival()
3003       mctx->state_log[str_idx] = cur_state;  in check_arrival()
3009       if (mctx->state_log[str_idx + 1])  in check_arrival()
3012 				   &mctx->state_log[str_idx + 1]->nodes);  in check_arrival()
3054       mctx->state_log[str_idx] = cur_state;  in check_arrival()
3058   cur_nodes = (mctx->state_log[last_str] == NULL ? NULL  in check_arrival()
3059 	       : &mctx->state_log[last_str]->nodes);  in check_arrival()
3063   mctx->state_log = backup_state_log;  in check_arrival()
3113 	      dest_state = mctx->state_log[next_idx];  in check_arrival_add_next_nodes()
3130 	      mctx->state_log[next_idx] = re_acquire_state (&err, dfa,  in check_arrival_add_next_nodes()
3132 	      if (BE (mctx->state_log[next_idx] == NULL  in check_arrival_add_next_nodes()
3313 	  if (mctx->state_log[to_idx])  in expand_bkref_cache()
3316 	      if (re_node_set_contains (&mctx->state_log[to_idx]->nodes,  in expand_bkref_cache()
3320 					   &mctx->state_log[to_idx]->nodes);  in expand_bkref_cache()
3335 	  mctx->state_log[to_idx] = re_acquire_state (&err, dfa, &union_set);  in expand_bkref_cache()
3337 	  if (BE (mctx->state_log[to_idx] == NULL  in expand_bkref_cache()
4143   if (mctx->state_log != NULL)  in extend_buffers()
4149       re_dfastate_t **new_array = re_realloc (mctx->state_log, re_dfastate_t *,  in extend_buffers()
4153       mctx->state_log = new_array;  in extend_buffers()