Lines Matching refs:max
185 int max;
205 int max;
788 ret->max = 0;
840 ret->max = atom->max;
1086 fprintf(output, "%d-%d ", atom->min, atom->max);
1193 fprintf(output, " %d: min %d max %d\n", i, ctxt->counters[i].min,
1194 ctxt->counters[i].max);
1272 ctxt->counters[ctxt->nbCounters].max = -1;
1620 copy->max = 0;
1628 ctxt->counters[counter].max = atom->max - 1;
1646 ctxt->counters[counter].max = atom->max - 1;
1660 atom->max = 0;
1669 if ((atom->min == 0) && (atom->max == 0) &&
3187 if (!((atom->min == 0) && (atom->max > 0)))
3217 printf("testing count %d: val %d, min %d, max %d\n",
3218 trans->count, count, counter->min, counter->max);
3220 ret = ((count >= counter->min) && (count <= counter->max));
3221 if ((ret) && (counter->min != counter->max))
3230 if ((ret == 1) && (atom->min >= 0) && (atom->max > 0)) {
3250 if (exec->counts[trans->counter] >= counter->max)
3266 if (exec->transcount == atom->max) {
3317 } else if ((ret == 0) && (atom->min == 0) && (atom->max > 0)) {
3327 } else if ((atom->min == 0) && (atom->max > 0)) {
3358 if (exec->counts[trans->counter] >= counter->max)
3805 if ((count < counter->max) &&
3812 (count < counter->max) &&
3840 if ((count < counter->min) || (count > counter->max)) {
3856 printf("testing count %d: val %d, min %d, max %d\n",
3857 trans->count, count, counter->min, counter->max);
3859 ret = ((count >= counter->min) && (count <= counter->max));
3877 if (count >= counter->max)
3881 if ((ret == 1) && (atom->min > 0) && (atom->max > 0)) {
3898 if (exec->transcount == atom->max) {
4252 if ((counter == NULL) || (count < counter->max)) {
4412 printf("testing count %d: val %d, min %d, max %d\n",
4413 trans->count, count, counter->min, counter->max);
4415 ret = ((count >= counter->min) && (count <= counter->max));
4423 if ((ret == 1) && (atom->min > 0) && (atom->max > 0)) {
4437 if (exec->transcount == atom->max) {
5140 int min = 0, max = 0;
5149 max = INT_MAX;
5153 max = cur;
5164 if (max == 0)
5165 max = min;
5169 ctxt->atom->max = max;
5371 fprintf(output, " %d: min %d max %d\n", i, regexp->counters[i].min,
5372 regexp->counters[i].max);
5774 * @max: the maximum successive occurences of token
5780 * whose number is between @min and @max
5788 int min, int max, void *data) {
5796 if ((max < min) || (max < 1))
5827 atom->max = max;
5834 am->counters[counter].max = max;
5861 * @max: the maximum successive occurences of token
5867 * is between @min and @max
5874 int min, int max, void *data) {
5882 if ((max < min) || (max < 1))
5893 atom->max = max;
5900 am->counters[counter].max = max;
5928 * @max: the maximum successive occurences of token
5934 * number is between @min and @max, moreover that transition can only be
5943 int min, int max, void *data) {
5951 if ((max < min) || (max < 1))
5980 atom->max = max;
5986 am->counters[counter].max = 1;
6008 * @max: the maximum successive occurences of token
6014 * is between @min and @max, moreover that transition can only be crossed
6022 int min, int max, void *data) {
6030 if ((max < min) || (max < 1))
6039 atom->max = max;
6045 am->counters[counter].max = 1;
6129 * @max: the maximal value on the counter
6136 xmlAutomataNewCounter(xmlAutomataPtr am, int min, int max) {
6146 am->counters[ret].max = max;
6475 const xmlChar *name, int min, int max) {
6491 if (min == max) {
6504 if (max == -1)
6507 kbase = max - min;
6632 if ((insert->exp_min == min) && (insert->exp_max == max) &&
6658 entry->exp_max = max;
6662 if (max < 0)
6665 entry->c_max = max * entry->exp_left->c_max;
6829 * @max: the upper bound for the repetition, -1 means infinite
6831 * Get the atom associated to the range (@subset){@min, @max}
6839 xmlExpNewRange(xmlExpCtxtPtr ctxt, xmlExpNodePtr subset, int min, int max) {
6842 if ((subset == NULL) || (min < 0) || (max < -1) ||
6843 ((max >= 0) && (min > max))) {
6848 NULL, NULL, min, max));
7060 int min, max;
7077 max = -1;
7079 max = exp->exp_max - 1;
7086 NULL, min, max);
7366 int min, max;
7379 max = -1;
7381 max = sub->exp_max -1;
7394 sub->exp_left, NULL, NULL, min, max);
7421 int min, max;
7445 max = -1;
7464 max = -1;
7467 max = -1;
7473 printf("loops max mult mismatch => forbidden\n");
7482 max = exp->exp_max - sub->exp_max * mult;
7501 max = -1;
7507 max = -1;
7517 max = -1;
7526 max = -1;
7529 max = -1;
7535 printf("loops max mismatch => forbidden\n");
7544 max = exp->exp_max - sub->exp_max;
7552 NULL, NULL, min, max);
7574 max = -1;
7576 max = exp->exp_max - 1;
7583 NULL, NULL, min, max);
7830 int min, max;
7841 max = xmlExpParseNumber(ctxt);
7844 max = min;
7851 min, max);
7924 * - finite sequences { min, max }