OLD | NEW |
1 ; RUN: opt %s -expand-mul-with-overflow -S | FileCheck %s | 1 ; RUN: opt %s -expand-arith-with-overflow -S | FileCheck %s |
2 | 2 |
3 declare {i32, i1} @llvm.umul.with.overflow.i32(i32, i32) | 3 declare {i32, i1} @llvm.umul.with.overflow.i32(i32, i32) |
4 declare {i64, i1} @llvm.umul.with.overflow.i64(i64, i64) | 4 declare {i64, i1} @llvm.umul.with.overflow.i64(i64, i64) |
| 5 declare {i16, i1} @llvm.uadd.with.overflow.i16(i16, i16) |
5 | 6 |
6 ; CHECK-NOT: @llvm.umul.with.overflow | 7 ; CHECK-NOT: with.overflow |
7 | 8 |
8 | 9 |
9 define void @umul32_by_const(i32 %x, i32* %result_val, i1* %result_overflow) { | 10 define void @umul32_by_const(i32 %x, i32* %result_val, i1* %result_overflow) { |
10 %pair = call {i32, i1} @llvm.umul.with.overflow.i32(i32 %x, i32 256) | 11 %pair = call {i32, i1} @llvm.umul.with.overflow.i32(i32 %x, i32 256) |
11 %val = extractvalue {i32, i1} %pair, 0 | 12 %val = extractvalue {i32, i1} %pair, 0 |
12 %overflow = extractvalue {i32, i1} %pair, 1 | 13 %overflow = extractvalue {i32, i1} %pair, 1 |
13 | 14 |
14 store i32 %val, i32* %result_val | 15 store i32 %val, i32* %result_val |
15 store i1 %overflow, i1* %result_overflow | 16 store i1 %overflow, i1* %result_overflow |
16 ret void | 17 ret void |
17 } | 18 } |
18 | 19 |
19 ; The bound is 16777215 == 0xffffff == ((1 << 32) - 1) / 256 | 20 ; The bound is 16777215 == 0xffffff == ((1 << 32) - 1) / 256 |
20 ; CHECK: define void @umul32_by_const( | 21 ; CHECK: define void @umul32_by_const( |
21 ; CHECK-NEXT: %pair.mul = mul i32 %x, 256 | 22 ; CHECK-NEXT: %pair.arith = mul i32 %x, 256 |
22 ; CHECK-NEXT: %pair.overflow = icmp ugt i32 %x, 16777215 | 23 ; CHECK-NEXT: %pair.overflow = icmp ugt i32 %x, 16777215 |
23 ; CHECK-NEXT: store i32 %pair.mul, i32* %result_val | 24 ; CHECK-NEXT: store i32 %pair.arith, i32* %result_val |
24 ; CHECK-NEXT: store i1 %pair.overflow, i1* %result_overflow | 25 ; CHECK-NEXT: store i1 %pair.overflow, i1* %result_overflow |
25 | 26 |
26 | 27 |
27 ; Check that the pass can expand multiple uses of the same intrinsic. | 28 ; Check that the pass can expand multiple uses of the same intrinsic. |
28 define void @umul32_by_const2(i32 %x, i32* %result_val, i1* %result_overflow) { | 29 define void @umul32_by_const2(i32 %x, i32* %result_val, i1* %result_overflow) { |
29 %pair = call {i32, i1} @llvm.umul.with.overflow.i32(i32 %x, i32 65536) | 30 %pair = call {i32, i1} @llvm.umul.with.overflow.i32(i32 %x, i32 65536) |
30 %val = extractvalue {i32, i1} %pair, 0 | 31 %val = extractvalue {i32, i1} %pair, 0 |
31 ; Check that the pass can expand multiple uses of %pair. | 32 ; Check that the pass can expand multiple uses of %pair. |
32 %overflow1 = extractvalue {i32, i1} %pair, 1 | 33 %overflow1 = extractvalue {i32, i1} %pair, 1 |
33 %overflow2 = extractvalue {i32, i1} %pair, 1 | 34 %overflow2 = extractvalue {i32, i1} %pair, 1 |
34 | 35 |
35 store i32 %val, i32* %result_val | 36 store i32 %val, i32* %result_val |
36 store i1 %overflow1, i1* %result_overflow | 37 store i1 %overflow1, i1* %result_overflow |
37 store i1 %overflow2, i1* %result_overflow | 38 store i1 %overflow2, i1* %result_overflow |
38 ret void | 39 ret void |
39 } | 40 } |
40 | 41 |
41 ; CHECK: define void @umul32_by_const2( | 42 ; CHECK: define void @umul32_by_const2( |
42 ; CHECK-NEXT: %pair.mul = mul i32 %x, 65536 | 43 ; CHECK-NEXT: %pair.arith = mul i32 %x, 65536 |
43 ; CHECK-NEXT: %pair.overflow = icmp ugt i32 %x, 65535 | 44 ; CHECK-NEXT: %pair.overflow = icmp ugt i32 %x, 65535 |
44 ; CHECK-NEXT: store i32 %pair.mul, i32* %result_val | 45 ; CHECK-NEXT: store i32 %pair.arith, i32* %result_val |
45 ; CHECK-NEXT: store i1 %pair.overflow, i1* %result_overflow | 46 ; CHECK-NEXT: store i1 %pair.overflow, i1* %result_overflow |
46 ; CHECK-NEXT: store i1 %pair.overflow, i1* %result_overflow | 47 ; CHECK-NEXT: store i1 %pair.overflow, i1* %result_overflow |
47 | 48 |
48 | 49 |
49 define void @umul64_by_const(i64 %x, i64* %result_val, i1* %result_overflow) { | 50 define void @umul64_by_const(i64 %x, i64* %result_val, i1* %result_overflow) { |
50 ; Multiply by 1 << 55. | 51 ; Multiply by 1 << 55. |
51 %pair = call {i64, i1} @llvm.umul.with.overflow.i64(i64 36028797018963968, i64
%x) | 52 %pair = call {i64, i1} @llvm.umul.with.overflow.i64(i64 36028797018963968, i64
%x) |
52 %val = extractvalue {i64, i1} %pair, 0 | 53 %val = extractvalue {i64, i1} %pair, 0 |
53 %overflow = extractvalue {i64, i1} %pair, 1 | 54 %overflow = extractvalue {i64, i1} %pair, 1 |
54 | 55 |
55 store i64 %val, i64* %result_val | 56 store i64 %val, i64* %result_val |
56 store i1 %overflow, i1* %result_overflow | 57 store i1 %overflow, i1* %result_overflow |
57 ret void | 58 ret void |
58 } | 59 } |
59 | 60 |
60 ; CHECK: define void @umul64_by_const(i64 %x, i64* %result_val, i1* %result_over
flow) { | 61 ; CHECK: define void @umul64_by_const(i64 %x, i64* %result_val, i1* %result_over
flow) { |
61 ; CHECK-NEXT: %pair.mul = mul i64 %x, 36028797018963968 | 62 ; CHECK-NEXT: %pair.arith = mul i64 %x, 36028797018963968 |
62 ; CHECK-NEXT: %pair.overflow = icmp ugt i64 %x, 511 | 63 ; CHECK-NEXT: %pair.overflow = icmp ugt i64 %x, 511 |
63 ; CHECK-NEXT: store i64 %pair.mul, i64* %result_val | 64 ; CHECK-NEXT: store i64 %pair.arith, i64* %result_val |
64 ; CHECK-NEXT: store i1 %pair.overflow, i1* %result_overflow | 65 ; CHECK-NEXT: store i1 %pair.overflow, i1* %result_overflow |
| 66 |
| 67 |
| 68 define void @uadd16_with_const(i16 %x, i16* %result_val, i1* %result_overflow) { |
| 69 %pair = call {i16, i1} @llvm.uadd.with.overflow.i16(i16 %x, i16 35) |
| 70 %val = extractvalue {i16, i1} %pair, 0 |
| 71 %overflow = extractvalue {i16, i1} %pair, 1 |
| 72 |
| 73 store i16 %val, i16* %result_val |
| 74 store i1 %overflow, i1* %result_overflow |
| 75 ret void |
| 76 } |
| 77 ; CHECK: define void @uadd16_with_const(i16 %x, i16* %result_val, i1* %result_ov
erflow) { |
| 78 ; CHECK-NEXT: %pair.arith = add i16 %x, 35 |
| 79 ; CHECK-NEXT: %pair.overflow = icmp ugt i16 %x, -36 |
| 80 ; CHECK-NEXT: store i16 %pair.arith, i16* %result_val |
| 81 ; CHECK-NEXT: store i1 %pair.overflow, i1* %result_overflow |
OLD | NEW |