Lines Matching refs:word
22 PolynomialMod2::PolynomialMod2(word value, size_t bitLength)
51 PolynomialMod2 result((word)0, bitLength);
52 SetWords(result.reg, ~(word)0, result.reg.size());
54 result.reg[result.reg.size()-1] = (word)Crop(result.reg[result.reg.size()-1], bitLength%WORD_BITS);
63 reg[n/WORD_BITS] |= (word(1) << (n%WORD_BITS));
68 reg[n/WORD_BITS] &= ~(word(1) << (n%WORD_BITS));
83 reg[n/WORD_SIZE] &= ~(word(0xff) << 8*(n%WORD_SIZE));
84 reg[n/WORD_SIZE] |= (word(value) << 8*(n%WORD_SIZE));
89 PolynomialMod2 r((word)0, i+1);
96 PolynomialMod2 r((word)0, t0+1);
105 PolynomialMod2 r((word)0, t0+1);
114 template <word i>
153 reg[(i-1)/WORD_SIZE] |= word(b) << ((i-1)%WORD_SIZE)*8;
205 word temp=0;
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()));
251 PolynomialMod2 result((word)0, BitCount() + b.BitCount());
264 static const word map[16] = {0, 1, 4, 5, 16, 17, 20, 21, 64, 65, 68, 69, 80, 81, 84, 85};
266 PolynomialMod2 result((word)0, 2*reg.size()*WORD_BITS);
327 word u;
328 word carry=0;
329 word *r=reg;
394 word u;
395 word carry=0;
396 word *r=reg+reg.size()-1;
586 , result((word)0, m)
597 word *b = T;
598 word *c = T+m_modulus.reg.size();
599 word *f = T+2*m_modulus.reg.size();
600 word *g = T+3*m_modulus.reg.size();
612 word t=f[0];
667 word temp = b[0];
695 word temp = b[0] << (WORD_BITS - k);
723 Element r((word)0, m);
740 r.reg.begin()[r.reg.size()-1] = (word)Crop(r.reg[r.reg.size()-1], m%WORD_BITS);
756 word temp = b[i];
777 word mask = ((word)1<<(t0%WORD_BITS))-1;
778 word temp = b[i] & ~mask;