Lines Matching refs:upper
630 entry_repeat_range(regex_t* reg, int id, int lower, int upper) in entry_repeat_range() argument
656 p[id].upper = (IS_REPEAT_INFINITE(upper) ? 0x7fffffff : upper); in entry_repeat_range()
675 r = entry_repeat_range(reg, num_repeat, qn->lower, qn->upper); in compile_range_repeat_node()
699 if (qn->greedy && IS_REPEAT_INFINITE(qn->upper) && in is_anychar_star_quantifier()
716 int infinite = IS_REPEAT_INFINITE(qn->upper); in compile_length_quantifier_node()
759 else if (qn->upper == 0) { in compile_length_quantifier_node()
765 else if (qn->upper == 1 && qn->greedy) { in compile_length_quantifier_node()
778 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ in compile_length_quantifier_node()
796 int infinite = IS_REPEAT_INFINITE(qn->upper); in compile_quantifier_node()
888 else if (qn->upper == 0) { in compile_quantifier_node()
897 else if (qn->upper == 1 && qn->greedy) { in compile_quantifier_node()
914 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ in compile_quantifier_node()
949 int infinite = IS_REPEAT_INFINITE(qn->upper); in compile_length_quantifier_node()
990 else if (qn->upper == 0 && qn->is_refered != 0) { /* /(?<n>..){0}/ */ in compile_length_quantifier_node()
994 (qn->upper == 1 || (tlen + SIZE_OP_PUSH) * qn->upper in compile_length_quantifier_node()
997 len += (SIZE_OP_PUSH + tlen) * (qn->upper - qn->lower); in compile_length_quantifier_node()
999 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ in compile_length_quantifier_node()
1014 int infinite = IS_REPEAT_INFINITE(qn->upper); in compile_quantifier_node()
1103 else if (qn->upper == 0 && qn->is_refered != 0) { /* /(?<n>..){0}/ */ in compile_quantifier_node()
1109 (qn->upper == 1 || (tlen + SIZE_OP_PUSH) * qn->upper in compile_quantifier_node()
1111 int n = qn->upper - qn->lower; in compile_quantifier_node()
1124 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ in compile_quantifier_node()
1963 if (qn->upper != 0) { in quantifiers_memory_node_info()
2209 if (qn->upper != 0) { in get_max_match_length()
2212 if (! IS_REPEAT_INFINITE(qn->upper)) in get_max_match_length()
2213 *max = distance_multiply(*max, qn->upper); in get_max_match_length()
2315 if (qn->lower == qn->upper) { in get_char_length_tree1()
2944 if (NQUANTIFIER(node).upper == 0) { in subexp_recursive_check_trav()
3161 if (qn->greedy && IS_REPEAT_INFINITE(qn->upper)) { in next_setup()
3336 if (! IS_REPEAT_INFINITE(qn->upper)) { in setup_comb_exp_check()
3337 if (qn->upper > 1) { in setup_comb_exp_check()
3348 if (IS_REPEAT_INFINITE(q->upper) in setup_comb_exp_check()
3350 qn->upper = (qn->lower == 0 ? 1 : qn->lower); in setup_comb_exp_check()
3351 if (qn->upper == 1) in setup_comb_exp_check()
3365 if (IS_REPEAT_INFINITE(qn->upper)) { in setup_comb_exp_check()
3370 var_num = qn->upper - qn->lower; in setup_comb_exp_check()
3520 if (IS_REPEAT_INFINITE(qn->upper) || qn->upper >= 1) { in setup_tree()
3536 qn->upper = 1; in setup_tree()
3539 qn->upper = qn->lower = 0; /* /(?:)+/ ==> // */ in setup_tree()
3547 if (qn->lower != qn->upper) in setup_tree()
3555 if (!IS_REPEAT_INFINITE(qn->lower) && qn->lower == qn->upper && in setup_tree()
3618 if (IS_REPEAT_INFINITE(tqn->upper) && tqn->lower <= 1 && in setup_tree()
4574 if (qn->lower == 0 && IS_REPEAT_INFINITE(qn->upper)) { in optimize_node_left()
4598 if (qn->lower != qn->upper) { in optimize_node_left()
4608 if (IS_REPEAT_INFINITE(qn->upper)) in optimize_node_left()
4611 max = distance_multiply(nopt.len.max, qn->upper); in optimize_node_left()
6000 NQUANTIFIER(node).lower, NQUANTIFIER(node).upper, in print_indent_tree()
