File: tripcount_infinite.llx

package info (click to toggle)
llvm 2.2-12
  • links: PTS, VCS
  • area: main
  • in suites: lenny
  • size: 38,648 kB
  • ctags: 28,258
  • sloc: cpp: 215,479; sh: 12,132; ansic: 10,002; yacc: 5,525; perl: 2,352; ml: 1,580; makefile: 956; pascal: 718; lex: 602; exp: 320; ada: 193; lisp: 160; csh: 116; objc: 59; python: 59; tcl: 20
file content (32 lines) | stat: -rw-r--r-- 926 bytes parent folder | download
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
; These tests have an infinite trip count.  We obviously shouldn't remove the 
; loops!  :)
;
; RUN: llvm-upgrade < %s | llvm-as | opt -indvars -adce -simplifycfg | llvm-dis | grep icmp | wc -l > %t2
; RUN: llvm-upgrade < %s | llvm-as | llvm-dis | grep icmp | wc -l > %t1
; RUN: diff %t1 %t2

int %infinite_linear() {   ;; test for (i = 1; i != 100; i += 2)
entry:
        br label %loop
loop:
        %i = phi int [ 1, %entry ], [ %i.next, %loop ]
        %i.next = add int %i, 2
        %c = setne int %i, 100
        br bool %c, label %loop, label %loopexit
loopexit:
        ret int %i
}

int %infinite_quadratic() {   ;; test for (i = 1; i*i != 63; ++i)
entry:
        br label %loop
loop:
        %i = phi int [ 1, %entry ], [ %i.next, %loop ]
	%isquare = mul int %i, %i
        %i.next = add int %i, 1
        %c = setne int %isquare, 63
        br bool %c, label %loop, label %loopexit
loopexit:
        ret int %i
}