Lines Matching defs:step
386 int i, j, n, step;
388 for (i = j = 0; i < re_len && j <= s_len; i += step) {
391 step = re[i] == '(' ? info->brackets[bi + 1].len + 2 :
394 DBG(("%s [%.*s] [%.*s] re_len=%d step=%d i=%d j=%d\n", __func__,
395 re_len - i, re + i, s_len - j, s + j, re_len, step, i, j));
398 FAIL_IF(step <= 0, SLRE_INVALID_CHARACTER_SET);
400 if (i + step < re_len && is_quantifier(re + i + step)) {
401 DBG(("QUANTIFIER: [%.*s]%c [%.*s]\n", step, re + i,
402 re[i + step], s_len - j, s + j));
403 if (re[i + step] == '?') {
404 int result = bar(re + i, step, s + j, s_len - j, info, bi);
407 } else if (re[i + step] == '+' || re[i + step] == '*') {
411 ni = i + step + 1;
418 if ((n1 = bar(re + i, step, s + j2, s_len - j2, info, bi)) > 0) {
421 if (re[i + step] == '+' && n1 < 0) break;
438 if (n1 < 0 && n2 < 0 && re[i + step] == '*' &&
444 FAIL_IF(re[i + step] == '+' && nj == j, SLRE_NO_MATCH);
458 DBG(("SET %.*s [%.*s] -> %d\n", step, re + i, s_len - j, s + j, n));
466 step, re + i, s_len - j, s + j, re + i + step));
468 if (re_len - (i + step) <= 0) {
475 bar(re + i + step, re_len - (i + step),
480 DBG(("CAPTURED [%.*s] [%.*s]:%d\n", step, re + i, s_len - j, s + j, n));
567 int i, step, depth = 0;
575 for (i = 0; i < re_len; i += step) {
576 step = get_op_len(re + i, re_len - i);
2171 * then both of these segments are removed. This step