/external/eigen/Eigen/src/Core/ |
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)
|
SelfCwiseBinaryOp.h | 185 internal::scalar_product_op<Scalar> >::type BinOp; 187 SelfCwiseBinaryOp<BinOp, Derived, typename PlainObject::ConstantReturnType> tmp(derived());
|
/external/llvm/lib/Transforms/Scalar/ |
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->getOpcode(), Overflow, LHS, RHS) [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
for_each_selectors.h | 345 template<typename BinOp> 348 BinOp& binop; member in struct:__gnu_parallel::accumulate_binop_reduct 351 accumulate_binop_reduct(BinOp& b) : binop(b) { } 356 { return binop(x, y); }
|
/external/llvm/lib/Transforms/InstCombine/ |
InstCombinePHI.cpp | 23 /// and a single binop. 120 BinaryOperator *BinOp = cast<BinaryOperator>(FirstInst); 122 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...] |
/external/llvm/include/llvm/IR/ |
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); [all...] |
Instructions.h | 567 enum BinOp { 600 AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val, 603 AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val, 607 BinOp getOperation() const { 608 return static_cast<BinOp>(getSubclassDataFromInstruction() >> 5); 611 void setOperation(BinOp Operation) { 680 void Init(BinOp Operation, Value *Ptr, Value *Val, [all...] |
/external/clang/include/clang/AST/ |
StmtVisitor.h | 40 // If we have a binary expr, dispatch to the subcode of the binop. A smart 43 if (PTR(BinaryOperator) BinOp = dyn_cast<BinaryOperator>(S)) { 44 switch (BinOp->getOpcode()) {
|
RecursiveASTVisitor.h | 479 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(S)) { 480 switch (BinOp->getOpcode()) { 529 // If we have a binary expr, dispatch to the subcode of the binop. A smart 532 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(S)) { 533 switch (BinOp->getOpcode()) { [all...] |
/external/llvm/examples/Kaleidoscope/Chapter2/ |
toy.cpp | 159 // Make sure it's a declared binop. 241 // If this is a binop, find its precedence. 245 // If this is a binop that binds at least as tightly as the current binop, 250 // Okay, we know this is a binop. 251 int BinOp = CurTok; 252 getNextToken(); // eat binop 258 // If BinOp binds less tightly with RHS than the operator after RHS, let 267 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
/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...] |
/external/llvm/examples/Kaleidoscope/Chapter3/ |
toy.cpp | 171 // Make sure it's a declared binop. 253 // If this is a binop, find its precedence. 257 // If this is a binop that binds at least as tightly as the current binop, 262 // Okay, we know this is a binop. 263 int BinOp = CurTok; 264 getNextToken(); // eat binop 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/ |
toy.cpp | 178 // Make sure it's a declared binop. 260 // If this is a binop, find its precedence. 264 // If this is a binop that binds at least as tightly as the current binop, 269 // Okay, we know this is a binop. 270 int BinOp = CurTok; 271 getNextToken(); // eat binop 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/ |
parser.ml | 53 (* If this is a binop, find its precedence. *) 57 (* If this is a binop that binds at least as tightly as the current binop, 60 (* Eat the binop. *) 66 (* Okay, we know this is a binop. *) 70 (* If BinOp binds less tightly with rhs than the operator after
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/ |
parser.ml | 53 (* If this is a binop, find its precedence. *) 57 (* If this is a binop that binds at least as tightly as the current binop, 60 (* Eat the binop. *) 66 (* Okay, we know this is a binop. *) 70 (* If BinOp binds less tightly with rhs than the operator after
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/ |
parser.ml | 53 (* If this is a binop, find its precedence. *) 57 (* If this is a binop that binds at least as tightly as the current binop, 60 (* Eat the binop. *) 66 (* Okay, we know this is a binop. *) 70 (* If BinOp binds less tightly with rhs than the operator after
|
/external/llvm/lib/IR/ |
Instructions.cpp | [all...] |
/external/eigen/Eigen/src/Core/products/ |
GeneralMatrixMatrix.h | 394 typedef internal::scalar_product_op<LhsScalar,RhsScalar> BinOp; 395 EIGEN_CHECK_BINARY_COMPATIBILIY(BinOp,LhsScalar,RhsScalar);
|
/external/llvm/examples/Kaleidoscope/Chapter5/ |
toy.cpp | 207 // Make sure it's a declared binop. 361 // If this is a binop, find its precedence. 365 // If this is a binop that binds at least as tightly as the current binop, 370 // Okay, we know this is a binop. 371 int BinOp = CurTok; 372 getNextToken(); // eat binop 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/ |
toy.cpp | 235 // Make sure it's a declared binop. 405 // If this is a binop, find its precedence. 409 // If this is a binop that binds at least as tightly as the current binop, 414 // Okay, we know this is a binop. 415 int BinOp = CurTok; 416 getNextToken(); // eat binop 422 // If BinOp binds less tightly with RHS than the operator after RHS, let 431 LHS = new BinaryExprAST(BinOp, LHS, RHS); 592 return Builder.CreateCall(F, Ops, "binop"); [all...] |
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
parser.ml | 89 (* If this is a binop, find its precedence. *) 93 (* If this is a binop that binds at least as tightly as the current binop, 96 (* Eat the binop. *) 102 (* Okay, we know this is a binop. *) 106 (* If BinOp binds less tightly with rhs than the operator after
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
parser.ml | 100 (* If this is a binop, find its precedence. *) 104 (* If this is a binop that binds at least as tightly as the current binop, 107 (* Eat the binop. *) 113 (* Okay, we know this is a binop. *) 117 (* If BinOp binds less tightly with rhs than the operator after
|
/external/eigen/Eigen/src/Core/util/ |
ForwardDeclarations.h | 91 template<typename BinOp, typename Lhs, typename Rhs> class SelfCwiseBinaryOp;
|
/external/llvm/examples/Kaleidoscope/Chapter7/ |
toy.cpp | 253 // Make sure it's a declared binop. 470 // If this is a binop, find its precedence. 474 // If this is a binop that binds at least as tightly as the current binop, 479 // Okay, we know this is a binop. 480 int BinOp = CurTok; 481 getNextToken(); // eat binop 487 // If BinOp binds less tightly with RHS than the operator after RHS, let 496 LHS = new BinaryExprAST(BinOp, LHS, RHS); 688 return Builder.CreateCall(F, Ops, "binop"); [all...] |
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
parser.ml | 114 (* If this is a binop, find its precedence. *) 118 (* If this is a binop that binds at least as tightly as the current binop, 121 (* Eat the binop. *) 127 (* Okay, we know this is a binop. *) 131 (* If BinOp binds less tightly with rhs than the operator after
|