Lines Matching refs:min
57 #undef min
95 /* Min and max values for the common repeats; for the maxima, 0 => infinity */
561 #define min frame->Xmin
615 int min;
2289 min = rep_min[c]; /* Pick up values from tables; */
2297 min = GET2(ecode, 1);
2322 for (i = 1; i <= min; i++)
2332 /* If min = max, continue at the same level without recursion.
2335 if (min == max) continue;
2341 for (fi = min;; fi++)
2361 for (i = min; i < max; i++)
2408 min = rep_min[c]; /* Pick up values from tables; */
2416 min = GET2(ecode, 1);
2423 min = max = 1;
2433 for (i = 1; i <= min; i++)
2455 for (i = 1; i <= min; i++)
2467 /* If max == min we can continue with the main loop without the
2470 if (min == max) continue;
2481 for (fi = min;; fi++)
2506 for (fi = min;; fi++)
2533 for (i = min; i < max; i++)
2564 for (i = min; i < max; i++)
2609 min = rep_min[c]; /* Pick up values from tables; */
2617 min = GET2(ecode, 1);
2624 min = max = 1;
2630 for (i = 1; i <= min; i++)
2641 /* If max == min we can continue with the main loop without the
2644 if (min == max) continue;
2651 for (fi = min;; fi++)
2672 for (i = min; i < max; i++)
2791 min = max = GET2(ecode, 1);
2801 min = 0;
2809 min = 0;
2816 min = 1;
2823 min = 0;
2837 min = rep_min[c]; /* Pick up values from tables; */
2865 for (i = 1; i <= min; i++)
2881 if (min == max) continue;
2885 for (fi = min;; fi++)
2909 for (i = min; i < max; i++)
2957 common. First, ensure the minimum number of matches are present. If min =
2963 DPRINTF(("matching %c{%d,%d} against subject %.*s\n", fc, min, max,
2969 for (i = 1; i <= min; i++)
2978 if (min == max) continue;
2981 for (fi = min;; fi++)
2998 for (i = min; i < max; i++)
3026 for (i = 1; i <= min; i++)
3036 if (min == max) continue;
3040 for (fi = min;; fi++)
3057 for (i = min; i < max; i++)
3113 min = max = GET2(ecode, 1);
3119 min = 0;
3127 min = 0;
3134 min = 1;
3141 min = 0;
3148 min = 0;
3161 min = rep_min[c]; /* Pick up values from tables; */
3172 minimum number of matches are present. If min = max, continue at the same
3178 DPRINTF(("negative matching %c{%d,%d} against subject %.*s\n", fc, min, max,
3190 for (i = 1; i <= min; i++)
3207 for (i = 1; i <= min; i++)
3218 if (min == max) continue;
3227 for (fi = min;; fi++)
3246 for (fi = min;; fi++)
3273 for (i = min; i < max; i++)
3299 for (i = min; i < max; i++)
3332 for (i = 1; i <= min; i++)
3347 for (i = 1; i <= min; i++)
3358 if (min == max) continue;
3367 for (fi = min;; fi++)
3385 for (fi = min;; fi++)
3412 for (i = min; i < max; i++)
3437 for (i = min; i < max; i++)
3466 min = max = GET2(ecode, 1);
3473 min = 0;
3481 min = 0;
3488 min = 1;
3495 min = 0;
3502 min = 0;
3515 min = rep_min[c]; /* Pick up values from tables; */
3542 if (min > 0)
3551 for (i = 1; i <= min; i++)
3563 for (i = 1; i <= min; i++)
3580 for (i = 1; i <= min; i++)
3595 for (i = 1; i <= min; i++)
3610 for (i = 1; i <= min; i++)
3625 for (i = 1; i <= min; i++)
3641 for (i = 1; i <= min; i++)
3658 for (i = 1; i <= min; i++)
3675 for (i = 1; i <= min; i++)
3703 for (i = 1; i <= min; i++)
3734 for (i = 1; i <= min; i++)
3748 for (i = 1; i <= min; i++)
3761 if (eptr > md->end_subject - min) MRRETURN(MATCH_NOMATCH);
3762 eptr += min;
3766 for (i = 1; i <= min; i++)
3796 for (i = 1; i <= min; i++)
3832 for (i = 1; i <= min; i++)
3868 for (i = 1; i <= min; i++)
3892 for (i = 1; i <= min; i++)
3916 for (i = 1; i <= min; i++)
3930 for (i = 1; i <= min; i++)
3944 for (i = 1; i <= min; i++)
3958 for (i = 1; i <= min; i++)
3972 for (i = 1; i <= min; i++)
3986 for (i = 1; i <= min; i++)
4012 for (i = 1; i <= min; i++)
4025 if (eptr > md->end_subject - min)
4030 eptr += min;
4034 if (eptr > md->end_subject - min)
4039 eptr += min;
4043 for (i = 1; i <= min; i++)
4069 for (i = 1; i <= min; i++)
4088 for (i = 1; i <= min; i++)
4107 for (i = 1; i <= min; i++)
4128 for (i = 1; i <= min; i++)
4149 for (i = 1; i <= min; i++)
4161 for (i = 1; i <= min; i++)
4173 for (i = 1; i <= min; i++)
4185 for (i = 1; i <= min; i++)
4197 for (i = 1; i <= min; i++)
4210 for (i = 1; i <= min; i++)
4227 /* If min = max, continue at the same level without recursing */
4229 if (min == max) continue;
4243 for (fi = min;; fi++)
4259 for (fi = min;; fi++)
4279 for (fi = min;; fi++)
4297 for (fi = min;; fi++)
4315 for (fi = min;; fi++)
4333 for (fi = min;; fi++)
4352 for (fi = min;; fi++)
4372 for (fi = min;; fi++)
4392 min;; fi++)
4424 for (fi = min;; fi++)
4456 for (fi = min;; fi++)
4619 for (fi = min;; fi++)
4752 for (i = min; i < max; i++)
4767 for (i = min; i < max; i++)
4786 for (i = min; i < max; i++)
4803 for (i = min; i < max; i++)
4820 for (i = min; i < max; i++)
4837 for (i = min; i < max; i++)
4855 for (i = min; i < max; i++)
4874 for (i = min; i < max; i++)
4893 for (i = min; i < max; i++)
4931 for (i = min; i < max; i++)
4991 for (i = min; i < max; i++)
5008 for (i = min; i < max; i++)
5025 for (i = min; i < max; i++)
5042 c = max - min;
5052 for (i = min; i < max; i++)
5080 for (i = min; i < max; i++)
5122 for (i = min; i < max; i++)
5151 for (i = min; i < max; i++)
5166 for (i = min; i < max; i++)
5181 for (i = min; i < max; i++)
5196 for (i = min; i < max; i++)
5211 for (i = min; i < max; i++)
5226 for (i = min; i < max; i++)
5263 for (i = min; i < max; i++)
5277 c = max - min;
5287 for (i = min; i < max; i++)
5312 for (i = min; i < max; i++)
5326 for (i = min; i < max; i++)
5340 for (i = min; i < max; i++)
5355 for (i = min; i < max; i++)
5370 for (i = min; i < max; i++)
5383 for (i = min; i < max; i++)
5396 for (i = min; i < max; i++)
5409 for (i = min; i < max; i++)
5422 for (i = min; i < max; i++)
5435 for (i = min; i < max; i++)
5549 #undef min
