RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2025-01-27 07:12:06 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

New testcase that causes the code extractor to generate bogus code.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@12404 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2004-03-15 00:08:49 +00:00
parent 5156c39d64
commit e94fd1963d
1 changed files with 34 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
test/Transforms/CodeExtractor/2004-03-14-DominanceProblem.ll Normal file
View File

@ -0,0 +1,34 @@
; RUN: llvm-as < %s | opt -loop-extract -disable-output
; This testcase is failing the loop extractor because not all exit blocks
; are dominated by all of the live-outs.
implementation ; Functions:
int %ab(int %alpha, int %beta) {
entry:
br label %loopentry.1.preheader
loopentry.1.preheader: ; preds = %then.1
br label %loopentry.1
loopentry.1: ; preds = %loopentry.1.preheader, %no_exit.1
br bool false, label %no_exit.1, label %loopexit.0.loopexit1
no_exit.1: ; preds = %loopentry.1
%tmp.53 = load int* null ; <int> [#uses=1]
br bool false, label %shortcirc_next.2, label %loopentry.1
shortcirc_next.2: ; preds = %no_exit.1
%tmp.563 = call int %wins( int 0, int %tmp.53, int 3 ) ; <int> [#uses=0]
ret int 0
loopexit.0.loopexit1: ; preds = %loopentry.1
br label %loopexit.0
loopexit.0: ; preds = %loopexit.0.loopexit, %loopexit.0.loopexit1
ret int 0
}
declare int %wins(int, int, int)
declare ushort %ab_code()