HomeSort by relevance Sort by last modified time
    Searched full:binop (Results 176 - 200 of 403) sorted by null

1 2 3 4 5 6 78 91011>>

  /external/elfutils/libdwfl/
frame_unwind.c 371 #define BINOP(atom, op) \
388 BINOP (DW_OP_and, &)
407 BINOP (DW_OP_minus, -)
426 BINOP (DW_OP_mul, *)
427 BINOP (DW_OP_or, |)
428 BINOP (DW_OP_plus, +)
429 BINOP (DW_OP_shl, <<)
430 BINOP (DW_OP_shr, >>)
432 BINOP (DW_OP_xor, ^)
439 #undef BINOP
    [all...]
  /external/clang/include/clang/AST/
StmtVisitor.h 42 // If we have a binary expr, dispatch to the subcode of the binop. A smart
45 if (PTR(BinaryOperator) BinOp = dyn_cast<BinaryOperator>(S)) {
46 switch (BinOp->getOpcode()) {
  /external/llvm/examples/Kaleidoscope/Chapter3/
toy.cpp 193 // Make sure it's a declared binop.
290 // If this is a binop, find its precedence.
294 // If this is a binop that binds at least as tightly as the current binop,
299 // Okay, we know this is a binop.
300 int BinOp = CurTok;
301 getNextToken(); // eat binop
308 // If BinOp binds less tightly with RHS than the operator after RHS, let
319 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
  /external/llvm/examples/Kaleidoscope/Chapter4/
toy.cpp 202 // Make sure it's a declared binop.
299 // If this is a binop, find its precedence.
303 // If this is a binop that binds at least as tightly as the current binop,
308 // Okay, we know this is a binop.
309 int BinOp = CurTok;
310 getNextToken(); // eat binop
317 // If BinOp binds less tightly with RHS than the operator after RHS, let
328 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
  /external/swiftshader/third_party/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/swiftshader/third_party/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);
  /prebuilts/ndk/r13/sources/third_party/shaderc/third_party/glslang/SPIRV/
GlslangToSpv.cpp     [all...]
  /prebuilts/ndk/r13/sources/third_party/vulkan/glslang/SPIRV/
GlslangToSpv.cpp     [all...]
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/
binop-segref.s 1 ; This used to be part of the binop test; differences broke when the
rd-dw2-2.d 2 #source: binop-segref.s
  /external/swiftshader/third_party/LLVM/docs/tutorial/
OCamlLangImpl2.html 366 sequence of [binop,primaryexpr] pairs:</p>
397 (* If this is a binop, find its precedence. *)
401 (* If this is a binop that binds at least as tightly as the current binop,
415 (* Eat the binop. *)
418 (* Okay, we know this is a binop. *)
431 particular, we could have "(a+b) binop unparsed" or "a + (b binop unparsed)".
432 To determine this, we look ahead at "binop" to determine its precedence and
433 compare it to BinOp's precedence (which is '+' in this case):</p
    [all...]
  /external/eigen/unsupported/Eigen/src/AutoDiff/
AutoDiffScalar.h 500 template<typename DerType, typename BinOp>
501 struct ScalarBinaryOpTraits<AutoDiffScalar<DerType>,typename DerType::Scalar,BinOp>
506 template<typename DerType, typename BinOp>
507 struct ScalarBinaryOpTraits<typename DerType::Scalar,AutoDiffScalar<DerType>, BinOp>
515 // template<typename DerType, typename BinOp>
516 // struct ScalarBinaryOpTraits<AutoDiffScalar<DerType>,AutoDiffScalar<DerType>, BinOp>
522 // template<typename DerType1,typename DerType2, typename BinOp>
523 // struct ScalarBinaryOpTraits<AutoDiffScalar<DerType1>,AutoDiffScalar<DerType2>, BinOp>
  /external/llvm/lib/Target/AArch64/
AArch64AddressTypePromotion.cpp 160 const BinaryOperator *BinOp = dyn_cast<BinaryOperator>(Inst);
161 if (BinOp && isa<OverflowingBinaryOperator>(BinOp) &&
162 (BinOp->hasNoUnsignedWrap() || BinOp->hasNoSignedWrap()))
454 const BinaryOperator *BinOp = dyn_cast<BinaryOperator>(Inst);
455 if (BinOp && isa<ConstantInt>(BinOp->getOperand(0)))
  /external/eigen/Eigen/src/Core/
Transpose.h 332 template<bool DestIsTransposed, typename BinOp, typename DerivedA, typename DerivedB>
333 struct check_transpose_aliasing_compile_time_selector<DestIsTransposed,CwiseBinaryOp<BinOp,DerivedA,DerivedB> >
349 template<typename Scalar, bool DestIsTransposed, typename BinOp, typename DerivedA, typename DerivedB>
350 struct check_transpose_aliasing_run_time_selector<Scalar,DestIsTransposed,CwiseBinaryOp<BinOp,DerivedA,DerivedB> >
352 static bool run(const Scalar* dest, const CwiseBinaryOp<BinOp,DerivedA,DerivedB>& src)
  /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/swiftshader/third_party/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/Chapter5/
toy.cpp 245 // Make sure it's a declared binop.
424 // If this is a binop, find its precedence.
428 // If this is a binop that binds at least as tightly as the current binop,
433 // Okay, we know this is a binop.
434 int BinOp = CurTok;
435 getNextToken(); // eat binop
442 // If BinOp binds less tightly with RHS than the operator after RHS, let
453 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
  /external/swiftshader/third_party/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/test/CodeGen/X86/
2011-11-22-AVX2-Domains.ll 64 %binop.i20246 = fmul <8 x float> %uint2float.i20245, <float 0x3F70101020000000, float 0x3F70101020000000, float 0x3F70101020000000, float 0x3F70101020000000, float 0x3F70101020000000, float 0x3F70101020000000, float 0x3F70101020000000, float 0x3F70101020000000>
90 %binop.i20572 = fmul <8 x float> %binop403, undef
94 %binop1207 = fmul <8 x float> %binop.i20246, undef
  /external/swiftshader/third_party/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...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Parser/
Python.asdl 54 | BinOp(expr left, operator op, expr right)
  /external/llvm/lib/Transforms/InstCombine/
InstCombinePHI.cpp 27 /// adds all have a single use, turn this into a phi and a single binop.
108 BinaryOperator *BinOp = cast<BinaryOperator>(FirstInst);
110 BinaryOperator::Create(BinOp->getOpcode(), LHSVal, RHSVal);
498 // Can fold binop, compare or shift here if the RHS is a constant,
556 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst)) {
557 BinOp = BinaryOperator::Create(BinOp->getOpcode(), PhiVal, ConstantOp);
558 BinOp->copyIRFlags(PN.getIncomingValue(0));
561 BinOp->andIRFlags(PN.getIncomingValue(i));
563 BinOp->setDebugLoc(FirstInst->getDebugLoc())
    [all...]
  /prebuilts/ndk/r13/sources/third_party/shaderc/third_party/glslang/glslang/MachineIndependent/preprocessor/
Pp.cpp 382 } binop[] = { member in namespace:glslang
491 for (op = NUM_ELEMENTS(binop) - 1; op >= 0; op--) {
492 if (binop[op].token == token)
495 if (op < 0 || binop[op].precedence <= precedence)
508 token = eval(token, binop[op].precedence, shortCircuit, res, err, ppToken);
510 if (binop[op].op == op_div || binop[op].op == op_mod) {
516 res = binop[op].op(leftSide, res);
    [all...]
  /art/runtime/interpreter/mterp/out/
mterp_mips.S     [all...]
  /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...]

Completed in 6923 milliseconds

1 2 3 4 5 6 78 91011>>