| /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 | 151 // Make sure it's a declared binop.
233 // If this is a binop, find its precedence.
237 // If this is a binop that binds at least as tightly as the current binop,
242 // Okay, we know this is a binop.
243 int BinOp = CurTok;
244 getNextToken(); // eat binop
250 // If BinOp binds less tightly with RHS than the operator after RHS, let
259 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
| /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/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/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/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/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/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/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 | 277 // Make sure it's a declared binop.
494 // If this is a binop, find its precedence.
498 // If this is a binop that binds at least as tightly as the current binop,
503 // Okay, we know this is a binop.
504 int BinOp = CurTok;
505 getNextToken(); // eat binop
511 // If BinOp binds less tightly with RHS than the operator after RHS, let
520 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 | 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);
978 return Builder.CreateCall(F, Ops, "binop");
[all...] |
| /external/llvm/examples/Kaleidoscope/MCJIT/complete/ |
| toy.cpp | 301 // Make sure it's a declared binop.
518 // If this is a binop, find its precedence.
522 // If this is a binop that binds at least as tightly as the current binop,
527 // Okay, we know this is a binop.
528 int BinOp = CurTok;
529 getNextToken(); // eat binop
535 // If BinOp binds less tightly with RHS than the operator after RHS, let
544 LHS = new BinaryExprAST(BinOp, LHS, RHS);
[all...] |
| /external/llvm/examples/Kaleidoscope/MCJIT/initial/ |
| toy.cpp | 254 // Make sure it's a declared binop.
471 // If this is a binop, find its precedence.
475 // If this is a binop that binds at least as tightly as the current binop,
480 // Okay, we know this is a binop.
481 int BinOp = CurTok;
482 getNextToken(); // eat binop
488 // If BinOp binds less tightly with RHS than the operator after RHS, let
497 LHS = new BinaryExprAST(BinOp, LHS, RHS);
938 return Builder.CreateCall(F, Ops, "binop");
[all...] |
| /external/llvm/include/llvm/IR/ |
| 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...] |
| /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/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/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | [all...] |
| /prebuilts/devtools/tools/lib/ |
| jython-standalone-2.5.3.jar | |
| /prebuilts/misc/common/jython/ |
| jython.jar | |
| /prebuilts/tools/common/m2/repository/org/python/jython/2.5.3/ |
| jython-2.5.3.jar | |
| /prebuilts/tools/common/m2/repository/org/python/jython-standalone/2.5.3/ |
| jython-standalone-2.5.3.jar | |
