| /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/mindspore/mindspore/ccsrc/backend/kernel_compiler/cpu/ |
| D | eltwise_grad_cpu_kernel.cc | 110 T dividend = input2[i]; in AsinGrad() local
113 if (dividend == 0) { in AsinGrad()
118 … out[i] = dividend > 0 ? std::numeric_limits<T>::infinity() : -std::numeric_limits<T>::infinity(); in AsinGrad()
120 out[i] = dividend > 0 ? std::numeric_limits<T>::max() : std::numeric_limits<T>::min(); in AsinGrad()
124 out[i] = dividend / divisor; in AsinGrad()
131 T dividend = -input2[i]; in ACosGrad() local
134 if (dividend == 0) { in ACosGrad()
139 … out[i] = dividend > 0 ? std::numeric_limits<T>::infinity() : -std::numeric_limits<T>::infinity(); in ACosGrad()
141 out[i] = dividend > 0 ? std::numeric_limits<T>::max() : std::numeric_limits<T>::min(); in ACosGrad()
145 out[i] = dividend / divisor; in ACosGrad()
[all …]
|
| D | arithmetic_cpu_kernel.cc | 43 auto dividend = input1[idx_1]; in ElementRealDiv() local
48 if (dividend == zero) { in ElementRealDiv()
53 …out[i] = dividend > zero ? std::numeric_limits<T>::infinity() : -std::numeric_limits<T>::infinity(… in ElementRealDiv()
55 out[i] = dividend > zero ? std::numeric_limits<T>::max() : std::numeric_limits<T>::min(); in ElementRealDiv()
59 out[i] = dividend / divisor; in ElementRealDiv()
187 auto dividend = input1[iter.GetInputPosA()]; in RealDiv() local
192 if (dividend == zero) { in RealDiv()
197 …out[i] = dividend > zero ? std::numeric_limits<T>::infinity() : -std::numeric_limits<T>::infinity(… in RealDiv()
199 out[i] = dividend > zero ? std::numeric_limits<T>::max() : std::numeric_limits<T>::min(); in RealDiv()
203 out[i] = dividend / divisor; in RealDiv()
[all …]
|
| D | l2_normalize_cpu_kernel.cc | 105 T dividend = input_addr[iter.GetInputPosA()]; in CalcOutput() local
108 if (dividend == (T)0) { in CalcOutput()
113 …output_addr[i] = dividend > (T)0 ? std::numeric_limits<T>::infinity() : -std::numeric_limits<T>::i… in CalcOutput()
115 … output_addr[i] = dividend > (T)0 ? std::numeric_limits<T>::max() : std::numeric_limits<T>::min(); in CalcOutput()
119 output_addr[i] = dividend / divisor; in CalcOutput()
|
| D | scatter_arithmetic_cpu_kernel.cc | 127 auto dividend = input[indices[i] * inner_size_ + j]; in ScatterDiv() local
130 input[indices[i] * inner_size_ + j] = dividend / divisor; in ScatterDiv()
133 if (dividend == 0) { in ScatterDiv()
139 dividend > 0 ? std::numeric_limits<T>::infinity() : -std::numeric_limits<T>::infinity(); in ScatterDiv()
142 dividend > 0 ? std::numeric_limits<T>::max() : std::numeric_limits<T>::min(); in ScatterDiv()
|
| /third_party/grpc/src/php/tests/generated_code/ |
| D | math_server.js | 38 var dividend = call.request.dividend;
47 quotient: Math.floor(dividend / divisor),
48 remainder: dividend % divisor
92 var dividend = div_args.dividend;
100 quotient: Math.floor(dividend / divisor),
101 remainder: dividend % divisor
|
| D | math_client.php | 39 $dividend = 7; variable
42 $div_arg->setDividend($dividend);
46 p("Dividing $dividend by $divisor");
81 $dividend = 2 * $i + 1; variable
83 $div_arg->setDividend($dividend);
86 p("client writing: $dividend / $divisor");
|
| /third_party/protobuf/src/google/protobuf/stubs/ |
| D | int128.cc | 83 void uint128::DivModImpl(uint128 dividend, uint128 divisor, in DivModImpl() argument
86 GOOGLE_LOG(FATAL) << "Division or mod by zero: dividend.hi=" << dividend.hi_ in DivModImpl()
87 << ", lo=" << dividend.lo_; in DivModImpl()
88 } else if (dividend < divisor) { in DivModImpl()
90 *remainder_ret = dividend; in DivModImpl()
93 int dividend_bit_length = Fls128(dividend); in DivModImpl()
100 if (shifted_divisor <= dividend) { in DivModImpl()
101 dividend -= shifted_divisor; in DivModImpl()
108 *remainder_ret = dividend; in DivModImpl()
|
| /third_party/boost/boost/graph/ |
| D | bc_clustering.hpp | 33 : threshold(threshold), dividend(1.0) in bc_clustering_threshold()
51 : threshold(threshold), dividend(1.0) in bc_clustering_threshold()
57 dividend = T((n - 1) * (n - 2)) / T(2); in bc_clustering_threshold()
67 return (max_centrality / dividend) < threshold; in operator ()()
72 T dividend; member
|
| /third_party/grpc/src/php/tests/generated_code/Math/ |
| D | DivArgs.php | 19 protected $dividend = 0; variable in Math\\DivArgs
46 return $this->dividend;
57 $this->dividend = $var;
|
| /third_party/grpc/src/ruby/bin/ |
| D | math_client.rb | 47 req = Math::DivArgs.new(dividend: 7, divisor: 3)
81 reqs << Math::DivArgs.new(dividend: 7, divisor: 3)
82 reqs << Math::DivArgs.new(dividend: 5, divisor: 2)
83 reqs << Math::DivArgs.new(dividend: 7, divisor: 2)
|
| D | math_server.rb | 105 Math::DivReply.new(quotient: div_args.dividend / div_args.divisor,
106 remainder: div_args.dividend % div_args.divisor)
133 resp = Math::DivReply.new(quotient: req.dividend / req.divisor,
134 remainder: req.dividend % req.divisor)
|
| /third_party/skia/third_party/externals/icu/source/i18n/ |
| D | gregoimp.cpp | 43 double ClockMath::floorDivide(double dividend, double divisor, in floorDivide() argument
47 double quotient = floorDivide(dividend, divisor); in floorDivide()
48 remainder = dividend - (quotient * divisor); in floorDivide()
70 remainder = dividend - (quotient * divisor); in floorDivide()
|
| /third_party/icu/icu4c/source/i18n/ |
| D | gregoimp.cpp | 43 double ClockMath::floorDivide(double dividend, double divisor, in floorDivide() argument
47 double quotient = floorDivide(dividend, divisor); in floorDivide()
48 remainder = dividend - (quotient * divisor); in floorDivide()
70 remainder = dividend - (quotient * divisor); in floorDivide()
|
| /third_party/flutter/skia/third_party/externals/icu/source/i18n/ |
| D | gregoimp.cpp | 43 double ClockMath::floorDivide(double dividend, double divisor, in floorDivide() argument
47 double quotient = floorDivide(dividend, divisor); in floorDivide()
48 remainder = dividend - (quotient * divisor); in floorDivide()
70 remainder = dividend - (quotient * divisor); in floorDivide()
|
| /third_party/node/deps/icu-small/source/i18n/ |
| D | gregoimp.cpp | 43 double ClockMath::floorDivide(double dividend, double divisor, in floorDivide() argument
47 double quotient = floorDivide(dividend, divisor); in floorDivide()
48 remainder = dividend - (quotient * divisor); in floorDivide()
70 remainder = dividend - (quotient * divisor); in floorDivide()
|
| /third_party/icu/vendor/double-conversion/upstream/double-conversion/ |
| D | fixed-dtoa.cc | 341 uint64_t dividend = significand; in FastFixedDtoa() local
355 dividend <<= exponent - divisor_power; in FastFixedDtoa()
356 quotient = static_cast<uint32_t>(dividend / divisor); in FastFixedDtoa()
357 remainder = (dividend % divisor) << divisor_power; in FastFixedDtoa()
360 quotient = static_cast<uint32_t>(dividend / divisor); in FastFixedDtoa()
361 remainder = (dividend % divisor) << exponent; in FastFixedDtoa()
|
| /third_party/mindspore/mindspore/_extends/graph_kernel/expanders/ |
| D | sqrt_grad.py | 27 dividend = graph_builder.emit('Mul', [x, const_two])
28 result = graph_builder.emit('RealDiv', [dout, dividend])
|
| /third_party/abseil-cpp/absl/numeric/ |
| D | int128.cc | 56 inline void DivModImpl(uint128 dividend, uint128 divisor, uint128* quotient_ret, in DivModImpl() argument
60 if (divisor > dividend) { in DivModImpl()
62 *remainder_ret = dividend; in DivModImpl()
66 if (divisor == dividend) { in DivModImpl()
76 const int shift = Fls128(dividend) - Fls128(denominator); in DivModImpl()
83 if (dividend >= denominator) { in DivModImpl()
84 dividend -= denominator; in DivModImpl()
91 *remainder_ret = dividend; in DivModImpl()
|
| D | int128_test.cc | 984 absl::int128 dividend = pair.first; in TEST() local
989 EXPECT_EQ(quotient, dividend / divisor); in TEST()
990 EXPECT_EQ(quotient, absl::int128(dividend) /= divisor); in TEST()
991 EXPECT_EQ(remainder, dividend % divisor); in TEST()
992 EXPECT_EQ(remainder, absl::int128(dividend) %= divisor); in TEST()
1051 absl::int128 dividend; in TEST() member
1069 EXPECT_EQ(test_case.quotient, test_case.dividend / test_case.divisor); in TEST()
1071 absl::int128(test_case.dividend) /= test_case.divisor); in TEST()
1072 EXPECT_EQ(test_case.remainder, test_case.dividend % test_case.divisor); in TEST()
1074 absl::int128(test_case.dividend) %= test_case.divisor); in TEST()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/numeric/ |
| D | int128.cc | 56 inline void DivModImpl(uint128 dividend, uint128 divisor, uint128* quotient_ret, in DivModImpl() argument
60 if (divisor > dividend) { in DivModImpl()
62 *remainder_ret = dividend; in DivModImpl()
66 if (divisor == dividend) { in DivModImpl()
76 const int shift = Fls128(dividend) - Fls128(denominator); in DivModImpl()
83 if (dividend >= denominator) { in DivModImpl()
84 dividend -= denominator; in DivModImpl()
91 *remainder_ret = dividend; in DivModImpl()
|
| D | int128_test.cc | 1002 absl::int128 dividend = pair.first; in TEST() local
1007 EXPECT_EQ(quotient, dividend / divisor); in TEST()
1008 EXPECT_EQ(quotient, absl::int128(dividend) /= divisor); in TEST()
1009 EXPECT_EQ(remainder, dividend % divisor); in TEST()
1010 EXPECT_EQ(remainder, absl::int128(dividend) %= divisor); in TEST()
1069 absl::int128 dividend; in TEST() member
1087 EXPECT_EQ(test_case.quotient, test_case.dividend / test_case.divisor); in TEST()
1089 absl::int128(test_case.dividend) /= test_case.divisor); in TEST()
1090 EXPECT_EQ(test_case.remainder, test_case.dividend % test_case.divisor); in TEST()
1092 absl::int128(test_case.dividend) %= test_case.divisor); in TEST()
|
| /third_party/grpc/src/proto/math/ |
| D | math.proto | 21 int64 dividend = 1; field
43 // Div divides DivArgs.dividend by DivArgs.divisor and returns the quotient
|
| /third_party/boost/boost/random/detail/ |
| D | polynomial.hpp | 224 void operator()(digit_t * dividend, std::size_t dividend_bits) in operator ()()
230 copy_bits(dividend, block_start, dividend_bits, &_partial_quotient[0]); in operator ()()
233 … add_shifted_inplace(block_size, &_partial_quotient[0], dividend + pos/bits, pos%bits); in operator ()()
235 …add_shifted_inplace(block_size, &_partial_quotient[0], dividend + block_start/bits, block_start%bi… in operator ()()
|
| /third_party/boost/libs/crc/test/ |
| D | crc_test.cpp | 326 byte_type dividend = 0; in quick_crc32() local
332 if ( dividend & mask ) in quick_crc32()
348 crc_table[ quick_reflect(dividend, CHAR_BIT) ] in quick_crc32()
351 while ( ++dividend ); in quick_crc32()
|