Home
last modified time | relevance | path

Searched refs:divisor (Results 1 – 25 of 88) sorted by relevance

1234

/external/guava/guava/src/com/google/common/primitives/
DUnsignedLongs.java178 public static long divide(long dividend, long divisor) { in divide() argument
179 if (divisor < 0) { // i.e., divisor >= 2^63: in divide()
180 if (compare(dividend, divisor) < 0) { in divide()
189 return dividend / divisor; in divide()
198 long quotient = ((dividend >>> 1) / divisor) << 1; in divide()
199 long rem = dividend - quotient * divisor; in divide()
200 return quotient + (compare(rem, divisor) >= 0 ? 1 : 0); in divide()
212 public static long remainder(long dividend, long divisor) { in remainder() argument
213 if (divisor < 0) { // i.e., divisor >= 2^63: in remainder()
214 if (compare(dividend, divisor) < 0) { in remainder()
[all …]
DUnsignedInts.java176 public static int divide(int dividend, int divisor) { in divide() argument
177 return (int) (toLong(dividend) / toLong(divisor)); in divide()
188 public static int remainder(int dividend, int divisor) { in remainder() argument
189 return (int) (toLong(dividend) % toLong(divisor)); in remainder()
/external/kernel-headers/original/linux/
Dcalc64.h17 #define div_long_long_rem(dividend, divisor, remainder) \ argument
18 do_div_llr((dividend), divisor, remainder)
21 const long divisor, long *remainder) in do_div_llr() argument
25 *(remainder) = do_div(result, divisor); in do_div_llr()
36 const long divisor, long *remainder) in div_long_long_rem_signed() argument
41 res = -div_long_long_rem(-dividend, divisor, remainder); in div_long_long_rem_signed()
44 res = div_long_long_rem(dividend, divisor, remainder); in div_long_long_rem_signed()
/external/v8/test/mjsunit/
Ddiv-mod.js44 function run_tests_for(divisor) { argument
45 print("(function(left) { return left / " + divisor + "; })");
46 var div_func = this.eval("(function(left) { return left / " + divisor + "; })");
47 var mod_func = this.eval("(function(left) { return left % " + divisor + "; })");
50 divmod(div_func, mod_func, 0, divisor);
51 divmod(div_func, mod_func, 1 / 0, divisor);
54 divmod(div_func, mod_func, Math.pow(2, exp), divisor);
55 divmod(div_func, mod_func, 0.9999999 * Math.pow(2, exp), divisor);
56 divmod(div_func, mod_func, 1.0000001 * Math.pow(2, exp), divisor);
60 divmod(div_func, mod_func, 1 << exp, divisor);
[all …]
/external/chromium/chrome/browser/debugger/manual_tests/resources/
Dprimes.js6 for (var divisor in this.primes_) {
7 if (p % divisor === 0) return false;
8 if (divisor * divisor > p)
/external/compiler-rt/test/Unit/
Ddivdc3_test.c55 double _Complex divisor; in test__divdc3() local
59 __real__ divisor = c; in test__divdc3() local
60 __imag__ divisor = d; in test__divdc3() local
65 switch (classify(divisor)) in test__divdc3()
90 switch (classify(divisor)) in test__divdc3()
121 switch (classify(divisor)) in test__divdc3()
146 switch (classify(divisor)) in test__divdc3()
171 switch (classify(divisor)) in test__divdc3()
Ddivxc3_test.c58 long double _Complex divisor; in test__divxc3() local
62 __real__ divisor = c; in test__divxc3() local
63 __imag__ divisor = d; in test__divxc3() local
68 switch (classify(divisor)) in test__divxc3()
93 switch (classify(divisor)) in test__divxc3()
124 switch (classify(divisor)) in test__divxc3()
149 switch (classify(divisor)) in test__divxc3()
174 switch (classify(divisor)) in test__divxc3()
Ddivsc3_test.c55 float _Complex divisor; in test__divsc3() local
59 __real__ divisor = c; in test__divsc3() local
60 __imag__ divisor = d; in test__divsc3() local
65 switch (classify(divisor)) in test__divsc3()
90 switch (classify(divisor)) in test__divsc3()
121 switch (classify(divisor)) in test__divsc3()
146 switch (classify(divisor)) in test__divsc3()
171 switch (classify(divisor)) in test__divsc3()
Dmulsc3_test.c55 float _Complex divisor; in test__mulsc3() local
59 __real__ divisor = c; in test__mulsc3() local
60 __imag__ divisor = d; in test__mulsc3() local
65 switch (classify(divisor)) in test__mulsc3()
90 switch (classify(divisor)) in test__mulsc3()
121 switch (classify(divisor)) in test__mulsc3()
146 switch (classify(divisor)) in test__mulsc3()
171 switch (classify(divisor)) in test__mulsc3()
Dmultc3_test.c58 long double _Complex divisor; in test__multc3() local
62 __real__ divisor = c; in test__multc3() local
63 __imag__ divisor = d; in test__multc3() local
68 switch (classify(divisor)) in test__multc3()
93 switch (classify(divisor)) in test__multc3()
120 switch (classify(divisor)) in test__multc3()
145 switch (classify(divisor)) in test__multc3()
170 switch (classify(divisor)) in test__multc3()
Ddivtc3_test.c59 long double _Complex divisor; in test__divtc3() local
63 __real__ divisor = c; in test__divtc3() local
64 __imag__ divisor = d; in test__divtc3() local
69 switch (classify(divisor)) in test__divtc3()
94 switch (classify(divisor)) in test__divtc3()
125 switch (classify(divisor)) in test__divtc3()
150 switch (classify(divisor)) in test__divtc3()
175 switch (classify(divisor)) in test__divtc3()
Dmulxc3_test.c58 long double _Complex divisor; in test__mulxc3() local
62 __real__ divisor = c; in test__mulxc3() local
63 __imag__ divisor = d; in test__mulxc3() local
68 switch (classify(divisor)) in test__mulxc3()
93 switch (classify(divisor)) in test__mulxc3()
120 switch (classify(divisor)) in test__mulxc3()
145 switch (classify(divisor)) in test__mulxc3()
170 switch (classify(divisor)) in test__mulxc3()
Dmuldc3_test.c55 double _Complex divisor; in test__muldc3() local
59 __real__ divisor = c; in test__muldc3() local
60 __imag__ divisor = d; in test__muldc3() local
65 switch (classify(divisor)) in test__muldc3()
90 switch (classify(divisor)) in test__muldc3()
117 switch (classify(divisor)) in test__muldc3()
142 switch (classify(divisor)) in test__muldc3()
167 switch (classify(divisor)) in test__muldc3()
/external/llvm/test/CodeGen/X86/
Ddiv8.ll6 define signext i8 @test_div(i8 %dividend, i8 %divisor) nounwind ssp {
9 %divisor.addr = alloca i8, align 1
12 store i8 %divisor, i8* %divisor.addr, align 1
14 %tmp1 = load i8* %divisor.addr, align 1
Dphys_subreg_coalesce-2.ll18 %indvar = phi i32 [ 0, %forcond.preheader ], [ %divisor.02, %forbody ] ; <i32> [#uses=3]
20 %divisor.02 = add i32 %indvar, 1 ; <i32> [#uses=2]
23 %div = udiv i32 %mul, %divisor.02 ; <i32> [#uses=2]
/external/v8/src/
Dfast-dtoa.cc423 uint32_t divisor; in DigitGen() local
426 &divisor, &divisor_exponent); in DigitGen()
434 int digit = integrals / divisor; in DigitGen()
437 integrals %= divisor; in DigitGen()
450 static_cast<uint64_t>(divisor) << -one.e(), unit); in DigitGen()
452 divisor /= 10; in DigitGen()
531 uint32_t divisor; in DigitGenCounted() local
534 &divisor, &divisor_exponent); in DigitGenCounted()
543 int digit = integrals / divisor; in DigitGenCounted()
547 integrals %= divisor; in DigitGenCounted()
[all …]
/external/icu4c/i18n/
Dnfsubs.cpp67 double divisor; member in MultiplierSubstitution
77 : NFSubstitution(_pos, _ruleSet, formatter, description, status), divisor(_divisor) in MultiplierSubstitution()
79 ldivisor = util64_fromDouble(divisor); in MultiplierSubstitution()
80 if (divisor == 0) { in MultiplierSubstitution()
86 divisor = uprv_pow(radix, exponent); in setDivisor()
87 ldivisor = util64_fromDouble(divisor); in setDivisor()
89 if(divisor == 0) { in setDivisor()
102 return uprv_floor(number / divisor); in transformNumber()
104 return number/divisor; in transformNumber()
109 return newRuleValue * divisor; in composeRuleValue()
[all …]
Dgregoimp.cpp40 double ClockMath::floorDivide(double dividend, double divisor, in floorDivide() argument
43 U_ASSERT(divisor > 0); in floorDivide()
44 double quotient = floorDivide(dividend, divisor); in floorDivide()
45 remainder = dividend - (quotient * divisor); in floorDivide()
49 if (remainder < 0 || remainder >= divisor) { in floorDivide()
67 remainder = dividend - (quotient * divisor); in floorDivide()
70 U_ASSERT(0 <= remainder && remainder < divisor); in floorDivide()
/external/webkit/Source/WebCore/platform/graphics/filters/
DFEConvolveMatrix.cpp38 float divisor, float bias, const IntPoint& targetOffset, EdgeModeType edgeMode, in FEConvolveMatrix() argument
42 , m_divisor(divisor) in FEConvolveMatrix()
53 float divisor, float bias, const IntPoint& targetOffset, EdgeModeType edgeMode, in create() argument
56 …return adoptRef(new FEConvolveMatrix(filter, kernelSize, divisor, bias, targetOffset, edgeMode, ke… in create()
81 float FEConvolveMatrix::divisor() const in divisor() function in WebCore::FEConvolveMatrix
86 bool FEConvolveMatrix::setDivisor(float divisor) in setDivisor() argument
88 if (m_divisor == divisor) in setDivisor()
90 m_divisor = divisor; in setDivisor()
225 ALWAYS_INLINE void setDestinationPixels(ByteArray* image, int& pixel, float* totals, float divisor,… in setDestinationPixels() argument
227 unsigned char maxAlpha = preserveAlphaValues ? 255 : clampRGBAValue(totals[3] / divisor + bias); in setDestinationPixels()
[all …]
/external/webkit/Source/JavaScriptCore/wtf/
DStdLibExtras.h118 template<size_t divisor> inline size_t roundUpToMultipleOf(size_t x) in roundUpToMultipleOf()
120 COMPILE_ASSERT(divisor && !(divisor & (divisor - 1)), divisor_is_a_power_of_two); in roundUpToMultipleOf()
122 size_t remainderMask = divisor - 1; in roundUpToMultipleOf()
/external/openssl/crypto/bn/
Dbn_div.c179 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, in BN_div() argument
200 if ((BN_get_flags(num, BN_FLG_CONSTTIME) != 0) || (BN_get_flags(divisor, BN_FLG_CONSTTIME) != 0)) in BN_div()
208 bn_check_top(divisor); in BN_div()
210 if (BN_is_zero(divisor)) in BN_div()
216 if (!no_branch && BN_ucmp(num,divisor) < 0) in BN_div()
235 norm_shift=BN_BITS2-((BN_num_bits(divisor))%BN_BITS2); in BN_div()
236 if (!(BN_lshift(sdiv,divisor,norm_shift))) goto err; in BN_div()
283 res->neg= (num->neg^divisor->neg); in BN_div()
/external/guava/guava-tests/test/com/google/common/primitives/
DUnsignedIntsTest.java93 int divisor = r.nextInt(); in testDivideRemainderEuclideanProperty() local
96 - (divisor * UnsignedInts.divide(dividend, divisor) + UnsignedInts.remainder(dividend, in testDivideRemainderEuclideanProperty()
97 divisor)) == 0); in testDivideRemainderEuclideanProperty()
DUnsignedLongsTest.java85 long divisor = r.nextLong(); in testDivideRemainderEuclideanProperty() local
87 assertTrue(dividend - (divisor * UnsignedLongs.divide(dividend, divisor) in testDivideRemainderEuclideanProperty()
88 + UnsignedLongs.remainder(dividend, divisor)) == 0); in testDivideRemainderEuclideanProperty()
/external/grub/docs/
Dkernel.c179 int divisor = 10; in itoa() local
189 divisor = 16; in itoa()
194 int remainder = ud % divisor; in itoa()
198 while (ud /= divisor); in itoa()
/external/webkit/Source/ThirdParty/ANGLE/src/libGLESv2/geometry/
Dvertexconversion.h81 const float divisor = 1.0f/(2*static_cast<float>(NL::max())+1);
82 return (2*f+1)*divisor;
100 const float divisor = 1.0f / static_cast<float>(static_cast<FromType>(1) << ScaleBits);
101 return static_cast<float>(x) * divisor;

1234