File: 2003-10-05-DeadPHIInsertion.ll

package info (click to toggle)
llvm-toolchain-9 1%3A9.0.1-16.1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 882,388 kB
  • sloc: cpp: 4,167,636; ansic: 714,256; asm: 457,610; python: 155,927; objc: 65,094; sh: 42,856; lisp: 26,908; perl: 7,786; pascal: 7,722; makefile: 6,881; ml: 5,581; awk: 3,648; cs: 2,027; xml: 888; javascript: 381; ruby: 156
file content (22 lines) | stat: -rw-r--r-- 613 bytes parent folder | download | duplicates (18)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
; Mem2reg should not insert dead PHI nodes!  The naive algorithm inserts a PHI
;  node in L3, even though there is no load of %A in anything dominated by L3.

; RUN: opt < %s -mem2reg -S | not grep phi

define void @test(i32 %B, i1 %C) {
	%A = alloca i32		; <i32*> [#uses=4]
	store i32 %B, i32* %A
	br i1 %C, label %L1, label %L2
L1:		; preds = %0
	store i32 %B, i32* %A
	%D = load i32, i32* %A		; <i32> [#uses=1]
	call void @test( i32 %D, i1 false )
	br label %L3
L2:		; preds = %0
	%E = load i32, i32* %A		; <i32> [#uses=1]
	call void @test( i32 %E, i1 true )
	br label %L3
L3:		; preds = %L2, %L1
	ret void
}