File: share_ivs.ll

package info (click to toggle)
llvm-toolchain-14 1%3A14.0.6-12
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,496,180 kB
  • sloc: cpp: 5,593,972; ansic: 986,872; asm: 585,869; python: 184,223; objc: 72,530; lisp: 31,119; f90: 27,793; javascript: 9,780; pascal: 9,762; sh: 9,482; perl: 7,468; ml: 5,432; awk: 3,523; makefile: 2,538; xml: 953; cs: 573; fortran: 567
file content (24 lines) | stat: -rw-r--r-- 744 bytes parent folder | download | duplicates (41) 
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: opt < %s -loop-reduce -S | 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
}