Lines Matching refs:re_dfastate_t
37 static void sift_ctx_init (re_sift_context_t *sctx, re_dfastate_t **sifted_sts,
38 re_dfastate_t **limited_sts, Idx last_node,
65 const re_dfastate_t *state, Idx idx)
127 re_dfastate_t **dst,
128 re_dfastate_t **src, Idx num)
130 static re_dfastate_t *find_recover_state (reg_errcode_t *err,
132 static re_dfastate_t *transit_state (reg_errcode_t *err,
134 re_dfastate_t *state) internal_function;
135 static re_dfastate_t *merge_state_with_log (reg_errcode_t *err,
137 re_dfastate_t *next_state)
143 static re_dfastate_t *transit_state_sb (reg_errcode_t *err,
145 re_dfastate_t *pstate)
150 re_dfastate_t *pstate)
188 re_dfastate_t *state) internal_function;
200 const re_dfastate_t *state,
728 if (BE (SIZE_MAX / sizeof (re_dfastate_t *) <= mctx.input.bufs_len, 0))
734 mctx.state_log = re_malloc (re_dfastate_t *, mctx.input.bufs_len + 1);
879 re_dfastate_t *pstate = mctx.state_log[match_last];
986 re_dfastate_t **sifted_states;
987 re_dfastate_t **lim_states = NULL;
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));
1075 static inline re_dfastate_t *
1127 re_dfastate_t *cur_state;
1180 re_dfastate_t *old_state = cur_state;
1271 const re_dfastate_t *state, Idx idx)
1665 sizeof (re_dfastate_t *) * str_idx);
1774 sizeof (re_dfastate_t *) * (next_state_log_idx - top));
1782 merge_state_array (const re_dfa_t *dfa, re_dfastate_t **dst,
1783 re_dfastate_t **src, Idx num)
1863 re_dfastate_t *state = re_acquire_state (&err, dfa, dest_nodes);
2202 re_dfastate_t *cur_state;
2296 static re_dfastate_t *
2299 re_dfastate_t *state)
2301 re_dfastate_t **trtable;
2354 static re_dfastate_t *
2357 re_dfastate_t *next_state)
2373 re_dfastate_t *pstate;
2433 static re_dfastate_t *
2437 re_dfastate_t *cur_state;
2498 static re_dfastate_t *
2500 re_dfastate_t *state)
2504 re_dfastate_t *next_state;
2539 transit_state_mb (re_match_context_t *mctx, re_dfastate_t *pstate)
2552 re_dfastate_t *dest_state;
2652 re_dfastate_t *dest_state;
2931 re_dfastate_t *cur_state = NULL;
2933 re_dfastate_t **backup_state_log;
2940 re_dfastate_t **new_array;
2944 || BE (SIZE_MAX / sizeof (re_dfastate_t *) < new_alloc, 0))
2946 new_array = re_realloc (path->array, re_dfastate_t *, new_alloc);
2952 sizeof (re_dfastate_t *) * (path->alloc - old_alloc));
3114 re_dfastate_t *dest_state;
3355 build_trtable (const re_dfa_t *dfa, re_dfastate_t *state)
3365 re_dfastate_t **trtable;
3366 re_dfastate_t **dest_states = NULL, **dest_states_word, **dest_states_nl;
3405 state->trtable = (re_dfastate_t **)
3406 calloc (sizeof (re_dfastate_t *), SBC_MAX);
3418 / (3 * sizeof (re_dfastate_t *)))
3424 + ndests * 3 * sizeof (re_dfastate_t *)))
3425 dest_states = (re_dfastate_t **)
3426 alloca (ndests * 3 * sizeof (re_dfastate_t *));
3429 dest_states = (re_dfastate_t **)
3430 malloc (ndests * 3 * sizeof (re_dfastate_t *));
3500 (re_dfastate_t **) calloc (sizeof (re_dfastate_t *), SBC_MAX);
3531 (re_dfastate_t **) calloc (sizeof (re_dfastate_t *), 2 * SBC_MAX);
3590 group_nodes_into_DFAstates (const re_dfa_t *dfa, const re_dfastate_t *state,
4139 if (BE (SIZE_MAX / 2 / sizeof (re_dfastate_t *) <= pstr->bufs_len, 0))
4153 re_dfastate_t **new_array = re_realloc (mctx->state_log, re_dfastate_t *,
4406 sift_ctx_init (re_sift_context_t *sctx, re_dfastate_t **sifted_sts,
4407 re_dfastate_t **limited_sts, Idx last_node, Idx last_str_idx)
