mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-30 15:32:52 +01:00
3ae734a60c
This was done with the following sed invocation to catch label lines demarking function boundaries:
sed -i '' "s/^;\( *\)\([A-Z0-9_]*\):\( *\)test\([A-Za-z0-9_-]*\):\( *\)$/;\1\2-LABEL:\3test\4:\5/g" test/CodeGen/*/*.ll
which was written conservatively to avoid false positives rather than false negatives. I scanned through all the changes and everything looks correct.
llvm-svn: 186258
77 lines
3.0 KiB
LLVM
77 lines
3.0 KiB
LLVM
; RUN: llc < %s -mtriple=thumbv7-apple-darwin | FileCheck %s
|
|
target datalayout = "e-p:32:32:32-i1:8:32-i8:8:32-i16:16:32-i32:32:32-i64:32:32-f32:32:32-f64:32:32-v64:64:64-v128:128:128-a0:0:32-n32"
|
|
|
|
define i32 @test(i32 %n) nounwind {
|
|
; CHECK-LABEL: test:
|
|
; CHECK-NOT: mov
|
|
; CHECK: return
|
|
entry:
|
|
%0 = icmp eq i32 %n, 1 ; <i1> [#uses=1]
|
|
br i1 %0, label %return, label %bb.nph
|
|
|
|
bb.nph: ; preds = %entry
|
|
%tmp = add i32 %n, -1 ; <i32> [#uses=1]
|
|
br label %bb
|
|
|
|
bb: ; preds = %bb.nph, %bb
|
|
%indvar = phi i32 [ 0, %bb.nph ], [ %indvar.next, %bb ] ; <i32> [#uses=1]
|
|
%u.05 = phi i64 [ undef, %bb.nph ], [ %ins, %bb ] ; <i64> [#uses=1]
|
|
%1 = tail call i32 @f() nounwind ; <i32> [#uses=1]
|
|
%tmp4 = zext i32 %1 to i64 ; <i64> [#uses=1]
|
|
%mask = and i64 %u.05, -4294967296 ; <i64> [#uses=1]
|
|
%ins = or i64 %tmp4, %mask ; <i64> [#uses=2]
|
|
tail call void @g(i64 %ins) nounwind
|
|
%indvar.next = add i32 %indvar, 1 ; <i32> [#uses=2]
|
|
%exitcond = icmp eq i32 %indvar.next, %tmp ; <i1> [#uses=1]
|
|
br i1 %exitcond, label %return, label %bb
|
|
|
|
return: ; preds = %bb, %entry
|
|
ret i32 undef
|
|
}
|
|
|
|
define i32 @test_dead_cycle(i32 %n) nounwind {
|
|
; CHECK-LABEL: test_dead_cycle:
|
|
; CHECK: blx
|
|
; CHECK-NOT: mov
|
|
; CHECK: blx
|
|
entry:
|
|
%0 = icmp eq i32 %n, 1 ; <i1> [#uses=1]
|
|
br i1 %0, label %return, label %bb.nph
|
|
|
|
bb.nph: ; preds = %entry
|
|
%tmp = add i32 %n, -1 ; <i32> [#uses=2]
|
|
br label %bb
|
|
|
|
bb: ; preds = %bb.nph, %bb2
|
|
%indvar = phi i32 [ 0, %bb.nph ], [ %indvar.next, %bb2 ] ; <i32> [#uses=2]
|
|
%u.17 = phi i64 [ undef, %bb.nph ], [ %u.0, %bb2 ] ; <i64> [#uses=2]
|
|
%tmp9 = sub i32 %tmp, %indvar ; <i32> [#uses=1]
|
|
%1 = icmp sgt i32 %tmp9, 1 ; <i1> [#uses=1]
|
|
br i1 %1, label %bb1, label %bb2
|
|
|
|
bb1: ; preds = %bb
|
|
%2 = tail call i32 @f() nounwind ; <i32> [#uses=1]
|
|
%tmp6 = zext i32 %2 to i64 ; <i64> [#uses=1]
|
|
%mask = and i64 %u.17, -4294967296 ; <i64> [#uses=1]
|
|
%ins = or i64 %tmp6, %mask ; <i64> [#uses=1]
|
|
tail call void @g(i64 %ins) nounwind
|
|
br label %bb2
|
|
|
|
bb2: ; preds = %bb1, %bb
|
|
; also check for duplicate induction variables (radar 7645034)
|
|
; CHECK: subs r{{.*}}, #1
|
|
; CHECK-NOT: subs r{{.*}}, #1
|
|
; CHECK: pop
|
|
%u.0 = phi i64 [ %ins, %bb1 ], [ %u.17, %bb ] ; <i64> [#uses=2]
|
|
%indvar.next = add i32 %indvar, 1 ; <i32> [#uses=2]
|
|
%exitcond = icmp eq i32 %indvar.next, %tmp ; <i1> [#uses=1]
|
|
br i1 %exitcond, label %return, label %bb
|
|
|
|
return: ; preds = %bb2, %entry
|
|
ret i32 undef
|
|
}
|
|
|
|
declare i32 @f()
|
|
|
|
declare void @g(i64)
|