| /haiku-fatelf/src/bin/coreutils/lib/ |
| H A D | regexec.c | 71 regmatch_t *prev_idx_match, Idx cur_node,
1454 Idx idx, cur_node;
1475 cur_node = dfa->init_node;
1494 update_regs (dfa, pmatch, prev_idx_match, cur_node, idx, nmatch);
1496 if (idx == pmatch[0].rm_eo && cur_node == mctx->last_node)
1511 cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,
1524 cur_node = proceed_next_node (mctx, nmatch, pmatch, &idx, cur_node,
1527 if (BE (! REG_VALID_INDEX (cur_node), 0))
1529 if (BE (cur_node
1451 Idx idx, cur_node; local
1571 update_regs(const re_dfa_t *dfa, regmatch_t *pmatch, regmatch_t *prev_idx_match, Idx cur_node, Idx cur_idx, Idx nmatch) argument
1898 Idx cur_node = inv_eclosure->elems[ecl_idx]; local
1924 Idx cur_node = inv_eclosure->elems[ecl_idx]; local
3106 Idx cur_node = cur_nodes->elems[cur_idx]; local
3190 Idx cur_node = cur_nodes->elems[idx]; local
3229 Idx cur_node; local
[all...] |
| /haiku-fatelf/src/bin/findutils/gnulib/lib/ |
| H A D | regexec.c | 66 regmatch_t *prev_idx_match, Idx cur_node,
1437 Idx idx, cur_node;
1458 cur_node = dfa->init_node;
1477 update_regs (dfa, pmatch, prev_idx_match, cur_node, idx, nmatch);
1479 if (idx == pmatch[0].rm_eo && cur_node == mctx->last_node)
1494 cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,
1507 cur_node = proceed_next_node (mctx, nmatch, pmatch, &idx, cur_node,
1510 if (BE (! REG_VALID_INDEX (cur_node), 0))
1512 if (BE (cur_node
1434 Idx idx, cur_node; local
1554 update_regs(const re_dfa_t *dfa, regmatch_t *pmatch, regmatch_t *prev_idx_match, Idx cur_node, Idx cur_idx, Idx nmatch) argument
1881 Idx cur_node = inv_eclosure->elems[ecl_idx]; local
1907 Idx cur_node = inv_eclosure->elems[ecl_idx]; local
3087 Idx cur_node = cur_nodes->elems[cur_idx]; local
3171 Idx cur_node = cur_nodes->elems[idx]; local
3210 Idx cur_node; local
[all...] |
| /haiku-fatelf/src/system/libroot/posix/glibc/regex/ |
| H A D | regexec.c | 63 regmatch_t *prev_idx_match, int cur_node,
1400 int idx, cur_node;
1421 cur_node = dfa->init_node;
1440 update_regs (dfa, pmatch, prev_idx_match, cur_node, idx, nmatch);
1442 if (idx == pmatch[0].rm_eo && cur_node == mctx->last_node)
1457 cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,
1470 cur_node = proceed_next_node (mctx, nmatch, pmatch, &idx, cur_node,
1473 if (BE (cur_node < 0, 0))
1475 if (BE (cur_node
1397 int idx, cur_node; local
1517 update_regs(const re_dfa_t *dfa, regmatch_t *pmatch, regmatch_t *prev_idx_match, int cur_node, int cur_idx, int nmatch) argument
1844 int cur_node = inv_eclosure->elems[ecl_idx]; local
1870 int cur_node = inv_eclosure->elems[ecl_idx]; local
3046 int cur_node = cur_nodes->elems[cur_idx]; local
3130 int cur_node = cur_nodes->elems[idx]; local
3169 int cur_node; local
[all...] |
| /haiku-fatelf/src/bin/gawk/ |
| H A D | regexec.c | 66 static void update_regs _RE_ARGS((re_dfa_t *dfa, regmatch_t *pmatch, int cur_node,
1274 int idx, cur_node, real_nmatch;
1292 cur_node = dfa->init_node;
1297 update_regs (dfa, pmatch, cur_node, idx, real_nmatch);
1298 if (idx == pmatch[0].rm_eo && cur_node == mctx->last_node)
1311 cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,
1322 cur_node = proceed_next_node (preg, nmatch, pmatch, mctx, &idx, cur_node,
1325 if (BE (cur_node < 0, 0))
1327 if (cur_node
1271 int idx, cur_node, real_nmatch; local
1661 int cur_node = inv_eclosure->elems[ecl_idx]; local
1687 int cur_node = inv_eclosure->elems[ecl_idx]; local
2235 int cur_node = state->nodes.elems[node_cnt]; local
2816 int cur_node = cur_nodes->elems[cur_idx]; local
2910 int cur_node = cur_nodes->elems[idx]; local
2950 int cur_node, type; local
[all...] |
| H A D | regcomp.c | 1412 int org_node, cur_node;
1413 org_node = cur_node = node;
1406 int org_node, cur_node; local
|
| /haiku-fatelf/src/tools/docbook/libxml2/ |
| H A D | xmlreader.c | 1644 xmlNodePtr node, cur_node; local
1653 for (cur_node = reader->node->children; cur_node != NULL;
1654 cur_node = cur_node->next) {
1655 node = xmlDocCopyNode(cur_node, doc, 1);
|