| /third_party/grpc/src/php/tests/generated_code/ |
| D | math_server.js | 37 var divisor = call.request.divisor;
39 if (divisor == 0) {
47 quotient: Math.floor(dividend / divisor),
48 remainder: dividend % divisor
91 var divisor = div_args.divisor;
93 if (divisor == 0) {
100 quotient: Math.floor(dividend / divisor),
101 remainder: dividend % divisor
|
| D | math_client.php | 40 $divisor = 4; variable
43 $div_arg->setDivisor($divisor);
46 p("Dividing $dividend by $divisor");
82 $divisor = 3; variable
84 $div_arg->setDivisor($divisor);
86 p("client writing: $dividend / $divisor");
|
| /third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/ |
| D | kernel.h | 269 static inline UINT64 div64_u64(UINT64 dividend, UINT64 divisor) in div64_u64() argument
271 return dividend / divisor; in div64_u64()
293 static inline INT64 div64_s64(INT64 dividend, INT64 divisor) in div64_s64() argument
295 return dividend / divisor; in div64_s64()
327 static inline INT64 div_s64_rem(INT64 dividend, INT32 divisor, INT32 *remainder) in div_s64_rem() argument
329 *remainder = dividend % divisor; in div_s64_rem()
330 return dividend / divisor; in div_s64_rem()
354 static inline UINT64 div64_u64_rem(UINT64 dividend, UINT64 divisor, UINT64 *remainder) in div64_u64_rem() argument
356 *remainder = dividend % divisor; in div64_u64_rem()
357 return dividend / divisor; in div64_u64_rem()
[all …]
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
| D | NFSubstitution.java | 668 long divisor; field in MultiplierSubstitution
692 this.divisor = rule.getDivisor(); in MultiplierSubstitution()
694 if (divisor == 0) { // this will cause recursion in MultiplierSubstitution()
707 divisor = NFRule.power(radix, exponent); in setDivisor()
709 if (divisor == 0) { in setDivisor()
725 return super.equals(that) && divisor == ((MultiplierSubstitution) that).divisor; in equals()
739 return (long)Math.floor(number / divisor); in transformNumber()
754 return number / divisor; in transformNumber()
756 return Math.floor(number / divisor); in transformNumber()
775 return newRuleValue * divisor; in composeRuleValue()
[all …]
|
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | NFSubstitution.java | 667 long divisor; field in MultiplierSubstitution
691 this.divisor = rule.getDivisor(); in MultiplierSubstitution()
693 if (divisor == 0) { // this will cause recursion in MultiplierSubstitution()
706 divisor = NFRule.power(radix, exponent); in setDivisor()
708 if (divisor == 0) { in setDivisor()
724 return super.equals(that) && divisor == ((MultiplierSubstitution) that).divisor; in equals()
738 return (long)Math.floor(number / divisor); in transformNumber()
753 return number / divisor; in transformNumber()
755 return Math.floor(number / divisor); in transformNumber()
774 return newRuleValue * divisor; in composeRuleValue()
[all …]
|
| /third_party/protobuf/src/google/protobuf/stubs/ |
| D | int128.cc | 83 void uint128::DivModImpl(uint128 dividend, uint128 divisor, in DivModImpl() argument
85 if (divisor == 0) { in DivModImpl()
88 } else if (dividend < divisor) { in DivModImpl()
94 int divisor_bit_length = Fls128(divisor); in DivModImpl()
99 uint128 shifted_divisor = divisor << difference; in DivModImpl()
113 uint128& uint128::operator/=(const uint128& divisor) { in operator /=() argument
116 DivModImpl(*this, divisor, "ient, &remainder); in operator /=()
120 uint128& uint128::operator%=(const uint128& divisor) { in operator %=() argument
123 DivModImpl(*this, divisor, "ient, &remainder); in operator %=()
|
| /third_party/skia/third_party/externals/spirv-cross/include/spirv_cross/ |
| D | barrier.hpp | 35 void set_release_divisor(unsigned divisor) in set_release_divisor() argument
37 this->divisor = divisor; in set_release_divisor()
55 unsigned target_count = divisor * target_iteration; in wait()
74 unsigned divisor = 1; member in spirv_cross::Barrier
|
| /third_party/mindspore/mindspore/lite/src/runtime/kernel/opencl/ |
| D | utils.cc | 79 int GetMaxDivisor(int x, int divisor) { in GetMaxDivisor() argument
80 int i = divisor; in GetMaxDivisor()
90 int GetMaxDivisorStrategy0(int x, int divisor) { in GetMaxDivisorStrategy0() argument
91 if (divisor >= 8 && x % 8 == 0) { in GetMaxDivisorStrategy0()
93 } else if (divisor >= 4 && x % 4 == 0) { in GetMaxDivisorStrategy0()
95 } else if (divisor >= 2 && x % 2 == 0) { in GetMaxDivisorStrategy0()
98 return GetMaxDivisor(x, divisor); in GetMaxDivisorStrategy0()
102 int GetMaxDivisorStrategy1(int x, int divisor) { in GetMaxDivisorStrategy1() argument
103 if (divisor >= 8 && x % 8 == 0) { in GetMaxDivisorStrategy1()
105 } else if (divisor >= 4 && x % 4 == 0) { in GetMaxDivisorStrategy1()
[all …]
|
| /third_party/flutter/skia/third_party/externals/wuffs/std/crc32/ |
| D | README.md | 40 Extending the example above (with a divisor polynomial `B` of degree `N` equal
54 divisor 10011
56 divisor 1 0011
61 This `B` divisor polynomial, `0b10011`, is also known as the CRC-4-ITU
102 divisor 10000010 01100000 10001110 11011011 1
104 divisor 1000001 00110000 01000111 01101101 11
106 divisor 100000 10011000 00100011 10110110 111
108 divisor 1000 00100110 00001000 11101101 10111
110 divisor 100 00010011 00000100 01110110 110111
112 divisor 10 00001001 10000010 00111011 0110111
[all …]
|
| /third_party/mindspore/mindspore/ccsrc/backend/kernel_compiler/cpu/ |
| D | eltwise_grad_cpu_kernel.cc | 111 T divisor = sqrt(1 - input1[i] * input1[i]); in AsinGrad() local
112 if (divisor == 0) { in AsinGrad()
124 out[i] = dividend / divisor; in AsinGrad()
132 T divisor = sqrt(1 - input1[i] * input1[i]); in ACosGrad() local
133 if (divisor == 0) { in ACosGrad()
145 out[i] = dividend / divisor; in ACosGrad()
153 T divisor = 1 + input1[i] * input1[i]; in AtanGrad() local
154 if (divisor == 0) { in AtanGrad()
166 out[i] = dividend / divisor; in AtanGrad()
174 T divisor = cosh(input1[i]); in AsinhGrad() local
[all …]
|
| /third_party/boost/boost/random/ |
| D | uniform_real_distribution.hpp | 41 result_type divisor = static_cast<T>((eng.max)() - (eng.min)()); in generate_uniform_real() local
42 BOOST_ASSERT(divisor > 0); in generate_uniform_real()
43 BOOST_ASSERT(numerator >= 0 && numerator <= divisor); in generate_uniform_real()
44 T result = numerator / divisor * (max_value - min_value) + min_value; in generate_uniform_real()
58 result_type divisor = static_cast<T>(subtract<base_result>()((eng.max)(), (eng.min)())) + 1; in generate_uniform_real() local
59 BOOST_ASSERT(divisor > 0); in generate_uniform_real()
60 BOOST_ASSERT(numerator >= 0 && numerator <= divisor); in generate_uniform_real()
61 T result = numerator / divisor * (max_value - min_value) + min_value; in generate_uniform_real()
|
| /third_party/skia/third_party/externals/icu/source/i18n/ |
| D | gregoimp.cpp | 43 double ClockMath::floorDivide(double dividend, double divisor, in floorDivide() argument
46 U_ASSERT(divisor > 0); in floorDivide()
47 double quotient = floorDivide(dividend, divisor); in floorDivide()
48 remainder = dividend - (quotient * divisor); in floorDivide()
52 if (remainder < 0 || remainder >= divisor) { in floorDivide()
70 remainder = dividend - (quotient * divisor); in floorDivide()
73 U_ASSERT(0 <= remainder && remainder < divisor); in floorDivide()
|
| D | double-conversion-fast-dtoa.cpp | 352 uint32_t divisor; in DigitGen() local
355 &divisor, &divisor_exponent_plus_one); in DigitGen()
363 int digit = integrals / divisor; in DigitGen()
367 integrals %= divisor; in DigitGen()
380 static_cast<uint64_t>(divisor) << -one.e(), unit); in DigitGen()
382 divisor /= 10; in DigitGen()
462 uint32_t divisor; in DigitGenCounted() local
465 &divisor, &divisor_exponent_plus_one); in DigitGenCounted()
474 int digit = integrals / divisor; in DigitGenCounted()
479 integrals %= divisor; in DigitGenCounted()
[all …]
|
| D | nfsubs.cpp | 75 int64_t divisor; member in MultiplierSubstitution
83 : NFSubstitution(_pos, _ruleSet, description, status), divisor(rule->getDivisor()) in MultiplierSubstitution()
85 if (divisor == 0) { in MultiplierSubstitution()
92 divisor = util64_pow(radix, exponent); in setDivisor()
94 if(divisor == 0) { in setDivisor()
102 return number / divisor; in transformNumber()
107 return uprv_floor(number / divisor); in transformNumber()
109 return number / divisor; in transformNumber()
114 return newRuleValue * divisor; in composeRuleValue()
117 …tual double calcUpperBound(double /*oldUpperBound*/) const { return static_cast<double>(divisor); } in calcUpperBound()
[all …]
|
| /third_party/flutter/skia/third_party/externals/icu/source/i18n/ |
| D | gregoimp.cpp | 43 double ClockMath::floorDivide(double dividend, double divisor, in floorDivide() argument
46 U_ASSERT(divisor > 0); in floorDivide()
47 double quotient = floorDivide(dividend, divisor); in floorDivide()
48 remainder = dividend - (quotient * divisor); in floorDivide()
52 if (remainder < 0 || remainder >= divisor) { in floorDivide()
70 remainder = dividend - (quotient * divisor); in floorDivide()
73 U_ASSERT(0 <= remainder && remainder < divisor); in floorDivide()
|
| D | double-conversion-fast-dtoa.cpp | 352 uint32_t divisor; in DigitGen() local
355 &divisor, &divisor_exponent_plus_one); in DigitGen()
363 int digit = integrals / divisor; in DigitGen()
367 integrals %= divisor; in DigitGen()
380 static_cast<uint64_t>(divisor) << -one.e(), unit); in DigitGen()
382 divisor /= 10; in DigitGen()
462 uint32_t divisor; in DigitGenCounted() local
465 &divisor, &divisor_exponent_plus_one); in DigitGenCounted()
474 int digit = integrals / divisor; in DigitGenCounted()
479 integrals %= divisor; in DigitGenCounted()
[all …]
|
| D | nfsubs.cpp | 75 int64_t divisor; member in MultiplierSubstitution
83 : NFSubstitution(_pos, _ruleSet, description, status), divisor(rule->getDivisor()) in MultiplierSubstitution()
85 if (divisor == 0) { in MultiplierSubstitution()
92 divisor = util64_pow(radix, exponent); in setDivisor()
94 if(divisor == 0) { in setDivisor()
102 return number / divisor; in transformNumber()
107 return uprv_floor(number / divisor); in transformNumber()
109 return number / divisor; in transformNumber()
114 return newRuleValue * divisor; in composeRuleValue()
117 …tual double calcUpperBound(double /*oldUpperBound*/) const { return static_cast<double>(divisor); } in calcUpperBound()
[all …]
|
| /third_party/icu/icu4c/source/i18n/ |
| D | gregoimp.cpp | 43 double ClockMath::floorDivide(double dividend, double divisor, in floorDivide() argument
46 U_ASSERT(divisor > 0); in floorDivide()
47 double quotient = floorDivide(dividend, divisor); in floorDivide()
48 remainder = dividend - (quotient * divisor); in floorDivide()
52 if (remainder < 0 || remainder >= divisor) { in floorDivide()
70 remainder = dividend - (quotient * divisor); in floorDivide()
73 U_ASSERT(0 <= remainder && remainder < divisor); in floorDivide()
|
| D | double-conversion-fast-dtoa.cpp | 352 uint32_t divisor; in DigitGen() local
355 &divisor, &divisor_exponent_plus_one); in DigitGen()
363 int digit = integrals / divisor; in DigitGen()
367 integrals %= divisor; in DigitGen()
380 static_cast<uint64_t>(divisor) << -one.e(), unit); in DigitGen()
382 divisor /= 10; in DigitGen()
462 uint32_t divisor; in DigitGenCounted() local
465 &divisor, &divisor_exponent_plus_one); in DigitGenCounted()
474 int digit = integrals / divisor; in DigitGenCounted()
479 integrals %= divisor; in DigitGenCounted()
[all …]
|
| D | nfsubs.cpp | 75 int64_t divisor; member in MultiplierSubstitution
83 : NFSubstitution(_pos, _ruleSet, description, status), divisor(rule->getDivisor()) in MultiplierSubstitution()
85 if (divisor == 0) { in MultiplierSubstitution()
92 divisor = util64_pow(radix, exponent); in setDivisor()
94 if(divisor == 0) { in setDivisor()
102 return number / divisor; in transformNumber()
107 return uprv_floor(number / divisor); in transformNumber()
109 return number / divisor; in transformNumber()
114 return newRuleValue * divisor; in composeRuleValue()
117 …tual double calcUpperBound(double /*oldUpperBound*/) const { return static_cast<double>(divisor); } in calcUpperBound()
[all …]
|
| /third_party/node/deps/icu-small/source/i18n/ |
| D | gregoimp.cpp | 43 double ClockMath::floorDivide(double dividend, double divisor, in floorDivide() argument
46 U_ASSERT(divisor > 0); in floorDivide()
47 double quotient = floorDivide(dividend, divisor); in floorDivide()
48 remainder = dividend - (quotient * divisor); in floorDivide()
52 if (remainder < 0 || remainder >= divisor) { in floorDivide()
70 remainder = dividend - (quotient * divisor); in floorDivide()
73 U_ASSERT(0 <= remainder && remainder < divisor); in floorDivide()
|
| D | double-conversion-fast-dtoa.cpp | 352 uint32_t divisor; in DigitGen() local
355 &divisor, &divisor_exponent_plus_one); in DigitGen()
363 int digit = integrals / divisor; in DigitGen()
367 integrals %= divisor; in DigitGen()
380 static_cast<uint64_t>(divisor) << -one.e(), unit); in DigitGen()
382 divisor /= 10; in DigitGen()
462 uint32_t divisor; in DigitGenCounted() local
465 &divisor, &divisor_exponent_plus_one); in DigitGenCounted()
474 int digit = integrals / divisor; in DigitGenCounted()
479 integrals %= divisor; in DigitGenCounted()
[all …]
|
| /third_party/ffmpeg/libavformat/ |
| D | hcom.c | 42 unsigned compresstype, divisor; in hcom_read_header() local
55 divisor = avio_rb32(s->pb); in hcom_read_header()
56 if (divisor == 0 || divisor > 4) in hcom_read_header()
66 st->codecpar->sample_rate = 22050 / divisor; in hcom_read_header()
|
| /third_party/icu/vendor/double-conversion/upstream/double-conversion/ |
| D | fast-dtoa.cc | 338 uint32_t divisor; in DigitGen() local
341 &divisor, &divisor_exponent_plus_one); in DigitGen()
349 int digit = integrals / divisor; in DigitGen()
353 integrals %= divisor; in DigitGen()
366 static_cast<uint64_t>(divisor) << -one.e(), unit); in DigitGen()
368 divisor /= 10; in DigitGen()
448 uint32_t divisor; in DigitGenCounted() local
451 &divisor, &divisor_exponent_plus_one); in DigitGenCounted()
460 int digit = integrals / divisor; in DigitGenCounted()
465 integrals %= divisor; in DigitGenCounted()
[all …]
|
| /third_party/openssl/crypto/bn/ |
| D | bn_div.c | 209 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, in BN_div() argument
214 if (BN_is_zero(divisor)) { in BN_div()
224 if (divisor->d[divisor->top - 1] == 0) { in BN_div()
229 ret = bn_div_fixed_top(dv, rm, num, divisor, ctx); in BN_div()
265 const BIGNUM *divisor, BN_CTX *ctx) in bn_div_fixed_top() argument
273 assert(divisor->top > 0 && divisor->d[divisor->top - 1] != 0); in bn_div_fixed_top()
276 bn_check_top(divisor); in bn_div_fixed_top()
289 if (!BN_copy(sdiv, divisor)) in bn_div_fixed_top()
330 res->neg = (num_neg ^ divisor->neg); in bn_div_fixed_top()
|