diff options
| author | Arnaud A. de Grandmaison <arnaud.degrandmaison@arm.com> | 2015-02-13 12:04:42 +0000 |
|---|---|---|
| committer | Arnaud A. de Grandmaison <arnaud.degrandmaison@arm.com> | 2015-02-13 12:04:42 +0000 |
| commit | a7c90d8487912a9bceadfa4b5b95dd7a1502349b (patch) | |
| tree | d35c499215b172901109da943dba29ed245a8a3b /llvm/lib/CodeGen | |
| parent | 095b128671c9c3ae92d3528a0d9beffcb8ff6187 (diff) | |
| download | bcm5719-llvm-a7c90d8487912a9bceadfa4b5b95dd7a1502349b.tar.gz bcm5719-llvm-a7c90d8487912a9bceadfa4b5b95dd7a1502349b.zip | |
[PBQP] Conservativelly allocatable nodes can be spilled and give a better solution
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
Diffstat (limited to 'llvm/lib/CodeGen')
| -rw-r--r-- | llvm/lib/CodeGen/RegAllocPBQP.cpp | 2 |
1 files changed, 0 insertions, 2 deletions
diff --git a/llvm/lib/CodeGen/RegAllocPBQP.cpp b/llvm/lib/CodeGen/RegAllocPBQP.cpp index 0fb4ef62eff..bdc669ce4ef 100644 --- a/llvm/lib/CodeGen/RegAllocPBQP.cpp +++ b/llvm/lib/CodeGen/RegAllocPBQP.cpp @@ -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; |

