RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 03:33:20 +01:00
Code Issues Projects Releases Wiki Activity

[PBQP] Conservativelly allocatable nodes can be spilled and give a better solution

Browse Source 
Although such nodes are allocatable, the cost of spilling may be less than
allocating to register, so spilling the node may provide a better solution.
The assert does not account for this case, so remove it for now.

llvm-svn: 229103
This commit is contained in:
Arnaud A. de Grandmaison 2015-02-13 12:04:42 +00:00
parent 88288c494b
commit b1fde3b904
2 changed files with 0 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
include/llvm/CodeGen/RegAllocPBQP.h
View File

@ -257,9 +257,6 @@ public:
assert(RS >= this->RS && "A node's reduction state can not be downgraded");
this->RS = RS;
}
bool isSpillable() const {
return RS == NotProvablyAllocatable || RS == OptimallyReducible;
}
void handleAddEdge(const MatrixMetadata& MD, bool Transpose) {
DeniedOpts += Transpose ? MD.getWorstRow() : MD.getWorstCol();

2
lib/CodeGen/RegAllocPBQP.cpp
View File

@ -621,8 +621,6 @@ bool RegAllocPBQP::mapPBQPToRegAlloc(const PBQPRAGraph &G,
assert(PReg != 0 && "Invalid preg selected.");
VRM.assignVirt2Phys(VReg, PReg);
} else {
assert(G.getNodeMetadata(NId).isSpillable() &&
"Spilling a node which can not be spilled.");
// Spill VReg. If this introduces new intervals we'll need another round
// of allocation.
SmallVector<unsigned, 8> NewVRegs;