1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
; RUN: opt < %s "-passes=print<scalar-evolution>" -disable-output 2>&1 | FileCheck %s
define i8 @foo(i8 %a) {
; CHECK-LABEL: 'foo'
; CHECK-NEXT: Classifying expressions for: @foo
; CHECK-NEXT: %t0 = urem i8 %a, 27
; CHECK-NEXT: --> ((-27 * (%a /u 27)) + %a) U: full-set S: full-set
; CHECK-NEXT: Determining loop execution counts for: @foo
;
%t0 = urem i8 %a, 27
ret i8 %t0
}
define i8 @bar(i8 %a) {
; CHECK-LABEL: 'bar'
; CHECK-NEXT: Classifying expressions for: @bar
; CHECK-NEXT: %t1 = urem i8 %a, 1
; CHECK-NEXT: --> 0 U: [0,1) S: [0,1)
; CHECK-NEXT: Determining loop execution counts for: @bar
;
%t1 = urem i8 %a, 1
ret i8 %t1
}
define i8 @baz(i8 %a) {
; CHECK-LABEL: 'baz'
; CHECK-NEXT: Classifying expressions for: @baz
; CHECK-NEXT: %t2 = urem i8 %a, 32
; CHECK-NEXT: --> (zext i5 (trunc i8 %a to i5) to i8) U: [0,32) S: [0,32)
; CHECK-NEXT: Determining loop execution counts for: @baz
;
%t2 = urem i8 %a, 32
ret i8 %t2
}
define i8 @qux(i8 %a) {
; CHECK-LABEL: 'qux'
; CHECK-NEXT: Classifying expressions for: @qux
; CHECK-NEXT: %t3 = urem i8 %a, 2
; CHECK-NEXT: --> (zext i1 (trunc i8 %a to i1) to i8) U: [0,2) S: [0,2)
; CHECK-NEXT: Determining loop execution counts for: @qux
;
%t3 = urem i8 %a, 2
ret i8 %t3
}
define i32 @test_and_not(i32 %arg) {
; CHECK-LABEL: 'test_and_not'
; CHECK-NEXT: Classifying expressions for: @test_and_not
; CHECK-NEXT: %andn = and i32 %arg, -8
; CHECK-NEXT: --> (8 * (%arg /u 8))<nuw> U: [0,-7) S: [-2147483648,2147483641)
; CHECK-NEXT: Determining loop execution counts for: @test_and_not
;
%andn = and i32 %arg, -8
ret i32 %andn
}
define i32 @test_sub_urem(i32 %arg) {
; CHECK-LABEL: 'test_sub_urem'
; CHECK-NEXT: Classifying expressions for: @test_sub_urem
; CHECK-NEXT: %urem = urem i32 %arg, 8
; CHECK-NEXT: --> (zext i3 (trunc i32 %arg to i3) to i32) U: [0,8) S: [0,8)
; CHECK-NEXT: %sub = sub i32 %arg, %urem
; CHECK-NEXT: --> (8 * (%arg /u 8))<nuw> U: [0,-7) S: [-2147483648,2147483641)
; CHECK-NEXT: Determining loop execution counts for: @test_sub_urem
;
%urem = urem i32 %arg, 8
%sub = sub i32 %arg, %urem
ret i32 %sub
}
define i32 @test_trunc_zext(i32 %arg) {
; CHECK-LABEL: 'test_trunc_zext'
; CHECK-NEXT: Classifying expressions for: @test_trunc_zext
; CHECK-NEXT: %trunc = trunc i32 %arg to i3
; CHECK-NEXT: --> (trunc i32 %arg to i3) U: full-set S: full-set
; CHECK-NEXT: %zext = zext i3 %trunc to i32
; CHECK-NEXT: --> (zext i3 (trunc i32 %arg to i3) to i32) U: [0,8) S: [0,8)
; CHECK-NEXT: %sub = sub i32 %arg, %zext
; CHECK-NEXT: --> (8 * (%arg /u 8))<nuw> U: [0,-7) S: [-2147483648,2147483641)
; CHECK-NEXT: Determining loop execution counts for: @test_trunc_zext
;
%trunc = trunc i32 %arg to i3
%zext = zext i3 %trunc to i32
%sub = sub i32 %arg, %zext
ret i32 %sub
}
|
