Mercurial > hg > CbC > CbC_llvm

comparison test/Transforms/IndVarSimplify/tripcount_infinite.ll @ 0:95c75e76d11b LLVM3.4

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
LLVM 3.4
author Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
date Thu, 12 Dec 2013 13:56:28 +0900
parents
children afa8332a0e37
comparison
equal deleted inserted replaced
-1:000000000000 0:95c75e76d11b
1 ; These tests have an infinite trip count. We obviously shouldn't remove the
2 ; loops! :)
3 ;
4 ; RUN: opt < %s -indvars -adce -simplifycfg -S | grep icmp | wc -l > %t2
5 ; RUN: llvm-as < %s | llvm-dis | grep icmp | wc -l > %t1
6 ; RUN: diff %t1 %t2
7
8 ;; test for (i = 1; i != 100; i += 2)
9 define i32 @infinite_linear() {
10 entry:
11 br label %loop
12
13 loop: ; preds = %loop, %entry
14 %i = phi i32 [ 1, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
15 %i.next = add i32 %i, 2 ; <i32> [#uses=1]
16 %c = icmp ne i32 %i, 100 ; <i1> [#uses=1]
17 br i1 %c, label %loop, label %loopexit
18
19 loopexit: ; preds = %loop
20 ret i32 %i
21 }
22
23 ;; test for (i = 1; i*i != 63; ++i)
24 define i32 @infinite_quadratic() {
25 entry:
26 br label %loop
27
28 loop: ; preds = %loop, %entry
29 %i = phi i32 [ 1, %entry ], [ %i.next, %loop ] ; <i32> [#uses=4]
30 %isquare = mul i32 %i, %i ; <i32> [#uses=1]
31 %i.next = add i32 %i, 1 ; <i32> [#uses=1]
32 %c = icmp ne i32 %isquare, 63 ; <i1> [#uses=1]
33 br i1 %c, label %loop, label %loopexit
34
35 loopexit: ; preds = %loop
36 ret i32 %i
37 }
38