/external/llvm/include/llvm/Support/ |
NoFolder.h | 42 BinaryOperator *BO = BinaryOperator::CreateAdd(LHS, RHS); 48 return BinaryOperator::CreateNSWAdd(LHS, RHS); 51 return BinaryOperator::CreateNUWAdd(LHS, RHS); 54 return BinaryOperator::CreateFAdd(LHS, RHS); 58 BinaryOperator *BO = BinaryOperator::CreateSub(LHS, RHS); 64 return BinaryOperator::CreateNSWSub(LHS, RHS); 67 return BinaryOperator::CreateNUWSub(LHS, RHS); 70 return BinaryOperator::CreateFSub(LHS, RHS) [all...] |
/external/clang/include/clang/AST/ |
StmtVisitor.h | 43 if (PTR(BinaryOperator) BinOp = dyn_cast<BinaryOperator>(S)) { 45 case BO_PtrMemD: DISPATCH(BinPtrMemD, BinaryOperator); 46 case BO_PtrMemI: DISPATCH(BinPtrMemI, BinaryOperator); 47 case BO_Mul: DISPATCH(BinMul, BinaryOperator); 48 case BO_Div: DISPATCH(BinDiv, BinaryOperator); 49 case BO_Rem: DISPATCH(BinRem, BinaryOperator); 50 case BO_Add: DISPATCH(BinAdd, BinaryOperator); 51 case BO_Sub: DISPATCH(BinSub, BinaryOperator); 52 case BO_Shl: DISPATCH(BinShl, BinaryOperator); [all...] |
/external/clang/lib/StaticAnalyzer/Checkers/ |
UndefResultChecker.cpp | 28 : public Checker< check::PostStmt<BinaryOperator> > { 33 void checkPostStmt(const BinaryOperator *B, CheckerContext &C) const; 37 void UndefResultChecker::checkPostStmt(const BinaryOperator *B, 67 << BinaryOperator::getOpcodeStr(B->getOpcode()) 73 << BinaryOperator::getOpcodeStr(B->getOpcode())
|
FixedAddressChecker.cpp | 27 : public Checker< check::PreStmt<BinaryOperator> > { 31 void checkPreStmt(const BinaryOperator *B, CheckerContext &C) const; 35 void FixedAddressChecker::checkPreStmt(const BinaryOperator *B,
|
DivZeroChecker.cpp | 25 class DivZeroChecker : public Checker< check::PreStmt<BinaryOperator> > { 31 void checkPreStmt(const BinaryOperator *B, CheckerContext &C) const; 48 void DivZeroChecker::checkPreStmt(const BinaryOperator *B, 50 BinaryOperator::Opcode Op = B->getOpcode();
|
PointerArithChecker.cpp | 26 : public Checker< check::PreStmt<BinaryOperator> > { 30 void checkPreStmt(const BinaryOperator *B, CheckerContext &C) const; 34 void PointerArithChecker::checkPreStmt(const BinaryOperator *B,
|
PointerSubChecker.cpp | 27 : public Checker< check::PreStmt<BinaryOperator> > { 31 void checkPreStmt(const BinaryOperator *B, CheckerContext &C) const; 35 void PointerSubChecker::checkPreStmt(const BinaryOperator *B,
|
UndefinedAssignmentChecker.cpp | 55 if (const BinaryOperator *B = dyn_cast<BinaryOperator>(StoreE)) {
|
MallocOverflowSecurityChecker.cpp | 33 const BinaryOperator *mulop; 36 MallocOverflowCheck (const BinaryOperator *m, const Expr *v) 68 const BinaryOperator * mulop = NULL; 72 if (isa<BinaryOperator>(e)) { 73 const BinaryOperator * binop = dyn_cast<BinaryOperator>(e); 159 void VisitBinaryOperator(BinaryOperator *E) {
|
/external/llvm/lib/Transforms/InstCombine/ |
InstCombine.h | 43 if (BinaryOperator::isNeg(V) || 44 BinaryOperator::isFNeg(V) || 45 BinaryOperator::isNot(V)) 109 Instruction *visitAdd(BinaryOperator &I); 110 Instruction *visitFAdd(BinaryOperator &I); 112 Instruction *visitSub(BinaryOperator &I); 113 Instruction *visitFSub(BinaryOperator &I); 114 Instruction *visitMul(BinaryOperator &I); 115 Instruction *visitFMul(BinaryOperator &I); 116 Instruction *visitURem(BinaryOperator &I) [all...] |
InstCombineMulDivRem.cpp | 47 if (BinaryOperator *I = dyn_cast<BinaryOperator>(V)) 99 Instruction *InstCombiner::visitMul(BinaryOperator &I) { 110 return BinaryOperator::CreateNeg(Op0, I.getName()); 115 if (BinaryOperator *SI = dyn_cast<BinaryOperator>(Op0)) 118 return BinaryOperator::CreateMul(SI->getOperand(0), 124 BinaryOperator *Shl = BinaryOperator::CreateShl(Op0, NewCst); 135 return BinaryOperator::CreateAdd(Add, Builder->CreateMul(C1, CI)) [all...] |
InstCombineAddSub.cpp | 86 Instruction *InstCombiner::visitAdd(BinaryOperator &I) { 102 return BinaryOperator::CreateXor(LHS, RHS); 137 return BinaryOperator::CreateAShr(NewShl, ShAmt); 148 return BinaryOperator::CreateSub(ConstantExpr::getAdd(XorRHS, CI), 159 return BinaryOperator::CreateXor(LHS, RHS); 163 BinaryOperator *New = 164 BinaryOperator::CreateShl(LHS, ConstantInt::get(I.getType(), 1)); 176 return BinaryOperator::CreateNeg(NewAdd); 179 return BinaryOperator::CreateSub(RHS, LHSV); 185 return BinaryOperator::CreateSub(LHS, V) [all...] |
InstCombineShifts.cpp | 22 Instruction *InstCombiner::commonShiftTransforms(BinaryOperator &I) { 212 BinaryOperator *BO = cast<BinaryOperator>(I); 254 BinaryOperator *BO = cast<BinaryOperator>(I); 313 BinaryOperator &I) { 345 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Op0)) 348 return BinaryOperator::CreateMul(BO->getOperand(0), 404 if (BinaryOperator *Op0BO = dyn_cast<BinaryOperator>(Op0)) [all...] |
InstCombineAndOrXor.cpp | 37 if (BinaryOperator::isNot(V)) 54 if (BinaryOperator::isNot(V)) { 55 Value *Operand = BinaryOperator::getNotArgument(V); 134 BinaryOperator &TheAnd) { 146 return BinaryOperator::CreateXor(And, Together); 155 return BinaryOperator::CreateAnd(Or, AndRHS); 166 return BinaryOperator::CreateOr(And, OpRHS); 198 return BinaryOperator::CreateXor(NewAnd, AndRHS); 261 return BinaryOperator::CreateAnd(ShVal, AndRHS, TheAnd.getName()); [all...] |
InstCombineSelect.cpp | 150 if (!isa<BinaryOperator>(TI)) 186 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TI)) { 188 return BinaryOperator::Create(BO->getOpcode(), MatchOp, NewSI); 190 return BinaryOperator::Create(BO->getOpcode(), NewSI, MatchOp); 233 BinaryOperator *TVI_BO = cast<BinaryOperator>(TVI); 234 BinaryOperator *BO = BinaryOperator::Create(TVI_BO->getOpcode(), 268 BinaryOperator *FVI_BO = cast<BinaryOperator>(FVI) [all...] |
/external/llvm/include/llvm/ |
InstrTypes.h | 137 // BinaryOperator Class 140 class BinaryOperator : public Instruction { 144 BinaryOperator(BinaryOps iType, Value *S1, Value *S2, Type *Ty, 146 BinaryOperator(BinaryOps iType, Value *S1, Value *S2, Type *Ty, 148 virtual BinaryOperator *clone_impl() const; 163 static BinaryOperator *Create(BinaryOps Op, Value *S1, Value *S2, 171 static BinaryOperator *Create(BinaryOps Op, Value *S1, Value *S2, 178 static BinaryOperator *Create##OPC(Value *V1, Value *V2, \ 184 static BinaryOperator *Create##OPC(Value *V1, Value *V2, \ 190 static BinaryOperator *Create##OPC(Value *V1, Value *V2, [all...] |
/external/llvm/unittests/Transforms/Utils/ |
Cloning.cpp | 56 BinaryOperator *Add = BinaryOperator::Create(Instruction::Add, V, V); 57 BinaryOperator *Sub = BinaryOperator::Create(Instruction::Sub, V, V); 58 BinaryOperator *Mul = BinaryOperator::Create(Instruction::Mul, V, V); 60 BinaryOperator *AddClone = this->clone(Add); 61 BinaryOperator *SubClone = this->clone(Sub); 62 BinaryOperator *MulClone = this->clone(Mul); 139 BinaryOperator *SDiv = BinaryOperator::Create(Instruction::SDiv, V, V) [all...] |
/external/clang/include/clang/Analysis/Visitors/ |
CFGStmtVisitor.h | 88 BinaryOperator* B = cast<BinaryOperator>(S); 129 RetTy BlockStmt_VisitLogicalOp(BinaryOperator* B) { 134 RetTy BlockStmt_VisitComma(BinaryOperator* B) { 158 BinaryOperator* B = cast<BinaryOperator>(S);
|
/external/llvm/lib/Transforms/Scalar/ |
Reassociate.cpp | 135 void ReassociateExpression(BinaryOperator *I); 136 void RewriteExprTree(BinaryOperator *I, SmallVectorImpl<ValueEntry> &Ops); 137 Value *OptimizeExpression(BinaryOperator *I, 144 Value *OptimizeMul(BinaryOperator *I, SmallVectorImpl<ValueEntry> &Ops); 160 static BinaryOperator *isReassociableOp(Value *V, unsigned Opcode) { 163 return cast<BinaryOperator>(V); 229 (!BinaryOperator::isNot(I) && !BinaryOperator::isNeg(I))) 240 static BinaryOperator *LowerNegateToMultiply(Instruction *Neg) { 243 BinaryOperator *Res [all...] |
/external/clang/lib/StaticAnalyzer/Core/ |
SimpleConstraintManager.cpp | 121 static BinaryOperator::Opcode NegateComparison(BinaryOperator::Opcode op) { 122 // FIXME: This should probably be part of BinaryOperator, since this isn't 188 BinaryOperator::Opcode op = SE->getOpcode(); 190 if (!BinaryOperator::isComparisonOp(op)) { 219 BinaryOperator::Opcode Op = SE->getOpcode(); 235 BinaryOperator::Opcode op, 237 assert(BinaryOperator::isComparisonOp(op) &&
|
/external/llvm/examples/Fibonacci/ |
fibonacci.cpp | 71 Value *Sub = BinaryOperator::CreateSub(ArgX, One, "arg", RecurseBB); 76 Sub = BinaryOperator::CreateSub(ArgX, Two, "arg", RecurseBB); 82 Value *Sum = BinaryOperator::CreateAdd(CallFibX1, CallFibX2,
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
SymbolManager.h | 350 BinaryOperator::Opcode Op; 355 SymIntExpr(const SymExpr *lhs, BinaryOperator::Opcode op, 363 BinaryOperator::Opcode getOpcode() const { return Op; } 371 BinaryOperator::Opcode op, const llvm::APSInt& rhs, 393 BinaryOperator::Opcode Op; 398 IntSymExpr(const llvm::APSInt& lhs, BinaryOperator::Opcode op, 404 BinaryOperator::Opcode getOpcode() const { return Op; } 412 BinaryOperator::Opcode op, const SymExpr *rhs, 434 BinaryOperator::Opcode Op; 439 SymSymExpr(const SymExpr *lhs, BinaryOperator::Opcode op, const SymExpr *rhs [all...] |
SValBuilder.h | 93 virtual SVal evalBinOpNN(ProgramStateRef state, BinaryOperator::Opcode op, 98 virtual SVal evalBinOpLL(ProgramStateRef state, BinaryOperator::Opcode op, 104 virtual SVal evalBinOpLN(ProgramStateRef state, BinaryOperator::Opcode op, 112 SVal makeSymExprValNN(ProgramStateRef state, BinaryOperator::Opcode op, 115 SVal evalBinOp(ProgramStateRef state, BinaryOperator::Opcode op, 269 NonLoc makeNonLoc(const SymExpr *lhs, BinaryOperator::Opcode op, 272 NonLoc makeNonLoc(const llvm::APSInt& rhs, BinaryOperator::Opcode op, 275 NonLoc makeNonLoc(const SymExpr *lhs, BinaryOperator::Opcode op,
|
/external/llvm/examples/ModuleMaker/ |
ModuleMaker.cpp | 49 Instruction *Add = BinaryOperator::Create(Instruction::Add, Two, Three,
|
/external/clang/lib/ARCMigrate/ |
TransZeroOutPropsInDealloc.cpp | 91 bool VisitBinaryOperator(BinaryOperator *BOE) { 156 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(E)) 163 bool isZeroingPropIvar(BinaryOperator *BOE) { 196 BinaryOperator *BO = dyn_cast<BinaryOperator>(PO->getSyntacticForm());
|