HomeSort by relevance Sort by last modified time
    Searched defs:BinOp (Results 1 - 25 of 40) sorted by null

1 2

  /external/clang/include/clang/Analysis/Analyses/
ThreadSafetyLogical.h 55 class BinOp : public LExpr {
59 BinOp(LExpr *LHS, LExpr *RHS, Opcode Code) : LExpr(Code), LHS(LHS), RHS(RHS) {}
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/eigen/Eigen/src/Core/
SelfCwiseBinaryOp.h 185 internal::scalar_product_op<Scalar> >::type BinOp;
187 SelfCwiseBinaryOp<BinOp, Derived, typename PlainObject::ConstantReturnType> tmp(derived());
  /external/llvm/examples/Kaleidoscope/Chapter2/
toy.cpp 183 // Make sure it's a declared binop.
279 // If this is a binop, find its precedence.
283 // If this is a binop that binds at least as tightly as the current binop,
288 // Okay, we know this is a binop.
289 int BinOp = CurTok;
290 getNextToken(); // eat binop
297 // If BinOp binds less tightly with RHS than the operator after RHS, let
307 LHS = helper::make_unique<BinaryExprAST>(BinOp, std::move(LHS),
  /external/llvm/lib/Analysis/
CostModel.cpp 158 static bool matchPairwiseReductionAtLevel(const BinaryOperator *BinOp,
166 if (BinOp == nullptr)
169 assert(BinOp->getType()->isVectorTy() && "Expecting a vector type");
171 unsigned Opcode = BinOp->getOpcode();
172 Value *L = BinOp->getOperand(0);
173 Value *R = BinOp->getOperand(1);
202 // %BinOp = fadd %NextLevelOpL, %R
342 BinaryOperator *BinOp;
343 if (!(BinOp = dyn_cast<BinaryOperator>(RdxOp)))
345 if (BinOp->getOpcode() != RdxOpcode
    [all...]
  /external/llvm/lib/Target/AArch64/
AArch64AddressTypePromotion.cpp 161 const BinaryOperator *BinOp = dyn_cast<BinaryOperator>(Inst);
162 if (BinOp && isa<OverflowingBinaryOperator>(BinOp) &&
163 (BinOp->hasNoUnsignedWrap() || BinOp->hasNoSignedWrap()))
457 const BinaryOperator *BinOp = dyn_cast<BinaryOperator>(Inst);
458 if (BinOp && isa<ConstantInt>(BinOp->getOperand(0)))
  /external/eigen/Eigen/src/Core/products/
GeneralMatrixMatrix.h 393 typedef internal::scalar_product_op<LhsScalar,RhsScalar> BinOp;
394 EIGEN_CHECK_BINARY_COMPATIBILIY(BinOp,LhsScalar,RhsScalar);
  /external/llvm/examples/Kaleidoscope/Chapter3/
toy.cpp 185 // Make sure it's a declared binop.
282 // If this is a binop, find its precedence.
286 // If this is a binop that binds at least as tightly as the current binop,
291 // Okay, we know this is a binop.
292 int BinOp = CurTok;
293 getNextToken(); // eat binop
300 // If BinOp binds less tightly with RHS than the operator after RHS, let
311 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
  /external/llvm/examples/Kaleidoscope/Chapter4/
toy.cpp 191 // Make sure it's a declared binop.
288 // If this is a binop, find its precedence.
292 // If this is a binop that binds at least as tightly as the current binop,
297 // Okay, we know this is a binop.
298 int BinOp = CurTok;
299 getNextToken(); // eat binop
306 // If BinOp binds less tightly with RHS than the operator after RHS, let
317 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
  /external/llvm/examples/Kaleidoscope/Chapter5/
toy.cpp 233 // Make sure it's a declared binop.
412 // If this is a binop, find its precedence.
416 // If this is a binop that binds at least as tightly as the current binop,
421 // Okay, we know this is a binop.
422 int BinOp = CurTok;
423 getNextToken(); // eat binop
430 // If BinOp binds less tightly with RHS than the operator after RHS, let
441 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
  /external/llvm/lib/Transforms/InstCombine/
InstCombinePHI.cpp 24 /// adds all have a single use, turn this into a phi and a single binop.
121 BinaryOperator *BinOp = cast<BinaryOperator>(FirstInst);
123 BinaryOperator::Create(BinOp->getOpcode(), LHSVal, RHSVal);
509 // Can fold binop, compare or shift here if the RHS is a constant,
582 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst)) {
583 BinOp = BinaryOperator::Create(BinOp->getOpcode(), PhiVal, ConstantOp);
584 if (isNUW) BinOp->setHasNoUnsignedWrap();
585 if (isNSW) BinOp->setHasNoSignedWrap();
586 if (isExact) BinOp->setIsExact()
    [all...]
  /external/clang/lib/StaticAnalyzer/Checkers/
NullabilityChecker.cpp 869 if (auto *BinOp = dyn_cast<BinaryOperator>(S)) {
870 if (BinOp->getOpcode() == BO_Assign)
871 return BinOp->getRHS();
    [all...]
  /external/llvm/examples/Kaleidoscope/Chapter6/
toy.cpp 266 // Make sure it's a declared binop.
461 // If this is a binop, find its precedence.
465 // If this is a binop that binds at least as tightly as the current binop,
470 // Okay, we know this is a binop.
471 int BinOp = CurTok;
472 getNextToken(); // eat binop
479 // If BinOp binds less tightly with RHS than the operator after RHS, let
490 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
683 return Builder.CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/examples/Kaleidoscope/Chapter7/
toy.cpp 285 // Make sure it's a declared binop.
531 // If this is a binop, find its precedence.
535 // If this is a binop that binds at least as tightly as the current binop,
540 // Okay, we know this is a binop.
541 int BinOp = CurTok;
542 getNextToken(); // eat binop
549 // If BinOp binds less tightly with RHS than the operator after RHS, let
560 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
788 return Builder.CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/examples/Kaleidoscope/MCJIT/cached/
toy-jit.cpp 271 // Make sure it's a declared binop.
488 // If this is a binop, find its precedence.
492 // If this is a binop that binds at least as tightly as the current binop,
497 // Okay, we know this is a binop.
498 int BinOp = CurTok;
499 getNextToken(); // eat binop
505 // If BinOp binds less tightly with RHS than the operator after RHS, let
514 LHS = new BinaryExprAST(BinOp, LHS, RHS);
713 return Builder.CreateCall(F, Ops, "binop");
    [all...]
toy.cpp 278 // Make sure it's a declared binop.
495 // If this is a binop, find its precedence.
499 // If this is a binop that binds at least as tightly as the current binop,
504 // Okay, we know this is a binop.
505 int BinOp = CurTok;
506 getNextToken(); // eat binop
512 // If BinOp binds less tightly with RHS than the operator after RHS, let
521 LHS = new BinaryExprAST(BinOp, LHS, RHS);
1080 return Builder.CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/examples/Kaleidoscope/MCJIT/lazy/
toy-jit.cpp 256 // Make sure it's a declared binop.
473 // If this is a binop, find its precedence.
477 // If this is a binop that binds at least as tightly as the current binop,
482 // Okay, we know this is a binop.
483 int BinOp = CurTok;
484 getNextToken(); // eat binop
490 // If BinOp binds less tightly with RHS than the operator after RHS, let
499 LHS = new BinaryExprAST(BinOp, LHS, RHS);
695 return Builder.CreateCall(F, Ops, "binop");
    [all...]
toy.cpp 257 // Make sure it's a declared binop.
474 // If this is a binop, find its precedence.
478 // If this is a binop that binds at least as tightly as the current binop,
483 // Okay, we know this is a binop.
484 int BinOp = CurTok;
485 getNextToken(); // eat binop
491 // If BinOp binds less tightly with RHS than the operator after RHS, let
500 LHS = new BinaryExprAST(BinOp, LHS, RHS);
978 return Builder.CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/examples/Kaleidoscope/Chapter8/
toy.cpp 422 // Make sure it's a declared binop.
672 // If this is a binop, find its precedence.
676 // If this is a binop that binds at least as tightly as the current binop,
681 // Okay, we know this is a binop.
682 int BinOp = CurTok;
684 getNextToken(); // eat binop
691 // If BinOp binds less tightly with RHS than the operator after RHS, let
701 LHS = llvm::make_unique<BinaryExprAST>(BinLoc, BinOp, std::move(LHS),
975 return Builder.CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/examples/Kaleidoscope/MCJIT/complete/
toy.cpp 297 // Make sure it's a declared binop.
514 // If this is a binop, find its precedence.
518 // If this is a binop that binds at least as tightly as the current binop,
523 // Okay, we know this is a binop.
524 int BinOp = CurTok;
525 getNextToken(); // eat binop
531 // If BinOp binds less tightly with RHS than the operator after RHS, let
540 LHS = new BinaryExprAST(BinOp, LHS, RHS);
    [all...]
  /external/llvm/examples/Kaleidoscope/MCJIT/initial/
toy.cpp 255 // Make sure it's a declared binop.
472 // If this is a binop, find its precedence.
476 // If this is a binop that binds at least as tightly as the current binop,
481 // Okay, we know this is a binop.
482 int BinOp = CurTok;
483 getNextToken(); // eat binop
489 // If BinOp binds less tightly with RHS than the operator after RHS, let
498 LHS = new BinaryExprAST(BinOp, LHS, RHS);
938 return Builder.CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/examples/Kaleidoscope/Orc/fully_lazy/
toy.cpp 272 // Make sure it's a declared binop.
508 // If this is a binop, find its precedence.
512 // If this is a binop that binds at least as tightly as the current binop,
517 // Okay, we know this is a binop.
518 int BinOp = CurTok;
519 getNextToken(); // eat binop
526 // If BinOp binds less tightly with RHS than the operator after RHS, let
536 LHS = llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
820 return C.getBuilder().CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/examples/Kaleidoscope/Orc/initial/
toy.cpp 271 // Make sure it's a declared binop.
507 // If this is a binop, find its precedence.
511 // If this is a binop that binds at least as tightly as the current binop,
516 // Okay, we know this is a binop.
517 int BinOp = CurTok;
518 getNextToken(); // eat binop
525 // If BinOp binds less tightly with RHS than the operator after RHS, let
535 LHS = llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
819 return C.getBuilder().CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/examples/Kaleidoscope/Orc/lazy_codegen/
toy.cpp 271 // Make sure it's a declared binop.
507 // If this is a binop, find its precedence.
511 // If this is a binop that binds at least as tightly as the current binop,
516 // Okay, we know this is a binop.
517 int BinOp = CurTok;
518 getNextToken(); // eat binop
525 // If BinOp binds less tightly with RHS than the operator after RHS, let
535 LHS = llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
819 return C.getBuilder().CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/examples/Kaleidoscope/Orc/lazy_irgen/
toy.cpp 271 // Make sure it's a declared binop.
507 // If this is a binop, find its precedence.
511 // If this is a binop that binds at least as tightly as the current binop,
516 // Okay, we know this is a binop.
517 int BinOp = CurTok;
518 getNextToken(); // eat binop
525 // If BinOp binds less tightly with RHS than the operator after RHS, let
535 LHS = llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
819 return C.getBuilder().CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/lib/Target/X86/AsmParser/
X86AsmParser.cpp     [all...]

Completed in 591 milliseconds

1 2