/external/kernel-headers/original/linux/ |
calc64.h | 11 * The 64bit dividend is divided by the divisor (data type long), the 17 #define div_long_long_rem(dividend, divisor, remainder) \ 18 do_div_llr((dividend), divisor, remainder) 21 const long divisor, long *remainder) 25 *(remainder) = do_div(result, divisor); 36 const long divisor, long *remainder) 41 res = -div_long_long_rem(-dividend, divisor, remainder); 44 res = div_long_long_rem(dividend, divisor, remainder);
|
/bionic/libc/kernel/common/linux/ |
calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
/development/ndk/platforms/android-3/include/linux/ |
calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
/prebuilt/ndk/android-ndk-r4/platforms/android-3/arch-arm/usr/include/linux/ |
calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
/prebuilt/ndk/android-ndk-r4/platforms/android-4/arch-arm/usr/include/linux/ |
calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
/prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-arm/usr/include/linux/ |
calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
/prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-x86/usr/include/linux/ |
calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
/prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-arm/usr/include/linux/ |
calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
/prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-x86/usr/include/linux/ |
calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
/libcore/luni/src/main/java/java/math/ |
Division.java | 50 final int divisor) { 53 long bLong = divisor & 0xffffffffL; 67 long bPos = divisor >>> 1; 72 if ((divisor & 1) != 0) { 73 // the divisor is odd
|
BigDecimal.java | 1142 long divisor = scaledDivisor.longValue(); local [all...] |
/external/v8/test/mjsunit/ |
div-mod.js | 42 function run_tests_for(divisor) { 43 print("(function(left) { return left / " + divisor + "; })"); 44 var div_func = this.eval("(function(left) { return left / " + divisor + "; })"); 45 var mod_func = this.eval("(function(left) { return left % " + divisor + "; })"); 48 divmod(div_func, mod_func, 0, divisor); 49 divmod(div_func, mod_func, 1 / 0, divisor); 52 divmod(div_func, mod_func, Math.pow(2, exp), divisor); 53 divmod(div_func, mod_func, 0.9999999 * Math.pow(2, exp), divisor); 54 divmod(div_func, mod_func, 1.0000001 * Math.pow(2, exp), divisor); 58 divmod(div_func, mod_func, 1 << exp, divisor); [all...] |
/external/webkit/WebCore/svg/graphics/filters/ |
SVGFEConvolveMatrix.cpp | 32 const float& divisor, const float& bias, const FloatSize& targetOffset, EdgeModeType edgeMode, 38 , m_divisor(divisor) 49 const float& divisor, const float& bias, const FloatSize& targetOffset, EdgeModeType edgeMode, 52 return adoptRef(new FEConvolveMatrix(in, in2, kernelSize, divisor, bias, targetOffset, edgeMode, kernelUnitLength, 77 float FEConvolveMatrix::divisor() const function in class:WebCore::FEConvolveMatrix 82 void FEConvolveMatrix::setDivisor(float divisor) 84 m_divisor = divisor; 167 << " [divisor=" << m_divisor << "]"
|
SVGFEConvolveMatrix.h | 53 float divisor() const;
|
/external/grub/docs/ |
kernel.c | 179 int divisor = 10; local 189 divisor = 16; 191 /* Divide UD by DIVISOR until UD == 0. */ 194 int remainder = ud % divisor; 198 while (ud /= divisor);
|
kernel.c.texi | 179 int divisor = 10; 189 divisor = 16; 191 /* @r{Divide UD by DIVISOR until UD == 0.} */ 194 int remainder = ud % divisor; 198 while (ud /= divisor);
|
/external/kernel-headers/original/asm-x86/ |
div64.h | 53 extern uint64_t div64_64(uint64_t dividend, uint64_t divisor);
|
/external/openssl/crypto/bn/ |
bn_div.c | 172 /* BN_div[_no_branch] computes dv := num / divisor, rounding towards 173 * zero, and sets up rm such that dv*divisor + rm = num holds. 175 * dv->neg == num->neg ^ divisor->neg (unless the result is zero) 180 const BIGNUM *divisor, BN_CTX *ctx); 181 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, 201 if ((BN_get_flags(num, BN_FLG_CONSTTIME) != 0) || (BN_get_flags(divisor, BN_FLG_CONSTTIME) != 0)) 203 return BN_div_no_branch(dv, rm, num, divisor, ctx); 209 bn_check_top(divisor); 211 if (BN_is_zero(divisor)) 217 if (BN_ucmp(num,divisor) < 0 [all...] |
/external/chromium/third_party/icu/source/i18n/ |
nfsubs.cpp | 66 double divisor; member in class:MultiplierSubstitution 76 : NFSubstitution(_pos, _ruleSet, formatter, description, status), divisor(_divisor) 78 ldivisor = util64_fromDouble(divisor); 79 if (divisor == 0) { 85 divisor = uprv_pow(radix, exponent); 86 ldivisor = util64_fromDouble(divisor); 88 if(divisor == 0) { 101 return uprv_floor(number / divisor); 103 return number/divisor; 108 return newRuleValue * divisor; 121 double divisor; member in class:ModulusSubstitution [all...] |
gregoimp.cpp | 40 double ClockMath::floorDivide(double dividend, double divisor, 43 U_ASSERT(divisor > 0); 44 double quotient = floorDivide(dividend, divisor); 45 remainder = dividend - (quotient * divisor); 49 if (remainder < 0 || remainder >= divisor) { 67 remainder = dividend - (quotient * divisor); 70 U_ASSERT(0 <= remainder && remainder < divisor);
|
/external/icu4c/i18n/ |
nfsubs.cpp | 66 double divisor; member in class:MultiplierSubstitution 76 : NFSubstitution(_pos, _ruleSet, formatter, description, status), divisor(_divisor) 78 ldivisor = util64_fromDouble(divisor); 79 if (divisor == 0) { 85 divisor = uprv_pow(radix, exponent); 86 ldivisor = util64_fromDouble(divisor); 88 if(divisor == 0) { 101 return uprv_floor(number / divisor); 103 return number/divisor; 108 return newRuleValue * divisor; 121 double divisor; member in class:ModulusSubstitution [all...] |
gregoimp.cpp | 40 double ClockMath::floorDivide(double dividend, double divisor, 43 U_ASSERT(divisor > 0); 44 double quotient = floorDivide(dividend, divisor); 45 remainder = dividend - (quotient * divisor); 49 if (remainder < 0 || remainder >= divisor) { 67 remainder = dividend - (quotient * divisor); 70 U_ASSERT(0 <= remainder && remainder < divisor);
|
/external/bison/lib/ |
hash.c | 439 size_t divisor = 3; local 440 size_t square = divisor * divisor; 442 while (square < candidate && (candidate % divisor)) 444 divisor++; 445 square += 4 * divisor; 446 divisor++; 449 return (candidate % divisor ? true : false);
|
/external/grub/stage2/ |
serial.c | 42 /* The structure for speed vs. divisor. */ struct 43 struct divisor 53 static struct divisor divisor_tab[] =
|
/external/iproute2/tc/ |
q_sfq.c | 96 fprintf(f, "flows %u/%u ", qopt->flows, qopt->divisor);
|