HomeSort by relevance Sort by last modified time
    Searched full:divide (Results 51 - 75 of 1557) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/compiler-rt/lib/builtins/arm/
divmodsi4.S 1 /*===-- divmodsi4.S - 32-bit signed integer divide and modulus ------------===//
10 * This file implements the __divmodsi4 (32-bit signed integer divide and
divsi3.S 1 /*===-- divsi3.S - 32-bit signed integer divide ---------------------------===//
10 * This file implements the __divsi3 (32-bit signed integer divide) function
  /external/mesa3d/src/glsl/
lower_texture_projection.cpp 31 * and does the divide internally, thus the presence of the projector
33 * logic for handling the divide.
  /art/runtime/arch/arm/
arm_sdiv.S 20 // if the divide worked, r0 will have the value #1 (result of sdiv).
  /art/test/014-math3/src/
Main.java 39 * Floating point divide by zero doesn't throw an exception -- the
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
SimpleBigDecimal.java 126 public SimpleBigDecimal divide(SimpleBigDecimal b) method in class:SimpleBigDecimal
130 return new SimpleBigDecimal(dividend.divide(b.bigInt), scale);
133 public SimpleBigDecimal divide(BigInteger b) method in class:SimpleBigDecimal
135 return new SimpleBigDecimal(bigInt.divide(b), scale);
  /external/chromium_org/chrome/test/perf/
url_parse_perftest.cc 74 for (int i = 0; i < 333333; i++) { // divide by 3 so we get 1M
101 for (int i = 0; i < 333333; i++) { // divide by 3 so we get 1M
130 for (int i = 0; i < 333333; i++) { // divide by 3 so we get 1M
141 for (int i = 0; i < 333333; i++) { // divide by 3 so we get 1M
  /external/chromium_org/printing/
units.cc 15 // With integer arithmetic, to divide a value with correct rounding, you need
  /external/clang/test/SemaCXX/
__try.cpp 45 throw(Exception("Hardware error: Divide by 0"));
  /external/compiler-rt/lib/builtins/i386/
udivdi3.S 11 // No other exceptions are generated, as the divide cannot overflow.
14 // on x86_64. The performance goal is ~40 cycles per divide, which is faster than
41 cmpl %ebx, %edx // to avoid overflowing the upcoming divide.
71 subl %ebx, %edx // subtract bhi from ahi so that divide will not
umoddi3.S 11 // No other exceptions are generated, as the divide cannot overflow.
14 // on x86_64. The performance goal is ~40 cycles per divide, which is faster than
42 cmpl %ebx, %edx // to avoid overflowing the upcoming divide.
76 subl %ebx, %edx // subtract bhi from ahi so that divide will not
divdi3.S 11 // No other exceptions are generated, as the divide cannot overflow.
14 // on x86_64. The performance goal is ~40 cycles per divide, which is faster than
25 /* This is currently implemented by wrapping the unsigned divide up in an absolute
70 cmpl %ebx, %edx // to avoid overflowing the upcoming divide.
106 subl %ebx, %edx // subtract bhi from ahi so that divide will not
  /external/eigen/unsupported/Eigen/src/SVD/
doneInBDCSVD.txt 1 This unsupported package is about a divide and conquer algorithm to compute SVD.
  /external/kernel-headers/original/uapi/asm-mips/asm/
break.h 21 #define BRK_DIVZERO 7 /* Divide by zero check */
  /external/llvm/test/CodeGen/ARM/Windows/
no-aeabi.ll 25 define i32 @divide(i32 %i, i32 %j) nounwind {
  /external/llvm/test/CodeGen/PowerPC/
ppcf128-1-opt.ll 24 define ppc_fp128 @divide(ppc_fp128 %x, ppc_fp128 %y) {
  /external/pdfium/core/src/fxcodec/fx_libopenjpeg/libopenjpeg20/
opj_intmath.h 107 Divide an integer and round upwards
116 Divide an integer and round upwards
124 Divide an integer by a power of 2 and round upwards
131 Divide an integer by a power of 2 and round downwards
  /external/valgrind/main/none/tests/s390x/
dfp-1.c 82 /* 64-bit DIVIDE */
83 printf("64-bit DIVIDE\n");
154 /* 128-bit DIVIDE */
155 printf("128-bit DIVIDE\n");
  /frameworks/av/media/libeffects/loudness/dsp/core/
basic.h 28 // Searchs for the interval that contains <x> using a divide-and-conquer
  /libcore/benchmarks/src/benchmarks/regression/
BigIntegerBenchmark.java 30 x.divide(y);
  /ndk/tests/build/b8247455-hidden-cxa/jni/
Android.mk 8 # File idiv.cpp contains code potentially causes divide-by-zero exception. libidiv.so
  /external/cmockery/cmockery_0_1_2/src/example/
calculator_test.c 44 extern int divide(int a, int b);
112 // Ensure divide() divides one integer by another correctly.
114 assert_int_equal(divide(10, 2), 5);
115 assert_int_equal(divide(2, 10), 0);
118 // Ensure divide() asserts when trying to divide by zero.
120 expect_assert_failure(divide(100, 0));
  /external/chromium_org/third_party/skia/src/core/
SkPoint.cpp 122 // divide by inf. and return (0,0) vector.
127 // we perform the divide with the double magmag, to stay exactly the
128 // same as setLength. It would be faster to perform the divide with
168 // divide by inf. and return (0,0) vector.
194 // divide by inf. and return (0,0) vector.
  /external/icu/icu4c/source/common/
dictbe.h 117 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
174 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
230 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
286 * <p>Divide up a range of known dictionary characters.</p>
349 * <p>Divide up a range of known dictionary characters handled by this break engine.</p>
  /external/proguard/src/proguard/evaluation/value/
DoubleValue.java 96 public abstract DoubleValue divide(DoubleValue other); method in class:DoubleValue
179 public DoubleValue divide(SpecificDoubleValue other) method in class:DoubleValue
181 return divide((DoubleValue)other);
282 public DoubleValue divide(ParticularDoubleValue other) method in class:DoubleValue
284 return divide((SpecificDoubleValue)other);

Completed in 685 milliseconds

1 23 4 5 6 7 8 91011>>