Home
last modified time | relevance | path

Searched refs:BO1 (Results 1 – 7 of 7) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineCompares.cpp5146 BinaryOperator *BO1 = dyn_cast<BinaryOperator>(Op1); in foldICmpBinOp() local
5147 if (!BO0 && !BO1) in foldICmpBinOp()
5250 if (BO1) { in foldICmpBinOp()
5251 match(BO1, m_AddLike(m_Value(C), m_Value(D))); in foldICmpBinOp()
5252 NoOp1WrapProblem = hasNoWrapProblem(*BO1, Pred, Op1HasNSW, Op1HasNUW); in foldICmpBinOp()
5358 (BO0->hasOneUse() || BO1->hasOneUse()) && !I.isUnsigned()) { in foldICmpBinOp()
5400 if (BO1 && BO1->getOpcode() == Instruction::Sub) { in foldICmpBinOp()
5401 C = BO1->getOperand(0); in foldICmpBinOp()
5402 D = BO1->getOperand(1); in foldICmpBinOp()
5492 if (NonZero && BO0 && BO1 && Op0HasNSW && Op1HasNSW) in foldICmpBinOp()
[all …]
H A DInstructionCombining.cpp1682 Value *BO1 = BO.getOperand(1); in foldBinopOfSextBoolToSelect() local
1685 if (!match(BO0, m_SExt(m_Value(X))) || !match(BO1, m_ImmConstant(C)) || in foldBinopOfSextBoolToSelect()
1998 auto *BO1 = dyn_cast<BinaryOperator>(BO.getOperand(1)); in foldBinopWithRecurrence() local
1999 if (!BO0 || !BO1 || !BO0->hasNUses(2) || !BO1->hasNUses(2) || in foldBinopWithRecurrence()
2000 BO0->getOpcode() != Opc || BO1->getOpcode() != Opc || in foldBinopWithRecurrence()
2001 !BO0->isAssociative() || !BO1->isAssociative() || in foldBinopWithRecurrence()
2002 BO0->getParent() != BO1->getParent()) in foldBinopWithRecurrence()
2005 assert(BO.isCommutative() && BO0->isCommutative() && BO1->isCommutative() && in foldBinopWithRecurrence()
2012 !matchSimpleRecurrence(BO1, PN1, Start1, Step1) || !PN1->hasOneUse() || in foldBinopWithRecurrence()
2042 BO1->getFastMathFlags() & BO.getFastMathFlags(); in foldBinopWithRecurrence()
[all …]
H A DInstCombineVectorOps.cpp2143 Value *BO0 = BO->getOperand(0), *BO1 = BO->getOperand(1); in getAlternateBinop() local
2149 if (match(BO1, m_ImmConstant(C))) { in getAlternateBinop()
2160 return {Instruction::Add, BO0, BO1}; in getAlternateBinop()
2166 return {Instruction::Mul, BO1, ConstantInt::getAllOnesValue(Ty)}; in getAlternateBinop()
H A DInstCombineMulDivRem.cpp2338 OverflowingBinaryOperator *BO1 = cast<OverflowingBinaryOperator>(Op1); in simplifyIRemMulShl() local
2339 bool BO1HasNSW = Op1PreserveNSW && BO1->hasNoSignedWrap(); in simplifyIRemMulShl()
2340 bool BO1HasNUW = BO1->hasNoUnsignedWrap(); in simplifyIRemMulShl()
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DCFG.cpp1148 BinaryOperatorKind BO1; in checkIncorrectLogicOperator() local
1149 std::tie(DeclExpr1, BO1, NumExpr1) = tryNormalizeBinaryOperator(LHS); in checkIncorrectLogicOperator()
1188 const BinaryOperatorKind *BO1, in checkIncorrectLogicOperator()
1198 analyzeLogicOperatorCondition(*BO1, Value, Values[1] /* L1 */); in checkIncorrectLogicOperator()
1255 return AnalyzeConditions(Values, &BO1, &BO2); in checkIncorrectLogicOperator()
1295 return AnalyzeConditions(Values, &BO1, &BO2); in checkIncorrectLogicOperator()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp2548 if (ConstantInt *BO1 = dyn_cast<ConstantInt>(BO->getOperand(1))) in OptimizeMax() local
2549 if (BO1->isOne() && SE.getSCEV(BO->getOperand(0)) == MaxRHS) in OptimizeMax()
2552 if (ConstantInt *BO1 = dyn_cast<ConstantInt>(BO->getOperand(1))) in OptimizeMax() local
2553 if (BO1->isOne() && SE.getSCEV(BO->getOperand(0)) == MaxRHS) in OptimizeMax()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DValueTracking.cpp3633 BinaryOperator *BO1 = nullptr; in getInvertibleOperands() local
3638 !matchSimpleRecurrence(PN1, BO1, Start1, Step1) || in getInvertibleOperands()
3642 auto Values = getInvertibleOperands(cast<Operator>(BO1), in getInvertibleOperands()