Index: src/IceTargetLowering.cpp |
diff --git a/src/IceTargetLowering.cpp b/src/IceTargetLowering.cpp |
index 0ee0afa2301929fa5e2596a709f0db2bd03e3886..94821ce64329e267601ba49f81bbef64538313ff 100644 |
--- a/src/IceTargetLowering.cpp |
+++ b/src/IceTargetLowering.cpp |
@@ -293,6 +293,11 @@ void TargetLowering::regAlloc(RegAllocKind Kind) { |
Repeat = false; |
Kind = RAK_SecondChance; |
} while (Repeat); |
+ // TODO(stichnot): Run the register allocator one more time to do stack slot |
+ // coalescing. The idea would be to initialize the Unhandled list with the |
+ // set of Variables that have no register and a non-empty live range, and |
+ // model an infinite number of registers. Maybe use the register aliasing |
+ // mechanism to get better packing of narrower slots. |
} |
void TargetLowering::markRedefinitions() { |