/prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/asm/internal/asm/ |
parse.go | 818 divisor := p.factor() 819 if divisor == 0 { 822 value /= divisor 826 divisor := p.factor() 830 if divisor == 0 { 833 value %= divisor
|
/prebuilts/go/darwin-x86/src/cmd/asm/internal/asm/ |
parse.go | 815 divisor := p.factor() 816 if divisor == 0 { 819 value /= divisor 823 divisor := p.factor() 827 if divisor == 0 { 830 value %= divisor
|
/prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/asm/internal/asm/ |
parse.go | 818 divisor := p.factor() 819 if divisor == 0 { 822 value /= divisor 826 divisor := p.factor() 830 if divisor == 0 { 833 value %= divisor
|
/prebuilts/go/linux-x86/src/cmd/asm/internal/asm/ |
parse.go | 815 divisor := p.factor() 816 if divisor == 0 { 819 value /= divisor 823 divisor := p.factor() 827 if divisor == 0 { 830 value %= divisor
|
/external/bison/lib/ |
hash.c | 446 size_t divisor = 3; local 447 size_t square = divisor * divisor; 449 while (square < candidate && (candidate % divisor)) 451 divisor++; 452 square += 4 * divisor; 453 divisor++; 456 return (candidate % divisor ? true : false); [all...] |
/external/boringssl/src/include/openssl/ |
bn.h | 413 /* BN_div divides |numerator| by |divisor| and places the result in |quotient| 419 const BIGNUM *numerator, const BIGNUM *divisor, 422 /* BN_div_word sets |numerator| = |numerator|/|divisor| and returns the 424 OPENSSL_EXPORT BN_ULONG BN_div_word(BIGNUM *numerator, BN_ULONG divisor); 504 #define BN_mod(rem, numerator, divisor, ctx) \ 505 BN_div(NULL, (rem), (numerator), (divisor), (ctx)) 508 * |rem| < |divisor| is always true. It returns one on success and zero on 511 const BIGNUM *divisor, BN_CTX *ctx); [all...] |
/external/skia/dm/ |
DMSrcSink.h | 142 // Splits the image into multiple subsets using a divisor and decodes the subsets 169 // Splits the image into multiple regions using a divisor and decodes the regions
|
/libcore/luni/src/main/java/java/math/ |
BigInt.java | 296 static void division(BigInt dividend, BigInt divisor, BigInt quotient, BigInt remainder) { 310 NativeBN.BN_div(quot, rem, dividend.bignum, divisor.bignum);
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
NFRule.java | 70 * the rule's divisor) 76 * equals the rule's divisor) 136 // new it up and initialize its basevalue and divisor 166 // base value is an even multiple of its divisor (or it's one 201 // same divisor) 537 // of the rule's divisor. Fix their copies of the divisor. 721 * Returns the rule's divisor (the value that cotrols the behavior 723 * @return The rule's divisor [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
NFRule.java | 69 * the rule's divisor) 75 * equals the rule's divisor) 135 // new it up and initialize its basevalue and divisor 165 // base value is an even multiple of its divisor (or it's one 200 // same divisor) 536 // of the rule's divisor. Fix their copies of the divisor. 720 * Returns the rule's divisor (the value that cotrols the behavior 722 * @return The rule's divisor [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/linear/ |
SimplexTableau.java | 403 * @param divisor value of the divisor 405 protected void divideRow(final int dividendRow, final double divisor) { 407 tableau.setEntry(dividendRow, j, tableau.getEntry(dividendRow, j) / divisor);
|
/external/chromium-trace/catapult/third_party/gsutil/third_party/rsa/rsa/ |
prime.py | 28 '''Returns the greatest common divisor of p and q
|
/external/clang/test/SemaCXX/ |
complex-folding.cpp | 52 // when the divisor.
|
/external/compiler-rt/lib/builtins/arm/ |
udivmodsi4.S | 24 @ unsigned int __udivmodsi4(unsigned int divident, unsigned int divisor,
|
udivsi3.S | 27 @ unsigned int __udivsi3(unsigned int divident, unsigned int divisor)
|
umodsi3.S | 23 @ unsigned int __umodsi3(unsigned int divident, unsigned int divisor)
|
/external/guava/guava-tests/benchmark/com/google/common/primitives/ |
UnsignedLongsBenchmark.java | 123 // trivial because the divisor is bigger than the dividend.
|
/external/iproute2/ |
README.iproute2+tc | 93 $TC filter add dev eth1 parent 1:0 prio 5 handle 1: u32 divisor 256
|
/external/libcxx/www/ |
ts1z_status.html | 51 <tr><td><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4061">4061</a></td><td>Greatest Common Divisor and Least Common Multiple.</td><td>Library Fundamentals 2</td></tr>
|
/external/llvm/include/llvm/Transforms/ |
Instrumentation.h | 159 /// Given the maximum count, calculate a divisor that will scale all the
|
/external/llvm/lib/Support/ |
APInt.cpp | [all...] |
/external/llvm/test/CodeGen/X86/ |
fdiv-combine.ll | 3 ; More than one 'arcp' division using a single divisor operand
|
/external/mesa3d/src/gallium/drivers/radeon/ |
AMDGPUISelLowering.h | 111 DIV_INF, // Divide with infinity returned on zero divisor
|
/external/mesa3d/src/mesa/drivers/x11/ |
realglx.h | 179 _real_glXWaitVideoSyncSGI(int divisor, int remainder, unsigned int *count);
|
/external/mesa3d/src/mesa/main/ |
varray.h | 260 _mesa_VertexAttribDivisor(GLuint index, GLuint divisor);
|