diff options
Diffstat (limited to 'release_23/test/Transforms/InstCombine/align-2d-gep.ll')
| -rw-r--r-- | release_23/test/Transforms/InstCombine/align-2d-gep.ll | 43 |
1 files changed, 0 insertions, 43 deletions
diff --git a/release_23/test/Transforms/InstCombine/align-2d-gep.ll b/release_23/test/Transforms/InstCombine/align-2d-gep.ll deleted file mode 100644 index c826e31da1f9..000000000000 --- a/release_23/test/Transforms/InstCombine/align-2d-gep.ll +++ /dev/null @@ -1,43 +0,0 @@ -; RUN: llvm-as < %s | opt -instcombine | llvm-dis | grep {align 16} | count 1 - -; 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 -} |