replica
/
hanchenye-llvm-project
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

[TableGen] Move some shared_ptrs to avoid unnecessary copies (NFC). 

Those changes were suggested post-commit for D47463.

llvm-svn: 334706
This commit is contained in:
Florian Hahn 2018-06-14 11:56:19 +00:00
parent 9629d7897d
commit 0a2e0b6b0e
1 changed files with 21 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

42
llvm/utils/TableGen/CodeGenDAGPatterns.cpp
View File

@ -1825,7 +1825,7 @@ void TreePatternNode::SubstituteFormalArguments(
assert((Child->getPredicateFns().empty() || assert((Child->getPredicateFns().empty() ||
NewChild->getPredicateFns() == Child->getPredicateFns()) && NewChild->getPredicateFns() == Child->getPredicateFns()) &&
"Non-empty child predicate clobbered!"); "Non-empty child predicate clobbered!");
setChild(i, NewChild); setChild(i, std::move(NewChild));
} }
} else { } else {
getChild(i)->SubstituteFormalArguments(ArgMap); getChild(i)->SubstituteFormalArguments(ArgMap);
@ -1856,7 +1856,7 @@ TreePatternNodePtr TreePatternNode::InlinePatternFragments(TreePatternNodePtr T,
NewChild->getPredicateFns() == Child->getPredicateFns()) && NewChild->getPredicateFns() == Child->getPredicateFns()) &&
"Non-empty child predicate clobbered!"); "Non-empty child predicate clobbered!");
setChild(i, NewChild); setChild(i, std::move(NewChild));
} }
return T; return T;
} }
@ -1883,7 +1883,7 @@ TreePatternNodePtr TreePatternNode::InlinePatternFragments(TreePatternNodePtr T,
// Compute the map of formal to actual arguments. // Compute the map of formal to actual arguments.
std::map<std::string, TreePatternNodePtr> ArgMap; std::map<std::string, TreePatternNodePtr> ArgMap;
for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i) { for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i) {
TreePatternNodePtr Child = getChildShared(i); const TreePatternNodePtr &Child = getChildShared(i);
ArgMap[Frag->getArgName(i)] = Child->InlinePatternFragments(Child, TP); ArgMap[Frag->getArgName(i)] = Child->InlinePatternFragments(Child, TP);
} }
@ -2673,9 +2673,8 @@ TreePatternNodePtr TreePattern::ParseTreePattern(Init *TheInit,
else // Otherwise, no chain. else // Otherwise, no chain.
Operator = getDAGPatterns().get_intrinsic_wo_chain_sdnode(); Operator = getDAGPatterns().get_intrinsic_wo_chain_sdnode();
TreePatternNodePtr IIDNode = Children.insert(Children.begin(),
std::make_shared<TreePatternNode>(IntInit::get(IID), 1); std::make_shared<TreePatternNode>(IntInit::get(IID), 1));
Children.insert(Children.begin(), IIDNode);
} }
if (Operator->isSubClassOf("ComplexPattern")) { if (Operator->isSubClassOf("ComplexPattern")) {
@ -2736,7 +2735,7 @@ static bool SimplifyTree(TreePatternNodePtr &N) {
for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) { for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
TreePatternNodePtr Child = N->getChildShared(i); TreePatternNodePtr Child = N->getChildShared(i);
MadeChange |= SimplifyTree(Child); MadeChange |= SimplifyTree(Child);
N->setChild(i, Child); N->setChild(i, std::move(Child));
} }
return MadeChange; return MadeChange;
} }
@ -3057,7 +3056,7 @@ void CodeGenDAGPatterns::ParseDefaultOperands() {
DefaultOps[i]->getName() + DefaultOps[i]->getName() +
"' doesn't have a concrete type!"); "' doesn't have a concrete type!");
} }
DefaultOpInfo.DefaultOps.push_back(TPN); DefaultOpInfo.DefaultOps.push_back(std::move(TPN));
} }
// Insert it into the DefaultOperands map so we can find it later. // Insert it into the DefaultOperands map so we can find it later.
@ -3488,9 +3487,9 @@ const DAGInstruction &CodeGenDAGPatterns::parseInstructionPattern(
if (!RNode) if (!RNode)
I->error("Operand $" + OpName + " does not exist in operand list!"); I->error("Operand $" + OpName + " does not exist in operand list!");
ResNodes.push_back(RNode);
Record *R = cast<DefInit>(RNode->getLeafValue())->getDef(); Record *R = cast<DefInit>(RNode->getLeafValue())->getDef();
ResNodes.push_back(std::move(RNode));
if (!R) if (!R)
I->error("Operand $" + OpName + " should be a set destination: all " I->error("Operand $" + OpName + " should be a set destination: all "
"outputs must occur before inputs in operand list!"); "outputs must occur before inputs in operand list!");
@ -3555,7 +3554,7 @@ const DAGInstruction &CodeGenDAGPatterns::parseInstructionPattern(
OpNode->getNumTypes()); OpNode->getNumTypes());
} }
ResultNodeOperands.push_back(OpNode); ResultNodeOperands.push_back(std::move(OpNode));
} }
if (!InstInputsCheck.empty()) if (!InstInputsCheck.empty())
@ -3744,7 +3743,7 @@ void CodeGenDAGPatterns::AddPatternToMatch(TreePattern *Pattern,
SrcNames[Entry.first].second == 1) SrcNames[Entry.first].second == 1)
Pattern->error("Pattern has dead named input: $" + Entry.first); Pattern->error("Pattern has dead named input: $" + Entry.first);
PatternsToMatch.push_back(std::move(PTM)); PatternsToMatch.push_back(PTM);
} }
void CodeGenDAGPatterns::InferInstructionFlags() { void CodeGenDAGPatterns::InferInstructionFlags() {
@ -4084,9 +4083,10 @@ void CodeGenDAGPatterns::ExpandHwModeBasedTypes() {
std::vector<Predicate> Preds = P.Predicates; std::vector<Predicate> Preds = P.Predicates;
const std::vector<Predicate> &MC = ModeChecks[Mode]; const std::vector<Predicate> &MC = ModeChecks[Mode];
Preds.insert(Preds.end(), MC.begin(), MC.end()); Preds.insert(Preds.end(), MC.begin(), MC.end());
PatternsToMatch.emplace_back(P.getSrcRecord(), Preds, NewSrc, NewDst, PatternsToMatch.emplace_back(P.getSrcRecord(), Preds, std::move(NewSrc),
P.getDstRegs(), P.getAddedComplexity(), std::move(NewDst), P.getDstRegs(),
Record::getNewUID(), Mode); P.getAddedComplexity(), Record::getNewUID(),
Mode);
}; };
for (PatternToMatch &P : Copy) { for (PatternToMatch &P : Copy) {
@ -4390,18 +4390,18 @@ static void GenerateVariantsOf(TreePatternNodePtr N,
assert(NC >= 3 && assert(NC >= 3 &&
"Commutative intrinsic should have at least 3 children!"); "Commutative intrinsic should have at least 3 children!");
std::vector<std::vector<TreePatternNodePtr>> Variants; std::vector<std::vector<TreePatternNodePtr>> Variants;
Variants.push_back(ChildVariants[0]); // Intrinsic id. Variants.push_back(std::move(ChildVariants[0])); // Intrinsic id.
Variants.push_back(ChildVariants[2]); Variants.push_back(std::move(ChildVariants[2]));
Variants.push_back(ChildVariants[1]); Variants.push_back(std::move(ChildVariants[1]));
for (unsigned i = 3; i != NC; ++i) for (unsigned i = 3; i != NC; ++i)
Variants.push_back(ChildVariants[i]); Variants.push_back(std::move(ChildVariants[i]));
CombineChildVariants(N, Variants, OutVariants, CDP, DepVars); CombineChildVariants(N, Variants, OutVariants, CDP, DepVars);
} else if (NC == N->getNumChildren()) { } else if (NC == N->getNumChildren()) {
std::vector<std::vector<TreePatternNodePtr>> Variants; std::vector<std::vector<TreePatternNodePtr>> Variants;
Variants.push_back(ChildVariants[1]); Variants.push_back(std::move(ChildVariants[1]));
Variants.push_back(ChildVariants[0]); Variants.push_back(std::move(ChildVariants[0]));
for (unsigned i = 2; i != NC; ++i) for (unsigned i = 2; i != NC; ++i)
Variants.push_back(ChildVariants[i]); Variants.push_back(std::move(ChildVariants[i]));
CombineChildVariants(N, Variants, OutVariants, CDP, DepVars); CombineChildVariants(N, Variants, OutVariants, CDP, DepVars);
} }
} }