Searched refs:NMAX (Results 1 - 4 of 4) sorted by relevance
/darwin-on-arm/xnu/libkern/zlib/ |
H A D | adler32.c | 49 #define NMAX 5552 macro 50 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */ 150 /* do length NMAX blocks -- requires just one modulo operation */ 151 while (len >= NMAX) { 152 len -= NMAX; 153 n = NMAX / 16; /* NMAX is divisible by 16 */ 162 /* do remaining bytes (less than NMAX, still just one modulo) */
|
/darwin-on-arm/xnu/libkern/zlib/intel/ |
H A D | adler32vec.s | 16 adler and sum2 (in 32-bit representation), will never overflow for the next NMAX=5552 bytes. This simplifies the 19 for (i=0;i<N;i+=NMAX) { 20 for (k=0;k<NMAX;k++) { 30 for (k=0;k<NMAX;k++) { 56 For i386, NMAX/16 = 347, whenever possible (NMAX-bytes block), it calls 173 times of macro code DO32 (K=32), 59 For x86_64 (where more xmm registers are available), NMAX/64 = 86, whenever possible (NMAX-bytes block), 75 #define NMAX 5552 /* NMAX i define [all...] |
/darwin-on-arm/xnu/libkern/ |
H A D | mkext.c | 34 #define NMAX 5552 // the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 macro 67 k = len < NMAX ? len : NMAX;
|
/darwin-on-arm/xnu/libkern/zlib/arm/ |
H A D | adler32vec.s | 4 #define NMAX 5552 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */ define 10 // while (len >= NMAX) { 11 // len -= NMAX; 12 // n = NMAX / 16; /* NMAX is divisible by 16 */ 136 subs len, nmax // pre-subtract len by NMAX 138 blt len_lessthan_NMAX // if (len < NMAX) skip the while loop 141 lsr vecs, nmax, #4 // vecs = NMAX/16; 152 subs len, nmax // len -= NMAX [all...] |
Completed in 19 milliseconds