Home
last modified time | relevance | path

Searched refs:kNumberOfCoreRegisters (Results 1 – 9 of 9) sorted by relevance

/art/runtime/arch/mips/
Dcontext_mips.h48 CHECK_LT(reg, static_cast<uint32_t>(kNumberOfCoreRegisters)); in IsAccessibleGPR()
53 DCHECK_LT(reg, static_cast<uint32_t>(kNumberOfCoreRegisters)); in GetGPRAddress()
58 CHECK_LT(reg, static_cast<uint32_t>(kNumberOfCoreRegisters)); in GetGPR()
83 uintptr_t* gprs_[kNumberOfCoreRegisters];
Dcontext_mips.cc59 CHECK_LT(reg, static_cast<uint32_t>(kNumberOfCoreRegisters)); in SetGPR()
84 uintptr_t gprs[kNumberOfCoreRegisters]; in DoLongJump()
86 for (size_t i = 0; i < kNumberOfCoreRegisters; ++i) { in DoLongJump()
Dregisters_mips.h62 kNumberOfCoreRegisters = 32, enumerator
/art/runtime/arch/arm/
Dcontext_arm.h49 DCHECK_LT(reg, static_cast<uint32_t>(kNumberOfCoreRegisters)); in IsAccessibleGPR()
54 DCHECK_LT(reg, static_cast<uint32_t>(kNumberOfCoreRegisters)); in GetGPRAddress()
59 DCHECK_LT(reg, static_cast<uint32_t>(kNumberOfCoreRegisters)); in GetGPR()
84 uintptr_t* gprs_[kNumberOfCoreRegisters];
Dcontext_arm.cc45 DCHECK_EQ(0u, core_regs & (static_cast<uint32_t>(-1) << kNumberOfCoreRegisters)); in FillCalleeSaves()
61 DCHECK_LT(reg, static_cast<uint32_t>(kNumberOfCoreRegisters)); in SetGPR()
102 uintptr_t gprs[kNumberOfCoreRegisters]; in DoLongJump()
104 for (size_t i = 0; i < kNumberOfCoreRegisters; ++i) { in DoLongJump()
Dregisters_arm.h49 kNumberOfCoreRegisters = 16, enumerator
/art/compiler/utils/mips/
Dmanaged_register_mips.h47 const int kNumberOfCoreRegIds = kNumberOfCoreRegisters;
48 const int kNumberOfCoreAllocIds = kNumberOfCoreRegisters;
/art/compiler/utils/arm/
Dmanaged_register_arm.h41 const int kNumberOfCoreRegIds = kNumberOfCoreRegisters;
42 const int kNumberOfCoreAllocIds = kNumberOfCoreRegisters;
/art/compiler/optimizing/
Dcode_generator_arm.cc381 kNumberOfCoreRegisters, in CodeGeneratorARM()
420 int reg = FindFreeEntry(blocked_core_registers_, kNumberOfCoreRegisters); in AllocateFreeRegister()