RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-02-08 13:26:19 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Pattern complexity calculation fix.

Browse Source 
llvm-svn: 25133
This commit is contained in:
Evan Cheng 2006-01-06 22:19:44 +00:00
parent 060b19c708
commit 353958d60c
1 changed files with 9 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
utils/TableGen/DAGISelEmitter.cpp
View File

@ -1691,6 +1691,11 @@ static const ComplexPattern *NodeGetComplexPattern(TreePatternNode *N,
/// patterns before small ones. This is used to determine the size of a
/// pattern.
static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
assert(isExtIntegerInVTs(P->getExtTypes()) ||
isExtFloatingPointInVTs(P->getExtTypes()) ||
P->getExtTypeNum(0) == MVT::isVoid ||
P->getExtTypeNum(0) == MVT::Flag &&
"Not a valid pattern node to size!");
unsigned Size = 2; // The node itself.
// FIXME: This is a hack to statically increase the priority of patterns
@ -1700,7 +1705,7 @@ static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
// calculate the complexity of all patterns a dag can potentially map to.
const ComplexPattern *AM = NodeGetComplexPattern(P, ISE);
if (AM)
Size += AM->getNumOperands();
Size += AM->getNumOperands() * 2;
// Count children in the count if they are also nodes.
for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
@ -1708,10 +1713,10 @@ static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
if (!Child->isLeaf() && Child->getExtTypeNum(0) != MVT::Other)
Size += getPatternSize(Child, ISE);
else if (Child->isLeaf()) {
Size += getPatternSize(Child, ISE);
if (dynamic_cast<IntInit*>(Child->getLeafValue()))
// Matches a ConstantSDNode. More specific to any immediate.
++Size;
Size += 3; // Matches a ConstantSDNode.
else if (NodeIsComplexPattern(Child))
Size += getPatternSize(Child, ISE);
}
}