test that the phi node got eliminated

Author: the8472

library/alloc/src/slice.rs

@@ -160,6 +160,12 @@ pub(crate) mod hack {
     impl<T: Copy> ConvertVec for T {
         #[inline]
         fn to_vec<A: Allocator>(s: &[Self], alloc: A) -> Vec<Self, A> {
+            if s.is_empty() {
+                // The early return is not necessary for correctness, but it helps
+                // LLVM by avoiding phi nodes flowing into memcpy.
+                // See codegen/lib-optimizations/append-elements.rs
+                return Vec::new_in(alloc);
+            }
             let mut v = Vec::with_capacity_in(s.len(), alloc);
             // SAFETY:
             // allocated above with the capacity of `s`, and initialize to `s.len()` in

library/alloc/src/vec/mod.rs

@@ -2520,11 +2520,9 @@ impl<T, A: Allocator> Vec<T, A> {
     unsafe fn append_elements(&mut self, other: *const [T]) {
         let count = unsafe { (*other).len() };
         if count == 0 {
-            // The early return is not necessary for correctness, but in cases
-            // where LLVM sees all the way to the allocation site of `other`
-            // this can avoid a phi-node merging the two different pointers
-            // when zero-length allocations are special-cased.
-            // That in turn can enable more optimizations around the memcpy below.
+            // The early return is not necessary for correctness, but it helps
+            // LLVM by avoiding phi nodes flowing into memcpy.
+            // See codegen/lib-optimizations/append-elements.rs
             return;
         }
         self.reserve(count);