6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-11-01 15:17:25 +00:00
Code Issues Projects Releases Wiki Activity

Convert TargetRegisterInfo's super-register checking to use a pre-computed hash table just like subregister checking does.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@68669 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Owen Anderson
2009-04-09 03:50:16 +00:00
parent 49a4ba9241
commit 7d770be047
3 changed files with 101 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
include/llvm/Target/TargetRegisterInfo.h
View File

@@ -224,6 +224,8 @@ class TargetRegisterInfo {
protected:
const unsigned* SubregHash;
const unsigned SubregHashSize;
const unsigned* SuperregHash;
const unsigned SuperregHashSize;
public:
typedef const TargetRegisterClass * const * regclass_iterator;
private:
@@ -240,7 +242,9 @@ protected:
int CallFrameSetupOpcode = -1,
int CallFrameDestroyOpcode = -1,
const unsigned* subregs = 0,
const unsigned subregsize = 0);
const unsigned subregsize = 0,
const unsigned* superregs = 0,
const unsigned superregsize = 0);
virtual ~TargetRegisterInfo();
public:
@@ -379,8 +383,18 @@ public:
/// isSuperRegister - Returns true if regB is a super-register of regA.
///
bool isSuperRegister(unsigned regA, unsigned regB) const {
for (const unsigned *SR = getSuperRegisters(regA); *SR; ++SR)
if (*SR == regB) return true;
// SuperregHash is a simple quadratically probed hash table.
size_t index = (regA + regB * 37) & (SuperregHashSize-1);
unsigned ProbeAmt = 2;
while (SuperregHash[index*2] != 0 &&
SuperregHash[index*2+1] != 0) {
if (SuperregHash[index*2] == regA && SuperregHash[index*2+1] == regB)
return true;
index = (index + ProbeAmt) & (SuperregHashSize-1);
ProbeAmt += 2;
}
return false;
}