/netbsd/external/apache2/llvm/dist/clang/include/clang/AST/ |
H A D | StmtVisitor.h | 47 if (PTR(BinaryOperator) BinOp = dyn_cast<BinaryOperator>(S)) { in Visit() 49 case BO_PtrMemD: DISPATCH(BinPtrMemD, BinaryOperator); in Visit() 50 case BO_PtrMemI: DISPATCH(BinPtrMemI, BinaryOperator); in Visit() 51 case BO_Mul: DISPATCH(BinMul, BinaryOperator); in Visit() 52 case BO_Div: DISPATCH(BinDiv, BinaryOperator); in Visit() 53 case BO_Rem: DISPATCH(BinRem, BinaryOperator); in Visit() 54 case BO_Add: DISPATCH(BinAdd, BinaryOperator); in Visit() 55 case BO_Sub: DISPATCH(BinSub, BinaryOperator); in Visit() 56 case BO_Shl: DISPATCH(BinShl, BinaryOperator); in Visit() 57 case BO_Shr: DISPATCH(BinShr, BinaryOperator); in Visit() [all …]
|
/netbsd/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
H A D | NoFolder.h | 47 BinaryOperator *BO = BinaryOperator::CreateAdd(LHS, RHS); 54 return BinaryOperator::CreateFAdd(LHS, RHS); in CreateFAdd() 60 BinaryOperator *BO = BinaryOperator::CreateSub(LHS, RHS); 67 return BinaryOperator::CreateFSub(LHS, RHS); in CreateFSub() 73 BinaryOperator *BO = BinaryOperator::CreateMul(LHS, RHS); 80 return BinaryOperator::CreateFMul(LHS, RHS); in CreateFMul() 115 BinaryOperator *BO = BinaryOperator::CreateShl(LHS, RHS); 136 return BinaryOperator::CreateAnd(LHS, RHS); in CreateAnd() 140 return BinaryOperator::CreateOr(LHS, RHS); in CreateOr() 159 BinaryOperator *BO = BinaryOperator::CreateNeg(C); [all …]
|
H A D | Instruction.def | 147 HANDLE_BINARY_INST(13, Add , BinaryOperator) 148 HANDLE_BINARY_INST(14, FAdd , BinaryOperator) 149 HANDLE_BINARY_INST(15, Sub , BinaryOperator) 150 HANDLE_BINARY_INST(16, FSub , BinaryOperator) 151 HANDLE_BINARY_INST(17, Mul , BinaryOperator) 152 HANDLE_BINARY_INST(18, FMul , BinaryOperator) 153 HANDLE_BINARY_INST(19, UDiv , BinaryOperator) 154 HANDLE_BINARY_INST(20, SDiv , BinaryOperator) 155 HANDLE_BINARY_INST(21, FDiv , BinaryOperator) 156 HANDLE_BINARY_INST(22, URem , BinaryOperator) [all …]
|
H A D | InstrTypes.h | 190 class BinaryOperator : public Instruction { 202 BinaryOperator *cloneImpl() const; 255 BinaryOperator *BO = Create(Opc, V1, V2, Name); 288 BinaryOperator *BO = Create(Opc, V1, V2, Name); 300 BinaryOperator *BO = Create(Opc, V1, V2, Name, I); 307 BinaryOperator *BO = Create(Opc, V1, V2, Name); 319 BinaryOperator *BO = Create(Opc, V1, V2, Name, I); 326 BinaryOperator *BO = Create(Opc, V1, V2, Name); 338 BinaryOperator *BO = Create(Opc, V1, V2, Name, I); 416 struct OperandTraits<BinaryOperator> : [all …]
|
/netbsd/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineInternal.h | 88 Instruction *visitAdd(BinaryOperator &I); 89 Instruction *visitFAdd(BinaryOperator &I); 92 Instruction *visitSub(BinaryOperator &I); 93 Instruction *visitFSub(BinaryOperator &I); 94 Instruction *visitMul(BinaryOperator &I); 106 Instruction *visitAnd(BinaryOperator &I); 107 Instruction *visitOr(BinaryOperator &I); 109 Instruction *visitXor(BinaryOperator &I); 110 Instruction *visitShl(BinaryOperator &I); 115 BinaryOperator &I); [all …]
|
H A D | InstCombineMulDivRem.cpp | 70 BinaryOperator *I = dyn_cast<BinaryOperator>(V); in simplifyValueKnownNonZero() 161 BinaryOperator *BO = BinaryOperator::CreateNeg(Op0, I.getName()); in visitMul() 177 BinaryOperator *Mul = cast<BinaryOperator>(I.getOperand(0)); in visitMul() 178 BinaryOperator *BO = BinaryOperator::CreateMul(NewOp, Shl); in visitMul() 190 BinaryOperator *Shl = BinaryOperator::CreateShl(NewOp, NewCst); in visitMul() 209 return BinaryOperator::CreateMul( in visitMul() 270 BinaryOperator *Div = dyn_cast<BinaryOperator>(Op0); in visitMul() 307 BinaryOperator *BO = nullptr; in visitMul() 893 BinaryOperator *LShr = BinaryOperator::CreateLShr(Op0, C1); in foldUDivPow2Cst() 917 BinaryOperator *LShr = BinaryOperator::CreateLShr(Op0, N); in foldUDivShl() [all …]
|
H A D | InstCombineAddSub.cpp | 1151 BinaryOperator &I) { in canonicalizeCondSignextOfHighBitExtractToSignextHighBitExtract() 1348 return BinaryOperator::CreateSub(A, B); in visitAdd() 1408 return BinaryOperator::CreateOr(A, B); in visitAdd() 1724 BinaryOperator *Res = BinaryOperator::CreateAdd(Op0, V); in visitSub() 1797 return BinaryOperator::CreateNot(Op1); in visitSub() 1802 return BinaryOperator::CreateSub(Y, X); in visitSub() 1882 return BinaryOperator::CreateNeg(Y); in visitSub() 1886 return BinaryOperator::CreateNeg(Y); in visitSub() 1943 return BinaryOperator::CreateAnd( in visitSub() 1961 return BinaryOperator::CreateNeg( in visitSub() [all …]
|
H A D | InstCombineShifts.cpp | 60 BinaryOperator *Sh0, const SimplifyQuery &SQ, in reassociateShiftAmtsOfTwoSameDirectionShifts() 143 BinaryOperator *NewShift = BinaryOperator::Create(ShiftOpcode, X, NewShAmt); in reassociateShiftAmtsOfTwoSameDirectionShifts() 349 BinaryOperator *BO; in foldShiftOfShiftedLogic() 408 return BinaryOperator::Create( in commonShiftTransforms() 732 if (BinaryOperator *Op0BO = dyn_cast<BinaryOperator>(Op0)) { in FoldShiftByConstant() 849 BinaryOperator *TBO; in FoldShiftByConstant() 868 BinaryOperator *FBO; in FoldShiftByConstant() 946 auto *NewShr = BinaryOperator::Create( in visitShl() 1007 return BinaryOperator::CreateAnd(Mask, X); in visitShl() 1032 return BinaryOperator::CreateLShr( in visitShl() [all …]
|
H A D | InstCombineAndOrXor.cpp | 84 static Value *SimplifyBSwap(BinaryOperator &I, in SimplifyBSwap() 1499 BinaryOperator *BO1; in reassociateFCmps() 1853 BinaryOperator::BinaryOps BinOp = cast<BinaryOperator>(Op0)->getOpcode(); in visitAnd() 1906 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) { in visitAnd() 2119 BinaryOperator *Or0, *Or1; in matchFunnelShift() 2825 if (BinaryOperator *B = dyn_cast<BinaryOperator>(A)) in visitOr() 3228 auto *Add = cast<BinaryOperator>(Op0); in canonicalizeAbs() 3341 BinaryOperator *NotVal; in visitXor() 3524 return BinaryOperator::CreateXor( in visitXor() 3530 return BinaryOperator::CreateXor( in visitXor() [all …]
|
/netbsd/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
H A D | IntegerDivision.h | 20 class BinaryOperator; variable 32 bool expandRemainder(BinaryOperator *Rem); 41 bool expandDivision(BinaryOperator* Div); 49 bool expandRemainderUpTo32Bits(BinaryOperator *Rem); 55 bool expandRemainderUpTo64Bits(BinaryOperator *Rem); 62 bool expandDivisionUpTo32Bits(BinaryOperator *Div); 68 bool expandDivisionUpTo64Bits(BinaryOperator *Div);
|
/netbsd/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
H A D | SimpleSValBuilder.cpp | 155 if (BinaryOperator::isComparisonOp(op)) { in MakeSymIntVal() 256 if (BinaryOperator::isComparisonOp(Op)) in doRearrangeUnchecked() 258 else if (BinaryOperator::isAdditiveOp(Op)) in doRearrangeUnchecked() 270 BinaryOperator::Opcode ResultOp; in doRearrangeUnchecked() 272 if (BinaryOperator::isComparisonOp(Op)) { in doRearrangeUnchecked() 309 (!BinaryOperator::isComparisonOp(Op) || in shouldRearrange() 336 if (BinaryOperator::isComparisonOp(Op)) { in tryRearrange() 341 } else if (BinaryOperator::isAdditiveOp(Op)) { in tryRearrange() 656 if (!BinaryOperator::isComparisonOp(op)) in evalBinOpFieldRegionFieldRegion() 811 if (BinaryOperator::isComparisonOp(op)) in evalBinOpLL() [all …]
|
H A D | RangedConstraintManager.cpp | 34 BinaryOperator::Opcode op = SIE->getOpcode(); in assumeSym() 35 if (BinaryOperator::isComparisonOp(op) && op != BO_Cmp) { in assumeSym() 37 op = BinaryOperator::negateComparisonOp(op); in assumeSym() 43 BinaryOperator::Opcode Op = SSE->getOpcode(); in assumeSym() 44 assert(BinaryOperator::isComparisonOp(Op)); in assumeSym() 62 Op = BinaryOperator::reverseComparisonOp(Op); in assumeSym() 64 Op = BinaryOperator::negateComparisonOp(Op); in assumeSym() 68 if (BinaryOperator::isEqualityOp(Op)) { in assumeSym() 143 assert(BinaryOperator::isComparisonOp(Op) && in assumeSymRel() 153 if (BinaryOperator::isComparisonOp(SE->getOpcode())) in assumeSymRel() [all …]
|
/netbsd/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
H A D | IdenticalExprChecker.cpp | 48 bool VisitBinaryOperator(const BinaryOperator *B); 53 void reportIdenticalExpr(const BinaryOperator *B, bool CheckBitwise, 56 void checkComparisonOp(const BinaryOperator *B); 88 while (const BinaryOperator *B2 = dyn_cast<BinaryOperator>(LHS)) { in checkBitwiseOrLogicalOp() 182 BinaryOperator::Opcode Op = B->getOpcode(); in VisitBinaryOperator() 184 if (BinaryOperator::isBitwiseOp(Op)) in VisitBinaryOperator() 187 if (BinaryOperator::isLogicalOp(Op)) in VisitBinaryOperator() 190 if (BinaryOperator::isComparisonOp(Op)) in VisitBinaryOperator() 200 BinaryOperator::Opcode Op = B->getOpcode(); in checkComparisonOp() 452 const BinaryOperator *BinOp1 = cast<BinaryOperator>(Stmt1); in isIdenticalStmt() [all …]
|
H A D | UndefResultChecker.cpp | 29 : public Checker< check::PostStmt<BinaryOperator> > { 34 void checkPostStmt(const BinaryOperator *B, CheckerContext &C) const; 61 static bool isShiftOverflow(const BinaryOperator *B, CheckerContext &C) { in isShiftOverflow() 66 static bool isLeftShiftResultUnrepresentable(const BinaryOperator *B, in isLeftShiftResultUnrepresentable() 76 void UndefResultChecker::checkPostStmt(const BinaryOperator *B, in checkPostStmt() 113 << BinaryOperator::getOpcodeStr(B->getOpcode()) in checkPostStmt() 170 << BinaryOperator::getOpcodeStr(B->getOpcode()) in checkPostStmt()
|
H A D | MallocOverflowSecurityChecker.cpp | 35 const BinaryOperator *mulop; 39 MallocOverflowCheck(const BinaryOperator *m, const Expr *v, APSInt val) in MallocOverflowCheck() 75 const BinaryOperator * mulop = nullptr; in CheckMallocArgument() 81 if (const BinaryOperator *binop = dyn_cast<BinaryOperator>(e)) { in CheckMallocArgument() 175 void CheckAssignmentExpr(BinaryOperator *AssignEx) { in CheckAssignmentExpr() 190 if (const BinaryOperator *BOp = dyn_cast<BinaryOperator>(rhse)) { in CheckAssignmentExpr() 227 void VisitBinaryOperator(BinaryOperator *E) { in VisitBinaryOperator()
|
H A D | TestAfterDivZeroChecker.cpp | 78 : public Checker<check::PreStmt<BinaryOperator>, check::BranchCondition, 84 void checkPreStmt(const BinaryOperator *B, CheckerContext &C) const; 104 if (const BinaryOperator *BO = P->getStmtAs<BinaryOperator>()) { in REGISTER_SET_WITH_PROGRAMSTATE() 105 BinaryOperator::Opcode Op = BO->getOpcode(); in REGISTER_SET_WITH_PROGRAMSTATE() 200 void TestAfterDivZeroChecker::checkPreStmt(const BinaryOperator *B, in checkPreStmt() 202 BinaryOperator::Opcode Op = B->getOpcode(); in checkPreStmt() 214 if (const BinaryOperator *B = dyn_cast<BinaryOperator>(Condition)) { in checkBranchCondition()
|
H A D | DivZeroChecker.cpp | 26 class DivZeroChecker : public Checker< check::PreStmt<BinaryOperator> > { 32 void checkPreStmt(const BinaryOperator *B, CheckerContext &C) const; 38 if (const auto *BE = dyn_cast<BinaryOperator>(S)) in getDenomExpr() 57 void DivZeroChecker::checkPreStmt(const BinaryOperator *B, in checkPreStmt() 59 BinaryOperator::Opcode Op = B->getOpcode(); in checkPreStmt()
|
/netbsd/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
H A D | Reassociate.cpp | 239 BinaryOperator *Res = in CreateAdd() 251 BinaryOperator *Res = in CreateMul() 653 BinaryOperator *Op = I; in RewriteExprTree() 759 BinaryOperator *NewOp; in RewriteExprTree() 832 if (BinaryOperator *I = in NegateValue() 1004 BinaryOperator *New = in convertOrWithNoCommonBitsToAdd() 1077 BinaryOperator *Mul = in ConvertShiftToMul() 1631 BinaryOperator *BOp = in OptimizeAdd() 2244 if (BinaryOperator *Tmp = dyn_cast<BinaryOperator>(U)) in OptimizeInst() 2271 if (BinaryOperator *Tmp = dyn_cast<BinaryOperator>(U)) in OptimizeInst() [all …]
|
H A D | CorrelatedValuePropagation.cpp | 501 if (auto *BO = dyn_cast<BinaryOperator>(NegX)) in processAbsIntrinsic() 542 if (auto *BO = dyn_cast<BinaryOperator>(NewOp)) in processOverflowIntrinsic() 552 BinaryOperator *BinOp = BinaryOperator::Create( in processSaturatingInst() 562 if (auto *BO = dyn_cast<BinaryOperator>(BinOp)) in processSaturatingInst() 715 if (auto *BinOp = dyn_cast<BinaryOperator>(BO)) in narrowSDivOrSRem() 759 if (auto *BinOp = dyn_cast<BinaryOperator>(BO)) in processUDivOrURem() 768 static bool processSRem(BinaryOperator *SDI, LazyValueInfo *LVI) { in processSRem() 824 static bool processSDiv(BinaryOperator *SDI, LazyValueInfo *LVI) { in processSDiv() 1056 BBChanged |= processAShr(cast<BinaryOperator>(II), LVI); in runImpl() 1065 BBChanged |= processBinOp(cast<BinaryOperator>(II), LVI); in runImpl() [all …]
|
/netbsd/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Scalar/ |
H A D | NaryReassociate.h | 89 class BinaryOperator; variable 139 Instruction *tryReassociateBinaryOp(BinaryOperator *I); 144 BinaryOperator *I); 147 BinaryOperator *I); 150 bool matchTernaryOp(BinaryOperator *I, Value *V, Value *&Op1, Value *&Op2); 153 const SCEV *getBinarySCEV(BinaryOperator *I, const SCEV *LHS,
|
H A D | Reassociate.h | 36 class BinaryOperator; variable 103 void ReassociateExpression(BinaryOperator *I); 104 void RewriteExprTree(BinaryOperator *I, 106 Value *OptimizeExpression(BinaryOperator *I, 119 Value *OptimizeMul(BinaryOperator *I,
|
/netbsd/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
H A D | IntegerDivision.cpp | 375 bool llvm::expandRemainder(BinaryOperator *Rem) { in expandRemainder() 404 BinaryOperator *BO = dyn_cast<BinaryOperator>(Builder.GetInsertPoint()); in expandRemainder() 417 if (BinaryOperator *UDiv = dyn_cast<BinaryOperator>(Builder.GetInsertPoint())) { in expandRemainder() 433 bool llvm::expandDivision(BinaryOperator *Div) { in expandDivision() 463 BinaryOperator *BO = dyn_cast<BinaryOperator>(Builder.GetInsertPoint()); in expandDivision() 526 return expandRemainder(cast<BinaryOperator>(ExtRem)); in expandRemainderUpTo32Bits() 574 return expandRemainder(cast<BinaryOperator>(ExtRem)); in expandRemainderUpTo64Bits() 583 bool llvm::expandDivisionUpTo32Bits(BinaryOperator *Div) { in expandDivisionUpTo32Bits() 623 return expandDivision(cast<BinaryOperator>(ExtDiv)); in expandDivisionUpTo32Bits() 631 bool llvm::expandDivisionUpTo64Bits(BinaryOperator *Div) { in expandDivisionUpTo64Bits() [all …]
|
/netbsd/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUCodeGenPrepare.cpp | 94 bool isSigned(const BinaryOperator &I) const; 158 bool replaceMulWithMul24(BinaryOperator &I) const; 162 bool foldBinOpIntoSelect(BinaryOperator &I) const; 164 bool divHasSpecialOptimization(BinaryOperator &I, 166 int getDivNumBits(BinaryOperator &I, 185 void expandDivRem64(BinaryOperator &I) const; 202 bool visitFDiv(BinaryOperator &I); 205 bool visitBinaryOperator(BinaryOperator &I); 990 if (BinaryOperator *BinOpDen = dyn_cast<BinaryOperator>(Den)) { in divHasSpecialOptimization() 1202 SmallVector<BinaryOperator *, 8> Div64ToExpand; in visitBinaryOperator() [all …]
|
/netbsd/external/apache2/llvm/dist/llvm/lib/Analysis/ |
H A D | PHITransAddr.cpp | 257 bool isNSW = cast<BinaryOperator>(Inst)->hasNoSignedWrap(); in PHITranslateSubExpr() 258 bool isNUW = cast<BinaryOperator>(Inst)->hasNoUnsignedWrap(); in PHITranslateSubExpr() 264 if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(LHS)) in PHITranslateSubExpr() 292 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(U)) in PHITranslateSubExpr() 428 BinaryOperator *Res = BinaryOperator::CreateAdd(OpVal, Inst->getOperand(1), in InsertPHITranslatedSubExpr() 431 Res->setHasNoSignedWrap(cast<BinaryOperator>(Inst)->hasNoSignedWrap()); in InsertPHITranslatedSubExpr() 432 Res->setHasNoUnsignedWrap(cast<BinaryOperator>(Inst)->hasNoUnsignedWrap()); in InsertPHITranslatedSubExpr()
|
H A D | Lint.cpp | 105 void visitXor(BinaryOperator &I); 106 void visitSub(BinaryOperator &I); 107 void visitLShr(BinaryOperator &I); 108 void visitAShr(BinaryOperator &I); 109 void visitShl(BinaryOperator &I); 110 void visitSDiv(BinaryOperator &I); 111 void visitUDiv(BinaryOperator &I); 112 void visitSRem(BinaryOperator &I); 113 void visitURem(BinaryOperator &I); 488 void Lint::visitXor(BinaryOperator &I) { in visitXor() [all …]
|