upper 638 ext/mbstring/oniguruma/oniguruma.h int upper; upper 650 ext/mbstring/oniguruma/regcomp.c entry_repeat_range(regex_t* reg, int id, int lower, int upper) upper 676 ext/mbstring/oniguruma/regcomp.c p[id].upper = (IS_REPEAT_INFINITE(upper) ? 0x7fffffff : upper); upper 695 ext/mbstring/oniguruma/regcomp.c r = entry_repeat_range(reg, num_repeat, qn->lower, qn->upper); upper 719 ext/mbstring/oniguruma/regcomp.c if (qn->greedy && IS_REPEAT_INFINITE(qn->upper) && upper 736 ext/mbstring/oniguruma/regcomp.c int infinite = IS_REPEAT_INFINITE(qn->upper); upper 779 ext/mbstring/oniguruma/regcomp.c else if (qn->upper == 0) { upper 785 ext/mbstring/oniguruma/regcomp.c else if (qn->upper == 1 && qn->greedy) { upper 798 ext/mbstring/oniguruma/regcomp.c else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ upper 816 ext/mbstring/oniguruma/regcomp.c int infinite = IS_REPEAT_INFINITE(qn->upper); upper 908 ext/mbstring/oniguruma/regcomp.c else if (qn->upper == 0) { upper 917 ext/mbstring/oniguruma/regcomp.c else if (qn->upper == 1 && qn->greedy) { upper 934 ext/mbstring/oniguruma/regcomp.c else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ upper 969 ext/mbstring/oniguruma/regcomp.c int infinite = IS_REPEAT_INFINITE(qn->upper); upper 1010 ext/mbstring/oniguruma/regcomp.c else if (qn->upper == 0 && qn->is_refered != 0) { /* /(?<n>..){0}/ */ upper 1014 ext/mbstring/oniguruma/regcomp.c (qn->upper == 1 || (tlen + SIZE_OP_PUSH) * qn->upper upper 1017 ext/mbstring/oniguruma/regcomp.c len += (SIZE_OP_PUSH + tlen) * (qn->upper - qn->lower); upper 1019 ext/mbstring/oniguruma/regcomp.c else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ upper 1034 ext/mbstring/oniguruma/regcomp.c int infinite = IS_REPEAT_INFINITE(qn->upper); upper 1123 ext/mbstring/oniguruma/regcomp.c else if (qn->upper == 0 && qn->is_refered != 0) { /* /(?<n>..){0}/ */ upper 1129 ext/mbstring/oniguruma/regcomp.c (qn->upper == 1 || (tlen + SIZE_OP_PUSH) * qn->upper upper 1131 ext/mbstring/oniguruma/regcomp.c int n = qn->upper - qn->lower; upper 1144 ext/mbstring/oniguruma/regcomp.c else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ upper 1985 ext/mbstring/oniguruma/regcomp.c if (qn->upper != 0) { upper 2218 ext/mbstring/oniguruma/regcomp.c if (qn->upper != 0) { upper 2221 ext/mbstring/oniguruma/regcomp.c if (! IS_REPEAT_INFINITE(qn->upper)) upper 2222 ext/mbstring/oniguruma/regcomp.c *max = distance_multiply(*max, qn->upper); upper 2324 ext/mbstring/oniguruma/regcomp.c if (qn->lower == qn->upper) { upper 2932 ext/mbstring/oniguruma/regcomp.c if (NQTFR(node)->upper == 0) { upper 3150 ext/mbstring/oniguruma/regcomp.c if (qn->greedy && IS_REPEAT_INFINITE(qn->upper)) { upper 3546 ext/mbstring/oniguruma/regcomp.c if (! IS_REPEAT_INFINITE(qn->upper)) { upper 3547 ext/mbstring/oniguruma/regcomp.c if (qn->upper > 1) { upper 3558 ext/mbstring/oniguruma/regcomp.c if (IS_REPEAT_INFINITE(q->upper) upper 3560 ext/mbstring/oniguruma/regcomp.c qn->upper = (qn->lower == 0 ? 1 : qn->lower); upper 3561 ext/mbstring/oniguruma/regcomp.c if (qn->upper == 1) upper 3575 ext/mbstring/oniguruma/regcomp.c if (IS_REPEAT_INFINITE(qn->upper)) { upper 3580 ext/mbstring/oniguruma/regcomp.c var_num = qn->upper - qn->lower; upper 3730 ext/mbstring/oniguruma/regcomp.c if (IS_REPEAT_INFINITE(qn->upper) || qn->upper >= 1) { upper 3746 ext/mbstring/oniguruma/regcomp.c qn->upper = 1; upper 3749 ext/mbstring/oniguruma/regcomp.c qn->upper = qn->lower = 0; /* /(?:)+/ ==> // */ upper 3757 ext/mbstring/oniguruma/regcomp.c if (qn->lower != qn->upper) upper 3765 ext/mbstring/oniguruma/regcomp.c if (!IS_REPEAT_INFINITE(qn->lower) && qn->lower == qn->upper && upper 3828 ext/mbstring/oniguruma/regcomp.c if (IS_REPEAT_INFINITE(tqn->upper) && tqn->lower <= 1 && upper 4780 ext/mbstring/oniguruma/regcomp.c if (qn->lower == 0 && IS_REPEAT_INFINITE(qn->upper)) { upper 4804 ext/mbstring/oniguruma/regcomp.c if (qn->lower != qn->upper) { upper 4814 ext/mbstring/oniguruma/regcomp.c if (IS_REPEAT_INFINITE(qn->upper)) upper 4817 ext/mbstring/oniguruma/regcomp.c max = distance_multiply(nopt.len.max, qn->upper); upper 6242 ext/mbstring/oniguruma/regcomp.c NQTFR(node)->lower, NQTFR(node)->upper, upper 2542 ext/mbstring/oniguruma/regexec.c if (stkp->u.repeat.count >= reg->repeat_range[mem].upper) { upper 2572 ext/mbstring/oniguruma/regexec.c if (stkp->u.repeat.count < reg->repeat_range[mem].upper) { upper 2584 ext/mbstring/oniguruma/regexec.c else if (stkp->u.repeat.count == reg->repeat_range[mem].upper) { upper 1348 ext/mbstring/oniguruma/regparse.c node_new_quantifier(int lower, int upper, int by_number) upper 1357 ext/mbstring/oniguruma/regparse.c NQTFR(node)->upper = upper; upper 2159 ext/mbstring/oniguruma/regparse.c if (q->upper == 1) return 0; upper 2160 ext/mbstring/oniguruma/regparse.c else if (IS_REPEAT_INFINITE(q->upper)) return 1; upper 2163 ext/mbstring/oniguruma/regparse.c if (IS_REPEAT_INFINITE(q->upper)) return 2; upper 2168 ext/mbstring/oniguruma/regparse.c if (q->upper == 1) return 3; upper 2169 ext/mbstring/oniguruma/regparse.c else if (IS_REPEAT_INFINITE(q->upper)) return 4; upper 2172 ext/mbstring/oniguruma/regparse.c if (IS_REPEAT_INFINITE(q->upper)) return 5; upper 2216 ext/mbstring/oniguruma/regparse.c p->lower = 0; p->upper = REPEAT_INFINITE; p->greedy = 1; upper 2220 ext/mbstring/oniguruma/regparse.c p->lower = 0; p->upper = REPEAT_INFINITE; p->greedy = 0; upper 2224 ext/mbstring/oniguruma/regparse.c p->lower = 0; p->upper = 1; p->greedy = 0; upper 2228 ext/mbstring/oniguruma/regparse.c p->lower = 0; p->upper = 1; p->greedy = 0; upper 2229 ext/mbstring/oniguruma/regparse.c c->lower = 1; c->upper = REPEAT_INFINITE; c->greedy = 1; upper 2234 ext/mbstring/oniguruma/regparse.c p->lower = 0; p->upper = 1; p->greedy = 1; upper 2235 ext/mbstring/oniguruma/regparse.c c->lower = 1; c->upper = REPEAT_INFINITE; c->greedy = 0; upper 2290 ext/mbstring/oniguruma/regparse.c int upper; upper 2396 ext/mbstring/oniguruma/regparse.c tok->u.repeat.upper = up; upper 3160 ext/mbstring/oniguruma/regparse.c tok->u.repeat.upper = REPEAT_INFINITE; upper 3168 ext/mbstring/oniguruma/regparse.c tok->u.repeat.upper = REPEAT_INFINITE; upper 3176 ext/mbstring/oniguruma/regparse.c tok->u.repeat.upper = 1; upper 3626 ext/mbstring/oniguruma/regparse.c tok->u.repeat.upper = REPEAT_INFINITE; upper 3637 ext/mbstring/oniguruma/regparse.c tok->u.repeat.upper = REPEAT_INFINITE; upper 3648 ext/mbstring/oniguruma/regparse.c tok->u.repeat.upper = 1; upper 4762 ext/mbstring/oniguruma/regparse.c if (qn->lower == 1 && qn->upper == 1) { upper 4829 ext/mbstring/oniguruma/regparse.c if (! IS_REPEAT_INFINITE(qn->upper) && qn->upper > 1 && qn->greedy) { upper 4830 ext/mbstring/oniguruma/regparse.c qn->upper = (qn->lower == 0 ? 1 : qn->lower); upper 5378 ext/mbstring/oniguruma/regparse.c qn = node_new_quantifier(tok->u.repeat.lower, tok->u.repeat.upper, upper 174 ext/mbstring/oniguruma/regparse.h int upper; upper 171 ext/mbstring/ucgendat/ucgendat.c static _case_t *upper; upper 591 ext/mbstring/ucgendat/ucgendat.c upper = (_case_t *) malloc(sizeof(_case_t) << 3); upper 593 ext/mbstring/ucgendat/ucgendat.c upper = (_case_t *) realloc((char *) upper, upper 601 ext/mbstring/ucgendat/ucgendat.c for (i = 0; i < upper_used && code > upper[i].key; i++) ; upper 608 ext/mbstring/ucgendat/ucgendat.c (void) AC_MEMCPY((char *) &upper[j], (char *) &upper[j - 1], upper 612 ext/mbstring/ucgendat/ucgendat.c upper[i].key = cases[0]; /* Upper */ upper 613 ext/mbstring/ucgendat/ucgendat.c upper[i].other1 = cases[1]; /* Lower */ upper 614 ext/mbstring/ucgendat/ucgendat.c upper[i].other2 = cases[2]; /* Title */ upper 1452 ext/mbstring/ucgendat/ucgendat.c write_case(out, upper, upper_used, 1); upper 1499 ext/mbstring/ucgendat/ucgendat.c fwrite((char *) upper, sizeof(_case_t), upper_used, out); upper 98156 ext/sqlite3/libsqlite/sqlite3.c FUNCTION(upper, 1, 0, 0, upperFunc ),