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
|
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 2
; RUN: opt -passes='print<scalar-evolution>' -disable-output %s 2>&1 | FileCheck %s
define i64 @alloca_non_null() {
; CHECK-LABEL: 'alloca_non_null'
; CHECK-NEXT: Classifying expressions for: @alloca_non_null
; CHECK-NEXT: %alloca = alloca i32, align 4
; CHECK-NEXT: --> %alloca U: [4,-7) S: [-9223372036854775808,9223372036854775805)
; CHECK-NEXT: %int = ptrtoint ptr %alloca to i64
; CHECK-NEXT: --> (ptrtoint ptr %alloca to i64) U: [4,-7) S: [-9223372036854775808,9223372036854775805)
; CHECK-NEXT: Determining loop execution counts for: @alloca_non_null
;
%alloca = alloca i32, align 4
%int = ptrtoint ptr %alloca to i64
ret i64 %int
}
define i64 @alloca_maybe_null() {
; CHECK-LABEL: 'alloca_maybe_null'
; CHECK-NEXT: Classifying expressions for: @alloca_maybe_null
; CHECK-NEXT: %alloca = alloca i32, align 4, addrspace(1)
; CHECK-NEXT: --> %alloca U: [0,-7) S: [-9223372036854775808,9223372036854775805)
; CHECK-NEXT: %int = ptrtoint ptr addrspace(1) %alloca to i64
; CHECK-NEXT: --> (ptrtoint ptr addrspace(1) %alloca to i64) U: [0,-7) S: [-9223372036854775808,9223372036854775805)
; CHECK-NEXT: Determining loop execution counts for: @alloca_maybe_null
;
%alloca = alloca i32, align 4, addrspace(1)
%int = ptrtoint ptr addrspace(1) %alloca to i64
ret i64 %int
}
define void @alloca_icmp_null_exit_count() {
; CHECK-LABEL: 'alloca_icmp_null_exit_count'
; CHECK-NEXT: Classifying expressions for: @alloca_icmp_null_exit_count
; CHECK-NEXT: %alloca = alloca [3 x i32], align 4
; CHECK-NEXT: --> %alloca U: [4,-15) S: [-9223372036854775808,9223372036854775805)
; CHECK-NEXT: %alloca.end = getelementptr inbounds i32, ptr %alloca, i64 3
; CHECK-NEXT: --> (12 + %alloca)<nuw> U: [16,-3) S: [-9223372036854775808,9223372036854775805)
; CHECK-NEXT: %ptr = phi ptr [ %ptr.next, %loop ], [ %alloca, %entry ]
; CHECK-NEXT: --> {%alloca,+,4}<nuw><%loop> U: [4,-7) S: [-9223372036854775808,9223372036854775805) Exits: (8 + %alloca)<nuw> LoopDispositions: { %loop: Computable }
; CHECK-NEXT: %ptr.next = getelementptr i32, ptr %ptr, i64 1
; CHECK-NEXT: --> {(4 + %alloca)<nuw>,+,4}<nuw><%loop> U: [8,-3) S: [-9223372036854775808,9223372036854775805) Exits: (12 + %alloca)<nuw> LoopDispositions: { %loop: Computable }
; CHECK-NEXT: %and = and i1 %cmp1, %cmp2
; CHECK-NEXT: --> (%cmp2 umin %cmp1) U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: Determining loop execution counts for: @alloca_icmp_null_exit_count
; CHECK-NEXT: Loop %loop: backedge-taken count is 2
; CHECK-NEXT: Loop %loop: constant max backedge-taken count is 2
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 2
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 2
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 3
;
entry:
%alloca = alloca [3 x i32], align 4
%alloca.end = getelementptr inbounds i32, ptr %alloca, i64 3
br label %loop
loop:
%ptr = phi ptr [ %ptr.next, %loop ], [ %alloca, %entry ]
%ptr.next = getelementptr i32, ptr %ptr, i64 1
%cmp1 = icmp ne ptr %ptr.next, %alloca.end
%cmp2 = icmp ne ptr %ptr.next, null
%and = and i1 %cmp1, %cmp2
br i1 %and, label %loop, label %exit
exit:
ret void
}
|
