Home
last modified time | relevance | path

Searched refs:free_until (Results 1 – 3 of 3) sorted by relevance

/art/compiler/optimizing/
Dregister_allocator_linear_scan.cc583 static void FreeIfNotCoverAt(LiveInterval* interval, size_t position, size_t* free_until) { in FreeIfNotCoverAt() argument
591 free_until[interval->GetRegister()] = kMaxLifetimePosition; in FreeIfNotCoverAt()
594 free_until[interval->GetHighInterval()->GetRegister()] = kMaxLifetimePosition; in FreeIfNotCoverAt()
599 free_until[interval->GetRegister()] = interval->FirstUseAfter(position); in FreeIfNotCoverAt()
602 free_until[interval->GetHighInterval()->GetRegister()] = free_until[interval->GetRegister()]; in FreeIfNotCoverAt()
610 size_t* free_until = registers_array_; in TryAllocateFreeReg() local
614 free_until[i] = kMaxLifetimePosition; in TryAllocateFreeReg()
620 free_until[interval->GetRegister()] = 0; in TryAllocateFreeReg()
645 FreeIfNotCoverAt(interval, position, free_until); in TryAllocateFreeReg()
667 if (free_until[inactive->GetRegister()] == 0) { in TryAllocateFreeReg()
[all …]
Dssa_liveness_analysis.cc321 int LiveInterval::FindFirstRegisterHint(size_t* free_until, in FindFirstRegisterHint() argument
331 if (hint != kNoRegister && free_until[hint] > GetStart()) { in FindFirstRegisterHint()
352 && (free_until[existing->GetRegister()] >= next_register_use)) { in FindFirstRegisterHint()
375 if (free_until[reg] >= use_position) { in FindFirstRegisterHint()
391 if (free_until[reg] >= use_position) { in FindFirstRegisterHint()
407 if (free_until[reg] >= position) { in FindFirstRegisterHint()
Dssa_liveness_analysis.h774 int FindFirstRegisterHint(size_t* free_until, const SsaLivenessAnalysis& liveness) const;