Cross Reference: /forgerock/web-agents-v4/pcre/pcre

Lines Matching refs:max
57 #undef max
108 /* Min and max values for the common repeats; for the maxima, 0 => infinity */
593 #define max                frame->Xmax
649 int max;
2748       max = rep_max[c];                 /* zero for max => infinity */
2749       if (max == 0) max = INT_MAX;
2756       max = GET2(ecode, 1 + IMM2_SIZE);
2757       if (max == 0) max = INT_MAX;
2797     /* If min = max, continue at the same level without recursion.
2800     if (min == max) continue;
2811         if (fi >= max) RRETURN(MATCH_NOMATCH);
2828       for (i = min; i < max; i++)
2892         max = rep_max[c];                 /* zero for max => infinity */
2893         if (max == 0) max = INT_MAX;
2902         max = GET2(ecode, 1 + IMM2_SIZE);
2903         if (max == 0) max = INT_MAX;
2908         min = max = 1;
2956       /* If max == min we can continue with the main loop without the
2959       if (min == max) continue;
2973             if (fi >= max) RRETURN(MATCH_NOMATCH);
2996             if (fi >= max) RRETURN(MATCH_NOMATCH);
3025           for (i = min; i < max; i++)
3057           for (i = min; i < max; i++)
3119         max = rep_max[c];                 /* zero for max => infinity */
3120         if (max == 0) max = INT_MAX;
3129         max = GET2(ecode, 1 + IMM2_SIZE);
3130         if (max == 0) max = INT_MAX;
3135         min = max = 1;
3152       /* If max == min we can continue with the main loop without the
3155       if (min == max) continue;
3166           if (fi >= max) RRETURN(MATCH_NOMATCH);
3183         for (i = min; i < max; i++)
3316     min = max = GET2(ecode, 1);
3330     max = GET2(ecode, 1);
3339     max = INT_MAX;
3347     max = INT_MAX;
3355     max = 1;
3374     max = rep_max[c];                 /* zero for max => infinity */
3375     if (max == 0) max = INT_MAX;
3432         if (min == max) continue;
3440             if (fi >= max) RRETURN(MATCH_NOMATCH);
3460           for (i = min; i < max; i++)
3506     max, continue at the same level without recursing. Otherwise, if
3511     DPRINTF(("matching %c{%d,%d} against subject %.*s\n", fc, min, max,
3512       max, (char *)eptr));
3545       if (min == max) continue;
3553           if (fi >= max) RRETURN(MATCH_NOMATCH);
3568         for (i = min; i < max; i++)
3606       if (min == max) continue;
3614           if (fi >= max) RRETURN(MATCH_NOMATCH);
3627         for (i = min; i < max; i++)
3707     min = max = GET2(ecode, 1);
3716     max = GET2(ecode, 1);
3725     max = INT_MAX;
3733     max = INT_MAX;
3741     max = 1;
3749     max = GET2(ecode, 1);
3768     max = rep_max[c];                 /* zero for max => infinity */
3769     if (max == 0) max = INT_MAX;
3778     minimum number of matches are present. If min = max, continue at the same
3784     DPRINTF(("negative matching %c{%d,%d} against subject %.*s\n", fc, min, max,
3785       max, (char *)eptr));
3832       if (min == max) continue;
3844             if (fi >= max) RRETURN(MATCH_NOMATCH);
3862             if (fi >= max) RRETURN(MATCH_NOMATCH);
3885           for (i = min; i < max; i++)
3911           for (i = min; i < max; i++)
3968       if (min == max) continue;
3980             if (fi >= max) RRETURN(MATCH_NOMATCH);
3998             if (fi >= max) RRETURN(MATCH_NOMATCH);
4020           for (i = min; i < max; i++)
4046           for (i = min; i < max; i++)
4075     min = max = GET2(ecode, 1);
4083     max = GET2(ecode, 1);
4091     max = INT_MAX;
4098     max = INT_MAX;
4105     max = 1;
4112     max = GET2(ecode, 1);
4125     max = rep_max[c];                 /* zero for max => infinity */
4126     if (max == 0) max = INT_MAX;
4870     /* If min = max, continue at the same level without recursing */
4872     if (min == max) continue;
4890             if (fi >= max) RRETURN(MATCH_NOMATCH);
4907             if (fi >= max) RRETURN(MATCH_NOMATCH);
4927             if (fi >= max) RRETURN(MATCH_NOMATCH);
4944             if (fi >= max) RRETURN(MATCH_NOMATCH);
4961             if (fi >= max) RRETURN(MATCH_NOMATCH);
4979             if (fi >= max) RRETURN(MATCH_NOMATCH);
5002             if (fi >= max) RRETURN(MATCH_NOMATCH);
5030             if (fi >= max) RRETURN(MATCH_NOMATCH);
5052             if (fi >= max) RRETURN(MATCH_NOMATCH);
5075             if (fi >= max) RRETURN(MATCH_NOMATCH);
5104           if (fi >= max) RRETURN(MATCH_NOMATCH);
5138           if (fi >= max) RRETURN(MATCH_NOMATCH);
5263           if (fi >= max) RRETURN(MATCH_NOMATCH);
5407           for (i = min; i < max; i++)
5422           for (i = min; i < max; i++)
5442           for (i = min; i < max; i++)
5457           for (i = min; i < max; i++)
5472           for (i = min; i < max; i++)
5487           for (i = min; i < max; i++)
5510           for (i = min; i < max; i++)
5537           for (i = min; i < max; i++)
5556           for (i = min; i < max; i++)
5580           for (i = min; i < max; i++)
5619         for (i = min; i < max; i++)
5695           for (i = min; i < max; i++)
5718           if (max < INT_MAX)
5720             for (i = min; i < max; i++)
5741           c = max - min;
5751           for (i = min; i < max; i++)
5782           for (i = min; i < max; i++)
5804           for (i = min; i < max; i++)
5825           for (i = min; i < max; i++)
5840           for (i = min; i < max; i++)
5855           for (i = min; i < max; i++)
5870           for (i = min; i < max; i++)
5885           for (i = min; i < max; i++)
5900           for (i = min; i < max; i++)
5937           for (i = min; i < max; i++)
5960           c = max - min;
5970           for (i = min; i < max; i++)
5997           for (i = min; i < max; i++)
6018           for (i = min; i < max; i++)
6039           for (i = min; i < max; i++)
6060           for (i = min; i < max; i++)
6081           for (i = min; i < max; i++)
6094           for (i = min; i < max; i++)
6107           for (i = min; i < max; i++)
6120           for (i = min; i < max; i++)
6133           for (i = min; i < max; i++)
6146           for (i = min; i < max; i++)
6259 #undef max