623       if (BinaryOperator *BO = isReassociableOp(Op, Opcode)) {  in LinearizeExprTree()  local
626         Worklist.push_back(std::make_pair(BO, Weight));  in LinearizeExprTree()
662         if (BinaryOperator *BO = isReassociableOp(Op, Opcode)) {  in LinearizeExprTree()
664           Worklist.push_back(std::make_pair(BO, It->second));  in LinearizeExprTree()
693       if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Op))  in LinearizeExprTree()  local
694         if ((Opcode == Instruction::Mul && BinaryOperator::isNeg(BO)) ||  in LinearizeExprTree()
695             (Opcode == Instruction::FMul && BinaryOperator::isFNeg(BO))) {  in LinearizeExprTree()
697           BO = LowerNegateToMultiply(BO);  in LinearizeExprTree()
698           DEBUG(dbgs() << *BO << '\n');  in LinearizeExprTree()
699           Worklist.push_back(std::make_pair(BO, Weight));  in LinearizeExprTree()
810         BinaryOperator *BO = isReassociableOp(OldLHS, Opcode);  in RewriteExprTree()  local
811         if (BO && !NotRewritable.count(BO))  in RewriteExprTree()
812           NodesToRewrite.push_back(BO);  in RewriteExprTree()
816         BinaryOperator *BO = isReassociableOp(OldRHS, Opcode);  in RewriteExprTree()  local
817         if (BO && !NotRewritable.count(BO))  in RewriteExprTree()
818           NodesToRewrite.push_back(BO);  in RewriteExprTree()
841         BinaryOperator *BO = isReassociableOp(Op->getOperand(1), Opcode);  in RewriteExprTree()  local
842         if (BO && !NotRewritable.count(BO))  in RewriteExprTree()
843           NodesToRewrite.push_back(BO);  in RewriteExprTree()
855     BinaryOperator *BO = isReassociableOp(Op->getOperand(0), Opcode);  in RewriteExprTree()  local
856     if (BO && !NotRewritable.count(BO)) {  in RewriteExprTree()
857       Op = BO;  in RewriteExprTree()
1113   BinaryOperator *BO = isReassociableOp(V, Instruction::Mul, Instruction::FMul);  in RemoveFactorFromExpression()  local
1114   if (!BO)  in RemoveFactorFromExpression()
1118   MadeChange |= LinearizeExprTree(BO, Tree);  in RemoveFactorFromExpression()
1160     RewriteExprTree(BO, Factors);  in RemoveFactorFromExpression()
1164   BasicBlock::iterator InsertPt = BO; ++InsertPt;  in RemoveFactorFromExpression()
1169     RedoInsts.insert(BO);  in RemoveFactorFromExpression()
1172     RewriteExprTree(BO, Factors);  in RemoveFactorFromExpression()
1173     V = BO;  in RemoveFactorFromExpression()
1177     V = CreateNeg(V, "neg", InsertPt, BO);  in RemoveFactorFromExpression()
1189   BinaryOperator *BO = isReassociableOp(V, Instruction::Mul, Instruction::FMul);  in FindSingleUseMultiplyFactors()  local
1190   if (!BO) {  in FindSingleUseMultiplyFactors()
1196   FindSingleUseMultiplyFactors(BO->getOperand(1), Factors, Ops);  in FindSingleUseMultiplyFactors()
1197   FindSingleUseMultiplyFactors(BO->getOperand(0), Factors, Ops);  in FindSingleUseMultiplyFactors()
2151   BinaryOperator *BO = cast<BinaryOperator>(I);  in OptimizeInst()  local
2155   unsigned Opcode = BO->getOpcode();  in OptimizeInst()
2156   if (BO->hasOneUse() && BO->user_back()->getOpcode() == Opcode)  in OptimizeInst()
2161   if (BO->hasOneUse() && BO->getOpcode() == Instruction::Add &&  in OptimizeInst()
2162       cast<Instruction>(BO->user_back())->getOpcode() == Instruction::Sub)  in OptimizeInst()
2164   if (BO->hasOneUse() && BO->getOpcode() == Instruction::FAdd &&  in OptimizeInst()
2165       cast<Instruction>(BO->user_back())->getOpcode() == Instruction::FSub)  in OptimizeInst()
2168   ReassociateExpression(BO);  in OptimizeInst()