/external/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyLogical.h | 55 class BinOp : public LExpr { class in namespace:clang::threadSafety::lexpr 59 BinOp(LExpr *LHS, LExpr *RHS, Opcode Code) : LExpr(Code), LHS(LHS), RHS(RHS) {} function in class:clang::threadSafety::lexpr::BinOp 69 class And : public BinOp { 71 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {} 76 class Or : public BinOp { 78 Or(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::Or) {}
|
/external/clang/lib/Analysis/ |
H A D | ThreadSafetyLogical.cpp | 24 const auto LeftAndOperator = [=](const BinOp *A) { 28 const auto RightAndOperator = [=](const BinOp *A) { 34 const auto LeftOrOperator = [=](const BinOp *A) { 38 const auto RightOrOperator = [=](const BinOp *A) {
|
H A D | Consumed.cpp | 491 void VisitBinaryOperator(const BinaryOperator *BinOp); 700 void ConsumedStmtVisitor::VisitBinaryOperator(const BinaryOperator *BinOp) { argument 701 switch (BinOp->getOpcode()) { 704 InfoEntry LEntry = findInfo(BinOp->getLHS()), 705 REntry = findInfo(BinOp->getRHS()); 726 PropagationMap.insert(PairType(BinOp, PropagationInfo(BinOp, 727 static_cast<EffectiveOp>(BinOp->getOpcode() == BO_LOr), LTest, RTest))); 734 forwardInfo(BinOp->getLHS(), BinOp); [all...] |
/external/eigen/Eigen/src/Core/ |
H A D | Transpose.h | 334 template<typename BinOp,typename NestedXpr,typename Rhs> 335 struct blas_traits<SelfCwiseBinaryOp<BinOp,NestedXpr,Rhs> > 338 typedef SelfCwiseBinaryOp<BinOp,NestedXpr,Rhs> XprType; 348 template<bool DestIsTransposed, typename BinOp, typename DerivedA, typename DerivedB> 349 struct check_transpose_aliasing_compile_time_selector<DestIsTransposed,CwiseBinaryOp<BinOp,DerivedA,DerivedB> > 365 template<typename Scalar, bool DestIsTransposed, typename BinOp, typename DerivedA, typename DerivedB> 366 struct check_transpose_aliasing_run_time_selector<Scalar,DestIsTransposed,CwiseBinaryOp<BinOp,DerivedA,DerivedB> > 368 static bool run(const Scalar* dest, const CwiseBinaryOp<BinOp,DerivedA,DerivedB>& src)
|
H A D | SelfCwiseBinaryOp.h | 185 internal::scalar_product_op<Scalar> >::type BinOp; typedef 187 SelfCwiseBinaryOp<BinOp, Derived, typename PlainObject::ConstantReturnType> tmp(derived());
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64AddressTypePromotion.cpp | 158 const BinaryOperator *BinOp = dyn_cast<BinaryOperator>(Inst); local 159 if (BinOp && isa<OverflowingBinaryOperator>(BinOp) && 160 (BinOp->hasNoUnsignedWrap() || BinOp->hasNoSignedWrap())) 454 const BinaryOperator *BinOp = dyn_cast<BinaryOperator>(Inst); local 455 if (BinOp && isa<ConstantInt>(BinOp->getOperand(0)))
|
/external/llvm/lib/Analysis/ |
H A D | CostModel.cpp | 160 static bool matchPairwiseReductionAtLevel(const BinaryOperator *BinOp, argument 168 if (BinOp == nullptr) 171 assert(BinOp->getType()->isVectorTy() && "Expecting a vector type"); 173 unsigned Opcode = BinOp->getOpcode(); 174 Value *L = BinOp->getOperand(0); 175 Value *R = BinOp->getOperand(1); 204 // %BinOp = fadd %NextLevelOpL, %R 344 BinaryOperator *BinOp; local 345 if (!(BinOp = dyn_cast<BinaryOperator>(RdxOp))) 347 if (BinOp [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | EarlyCSE.cpp | 91 if (BinaryOperator* BinOp = dyn_cast<BinaryOperator>(Inst)) { 92 Value *LHS = BinOp->getOperand(0); 93 Value *RHS = BinOp->getOperand(1); 94 if (BinOp->isCommutative() && BinOp->getOperand(0) > BinOp->getOperand(1)) 97 if (isa<OverflowingBinaryOperator>(BinOp)) { 100 BinOp->hasNoSignedWrap() * OverflowingBinaryOperator::NoSignedWrap | 101 BinOp->hasNoUnsignedWrap() * OverflowingBinaryOperator::NoUnsignedWrap; 102 return hash_combine(BinOp [all...] |
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombinePHI.cpp | 122 BinaryOperator *BinOp = cast<BinaryOperator>(FirstInst); local 124 BinaryOperator::Create(BinOp->getOpcode(), LHSVal, RHSVal); 490 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst)) { 491 BinOp = BinaryOperator::Create(BinOp->getOpcode(), PhiVal, ConstantOp); 492 if (isNUW) BinOp->setHasNoUnsignedWrap(); 493 if (isNSW) BinOp->setHasNoSignedWrap(); 494 if (isExact) BinOp->setIsExact(); 495 BinOp->setDebugLoc(FirstInst->getDebugLoc()); 496 return BinOp; [all...] |
/external/llvm/examples/Kaleidoscope/Chapter2/ |
H A D | toy.cpp | 244 int BinOp = CurTok; local 251 // If BinOp binds less tightly with RHS than the operator after RHS, let 260 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
/external/llvm/lib/Target/X86/ |
H A D | X86AtomicExpandPass.cpp | 130 AtomicRMWInst::BinOp Op = AI->getOperation(); 173 static Value *performAtomicOp(AtomicRMWInst::BinOp Op, IRBuilder<> &Builder,
|
/external/clang/lib/CodeGen/ |
H A D | CGExprScalar.cpp | 47 BinaryOperator::Opcode Opcode; // Opcode of BinOp to perform 1531 BinOpInfo BinOp; local 1532 BinOp.LHS = InVal; 1533 BinOp.RHS = NextVal; 1534 BinOp.Ty = E->getType(); 1535 BinOp.Opcode = BO_Add; 1536 BinOp.FPContractable = false; 1537 BinOp.E = E; 1538 return EmitOverflowCheckedBinOp(BinOp); 1578 llvm::AtomicRMWInst::BinOp ao 1627 BinOpInfo BinOp; local 1764 BinOpInfo BinOp; local [all...] |
/external/llvm/lib/ExecutionEngine/RuntimeDyld/ |
H A D | RuntimeDyldChecker.cpp | 533 BinOpToken BinOp; 534 std::tie(BinOp, RemainingExpr) = parseBinOpToken(RemainingExpr); 537 if (BinOp == BinOpToken::Invalid) 550 EvalResult ThisResult(computeBinOpResult(BinOp, LHSResult, RHSResult));
|
/external/clang/include/clang/AST/ |
H A D | StmtVisitor.h | 44 if (PTR(BinaryOperator) BinOp = dyn_cast<BinaryOperator>(S)) { 45 switch (BinOp->getOpcode()) {
|
/external/llvm/examples/Kaleidoscope/Chapter3/ |
H A D | toy.cpp | 265 int BinOp = CurTok; local 272 // If BinOp binds less tightly with RHS than the operator after RHS, let 281 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
/external/llvm/include/llvm/IR/ |
H A D | InstrTypes.h | 319 static const Value *getNegArgument(const Value *BinOp); 320 static Value *getNegArgument( Value *BinOp); 321 static const Value *getFNegArgument(const Value *BinOp); 322 static Value *getFNegArgument( Value *BinOp); 323 static const Value *getNotArgument(const Value *BinOp); 324 static Value *getNotArgument( Value *BinOp);
|
/external/llvm/examples/Kaleidoscope/Chapter4/ |
H A D | toy.cpp | 272 int BinOp = CurTok; local 279 // If BinOp binds less tightly with RHS than the operator after RHS, let 288 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter2/ |
H A D | parser.ml | 70 (* If BinOp binds less tightly with rhs than the operator after
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/ |
H A D | parser.ml | 70 (* If BinOp binds less tightly with rhs than the operator after
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/ |
H A D | parser.ml | 70 (* If BinOp binds less tightly with rhs than the operator after
|
/external/llvm/lib/CodeGen/ |
H A D | CodeGenPrepare.cpp | 1734 const BinaryOperator *BinOp = dyn_cast<BinaryOperator>(Inst); local 1735 if (BinOp && isa<OverflowingBinaryOperator>(BinOp) && 1736 (BinOp->hasNoUnsignedWrap() || BinOp->hasNoSignedWrap())) 3168 BinaryOperator *BinOp = dyn_cast<BinaryOperator>(I); local 3170 if (BinOp && (BinOp->getOpcode() == Instruction::AShr || 3171 BinOp->getOpcode() == Instruction::LShr)) { 3172 ConstantInt *CI = dyn_cast<ConstantInt>(BinOp [all...] |
/external/llvm/lib/IR/ |
H A D | Instructions.cpp | 1279 void AtomicRMWInst::Init(BinOp Operation, Value *Ptr, Value *Val, 1299 AtomicRMWInst::AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val, 1310 AtomicRMWInst::AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val, 1965 Value *BinaryOperator::getNegArgument(Value *BinOp) { argument 1966 return cast<BinaryOperator>(BinOp)->getOperand(1); 1969 const Value *BinaryOperator::getNegArgument(const Value *BinOp) { argument 1970 return getNegArgument(const_cast<Value*>(BinOp)); 1973 Value *BinaryOperator::getFNegArgument(Value *BinOp) { argument 1974 return cast<BinaryOperator>(BinOp)->getOperand(1); 1977 const Value *BinaryOperator::getFNegArgument(const Value *BinOp) { argument 1981 getNotArgument(Value *BinOp) argument 1992 getNotArgument(const Value *BinOp) argument [all...] |
/external/eigen/Eigen/src/Core/products/ |
H A D | GeneralMatrixMatrix.h | 393 typedef internal::scalar_product_op<LhsScalar,RhsScalar> BinOp; typedef 394 EIGEN_CHECK_BINARY_COMPATIBILIY(BinOp,LhsScalar,RhsScalar);
|
/external/llvm/examples/Kaleidoscope/Chapter5/ |
H A D | toy.cpp | 373 int BinOp = CurTok; local 380 // If BinOp binds less tightly with RHS than the operator after RHS, let 389 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
/external/llvm/examples/Kaleidoscope/Chapter6/ |
H A D | toy.cpp | 417 int BinOp = CurTok; local 424 // If BinOp binds less tightly with RHS than the operator after RHS, let 433 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|