Searched refs:modulo (Results 1 – 25 of 26) sorted by relevance
12
/external/v8/src/ |
D | conversions-inl.h | 87 if (x < 0 || x >= two32) x = modulo(x, two32); in DoubleToInt32()
|
D | platform-nullos.cc | 51 double modulo(double x, double y) { in modulo() function
|
D | platform-posix.cc | 60 double modulo(double x, double y) { in modulo() function
|
D | platform.h | 120 double modulo(double x, double y);
|
D | platform-win32.cc | 232 double modulo(double x, double y) { in modulo() function 238 double modulo(double x, double y) { in modulo() function
|
D | conversions.cc | 668 chars[static_cast<int>(modulo(integer_part, radix))]; in DoubleToRadixCString()
|
D | assembler.cc | 734 return modulo(x, y); in mod_two_doubles()
|
D | runtime.cc | 4261 x = modulo(x, y); in Runtime_NumberMod()
|
/external/zlib/doc/ |
D | rfc1950.txt | 327 are done modulo 65521. s1 is initialized to 1, s2 to zero. The 484 The modulo on unsigned long accumulators can be delayed for 5552 485 bytes, so the modulo operation time is negligible. If the bytes 525 % modulo operator: a % b is the remainder of a divided by b.
|
D | rfc1952.txt | 429 data modulo 2^32.
|
/external/dropbear/libtommath/ |
D | bn.tex | 1298 This reduces $a$ modulo $b$ and stores the result in $c$. The sign of $c$ shall agree with the sig… 1319 This will reduce $a$ in place modulo $b$ with the precomputed $\mu$ value in $c$. $a$ must be in t… 1346 /* now reduce `c' modulo b */ 1360 /* now reduce `c' modulo b */ 1392 This reduces $a$ in place modulo $m$ with the pre--computed value $mp$. $a$ must be in the range 1515 This reduces $a$ in place modulo $b$ with the pre--computed value $mp$. $b$ must be of a restricted 1544 This will reduce $a$ in place modulo $n$ with the pre--computed value $d$. From my experience this… 1690 \hline LTM\_PRIME\_BBS & Make the prime congruent to $3$ modulo $4$ \\ 1806 then the result will be $-1$ when $a$ is not a quadratic residue modulo $p$. The result will be $0… 1807 and the result will be $1$ if $a$ is a quadratic residue modulo $p$. [all …]
|
D | changes.txt | 234 -- Added mp_reduce_2k which reduces an input modulo n = 2**p - k for any single digit k
|
/external/openssl/crypto/rc2/ |
D | rrc2.doc | 76 up the sum (modulo 256) in the S-box, and appending the result to the key. The
|
/external/libffi/ |
D | README | 255 Sparc port complete (modulo struct passing bug).
|
/external/chromium/third_party/icu/ |
D | icu.gyp | 29 # modulo removal of the .private_extern and .const directives and
|
/external/libvpx/vp8/common/ppc/ |
D | loopfilter_filters_altivec.asm | 831 andi. r7, r3, 8 ;# row origin modulo 16
|
/external/dropbear/libtomcrypt/ |
D | crypt.tex | 3225 RSA is a public key algorithm that is based on the inability to find the \textit{e-th} root modulo … 3230 multiplicative sub-group formed modulo $N$ is given as $\phi(N) = (p - 1)(q - 1)$ which can be redu… 3232 …i(N)) = 1$. The private key consists of the composite $N$ and the inverse of $e$ modulo $\phi(N)$ 3616 They are all curves over the integers modulo a prime. The curves have the basic equation that is: 4035 …\item $g = h^r \mbox{ (mod }p\mbox{)}$ a generator of order $q$ modulo $p$. $h$ can be any non-tr… 4046 \item $g$ cannot be one of $\lbrace -1, 0, 1 \rbrace$ (modulo $p$). 4891 In essence a table of machine-word sized residues are kept of a candidate modulo a set of primes. … 4897 …primes $p$ and $q$ are required. The order of the multiplicative sub-group (modulo $pq$) is given
|
/external/webkit/JavaScriptCore/ |
D | ChangeLog-2003-10-25 | 669 Moved from linear probing to double hashing, using the hash modulo
|
D | ChangeLog | 415 Add a soft modulo operation to ARM JIT using a trampoline function.
|
/external/webkit/WebKitTools/android/flex-2.5.4a/MISC/ |
D | flex.man | 2760 number of rules or (modulo the considerations given at the
|
/external/webkit/WebKitTools/android/flex-2.5.4a/MISC/texinfo/ |
D | flex.info | 2237 independent of the number of rules or (modulo the considerations given
|
D | flex.texi | 2655 number of rules or (modulo the considerations given at the
|
/external/webkit/WebCore/ |
D | ChangeLog-2002-12-03 | 8310 right, but it's probably OK modulo the actual bidi support.
|
/external/webkit/WebKit/mac/ |
D | ChangeLog-2006-02-09 | 7332 If our previousValidKeyView is nil or self (same as nil modulo AppKit oddness),
|
/external/sqlite/dist/ |
D | sqlite3.c.orig | 19739 unsigned int h; /* the hash of the key modulo hash table size */ 102416 int h; /* the hash of the key modulo hash table size */
|
12