| /external/llvm/test/Transforms/InstCombine/ |
| 2008-11-27-UDivNegative.ll | 4 %A = udiv i8 %x, 250
|
| udiv-simplify-bug-1.ll | 2 ; RUN: grep udiv %t1.ll | count 2
6 ; The udiv instructions shouldn't be optimized away, and the
11 %r = udiv i32 %y, %g
17 %r = udiv i32 %y, %v
|
| udiv_select_to_select_shift.ll | 2 ; udiv X, (Select Cond, C1, C2) --> Select Cond, (shr X, C1), (shr X, C2)
7 ; RUN: not grep udiv %t
12 %quotient1 = udiv i64 %X, %divisor1
14 %quotient2 = udiv i64 %X, %divisor2
|
| apint-div1.ll | 8 %Y = udiv i33 %X, 4096
14 %Y = udiv i49 %X, %tmp.0
20 %R = udiv i59 %X, %V
|
| apint-div2.ll | 8 %Y = udiv i333 %X, 70368744177664
14 %Y = udiv i499 %X, %tmp.0
20 %R = udiv i599 %X, %V
|
| 2012-08-28-udiv_ashl.ll | 9 ; CHECK: udiv i32 %x, 400
14 %div1 = udiv i32 %div, 100
26 %div1 = udiv i32 %div, 100
31 ; CHECK: udiv i32 %x, 400
37 ; unsigned inputs), turn this into a udiv.
45 ; CHECK: udiv i80 %x, 400
49 %div1 = udiv i80 %div, 100
55 %div1 = udiv i32 %div, 100
|
| udiv-simplify-bug-0.ll | 5 %r = udiv i32 %y, -1
11 %r = udiv i32 %y, 3
|
| 2007-06-21-DivCompareMiscomp.ll | 5 %tmp470 = udiv i32 %tmp468, 4 ; <i32> [#uses=2]
|
| div-shift.ll | 17 ; CHECK-NOT: udiv
21 %3 = udiv i64 %x, %2
28 ; CHECK-NOT: udiv
35 %3 = udiv i64 %x, %2
|
| urem.ll | 4 %r = udiv i64 %x1, %y2
|
| 2008-11-20-DivMulRem.ll | 6 %A = udiv i8 %x, %y
26 %A = udiv i8 %x, %y
37 %A = udiv i8 %x, 3
61 %div = udiv i32 %x, %y
62 ; CHECK-NEXT: udiv
64 %r = udiv i32 %mul, %y
|
| udivrem-change-width.ll | 9 %div = udiv i32 %conv, %conv2
13 ; CHECK: udiv i8 %a, %b
29 %div = udiv i32 %conv, %conv2
32 ; CHECK: udiv i8 %a, %b
48 %div = udiv i32 %conv, 10
51 ; CHECK: udiv i8 %a, 10
|
| 2008-07-13-DivZero.ll | 5 ; We can simplify the operand of udiv to '8', but not the operand to the
12 %div = udiv i32 %x, %cond ; <i32> [#uses=1]
|
| 2005-04-07-UDivSelectCrash.ll | 5 %tmp.18 = udiv i32 %tmp.15, %tmp.16 ; <i32> [#uses=1]
|
| 2008-11-27-IDivVector.ll | 4 %A = udiv <2 x i8> %x, <i8 1, i8 1>
|
| div.ll | 14 %B = udiv i32 %A, 8 ; <i32> [#uses=1]
37 %B = udiv i32 %A, -16 ; <i32> [#uses=1]
38 %C = udiv i32 %B, -4 ; <i32> [#uses=1]
45 %B = udiv i32 %A, 123 ; <i32> [#uses=1]
54 %B = udiv i32 %A, 10 ; <i32> [#uses=1]
64 %B = udiv i8 %A, 123 ; <i8> [#uses=1]
73 %B = udiv i8 %A, 123 ; <i8> [#uses=1]
83 %R = udiv i32 %X, %V ; <i32> [#uses=1]
92 %B = udiv i32 %X, %A ; <i32> [#uses=1]
101 %tmp3 = udiv i32 %x, %x ;
[all...] |
| /external/llvm/test/CodeGen/R600/ |
| udiv.v4i32.ll | 3 ;The code generated by udiv is long and complex and may frequently change.
5 ;a v4i32 udiv
12 %result = udiv <4 x i32> %a, %b
|
| /external/llvm/test/CodeGen/X86/ |
| x86_64-mul-by-const.ll | 7 %tmp1 = udiv i32 %A, 1577682821 ; <i32> [#uses=1]
|
| anyext.ll | 7 %r = udiv i8 %q, %x
14 %r = udiv i16 %q, %x
|
| vec_udiv_to_shift.ll | 6 %0 = udiv <8 x i16> %var, <i16 32, i16 32, i16 32, i16 32, i16 32, i16 32, i16 32, i16 32>
13 %0 = udiv <4 x i32> %var, <i32 16, i32 16, i32 16, i32 16>
|
| divide-by-constant.ll | 7 %div = udiv i16 %x, 33
17 %div = udiv i16 %c, 3
28 %div = udiv i8 %c, 3
47 %tmp1 = udiv i32 %A, 1577682821 ; <i32> [#uses=1]
65 %div = udiv i32 %x, 28
77 %div = udiv i8 %x, 78
87 %div = udiv i8 %x, 116
|
| /external/llvm/test/CodeGen/Thumb2/ |
| div.ll | 25 ; CHECK-THUMBV7M: udiv
27 ; CHECK-SWIFT-T2: udiv
28 %tmp1 = udiv i32 %a, %b ; <i32> [#uses=1]
49 ; CHECK-THUMBV7M: udiv
51 ; CHECK-SWIFT-T2: udiv
|
| /external/llvm/test/CodeGen/ARM/ |
| div.ll | 21 ; CHECK-SWIFT: udiv
22 %tmp1 = udiv i32 %a, %b ; <i32> [#uses=1]
44 ; CHECK-SWIFT: udiv
|
| /external/clang/test/CodeGen/ |
| BasicInstrs.c | 6 unsigned int udiv(unsigned int X, unsigned int Y) { function
|
| /external/llvm/test/CodeGen/Hexagon/ |
| macint.ll | 9 %div = udiv i32 %0, 10000
|
