File: single-backedge.ll

package info (click to toggle)
llvm-2.7 2.7-6
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 59,992 kB
  • ctags: 49,499
  • sloc: cpp: 373,792; ansic: 16,885; sh: 12,614; asm: 6,809; ada: 3,083; ml: 2,942; python: 2,671; perl: 2,404; makefile: 1,691; pascal: 1,235; exp: 399; objc: 291; lisp: 184; csh: 117; xml: 38; f90: 36
file content (20 lines) | stat: -rw-r--r-- 574 bytes parent folder | download | duplicates (2) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
 
; The loop canonicalization pass should guarantee that there is one backedge 
; for all loops.  This allows the -indvars pass to recognize the %IV 
; induction variable in this testcase.

; RUN: opt < %s -indvars -S | grep indvar

define i32 @test(i1 %C) {
; <label>:0
	br label %Loop
Loop:		; preds = %BE2, %BE1, %0
	%IV = phi i32 [ 1, %0 ], [ %IV2, %BE1 ], [ %IV2, %BE2 ]		; <i32> [#uses=2]
	store i32 %IV, i32* null
	%IV2 = add i32 %IV, 2		; <i32> [#uses=2]
	br i1 %C, label %BE1, label %BE2
BE1:		; preds = %Loop
	br label %Loop
BE2:		; preds = %Loop
	br label %Loop
}