Lines Matching defs:lower
654 entry_repeat_range(regex_t* reg, int id, int lower, int upper)
680 p[id].lower = lower;
700 r = entry_repeat_range(reg, num_repeat, qn->lower, qn->upper);
755 return SIZE_OP_ANYCHAR_STAR_PEEK_NEXT + tlen * qn->lower + cklen;
757 return SIZE_OP_ANYCHAR_STAR + tlen * qn->lower + cklen;
766 if (infinite && qn->lower <= 1) {
768 if (qn->lower == 1)
776 if (qn->lower == 0)
791 if (qn->lower == 0) {
803 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */
830 r = compile_tree_n_times(qn->target, qn->lower, reg);
869 if (infinite && qn->lower <= 1) {
871 if (qn->lower == 1) {
895 if (qn->lower == 0) {
923 if (qn->lower == 0) {
939 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */
984 return SIZE_OP_ANYCHAR_STAR_PEEK_NEXT + tlen * qn->lower;
986 return SIZE_OP_ANYCHAR_STAR + tlen * qn->lower;
996 (qn->lower <= 1 || tlen * qn->lower <= QUANTIFIER_EXPAND_LIMIT_SIZE)) {
997 if (qn->lower == 1 && tlen > QUANTIFIER_EXPAND_LIMIT_SIZE) {
1001 len = tlen * qn->lower;
1021 len = tlen * qn->lower;
1022 len += (SIZE_OP_PUSH + tlen) * (qn->upper - qn->lower);
1024 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */
1046 r = compile_tree_n_times(qn->target, qn->lower, reg);
1070 (qn->lower <= 1 || tlen * qn->lower <= QUANTIFIER_EXPAND_LIMIT_SIZE)) {
1071 if (qn->lower == 1 && tlen > QUANTIFIER_EXPAND_LIMIT_SIZE) {
1086 r = compile_tree_n_times(qn->target, qn->lower, reg);
1136 int n = qn->upper - qn->lower;
1138 r = compile_tree_n_times(qn->target, qn->lower, reg);
1149 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */
1263 len = tlen * qn->lower
1350 r = compile_tree_n_times(qn->target, qn->lower, reg);
2119 if (qn->lower > 0) {
2122 *min = distance_multiply(*min, qn->lower);
2338 if (qn->lower == qn->upper) {
2341 *len = distance_multiply(tlen, qn->lower);
2630 if (qn->lower > 0) {
2770 if (NQTFR(node)->lower == 0) r = 0;
3173 if (qn->lower <= 1) {
3581 qn->upper = (qn->lower == 0 ? 1 : qn->lower);
3601 var_num = qn->upper - qn->lower;
3768 if (qn->lower > 1) qn->lower = 1;
3770 qn->upper = qn->lower = 0; /* /(?:)+/ ==> // */
3778 if (qn->lower != qn->upper)
3786 if (!IS_REPEAT_INFINITE(qn->lower) && qn->lower == qn->upper &&
3787 qn->lower > 1 && qn->lower <= EXPAND_STRING_MAX_LENGTH) {
3791 if (len * qn->lower <= EXPAND_STRING_MAX_LENGTH) {
3792 int i, n = qn->lower;
3849 if (IS_REPEAT_INFINITE(tqn->upper) && tqn->lower <= 1 &&
4801 if (qn->lower == 0 && IS_REPEAT_INFINITE(qn->upper)) {
4811 if (qn->lower > 0) {
4815 for (i = 2; i <= qn->lower &&
4819 if (i < qn->lower) {
4825 if (qn->lower != qn->upper) {
4829 if (qn->lower > 1)
4834 min = distance_multiply(nopt.len.min, qn->lower);
6263 NQTFR(node)->lower, NQTFR(node)->upper,