RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-05 02:07:16 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

New testcase

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@12920 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2004-04-13 19:43:33 +00:00
parent 25b8390bf2
commit 3d78b23d24
1 changed files with 24 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
test/Transforms/SCCP/calltest.ll Normal file
View File

@ -0,0 +1,24 @@
; RUN: llvm-as < %s | opt -sccp -adce -simplifycfg | llvm-dis | not grep br
; No matter how hard you try, sqrt(1.0) is always 1.0. This allows the
; optimizer to delete this loop.
declare double %sqrt(double)
double %test(uint %param) {
entry:
br label %Loop
Loop:
%I2 = phi uint [ 0, %entry ], [ %I3, %Loop ]
%V = phi double [ 1.0, %entry], [ %V2, %Loop ]
%V2 = call double %sqrt(double %V)
%I3 = add uint %I2, 1
%tmp.7 = setne uint %I3, %param
br bool %tmp.7, label %Loop, label %Exit
Exit:
ret double %V
}