| /external/llvm/test/CodeGen/ARM/Windows/ |
| overflow.ll | 47 %6 = udiv i32 4294967296, %3
66 %6 = udiv i64 18446744073709551616, %3
|
| /external/llvm/test/CodeGen/SPARC/ |
| basictest.ll | 50 ; CHECK: udiv %o0, %o1, %o0
52 %r = udiv i32 %a, %b
|
| /external/llvm/test/MC/ARM/ |
| directive-arch_extension-idiv.s | 26 udiv r0, r1, r2
43 udiv r0, r1, r2
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| exit_value_test2.ll | 5 ; udiv will be introduced by expand and the cost will be high.
8 ; CHECK-NOT: udiv
|
| /external/llvm/test/Transforms/PhaseOrdering/ |
| scev.ll | 13 %div = udiv i64 %d, 4
42 %div = udiv i64 %d, 2
|
| /external/llvm/test/CodeGen/AArch64/ |
| dp2.ll | 55 %val4_tmp = udiv i64 %val0_tmp, %val1_tmp
56 ; CHECK: udiv {{x[0-9]+}}, {{x[0-9]+}}, {{x[0-9]+}}
133 %val4_tmp = udiv i32 %val0_tmp, %val1_tmp
134 ; CHECK: udiv {{w[0-9]+}}, {{w[0-9]+}}, {{w[0-9]+}}
|
| /external/llvm/test/CodeGen/MSP430/ |
| 2009-11-20-NewNode.ll | 14 %div = udiv i64 %cond66, %conv69 ; <i64> [#uses=1]
|
| /external/llvm/test/CodeGen/PowerPC/ |
| 2008-03-26-CoalescerBug.ll | 7 %tmp53 = udiv i64 %byteStart, %tmp5051 ; <i64> [#uses=1]
|
| /external/llvm/test/CodeGen/X86/ |
| 2010-03-04-Mul8Bug.ll | 13 %div.i = udiv i8 %conv49, 5 ; <i8> [#uses=1]
|
| div8.ll | 18 %div = udiv i8 %tmp, %tmp1
|
| phys_subreg_coalesce-2.ll | 24 %div = udiv i32 %mul, %divisor.02 ; <i32> [#uses=2]
|
| scalar_widen_div.ll | 54 %div.r = udiv <3 x i8> %num, %div
79 %div.r = udiv <4 x i16> %num, %div
90 %div.r = udiv <3 x i32> %num, %div
112 %div.r = udiv <3 x i64> %num, %div
|
| 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/LoopUnroll/PowerPC/ |
| a2-high-cost-trip-count-computation.ll | 10 ; CHECK: udiv
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| high-cost-trip-count-computation.ll | 10 ; CHECK-NOT: udiv
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| 2008-01-02-hoist-fp-add.ll | 18 %tmp7 = udiv i32 %tmp, %Z ; <i32> [#uses=1]
|
| /external/llvm/test/CodeGen/AMDGPU/ |
| udivrem64.ll | 74 %result = udiv i64 %x, %y
165 %result = udiv i64 %1, %2
201 %result = udiv i64 %1, %2
|
| /prebuilts/go/darwin-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) {
450 uq, ur := udiv(ux, uy)
|
| /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) {
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)
786 /// instructions (udiv and sdiv). It is called by the visitors to those integer
872 if (*C2 != 0) { // avoid X udiv 0
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| exact.ll | 57 %y = udiv exact i32 %x, %w
67 %z = udiv exact i32 %x, %y
119 %A = udiv exact i64 %X, 5 ; X/5
|
| /external/llvm/test/Transforms/InstSimplify/ |
| undef.ll | 55 %r = udiv i64 undef, 1
167 %b = udiv i32 %a, 0
195 %b = udiv i32 undef, 0
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| avoid-infinite-recursion-0.ll | 21 %7 = udiv i64 undef, %6 ; <i64> [#uses=1]
|
| /external/llvm/test/Transforms/JumpThreading/ |
| pr9331.ll | 28 %div.i = udiv i64 %xor, %conv23
|
