163 static BinaryOperator *isReassociableOp(Value *V, unsigned Opcode) {  in isReassociableOp()
164   auto *BO = dyn_cast<BinaryOperator>(V);  in isReassociableOp()
171 static BinaryOperator *isReassociableOp(Value *V, unsigned Opcode1,  in isReassociableOp()
173   auto *BO = dyn_cast<BinaryOperator>(V);  in isReassociableOp()
237   assert(isa<BinaryOperator>(I) && "Expected binary operator.");  in canonicalizeOperands()
245     cast<BinaryOperator>(I)->swapOperands();  in canonicalizeOperands()
248 static BinaryOperator *CreateAdd(Value *S1, Value *S2, const Twine &Name,  in CreateAdd()
251     return BinaryOperator::CreateAdd(S1, S2, Name, InsertBefore);  in CreateAdd()
253     BinaryOperator *Res =  in CreateAdd()
254         BinaryOperator::CreateFAdd(S1, S2, Name, InsertBefore);  in CreateAdd()
260 static BinaryOperator *CreateMul(Value *S1, Value *S2, const Twine &Name,  in CreateMul()
263     return BinaryOperator::CreateMul(S1, S2, Name, InsertBefore);  in CreateMul()
265     BinaryOperator *Res =  in CreateMul()
266       BinaryOperator::CreateFMul(S1, S2, Name, InsertBefore);  in CreateMul()
275     return BinaryOperator::CreateNeg(S1, Name, InsertBefore);  in CreateNeg()
284 static BinaryOperator *LowerNegateToMultiply(Instruction *Neg) {  in LowerNegateToMultiply()
285   assert((isa<UnaryOperator>(Neg) || isa<BinaryOperator>(Neg)) &&  in LowerNegateToMultiply()
288   unsigned OpNo = isa<BinaryOperator>(Neg) ? 1 : 0;  in LowerNegateToMultiply()
293   BinaryOperator *Res = CreateMul(Neg->getOperand(OpNo), NegOne, "", Neg, Neg);  in LowerNegateToMultiply()
471   assert((isa<UnaryOperator>(I) || isa<BinaryOperator>(I)) &&  in LinearizeExprTree()
530       if (BinaryOperator *BO = isReassociableOp(Op, Opcode)) {  in LinearizeExprTree()
571         if (BinaryOperator *BO = isReassociableOp(Op, Opcode)) {  in LinearizeExprTree()
615           if (BinaryOperator *UserBO = dyn_cast<BinaryOperator>(U))  in LinearizeExprTree()
663 void ReassociatePass::RewriteExprTree(BinaryOperator *I,  in RewriteExprTree()
679   SmallVector<BinaryOperator*, 8> NodesToRewrite;  in RewriteExprTree()
681   BinaryOperator *Op = I;  in RewriteExprTree()
701   BinaryOperator *ExpressionChangedStart = nullptr,  in RewriteExprTree()
731         BinaryOperator *BO = isReassociableOp(OldLHS, Opcode);  in RewriteExprTree()
737         BinaryOperator *BO = isReassociableOp(OldRHS, Opcode);  in RewriteExprTree()
764         BinaryOperator *BO = isReassociableOp(Op->getOperand(1), Opcode);  in RewriteExprTree()
780     BinaryOperator *BO = isReassociableOp(Op->getOperand(0), Opcode);  in RewriteExprTree()
793     BinaryOperator *NewOp;  in RewriteExprTree()
796       NewOp = BinaryOperator::Create(Instruction::BinaryOps(Opcode),  in RewriteExprTree()
852           cast<BinaryOperator>(*ExpressionChangedStart->user_begin());  in RewriteExprTree()
888   if (BinaryOperator *I =  in NegateValue()
1045 static BinaryOperator *convertOrWithNoCommonBitsToAdd(Instruction *Or) {  in convertOrWithNoCommonBitsToAdd()
1047   BinaryOperator *New =  in convertOrWithNoCommonBitsToAdd()
1092 static BinaryOperator *BreakUpSubtract(Instruction *Sub,  in BreakUpSubtract()
1100   BinaryOperator *New = CreateAdd(Sub->getOperand(0), NegVal, "", Sub, Sub);  in BreakUpSubtract()
1115 static BinaryOperator *ConvertShiftToMul(Instruction *Shl) {  in ConvertShiftToMul()
1120   BinaryOperator *Mul =  in ConvertShiftToMul()
1121     BinaryOperator::CreateMul(Shl->getOperand(0), MulCst, "", Shl);  in ConvertShiftToMul()
1133   bool NSW = cast<BinaryOperator>(Shl)->hasNoSignedWrap();  in ConvertShiftToMul()
1134   bool NUW = cast<BinaryOperator>(Shl)->hasNoUnsignedWrap();  in ConvertShiftToMul()
1184   BinaryOperator *BO = isReassociableOp(V, Instruction::Mul, Instruction::FMul);  in RemoveFactorFromExpression()
1260   BinaryOperator *BO = isReassociableOp(V, Instruction::Mul, Instruction::FMul);  in FindSingleUseMultiplyFactors()
1332   Instruction *I = BinaryOperator::CreateAnd(  in createAndInstr()
1673     BinaryOperator *BOp =  in OptimizeAdd()
1738             ? BinaryOperator::CreateAdd(MaxOccVal, MaxOccVal)  in OptimizeAdd()
1739             : BinaryOperator::CreateFAdd(MaxOccVal, MaxOccVal);  in OptimizeAdd()
1744       BinaryOperator *BOp =  in OptimizeAdd()
1943 Value *ReassociatePass::OptimizeMul(BinaryOperator *I,  in OptimizeMul()
1973 Value *ReassociatePass::OptimizeExpression(BinaryOperator *I,  in OptimizeExpression()
2227   if (!isa<UnaryOperator>(I) && !isa<BinaryOperator>(I))  in OptimizeInst()
2299           if (BinaryOperator *Tmp = dyn_cast<BinaryOperator>(U))  in OptimizeInst()
2317       Value *Op = isa<BinaryOperator>(I) ? I->getOperand(1) :  in OptimizeInst()
2326           if (BinaryOperator *Tmp = dyn_cast<BinaryOperator>(U))  in OptimizeInst()
2338   BinaryOperator *BO = cast<BinaryOperator>(I);  in OptimizeInst()
2365 void ReassociatePass::ReassociateExpression(BinaryOperator *I) {  in ReassociateExpression()