| /external/valgrind/memcheck/ |
| mc_translate.c | 438 #define binop(_op, _arg1, _arg2) IRExpr_Binop((_op),(_arg1),(_arg2)) macro
484 return binop(Iop_64HLto128, z64, z64);
501 return assignNew('V', mce, Ity_I8, binop(Iop_And8, a1, a2));
507 return assignNew('V', mce, Ity_I16, binop(Iop_And16, a1, a2));
513 return assignNew('V', mce, Ity_I32, binop(Iop_And32, a1, a2));
519 return assignNew('V', mce, Ity_I64, binop(Iop_And64, a1, a2));
525 return assignNew('V', mce, Ity_V128, binop(Iop_AndV128, a1, a2));
531 return assignNew('V', mce, Ity_V256, binop(Iop_AndV256, a1, a2));
539 return assignNew('V', mce, Ity_I8, binop(Iop_Or8, a1, a2));
545 return assignNew('V', mce, Ity_I16, binop(Iop_Or16, a1, a2))
[all...] |
| /external/llvm/docs/tutorial/ |
| LangImpl02.rst | 371 // Make sure it's a declared binop.
408 a sequence of [binop,primaryexpr] pairs:
444 // If this is a binop, find its precedence.
448 // If this is a binop that binds at least as tightly as the current binop,
462 // Okay, we know this is a binop.
463 int BinOp = CurTok;
464 getNextToken(); // eat binop
477 In particular, we could have "(a+b) binop unparsed" or "a + (b binop
[all...] |
| OCamlLangImpl2.rst | 292 a sequence of [binop,primaryexpr] pairs:
322 (* If this is a binop, find its precedence. *)
326 (* If this is a binop that binds at least as tightly as the current binop,
339 (* Eat the binop. *)
345 (* Okay, we know this is a binop. *)
356 In particular, we could have "(a+b) binop unparsed" or "a + (b binop
357 unparsed)". To determine this, we look ahead at "binop" to determine its
358 precedence and compare it to BinOp's precedence (which is '+' in thi
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_ast.py | 85 # BinOp
173 x = ast.BinOp(1, 2, 3, lineno=0)
180 self.assertRaises(TypeError, ast.BinOp, 1, 2)
183 x = ast.BinOp(left=1, op=2, right=3, lineno=0)
238 'Expression(body=BinOp(left=Num(n=1, lineno=1, col_offset=0), '
263 'Expression(body=BinOp(left=Num(n=1, lineno=4, col_offset=0), '
271 'Expression(body=BinOp(left=Num(n=1, lineno=4, col_offset=0), '
360 ('Interactive', [('Expr', (1, 0), ('BinOp', (1, 0), ('Num', (1, 0), 1), ('Add',), ('Num', (1, 2), 2)))]),
364 ('Expression', ('BinOp', (1, 0), ('Name', (1, 0), 'a', ('Load',)), ('Add',), ('Name', (1, 4), 'b', ('Load',)))),
|
| /external/llvm/examples/Kaleidoscope/Chapter2/ |
| toy.cpp | 184 // Make sure it's a declared binop.
280 // If this is a binop, find its precedence.
284 // If this is a binop that binds at least as tightly as the current binop,
289 // Okay, we know this is a binop.
290 int BinOp = CurTok;
291 getNextToken(); // eat binop
298 // If BinOp binds less tightly with RHS than the operator after RHS, let
308 LHS = helper::make_unique<BinaryExprAST>(BinOp, std::move(LHS),
|
| /external/swiftshader/third_party/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/v8/src/asmjs/ |
| asm-wasm-builder.cc | 192 BinaryOperation* binop = expr->AsBinaryOperation(); local
193 if (binop->op() == Token::COMMA) {
194 VisitForEffect(binop->left());
195 VisitForEffect(binop->right());
778 BinaryOperation* binop = value->AsBinaryOperation(); local
779 if (binop != nullptr) {
782 Property* prop = binop->left()->AsProperty();
783 if (binop->op() == Token::MUL) {
784 DCHECK(binop->right()->IsLiteral());
785 DCHECK_EQ(1.0, binop->right()->AsLiteral()->raw_value()->AsNumber())
983 BinaryOperation* binop = expr->key()->AsBinaryOperation(); local
[all...] |
| /external/valgrind/VEX/priv/ |
| host_s390_isel.c | 301 if (expr->tag == Iex_Binop && expr->Iex.Binop.op == Iop_Add64) {
302 IRExpr *arg1 = expr->Iex.Binop.arg1;
303 IRExpr *arg2 = expr->Iex.Binop.arg2;
924 IRExpr *arg1 = expr->Iex.Binop.arg1;
925 IRExpr *arg2 = expr->Iex.Binop.arg2;
928 switch (expr->Iex.Binop.op) {
1548 IROp unop, binop; local
[all...] |
| /external/llvm/test/CodeGen/X86/ |
| avx-win64.ll | 32 %binop = fadd <8 x float> %x, <float -1.000000e+00, float -1.000000e+00, float -1.000000e+00, float -1.000000e+00, float -1.000000e+00, float -1.000000e+00, float -1.000000e+00, float -1.000000e+00>
33 %calltmp = call <8 x float> @f___vyf(<8 x float> %binop, <8 x i32> %"internal_mask&function_mask25")
|
| /external/valgrind/none/tests/ppc32/ |
| round.c | 405 #define BINOP(op) \
476 BINOP("fadds");
478 BINOP("fadd");
481 BINOP("fsubs");
483 BINOP("fsub");
486 BINOP("fmuls");
488 BINOP("fmul");
491 BINOP("fdivs");
493 BINOP("fdiv");
501 #undef BINOP
[all...] |
| /art/runtime/interpreter/mterp/arm/ |
| binop.S | 17 /* binop vAA, vBB, vCC */
|
| binop2addr.S | 16 /* binop/2addr vA, vB */
|
| binopLit8.S | 19 /* binop/lit8 vAA, vBB, #+CC */
|
| binopWide.S | 17 /* binop vAA, vBB, vCC */
|
| binopWide2addr.S | 16 /* binop/2addr vA, vB */
|
| /art/runtime/interpreter/mterp/arm64/ |
| binop.S | 17 /* binop vAA, vBB, vCC */
|
| binop2addr.S | 16 /* binop/2addr vA, vB */
|
| binopLit8.S | 19 /* binop/lit8 vAA, vBB, #+CC */
|
| /art/runtime/interpreter/mterp/mips/ |
| binopWide.S | 16 /* binop vAA, vBB, vCC */
|
| binopWide2addr.S | 14 /* binop/2addr vA, vB */
|
| /external/clang/test/OpenMP/ |
| nesting_of_regions.cpp | [all...] |
| /external/swiftshader/third_party/LLVM/docs/tutorial/ |
| LangImpl2.html | 424 // Make sure it's a declared binop.
464 sequence of [binop,primaryexpr] pairs:</p>
499 // If this is a binop, find its precedence.
503 // If this is a binop that binds at least as tightly as the current binop,
518 // Okay, we know this is a binop.
519 int BinOp = CurTok;
520 getNextToken(); // eat binop
534 particular, we could have "(a+b) binop unparsed" or "a + (b binop unparsed)"
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| MallocOverflowSecurityChecker.cpp | 82 if (const BinaryOperator *binop = dyn_cast<BinaryOperator>(e)) {
83 BinaryOperatorKind opc = binop->getOpcode();
86 mulop = binop;
90 const Expr *lhs = binop->getLHS();
91 const Expr *rhs = binop->getRHS();
|
| /external/llvm/lib/Analysis/ |
| CostModel.cpp | 158 static bool matchPairwiseReductionAtLevel(const BinaryOperator *BinOp,
166 if (BinOp == nullptr)
169 assert(BinOp->getType()->isVectorTy() && "Expecting a vector type");
171 unsigned Opcode = BinOp->getOpcode();
172 Value *L = BinOp->getOperand(0);
173 Value *R = BinOp->getOperand(1);
202 // %BinOp = fadd %NextLevelOpL, %R
342 BinaryOperator *BinOp;
343 if (!(BinOp = dyn_cast<BinaryOperator>(RdxOp)))
345 if (BinOp->getOpcode() != RdxOpcode
[all...] |
| /external/clang/lib/Analysis/ |
| Consumed.cpp | 497 void VisitBinaryOperator(const BinaryOperator *BinOp);
706 void ConsumedStmtVisitor::VisitBinaryOperator(const BinaryOperator *BinOp) {
707 switch (BinOp->getOpcode()) {
710 InfoEntry LEntry = findInfo(BinOp->getLHS()),
711 REntry = findInfo(BinOp->getRHS());
732 PropagationMap.insert(PairType(BinOp, PropagationInfo(BinOp,
733 static_cast<EffectiveOp>(BinOp->getOpcode() == BO_LOr), LTest, RTest)));
740 forwardInfo(BinOp->getLHS(), BinOp);
[all...] |
