Home
last modified time | relevance | path

Searched defs:node (Results 1 – 4 of 4) sorted by relevance

/posix/
A Dregcomp.c1085 Idx node; in optimize_utf8() local
1229 bin_tree_t *node, *prev; in postorder() local
1261 bin_tree_t *node; in preorder() local
1291 optimize_subexps (void *extra, bin_tree_t *node) in optimize_subexps()
1322 lower_subexps (void *extra, bin_tree_t *node) in lower_subexps()
1382 calc_first (void *extra, bin_tree_t *node) in calc_first()
1404 calc_next (void *extra, bin_tree_t *node) in calc_next()
1427 link_nfa_nodes (void *extra, bin_tree_t *node) in link_nfa_nodes()
3870 free_token (re_token_t *node) in free_token()
3885 free_tree (void *extra, bin_tree_t *node) in free_tree()
[all …]
A Dregexec.c1214 Idx *pidx, Idx node, re_node_set *eps_via_nodes, in proceed_next_node()
1556 #define STATE_NODE_CONTAINS(state,node) \ argument
1895 Idx node = eclosures->elems[node_idx]; in check_dst_limits_calc_pos_1() local
2017 Idx node = dest_nodes->elems[node_idx]; in check_subexp_limits() local
2041 Idx node = dest_nodes->elems[node_idx]; in check_subexp_limits() local
2061 Idx node = dest_nodes->elems[node_idx]; in check_subexp_limits() local
2087 Idx node_idx, node; in sift_states_bkref() local
2391 Idx node = cur_nodes->elems[node_idx]; in check_subexp_matching_top() local
2530 const re_token_t *node = dfa->nodes + node_idx; in transit_state_bkref() local
2818 const re_token_t *node = dfa->nodes + cls_node; in find_subexp_node() local
[all …]
A Dregex_internal.c1650 re_token_t *node = dfa->nodes + nodes->elems[i]; in create_ci_newstate() local
1702 re_token_t *node = dfa->nodes + nodes->elems[i]; in create_cd_newstate() local
A Dregex_internal.h562 Idx node; member
574 Idx node; member
583 Idx node; member
626 Idx node; member

Completed in 24 milliseconds