RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-12-13 22:58:50 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

node predicates add to the complexity of a pattern. This ensures that the

Browse Source 
X86 backend attempts to match small-immediate versions of instructions before
the full size immediate versions.

llvm-svn: 25937
This commit is contained in:
Chris Lattner 2006-02-03 18:06:02 +00:00
parent 255ef92e53
commit 21f305febf
1 changed files with 9 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
utils/TableGen/DAGISelEmitter.cpp
View File

@ -1722,7 +1722,12 @@ static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
const ComplexPattern *AM = NodeGetComplexPattern(P, ISE);
if (AM)
Size += AM->getNumOperands() * 2;
// If this node has some predicate function that must match, it adds to the
// complexity of this node.
if (!P->getPredicateFn().empty())
++Size;
// Count children in the count if they are also nodes.
for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
TreePatternNode *Child = P->getChild(i);
@ -1730,9 +1735,11 @@ static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
Size += getPatternSize(Child, ISE);
else if (Child->isLeaf()) {
if (dynamic_cast<IntInit*>(Child->getLeafValue()))
Size += 3; // Matches a ConstantSDNode.
Size += 3; // Matches a ConstantSDNode (+2) and a specific value (+1).
else if (NodeIsComplexPattern(Child))
Size += getPatternSize(Child, ISE);
else if (!Child->getPredicateFn().empty())
++Size;
}
}