high 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) high 78 ext/gd/libgd/gd_interpolation.c #define CLAMP(x, low, high) (((x) > (high)) ? (high) : (((x) < (low)) ? (low) : (x))) high 105 ext/mbstring/oniguruma/enc/utf16_be.c unsigned int plane, high; high 109 ext/mbstring/oniguruma/enc/utf16_be.c high = (code & 0xff00) >> 8; high 110 ext/mbstring/oniguruma/enc/utf16_be.c *p++ = ((plane & 0x03) << 6) + (high >> 2); high 111 ext/mbstring/oniguruma/enc/utf16_be.c *p++ = (high & 0x03) + 0xdc; high 107 ext/mbstring/oniguruma/enc/utf16_le.c unsigned int plane, high; high 110 ext/mbstring/oniguruma/enc/utf16_le.c high = (code & 0xff00) >> 8; high 112 ext/mbstring/oniguruma/enc/utf16_le.c *p++ = ((plane & 0x03) << 6) + (high >> 2); high 115 ext/mbstring/oniguruma/enc/utf16_le.c *p = (high & 0x03) + 0xdc; high 5606 ext/mbstring/oniguruma/regcomp.c OnigCodePoint low, high, x; high 5612 ext/mbstring/oniguruma/regcomp.c for (low = 0, high = n; low < high; ) { high 5613 ext/mbstring/oniguruma/regcomp.c x = (low + high) >> 1; high 5617 ext/mbstring/oniguruma/regcomp.c high = x; high 3115 ext/mbstring/oniguruma/regexec.c UChar* range, UChar** low, UChar** high, UChar** low_prev) high 3226 ext/mbstring/oniguruma/regexec.c *high = p - reg->dmin; high 3231 ext/mbstring/oniguruma/regexec.c (int )(*low - str), (int )(*high - str), reg->dmin, reg->dmax); high 3247 ext/mbstring/oniguruma/regexec.c UChar** low, UChar** high) high 3330 ext/mbstring/oniguruma/regexec.c *high = p - reg->dmin; high 3331 ext/mbstring/oniguruma/regexec.c *high = onigenc_get_right_adjust_char_head(reg->enc, adjrange, *high); high 3336 ext/mbstring/oniguruma/regexec.c (int )(*low - str), (int )(*high - str)); high 3582 ext/mbstring/oniguruma/regexec.c UChar *sch_range, *low, *high, *low_prev; high 3600 ext/mbstring/oniguruma/regexec.c &low, &high, &low_prev)) goto mismatch; high 3605 ext/mbstring/oniguruma/regexec.c while (s <= high) { high 3615 ext/mbstring/oniguruma/regexec.c &low, &high, (UChar** )NULL)) goto mismatch; high 3650 ext/mbstring/oniguruma/regexec.c UChar *low, *high, *adjrange, *sch_start; high 3663 ext/mbstring/oniguruma/regexec.c &low, &high) <= 0) high 3666 ext/mbstring/oniguruma/regexec.c if (s > high) high 3667 ext/mbstring/oniguruma/regexec.c s = high; high 3693 ext/mbstring/oniguruma/regexec.c &low, &high) <= 0) goto mismatch; high 1700 ext/mbstring/oniguruma/regparse.c int low, high, bound, x; high 1729 ext/mbstring/oniguruma/regparse.c for (high = low, bound = n; high < bound; ) { high 1730 ext/mbstring/oniguruma/regparse.c x = (high + bound) >> 1; high 1732 ext/mbstring/oniguruma/regparse.c high = x + 1; high 1737 ext/mbstring/oniguruma/regparse.c inc_n = low + 1 - high; high 1744 ext/mbstring/oniguruma/regparse.c if (to < data[(high - 1)*2 + 1]) high 1745 ext/mbstring/oniguruma/regparse.c to = data[(high - 1)*2 + 1]; high 1748 ext/mbstring/oniguruma/regparse.c if (inc_n != 0 && (OnigCodePoint )high < n) { high 1749 ext/mbstring/oniguruma/regparse.c int from_pos = SIZE_CODE_POINT * (1 + high * 2); high 1751 ext/mbstring/oniguruma/regparse.c int size = (n - high) * 2 * SIZE_CODE_POINT; high 1626 ext/standard/array.c unsigned char *low, *high; high 1641 ext/standard/array.c high = (unsigned char *)Z_STRVAL_P(zhigh); high 1643 ext/standard/array.c if (*low > *high) { /* Negative Steps */ high 1650 ext/standard/array.c for (; ch >= *high; ch -= (unsigned int)lstep) { high 1656 ext/standard/array.c } else if (*high > *low) { /* Positive Steps */ high 1663 ext/standard/array.c for (; ch <= *high; ch += (unsigned int)lstep) { high 1674 ext/standard/array.c double low, high, value; high 1680 ext/standard/array.c high = Z_DVAL_P(zhigh); high 1683 ext/standard/array.c if (low > high) { /* Negative steps */ high 1684 ext/standard/array.c if (low - high < step || step <= 0) { high 1689 ext/standard/array.c for (value = low; value >= (high - DOUBLE_DRIFT_FIX); value = low - (++i * step)) { high 1692 ext/standard/array.c } else if (high > low) { /* Positive steps */ high 1693 ext/standard/array.c if (high - low < step || step <= 0) { high 1698 ext/standard/array.c for (value = low; value <= (high + DOUBLE_DRIFT_FIX); value = low + (++i * step)) { high 1705 ext/standard/array.c double low, high; high 1711 ext/standard/array.c high = Z_DVAL_P(zhigh); high 1714 ext/standard/array.c if (low > high) { /* Negative steps */ high 1715 ext/standard/array.c if (low - high < lstep || lstep <= 0) { high 1719 ext/standard/array.c for (; low >= high; low -= lstep) { high 1722 ext/standard/array.c } else if (high > low) { /* Positive steps */ high 1723 ext/standard/array.c if (high - low < lstep || lstep <= 0) { high 1727 ext/standard/array.c for (; low <= high; low += lstep) { high 354 ext/standard/basic_functions.c ZEND_ARG_INFO(0, high) high 125 ext/standard/flock_compat.c DWORD low = 1, high = 0; high 135 ext/standard/flock_compat.c UnlockFileEx(hdl, 0, low, high, &offset); high 140 ext/standard/flock_compat.c 0, low, high, &offset)) high 145 ext/standard/flock_compat.c 0, low, high, &offset)) high 107 ext/xmlrpc/libxmlrpc/queue.c static void QuickSort(void *list[], int low, int high, high 715 ext/xmlrpc/libxmlrpc/queue.c static void QuickSort(void *list[], int low, int high, high 721 ext/xmlrpc/libxmlrpc/queue.c if(low < high) { high 723 ext/xmlrpc/libxmlrpc/queue.c j = high + 1; high 749 ext/xmlrpc/libxmlrpc/queue.c QuickSort(list, j+1, high, Comp); high 58 win32/flock.c DWORD low = 1, high = 0; high 64 win32/flock.c UnlockFileEx(hdl, 0, low, high, &offset); high 69 win32/flock.c 0, low, high, &offset)) high 74 win32/flock.c 0, low, high, &offset))