1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-30 07:22:55 +01:00
llvm-mirror/test/Regression/CodeGen/X86/loop-hoist.ll
Reid Spencer 1dad92a1ba Rearrange code so that llvm-upgrade doesn't break the optimization this
test is trying to verify.

llvm-svn: 32135
2006-12-02 20:39:25 +00:00

26 lines
1.1 KiB
LLVM

; RUN: llvm-upgrade < %s | llvm-as | llc -relocation-model=dynamic-no-pic -mtriple=i686-apple-darwin8.7.2 | grep L_Arr.non_lazy_ptr &&
; RUN: llvm-upgrade < %s | llvm-as | llc -relocation-model=dynamic-no-pic -mtriple=i686-apple-darwin8.7.2 | %prcontext L_Arr.non_lazy_ptr 1 | grep '4(%esp)'
%Arr = external global [0 x int] ; <[0 x int]*> [#uses=2]
implementation ; Functions:
void %foo(int %N) {
entry:
%N = cast int %N to uint ; <uint> [#uses=1]
br label %cond_true
cond_true: ; preds = %cond_true, %entry
%indvar = phi uint [ 0, %entry ], [ %indvar.next, %cond_true ] ; <uint> [#uses=3]
%i.0.0 = cast uint %indvar to int ; <int> [#uses=1]
%tmp = getelementptr [0 x int]* %Arr, int 0, int %i.0.0
store int %i.0.0, int* %tmp
%indvar.next = add uint %indvar, 1 ; <uint> [#uses=2]
%exitcond = seteq uint %indvar.next, %N ; <bool> [#uses=1]
br bool %exitcond, label %return, label %cond_true
return: ; preds = %cond_true, %entry
ret void
}