mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 11:42:57 +01:00
8a358b3669
This was done through the aid of a terrible Perl creation. I will not paste any of the horrors here. Suffice to say, it require multiple staged rounds of replacements, state carried between, and a few nested-construct-parsing hacks that I'm not proud of. It happens, by luck, to be able to deal with all the TCL-quoting patterns in evidence in the LLVM test suite. If anyone is maintaining large out-of-tree test trees, feel free to poke me and I'll send you the steps I used to convert things, as well as answer any painful questions etc. IRC works best for this type of thing I find. Once converted, switch the LLVM lit config to use ShTests the same as Clang. In addition to being able to delete large amounts of Python code from 'lit', this will also simplify the entire test suite and some of lit's architecture. Finally, the test suite runs 33% faster on Linux now. ;] For my 16-hardware-thread (2x 4-core xeon e5520): 36s -> 24s llvm-svn: 159525
48 lines
1.8 KiB
LLVM
48 lines
1.8 KiB
LLVM
; RUN: opt < %s -instcombine -S | grep "call.*stacksave"
|
|
; PR1745
|
|
target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:128:128"
|
|
target triple = "i686-apple-darwin8"
|
|
@p = weak global i8* null ; <i8**> [#uses=1]
|
|
|
|
define i32 @main() {
|
|
entry:
|
|
%"alloca point" = bitcast i32 0 to i32 ; <i32> [#uses=0]
|
|
br label %lab
|
|
|
|
lab: ; preds = %cleanup31, %entry
|
|
%n.0 = phi i32 [ 0, %entry ], [ %tmp25, %cleanup31 ] ; <i32> [#uses=2]
|
|
%tmp2 = call i8* @llvm.stacksave( ) ; <i8*> [#uses=2]
|
|
%tmp4 = srem i32 %n.0, 47 ; <i32> [#uses=1]
|
|
%tmp5 = add i32 %tmp4, 1 ; <i32> [#uses=5]
|
|
%tmp7 = sub i32 %tmp5, 1 ; <i32> [#uses=0]
|
|
%tmp89 = zext i32 %tmp5 to i64 ; <i64> [#uses=1]
|
|
%tmp10 = mul i64 %tmp89, 32 ; <i64> [#uses=0]
|
|
%tmp12 = mul i32 %tmp5, 4 ; <i32> [#uses=0]
|
|
%tmp1314 = zext i32 %tmp5 to i64 ; <i64> [#uses=1]
|
|
%tmp15 = mul i64 %tmp1314, 32 ; <i64> [#uses=0]
|
|
%tmp17 = mul i32 %tmp5, 4 ; <i32> [#uses=1]
|
|
%tmp18 = alloca i8, i32 %tmp17 ; <i8*> [#uses=1]
|
|
%tmp1819 = bitcast i8* %tmp18 to i32* ; <i32*> [#uses=2]
|
|
%tmp21 = getelementptr i32* %tmp1819, i32 0 ; <i32*> [#uses=1]
|
|
store i32 1, i32* %tmp21, align 4
|
|
%tmp2223 = bitcast i32* %tmp1819 to i8* ; <i8*> [#uses=1]
|
|
store volatile i8* %tmp2223, i8** @p, align 4
|
|
%tmp25 = add i32 %n.0, 1 ; <i32> [#uses=2]
|
|
%tmp27 = icmp sle i32 %tmp25, 999999 ; <i1> [#uses=1]
|
|
%tmp2728 = zext i1 %tmp27 to i8 ; <i8> [#uses=1]
|
|
%toBool = icmp ne i8 %tmp2728, 0 ; <i1> [#uses=1]
|
|
br i1 %toBool, label %cleanup31, label %cond_next
|
|
|
|
cond_next: ; preds = %lab
|
|
call void @llvm.stackrestore( i8* %tmp2 )
|
|
ret i32 0
|
|
|
|
cleanup31: ; preds = %lab
|
|
call void @llvm.stackrestore( i8* %tmp2 )
|
|
br label %lab
|
|
}
|
|
|
|
declare i8* @llvm.stacksave()
|
|
|
|
declare void @llvm.stackrestore(i8*)
|