Lines Matching refs:lower
650 entry_repeat_range(regex_t* reg, int id, int lower, int upper) in entry_repeat_range() argument
675 p[id].lower = lower; in entry_repeat_range()
695 r = entry_repeat_range(reg, num_repeat, qn->lower, qn->upper); in compile_range_repeat_node()
750 return SIZE_OP_ANYCHAR_STAR_PEEK_NEXT + tlen * qn->lower + cklen; in compile_length_quantifier_node()
752 return SIZE_OP_ANYCHAR_STAR + tlen * qn->lower + cklen; in compile_length_quantifier_node()
761 if (infinite && qn->lower <= 1) { in compile_length_quantifier_node()
763 if (qn->lower == 1) in compile_length_quantifier_node()
771 if (qn->lower == 0) in compile_length_quantifier_node()
786 if (qn->lower == 0) { in compile_length_quantifier_node()
798 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ in compile_length_quantifier_node()
825 r = compile_tree_n_times(qn->target, qn->lower, reg); in compile_quantifier_node()
864 if (infinite && qn->lower <= 1) { in compile_quantifier_node()
866 if (qn->lower == 1) { in compile_quantifier_node()
890 if (qn->lower == 0) { in compile_quantifier_node()
918 if (qn->lower == 0) { in compile_quantifier_node()
934 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ in compile_quantifier_node()
979 return SIZE_OP_ANYCHAR_STAR_PEEK_NEXT + tlen * qn->lower; in compile_length_quantifier_node()
981 return SIZE_OP_ANYCHAR_STAR + tlen * qn->lower; in compile_length_quantifier_node()
991 (qn->lower <= 1 || tlen * qn->lower <= QUANTIFIER_EXPAND_LIMIT_SIZE)) { in compile_length_quantifier_node()
992 if (qn->lower == 1 && tlen > QUANTIFIER_EXPAND_LIMIT_SIZE) { in compile_length_quantifier_node()
996 len = tlen * qn->lower; in compile_length_quantifier_node()
1016 len = tlen * qn->lower; 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()
1041 r = compile_tree_n_times(qn->target, qn->lower, reg); in compile_quantifier_node()
1065 (qn->lower <= 1 || tlen * qn->lower <= QUANTIFIER_EXPAND_LIMIT_SIZE)) { in compile_quantifier_node()
1066 if (qn->lower == 1 && tlen > QUANTIFIER_EXPAND_LIMIT_SIZE) { in compile_quantifier_node()
1081 r = compile_tree_n_times(qn->target, qn->lower, reg); in compile_quantifier_node()
1131 int n = qn->upper - qn->lower; in compile_quantifier_node()
1133 r = compile_tree_n_times(qn->target, qn->lower, reg); in compile_quantifier_node()
1144 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ in compile_quantifier_node()
1257 len = tlen * qn->lower in compile_length_enclose_node()
1352 r = compile_tree_n_times(qn->target, qn->lower, reg); in compile_enclose_node()
2114 if (qn->lower == qn->upper) { in get_char_length_tree1()
2117 *len = distance_multiply(tlen, qn->lower); in get_char_length_tree1()
2407 if (qn->lower > 0) { in get_head_value_node()
2581 if (qn->lower > 0) { in get_min_len()
2584 *min = distance_multiply(*min, qn->lower); in get_min_len()
2798 if (NQTFR(node)->lower == 0) r = 0; in subexp_inf_recursive_check()
3204 if (qn->lower <= 1) { in next_setup()
3605 qn->upper = (qn->lower == 0 ? 1 : qn->lower); in setup_comb_exp_check()
3625 var_num = qn->upper - qn->lower; in setup_comb_exp_check()
3794 if (qn->lower > 1) qn->lower = 1; in setup_tree()
3796 qn->upper = qn->lower = 0; /* /(?:)+/ ==> // */ in setup_tree()
3804 if (qn->lower != qn->upper) in setup_tree()
3812 if (!IS_REPEAT_INFINITE(qn->lower) && qn->lower == qn->upper && in setup_tree()
3813 qn->lower > 1 && qn->lower <= EXPAND_STRING_MAX_LENGTH) { in setup_tree()
3817 if (len * qn->lower <= EXPAND_STRING_MAX_LENGTH) { in setup_tree()
3818 int i, n = qn->lower; in setup_tree()
3881 if (IS_REPEAT_INFINITE(tqn->upper) && tqn->lower <= 1 && in setup_tree()
4837 if (qn->lower == 0 && IS_REPEAT_INFINITE(qn->upper)) { in optimize_node_left()
4847 if (qn->lower > 0) { in optimize_node_left()
4851 for (i = 2; i <= qn->lower && in optimize_node_left()
4855 if (i < qn->lower) { in optimize_node_left()
4861 if (qn->lower != qn->upper) { in optimize_node_left()
4865 if (qn->lower > 1) in optimize_node_left()
4870 min = distance_multiply(nopt.len.min, qn->lower); in optimize_node_left()
6257 NQTFR(node)->lower, NQTFR(node)->upper, in print_indent_tree()
