56   class Reduction;
86   class Reduction {  class
94     Reduction() = delete;
96     Reduction (Instruction *Add) : Root(Add) { }  in Reduction()  function in __anon176cfc890111::Reduction
98     /// Record an Add instruction that is a part of the this reduction.
102     /// of this reduction.
134     /// reduction already has a value to initialise the accumulator.
156     /// Return the add instruction which is the root of the reduction.
166     /// Return the set of adds that comprise the reduction.
170     /// the reduction.
183       LLVM_DEBUG(dbgs() << "Reduction:\n";  in dump()
222     bool Search(Value *V, BasicBlock *BB, Reduction &R);
224     void InsertParallelMACs(Reduction &Reduction);
227     bool CreateParallelPairs(Reduction &R);
426 // instructions that form the reduction and allows us to find a single value
428 bool ARMParallelDSP::Search(Value *V, BasicBlock *BB, Reduction &R) {  in Search()
525       Reduction R(&I);  in MatchSMLAD()
530       LLVM_DEBUG(dbgs() << "After search, Reduction:\n"; R.dump());  in MatchSMLAD()
545 bool ARMParallelDSP::CreateParallelPairs(Reduction &R) {  in CreateParallelPairs()
557   auto CanPair = [&](Reduction &R, MulCandidate *PMul0, MulCandidate *PMul1) {  in CreateParallelPairs()
623 void ARMParallelDSP::InsertParallelMACs(Reduction &R) {  in InsertParallelMACs()
628     // Replace the reduction chain with an intrinsic call  in InsertParallelMACs()
688     // If Acc is the original incoming value to the reduction, it could be a  in InsertParallelMACs()