422   assert((Opcode == Instruction::Mul || Opcode == Instruction::FMul) &&  in IncorporateWeight()
661         if ((Opcode == Instruction::Mul && BinaryOperator::isNeg(BO)) ||  in LinearizeExprTree()
1034   BinaryOperator *Mul =  in ConvertShiftToMul()  local
1037   Mul->takeName(Shl);  in ConvertShiftToMul()
1040   Shl->replaceAllUsesWith(Mul);  in ConvertShiftToMul()
1041   Mul->setDebugLoc(Shl->getDebugLoc());  in ConvertShiftToMul()
1049     Mul->setHasNoSignedWrap(true);  in ConvertShiftToMul()
1050   Mul->setHasNoUnsignedWrap(NUW);  in ConvertShiftToMul()
1051   return Mul;  in ConvertShiftToMul()
1097   BinaryOperator *BO = isReassociableOp(V, Instruction::Mul, Instruction::FMul);  in RemoveFactorFromExpression()
1173   BinaryOperator *BO = isReassociableOp(V, Instruction::Mul, Instruction::FMul);  in FindSingleUseMultiplyFactors()
1506       Instruction *Mul = CreateMul(TheOp, C, "factor", I, I);  in OptimizeAdd()  local
1511       RedoInsts.insert(Mul);  in OptimizeAdd()
1515         return Mul;  in OptimizeAdd()
1520       Ops.insert(Ops.begin(), ValueEntry(getRank(Mul), Mul));  in OptimizeAdd()
1582         isReassociableOp(Ops[i].Op, Instruction::Mul, Instruction::FMul);  in OptimizeAdd()
1653           isReassociableOp(Ops[i].Op, Instruction::Mul, Instruction::FMul);  in OptimizeAdd()
1917   case Instruction::Mul:  in OptimizeExpression()
2039     if (isReassociableOp(I->getOperand(0), Instruction::Mul) ||  in OptimizeInst()
2041          (isReassociableOp(I->user_back(), Instruction::Mul) ||  in OptimizeInst()
2088       if (isReassociableOp(I->getOperand(1), Instruction::Mul) &&  in OptimizeInst()
2090            !isReassociableOp(I->user_back(), Instruction::Mul))) {  in OptimizeInst()
2202     if (I->getOpcode() == Instruction::Mul &&  in ReassociateExpression()