Searched refs:subexp_idx (Results 1 - 4 of 4) sorted by relevance
/haiku-fatelf/src/bin/coreutils/lib/ |
H A D | regexec.c | 112 int boundaries, Idx subexp_idx, 116 Idx limit, Idx subexp_idx, 168 Idx subexp_idx, int type) internal_function; 1357 Idx subexp_idx = dfa->nodes[node].opr.idx + 1; 1358 naccepted = regs[subexp_idx].rm_eo - regs[subexp_idx].rm_so; 1361 if (regs[subexp_idx].rm_so == -1 || regs[subexp_idx].rm_eo == -1) 1366 if (memcmp (buf + regs[subexp_idx].rm_so, buf + *pidx, 1950 Idx subexp_idx; 1354 Idx subexp_idx = dfa->nodes[node].opr.idx + 1; local 1947 Idx subexp_idx; local 1973 check_dst_limits_calc_pos_1(const re_match_context_t *mctx, int boundaries, Idx subexp_idx, Idx from_node, Idx bkref_idx) argument 2055 check_dst_limits_calc_pos(const re_match_context_t *mctx, Idx limit, Idx subexp_idx, Idx from_node, Idx str_idx, Idx bkref_idx) argument 2094 Idx subexp_idx; local 2908 find_subexp_node(const re_dfa_t *dfa, const re_node_set *nodes, Idx subexp_idx, int type) argument [all...] |
/haiku-fatelf/src/bin/findutils/gnulib/lib/ |
H A D | regexec.c | 107 int boundaries, Idx subexp_idx, 111 Idx limit, Idx subexp_idx, 163 Idx subexp_idx, int type) internal_function; 1340 Idx subexp_idx = dfa->nodes[node].opr.idx + 1; 1341 naccepted = regs[subexp_idx].rm_eo - regs[subexp_idx].rm_so; 1344 if (regs[subexp_idx].rm_so == -1 || regs[subexp_idx].rm_eo == -1) 1349 if (memcmp (buf + regs[subexp_idx].rm_so, buf + *pidx, 1933 Idx subexp_idx; 1337 Idx subexp_idx = dfa->nodes[node].opr.idx + 1; local 1930 Idx subexp_idx; local 1956 check_dst_limits_calc_pos_1(const re_match_context_t *mctx, int boundaries, Idx subexp_idx, Idx from_node, Idx bkref_idx) argument 2038 check_dst_limits_calc_pos(const re_match_context_t *mctx, Idx limit, Idx subexp_idx, Idx from_node, Idx str_idx, Idx bkref_idx) argument 2077 Idx subexp_idx; local 2891 find_subexp_node(const re_dfa_t *dfa, const re_node_set *nodes, Idx subexp_idx, int type) argument [all...] |
/haiku-fatelf/src/system/libroot/posix/glibc/regex/ |
H A D | regexec.c | 104 int boundaries, int subexp_idx, 108 int limit, int subexp_idx, 160 int subexp_idx, int type) internal_function; 1303 int subexp_idx = dfa->nodes[node].opr.idx + 1; 1304 naccepted = regs[subexp_idx].rm_eo - regs[subexp_idx].rm_so; 1307 if (regs[subexp_idx].rm_so == -1 || regs[subexp_idx].rm_eo == -1) 1312 if (memcmp (buf + regs[subexp_idx].rm_so, buf + *pidx, 1896 int subexp_idx; 1300 int subexp_idx = dfa->nodes[node].opr.idx + 1; local 1893 int subexp_idx; local 1919 check_dst_limits_calc_pos_1(const re_match_context_t *mctx, int boundaries, int subexp_idx, int from_node, int bkref_idx) argument 2000 check_dst_limits_calc_pos(const re_match_context_t *mctx, int limit, int subexp_idx, int from_node, int str_idx, int bkref_idx) argument 2039 int subexp_idx; local 2851 find_subexp_node(const re_dfa_t *dfa, const re_node_set *nodes, int subexp_idx, int type) argument [all...] |
/haiku-fatelf/src/bin/gawk/ |
H A D | regexec.c | 109 int subexp_idx, int node, int str_idx)); 151 int subexp_idx, int fl_open)); 1173 int subexp_idx = dfa->nodes[node].opr.idx; 1174 naccepted = regs[subexp_idx].rm_eo - regs[subexp_idx].rm_so; 1177 if (regs[subexp_idx].rm_so == -1 || regs[subexp_idx].rm_eo == -1) 1182 if (memcmp (buf + regs[subexp_idx].rm_so, buf + *pidx, 1712 int subexp_idx; 1715 subexp_idx 1170 int subexp_idx = dfa->nodes[node].opr.idx; local 1709 int subexp_idx; local 1807 int subexp_idx; local [all...] |
Completed in 114 milliseconds