aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorTomas Matheson <tomas.matheson@arm.com>2025-01-22 10:27:26 +0000
committerTomas Matheson <tomas.matheson@arm.com>2025-01-22 10:27:26 +0000
commit9b76a7ea0fc731b8998e22b92dc1ae9c7da868c8 (patch)
tree9dd246c231a5958e3012ad0f9ef827e60c199906
parent7e7ba17845cd66e3fcbbe19097f4a60407e13ef4 (diff)
downloadllvm-users/tmatheson-arm/multiple_output_patterns.zip
llvm-users/tmatheson-arm/multiple_output_patterns.tar.gz
llvm-users/tmatheson-arm/multiple_output_patterns.tar.bz2
-rw-r--r--llvm/utils/TableGen/Common/CodeGenDAGPatterns.cpp17
-rw-r--r--llvm/utils/TableGen/FastISelEmitter.cpp3
2 files changed, 9 insertions, 11 deletions
diff --git a/llvm/utils/TableGen/Common/CodeGenDAGPatterns.cpp b/llvm/utils/TableGen/Common/CodeGenDAGPatterns.cpp
index fcff67b..858910a 100644
--- a/llvm/utils/TableGen/Common/CodeGenDAGPatterns.cpp
+++ b/llvm/utils/TableGen/Common/CodeGenDAGPatterns.cpp
@@ -2810,7 +2810,7 @@ TreePattern::TreePattern(const Record *TheRec,
TreePattern TreePattern::clone() const {
TreePattern New = *this;
- for(TreePatternNodePtr& Tree : New.Trees)
+ for (TreePatternNodePtr &Tree : New.Trees)
Tree = Tree->clone();
return New;
}
@@ -2828,7 +2828,6 @@ bool TreePattern::hasProperTypeByHwMode() const {
[](auto &T) { return T->hasProperTypeByHwMode(); });
}
-
void TreePattern::ComputeNamedNodes() {
for (TreePatternNodePtr &Tree : Trees)
ComputeNamedNodes(*Tree);
@@ -4392,10 +4391,10 @@ void CodeGenDAGPatterns::ParseOnePattern(
// tree which has possible types.
for (const auto &InTree : Pattern.getTrees()) {
if (InTree->hasPossibleType())
- AddPatternToMatch(&Pattern,
- PatternToMatch(TheDef, Preds, InTree,
- ExpandedOutPattern, InstImpResults,
- Complexity, TheDef->getID(), ShouldIgnore));
+ AddPatternToMatch(
+ &Pattern, PatternToMatch(TheDef, Preds, InTree, ExpandedOutPattern,
+ InstImpResults, Complexity, TheDef->getID(),
+ ShouldIgnore));
}
}
@@ -4464,9 +4463,9 @@ void CodeGenDAGPatterns::ExpandHwModeBasedTypes() {
return;
PatternsToMatch.emplace_back(P.getSrcRecord(), P.getPredicates(),
- std::move(NewSrc), NewDst,
- P.getDstRegs(), P.getAddedComplexity(),
- getNewUID(), P.getGISelShouldIgnore(), Check);
+ std::move(NewSrc), NewDst, P.getDstRegs(),
+ P.getAddedComplexity(), getNewUID(),
+ P.getGISelShouldIgnore(), Check);
};
for (PatternToMatch &P : Copy) {
diff --git a/llvm/utils/TableGen/FastISelEmitter.cpp b/llvm/utils/TableGen/FastISelEmitter.cpp
index d5f850b..a452640 100644
--- a/llvm/utils/TableGen/FastISelEmitter.cpp
+++ b/llvm/utils/TableGen/FastISelEmitter.cpp
@@ -591,8 +591,7 @@ void FastISelMap::collectPatterns(const CodeGenDAGPatterns &CGP) {
// Ok, we found a pattern that we can handle. Remember it.
InstructionMemo Memo(
Pattern.getDstPattern().getOnlyTree()->getOperator()->getName(), DstRC,
- std::move(SubRegNo), std::move(PhysRegInputs),
- PredicateCheck);
+ std::move(SubRegNo), std::move(PhysRegInputs), PredicateCheck);
int complexity = Pattern.getPatternComplexity(CGP);