Searched defs:divisor (Results 1 - 5 of 5) sorted by relevance

/art/compiler/optimizing/
H A Dcode_generator_utils.cc24 void CalculateMagicAndShiftForDivRem(int64_t divisor, bool is_long, argument
26 // It does not make sense to calculate magic and shift for zero divisor.
27 DCHECK_NE(divisor, 0);
34 * where divisor(d) >= 2.
36 * where divisor(d) <= -2.
57 uint64_t abs_d = (divisor >= 0) ? divisor : -divisor;
58 uint64_t sign_bit = is_long ? static_cast<uint64_t>(divisor) >> 63 :
59 static_cast<uint32_t>(divisor) >> 3
[all...]
H A Dinstruction_simplifier.cc1254 // Return whether x / divisor == x * (1.0f / divisor), for every float x.
1255 static constexpr bool CanDivideByReciprocalMultiplyFloat(int32_t divisor) { argument
1256 // True, if the most significant bits of divisor are 0.
1257 return ((divisor & 0x7fffff) == 0);
1260 // Return whether x / divisor == x * (1.0 / divisor), for every double x.
1261 static constexpr bool CanDivideByReciprocalMultiplyDouble(int64_t divisor) { argument
1262 // True, if the most significant bits of divisor are 0.
1263 return ((divisor
[all...]
H A Dcode_generator_arm64.cc3412 Register divisor = InputRegisterAt(instruction, 1); local
3414 __ Sdiv(out, dividend, divisor);
3418 __ Sdiv(temp, dividend, divisor);
3419 __ Msub(out, temp, divisor, dividend);
3484 int64_t divisor = Int64ConstantFrom(value); local
3485 if (divisor == 0) {
/art/runtime/base/
H A Dtime_utils.cc80 uint64_t divisor = GetNsToTimeUnitDivisor(time_unit); local
95 const uint64_t whole_part = nano_duration / divisor;
96 uint64_t fractional_part = nano_duration % divisor;
106 while (avail_digits > 1 && fractional_part * multiplier < divisor) {
H A Dtiming_logger.cc204 uint64_t divisor = GetNsToTimeUnitDivisor(tu); local
205 uint64_t mod_fraction = divisor >= 1000 ? divisor / 1000 : 1;

Completed in 83 milliseconds