mirror of
https://github.com/RPCSX/llvm.git
synced 2024-11-30 23:20:54 +00:00
7c9c6ed761
Essentially the same as the GEP change in r230786.
A similar migration script can be used to update test cases, though a few more
test case improvements/changes were required this time around: (r229269-r229278)
import fileinput
import sys
import re
pat = re.compile(r"((?:=|:|^)\s*load (?:atomic )?(?:volatile )?(.*?))(| addrspace\(\d+\) *)\*($| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$)")
for line in sys.stdin:
sys.stdout.write(re.sub(pat, r"\1, \2\3*\4", line))
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7649
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@230794 91177308-0d34-0410-b5e6-96231b3b80d8
23 lines
613 B
LLVM
23 lines
613 B
LLVM
; 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
|
|
}
|
|
|