mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-26 05:56:51 +00:00
8677f2ff9a
define below all header includes in the lib/CodeGen/... tree. While the current modules implementation doesn't check for this kind of ODR violation yet, it is likely to grow support for it in the future. It also removes one layer of macro pollution across all the included headers. Other sub-trees will follow. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@206837 91177308-0d34-0410-b5e6-96231b3b80d8
54 lines
1.8 KiB
C++
54 lines
1.8 KiB
C++
//===-- llvm/CodeGen/AllocationOrder.cpp - Allocation Order ---------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements an allocation order for virtual registers.
|
|
//
|
|
// The preferred allocation order for a virtual register depends on allocation
|
|
// hints and target hooks. The AllocationOrder class encapsulates all of that.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "AllocationOrder.h"
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
|
#include "llvm/CodeGen/MachineRegisterInfo.h"
|
|
#include "llvm/CodeGen/RegisterClassInfo.h"
|
|
#include "llvm/CodeGen/VirtRegMap.h"
|
|
#include "llvm/Support/Debug.h"
|
|
#include "llvm/Support/raw_ostream.h"
|
|
|
|
using namespace llvm;
|
|
|
|
#define DEBUG_TYPE "regalloc"
|
|
|
|
// Compare VirtRegMap::getRegAllocPref().
|
|
AllocationOrder::AllocationOrder(unsigned VirtReg,
|
|
const VirtRegMap &VRM,
|
|
const RegisterClassInfo &RegClassInfo)
|
|
: Pos(0) {
|
|
const MachineFunction &MF = VRM.getMachineFunction();
|
|
const TargetRegisterInfo *TRI = &VRM.getTargetRegInfo();
|
|
Order = RegClassInfo.getOrder(MF.getRegInfo().getRegClass(VirtReg));
|
|
TRI->getRegAllocationHints(VirtReg, Order, Hints, MF, &VRM);
|
|
rewind();
|
|
|
|
DEBUG({
|
|
if (!Hints.empty()) {
|
|
dbgs() << "hints:";
|
|
for (unsigned I = 0, E = Hints.size(); I != E; ++I)
|
|
dbgs() << ' ' << PrintReg(Hints[I], TRI);
|
|
dbgs() << '\n';
|
|
}
|
|
});
|
|
#ifndef NDEBUG
|
|
for (unsigned I = 0, E = Hints.size(); I != E; ++I)
|
|
assert(std::find(Order.begin(), Order.end(), Hints[I]) != Order.end() &&
|
|
"Target hint is outside allocation order.");
|
|
#endif
|
|
}
|