HomeSort by relevance Sort by last modified time
    Searched full:udiv (Results 201 - 225 of 952) sorted by null

1 2 3 4 5 6 7 891011>>

  /prebuilts/go/linux-x86/test/
divmod.go 130 q, r := udiv(uint64(x), uint64(y))
147 q, r := udiv(x, y)
164 q, r := udiv(uint64(x), uint64(y))
181 q, r := udiv(uint64(x), uint64(y))
198 q, r := udiv(uint64(x), uint64(y))
419 func udiv(x, y uint64) (q, r uint64) { func
450 uq, ur := udiv(ux, uy)
  /external/llvm/lib/Transforms/InstCombine/
InstCombineMulDivRem.cpp 10 // This file implements the visit functions for mul, fmul, sdiv, udiv, fdiv,
310 (BO->getOpcode() != Instruction::UDiv &&
318 (BO->getOpcode() == Instruction::UDiv ||
331 if (BO->getOpcode() == Instruction::UDiv)
800 /// instructions (udiv and sdiv). It is called by the visitors to those integer
886 if (*C2 != 0) { // avoid X udiv 0
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/
Operator.h 124 /// PossiblyExactOperator - A udiv or sdiv instruction, which can be marked as
149 OpC == Instruction::UDiv ||
211 : public ConcreteOperator<PossiblyExactOperator, Instruction::UDiv> {
  /external/llvm/lib/Target/ARM/
ARMTargetTransformInfo.cpp 67 if ((Opcode == Instruction::SDiv || Opcode == Instruction::UDiv ||
427 { ISD::UDIV, MVT::v1i64, 1 * FunctionCallDivCost},
431 { ISD::UDIV, MVT::v2i32, 2 * FunctionCallDivCost},
435 { ISD::UDIV, MVT::v4i16, ReciprocalDivCost},
439 { ISD::UDIV, MVT::v8i8, ReciprocalDivCost},
444 { ISD::UDIV, MVT::v2i64, 2 * FunctionCallDivCost},
448 { ISD::UDIV, MVT::v4i32, 4 * FunctionCallDivCost},
452 { ISD::UDIV, MVT::v8i16, 8 * FunctionCallDivCost},
456 { ISD::UDIV, MVT::v16i8, 16 * FunctionCallDivCost},
  /external/llvm/test/Analysis/ScalarEvolution/
avoid-infinite-recursion-0.ll 21 %7 = udiv i64 undef, %6 ; <i64> [#uses=1]
  /external/llvm/test/CodeGen/X86/
2008-04-16-CoalescerBug.ll 29 %tmp93.us = udiv i32 %tmp92.us, 255 ; <i32> [#uses=1]
pr2659.ll 37 %div = udiv i32 %mul, %divisor.02 ; <i32> [#uses=2]
  /external/llvm/test/Transforms/InstCombine/
exact.ll 76 %y = udiv exact i32 %x, %w
87 %z = udiv exact i32 %x, %y
143 %A = udiv exact i64 %X, 5 ; X/5
153 %A = udiv exact i64 %X, 5 ; X/5 == 0 --> x == 0
  /external/llvm/test/Transforms/JumpThreading/
pr9331.ll 28 %div.i = udiv i64 %xor, %conv23
  /external/llvm/test/Transforms/PhaseOrdering/
basic.ll 33 %div = udiv i32 %a, 4
  /external/llvm/test/Transforms/SimplifyCFG/
multiple-phis.ll 23 %div = udiv i32 %add, 2
  /external/swiftshader/third_party/LLVM/test/Analysis/ScalarEvolution/
avoid-infinite-recursion-0.ll 21 %7 = udiv i64 undef, %6 ; <i64> [#uses=1]
  /external/swiftshader/third_party/LLVM/test/CodeGen/ARM/
divmod.ll 21 %div = udiv i32 %x, %y
  /external/swiftshader/third_party/LLVM/test/CodeGen/X86/
2008-04-16-CoalescerBug.ll 29 %tmp93.us = udiv i32 %tmp92.us, 255 ; <i32> [#uses=1]
pr2659.ll 36 %div = udiv i32 %mul, %divisor.02 ; <i32> [#uses=2]
  /external/swiftshader/third_party/LLVM/test/Transforms/InstSimplify/
undef.ll 55 %r = udiv i64 undef, 1
  /external/swiftshader/third_party/LLVM/test/Transforms/JumpThreading/
pr9331.ll 28 %div.i = udiv i64 %xor, %conv23
  /external/swiftshader/third_party/subzero/pydir/
gen_test_arith_ll.py 47 for op in ['add', 'sub', 'mul', 'sdiv', 'udiv', 'srem', 'urem', 'shl', 'lshr',
  /external/swiftshader/third_party/subzero/tests_lit/assembler/arm32/
trap.ll 44 %res = udiv i32 %v1, %v2
  /external/swiftshader/third_party/subzero/tests_lit/llvm2ice_tests/
div_legalization.ll 50 %div = udiv i32 %a, 3456
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Target/GlobalISel/
SelectionDAGCompat.td 43 def : GINodeEquiv<G_UDIV, udiv>;
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Target/GlobalISel/
SelectionDAGCompat.td 43 def : GINodeEquiv<G_UDIV, udiv>;
  /prebuilts/go/darwin-x86/src/cmd/internal/obj/arm64/
anames.go 225 "UDIV",
  /prebuilts/go/linux-x86/src/cmd/internal/obj/arm64/
anames.go 225 "UDIV",
  /device/linaro/bootloader/arm-trusted-firmware/common/aarch32/
debug.S 120 udiv r0, r4, r5 /* Quotient */
124 udiv r5, r5, r6 /* Reduce divisor */

Completed in 400 milliseconds

1 2 3 4 5 6 7 891011>>