Convert all tests using TCL-style quoting to use shell-style quoting.
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
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@159525 91177308-0d34-0410-b5e6-96231b3b80d8
2012-07-02 12:47:22 +00:00
|
|
|
; RUN: opt < %s -instcombine -S | grep "align 16" | count 1
|
2009-11-03 15:29:06 +00:00
|
|
|
target datalayout = "E-p:64:64:64-a0:0:8-f32:32:32-f64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-v64:64:64-v128:128:128"
|
2008-04-10 18:43:06 +00:00
|
|
|
|
|
|
|
|
; A multi-dimensional array in a nested loop doing vector stores that
|
|
|
|
|
; aren't yet aligned. Instcombine can understand the addressing in the
|
|
|
|
|
; Nice case to prove 16 byte alignment. In the Awkward case, the inner
|
|
|
|
|
; array dimension is not even, so the stores to it won't always be
|
|
|
|
|
; aligned. Instcombine should prove alignment in exactly one of the two
|
|
|
|
|
; stores.
|
|
|
|
|
|
|
|
|
|
@Nice = global [1001 x [20000 x double]] zeroinitializer, align 32
|
|
|
|
|
@Awkward = global [1001 x [20001 x double]] zeroinitializer, align 32
|
|
|
|
|
|
|
|
|
|
define void @foo() nounwind {
|
|
|
|
|
entry:
|
|
|
|
|
br label %bb7.outer
|
|
|
|
|
|
|
|
|
|
bb7.outer:
|
|
|
|
|
%i = phi i64 [ 0, %entry ], [ %indvar.next26, %bb11 ]
|
|
|
|
|
br label %bb1
|
|
|
|
|
|
|
|
|
|
bb1:
|
|
|
|
|
%j = phi i64 [ 0, %bb7.outer ], [ %indvar.next, %bb1 ]
|
|
|
|
|
|
|
|
|
|
%t4 = getelementptr [1001 x [20000 x double]]* @Nice, i64 0, i64 %i, i64 %j
|
|
|
|
|
%q = bitcast double* %t4 to <2 x double>*
|
|
|
|
|
store <2 x double><double 0.0, double 0.0>, <2 x double>* %q, align 8
|
|
|
|
|
|
|
|
|
|
%s4 = getelementptr [1001 x [20001 x double]]* @Awkward, i64 0, i64 %i, i64 %j
|
|
|
|
|
%r = bitcast double* %s4 to <2 x double>*
|
|
|
|
|
store <2 x double><double 0.0, double 0.0>, <2 x double>* %r, align 8
|
|
|
|
|
|
|
|
|
|
%indvar.next = add i64 %j, 2
|
|
|
|
|
%exitcond = icmp eq i64 %indvar.next, 557
|
|
|
|
|
br i1 %exitcond, label %bb11, label %bb1
|
|
|
|
|
|
|
|
|
|
bb11:
|
|
|
|
|
%indvar.next26 = add i64 %i, 1
|
|
|
|
|
%exitcond27 = icmp eq i64 %indvar.next26, 991
|
|
|
|
|
br i1 %exitcond27, label %return.split, label %bb7.outer
|
|
|
|
|
|
|
|
|
|
return.split:
|
|
|
|
|
ret void
|
|
|
|
|
}
|
