Lines Matching refs:upper
1022 entry_repeat_range(regex_t* reg, int id, int lower, int upper, int ops_index) in entry_repeat_range() argument
1047 p[id].upper = (IS_INFINITE_REPEAT(upper) ? 0x7fffffff : upper); in entry_repeat_range()
1065 r = entry_repeat_range(reg, num_repeat, qn->lower, qn->upper, in compile_range_repeat_node()
1082 if (qn->greedy && IS_INFINITE_REPEAT(qn->upper) && in is_anychar_infinite_greedy()
1096 int infinite = IS_INFINITE_REPEAT(qn->upper); in compile_length_quantifier_node()
1142 else if (qn->upper == 0) { in compile_length_quantifier_node()
1150 (qn->upper == 1 || in compile_length_quantifier_node()
1151 int_multiply_cmp(tlen + OPSIZE_PUSH, qn->upper, in compile_length_quantifier_node()
1154 len += (OPSIZE_PUSH + tlen) * (qn->upper - qn->lower); in compile_length_quantifier_node()
1156 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ in compile_length_quantifier_node()
1170 int infinite = IS_INFINITE_REPEAT(qn->upper); in compile_quantifier_node()
1285 else if (qn->upper == 0) { in compile_quantifier_node()
1299 (qn->upper == 1 || in compile_quantifier_node()
1300 int_multiply_cmp(tlen + OPSIZE_PUSH, qn->upper, in compile_quantifier_node()
1302 int n = qn->upper - qn->lower; in compile_quantifier_node()
1319 else if (! qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ in compile_quantifier_node()
2529 if (qn->lower == qn->upper) { in get_char_len_node1()
2530 if (qn->upper == 0) { in get_char_len_node1()
3185 if (qn->upper != 0) { in tree_max_len()
3188 if (! IS_INFINITE_REPEAT(qn->upper)) in tree_max_len()
3189 len = distance_multiply(len, qn->upper); in tree_max_len()
3795 if (QUANT_(node)->upper == 0) { in recursive_call_check_trav()
4027 if (qn->greedy && IS_INFINITE_REPEAT(qn->upper)) { in tune_next()
4458 if (qn->upper != 0) { in quantifiers_memory_node_info()
4648 if (QUANT_(node)->upper == 0) in tune_call()
4718 if (QUANT_(node)->upper != 0) in tune_call2()
4777 if (IS_INFINITE_REPEAT(qn->upper) || qn->upper >= 2) in tune_called_state_call()
4779 if (qn->lower != qn->upper) in tune_called_state_call()
4897 if (IS_INFINITE_REPEAT(qn->upper) || qn->upper >= 2) in tune_called_state()
4899 if (qn->lower != qn->upper) in tune_called_state()
5029 if (IS_INFINITE_REPEAT(qn->upper) || qn->upper >= 1) { in tune_quant()
5040 if (IS_INFINITE_REPEAT(qn->upper) || qn->upper >= 2) in tune_quant()
5042 if (qn->lower != qn->upper) in tune_quant()
5051 if (!IS_INFINITE_REPEAT(qn->lower) && qn->lower == qn->upper && in tune_quant()
5180 if (IS_INFINITE_REPEAT(tqn->upper) && tqn->lower <= 1 && in tune_tree()
6145 if (qn->lower != qn->upper) { in optimize_nodes()
6153 if (IS_INFINITE_REPEAT(qn->upper)) { in optimize_nodes()
6165 max = distance_multiply(xo.len.max, qn->upper); in optimize_nodes()
7299 QUANT_(node)->lower, QUANT_(node)->upper, in print_indent_tree()
