replica
/
hanchenye-llvm-project
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Emit series of conditionals with &&, emitting stuff like this: 

if (N1.getOpcode() == ISD::LOAD &&
        N1.hasOneUse() &&
        !CodeGenMap.count(N1.getValue(0)) &&
        !CodeGenMap.count(N1.getValue(1))) {

instead of this:

    if (N1.getOpcode() == ISD::LOAD) {
      if (N1.hasOneUse()) {
        if (!CodeGenMap.count(N1.getValue(0))) {
          if (!CodeGenMap.count(N1.getValue(1))) {

llvm-svn: 25763
This commit is contained in:
Chris Lattner 2006-01-29 04:41:05 +00:00
parent 7c0149d1d6
commit 0e352963fd
1 changed files with 48 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

61
llvm/utils/TableGen/DAGISelEmitter.cpp
View File

@ -2584,6 +2584,24 @@ void DAGISelEmitter::GenerateCodeForPattern(PatternToMatch &Pattern,
delete Pat;
}
/// EraseCodeLine - Erase one code line from all of the patterns. If removing
/// a line causes any of them to be empty, remove them and return true when
/// done.
static bool EraseCodeLine(std::vector<std::pair<PatternToMatch*,
std::vector<std::pair<bool, std::string> > > >
&Patterns) {
bool ErasedPatterns = false;
for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
Patterns[i].second.pop_back();
if (Patterns[i].second.empty()) {
Patterns.erase(Patterns.begin()+i);
--i; --e;
ErasedPatterns = true;
}
}
return ErasedPatterns;
}
/// EmitPatterns - Emit code for at least one pattern, but try to group common
/// code together between the patterns.
void DAGISelEmitter::EmitPatterns(std::vector<std::pair<PatternToMatch*,
@ -2596,8 +2614,10 @@ void DAGISelEmitter::EmitPatterns(std::vector<std::pair<PatternToMatch*,
if (Patterns.empty()) return;
// Figure out how many patterns share the next code line:
const CodeLine &FirstCodeLine = Patterns.back().second.back();
// Figure out how many patterns share the next code line. Explicitly copy
// FirstCodeLine so that we don't invalidate a reference when changing
// Patterns.
const CodeLine FirstCodeLine = Patterns.back().second.back();
unsigned LastMatch = Patterns.size()-1;
while (LastMatch != 0 && Patterns[LastMatch-1].second.back() == FirstCodeLine)
--LastMatch;
@ -2645,6 +2665,9 @@ void DAGISelEmitter::EmitPatterns(std::vector<std::pair<PatternToMatch*,
return;
}
// Remove this code from all of the patterns that share it.
bool ErasedPatterns = EraseCodeLine(Patterns);
bool isPredicate = FirstCodeLine.first;
// Otherwise, every pattern in the list has this line. Emit it.
@ -2652,18 +2675,30 @@ void DAGISelEmitter::EmitPatterns(std::vector<std::pair<PatternToMatch*,
// Normal code.
OS << std::string(Indent, ' ') << FirstCodeLine.second << "\n";
} else {
OS << std::string(Indent, ' ')
<< "if (" << FirstCodeLine.second << ") {\n";
Indent += 2;
}
// Remove this code from all of the patterns that share it.
for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
Patterns[i].second.pop_back();
if (Patterns[i].second.empty()) {
Patterns.erase(Patterns.begin()+i);
--i; --e;
OS << std::string(Indent, ' ') << "if (" << FirstCodeLine.second;
// If the next code line is another predicate, and if all of the pattern
// in this group share the same next line, emit it inline now. Do this
// until we run out of common predicates.
while (!ErasedPatterns && Patterns.back().second.back().first) {
// Check that all of fhe patterns in Patterns end with the same predicate.
bool AllEndWithSamePredicate = true;
for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
if (Patterns[i].second.back() != Patterns.back().second.back()) {
AllEndWithSamePredicate = false;
break;
}
// If all of the predicates aren't the same, we can't share them.
if (!AllEndWithSamePredicate) break;
// Otherwise we can. Emit it shared now.
OS << " &&\n" << std::string(Indent+4, ' ')
<< Patterns.back().second.back().second;
ErasedPatterns = EraseCodeLine(Patterns);
}
OS << ") {\n";
Indent += 2;
}
EmitPatterns(Patterns, Indent, OS);