| /art/compiler/optimizing/ |
| D | code_generator_utils.cc | 25 void CalculateMagicAndShiftForDivRem(int64_t divisor, bool is_long, in CalculateMagicAndShiftForDivRem() argument
28 DCHECK_NE(divisor, 0); in CalculateMagicAndShiftForDivRem()
58 uint64_t abs_d = (divisor >= 0) ? divisor : -divisor; in CalculateMagicAndShiftForDivRem()
59 uint64_t sign_bit = is_long ? static_cast<uint64_t>(divisor) >> 63 : in CalculateMagicAndShiftForDivRem()
60 static_cast<uint32_t>(divisor) >> 31; in CalculateMagicAndShiftForDivRem()
90 *magic = (divisor > 0) ? (quotient2 + 1) : (-quotient2 - 1); in CalculateMagicAndShiftForDivRem()
|
| D | code_generator_utils.h | 30 void CalculateMagicAndShiftForDivRem(int64_t divisor, bool is_long, int64_t* magic, int* shift);
|
| D | instruction_simplifier.cc | 1645 static constexpr bool CanDivideByReciprocalMultiplyFloat(int32_t divisor) { in CanDivideByReciprocalMultiplyFloat() argument
1647 return ((divisor & 0x7fffff) == 0); in CanDivideByReciprocalMultiplyFloat()
1651 static constexpr bool CanDivideByReciprocalMultiplyDouble(int64_t divisor) { in CanDivideByReciprocalMultiplyDouble() argument
1653 return ((divisor & ((UINT64_C(1) << 52) - 1)) == 0); in CanDivideByReciprocalMultiplyDouble()
|
| D | code_generator_arm64.cc | 2989 Register divisor = InputRegisterAt(instruction, 1); in GenerateIntDiv() local
2990 __ Sdiv(out, dividend, divisor); in GenerateIntDiv()
3054 int64_t divisor = Int64FromLocation(value); in VisitDivZeroCheck() local
3055 if (divisor == 0) { in VisitDivZeroCheck()
5238 Register divisor = InputRegisterAt(instruction, 1); in GenerateIntRem() local
5241 __ Sdiv(temp, dividend, divisor); in GenerateIntRem()
5242 __ Msub(out, temp, divisor, dividend); in GenerateIntRem()
|
| D | code_generator_mips64.cc | 3567 GpuRegister divisor = second.AsRegister<GpuRegister>(); in GenerateDivRemIntegral() local
3570 __ DivR6(out, dividend, divisor); in GenerateDivRemIntegral()
3572 __ Ddiv(out, dividend, divisor); in GenerateDivRemIntegral()
3575 __ ModR6(out, dividend, divisor); in GenerateDivRemIntegral()
3577 __ Dmod(out, dividend, divisor); in GenerateDivRemIntegral()
3649 int64_t divisor = codegen_->GetInt64ValueOf(value.GetConstant()->AsConstant()); in VisitDivZeroCheck() local
3650 if (divisor == 0) { in VisitDivZeroCheck()
|
| D | code_generator_mips.cc | 4166 Register divisor = second.AsRegister<Register>(); in GenerateDivRemIntegral() local
4170 __ DivR6(out, dividend, divisor); in GenerateDivRemIntegral()
4172 __ DivR2(out, dividend, divisor); in GenerateDivRemIntegral()
4176 __ ModR6(out, dividend, divisor); in GenerateDivRemIntegral()
4178 __ ModR2(out, dividend, divisor); in GenerateDivRemIntegral()
|
| /art/runtime/interpreter/ |
| D | interpreter_common.h | 423 int32_t dividend, int32_t divisor) in DoIntDivide() argument
426 if (UNLIKELY(divisor == 0)) { in DoIntDivide()
430 if (UNLIKELY(dividend == kMinInt && divisor == -1)) { in DoIntDivide()
433 shadow_frame.SetVReg(result_reg, dividend / divisor); in DoIntDivide()
441 int32_t dividend, int32_t divisor) in DoIntRemainder() argument
444 if (UNLIKELY(divisor == 0)) { in DoIntRemainder()
448 if (UNLIKELY(dividend == kMinInt && divisor == -1)) { in DoIntRemainder()
451 shadow_frame.SetVReg(result_reg, dividend % divisor); in DoIntRemainder()
461 int64_t divisor) in DoLongDivide() argument
464 if (UNLIKELY(divisor == 0)) { in DoLongDivide()
[all …]
|
| /art/libartbase/base/ |
| D | time_utils.cc | 96 uint64_t divisor = GetNsToTimeUnitDivisor(time_unit); in FormatDuration() local
111 const uint64_t whole_part = nano_duration / divisor; in FormatDuration()
112 uint64_t fractional_part = nano_duration % divisor; in FormatDuration()
122 while (avail_digits > 1 && fractional_part * multiplier < divisor) { in FormatDuration()
|
| /art/test/435-try-finally-without-catch/ |
| D | info.txt | 8 divisor is non-null, as it wouldn't be used. However, dx is not
9 that clever regarding exception handling: if the divisor is known to
|
| /art/runtime/base/ |
| D | timing_logger.cc | 210 uint64_t divisor = GetNsToTimeUnitDivisor(tu); in Dump() local
211 uint64_t mod_fraction = divisor >= 1000 ? divisor / 1000 : 1; in Dump()
|