diff options
| author | Jakob Stoklund Olesen <stoklund@2pi.dk> | 2011-06-15 04:50:36 +0000 |
|---|---|---|
| committer | Jakob Stoklund Olesen <stoklund@2pi.dk> | 2011-06-15 04:50:36 +0000 |
| commit | ae1920b1efa72c1789d562df4746110d0c2e10bd (patch) | |
| tree | 22d7d8690b9997d57f32d4a0fd850b3d99dd0846 /utils/TableGen/DAGISelMatcherGen.cpp | |
| parent | 393c4047c05b6d7b5851d339e51bb2cc35f630c2 (diff) | |
| download | llvm-ae1920b1efa72c1789d562df4746110d0c2e10bd.tar.gz llvm-ae1920b1efa72c1789d562df4746110d0c2e10bd.tar.bz2 llvm-ae1920b1efa72c1789d562df4746110d0c2e10bd.tar.xz | |
Give CodeGenRegisterClass a real sorted member set.
Make the Elements vector private and expose an ArrayRef through
getOrder() instead. getOrder will eventually provide multiple
user-specified allocation orders.
Use the sorted member set for member and subclass tests. Clean up a lot
of ad hoc searches.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@133040 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'utils/TableGen/DAGISelMatcherGen.cpp')
| -rw-r--r-- | utils/TableGen/DAGISelMatcherGen.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/utils/TableGen/DAGISelMatcherGen.cpp b/utils/TableGen/DAGISelMatcherGen.cpp index 402a239ec5..a8736fa2f6 100644 --- a/utils/TableGen/DAGISelMatcherGen.cpp +++ b/utils/TableGen/DAGISelMatcherGen.cpp @@ -25,12 +25,12 @@ static MVT::SimpleValueType getRegisterValueType(Record *R, const CodeGenTarget &T) { bool FoundRC = false; MVT::SimpleValueType VT = MVT::Other; + const CodeGenRegister *Reg = T.getRegBank().getReg(R); const std::vector<CodeGenRegisterClass> &RCs = T.getRegisterClasses(); - std::vector<Record*>::const_iterator Element; for (unsigned rc = 0, e = RCs.size(); rc != e; ++rc) { const CodeGenRegisterClass &RC = RCs[rc]; - if (!std::count(RC.Elements.begin(), RC.Elements.end(), R)) + if (!RC.contains(Reg)) continue; if (!FoundRC) { |