Lines Matching refs:n
533 #define ACQUIRE_DTOA_LOCK(n) /*nothing*/ argument
534 #define FREE_DTOA_LOCK(n) /*nothing*/ argument
1013 int i, k1, n, n1; local
1018 n = k >> 5;
1020 n = k >> 4;
1023 n1 = n + b->wds + 1;
1028 for(i = 0; i < n; i++)
1727 int n; local
1730 n = k >> kshift;
1731 if (n < b->wds) {
1733 x += n;
1735 n = 32 - k;
1738 *x1++ = (y | (*x << n)) & 0xffffffff;
1759 int n, nwds; local
1764 n = k >> kshift;
1765 if (n > nwds)
1766 n = nwds;
1767 else if (n < nwds && (k &= kmask)) {
1768 x1 = x2 = x[n];
1775 x += n;
1801 int big, denorm, esign, havedig, k, n, nbits, up, zret; local
1904 if ((n = hexdig[*s]) == 0 || n > 0x19) {
1908 e1 = n - 0x10;
1909 while((n = hexdig[*++s]) !=0 && n <= 0x19) {
1912 e1 = 10*e1 + n - 0x10;
1967 n = s1 - s0 - 1;
1968 for(k = 0; n > (1 << (kshift-2)) - 1; n >>= 1)
1972 n = 0;
1987 if (n == ULbits) {
1990 n = 0;
1992 L |= (hexdig[*s1] & 0x0f) << n;
1993 n += 4;
1996 b->wds = n = x - b->x;
1997 n = ULbits*n - hi0bits(L);
2001 if (n > nbits) {
2002 n -= nbits;
2003 if (any_on(b,n)) {
2005 k = n - 1;
2012 rshift(b, n);
2013 e += n;
2015 else if (n < nbits) {
2016 n = nbits - n;
2017 b = lshift(b, n);
2018 e -= n;
2035 n = emin - e;
2036 if (n >= nbits) {
2040 if (n == nbits && (n < 2 || any_on(b,n-1)))
2061 k = n - 1;
2068 nbits -= n;
2069 rshift(b,n);
2100 || ((n = nbits & kmask) !=0
2101 && hi0bits(x[k-1]) < 32-n)) {
2172 int n; local
2183 n = S->wds;
2185 /*debug*/ if (b->wds > n)
2188 if (b->wds < n)
2191 sxe = sx + --n;
2193 bxe = bx + n;
2239 --n;
2240 b->wds = n;
2278 bxe = bx + n;
2281 --n;
2282 b->wds = n;
3630 nrv_alloc(s, rve, n) char *s, **rve; int n; in nrv_alloc() argument
3632 nrv_alloc(const char *s, char **rve, int n)
3637 t = rv = rv_alloc(n);
4561 int n; in zend_gcvt() local
4562 for (n = decpt, i = 0; (n /= 10) != 0; i++); in zend_gcvt()
