| /external/eigen/Eigen/src/Core/ |
| H A D | Transpose.h | 329 template<typename BinOp,typename NestedXpr,typename Rhs>
330 struct blas_traits<SelfCwiseBinaryOp<BinOp,NestedXpr,Rhs> >
333 typedef SelfCwiseBinaryOp<BinOp,NestedXpr,Rhs> XprType;
343 template<bool DestIsTransposed, typename BinOp, typename DerivedA, typename DerivedB>
344 struct check_transpose_aliasing_compile_time_selector<DestIsTransposed,CwiseBinaryOp<BinOp,DerivedA,DerivedB> >
360 template<typename Scalar, bool DestIsTransposed, typename BinOp, typename DerivedA, typename DerivedB>
361 struct check_transpose_aliasing_run_time_selector<Scalar,DestIsTransposed,CwiseBinaryOp<BinOp,DerivedA,DerivedB> >
363 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/Transforms/Scalar/ |
| H A D | EarlyCSE.cpp | 95 if (BinaryOperator* BinOp = dyn_cast<BinaryOperator>(Inst)) {
96 Value *LHS = BinOp->getOperand(0);
97 Value *RHS = BinOp->getOperand(1);
98 if (BinOp->isCommutative() && BinOp->getOperand(0) > BinOp->getOperand(1))
101 if (isa<OverflowingBinaryOperator>(BinOp)) {
104 BinOp->hasNoSignedWrap() * OverflowingBinaryOperator::NoSignedWrap |
105 BinOp->hasNoUnsignedWrap() * OverflowingBinaryOperator::NoUnsignedWrap;
106 return hash_combine(BinOp
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombinePHI.cpp | 120 BinaryOperator *BinOp = cast<BinaryOperator>(FirstInst); local
122 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/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/Chapter2/ |
| H A D | toy.cpp | 243 int BinOp = CurTok; local
250 // If BinOp binds less tightly with RHS than the operator after RHS, let
259 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
| /external/clang/lib/CodeGen/ |
| H A D | CGExprScalar.cpp | 47 BinaryOperator::Opcode Opcode; // Opcode of BinOp to perform
1441 BinOpInfo BinOp; local
1442 BinOp.LHS = InVal;
1443 BinOp.RHS = NextVal;
1444 BinOp.Ty = E->getType();
1445 BinOp.Opcode = BO_Add;
1446 BinOp.FPContractable = false;
1447 BinOp.E = E;
1448 return EmitOverflowCheckedBinOp(BinOp);
1488 llvm::AtomicRMWInst::BinOp ao
1538 BinOpInfo BinOp; local
1673 BinOpInfo BinOp; local
[all...] |
| /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 | 263 int BinOp = CurTok; local
270 // If BinOp binds less tightly with RHS than the operator after RHS, let
279 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
| /external/llvm/examples/Kaleidoscope/Chapter4/ |
| H A D | toy.cpp | 270 int BinOp = CurTok; local
277 // If BinOp binds less tightly with RHS than the operator after RHS, let
286 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/IR/ |
| H A D | Instructions.cpp | 1266 void AtomicRMWInst::Init(BinOp Operation, Value *Ptr, Value *Val,
1286 AtomicRMWInst::AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
1297 AtomicRMWInst::AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
1953 Value *BinaryOperator::getNegArgument(Value *BinOp) { argument
1954 return cast<BinaryOperator>(BinOp)->getOperand(1);
1957 const Value *BinaryOperator::getNegArgument(const Value *BinOp) { argument
1958 return getNegArgument(const_cast<Value*>(BinOp));
1961 Value *BinaryOperator::getFNegArgument(Value *BinOp) { argument
1962 return cast<BinaryOperator>(BinOp)->getOperand(1);
1965 const Value *BinaryOperator::getFNegArgument(const Value *BinOp) { argument
1969 getNotArgument(Value *BinOp) argument
1980 getNotArgument(const Value *BinOp) argument
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| H A D | GeneralMatrixMatrix.h | 394 typedef internal::scalar_product_op<LhsScalar,RhsScalar> BinOp; typedef
395 EIGEN_CHECK_BINARY_COMPATIBILIY(BinOp,LhsScalar,RhsScalar);
|
| /external/llvm/examples/Kaleidoscope/Chapter5/ |
| H A D | toy.cpp | 371 int BinOp = CurTok; local
378 // If BinOp binds less tightly with RHS than the operator after RHS, let
387 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
| /external/llvm/examples/Kaleidoscope/Chapter6/ |
| H A D | toy.cpp | 415 int BinOp = CurTok; local
422 // If BinOp binds less tightly with RHS than the operator after RHS, let
431 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
| H A D | parser.ml | 106 (* If BinOp binds less tightly with rhs than the operator after
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
| H A D | parser.ml | 117 (* If BinOp binds less tightly with rhs than the operator after
|
| /external/llvm/examples/Kaleidoscope/Chapter7/ |
| H A D | toy.cpp | 480 int BinOp = CurTok; local
487 // If BinOp binds less tightly with RHS than the operator after RHS, let
496 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
| /external/llvm/examples/Kaleidoscope/MCJIT/cached/ |
| H A D | toy-jit.cpp | 498 int BinOp = CurTok; local
505 // If BinOp binds less tightly with RHS than the operator after RHS, let
514 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
| /external/llvm/examples/Kaleidoscope/MCJIT/initial/ |
| H A D | toy.cpp | 481 int BinOp = CurTok; local
488 // If BinOp binds less tightly with RHS than the operator after RHS, let
497 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
| /external/llvm/examples/Kaleidoscope/MCJIT/lazy/ |
| H A D | toy-jit.cpp | 483 int BinOp = CurTok; local
490 // If BinOp binds less tightly with RHS than the operator after RHS, let
499 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
| H A D | toy.cpp | 483 int BinOp = CurTok; local
490 // If BinOp binds less tightly with RHS than the operator after RHS, let
499 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
| H A D | parser.ml | 131 (* If BinOp binds less tightly with rhs than the operator after
|