Lines Matching defs:ln
955 STRLEN ln;
1014 ln = STR_LEN(c); /* length to match in octets/bytes */
1015 lnc = (I32) ln; /* length to match in characters */
1030 while (sm < ((U8 *) m + ln)) {
1042 ln = STR_LEN(c);
1043 lnc = (I32) ln;
1077 && (ln == len ||
1079 m, (char **)0, ln, (bool)UTF))
1087 && (ln == foldlen ||
1091 (char **)0, ln, (bool)UTF))
1116 && (ln == len ||
1118 m, (char **)0, ln, (bool)UTF))
1126 && (ln == foldlen ||
1130 (char **)0, ln, (bool)UTF))
1142 && (ln == 1 || !(OP(c) == EXACTF
1143 ? ibcmp(s, m, ln)
1144 : ibcmp_locale(s, m, ln)))
1152 && (ln == 1 || !(OP(c) == EXACTF
1153 ? ibcmp(s, m, ln)
1154 : ibcmp_locale(s, m, ln)))
2258 register I32 ln = 0; /* len or last */
2428 ln = STR_LEN(scan);
2432 char *e = s + ln;
2471 if (PL_regeol - locinput < ln)
2473 if (ln > 1 && memNE(s, locinput, ln))
2475 locinput += ln;
2483 ln = STR_LEN(scan);
2490 if (ibcmp_utf8(s, 0, ln, (bool)UTF,
2498 ln >= 2 &&
2517 if (PL_regeol - locinput < ln)
2519 if (ln > 1 && (OP(scan) == EXACTF
2520 ? ibcmp(s, locinput, ln)
2521 : ibcmp_locale(s, locinput, ln)))
2523 locinput += ln;
2614 ln = '\n';
2618 ln = utf8n_to_uvchr(r, UTF8SKIP(r), 0, 0);
2621 ln = isALNUM_uni(ln);
2626 ln = isALNUM_LC_uvchr(UNI_TO_NATIVE(ln));
2631 ln = (locinput != PL_bostr) ?
2634 ln = isALNUM(ln);
2638 ln = isALNUM_LC(ln);
2642 if (((!ln) == (!n)) == (OP(scan) == BOUND ||
2770 ln = PL_regstartp[n];
2772 if ((I32)*PL_reglastparen < n || ln == -1)
2774 if (ln == PL_regendp[n])
2777 s = PL_bostr + ln;
2812 ln = PL_regendp[n] - ln;
2813 if (locinput + ln > PL_regeol)
2815 if (ln > 1 && (OP(scan) == REF
2816 ? memNE(s, locinput, ln)
2818 ? ibcmp(s, locinput, ln)
2819 : ibcmp_locale(s, locinput, ln))))
2821 locinput += ln;
3141 ln = PL_regcc->cur;
3150 PL_regcc->cur = ln;
3220 ln = PL_regcc->cur;
3230 PL_regcc->cur = ln;
3297 ln = PL_regcc->cur;
3301 PL_regcc->cur = ln;
3360 ln = ARG1(scan); /* min to match */
3375 if (ln && regrepeat_hard(scan, ln, &l) < ln)
3381 XXXX if ln == 0, we can redo this check first time
3384 if (ln && l == 0)
3385 n = ln; /* don't backtrack */
3412 while (n >= ln || (n == REG_INFTY && ln > 0 && l)) { /* ln overflow ? */
3419 if (ln) {
3434 ln++;
3448 if (n != 0 && l == 0 && !(paren && ln == 0))
3449 ln = n; /* don't backtrack */
3457 if (n >= ln) {
3484 while (n >= ln) {
3522 ln = ARG1(scan); /* min to match */
3528 ln = ARG1(scan); /* min to match */
3533 ln = 0;
3539 ln = 1;
3607 if (ln && regrepeat(scan, ln) < ln)
3623 int m = n - ln;
3629 e = locinput + n - ln;
3680 ln = 1; /* Did some */
3685 TRYPAREN(paren, ln, locinput);
3698 while (n >= ln || (n == REG_INFTY && ln > 0)) { /* ln overflow ? */
3711 TRYPAREN(paren, ln, PL_reginput);
3718 TRYPAREN(paren, ln, PL_reginput);
3724 ln++;
3735 if (ln < n && PL_regkind[(U8)OP(next)] == EOL &&
3739 ln = n; /* why back off? */
3744 ln--;
3749 while (n >= ln) {
3772 while (n >= ln) {