Home
last modified time | relevance | path

Searched refs:re_malloc (Results 1 – 4 of 4) sorted by relevance

/l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/regex/
A Dregex_internal.c395 pstr->offsets = re_malloc (int, pstr->bufs_len); in build_wcs_upper_buffer()
879 set->elems = re_malloc (int, size); /* can be NULL if size == 0 in re_node_set_alloc()
892 set->elems = re_malloc (int, 1); in re_node_set_init_1()
907 set->elems = re_malloc (int, 2); in re_node_set_init_2()
940 dest->elems = re_malloc (int, dest->alloc); in re_node_set_init_copy()
1057 dest->elems = re_malloc (int, dest->alloc); in re_node_set_init_union()
1614 newstate->entrance_nodes = re_malloc (re_node_set, 1); in create_cd_newstate()
A Dregexec.c330 char *s = re_malloc (char, len); in libc_hidden_def()
404 pmatch = re_malloc (regmatch_t, nregs); in re_search_stub()
457 regs->start = re_malloc (regoff_t, need_regs); in re_copy_regs()
458 regs->end = re_malloc (regoff_t, need_regs); in re_copy_regs()
875 sifted_states = re_malloc (re_dfastate_t *, match_last + 1); in prune_impossible_nodes()
883 lim_states = re_malloc (re_dfastate_t *, match_last + 1); in prune_impossible_nodes()
1280 fs->stack[num].regs = re_malloc (regmatch_t, nregs); in push_fail_stack()
1328 fs->stack = re_malloc (struct re_fail_stack_ent_t, fs->alloc); in set_regs()
1342 prev_idx_match = re_malloc (regmatch_t, nmatch); in set_regs()
3246 dests_alloc = re_malloc (struct dests_alloc, 1); in build_trtable()
[all …]
A Dregcomp.c448 preg->fastmap = re_malloc (char, SBC_MAX); in regcomp()
737 dfa->re_str = re_malloc (char, length + 1); in re_compile_internal()
811 dfa->nodes = re_malloc (re_token_t, dfa->nodes_alloc); in init_dfa()
1080 dfa->nexts = re_malloc (int, dfa->nodes_alloc); in analyze()
1081 dfa->org_indices = re_malloc (int, dfa->nodes_alloc); in analyze()
1082 dfa->edests = re_malloc (re_node_set, dfa->nodes_alloc); in analyze()
1083 dfa->eclosures = re_malloc (re_node_set, dfa->nodes_alloc); in analyze()
1088 dfa->subexp_map = re_malloc (int, preg->re_nsub); in analyze()
1124 dfa->inveclosures = re_malloc (re_node_set, dfa->nodes_len); in analyze()
3670 bin_tree_storage_t *storage = re_malloc (bin_tree_storage_t, 1); in create_token_tree()
A Dregex_internal.h378 #define re_malloc(t,n) ((t *) malloc ((n) * sizeof (t))) macro

Completed in 20 milliseconds