Lines Matching refs:upper
650 entry_repeat_range(regex_t* reg, int id, int lower, int upper) in entry_repeat_range() argument
676 p[id].upper = (IS_REPEAT_INFINITE(upper) ? 0x7fffffff : upper); in entry_repeat_range()
695 r = entry_repeat_range(reg, num_repeat, qn->lower, qn->upper); in compile_range_repeat_node()
719 if (qn->greedy && IS_REPEAT_INFINITE(qn->upper) && in is_anychar_star_quantifier()
736 int infinite = IS_REPEAT_INFINITE(qn->upper); in compile_length_quantifier_node()
779 else if (qn->upper == 0) { in compile_length_quantifier_node()
785 else if (qn->upper == 1 && qn->greedy) { in compile_length_quantifier_node()
798 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ in compile_length_quantifier_node()
816 int infinite = IS_REPEAT_INFINITE(qn->upper); in compile_quantifier_node()
908 else if (qn->upper == 0) { in compile_quantifier_node()
917 else if (qn->upper == 1 && qn->greedy) { in compile_quantifier_node()
934 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ in compile_quantifier_node()
969 int infinite = IS_REPEAT_INFINITE(qn->upper); in compile_length_quantifier_node()
1010 else if (qn->upper == 0 && qn->is_refered != 0) { /* /(?<n>..){0}/ */ in compile_length_quantifier_node()
1014 (qn->upper == 1 || (tlen + SIZE_OP_PUSH) * qn->upper in compile_length_quantifier_node()
1017 len += (SIZE_OP_PUSH + tlen) * (qn->upper - qn->lower); in compile_length_quantifier_node()
1019 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ in compile_length_quantifier_node()
1034 int infinite = IS_REPEAT_INFINITE(qn->upper); in compile_quantifier_node()
1123 else if (qn->upper == 0 && qn->is_refered != 0) { /* /(?<n>..){0}/ */ in compile_quantifier_node()
1129 (qn->upper == 1 || (tlen + SIZE_OP_PUSH) * qn->upper in compile_quantifier_node()
1131 int n = qn->upper - qn->lower; in compile_quantifier_node()
1144 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ in compile_quantifier_node()
1985 if (qn->upper != 0) { in quantifiers_memory_node_info()
2218 if (qn->upper != 0) { in get_max_match_length()
2221 if (! IS_REPEAT_INFINITE(qn->upper)) in get_max_match_length()
2222 *max = distance_multiply(*max, qn->upper); in get_max_match_length()
2324 if (qn->lower == qn->upper) { in get_char_length_tree1()
2932 if (NQTFR(node)->upper == 0) { in subexp_recursive_check_trav()
3150 if (qn->greedy && IS_REPEAT_INFINITE(qn->upper)) { in next_setup()
3547 if (! IS_REPEAT_INFINITE(qn->upper)) { in setup_comb_exp_check()
3548 if (qn->upper > 1) { in setup_comb_exp_check()
3559 if (IS_REPEAT_INFINITE(q->upper) in setup_comb_exp_check()
3561 qn->upper = (qn->lower == 0 ? 1 : qn->lower); in setup_comb_exp_check()
3562 if (qn->upper == 1) in setup_comb_exp_check()
3576 if (IS_REPEAT_INFINITE(qn->upper)) { in setup_comb_exp_check()
3581 var_num = qn->upper - qn->lower; in setup_comb_exp_check()
3731 if (IS_REPEAT_INFINITE(qn->upper) || qn->upper >= 1) { in setup_tree()
3747 qn->upper = 1; in setup_tree()
3750 qn->upper = qn->lower = 0; /* /(?:)+/ ==> // */ in setup_tree()
3758 if (qn->lower != qn->upper) in setup_tree()
3766 if (!IS_REPEAT_INFINITE(qn->lower) && qn->lower == qn->upper && in setup_tree()
3829 if (IS_REPEAT_INFINITE(tqn->upper) && tqn->lower <= 1 && in setup_tree()
4781 if (qn->lower == 0 && IS_REPEAT_INFINITE(qn->upper)) { in optimize_node_left()
4805 if (qn->lower != qn->upper) { in optimize_node_left()
4815 if (IS_REPEAT_INFINITE(qn->upper)) in optimize_node_left()
4818 max = distance_multiply(nopt.len.max, qn->upper); in optimize_node_left()
6210 NQTFR(node)->lower, NQTFR(node)->upper, in print_indent_tree()
