Lines Matching refs:WORD_BITS
95 for (unsigned i=3; i<WORD_BITS; i*=2)
132 #define Double3Words(c, d) d##1 = 2*d##1 + (d##0>>(WORD_BITS-1)); d##0 = 2*d##0 + (c>>(WORD_BITS-1)); c *= 2;
152 #define HighWord(a) word(a>>WORD_BITS)
153 #define Double3Words(c, d) d = 2*d + (c>>(WORD_BITS-1)); c *= 2;
157 #define GetBorrow(u) word(u>>(WORD_BITS*2-1))
306 m_whole = low | (word(high) << (WORD_BITS/2));
343 hword GetHighHalf() const {return hword(m_whole>>(WORD_BITS/2));}
344 hword GetHighHalfAsBorrow() const {return 0-hword(m_whole>>(WORD_BITS/2));}
391 if (!B) // if divisor is 0, we assume divisor==2**(2*WORD_BITS)
422 if (a < (word(1) << (WORD_BITS/2)))
426 r = ((m_halfs.low >> (WORD_BITS/2)) + (r << (WORD_BITS/2))) % h;
427 return hword((hword(m_halfs.low) + (r << (WORD_BITS/2))) % h);
2278 // R[N] ----- result = A inverse mod 2**(WORD_BITS*N)
2307 // R[N] --- result = X/(2**(WORD_BITS*N)) mod M
2311 // U[N] --- multiplicative inverse of M mod 2**(WORD_BITS*N)
2379 // R[N] --- result = X/(2**(WORD_BITS*N/2)) mod M
2383 // U[N/2] - multiplicative inverse of M mod 2**(WORD_BITS*N/2)
2384 // V[N] --- 2**(WORD_BITS*3*N/2) mod M
2489 if (!B[0] && !B[1]) // if divisor is 0, we assume divisor==2**(2*WORD_BITS)
2572 unsigned shiftBits = WORD_BITS - BitPrecision(TB[NB-1]);
2573 assert(shiftBits < WORD_BITS);
2656 k+=WORD_BITS;
2723 R[N-1] += carry<<(WORD_BITS-1);
2783 reg[1] = word(SafeRightShift<WORD_BITS>(value));
2797 reg[1] = word(SafeRightShift<WORD_BITS>((unsigned long)value));
2813 value += SafeLeftShift<WORD_BITS, unsigned long>((unsigned long)reg[1]);
2826 value += SafeLeftShift<WORD_BITS, unsigned long>((unsigned long)reg[1]);
2906 if (n/WORD_BITS >= reg.size())
2909 return bool((reg[n/WORD_BITS] >> (n % WORD_BITS)) & 1);
2917 reg[n/WORD_BITS] |= (word(1) << (n%WORD_BITS));
2921 if (n/WORD_BITS < reg.size())
2922 reg[n/WORD_BITS] &= ~(word(1) << (n%WORD_BITS));
3068 return (wordCount-1)*WORD_BITS + BitPrecision(reg[wordCount-1]);
3643 const size_t shiftWords = n / WORD_BITS;
3644 const unsigned int shiftBits = (unsigned int)(n % WORD_BITS);
3655 const size_t shiftWords = n / WORD_BITS;
3656 const unsigned int shiftBits = (unsigned int)(n % WORD_BITS);
3773 if (n % WORD_BITS != 0)
3774 r.reg[wordCount-1] %= (word(1) << (n % WORD_BITS));
4222 // return (EuclideanMultiplicativeInverse(a, modulus)<<(2*WORD_BITS*modulus.reg.size()))%modulus;
4235 if (k>N*WORD_BITS)
4236 DivideByPower2Mod(R, R, k-N*WORD_BITS, m_modulus.reg, N);
4238 MultiplyByPower2Mod(R, R, N*WORD_BITS-k, m_modulus.reg, N);