1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-23 11:13:28 +01:00

clean up some code, eliminate NodeIsComplexPattern, which

does the same thing as getComplexPatternInfo.

llvm-svn: 96411
This commit is contained in:
Chris Lattner 2010-02-16 23:13:59 +00:00
parent 964b01232c
commit c89e98d63b

View File

@ -47,16 +47,6 @@ static std::string getValueName(const std::string &S) {
return S;
}
/// NodeIsComplexPattern - return true if N is a leaf node and a subclass of
/// ComplexPattern.
static bool NodeIsComplexPattern(TreePatternNode *N) {
return (N->isLeaf() &&
dynamic_cast<DefInit*>(N->getLeafValue()) &&
static_cast<DefInit*>(N->getLeafValue())->getDef()->
isSubClassOf("ComplexPattern"));
}
/// getPatternSize - Return the 'size' of this pattern. We want to match large
/// patterns before small ones. This is used to determine the size of a
/// pattern.
@ -96,7 +86,7 @@ static unsigned getPatternSize(TreePatternNode *P, CodeGenDAGPatterns &CGP) {
else if (Child->isLeaf()) {
if (dynamic_cast<IntInit*>(Child->getLeafValue()))
Size += 5; // Matches a ConstantSDNode (+3) and a specific value (+2).
else if (NodeIsComplexPattern(Child))
else if (Child->getComplexPatternInfo(CGP))
Size += getPatternSize(Child, CGP);
else if (!Child->getPredicateFns().empty())
++Size;
@ -530,10 +520,9 @@ void PatternCodeEmitter::EmitMatchCode(TreePatternNode *N, TreePatternNode *P,
")->getSExtValue() == INT64_C(" +
itostr(II->getValue()) + ")");
return;
} else if (!NodeIsComplexPattern(N)) {
assert(0 && "Cannot match this as a leaf value!");
abort();
}
assert(N->getComplexPatternInfo(CGP) != 0 &&
"Cannot match this as a leaf value!");
}
// If this node has a name associated with it, capture it in VariableMap. If
@ -2015,10 +2004,8 @@ void DAGISelEmitter::run(raw_ostream &OS) {
Matcher = new PushMatcherNode(N, Matcher);
}
// OptimizeMatcher(Matcher);
EmitMatcherTable(Matcher, OS);
//Matcher->dump();
delete Matcher;
#endif