Searched refs:WORD_BITS (Results 1 - 8 of 8) sorted by relevance

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/libcryptoxx-5.6.0/
H A Dgf2n.cpp53 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);
[all...]
H A Dwords.h53 assert (shiftBits<WORD_BITS);
60 carry = u >> (WORD_BITS-shiftBits);
67 assert (shiftBits<WORD_BITS);
74 carry = u << (WORD_BITS-shiftBits);
H A Dgf2n.h41 and most significant bit as coefficient to x^(WORD_BITS-1)
44 PolynomialMod2(word value, size_t bitLength=WORD_BITS);
119 {return (i/WORD_BITS < reg.size()) ? int(reg[i/WORD_BITS] >> (i % WORD_BITS)) & 1 : 0;}
H A Dmodarith.h132 {return (a<<(WORD_BITS*m_modulus.reg.size()))%m_modulus;}
137 {return m_result1 = Integer::Power2(WORD_BITS*m_modulus.reg.size())%m_modulus;}
H A Dinteger.cpp95 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)
[all...]
H A Dconfig.h158 const unsigned int WORD_BITS = WORD_SIZE * 8; variable
H A Dmisc.h290 return ((bitCount+WORD_BITS-1)/(WORD_BITS));
295 return ((bitCount+2*WORD_BITS-1)/(2*WORD_BITS));
H A Dalgebra.cpp221 unsigned int expLen = exp.WordCount() * WORD_BITS;

Completed in 103 milliseconds