10862                             BB](Instruction *TreeN,  in matchAssociativeReduction()
10866       for (int I = getFirstOperandIndex(TreeN),  in matchAssociativeReduction()
10867                End = getNumberOfOperands(TreeN);  in matchAssociativeReduction()
10869         Value *EdgeVal = getRdxOperand(TreeN, I);  in matchAssociativeReduction()
10870         ReducedValsToOps[EdgeVal].push_back(TreeN);  in matchAssociativeReduction()
10899       Instruction *TreeN = Worklist.pop_back_val();  in matchAssociativeReduction()  local
10903       CheckOperands(TreeN, Args, PossibleRedVals, PossibleReductionOps);  in matchAssociativeReduction()
10907         addReductionOps(TreeN);  in matchAssociativeReduction()
10911           ExtraArgs[TreeN] = Args.front();  in matchAssociativeReduction()
10943             TreeN, &TLI,  in matchAssociativeReduction()
10959               .insert(std::make_pair(TreeN, 0))  in matchAssociativeReduction()