File: share_ivs.ll

package info (click to toggle)
llvm 2.6-9.1
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 57,604 kB
  • ctags: 44,336
  • sloc: cpp: 344,766; sh: 12,407; ansic: 10,617; ada: 3,070; ml: 2,505; perl: 2,496; makefile: 1,426; pascal: 1,163; exp: 389; asm: 307; python: 298; objc: 260; lisp: 182; csh: 117; xml: 38; f90: 36; tcl: 20
file content (24 lines) | stat: -rw-r--r-- 762 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
 
; RUN: llvm-as < %s | opt -loop-reduce | llvm-dis | grep phi | count 1

; This testcase should have ONE stride 18 indvar, the other use should have a
; loop invariant value (B) added to it inside of the loop, instead of having
; a whole indvar based on B for it.

declare i1 @cond(i32)

define void @test(i32 %B) {
; <label>:0
	br label %Loop
Loop:		; preds = %Loop, %0
	%IV = phi i32 [ 0, %0 ], [ %IVn, %Loop ]		; <i32> [#uses=3]
	%C = mul i32 %IV, 18		; <i32> [#uses=1]
	%D = mul i32 %IV, 18		; <i32> [#uses=1]
	%E = add i32 %D, %B		; <i32> [#uses=1]
	%cnd = call i1 @cond( i32 %E )		; <i1> [#uses=1]
	call i1 @cond( i32 %C )		; <i1>:1 [#uses=0]
	%IVn = add i32 %IV, 1		; <i32> [#uses=1]
	br i1 %cnd, label %Loop, label %Out
Out:		; preds = %Loop
	ret void
}