Lines Matching refs:WORD_BITS
53 if (bitLength%WORD_BITS)
54 result.reg[result.reg.size()-1] = (word)Crop(result.reg[result.reg.size()-1], bitLength%WORD_BITS);
62 reg.CleanGrow(n/WORD_BITS + 1);
63 reg[n/WORD_BITS] |= (word(1) << (n%WORD_BITS));
67 if (n/WORD_BITS < reg.size())
68 reg[n/WORD_BITS] &= ~(word(1) << (n%WORD_BITS));
197 return (wordCount-1)*WORD_BITS + BitPrecision(reg[wordCount-1]);
228 PolynomialMod2 result((word)0, b.reg.size()*WORD_BITS);
235 PolynomialMod2 result((word)0, reg.size()*WORD_BITS);
244 PolynomialMod2 result((word)0, WORD_BITS*STDMIN(reg.size(), b.reg.size()));
266 PolynomialMod2 result((word)0, 2*reg.size()*WORD_BITS);
272 for (j=0; j<WORD_BITS; j+=8)
275 for (j=0; j<WORD_BITS; j+=8)
276 result.reg[2*i+1] |= map[(reg[i] >> (j/2 + WORD_BITS/2)) % 16] << j;
338 carry = u >> (WORD_BITS-1);
351 int shiftWords = n / WORD_BITS;
352 int shiftBits = n % WORD_BITS;
361 carry = u >> (WORD_BITS-shiftBits);
390 int shiftWords = n / WORD_BITS;
391 int shiftBits = n % WORD_BITS;
405 carry = u << (WORD_BITS-shiftBits);
593 if (t0-t1 < WORD_BITS)
620 k+=WORD_BITS;
665 while (k >= WORD_BITS)
673 if (t1 < WORD_BITS)
674 for (unsigned int j=0; j<WORD_BITS-t1; j++)
677 b[t1/WORD_BITS-1] ^= temp << t1%WORD_BITS;
679 if (t1 % WORD_BITS)
680 b[t1/WORD_BITS] ^= temp >> (WORD_BITS - t1%WORD_BITS);
682 if (t0%WORD_BITS)
684 b[t0/WORD_BITS-1] ^= temp << t0%WORD_BITS;
685 b[t0/WORD_BITS] ^= temp >> (WORD_BITS - t0%WORD_BITS);
688 b[t0/WORD_BITS-1] ^= temp;
690 k -= WORD_BITS;
695 word temp = b[0] << (WORD_BITS - k);
698 if (t1 < WORD_BITS)
699 for (unsigned int j=0; j<WORD_BITS-t1; j++)
702 b[t1/WORD_BITS-1] ^= temp << t1%WORD_BITS;
704 if (t1 % WORD_BITS)
705 b[t1/WORD_BITS] ^= temp >> (WORD_BITS - t1%WORD_BITS);
707 if (t0%WORD_BITS)
709 b[t0/WORD_BITS-1] ^= temp << t0%WORD_BITS;
710 b[t0/WORD_BITS] ^= temp >> (WORD_BITS - t0%WORD_BITS);
713 b[t0/WORD_BITS-1] ^= temp;
739 if (m%WORD_BITS)
740 r.reg.begin()[r.reg.size()-1] = (word)Crop(r.reg[r.reg.size()-1], m%WORD_BITS);
748 if (t0-t1 < WORD_BITS)
758 if (t0%WORD_BITS)
760 b[i-t0/WORD_BITS] ^= temp >> t0%WORD_BITS;
761 b[i-t0/WORD_BITS-1] ^= temp << (WORD_BITS - t0%WORD_BITS);
764 b[i-t0/WORD_BITS] ^= temp;
766 if ((t0-t1)%WORD_BITS)
768 b[i-(t0-t1)/WORD_BITS] ^= temp >> (t0-t1)%WORD_BITS;
769 b[i-(t0-t1)/WORD_BITS-1] ^= temp << (WORD_BITS - (t0-t1)%WORD_BITS);
772 b[i-(t0-t1)/WORD_BITS] ^= temp;
775 if (i==BitsToWords(t0)-1 && t0%WORD_BITS)
777 word mask = ((word)1<<(t0%WORD_BITS))-1;
781 b[i-t0/WORD_BITS] ^= temp >> t0%WORD_BITS;
783 if ((t0-t1)%WORD_BITS)
785 b[i-(t0-t1)/WORD_BITS] ^= temp >> (t0-t1)%WORD_BITS;
786 if ((t0-t1)%WORD_BITS > t0%WORD_BITS)
787 b[i-(t0-t1)/WORD_BITS-1] ^= temp << (WORD_BITS - (t0-t1)%WORD_BITS);
789 assert(temp << (WORD_BITS - (t0-t1)%WORD_BITS) == 0);
792 b[i-(t0-t1)/WORD_BITS] ^= temp;