re_malloc
dfa->nexts = re_malloc (Idx, dfa->nodes_alloc);
dfa->org_indices = re_malloc (Idx, dfa->nodes_alloc);
dfa->edests = re_malloc (re_node_set, dfa->nodes_alloc);
dfa->eclosures = re_malloc (re_node_set, dfa->nodes_alloc);
dfa->subexp_map = re_malloc (Idx, preg->re_nsub);
dfa->inveclosures = re_malloc (re_node_set, dfa->nodes_len);
bin_tree_storage_t *storage = re_malloc (bin_tree_storage_t, 1);
preg->fastmap = re_malloc (char, SBC_MAX);
re_comp_buf.fastmap = re_malloc (char, SBC_MAX);
dfa->re_str = re_malloc (char, length + 1);
dfa->nodes = re_malloc (re_token_t, dfa->nodes_alloc);
set->elems = re_malloc (Idx, 2);
dest->elems = re_malloc (Idx, dest->alloc);
dest->elems = re_malloc (Idx, dest->alloc);
newstate->entrance_nodes = re_malloc (re_node_set, 1);
pstr->offsets = re_malloc (Idx, pstr->bufs_len);
set->elems = re_malloc (Idx, size);
set->elems = re_malloc (Idx, 1);
fs->stack[num].regs = re_malloc (regmatch_t, nregs);
fs->stack = re_malloc (struct re_fail_stack_ent_t, fs->alloc);
prev_idx_match = re_malloc (regmatch_t, nmatch);
dests_alloc = re_malloc (struct dests_alloc, 1);
dest_states = re_malloc (re_dfastate_t *, ndests * 3);
s = re_malloc (char, len);
mctx->bkref_ents = re_malloc (struct re_backref_cache_entry, n);
mctx->sub_tops = re_malloc (re_sub_match_top_t *, n);
pmatch = re_malloc (regmatch_t, nregs);
regs->start = re_malloc (regoff_t, need_regs);
regs->end = re_malloc (regoff_t, need_regs);
mctx.state_log = re_malloc (re_dfastate_t *, mctx.input.bufs_len + 1);
sifted_states = re_malloc (re_dfastate_t *, match_last + 1);
lim_states = re_malloc (re_dfastate_t *, match_last + 1);