| /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/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/Chapter9/ |
| toy.cpp | 423 // Make sure it's a declared binop.
673 // If this is a binop, find its precedence.
677 // If this is a binop that binds at least as tightly as the current binop,
682 // Okay, we know this is a binop.
683 int BinOp = CurTok;
685 getNextToken(); // eat binop
692 // If BinOp binds less tightly with RHS than the operator after RHS, let
702 LHS = llvm::make_unique<BinaryExprAST>(BinLoc, BinOp, std::move(LHS),
975 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/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...] |
| /art/runtime/interpreter/mterp/out/ |
| mterp_mips64.S | [all...] |
| mterp_arm64.S | [all...] |
| mterp_arm.S | [all...] |
| /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 return hash_combine(BinOp->getOpcode(), LHS, RHS);
[all...] |
| /external/swiftshader/third_party/LLVM/docs/tutorial/ |
| LangImpl4.html | 695 // Make sure it's a declared binop.
777 // If this is a binop, find its precedence.
781 // If this is a binop that binds at least as tightly as the current binop,
786 // Okay, we know this is a binop.
787 int BinOp = CurTok;
788 getNextToken(); // eat binop
794 // If BinOp binds less tightly with RHS than the operator after RHS, let
803 LHS = new BinaryExprAST(BinOp, LHS, RHS);
[all...] |
| /art/compiler/optimizing/ |
| instruction_simplifier.cc | 59 bool TryMoveNegOnInputsAfterBinop(HBinaryOperation* binop);
163 bool InstructionSimplifierVisitor::TryMoveNegOnInputsAfterBinop(HBinaryOperation* binop) {
164 DCHECK(binop->IsAdd() || binop->IsSub());
165 DCHECK(binop->GetLeft()->IsNeg() && binop->GetRight()->IsNeg());
166 HNeg* left_neg = binop->GetLeft()->AsNeg();
167 HNeg* right_neg = binop->GetRight()->AsNeg();
182 if (!Primitive::IsIntegralType(binop->GetType())) {
185 binop->ReplaceInput(left_neg->GetInput(), 0)
[all...] |
| /external/v8/src/compiler/arm/ |
| instruction-selector-arm.cc | 1855 Node* binop = m.left().node(); local
1866 Node* binop = m.right().node(); local
[all...] |
| /external/clang/lib/CodeGen/ |
| CGExprScalar.cpp | 48 BinaryOperator::Opcode Opcode; // Opcode of BinOp to perform
50 const Expr *E; // Entire expr, for error unsupported. May not be binop.
[all...] |
| /external/v8/src/compiler/ |
| wasm-compiler.cc | 454 Node* WasmGraphBuilder::Binop(wasm::WasmOpcode opcode, Node* left, Node* right,
508 return Invert(Binop(wasm::kExprI32Eq, left, right));
579 return Invert(Binop(wasm::kExprI64Eq, left, right));
634 return Invert(Binop(wasm::kExprF32Eq, left, right));
665 return Invert(Binop(wasm::kExprF64Eq, left, right));
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| NullabilityChecker.cpp | [all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Bitcode/ |
| LLVMBitCodes.h | 189 /// binop a CST_CODE_CE_BINOP or a XXX refers to. The values of these enums
260 FUNC_CODE_INST_BINOP = 2, // BINOP: [opcode, ty, opval, opval]
|
| /external/libmojo/third_party/jinja2/ |
| compiler.py | 1421 def binop(operator, interceptable=True): member in class:CodeGenerator
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Python/ |
| peephole.c | 77 /* Replace LOAD_CONST c1. LOAD_CONST c2 BINOP
78 with LOAD_CONST binop(c1,c2)
468 LOAD_CONST c1 LOAD_CONST c2 BINOP --> LOAD_CONST binop(c1,c2) */
|
