• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1; RUN: opt < %s -analyze -enable-new-pm=0 -scalar-evolution | FileCheck %s
2; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" 2>&1 | FileCheck %s
3
4define void @merge_values_with_ranges(i32 *%a_len_ptr, i32 *%b_len_ptr, i1 %unknown_cond) {
5
6; CHECK-LABEL: Classifying expressions for: @merge_values_with_ranges
7; CHECK:       %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
8; CHECK-NEXT:  -->  %len U: [0,2147483647) S: [0,2147483647)
9
10 entry:
11  br i1 %unknown_cond, label %if.true, label %if.false
12
13if.true:
14  %len_a = load i32, i32* %a_len_ptr, !range !0
15  br label %merge
16
17if.false:
18  %len_b = load i32, i32* %b_len_ptr, !range !0
19  br label %merge
20
21merge:
22  %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
23  ret void
24}
25
26define void @merge_values_with_ranges_looped(i32 *%a_len_ptr, i32 *%b_len_ptr) {
27
28; TODO: We could be much smarter here. So far we just make sure that we do not
29;       go into infinite loop analyzing these Phis.
30
31; CHECK-LABEL: Classifying expressions for: @merge_values_with_ranges_looped
32; CHECK:       %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
33; CHECK-NEXT:  -->  %p1 U: full-set S: full-set
34; CHECK:         %p2 = phi i32 [ %len_b, %entry ], [ %p1, %loop ]
35; CHECK-NEXT:  -->  %p2 U: full-set S: full-set
36
37 entry:
38  %len_a = load i32, i32* %a_len_ptr, !range !0
39  %len_b = load i32, i32* %b_len_ptr, !range !0
40  br label %loop
41
42loop:
43  %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
44  %p2 = phi i32 [ %len_b, %entry ], [ %p1, %loop ]
45  %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ]
46  %iv.next = add i32 %iv, 1
47  %loop.cond = icmp slt i32 %iv.next, 100
48  br i1 %loop.cond, label %loop, label %exit
49
50exit:
51  ret void
52}
53
54
55!0 = !{i32 0, i32 2147483647}
56