From 2bcfc52af6cbdf3fa3e8ec88c3208bce596f68c8 Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Fri, 3 Feb 2006 18:06:02 +0000 Subject: [PATCH] node predicates add to the complexity of a pattern. This ensures that the X86 backend attempts to match small-immediate versions of instructions before the full size immediate versions. llvm-svn: 25937 --- llvm/utils/TableGen/DAGISelEmitter.cpp | 11 +++++++++-- 1 file changed, 9 insertions(+), 2 deletions(-) diff --git a/llvm/utils/TableGen/DAGISelEmitter.cpp b/llvm/utils/TableGen/DAGISelEmitter.cpp index b9a398f6b4e2..b85ee8c64cc7 100644 --- a/llvm/utils/TableGen/DAGISelEmitter.cpp +++ b/llvm/utils/TableGen/DAGISelEmitter.cpp @@ -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(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; } }