Searched refs:BASE (Results 1 - 4 of 4) sorted by relevance
/darwin-on-arm/xnu/libkern/zlib/ |
H A D | adler32.c | 48 #define BASE 65521UL /* largest prime smaller than 65536 */ macro 50 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */ 62 if (a >= (BASE << 16)) a -= (BASE << 16); \ 63 if (a >= (BASE << 15)) a -= (BASE << 15); \ 64 if (a >= (BASE << 14)) a -= (BASE << 14); \ 65 if (a >= (BASE << 13)) a -= (BASE << 1 [all...] |
/darwin-on-arm/xnu/libkern/ |
H A D | mkext.c | 33 #define BASE 65521L /* largest prime smaller than 65536 */ macro 34 #define NMAX 5552 // the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 56 if (s1 >= BASE) s1 -= BASE; 58 s2 %= BASE; 78 s1 %= BASE; 79 s2 %= BASE;
|
/darwin-on-arm/xnu/libkern/zlib/arm/ |
H A D | adler32vec.s | 3 #define BASE 65521 /* largest prime smaller than 65536 */ define 4 #define NMAX 5552 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */ 63 adler%BASE = adler - floor(adler*(1/BASE))*BASE; where (1/BASE) = 0x80078071 in Q47 64 1. vmull.u32 q2,(adler,sum2),(1/BASE) // *(1/BASE) in Q47 67 4. vmls.u32 (adler,sum2),d4,d3[0] // (adler,sum2) -= floor[(adler,sum2)/BASE]*BASE [all...] |
/darwin-on-arm/xnu/libkern/zlib/intel/ |
H A D | adler32vec.s | 7 Given 2 unsigned 32-bit alder and sum2 (both pre-modulo by BASE=65521) and a sequence of input bytes x[0],...x[N-1]. 11 adler = (adler+x[i])%BASE; 12 sum2 = (sum2+adler)%BASE; 15 To reduce/save the modulo operations, it can be shown that, if initial alder and sum2 are less than BASE(=65521), 24 adler%=BASE; 25 sum2%=BASE; 74 #define BASE 65521 /* largest prime smaller than 65536 */ define 75 #define NMAX 5552 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */ 148 movl $$-2146992015, %eax // 1/BASE in Q47 149 mull adler // edx:eax = adler divided by BASE i [all...] |
Completed in 75 milliseconds