Lines Matching defs:max
126 int max;
170 tre_ast_new_iter(tre_mem_t mem, tre_ast_node_t *arg, int min, int max, int minimal)
181 iter->max = max;
471 static int add_icase_literals(struct literals *ls, int min, int max)
475 for (c=min; c<=max; ) {
481 for (c++, e++; c<=max; c++, e++)
485 for (c++, e++; c<=max; c++, e++)
535 int min, max;
569 max = TRE_CHAR_MAX;
572 min = max = wc;
577 max = wc;
580 if (len <= 0 || min > max)
595 lit->code_max = max;
607 if (add_icase_literals(ls, min, max))
615 int i, max, min, negmax, negmin;
681 max = lit->code_max;
685 negmin = MAX(max + 1, negmin);
691 negmin = max + 1;
727 int min, max;
731 s = parse_dup_count(s+1, &max);
733 max = min;
736 (max < min && max >= 0) ||
737 max > RE_DUP_MAX ||
745 *pmax = max;
996 int min, max;
1021 s = parse_dup(s+1, ere, &min, &max);
1026 max=-1;
1030 max = 1;
1033 if (max == 0)
1036 ctx->n = tre_ast_new_iter(ctx->mem, ctx->n, min, max, 0);
1722 int max = lit->code_max;
1735 max = pos = -1;
1741 tag_directions[max] = TRE_TAG_MAXIMIZE;
1744 *result = tre_ast_new_literal(mem, min, max, pos);
1806 iter->max, iter->minimal);
1902 if (iter->min > 1 || iter->max > 1)
1918 if (iter->min > 1 || iter->max > 1)
1946 if (iter->max == -1)
1960 for (j = iter->min; j < iter->max; j++)
2661 assert(iter->max == -1 || iter->max == 1);
2663 if (iter->max == -1)