Home
last modified time | relevance | path

Searched refs:dividend (Results 1 - 25 of 42) sorted by relevance

12

/third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/
H A Dkernel.h217 * @param n [IN/OUT] the dividend as IN,the quotient as OUT
239 * @param n [IN/OUT] the dividend as IN,the quotient as OUT
260 * @param dividend [IN] the dividend as IN
267 static inline UINT64 div64_u64(UINT64 dividend, UINT64 divisor) in div64_u64() argument
269 return dividend / divisor; in div64_u64()
284 * @param dividend [IN] the dividend as IN
291 static inline INT64 div64_s64(INT64 dividend, INT64 divisor) in div64_s64() argument
293 return dividend / diviso in div64_s64()
325 div_s64_rem(INT64 dividend, INT32 divisor, INT32 *remainder) div_s64_rem() argument
352 div64_u64_rem(UINT64 dividend, UINT64 divisor, UINT64 *remainder) div64_u64_rem() argument
379 div_u64_rem(UINT64 dividend, UINT32 divisor, UINT32 *remainder) div_u64_rem() argument
404 div_s64(INT64 dividend, INT32 divisor) div_s64() argument
429 div_u64(UINT64 dividend, UINT32 divisor) div_u64() argument
[all...]
/third_party/protobuf/src/google/protobuf/stubs/
H A Dint128.cc83 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()
[all...]
/third_party/node/deps/v8/src/wasm/
H A Dwasm-external-refs.cc288 int64_t dividend = ReadUnalignedValue<int64_t>(data); in int64_div_wrapper() local
289 int64_t divisor = ReadUnalignedValue<int64_t>(data + sizeof(dividend)); in int64_div_wrapper()
293 if (divisor == -1 && dividend == std::numeric_limits<int64_t>::min()) { in int64_div_wrapper()
296 WriteUnalignedValue<int64_t>(data, dividend / divisor); in int64_div_wrapper()
301 int64_t dividend = ReadUnalignedValue<int64_t>(data); in int64_mod_wrapper() local
302 int64_t divisor = ReadUnalignedValue<int64_t>(data + sizeof(dividend)); in int64_mod_wrapper()
306 if (divisor == -1 && dividend == std::numeric_limits<int64_t>::min()) { in int64_mod_wrapper()
310 WriteUnalignedValue<int64_t>(data, dividend % divisor); in int64_mod_wrapper()
315 uint64_t dividend = ReadUnalignedValue<uint64_t>(data); in uint64_div_wrapper() local
316 uint64_t divisor = ReadUnalignedValue<uint64_t>(data + sizeof(dividend)); in uint64_div_wrapper()
325 uint64_t dividend = ReadUnalignedValue<uint64_t>(data); uint64_mod_wrapper() local
[all...]
/third_party/icu/vendor/double-conversion/upstream/double-conversion/
H A Dfixed-dtoa.cc341 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/node/deps/v8/src/base/numbers/
H A Dfixed-dtoa.cc306 uint64_t dividend = significand; in FastFixedDtoa() local
320 dividend <<= exponent - divisor_power; in FastFixedDtoa()
321 quotient = static_cast<uint32_t>(dividend / divisor); in FastFixedDtoa()
322 remainder = (dividend % divisor) << divisor_power; in FastFixedDtoa()
325 quotient = static_cast<uint32_t>(dividend / divisor); in FastFixedDtoa()
326 remainder = (dividend % divisor) << exponent; in FastFixedDtoa()
/third_party/icu/icu4c/source/i18n/
H A Dgregoimp.cpp48 double ClockMath::floorDivide(double dividend, double divisor, in floorDivide() argument
52 double quotient = floorDivide(dividend, divisor); in floorDivide()
53 *remainder = dividend - (quotient * divisor); in floorDivide()
75 *remainder = dividend - (quotient * divisor); in floorDivide()
H A Dgregoimp.h85 * such that dividend = quotient*divisor + remainder and
89 * (dividend >> divisor) reasonably.
93 static double floorDivide(double dividend, double divisor,
/third_party/node/deps/icu-small/source/i18n/
H A Dgregoimp.cpp50 double ClockMath::floorDivide(double dividend, double divisor, in floorDivide() argument
54 double quotient = floorDivide(dividend, divisor); in floorDivide()
55 double r = dividend - (quotient * divisor); in floorDivide()
77 r = dividend - (quotient * divisor); in floorDivide()
H A Dgregoimp.h85 * such that dividend = quotient*divisor + remainder and
89 * (dividend >> divisor) reasonably.
93 static double floorDivide(double dividend, double divisor,
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dgregoimp.cpp43 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()
H A Dgregoimp.h85 * such that dividend = quotient*divisor + remainder and
93 static double floorDivide(double dividend, double divisor,
/third_party/skia/third_party/externals/abseil-cpp/absl/numeric/
H A Dint128.cc56 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()
75 // Left aligns the MSB of the denominator and the dividend. in DivModImpl()
76 const int shift = Fls128(dividend) - Fls128(denominator); in DivModImpl()
79 // Uses shift-subtract algorithm to divide dividend by denominator. The in DivModImpl()
80 // remainder will be left in dividend. in DivModImpl()
83 if (dividend >= denominator) { in DivModImpl()
84 dividend in DivModImpl()
[all...]
H A Dint128_test.cc395 // Dividend < divisor; result should be q:0 r:<dividend>. in TEST()
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 in TEST()
[all...]
/third_party/decimal.js/test/modules/
H A Ddiv.js14 var t = function (expected, dividend, divisor) {
15 var quotient = new Decimal(dividend).div(divisor);
32 t = function (dividend, divisor, expected) {
33 T.assertEqual(expected, new Decimal(dividend).div(divisor).valueOf());
122 t = function (dividend, divisor, expected, sd, rm) {
125 T.assertEqual(expected, new Decimal(dividend).div(divisor).valueOf());
/third_party/node/deps/v8/src/compiler/
H A Dmachine-operator-reducer.cc248 Node* MachineOperatorReducer::Int32Div(Node* dividend, int32_t divisor) { in Int32Div() argument
253 Node* quotient = graph()->NewNode(machine()->Int32MulHigh(), dividend, in Int32Div()
256 quotient = Int32Add(quotient, dividend); in Int32Div()
258 quotient = Int32Sub(quotient, dividend); in Int32Div()
260 return Int32Add(Word32Sar(quotient, mag.shift), Word32Shr(dividend, 31)); in Int32Div()
263 Node* MachineOperatorReducer::Uint32Div(Node* dividend, uint32_t divisor) { in Uint32Div() argument
266 // the dividend upfront. in Uint32Div()
268 dividend = Word32Shr(dividend, shift); in Uint32Div()
273 Node* quotient = graph()->NewNode(machine()->Uint32MulHigh(), dividend, in Uint32Div()
1140 Node* const dividend = m.left().node(); ReduceInt32Div() local
1179 Node* const dividend = m.left().node(); ReduceUint32Div() local
1206 Node* const dividend = m.left().node(); ReduceInt32Mod() local
1241 Node* const dividend = m.left().node(); ReduceUint32Mod() local
[all...]
H A Dmachine-operator-reducer.h63 Node* Int32Div(Node* dividend, int32_t divisor);
64 Node* Uint32Div(Node* dividend, uint32_t divisor);
/third_party/node/deps/v8/src/bigint/
H A Dtostring.cc151 Digits dividend = digits_; in Classic() local
155 out_ = DivideByMagic<10>(rest, dividend, out_); in Classic()
159 processor_->DivideSingle(rest, &chunk, dividend, chunk_divisor_); in Classic()
167 dividend = rest; in Classic()
277 // the divisor being ~half as large (in bits) as the current dividend).
395 // compute, so the caller should provide the dividend length.
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A DAPFloat.cpp1134 integerPart *lhsSignificand, *dividend, *divisor;
1145 dividend = new integerPart[partsCount * 2];
1147 dividend = scratch;
1149 divisor = dividend + partsCount;
1151 /* Copy the dividend and divisor as they will be modified in-place. */
1153 dividend[i] = lhsSignificand[i];
1169 /* Normalize the dividend. */
1170 bit = precision - APInt::tcMSB(dividend, partsCount) - 1;
1173 APInt::tcShiftLeft(dividend, partsCount, bit);
1176 /* Ensure the dividend >
[all...]
/third_party/mesa3d/src/nouveau/codegen/lib/
H A Dgf100.asm8 // INPUT: $r0: dividend, $r1: divisor
43 // INPUT: $r0: dividend, $r1: divisor
/third_party/node/deps/v8/src/ic/
H A Dbinary-op-assembler.h40 const LazyNode<Context>& context, TNode<Object> dividend,
46 const LazyNode<Context>& context, TNode<Object> dividend,
H A Dbinary-op-assembler.cc520 const LazyNode<Context>& context, TNode<Object> dividend, in Generate_DivideWithFeedback()
552 context, dividend, divisor, slot_id, maybe_feedback_vector, smiFunction, in Generate_DivideWithFeedback()
557 const LazyNode<Context>& context, TNode<Object> dividend, in Generate_ModulusWithFeedback()
573 context, dividend, divisor, slot_id, maybe_feedback_vector, smiFunction, in Generate_ModulusWithFeedback()
519 Generate_DivideWithFeedback( const LazyNode<Context>& context, TNode<Object> dividend, TNode<Object> divisor, TNode<UintPtrT> slot_id, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_DivideWithFeedback() argument
556 Generate_ModulusWithFeedback( const LazyNode<Context>& context, TNode<Object> dividend, TNode<Object> divisor, TNode<UintPtrT> slot_id, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_ModulusWithFeedback() argument
/third_party/skia/third_party/externals/freetype/src/psaux/
H A Dpsintrp.c1588 CF2_F16Dot16 dividend; in cf2_interpT2CharString() local
1597 dividend = (CF2_F16Dot16)cf2_stack_popInt( opStack ); in cf2_interpT2CharString()
1604 dividend = cf2_stack_popFixed( opStack ); in cf2_interpT2CharString()
1608 FT_DivFix( dividend, divisor ) ); in cf2_interpT2CharString()
1988 CF2_F16Dot16 dividend; in cf2_interpT2CharString() local
1996 dividend = cf2_stack_popFixed( opStack ); in cf2_interpT2CharString()
2002 FT_DivFix( dividend, in cf2_interpT2CharString()
/third_party/skia/third_party/externals/freetype/src/smooth/
H A Dftgrays.c348 /* Compute `dividend / divisor' and return both its quotient and */
352 #define FT_DIV_MOD( type, dividend, divisor, quotient, remainder ) \
354 (quotient) = (type)( (dividend) / (divisor) ); \
355 (remainder) = (type)( (dividend) % (divisor) ); \
370 #define FT_DIV_MOD( type, dividend, divisor, quotient, remainder ) \
372 (quotient) = (type)( (dividend) / (divisor) ); \
373 (remainder) = (type)( (dividend) - (quotient) * (divisor) ); \
/third_party/mbedtls/library/
H A Dbignum.c1286 * Unsigned integer divide - double mbedtls_mpi_uint dividend, u1/u0, and
1295 mbedtls_t_udbl dividend, quotient; in mbedtls_int_div_int() local
1316 dividend = (mbedtls_t_udbl) u1 << biL; in mbedtls_int_div_int()
1317 dividend |= (mbedtls_t_udbl) u0; in mbedtls_int_div_int()
1318 quotient = dividend / d; in mbedtls_int_div_int()
1324 *r = (mbedtls_mpi_uint) (dividend - (quotient * d)); in mbedtls_int_div_int()
1336 * Normalize the divisor, d, and dividend, u0, u1 in mbedtls_int_div_int()
/third_party/node/deps/v8/src/codegen/
H A Dexternal-reference.cc457 double dividend = ReadUnalignedValue<double>(data);
458 double divisor = ReadUnalignedValue<double>(data + sizeof(dividend));
459 WriteUnalignedValue<double>(data, Modulo(dividend, divisor));

Completed in 29 milliseconds

12