6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-11-01 15:11:24 +00:00
Code Issues Projects Releases Wiki Activity

New testcase, details in the comments

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@11495 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2004-02-16 06:35:19 +00:00
parent 7059f2e76b
commit 5ea27d820a
1 changed files with 32 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
test/Transforms/SimplifyCFG/UncondBranchToReturn.ll Normal file
View File

@ -0,0 +1,32 @@
; The unify-function-exit-nodes pass often makes basic blocks that just contain
; a PHI node and a return. Make sure the simplify cfg can straighten out this
; important case. This is basically the most trivial form of tail-duplication.
; RUN: llvm-as < %s | opt -simplifycfg | llvm-dis | not grep 'br label'
int %test(bool %B, int %A, int %B) {
br bool %B, label %T, label %F
T:
br label %ret
F:
br label %ret
ret:
%X = phi int [%A, %F], [%B, %T]
ret int %X
}
; Make sure it's willing to move unconditional branches to return instructions
; as well, even if the return block is shared and the source blocks are
; non-empty.
int %test2(bool %B, int %A, int %B) {
br bool %B, label %T, label %F
T:
call int %test(bool true, int 5, int 8)
br label %ret
F:
call int %test(bool true, int 5, int 8)
br label %ret
ret:
ret int %A
}