File: 2003-10-05-DeadPHIInsertion.ll

package info (click to toggle)
swiftlang 6.1.3-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 2,791,604 kB
  • sloc: cpp: 9,901,740; ansic: 2,201,431; asm: 1,091,827; python: 308,252; objc: 82,166; f90: 80,126; lisp: 38,358; pascal: 25,559; sh: 20,429; ml: 5,058; perl: 4,745; makefile: 4,484; awk: 3,535; javascript: 3,018; xml: 918; fortran: 664; cs: 573; ruby: 396
file content (22 lines) | stat: -rw-r--r-- 615 bytes parent folder | download | duplicates (16) 
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 -passes=mem2reg -S | not grep phi

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