Home
last modified time | relevance | path

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

/posix/
A Dregex_internal.c1117 if (dest->elems[is] > dest->elems[id]) in re_node_set_add_intersect()
1167 if (src1->elems[i1] > src2->elems[i2]) in re_node_set_init_union()
1169 dest->elems[id++] = src2->elems[i2++]; in re_node_set_init_union()
1174 dest->elems[id++] = src1->elems[i1++]; in re_node_set_init_union()
1228 if (dest->elems[id] == src->elems[is]) in re_node_set_merge()
1231 dest->elems[--sbase] = src->elems[is--]; in re_node_set_merge()
1254 if (dest->elems[is] > dest->elems[id]) in re_node_set_merge()
1318 set->elems[idx] = set->elems[idx - 1]; in re_node_set_insert()
1323 set->elems[idx] = set->elems[idx - 1]; in re_node_set_insert()
1368 if (set1->elems[i] != set2->elems[i]) in re_node_set_compare()
[all …]
A Dregexec.c1202 return state->nodes.elems[i]; in check_halt_state_context()
1234 Idx candidate = edests->elems[i]; in proceed_next_node()
1632 Idx prev_node = cur_src->elems[i]; in build_sifted_states()
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()
2041 Idx node = dest_nodes->elems[node_idx]; in check_subexp_limits()
2101 node = candidates->elems[node_idx]; in sift_states_bkref()
2124 : dfa->edests[node].elems[0]); in sift_states_bkref()
2528 Idx node_idx = nodes->elems[i]; in transit_state_bkref()
2817 Idx cls_node = nodes->elems[cls_idx]; in find_subexp_node()
[all …]
A Dregcomp.c303 Idx node = init_state->nodes.elems[node_cnt]; in re_compile_fastmap_iter()
1018 Idx node_idx = init_nodes.elems[i]; in create_initial_state()
1027 clexp_node = dfa->nodes + init_nodes.elems[clexp_idx]; in create_initial_state()
1037 Idx dest_idx = dfa->edests[node_idx].elems[0]; in create_initial_state()
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()
1637 Idx *elems = dfa->eclosures[src].elems; in calc_inveclosure() local
1704 eclosure.elems[eclosure.nelem++] = node; in calc_eclosure_iter()
1714 && !dfa->nodes[dfa->edests[node].elems[0]].duplicated) in calc_eclosure_iter()
[all …]
A Dregex_internal.h236 Idx *elems; member
689 #define re_node_set_free(set) re_free ((set)->elems)

Completed in 24 milliseconds