Lines Matching defs:min
124 int min;
170 tre_ast_new_iter(tre_mem_t mem, tre_ast_node_t *arg, int min, int max, int minimal)
180 iter->min = min;
471 static int add_icase_literals(struct literals *ls, int min, int max)
475 for (c=min; c<=max; ) {
535 int min, max;
568 min = 0;
572 min = max = wc;
580 if (len <= 0 || min > max)
594 lit->code_min = min;
607 if (add_icase_literals(ls, min, max))
615 int i, max, min, negmax, negmin;
680 min = lit->code_min;
683 if (min <= negmin) {
688 negmax = min - 1;
727 int min, max;
729 s = parse_dup_count(s, &min);
733 max = min;
736 (max < min && max >= 0) ||
738 min > RE_DUP_MAX ||
739 min < 0 ||
744 *pmin = min;
996 int min, max;
1021 s = parse_dup(s+1, ere, &min, &max);
1025 min=0;
1028 min = 1;
1036 ctx->n = tre_ast_new_iter(ctx->mem, ctx->n, min, max, 0);
1721 int min = lit->code_min;
1734 min = EMPTY;
1744 *result = tre_ast_new_literal(mem, min, max, pos);
1805 *result = tre_ast_new_iter(mem, iter->arg, iter->min,
1902 if (iter->min > 1 || iter->max > 1)
1918 if (iter->min > 1 || iter->max > 1)
1925 for (j = 0; j < iter->min; j++)
1929 int flags = ((j + 1 < iter->min)
1960 for (j = iter->min; j < iter->max; j++)
2366 if (iter->min == 0 || iter->arg->nullable)
2665 assert(iter->min == 0 || iter->min == 1);