@@ -108,15 +108,15 @@ static bool isNeg(Value *V);
108
108
static Value *getNegOperand (Value *V);
109
109
110
110
namespace {
111
- template <typename T, typename IterT>
112
- std::optional<T> findCommonBetweenCollections (IterT A, IterT B) {
113
- auto Common = llvm::find_if (A, [B](T I){ return llvm::is_contained (B, I);});
114
- if (Common != A.end ())
115
- return std::make_optional (*Common);
116
- return std::nullopt;
117
- }
111
+ template <typename T, typename IterT>
112
+ std::optional<T> findCommonBetweenCollections (IterT A, IterT B) {
113
+ auto Common = llvm::find_if (A, [B](T I) { return llvm::is_contained (B, I); });
114
+ if (Common != A.end ())
115
+ return std::make_optional (*Common);
116
+ return std::nullopt;
117
+ }
118
118
119
- class ComplexDeinterleavingLegacyPass : public FunctionPass {
119
+ class ComplexDeinterleavingLegacyPass : public FunctionPass {
120
120
public:
121
121
static char ID;
122
122
@@ -207,7 +207,7 @@ struct ComplexDeinterleavingCompositeNode {
207
207
}
208
208
}
209
209
210
- bool AreOperandsValid () { return OperandsValid; }
210
+ bool areOperandsValid () { return OperandsValid; }
211
211
};
212
212
213
213
class ComplexDeinterleavingGraph {
@@ -1034,13 +1034,14 @@ ComplexDeinterleavingGraph::identifyPartialReduction(Value *R, Value *I) {
1034
1034
if (!isa<VectorType>(R->getType ()) || !isa<VectorType>(I->getType ()))
1035
1035
return nullptr ;
1036
1036
1037
- auto CommonUser = findCommonBetweenCollections<Value*>(R->users (), I->users ());
1037
+ auto CommonUser =
1038
+ findCommonBetweenCollections<Value *>(R->users (), I->users ());
1038
1039
if (!CommonUser)
1039
1040
return nullptr ;
1040
1041
1041
1042
auto *IInst = dyn_cast<IntrinsicInst>(*CommonUser);
1042
1043
if (!IInst || IInst->getIntrinsicID () !=
1043
- Intrinsic::experimental_vector_partial_reduce_add)
1044
+ Intrinsic::experimental_vector_partial_reduce_add)
1044
1045
return nullptr ;
1045
1046
1046
1047
if (NodePtr CN = identifyDotProduct (IInst))
@@ -1756,7 +1757,7 @@ void ComplexDeinterleavingGraph::identifyReductionNodes() {
1756
1757
bool ComplexDeinterleavingGraph::checkNodes () {
1757
1758
1758
1759
for (NodePtr N : CompositeNodes) {
1759
- if (!N->AreOperandsValid ())
1760
+ if (!N->areOperandsValid ())
1760
1761
return false ;
1761
1762
}
1762
1763
0 commit comments