low 67 ext/filter/sanitizing_filters.c static void php_filter_encode_url(zval *value, const unsigned char* chars, const int char_len, int high, int low, int encode_nul) low 78 ext/gd/libgd/gd_interpolation.c #define CLAMP(x, low, high) (((x) > (high)) ? (high) : (((x) < (low)) ? (low) : (x))) low 5606 ext/mbstring/oniguruma/regcomp.c OnigCodePoint low, high, x; low 5612 ext/mbstring/oniguruma/regcomp.c for (low = 0, high = n; low < high; ) { low 5613 ext/mbstring/oniguruma/regcomp.c x = (low + high) >> 1; low 5615 ext/mbstring/oniguruma/regcomp.c low = x + 1; low 5620 ext/mbstring/oniguruma/regcomp.c return ((low < n && code >= data[low * 2]) ? 1 : 0); low 3115 ext/mbstring/oniguruma/regexec.c UChar* range, UChar** low, UChar** high, UChar** low_prev) low 3199 ext/mbstring/oniguruma/regexec.c *low = p; low 3201 ext/mbstring/oniguruma/regexec.c if (*low > s) low 3210 ext/mbstring/oniguruma/regexec.c *low = p - reg->dmax; low 3211 ext/mbstring/oniguruma/regexec.c if (*low > s) { low 3212 ext/mbstring/oniguruma/regexec.c *low = onigenc_get_right_adjust_char_head_with_prev(reg->enc, s, low 3213 ext/mbstring/oniguruma/regexec.c *low, (const UChar** )low_prev); low 3216 ext/mbstring/oniguruma/regexec.c (pprev ? pprev : s), *low); low 3221 ext/mbstring/oniguruma/regexec.c (pprev ? pprev : str), *low); low 3231 ext/mbstring/oniguruma/regexec.c (int )(*low - str), (int )(*high - str), reg->dmin, reg->dmax); low 3247 ext/mbstring/oniguruma/regexec.c UChar** low, UChar** high) low 3329 ext/mbstring/oniguruma/regexec.c *low = p - reg->dmax; low 3336 ext/mbstring/oniguruma/regexec.c (int )(*low - str), (int )(*high - str)); low 3582 ext/mbstring/oniguruma/regexec.c UChar *sch_range, *low, *high, *low_prev; low 3600 ext/mbstring/oniguruma/regexec.c &low, &high, &low_prev)) goto mismatch; low 3601 ext/mbstring/oniguruma/regexec.c if (s < low) { low 3602 ext/mbstring/oniguruma/regexec.c s = low; low 3615 ext/mbstring/oniguruma/regexec.c &low, &high, (UChar** )NULL)) goto mismatch; low 3650 ext/mbstring/oniguruma/regexec.c UChar *low, *high, *adjrange, *sch_start; low 3663 ext/mbstring/oniguruma/regexec.c &low, &high) <= 0) low 3669 ext/mbstring/oniguruma/regexec.c while (s >= low) { low 3693 ext/mbstring/oniguruma/regexec.c &low, &high) <= 0) goto mismatch; low 357 ext/mbstring/oniguruma/regint.h #define BBUF_EXPAND(buf,low) do{\ low 358 ext/mbstring/oniguruma/regint.h do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ low 1700 ext/mbstring/oniguruma/regparse.c int low, high, bound, x; low 1721 ext/mbstring/oniguruma/regparse.c for (low = 0, bound = n; low < bound; ) { low 1722 ext/mbstring/oniguruma/regparse.c x = (low + bound) >> 1; low 1724 ext/mbstring/oniguruma/regparse.c low = x + 1; low 1729 ext/mbstring/oniguruma/regparse.c for (high = low, bound = n; high < bound; ) { low 1737 ext/mbstring/oniguruma/regparse.c inc_n = low + 1 - high; low 1742 ext/mbstring/oniguruma/regparse.c if (from > data[low*2]) low 1743 ext/mbstring/oniguruma/regparse.c from = data[low*2]; low 1750 ext/mbstring/oniguruma/regparse.c int to_pos = SIZE_CODE_POINT * (1 + (low + 1) * 2); low 1761 ext/mbstring/oniguruma/regparse.c pos = SIZE_CODE_POINT * (1 + low * 2); low 2320 ext/mbstring/oniguruma/regparse.c int low, up, syn_allow, non_low = 0; low 2343 ext/mbstring/oniguruma/regparse.c low = onig_scan_unsigned_number(&p, end, env->enc); low 2344 ext/mbstring/oniguruma/regparse.c if (low < 0) return ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE; low 2345 ext/mbstring/oniguruma/regparse.c if (low > ONIG_MAX_REPEAT_NUM) low 2351 ext/mbstring/oniguruma/regparse.c low = 0; low 2378 ext/mbstring/oniguruma/regparse.c up = low; /* {n} : exact n times */ low 2390 ext/mbstring/oniguruma/regparse.c if (!IS_REPEAT_INFINITE(up) && low > up) { low 2395 ext/mbstring/oniguruma/regparse.c tok->u.repeat.lower = low; low 1626 ext/standard/array.c unsigned char *low, *high; low 1640 ext/standard/array.c low = (unsigned char *)Z_STRVAL_P(zlow); low 1643 ext/standard/array.c if (*low > *high) { /* Negative Steps */ low 1644 ext/standard/array.c unsigned char ch = *low; low 1656 ext/standard/array.c } else if (*high > *low) { /* Positive Steps */ low 1657 ext/standard/array.c unsigned char ch = *low; low 1670 ext/standard/array.c add_next_index_stringl(return_value, (const char *)low, 1, 1); low 1674 ext/standard/array.c double low, high, value; low 1679 ext/standard/array.c low = Z_DVAL_P(zlow); low 1683 ext/standard/array.c if (low > high) { /* Negative steps */ low 1684 ext/standard/array.c if (low - high < step || step <= 0) { low 1689 ext/standard/array.c for (value = low; value >= (high - DOUBLE_DRIFT_FIX); value = low - (++i * step)) { low 1692 ext/standard/array.c } else if (high > low) { /* Positive steps */ low 1693 ext/standard/array.c if (high - low < step || step <= 0) { low 1698 ext/standard/array.c for (value = low; value <= (high + DOUBLE_DRIFT_FIX); value = low + (++i * step)) { low 1702 ext/standard/array.c add_next_index_double(return_value, low); low 1705 ext/standard/array.c double low, high; low 1710 ext/standard/array.c low = Z_DVAL_P(zlow); low 1714 ext/standard/array.c if (low > high) { /* Negative steps */ low 1715 ext/standard/array.c if (low - high < lstep || lstep <= 0) { low 1719 ext/standard/array.c for (; low >= high; low -= lstep) { low 1720 ext/standard/array.c add_next_index_long(return_value, (long)low); low 1722 ext/standard/array.c } else if (high > low) { /* Positive steps */ low 1723 ext/standard/array.c if (high - low < lstep || lstep <= 0) { low 1727 ext/standard/array.c for (; low <= high; low += lstep) { low 1728 ext/standard/array.c add_next_index_long(return_value, (long)low); low 1731 ext/standard/array.c add_next_index_long(return_value, (long)low); low 353 ext/standard/basic_functions.c ZEND_ARG_INFO(0, low) low 125 ext/standard/flock_compat.c DWORD low = 1, high = 0; low 135 ext/standard/flock_compat.c UnlockFileEx(hdl, 0, low, high, &offset); low 140 ext/standard/flock_compat.c 0, low, high, &offset)) low 145 ext/standard/flock_compat.c 0, low, high, &offset)) low 107 ext/xmlrpc/libxmlrpc/queue.c static void QuickSort(void *list[], int low, int high, low 715 ext/xmlrpc/libxmlrpc/queue.c static void QuickSort(void *list[], int low, int high, low 721 ext/xmlrpc/libxmlrpc/queue.c if(low < high) { low 722 ext/xmlrpc/libxmlrpc/queue.c i = low; low 725 ext/xmlrpc/libxmlrpc/queue.c key = list[ low ]; low 744 ext/xmlrpc/libxmlrpc/queue.c temp = list[low]; low 745 ext/xmlrpc/libxmlrpc/queue.c list[low] = list[j]; low 748 ext/xmlrpc/libxmlrpc/queue.c QuickSort(list, low, j-1, Comp); low 856 ext/xmlrpc/libxmlrpc/queue.c int low, mid, hi, val; low 858 ext/xmlrpc/libxmlrpc/queue.c low = 0; low 861 ext/xmlrpc/libxmlrpc/queue.c while(low <= hi) { low 862 ext/xmlrpc/libxmlrpc/queue.c mid = (low + hi) / 2; low 869 ext/xmlrpc/libxmlrpc/queue.c low = mid + 1; low 58 win32/flock.c DWORD low = 1, high = 0; low 64 win32/flock.c UnlockFileEx(hdl, 0, low, high, &offset); low 69 win32/flock.c 0, low, high, &offset)) low 74 win32/flock.c 0, low, high, &offset))