Searched refs:Mod (Results 1 - 6 of 6) sorted by relevance
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/libcryptoxx-5.6.0/ |
H A D | algebra.h | 145 virtual const Element& Mod(const Element &a, const Element &b) const =0; 204 const Element& Mod(const Element &a, const Element &b) const function in class:EuclideanDomainOf 234 {return m_domain.Equal(m_domain.Mod(m_domain.Subtract(a, b), m_modulus), m_domain.Identity());} 264 {return m_domain.Mod(m_domain.Multiply(a, b), m_modulus);} 267 {return m_domain.Mod(m_domain.Square(a), m_modulus);}
|
H A D | twofish.cpp | 12 static inline unsigned int Mod(unsigned int c) function 26 high = Mod(high>>24) ^ (high<<8) ^ (low>>24);
|
H A D | algebra.cpp | 49 template <class T> const T& AbstractEuclideanDomain<T>::Mod(const Element &a, const Element &b) const function in class:AbstractEuclideanDomain 63 g[i2] = Mod(g[i0], g[i1]);
|
H A D | polynomi.h | 365 const Element& Mod(const Element &a, const Element &b) const function in class:RingOfPolynomialsOver
|
H A D | gf2n.cpp | 749 return m_domain.Mod(a, m_modulus);
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/char/rio/ |
H A D | rioroute.c | 94 int Mod, Mod1, Mod2; local 269 Mod = readb(&PktCmdP->ModuleTypes); 270 Mod1 = LONYBLE(Mod); 279 Mod2 = HINYBLE(Mod); 405 HostP->UnixRups[ThisUnit].ModTypes = Mod; 407 HostP->UnixRups[ThisUnit2].ModTypes = Mod;
|
Completed in 125 milliseconds