re_dfastate_t
const re_dfastate_t *init_state,
re_compile_fastmap_iter (regex_t *bufp, const re_dfastate_t *init_state,
re_dfastate_t *state = entry->array[j];
static re_dfastate_t *
re_dfastate_t *new_state;
re_dfastate_t *state = spot->array[i];
static re_dfastate_t *
re_dfastate_t *new_state;
re_dfastate_t *state = spot->array[i];
register_state (const re_dfa_t *dfa, re_dfastate_t *newstate,
re_dfastate_t **new_array = re_realloc (spot->array, re_dfastate_t *,
free_state (re_dfastate_t *state)
static re_dfastate_t *
re_dfastate_t *newstate;
newstate = (re_dfastate_t *) calloc (sizeof (re_dfastate_t), 1);
static re_dfastate_t *
re_dfastate_t *newstate;
newstate = (re_dfastate_t *) calloc (sizeof (re_dfastate_t), 1);
static re_dfastate_t *create_ci_newstate (const re_dfa_t *dfa,
static re_dfastate_t *create_cd_newstate (const re_dfa_t *dfa,
struct re_dfastate_t **trtable, **word_trtable;
typedef struct re_dfastate_t re_dfastate_t;
re_dfastate_t **array;
re_dfastate_t **array;
re_dfastate_t **state_log;
re_dfastate_t **sifted_states;
re_dfastate_t **limited_states;
re_dfastate_t *init_state;
re_dfastate_t *init_state_word;
re_dfastate_t *init_state_nl;
re_dfastate_t *init_state_begbuf;
static inline re_dfastate_t *
re_dfastate_t *cur_state;
re_dfastate_t **dst,
re_dfastate_t **src, Idx num);
static re_dfastate_t *find_recover_state (reg_errcode_t *err,
re_dfastate_t *old_state = cur_state;
static re_dfastate_t *transit_state (reg_errcode_t *err,
re_dfastate_t *state);
static re_dfastate_t *merge_state_with_log (reg_errcode_t *err,
re_dfastate_t *next_state);
const re_dfastate_t *state, Idx idx)
static re_dfastate_t *transit_state_sb (reg_errcode_t *err,
re_dfastate_t *pstate);
re_dfastate_t *pstate);
static bool build_trtable (const re_dfa_t *dfa, re_dfastate_t *state);
sizeof (re_dfastate_t *) * str_idx);
const re_dfastate_t *state,
sizeof (re_dfastate_t *) * (next_state_log_idx - top));
merge_state_array (const re_dfa_t *dfa, re_dfastate_t **dst,
re_dfastate_t **src, Idx num)
re_dfastate_t *state = re_acquire_state (&err, dfa, dest_nodes);
re_dfastate_t *cur_state;
static re_dfastate_t *
re_dfastate_t *state)
re_dfastate_t **trtable;
static re_dfastate_t *
re_dfastate_t *next_state)
re_dfastate_t *pstate;
static re_dfastate_t *
re_dfastate_t *cur_state;
static re_dfastate_t *
re_dfastate_t *state)
re_dfastate_t *next_state;
transit_state_mb (re_match_context_t *mctx, re_dfastate_t *pstate)
re_dfastate_t *dest_state;
re_dfastate_t *dest_state;
re_dfastate_t *cur_state = NULL;
re_dfastate_t **backup_state_log;
re_dfastate_t **new_array;
if (BE (SIZE_MAX / sizeof (re_dfastate_t *) < new_alloc, 0))
new_array = re_realloc (path->array, re_dfastate_t *, new_alloc);
sizeof (re_dfastate_t *) * (path->alloc - old_alloc));
re_dfastate_t *dest_state;
static void sift_ctx_init (re_sift_context_t *sctx, re_dfastate_t **sifted_sts,
re_dfastate_t **limited_sts, Idx last_node,
build_trtable (const re_dfa_t *dfa, re_dfastate_t *state)
re_dfastate_t **trtable;
re_dfastate_t **dest_states = NULL, **dest_states_word, **dest_states_nl;
state->trtable = (re_dfastate_t **)
calloc (sizeof (re_dfastate_t *), SBC_MAX);
/ (3 * sizeof (re_dfastate_t *)))
+ ndests * 3 * sizeof (re_dfastate_t *)))
dest_states = (re_dfastate_t **)
alloca (ndests * 3 * sizeof (re_dfastate_t *));
dest_states = re_malloc (re_dfastate_t *, ndests * 3);
(re_dfastate_t **) calloc (sizeof (re_dfastate_t *), SBC_MAX);
(re_dfastate_t **) calloc (sizeof (re_dfastate_t *), 2 * SBC_MAX);
group_nodes_into_DFAstates (const re_dfa_t *dfa, const re_dfastate_t *state,
if (BE (MIN (IDX_MAX, SIZE_MAX / sizeof (re_dfastate_t *)) / 2
re_dfastate_t **new_array = re_realloc (mctx->state_log, re_dfastate_t *,
sift_ctx_init (re_sift_context_t *sctx, re_dfastate_t **sifted_sts,
re_dfastate_t **limited_sts, Idx last_node, Idx last_str_idx)
const re_dfastate_t *state, Idx idx);
if (BE ((MIN (IDX_MAX, SIZE_MAX / sizeof (re_dfastate_t *))
mctx.state_log = re_malloc (re_dfastate_t *, mctx.input.bufs_len + 1);
re_dfastate_t *pstate = mctx.state_log[match_last];
re_dfastate_t **sifted_states;
re_dfastate_t **lim_states = NULL;
if (BE (MIN (IDX_MAX, SIZE_MAX / sizeof (re_dfastate_t *)) <= match_last, 0))
sifted_states = re_malloc (re_dfastate_t *, match_last + 1);
lim_states = re_malloc (re_dfastate_t *, match_last + 1);
sizeof (re_dfastate_t *) * (match_last + 1));