diff options
author | Florian Hahn <florian.hahn@arm.com> | 2018-06-13 20:59:53 +0000 |
---|---|---|
committer | Florian Hahn <florian.hahn@arm.com> | 2018-06-13 20:59:53 +0000 |
commit | 4dd569c7cc3db627ecf14a6f91db3c21b537d20a (patch) | |
tree | 8c565a56bb411125101b486bf0940a6b6ec9d615 /llvm/utils/TableGen/CodeGenDAGPatterns.cpp | |
parent | 9218a37a658f45830ed9026c7653401ad431c04c (diff) | |
download | bcm5719-llvm-4dd569c7cc3db627ecf14a6f91db3c21b537d20a.tar.gz bcm5719-llvm-4dd569c7cc3db627ecf14a6f91db3c21b537d20a.zip |
[TableGen] Make getOnlyTree return a const ref (NFC)
This avoids some unnecessary copies of shared_ptrs.
Those changes were suggested post-commit for D47463.
llvm-svn: 334656
Diffstat (limited to 'llvm/utils/TableGen/CodeGenDAGPatterns.cpp')
-rw-r--r-- | llvm/utils/TableGen/CodeGenDAGPatterns.cpp | 18 |
1 files changed, 10 insertions, 8 deletions
diff --git a/llvm/utils/TableGen/CodeGenDAGPatterns.cpp b/llvm/utils/TableGen/CodeGenDAGPatterns.cpp index 998cf3300bf..f1cde80952b 100644 --- a/llvm/utils/TableGen/CodeGenDAGPatterns.cpp +++ b/llvm/utils/TableGen/CodeGenDAGPatterns.cpp @@ -4010,7 +4010,7 @@ void CodeGenDAGPatterns::ParsePatterns() { InstResults, InstImpResults); // Promote the xform function to be an explicit node if set. - TreePatternNodePtr DstPattern = Result.getOnlyTree(); + const TreePatternNodePtr &DstPattern = Result.getOnlyTree(); std::vector<TreePatternNodePtr> ResultNodeOperands; for (unsigned ii = 0, ee = DstPattern->getNumChildren(); ii != ee; ++ii) { TreePatternNodePtr OpNode = DstPattern->getChildShared(ii); @@ -4023,16 +4023,18 @@ void CodeGenDAGPatterns::ParsePatterns() { } ResultNodeOperands.push_back(OpNode); } - DstPattern = Result.getOnlyTree(); - if (!DstPattern->isLeaf()) - DstPattern = std::make_shared<TreePatternNode>(DstPattern->getOperator(), - ResultNodeOperands, - DstPattern->getNumTypes()); + + TreePatternNodePtr DstShared = + DstPattern->isLeaf() + ? DstPattern + : std::make_shared<TreePatternNode>(DstPattern->getOperator(), + ResultNodeOperands, + DstPattern->getNumTypes()); for (unsigned i = 0, e = Result.getOnlyTree()->getNumTypes(); i != e; ++i) - DstPattern->setType(i, Result.getOnlyTree()->getExtType(i)); + DstShared->setType(i, Result.getOnlyTree()->getExtType(i)); - TreePattern Temp(Result.getRecord(), DstPattern, false, *this); + TreePattern Temp(Result.getRecord(), DstShared, false, *this); Temp.InferAllTypes(); // A pattern may end up with an "impossible" type, i.e. a situation |