HomeSort by relevance Sort by last modified time
    Searched defs:BinOp (Results 1 - 25 of 31) 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/lib/Target/AArch64/
AArch64AddressTypePromotion.cpp 158 const BinaryOperator *BinOp = dyn_cast<BinaryOperator>(Inst);
159 if (BinOp && isa<OverflowingBinaryOperator>(BinOp) &&
160 (BinOp->hasNoUnsignedWrap() || BinOp->hasNoSignedWrap()))
454 const BinaryOperator *BinOp = dyn_cast<BinaryOperator>(Inst);
455 if (BinOp && isa<ConstantInt>(BinOp->getOperand(0)))
  /external/llvm/examples/Kaleidoscope/Chapter2/
toy.cpp 153 // Make sure it's a declared binop.
234 // If this is a binop, find its precedence.
238 // If this is a binop that binds at least as tightly as the current binop,
243 // Okay, we know this is a binop.
244 int BinOp = CurTok;
245 getNextToken(); // eat binop
251 // If BinOp binds less tightly with RHS than the operator after RHS, let
260 LHS = new BinaryExprAST(BinOp, LHS, RHS);
  /external/llvm/lib/Analysis/
CostModel.cpp 160 static bool matchPairwiseReductionAtLevel(const BinaryOperator *BinOp,
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;
345 if (!(BinOp = dyn_cast<BinaryOperator>(RdxOp)))
347 if (BinOp->getOpcode() != RdxOpcode
    [all...]
  /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 173 // Make sure it's a declared binop.
255 // If this is a binop, find its precedence.
259 // If this is a binop that binds at least as tightly as the current binop,
264 // Okay, we know this is a binop.
265 int BinOp = CurTok;
266 getNextToken(); // eat binop
272 // If BinOp binds less tightly with RHS than the operator after RHS, let
281 LHS = new BinaryExprAST(BinOp, LHS, RHS);
  /external/llvm/examples/Kaleidoscope/Chapter4/
toy.cpp 180 // Make sure it's a declared binop.
262 // If this is a binop, find its precedence.
266 // If this is a binop that binds at least as tightly as the current binop,
271 // Okay, we know this is a binop.
272 int BinOp = CurTok;
273 getNextToken(); // eat binop
279 // If BinOp binds less tightly with RHS than the operator after RHS, let
288 LHS = new BinaryExprAST(BinOp, LHS, RHS);
  /external/llvm/examples/Kaleidoscope/Chapter5/
toy.cpp 209 // Make sure it's a declared binop.
363 // If this is a binop, find its precedence.
367 // If this is a binop that binds at least as tightly as the current binop,
372 // Okay, we know this is a binop.
373 int BinOp = CurTok;
374 getNextToken(); // eat binop
380 // If BinOp binds less tightly with RHS than the operator after RHS, let
389 LHS = new BinaryExprAST(BinOp, LHS, RHS);
  /external/llvm/lib/Transforms/InstCombine/
InstCombinePHI.cpp 25 /// and a single binop.
122 BinaryOperator *BinOp = cast<BinaryOperator>(FirstInst);
124 BinaryOperator::Create(BinOp->getOpcode(), LHSVal, RHSVal);
417 // Can fold binop, compare or shift here if the RHS is a constant,
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()
    [all...]
InstCombineCompares.cpp     [all...]
  /external/llvm/examples/Kaleidoscope/Chapter6/
toy.cpp 237 // Make sure it's a declared binop.
407 // If this is a binop, find its precedence.
411 // If this is a binop that binds at least as tightly as the current binop,
416 // Okay, we know this is a binop.
417 int BinOp = CurTok;
418 getNextToken(); // eat binop
424 // If BinOp binds less tightly with RHS than the operator after RHS, let
433 LHS = new BinaryExprAST(BinOp, LHS, RHS);
594 return Builder.CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/examples/Kaleidoscope/Chapter7/
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);
690 return Builder.CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/examples/Kaleidoscope/MCJIT/cached/
toy-jit.cpp 272 // Make sure it's a declared binop.
489 // If this is a binop, find its precedence.
493 // If this is a binop that binds at least as tightly as the current binop,
498 // Okay, we know this is a binop.
499 int BinOp = CurTok;
500 getNextToken(); // eat binop
506 // If BinOp binds less tightly with RHS than the operator after RHS, let
515 LHS = new BinaryExprAST(BinOp, LHS, RHS);
714 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);
1081 return Builder.CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/examples/Kaleidoscope/MCJIT/lazy/
toy-jit.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);
696 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);
979 return Builder.CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/examples/Kaleidoscope/MCJIT/complete/
toy.cpp 302 // Make sure it's a declared binop.
519 // If this is a binop, find its precedence.
523 // If this is a binop that binds at least as tightly as the current binop,
528 // Okay, we know this is a binop.
529 int BinOp = CurTok;
530 getNextToken(); // eat binop
536 // If BinOp binds less tightly with RHS than the operator after RHS, let
545 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);
939 return Builder.CreateCall(F, Ops, "binop");
    [all...]
  /external/llvm/lib/Target/X86/AsmParser/
X86AsmParser.cpp     [all...]
  /prebuilts/python/darwin-x86/2.7.5/include/python2.7/
Python-ast.h 205 } BinOp;
452 #define BinOp(a0, a1, a2, a3, a4, a5) _Py_BinOp(a0, a1, a2, a3, a4, a5)
  /prebuilts/python/linux-x86/2.7.5/include/python2.7/
Python-ast.h 205 } BinOp;
452 #define BinOp(a0, a1, a2, a3, a4, a5) _Py_BinOp(a0, a1, a2, a3, a4, a5)
  /external/llvm/include/llvm/IR/
Instructions.h 631 enum BinOp {
664 AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
667 AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
671 BinOp getOperation() const {
672 return static_cast<BinOp>(getSubclassDataFromInstruction() >> 5);
675 void setOperation(BinOp Operation) {
744 void Init(BinOp Operation, Value *Ptr, Value *Val,
    [all...]
  /external/llvm/lib/CodeGen/
CodeGenPrepare.cpp     [all...]
  /external/clang/lib/CodeGen/
CGExprScalar.cpp 47 BinaryOperator::Opcode Opcode; // Opcode of BinOp to perform
49 const Expr *E; // Entire expr, for error unsupported. May not be binop.
    [all...]

Completed in 1267 milliseconds

1 2