Searched refs:re_malloc (Results 1 - 4 of 4) sorted by relevance
/freebsd-10.2-release/contrib/libgnuregex/ |
H A D | regex_internal.c | 406 pstr->offsets = re_malloc (int, pstr->bufs_len); 973 set->elems = re_malloc (int, size); 985 set->elems = re_malloc (int, 1); 1000 set->elems = re_malloc (int, 2); 1033 dest->elems = re_malloc (int, dest->alloc); 1150 dest->elems = re_malloc (int, dest->alloc); 1708 newstate->entrance_nodes = re_malloc (re_node_set, 1);
|
H A D | regexec.c | 380 s = re_malloc (char, len); 456 pmatch = re_malloc (regmatch_t, nregs); 511 regs->start = re_malloc (regoff_t, need_regs); 514 regs->end = re_malloc (regoff_t, need_regs); 714 mctx.state_log = re_malloc (re_dfastate_t *, mctx.input.bufs_len + 1); 977 sifted_states = re_malloc (re_dfastate_t *, match_last + 1); 985 lim_states = re_malloc (re_dfastate_t *, match_last + 1); 1388 fs->stack[num].regs = re_malloc (regmatch_t, nregs); 1436 fs->stack = re_malloc (struct re_fail_stack_ent_t, fs->alloc); 1450 prev_idx_match = re_malloc (regmatch_ [all...] |
H A D | regcomp.c | 483 preg->fastmap = re_malloc (char, SBC_MAX); 776 dfa->re_str = re_malloc (char, length + 1); 850 dfa->nodes = re_malloc (re_token_t, dfa->nodes_alloc); 1159 dfa->nexts = re_malloc (int, dfa->nodes_alloc); 1160 dfa->org_indices = re_malloc (int, dfa->nodes_alloc); 1161 dfa->edests = re_malloc (re_node_set, dfa->nodes_alloc); 1162 dfa->eclosures = re_malloc (re_node_set, dfa->nodes_alloc); 1167 dfa->subexp_map = re_malloc (int, preg->re_nsub); 1203 dfa->inveclosures = re_malloc (re_node_set, dfa->nodes_len); 3754 bin_tree_storage_t *storage = re_malloc (bin_tree_storage_ [all...] |
H A D | regex_internal.h | 437 #define re_malloc(t,n) ((t *) malloc ((n) * sizeof (t))) macro
|
Completed in 117 milliseconds