Home
last modified time | relevance | path

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

/l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/regex/
A Dregex_internal.c986 if (src1->elems[i1] == src2->elems[i2]) in re_node_set_add_intersect()
1023 if (dest->elems[is] > dest->elems[id]) in re_node_set_add_intersect()
1072 if (src1->elems[i1] > src2->elems[i2]) in re_node_set_init_union()
1074 dest->elems[id++] = src2->elems[i2++]; in re_node_set_init_union()
1077 if (src1->elems[i1] == src2->elems[i2]) in re_node_set_init_union()
1079 dest->elems[id++] = src1->elems[i1++]; in re_node_set_init_union()
1129 if (dest->elems[id] == src->elems[is]) in re_node_set_merge()
1155 if (dest->elems[is] > dest->elems[id]) in re_node_set_merge()
1221 set->elems[idx] = set->elems[idx - 1]; in re_node_set_insert()
1270 if (set1->elems[i] != set2->elems[i]) in internal_function()
[all …]
A Dregexec.c1152 return state->nodes.elems[i]; in check_halt_state_context()
1180 int candidate = edests->elems[i]; in proceed_next_node()
1580 int prev_node = cur_src->elems[i]; in build_sifted_states()
1768 ? dfa->edests[cur_node].elems[1] : -1); in sub_epsilon_src_nodes()
1872 dst = dfa->edests[node].elems[0]; in check_dst_limits_calc_pos_1()
1994 int node = dest_nodes->elems[node_idx]; in check_subexp_limits()
2054 node = candidates->elems[node_idx]; in sift_states_bkref()
2077 : dfa->edests[node].elems[0]); in sift_states_bkref()
2486 int node_idx = nodes->elems[i]; in transit_state_bkref()
2774 int cls_node = nodes->elems[cls_idx]; in find_subexp_node()
[all …]
A Dregcomp.c298 int node = init_state->nodes.elems[node_cnt]; in re_compile_fastmap_iter()
945 int node_idx = init_nodes.elems[i]; in create_initial_state()
954 clexp_node = dfa->nodes + init_nodes.elems[clexp_idx]; in create_initial_state()
964 int dest_idx = dfa->edests[node_idx].elems[0]; in create_initial_state()
1432 org_dest = dfa->edests[org_node].elems[0]; in duplicate_node_closure()
1461 org_dest = dfa->edests[org_node].elems[0]; in duplicate_node_closure()
1489 org_dest = dfa->edests[org_node].elems[1]; in duplicate_node_closure()
1550 int *elems = dfa->eclosures[src].elems; in calc_inveclosure() local
1553 ret = re_node_set_insert_last (dfa->inveclosures + elems[idx], src); in calc_inveclosure()
1630 && !dfa->nodes[dfa->edests[node].elems[0]].duplicated) in calc_eclosure_iter()
[all …]
A Dregex_internal.h141 int *elems; member
604 #define re_node_set_free(set) re_free ((set)->elems)
/l4re-core-master/cxx/lib/ipc/include/
A Dipc_stream405 unsigned long get(T *buf, unsigned long elems)
407 if (L4_UNLIKELY(!has_more<T>(elems)))
410 unsigned long size = elems * sizeof(T);
415 return elems;
422 * \param elems Number of elements to skip.
425 void skip(unsigned long elems)
427 if (L4_UNLIKELY(!has_more<T>(elems)))
430 unsigned long size = elems * sizeof(T);
452 if (L4_UNLIKELY(!has_more<T>(elems)))
455 unsigned long size = elems * sizeof(T);
[all …]

Completed in 21 milliseconds