Lines Matching refs:min
178 int min;
197 int min;
750 ret->min = 0;
1003 fprintf(output, "%d-%d ", atom->min, atom->max);
1110 fprintf(output, " %d: min %d max %d\n", i, ctxt->counters[i].min,
1188 ctxt->counters[ctxt->nbCounters].min = -1;
1516 if (atom->min == 0) {
1526 ctxt->counters[counter].min = atom->min - 1;
1528 atom->min = 0;
1553 if ((atom->min == 0) && (atom->max == 0) &&
3034 if (!((atom->min == 0) && (atom->max > 0)))
3064 printf("testing count %d: val %d, min %d, max %d\n",
3065 trans->count, count, counter->min, counter->max);
3067 ret = ((count >= counter->min) && (count <= counter->max));
3068 if ((ret) && (counter->min != counter->max))
3077 if ((ret == 1) && (atom->min >= 0) && (atom->max > 0)) {
3114 if (exec->transcount >= atom->min) {
3132 if (exec->transcount < atom->min)
3154 } else if ((ret == 0) && (atom->min == 0) && (atom->max > 0)) {
3164 } else if ((atom->min == 0) && (atom->max > 0)) {
3640 if ((count >= counter->min) &&
3669 if ((count < counter->min) || (count > counter->max)) {
3685 printf("testing count %d: val %d, min %d, max %d\n",
3686 trans->count, count, counter->min, counter->max);
3688 ret = ((count >= counter->min) && (count <= counter->max));
3710 if ((ret == 1) && (atom->min > 0) && (atom->max > 0)) {
3744 if (exec->transcount >= atom->min) {
3763 if (exec->transcount < atom->min)
4241 printf("testing count %d: val %d, min %d, max %d\n",
4242 trans->count, count, counter->min, counter->max);
4244 ret = ((count >= counter->min) && (count <= counter->max));
4252 if ((ret == 1) && (atom->min > 0) && (atom->max > 0)) {
4277 if (exec->transcount >= atom->min) {
4295 if (exec->transcount < atom->min)
5026 int min = 0, max = 0;
5031 min = cur;
5051 max = min;
5054 ctxt->atom->min = min;
5250 fprintf(output, " %d: min %d max %d\n", i, regexp->counters[i].min,
5648 * @min: the minimum successive occurences of token
5655 * whose number is between @min and @max
5663 int min, int max, void *data) {
5669 if (min < 0)
5671 if ((max < min) || (max < 1))
5698 if (min == 0)
5699 atom->min = 1;
5701 atom->min = min;
5708 am->counters[counter].min = min;
5724 if (min == 0)
5735 * @min: the minimum successive occurences of token
5742 * is between @min and @max
5749 int min, int max, void *data) {
5755 if (min < 0)
5757 if ((max < min) || (max < 1))
5764 if (min == 0)
5765 atom->min = 1;
5767 atom->min = min;
5774 am->counters[counter].min = min;
5790 if (min == 0)
5802 * @min: the minimum successive occurences of token
5809 * number is between @min and @max, moreover that transition can only be
5818 int min, int max, void *data) {
5824 if (min < 1)
5826 if ((max < min) || (max < 1))
5854 atom->min = min;
5860 am->counters[counter].min = 1;
5882 * @min: the minimum successive occurences of token
5889 * is between @min and @max, moreover that transition can only be crossed
5897 int min, int max, void *data) {
5903 if (min < 1)
5905 if ((max < min) || (max < 1))
5913 atom->min = min;
5919 am->counters[counter].min = 1;
6003 * @min: the minimal value on the counter
6011 xmlAutomataNewCounter(xmlAutomataPtr am, int min, int max) {
6020 am->counters[ret].min = min;
6350 const xmlChar *name, int min, int max) {
6366 if (min == max) {
6367 if (min == 1) {
6370 if (min == 0) {
6375 if (min < 0) {
6380 kbase = min + 79;
6382 kbase = max - min;
6507 if ((insert->exp_min == min) && (insert->exp_max == max) &&
6532 entry->exp_min = min;
6535 if ((min == 0) || (IS_NILLABLE(left)))
6703 * @min: the lower bound for the repetition
6706 * Get the atom associated to the range (@subset){@min, @max}
6714 xmlExpNewRange(xmlExpCtxtPtr ctxt, xmlExpNodePtr subset, int min, int max) {
6717 if ((subset == NULL) || (min < 0) || (max < -1) ||
6718 ((max >= 0) && (min > max))) {
6723 NULL, NULL, min, max));
6935 int min, max;
6956 min = exp->exp_min - 1;
6958 min = 0;
6961 NULL, min, max);
7241 int min, max;
7258 min = sub->exp_min -1;
7260 min = 0;
7269 sub->exp_left, NULL, NULL, min, max);
7296 int min, max;
7323 min = 0;
7325 min = exp->exp_min - sub->exp_min * mult;
7340 min = exp->exp_min - sub->exp_min * mult;
7343 min = 0;
7354 min = 0;
7356 min = exp->exp_min - sub->exp_max * mult;
7377 min = 0;
7380 printf("Infinite loops min => Count(X,Inf)\n");
7383 min = exp->exp_min - sub->exp_min;
7387 printf("loops min mismatch 1 => forbidden ???\n");
7393 min = 0;
7402 min = exp->exp_min - sub->exp_min;
7405 min = 0;
7416 min = 0;
7418 min = exp->exp_min - sub->exp_max;
7427 NULL, NULL, min, max);
7445 min = exp->exp_min - 1;
7447 min = 0;
7458 NULL, NULL, min, max);
7705 int min, max;
7708 min = xmlExpParseNumber(ctxt);
7709 if (min < 0) {
7719 max = min;
7726 min, max);
7799 * - finite sequences { min, max }
7800 * - infinite sequences { min, * }