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

/haiku/src/system/libroot/posix/glibc/regex/
H A Dregex_internal.c961 set->elems = re_malloc (int, size);
962 if (BE (set->elems == NULL, 0))
973 set->elems = re_malloc (int, 1);
974 if (BE (set->elems == NULL, 0))
979 set->elems[0] = elem;
988 set->elems = re_malloc (int, 2);
989 if (BE (set->elems == NULL, 0))
994 set->elems[0] = elem1;
1001 set->elems[0] = elem1;
1002 set->elems[
[all...]
H A Dregexec.c1237 if (check_halt_node_context (mctx->dfa, state->nodes.elems[i], context))
1238 return state->nodes.elems[i];
1266 int candidate = edests->elems[i];
1324 dest_node = dfa->edests[node].elems[0];
1666 int prev_node = cur_src->elems[i];
1829 dfa->inveclosures + dest_nodes->elems[i]);
1847 int cur_node = inv_eclosure->elems[ecl_idx];
1852 int edst1 = dfa->edests[cur_node].elems[0];
1854 ? dfa->edests[cur_node].elems[1] : -1);
1873 int cur_node = inv_eclosure->elems[ecl_id
[all...]
H A Dregex_internal.h187 int *elems; member in struct:__anon5494
666 #define re_node_set_free(set) re_free ((set)->elems)
H A Dregcomp.c313 int node = init_state->nodes.elems[node_cnt];
986 int node_idx = init_nodes.elems[i];
995 clexp_node = dfa->nodes + init_nodes.elems[clexp_idx];
1005 int dest_idx = dfa->edests[node_idx].elems[0];
1479 org_dest = dfa->edests[org_node].elems[0];
1503 org_dest = dfa->edests[org_node].elems[0];
1531 org_dest = dfa->edests[org_node].elems[1];
1591 int *elems = dfa->eclosures[src].elems;
1594 ret = re_node_set_insert_last (dfa->inveclosures + elems[id
1584 int *elems = dfa->eclosures[src].elems; local
[all...]
/haiku/src/tests/kits/midi/synth_file_reader/
H A DSynthFileReader.cpp278 uint16 elems; local
279 Read(elems);
282 printf("elems = %d\n", elems);
284 if (elems > 0 || rest >= 16) {
285 Dump(elems * 8 + 21); printf("\n");
287 rest -= elems * 8 + 21;

Completed in 158 milliseconds