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
|
; These tests have an infinite trip count. We obviously shouldn't remove the
; loops! :)
;
; RUN: opt < %s -indvars -adce -simplifycfg -simplifycfg-require-and-preserve-domtree=1 -S | FileCheck %s
;; test for (i = 1; i != 100; i += 2)
define i32 @infinite_linear() {
; CHECK-LABEL: @infinite_linear(
entry:
br label %loop
loop: ; preds = %loop, %entry
; CHECK-LABEL: loop:
%i = phi i32 [ 1, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
%i.next = add i32 %i, 2 ; <i32> [#uses=1]
%c = icmp ne i32 %i, 100 ; <i1> [#uses=1]
; CHECK: icmp
; CHECK: br
br i1 %c, label %loop, label %loopexit
loopexit: ; preds = %loop
; CHECK-LABEL: loopexit:
ret i32 %i
}
;; test for (i = 1; i*i != 63; ++i)
define i32 @infinite_quadratic() {
; CHECK-LABEL: @infinite_quadratic(
entry:
br label %loop
loop: ; preds = %loop, %entry
; CHECK-LABEL: loop:
%i = phi i32 [ 1, %entry ], [ %i.next, %loop ] ; <i32> [#uses=4]
%isquare = mul i32 %i, %i ; <i32> [#uses=1]
%i.next = add i32 %i, 1 ; <i32> [#uses=1]
%c = icmp ne i32 %isquare, 63 ; <i1> [#uses=1]
; CHECK: icmp
; CHECK: br
br i1 %c, label %loop, label %loopexit
loopexit: ; preds = %loop
; CHECK-LABEL: loopexit:
ret i32 %i
}
|
