Home
last modified time | relevance | path

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

/posix/
A Dregcomp.c597 if (dfa->edests != NULL) in free_dfa_content()
598 re_node_set_free (dfa->edests + i); in free_dfa_content()
600 re_free (dfa->edests); in free_dfa_content()
1503 re_node_set_empty (dfa->edests + clone_node); in duplicate_node_closure()
1512 else if (dfa->edests[org_node].nelem == 0) in duplicate_node_closure()
1520 else if (dfa->edests[org_node].nelem == 1) in duplicate_node_closure()
1524 org_dest = dfa->edests[org_node].elems[0]; in duplicate_node_closure()
1548 org_dest = dfa->edests[org_node].elems[0]; in duplicate_node_closure()
1576 org_dest = dfa->edests[org_node].elems[1]; in duplicate_node_closure()
1713 && dfa->edests[node].nelem in calc_eclosure_iter()
[all …]
A Dregexec.c1221 re_node_set *edests = &dfa->edests[node]; in proceed_next_node() local
1232 for (Idx i = 0; i < edests->nelem; i++) in proceed_next_node()
1234 Idx candidate = edests->elems[i]; in proceed_next_node()
1297 dest_node = dfa->edests[node].elems[0]; in proceed_next_node()
1818 ? dfa->edests[cur_node].elems[1] : -1); in sub_epsilon_src_nodes()
1921 dst = dfa->edests[node].elems[0]; in check_dst_limits_calc_pos_1()
2124 : dfa->edests[node].elems[0]); in sift_states_bkref()
3150 if (dfa->edests[cur_node].nelem == 0) in check_arrival_expand_ecl_sub()
3152 if (dfa->edests[cur_node].nelem == 2) in check_arrival_expand_ecl_sub()
3156 dfa->edests[cur_node].elems[1], in check_arrival_expand_ecl_sub()
[all …]
A Dregex_internal.c1435 new_edests = re_realloc (dfa->edests, re_node_set, new_nodes_alloc); in re_dfa_add_node()
1448 dfa->edests = new_edests; in re_dfa_add_node()
1460 re_node_set_init_empty (dfa->edests + dfa->nodes_len); in re_dfa_add_node()
A Dregex_internal.h645 re_node_set *edests; member

Completed in 26 milliseconds