Lines Matching refs:max
179 int max;
198 int max;
751 ret->max = 0;
1003 fprintf(output, "%d-%d ", atom->min, atom->max);
1110 fprintf(output, " %d: min %d max %d\n", i, ctxt->counters[i].min,
1111 ctxt->counters[i].max);
1189 ctxt->counters[ctxt->nbCounters].max = -1;
1527 ctxt->counters[counter].max = atom->max - 1;
1529 atom->max = 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)) {
3103 if (exec->transcount == atom->max) {
3154 } else if ((ret == 0) && (atom->min == 0) && (atom->max > 0)) {
3164 } else if ((atom->min == 0) && (atom->max > 0)) {
3634 if ((count < counter->max) &&
3641 (count < counter->max) &&
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));
3706 if (count >= counter->max)
3710 if ((ret == 1) && (atom->min > 0) && (atom->max > 0)) {
3727 if (exec->transcount == atom->max) {
4081 if ((counter == NULL) || (count < counter->max)) {
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)) {
4266 if (exec->transcount == atom->max) {
5026 int min = 0, max = 0;
5035 max = INT_MAX;
5039 max = cur;
5050 if (max == 0)
5051 max = min;
5055 ctxt->atom->max = max;
5250 fprintf(output, " %d: min %d max %d\n", i, regexp->counters[i].min,
5251 regexp->counters[i].max);
5649 * @max: the maximum successive occurences of token
5655 * whose number is between @min and @max
5663 int min, int max, void *data) {
5671 if ((max < min) || (max < 1))
5702 atom->max = max;
5709 am->counters[counter].max = max;
5736 * @max: the maximum successive occurences of token
5742 * is between @min and @max
5749 int min, int max, void *data) {
5757 if ((max < min) || (max < 1))
5768 atom->max = max;
5775 am->counters[counter].max = max;
5803 * @max: the maximum successive occurences of token
5809 * number is between @min and @max, moreover that transition can only be
5818 int min, int max, void *data) {
5826 if ((max < min) || (max < 1))
5855 atom->max = max;
5861 am->counters[counter].max = 1;
5883 * @max: the maximum successive occurences of token
5889 * is between @min and @max, moreover that transition can only be crossed
5897 int min, int max, void *data) {
5905 if ((max < min) || (max < 1))
5914 atom->max = max;
5920 am->counters[counter].max = 1;
6004 * @max: the maximal value on the counter
6011 xmlAutomataNewCounter(xmlAutomataPtr am, int min, int max) {
6021 am->counters[ret].max = max;
6350 const xmlChar *name, int min, int max) {
6366 if (min == max) {
6379 if (max == -1)
6382 kbase = max - min;
6507 if ((insert->exp_min == min) && (insert->exp_max == max) &&
6533 entry->exp_max = max;
6537 if (max < 0)
6540 entry->c_max = max * entry->exp_left->c_max;
6704 * @max: the upper bound for the repetition, -1 means infinite
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;
6952 max = -1;
6954 max = exp->exp_max - 1;
6961 NULL, min, max);
7241 int min, max;
7254 max = -1;
7256 max = sub->exp_max -1;
7269 sub->exp_left, NULL, NULL, min, max);
7296 int min, max;
7320 max = -1;
7339 max = -1;
7342 max = -1;
7348 printf("loops max mult mismatch => forbidden\n");
7357 max = exp->exp_max - sub->exp_max * mult;
7376 max = -1;
7382 max = -1;
7392 max = -1;
7401 max = -1;
7404 max = -1;
7410 printf("loops max mismatch => forbidden\n");
7419 max = exp->exp_max - sub->exp_max;
7427 NULL, NULL, min, max);
7449 max = -1;
7451 max = exp->exp_max - 1;
7458 NULL, NULL, min, max);
7705 int min, max;
7716 max = xmlExpParseNumber(ctxt);
7719 max = min;
7726 min, max);
7799 * - finite sequences { min, max }