summaryrefslogtreecommitdiff
path: root/lib/CodeGen/RegisterScavenging.cpp
diff options
context:
space:
mode:
authorJim Grosbach <grosbach@apple.com>2010-07-08 00:38:54 +0000
committerJim Grosbach <grosbach@apple.com>2010-07-08 00:38:54 +0000
commitd9642faf7c66273eb3a8d99e5fa6b542da5374dd (patch)
tree046f3eaf0f3e02ebbc6ad7d174cce551c72b4817 /lib/CodeGen/RegisterScavenging.cpp
parent0238f8c430050d23ef861169bb4c4f930af0ef97 (diff)
downloadllvm-d9642faf7c66273eb3a8d99e5fa6b542da5374dd.tar.gz
llvm-d9642faf7c66273eb3a8d99e5fa6b542da5374dd.tar.bz2
llvm-d9642faf7c66273eb3a8d99e5fa6b542da5374dd.tar.xz
When processing frame index virtual registers, consider all available registers
(if there are any) and use the one which remains available for the longest rather than just using the first one. This should help enable better re-use of the loaded frame index values. rdar://7318760 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@107847 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/CodeGen/RegisterScavenging.cpp')
-rw-r--r--lib/CodeGen/RegisterScavenging.cpp12
1 files changed, 11 insertions, 1 deletions
diff --git a/lib/CodeGen/RegisterScavenging.cpp b/lib/CodeGen/RegisterScavenging.cpp
index 3eefedadf2..8a1ef5adf7 100644
--- a/lib/CodeGen/RegisterScavenging.cpp
+++ b/lib/CodeGen/RegisterScavenging.cpp
@@ -242,8 +242,18 @@ unsigned RegScavenger::FindUnusedReg(const TargetRegisterClass *RC) const {
return 0;
}
+/// getRegsAvailable - Return all available registers in the register class
+/// in Mask.
+void RegScavenger::getRegsAvailable(const TargetRegisterClass *RC,
+ BitVector &Mask) {
+ for (TargetRegisterClass::iterator I = RC->begin(), E = RC->end();
+ I != E; ++I)
+ if (!isAliasUsed(*I))
+ Mask.set(*I);
+}
+
/// findSurvivorReg - Return the candidate register that is unused for the
-/// longest after MBBI. UseMI is set to the instruction where the search
+/// longest after StargMII. UseMI is set to the instruction where the search
/// stopped.
///
/// No more than InstrLimit instructions are inspected.