@@ -108,15 +108,15 @@ static bool isNeg(Value *V);
108108static Value *getNegOperand (Value *V);
109109
110110namespace {
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+ }
118118
119- class ComplexDeinterleavingLegacyPass : public FunctionPass {
119+ class ComplexDeinterleavingLegacyPass : public FunctionPass {
120120public:
121121 static char ID;
122122
@@ -207,7 +207,7 @@ struct ComplexDeinterleavingCompositeNode {
207207 }
208208 }
209209
210- bool AreOperandsValid () { return OperandsValid; }
210+ bool areOperandsValid () { return OperandsValid; }
211211};
212212
213213class ComplexDeinterleavingGraph {
@@ -1034,13 +1034,14 @@ ComplexDeinterleavingGraph::identifyPartialReduction(Value *R, Value *I) {
10341034 if (!isa<VectorType>(R->getType ()) || !isa<VectorType>(I->getType ()))
10351035 return nullptr ;
10361036
1037- auto CommonUser = findCommonBetweenCollections<Value*>(R->users (), I->users ());
1037+ auto CommonUser =
1038+ findCommonBetweenCollections<Value *>(R->users (), I->users ());
10381039 if (!CommonUser)
10391040 return nullptr ;
10401041
10411042 auto *IInst = dyn_cast<IntrinsicInst>(*CommonUser);
10421043 if (!IInst || IInst->getIntrinsicID () !=
1043- Intrinsic::experimental_vector_partial_reduce_add)
1044+ Intrinsic::experimental_vector_partial_reduce_add)
10441045 return nullptr ;
10451046
10461047 if (NodePtr CN = identifyDotProduct (IInst))
@@ -1756,7 +1757,7 @@ void ComplexDeinterleavingGraph::identifyReductionNodes() {
17561757bool ComplexDeinterleavingGraph::checkNodes () {
17571758
17581759 for (NodePtr N : CompositeNodes) {
1759- if (!N->AreOperandsValid ())
1760+ if (!N->areOperandsValid ())
17601761 return false ;
17611762 }
17621763
0 commit comments