Searched refs:TreeN (Results 1 – 2 of 2) sorted by relevance
4017 Instruction *TreeN = Stack.back().first; in matchAssociativeReduction() local4019 bool IsReducedValue = TreeN->getOpcode() != ReductionOpcode; in matchAssociativeReduction()4022 if (TreeN->getParent() != B->getParent()) in matchAssociativeReduction()4027 if (!TreeN->hasOneUse() && TreeN != B) in matchAssociativeReduction()4036 ReducedValueOpcode = TreeN->getOpcode(); in matchAssociativeReduction()4037 else if (ReducedValueOpcode != TreeN->getOpcode()) in matchAssociativeReduction()4039 ReducedVals.push_back(TreeN); in matchAssociativeReduction()4042 if (!TreeN->isAssociative()) in matchAssociativeReduction()4044 ReductionOps.push_back(TreeN); in matchAssociativeReduction()4052 Value *NextV = TreeN->getOperand(EdgeToVist); in matchAssociativeReduction()
5634 Instruction *TreeN = Stack.back().first; in matchAssociativeReduction() local5636 OperationData OpData = getOperationData(TreeN); in matchAssociativeReduction()5642 ReducedVals.push_back(TreeN); in matchAssociativeReduction()5644 auto I = ExtraArgs.find(TreeN); in matchAssociativeReduction()5655 markExtraArg(Stack[Stack.size() - 2], TreeN); in matchAssociativeReduction()5656 ExtraArgs.erase(TreeN); in matchAssociativeReduction()5658 ReductionData.addReductionOps(TreeN, ReductionOps); in matchAssociativeReduction()5666 Value *NextV = TreeN->getOperand(EdgeToVist); in matchAssociativeReduction()