/haiku-fatelf/src/bin/gawk/ |
H A D | regex_internal.c | 565 set->elems = re_malloc (int, size); 566 if (BE (set->elems == NULL, 0)) 578 set->elems = re_malloc (int, 1); 579 if (BE (set->elems == NULL, 0)) 584 set->elems[0] = elem; 594 set->elems = re_malloc (int, 2); 595 if (BE (set->elems == NULL, 0)) 600 set->elems[0] = elem1; 607 set->elems[0] = elem1; 608 set->elems[ [all...] |
H A D | regexec.c | 1113 if (check_halt_node_context (dfa, state->nodes.elems[i], context)) 1114 return state->nodes.elems[i]; 1145 int candidate = dfa->edests[node].elems[i]; 1193 dest_node = dfa->edests[node].elems[0]; 1462 int prev_node = cur_src->elems[i]; 1639 + src_copy.elems[src_idx]); 1664 int cur_node = inv_eclosure->elems[ecl_idx]; 1669 int edst1 = dfa->edests[cur_node].elems[0]; 1671 ? dfa->edests[cur_node].elems[1] : -1); 1690 int cur_node = inv_eclosure->elems[ecl_id [all...] |
H A D | eval.c | 38 static void push_forloop P((const char *varname, NODE **elems, size_t nelems)); 1390 NODE **elems; /* list of indices */ member in struct:loop_info 1410 unref(loop->elems[i]); 1412 free(loop->elems); 1414 loop->elems = NULL; 1431 push_forloop(const char *varname, NODE **elems, size_t nelems) argument 1447 loop_stack[nloops_active].elems = elems;
|
H A D | regex_internal.h | 175 int *elems; member in struct:__anon3535 637 #define re_node_set_free(set) re_free ((set)->elems)
|
H A D | regcomp.c | 324 int node = init_state->nodes.elems[node_cnt]; 863 int node_idx = init_nodes.elems[i]; 872 clexp_node = dfa->nodes + init_nodes.elems[clexp_idx]; 882 int dest_idx = dfa->edests[node_idx].elems[0]; 1206 org_dest = dfa->edests[org_node].elems[0]; 1235 org_dest = dfa->edests[org_node].elems[0]; 1262 org_dest = dfa->edests[org_node].elems[1]; 1335 dest = dfa->eclosures[src].elems[idx]; 1410 if (constraint && !dfa->nodes[dfa->edests[node].elems[0]].duplicated) 1424 int edest = dfa->edests[node].elems[ [all...] |
/haiku-fatelf/src/bin/coreutils/lib/ |
H A D | regex_internal.c | 979 set->elems = re_malloc (Idx, size); 980 if (BE (set->elems == NULL, 0)) 991 set->elems = re_malloc (Idx, 1); 992 if (BE (set->elems == NULL, 0)) 997 set->elems[0] = elem; 1006 set->elems = re_malloc (Idx, 2); 1007 if (BE (set->elems == NULL, 0)) 1012 set->elems[0] = elem1; 1019 set->elems[0] = elem1; 1020 set->elems[ [all...] |
H A D | regexec.c | 1289 if (check_halt_node_context (mctx->dfa, state->nodes.elems[i], context)) 1290 return state->nodes.elems[i]; 1320 Idx candidate = edests->elems[i]; 1378 dest_node = dfa->edests[node].elems[0]; 1720 Idx prev_node = cur_src->elems[i]; 1883 dfa->inveclosures + dest_nodes->elems[i]); 1901 Idx cur_node = inv_eclosure->elems[ecl_idx]; 1906 Idx edst1 = dfa->edests[cur_node].elems[0]; 1908 ? dfa->edests[cur_node].elems[1] : REG_MISSING); 1927 Idx cur_node = inv_eclosure->elems[ecl_id [all...] |
H A D | regex_internal.h | 229 Idx *elems; member in struct:__anon3326 712 #define re_node_set_free(set) re_free ((set)->elems)
|
H A D | regcomp.c | 323 Idx node = init_state->nodes.elems[node_cnt]; 1012 Idx node_idx = init_nodes.elems[i]; 1021 clexp_node = dfa->nodes + init_nodes.elems[clexp_idx]; 1031 Idx dest_idx = dfa->edests[node_idx].elems[0]; 1516 org_dest = dfa->edests[org_node].elems[0]; 1540 org_dest = dfa->edests[org_node].elems[0]; 1568 org_dest = dfa->edests[org_node].elems[1]; 1629 Idx *elems = dfa->eclosures[src].elems; 1632 ok = re_node_set_insert_last (dfa->inveclosures + elems[id 1622 Idx *elems = dfa->eclosures[src].elems; local [all...] |
/haiku-fatelf/src/bin/findutils/gnulib/lib/ |
H A D | regex_internal.c | 974 set->elems = re_malloc (Idx, size); 975 if (BE (set->elems == NULL, 0)) 986 set->elems = re_malloc (Idx, 1); 987 if (BE (set->elems == NULL, 0)) 992 set->elems[0] = elem; 1001 set->elems = re_malloc (Idx, 2); 1002 if (BE (set->elems == NULL, 0)) 1007 set->elems[0] = elem1; 1014 set->elems[0] = elem1; 1015 set->elems[ [all...] |
H A D | regexec.c | 1272 if (check_halt_node_context (mctx->dfa, state->nodes.elems[i], context)) 1273 return state->nodes.elems[i]; 1303 Idx candidate = edests->elems[i]; 1361 dest_node = dfa->edests[node].elems[0]; 1703 Idx prev_node = cur_src->elems[i]; 1866 dfa->inveclosures + dest_nodes->elems[i]); 1884 Idx cur_node = inv_eclosure->elems[ecl_idx]; 1889 Idx edst1 = dfa->edests[cur_node].elems[0]; 1891 ? dfa->edests[cur_node].elems[1] : REG_MISSING); 1910 Idx cur_node = inv_eclosure->elems[ecl_id [all...] |
H A D | regex_internal.h | 229 Idx *elems; member in struct:__anon3500 712 #define re_node_set_free(set) re_free ((set)->elems)
|
H A D | regcomp.c | 317 Idx node = init_state->nodes.elems[node_cnt]; 981 Idx node_idx = init_nodes.elems[i]; 990 clexp_node = dfa->nodes + init_nodes.elems[clexp_idx]; 1000 Idx dest_idx = dfa->edests[node_idx].elems[0]; 1481 org_dest = dfa->edests[org_node].elems[0]; 1509 org_dest = dfa->edests[org_node].elems[0]; 1537 org_dest = dfa->edests[org_node].elems[1]; 1599 Idx *elems = dfa->eclosures[src].elems; 1602 ok = re_node_set_insert_last (dfa->inveclosures + elems[id 1592 Idx *elems = dfa->eclosures[src].elems; local [all...] |
/haiku-fatelf/src/system/libroot/posix/glibc/regex/ |
H A D | regex_internal.c | 961 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 D | regexec.c | 1237 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 D | regex_internal.h | 187 int *elems; member in struct:__anon5495 666 #define re_node_set_free(set) re_free ((set)->elems)
|
H A D | regcomp.c | 313 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-fatelf/src/tools/docbook/libxslt/libxslt/ |
H A D | variables.h | 75 xsltStackElemPtr elems);
|
H A D | variables.c | 394 * @elems: a stack element list 401 xsltAddStackElemList(xsltTransformContextPtr ctxt, xsltStackElemPtr elems) { argument 404 if ((ctxt == NULL) || (elems == NULL)) 412 cur->next = elems; 414 elems->next = ctxt->varsTab[ctxt->varsNr - 1]; 415 ctxt->varsTab[ctxt->varsNr - 1] = elems; 416 ctxt->vars = elems;
|
/haiku-fatelf/src/tests/kits/midi/synth_file_reader/ |
H A D | SynthFileReader.cpp | 278 uint16 elems; local 279 Read(elems); 282 printf("elems = %ld\n", elems); 284 if (elems > 0 || rest >= 16) { 285 Dump(elems * 8 + 21); printf("\n"); 287 rest -= elems * 8 + 21;
|
/haiku-fatelf/src/bin/gzip/ |
H A D | trees.c | 202 int elems; /* max number of elements in the tree */ member in struct:tree_desc 614 int elems = desc->elems; local 617 int node = elems; /* next internal node of the tree */ 625 for (n = 0; n < elems; n++) {
|
/haiku-fatelf/src/bin/zip/ |
H A D | trees.c | 255 int elems; /* max number of elements in the tree */ member in struct:tree_desc 761 int elems = desc->elems; local 764 int node = elems; /* next internal node of the tree */ 772 for (n = 0; n < elems; n++) {
|
/haiku-fatelf/src/libs/pdflib/libs/flate/ |
H A D | trees.c | 126 int elems; /* max number of elements in the tree */ member in struct:static_tree_desc_s 627 int elems = desc->stat_desc->elems; local 638 for (n = 0; n < elems; n++) { 669 node = elems; /* next internal node of the tree */
|
/haiku-fatelf/src/libs/zlib/ |
H A D | trees.c | 126 int elems; /* max number of elements in the tree */ member in struct:static_tree_desc_s 629 int elems = desc->stat_desc->elems; local 640 for (n = 0; n < elems; n++) { 671 node = elems; /* next internal node of the tree */
|