Instead of building a list and sorting it just to find a maximum element,

compute the maximum element directly.

llvm-svn: 56411
This commit is contained in:
Dan Gohman 2008-09-21 21:01:49 +00:00
parent 981113c401
commit c8477ceabe

View File

@ -35,17 +35,6 @@ TargetRegisterInfo::TargetRegisterInfo(const TargetRegisterDesc *D, unsigned NR,
TargetRegisterInfo::~TargetRegisterInfo() {}
namespace {
// Sort according to super- / sub- class relations.
// i.e. super- register class < sub- register class.
struct RCCompare {
bool operator()(const TargetRegisterClass* const &LHS,
const TargetRegisterClass* const &RHS) {
return RHS->hasSuperClass(LHS);
}
};
}
/// getPhysicalRegisterRegClass - Returns the Register Class of a physical
/// register of the given type. If type is MVT::Other, then just return any
/// register class the register belongs to.
@ -53,24 +42,18 @@ const TargetRegisterClass *
TargetRegisterInfo::getPhysicalRegisterRegClass(unsigned reg, MVT VT) const {
assert(isPhysicalRegister(reg) && "reg must be a physical register");
// Pick the register class of the right type that contains this physreg.
SmallVector<const TargetRegisterClass*, 4> RCs;
// Pick the most super register class of the right type that contains
// this physreg.
const TargetRegisterClass* BestRC = 0;
for (regclass_iterator I = regclass_begin(), E = regclass_end(); I != E; ++I){
if ((VT == MVT::Other || (*I)->hasType(VT)) && (*I)->contains(reg))
RCs.push_back(*I);
const TargetRegisterClass* RC = *I;
if ((VT == MVT::Other || RC->hasType(VT)) && RC->contains(reg) &&
(!BestRC || BestRC->hasSuperClass(RC)))
BestRC = RC;
}
if (RCs.size() == 1)
return RCs[0];
if (RCs.size()) {
// Multiple compatible register classes. Get the super- class.
std::stable_sort(RCs.begin(), RCs.end(), RCCompare());
return RCs[0];
}
assert(false && "Couldn't find the register class");
return 0;
assert(BestRC && "Couldn't find the register class");
return BestRC;
}
/// getAllocatableSetForRC - Toggle the bits that represent allocatable