| /external/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter1/ |
| toy.cpp | 298 // Make sure it's a declared binop.
544 // If this is a binop, find its precedence.
548 // If this is a binop that binds at least as tightly as the current binop,
553 // Okay, we know this is a binop.
554 int BinOp = CurTok;
555 getNextToken(); // eat binop
562 // If BinOp binds less tightly with RHS than the operator after RHS, let
573 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
799 return Builder.CreateCall(F, Ops, "binop");
[all...] |
| /external/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter2/ |
| toy.cpp | 298 // Make sure it's a declared binop.
544 // If this is a binop, find its precedence.
548 // If this is a binop that binds at least as tightly as the current binop,
553 // Okay, we know this is a binop.
554 int BinOp = CurTok;
555 getNextToken(); // eat binop
562 // If BinOp binds less tightly with RHS than the operator after RHS, let
573 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
799 return Builder.CreateCall(F, Ops, "binop");
[all...] |
| /external/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter3/ |
| toy.cpp | 298 // Make sure it's a declared binop.
544 // If this is a binop, find its precedence.
548 // If this is a binop that binds at least as tightly as the current binop,
553 // Okay, we know this is a binop.
554 int BinOp = CurTok;
555 getNextToken(); // eat binop
562 // If BinOp binds less tightly with RHS than the operator after RHS, let
573 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
799 return Builder.CreateCall(F, Ops, "binop");
[all...] |
| /external/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter4/ |
| toy.cpp | 286 // Make sure it's a declared binop.
532 // If this is a binop, find its precedence.
536 // If this is a binop that binds at least as tightly as the current binop,
541 // Okay, we know this is a binop.
542 int BinOp = CurTok;
543 getNextToken(); // eat binop
550 // If BinOp binds less tightly with RHS than the operator after RHS, let
561 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
788 return Builder.CreateCall(F, Ops, "binop");
[all...] |
| /external/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter5/ |
| toy.cpp | 301 // Make sure it's a declared binop.
547 // If this is a binop, find its precedence.
551 // If this is a binop that binds at least as tightly as the current binop,
556 // Okay, we know this is a binop.
557 int BinOp = CurTok;
558 getNextToken(); // eat binop
565 // If BinOp binds less tightly with RHS than the operator after RHS, let
576 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
810 return Builder.CreateCall(F, Ops, "binop");
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter6/ |
| toy.cpp | 278 // 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
491 // If BinOp binds less tightly with RHS than the operator after RHS, let
502 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
695 return Builder.CreateCall(F, Ops, "binop");
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter7/ |
| toy.cpp | 298 // Make sure it's a declared binop.
544 // If this is a binop, find its precedence.
548 // If this is a binop that binds at least as tightly as the current binop,
553 // Okay, we know this is a binop.
554 int BinOp = CurTok;
555 getNextToken(); // eat binop
562 // If BinOp binds less tightly with RHS than the operator after RHS, let
573 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
800 return Builder.CreateCall(F, Ops, "binop");
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter8/ |
| toy.cpp | 295 // Make sure it's a declared binop.
541 // If this is a binop, find its precedence.
545 // If this is a binop that binds at least as tightly as the current binop,
550 // Okay, we know this is a binop.
551 int BinOp = CurTok;
552 getNextToken(); // eat binop
559 // If BinOp binds less tightly with RHS than the operator after RHS, let
570 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
795 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);
712 return Builder.CreateCall(F, Ops, "binop");
[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);
937 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);
694 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);
977 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
|
| /external/python/cpython2/Include/ |
| Python-ast.h | 205 } BinOp;
452 #define BinOp(a0, a1, a2, a3, a4, a5) _Py_BinOp(a0, a1, a2, a3, a4, a5)
|
| /external/swiftshader/third_party/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/swiftshader/third_party/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
|
| /prebuilts/gdb/darwin-x86/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/gdb/linux-x86/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/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/AST/ |
| Expr.cpp | [all...] |
| /external/llvm/include/llvm/IR/ |
| Instructions.h | 684 enum BinOp {
717 AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
720 AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
724 BinOp getOperation() const {
725 return static_cast<BinOp>(getSubclassDataFromInstruction() >> 5);
728 void setOperation(BinOp Operation) {
798 void Init(BinOp Operation, Value *Ptr, Value *Val,
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/IR/ |
| Instructions.h | 684 enum BinOp {
713 AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
716 AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
727 BinOp getOperation() const {
728 return static_cast<BinOp>(getSubclassDataFromInstruction() >> 5);
731 void setOperation(BinOp Operation) {
801 void Init(BinOp Operation, Value *Ptr, Value *Val,
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/IR/ |
| Instructions.h | 684 enum BinOp {
713 AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
716 AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
727 BinOp getOperation() const {
728 return static_cast<BinOp>(getSubclassDataFromInstruction() >> 5);
731 void setOperation(BinOp Operation) {
801 void Init(BinOp Operation, Value *Ptr, Value *Val,
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/IR/ |
| Instructions.h | 684 enum BinOp {
713 AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
716 AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
727 BinOp getOperation() const {
728 return static_cast<BinOp>(getSubclassDataFromInstruction() >> 5);
731 void setOperation(BinOp Operation) {
801 void Init(BinOp Operation, Value *Ptr, Value *Val,
[all...] |
