Lines Matching refs:re_len

285 static int set_len(const char *re, int re_len) {
288 while (len < re_len && re[len] != ']') {
292 return len <= re_len ? len + 1 : -1;
295 static int get_op_len(const char *re, int re_len) {
296 return re[0] == '[' ? set_len(re + 1, re_len - 1) + 1 : op_len(re);
359 static int match_set(const char *re, int re_len, const char *s,
363 if (invert) re++, re_len--;
365 while (len <= re_len && re[len] != ']' && result <= 0) {
383 static int bar(const char *re, int re_len, const char *s, int s_len,
388 for (i = j = 0; i < re_len && j <= s_len; i += step) {
392 get_op_len(re + i, re_len - i);
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));
400 if (i + step < re_len && is_quantifier(re + i + step)) {
412 if (ni < re_len && re[ni] == '?') {
423 if (ni >= re_len) {
426 } else if ((n2 = bar(re + ni, re_len - ni, s + j2,
439 (n2 = bar(re + ni, re_len - ni, s + j, s_len - j, info, bi)) > 0) {
443 DBG(("STAR/PLUS END: %d %d %d %d %d\n", j, nj, re_len - ni, n1, n2));
448 FAIL_IF(nj == j && ni < re_len && n2 < 0, SLRE_NO_MATCH);
457 n = match_set(re + i + 1, re_len - (i + 2), s + j, info);
468 if (re_len - (i + step) <= 0) {
475 bar(re + i + step, re_len - (i + step),
565 static int foo(const char *re, int re_len, const char *s, int s_len,
571 info->brackets[0].len = re_len;
575 for (i = 0; i < re_len; i += step) {
576 step = get_op_len(re + i, re_len - i);
587 FAIL_IF(i >= re_len - 1, SLRE_INVALID_METACHARACTER);
590 FAIL_IF(re[i + 1] == 'x' && i >= re_len - 3,