2 files changed, 0 insertions, 43 deletions
diff --git a/tests/codegen/lib-optimizations/iter-sum.rs b/tests/codegen/lib-optimizations/iter-sum.rs
deleted file mode 100644
index a054ffffe74..00000000000
--- a/tests/codegen/lib-optimizations/iter-sum.rs
+++ /dev/null
@@ -1,13 +0,0 @@
-//@ compile-flags: -Copt-level=3
-//@ only-x86_64 (vectorization varies between architectures)
-#![crate_type = "lib"]
-
-// Ensure that slice + take + sum gets vectorized.
-// Currently this relies on the slice::Iter::try_fold implementation
-// CHECK-LABEL: @slice_take_sum
-#[no_mangle]
-pub fn slice_take_sum(s: &[u64], l: usize) -> u64 {
-    // CHECK: vector.body:
-    // CHECK: ret
-    s.iter().take(l).sum()
-}
diff --git a/tests/codegen/lib-optimizations/slice_rotate.rs b/tests/codegen/lib-optimizations/slice_rotate.rs
deleted file mode 100644
index aa4bb3b528c..00000000000
--- a/tests/codegen/lib-optimizations/slice_rotate.rs
+++ /dev/null
@@ -1,30 +0,0 @@
-//@ compile-flags: -Copt-level=3
-
-#![crate_type = "lib"]
-
-// Ensure that the simple case of rotating by a constant 1 optimizes to the obvious thing
-
-// CHECK-LABEL: @rotate_left_by_one
-#[no_mangle]
-pub fn rotate_left_by_one(slice: &mut [i32]) {
-    // CHECK-NOT: phi
-    // CHECK-NOT: call
-    // CHECK-NOT: load
-    // CHECK-NOT: store
-    // CHECK-NOT: getelementptr
-    // CHECK: %[[END:.+]] = getelementptr
-    // CHECK-NEXT: %[[DIM:.+]] = getelementptr
-    // CHECK-NEXT: %[[LAST:.+]] = load
-    // CHECK-NEXT: %[[FIRST:.+]] = shl
-    // CHECK-NEXT: call void @llvm.memmove
-    // CHECK-NEXT: store i32 %[[LAST]], ptr %[[DIM:.+]]
-    // CHECK-NOT: phi
-    // CHECK-NOT: call
-    // CHECK-NOT: load
-    // CHECK-NOT: store
-    // CHECK-NOT: getelementptr
-    // CHECK: ret void
-    if !slice.is_empty() {
-        slice.rotate_left(1);
-    }
-}