1 files changed, 0 insertions, 130 deletions
diff --git a/llvm/test/Transforms/LoopUnroll/X86/partial.ll b/llvm/test/Transforms/LoopUnroll/X86/partial.ll
deleted file mode 100644
index a6f35e6f97a..00000000000
--- a/llvm/test/Transforms/LoopUnroll/X86/partial.ll
+++ /dev/null
@@ -1,130 +0,0 @@
-; RUN: opt < %s -S -loop-unroll -mcpu=nehalem | FileCheck %s
-; RUN: opt < %s -S -loop-unroll -unroll-runtime=0 | FileCheck -check-prefix=CHECK-NOUNRL %s
-target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
-target triple = "x86_64-unknown-linux-gnu"
-
-define void @foo(i32* noalias nocapture readnone %ip, double %alpha, double* noalias nocapture %a, double* noalias nocapture readonly %b) #0 {
-entry:
-  br label %vector.body
-
-vector.body:                                      ; preds = %vector.body, %entry
-  %index = phi i64 [ 0, %entry ], [ %index.next, %vector.body ]
-  %0 = getelementptr inbounds double, double* %b, i64 %index
-  %1 = bitcast double* %0 to <2 x double>*
-  %wide.load = load <2 x double>, <2 x double>* %1, align 8
-  %.sum9 = or i64 %index, 2
-  %2 = getelementptr double, double* %b, i64 %.sum9
-  %3 = bitcast double* %2 to <2 x double>*
-  %wide.load8 = load <2 x double>, <2 x double>* %3, align 8
-  %4 = fadd <2 x double> %wide.load, <double 1.000000e+00, double 1.000000e+00>
-  %5 = fadd <2 x double> %wide.load8, <double 1.000000e+00, double 1.000000e+00>
-  %6 = getelementptr inbounds double, double* %a, i64 %index
-  %7 = bitcast double* %6 to <2 x double>*
-  store <2 x double> %4, <2 x double>* %7, align 8
-  %.sum10 = or i64 %index, 2
-  %8 = getelementptr double, double* %a, i64 %.sum10
-  %9 = bitcast double* %8 to <2 x double>*
-  store <2 x double> %5, <2 x double>* %9, align 8
-  %index.next = add i64 %index, 4
-  %10 = icmp eq i64 %index.next, 1600
-  br i1 %10, label %for.end, label %vector.body
-
-; FIXME: We should probably unroll this loop by a factor of 2, but the cost
-; model needs to be fixed to account for instructions likely to be folded
-; as part of an addressing mode.
-; CHECK-LABEL: @foo
-; CHECK-NOUNRL-LABEL: @foo
-
-for.end:                                          ; preds = %vector.body
-  ret void
-}
-
-define void @bar(i32* noalias nocapture readnone %ip, double %alpha, double* noalias nocapture %a, double* noalias nocapture readonly %b) #0 {
-entry:
-  br label %vector.body
-
-vector.body:                                      ; preds = %vector.body, %entry
-  %index = phi i64 [ 0, %entry ], [ %index.next, %vector.body ]
-  %v0 = getelementptr inbounds double, double* %b, i64 %index
-  %v1 = bitcast double* %v0 to <2 x double>*
-  %wide.load = load <2 x double>, <2 x double>* %v1, align 8
-  %v4 = fadd <2 x double> %wide.load, <double 1.000000e+00, double 1.000000e+00>
-  %v5 = fmul <2 x double> %v4, <double 8.000000e+00, double 8.000000e+00>
-  %v6 = getelementptr inbounds double, double* %a, i64 %index
-  %v7 = bitcast double* %v6 to <2 x double>*
-  store <2 x double> %v5, <2 x double>* %v7, align 8
-  %index.next = add i64 %index, 2
-  %v10 = icmp eq i64 %index.next, 1600
-  br i1 %v10, label %for.end, label %vector.body
-
-; FIXME: We should probably unroll this loop by a factor of 2, but the cost
-; model needs to first to fixed to account for instructions likely to be folded
-; as part of an addressing mode.
-
-; CHECK-LABEL: @bar
-; CHECK: fadd
-; CHECK-NEXT: fmul
-; CHECK: fadd
-; CHECK-NEXT: fmul
-
-; CHECK-NOUNRL-LABEL: @bar
-; CHECK-NOUNRL: fadd
-; CHECK-NOUNRL-NEXT: fmul
-; CHECK-NOUNRL-NOT: fadd
-
-for.end:                                          ; preds = %vector.body
-  ret void
-}
-
-define zeroext i16 @test1(i16* nocapture readonly %arr, i32 %n) #0 {
-entry:
-  %cmp25 = icmp eq i32 %n, 0
-  br i1 %cmp25, label %for.end, label %for.body
-
-for.body:                                         ; preds = %entry, %for.body
-  %indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %entry ]
-  %reduction.026 = phi i16 [ %add14, %for.body ], [ 0, %entry ]
-  %arrayidx = getelementptr inbounds i16, i16* %arr, i64 %indvars.iv
-  %0 = load i16, i16* %arrayidx, align 2
-  %mul = shl i16 %0, 1
-  %add = add i16 %mul, %reduction.026
-  %sext = mul i64 %indvars.iv, 12884901888
-  %idxprom3 = ashr exact i64 %sext, 32
-  %arrayidx4 = getelementptr inbounds i16, i16* %arr, i64 %idxprom3
-  %1 = load i16, i16* %arrayidx4, align 2
-  %mul2 = shl i16 %1, 1
-  %add7 = add i16 %add, %mul2
-  %sext28 = mul i64 %indvars.iv, 21474836480
-  %idxprom10 = ashr exact i64 %sext28, 32
-  %arrayidx11 = getelementptr inbounds i16, i16* %arr, i64 %idxprom10
-  %2 = load i16, i16* %arrayidx11, align 2
-  %mul3 = shl i16 %2, 1
-  %add14 = add i16 %add7, %mul3
-  %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
-  %lftr.wideiv = trunc i64 %indvars.iv.next to i32
-  %exitcond = icmp eq i32 %lftr.wideiv, %n
-  br i1 %exitcond, label %for.end, label %for.body
-
-for.end:                                          ; preds = %for.body, %entry
-  %reduction.0.lcssa = phi i16 [ 0, %entry ], [ %add14, %for.body ]
-  ret i16 %reduction.0.lcssa
-
-; This loop is too large to be partially unrolled (size=16)
-
-; CHECK-LABEL: @test1
-; CHECK: br
-; CHECK: br
-; CHECK: br
-; CHECK: br
-; CHECK-NOT: br
-
-; CHECK-NOUNRL-LABEL: @test1
-; CHECK-NOUNRL: br
-; CHECK-NOUNRL: br
-; CHECK-NOUNRL: br
-; CHECK-NOUNRL: br
-; CHECK-NOUNRL-NOT: br
-}
-
-attributes #0 = { nounwind uwtable }
-