summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorCraig Topper <craig.topper@intel.com>2017-09-04 03:44:33 +0000
committerCraig Topper <craig.topper@intel.com>2017-09-04 03:44:33 +0000
commit98a9628b094248c10c1be8cd4bffab74249b61be (patch)
treefe7e9112281241c36b77092b243a2a9d468ff9f4
parent76f44015e7043682977e3795d7bbb20cafa326a3 (diff)
downloadbcm5719-llvm-98a9628b094248c10c1be8cd4bffab74249b61be.tar.gz
bcm5719-llvm-98a9628b094248c10c1be8cd4bffab74249b61be.zip
[TableGen] Teach tablegen to allow SDNPCommutable nodes with more than 2 operands.
Summary: Tablegen already supports commutable instrinsics with more than 2 operands. There it just assumes the first two operands are commutable. I plan to use this to improve the generation of FMA patterns in the X86 backend. Reviewers: aymanmus, zvi, RKSimon, spatel, arsenm Reviewed By: arsenm Subscribers: arsenm, llvm-commits Differential Revision: https://reviews.llvm.org/D37430 llvm-svn: 312464
-rw-r--r--llvm/utils/TableGen/CodeGenDAGPatterns.cpp13
1 files changed, 9 insertions, 4 deletions
diff --git a/llvm/utils/TableGen/CodeGenDAGPatterns.cpp b/llvm/utils/TableGen/CodeGenDAGPatterns.cpp
index 5200cda8faa..216d6f9d421 100644
--- a/llvm/utils/TableGen/CodeGenDAGPatterns.cpp
+++ b/llvm/utils/TableGen/CodeGenDAGPatterns.cpp
@@ -3744,7 +3744,7 @@ static void GenerateVariantsOf(TreePatternNode *N,
// If this node is commutative, consider the commuted order.
bool isCommIntrinsic = N->isCommutativeIntrinsic(CDP);
if (NodeInfo.hasProperty(SDNPCommutative) || isCommIntrinsic) {
- assert((N->getNumChildren()==2 || isCommIntrinsic) &&
+ assert((N->getNumChildren()>=2 || isCommIntrinsic) &&
"Commutative but doesn't have 2 children!");
// Don't count children which are actually register references.
unsigned NC = 0;
@@ -3772,9 +3772,14 @@ static void GenerateVariantsOf(TreePatternNode *N,
for (unsigned i = 3; i != NC; ++i)
Variants.push_back(ChildVariants[i]);
CombineChildVariants(N, Variants, OutVariants, CDP, DepVars);
- } else if (NC == 2)
- CombineChildVariants(N, ChildVariants[1], ChildVariants[0],
- OutVariants, CDP, DepVars);
+ } else if (NC == N->getNumChildren()) {
+ std::vector<std::vector<TreePatternNode*> > Variants;
+ Variants.push_back(ChildVariants[1]);
+ Variants.push_back(ChildVariants[0]);
+ for (unsigned i = 2; i != NC; ++i)
+ Variants.push_back(ChildVariants[i]);
+ CombineChildVariants(N, Variants, OutVariants, CDP, DepVars);
+ }
}
}
OpenPOWER on IntegriCloud