Array.prototype.unshift builtin improvements

src/elements.cc

 // Copyright 2012 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/elements.h"
 
 #include "src/arguments.h"
 #include "src/conversions.h"
 #include "src/factory.h"
 #include "src/messages.h"
@@ skipping 567 matching lines @@
                                               push_size, direction);
   }
 
   static uint32_t PushImpl(Handle<JSArray> receiver,
                            Handle<FixedArrayBase> elms_obj, Object** objects,
                            uint32_t push_size, int direction) {
     UNREACHABLE();
     return 0;
   }
 
+  virtual uint32_t Unshift(Handle<JSArray> receiver,
+                           Handle<FixedArrayBase> backing_store, Arguments args,
+                           uint32_t add_count) {
+    return ElementsAccessorSubclass::UnshiftImpl(receiver, backing_store, args,
+                                                 add_count);
+  }
+
+  static uint32_t UnshiftImpl(Handle<JSArray> receiver,
+                              Handle<FixedArrayBase> backing_store,
+                              Arguments args, uint32_t add_count) {
+    UNREACHABLE();
+    return 0;
+  }
+
   virtual Handle<JSArray> Splice(Handle<JSArray> receiver,
                                  Handle<FixedArrayBase> backing_store,
                                  uint32_t start, uint32_t delete_count,
                                  Arguments args, uint32_t add_count) {
     return ElementsAccessorSubclass::SpliceImpl(receiver, backing_store, start,
                                                 delete_count, args, add_count);
   }
 
   static Handle<JSArray> SpliceImpl(Handle<JSArray> receiver,
                                     Handle<FixedArrayBase> backing_store,
@@ skipping 576 matching lines @@
     if (IsFastSmiElementsKind(KindTraits::Kind)) {
       for (int i = 0; i < length; i++) {
         DCHECK(BackingStore::get(backing_store, i)->IsSmi() ||
                (IsFastHoleyElementsKind(KindTraits::Kind) &&
                 backing_store->is_the_hole(i)));
       }
     }
 #endif
   }
 
+
+  static uint32_t UnshiftImpl(Handle<JSArray> receiver,
+                              Handle<FixedArrayBase> backing_store,
+                              Arguments args, uint32_t add_count) {
+    int len = Smi::cast(receiver->length())->value();
+    if (add_count == 0) {
+      return len;
+    }
+    // Currently fixed arrays cannot grow too big, so
+    // we should never hit this case.
+    DCHECK(add_count <= static_cast<uint32_t>(Smi::kMaxValue - len));
+    int new_length = len + add_count;
+    Handle<FixedArrayBase> new_elements;
+
+    if (new_length > backing_store->length()) {
+      // New backing storage is needed.
+      int capacity = new_length + (new_length >> 1) + 16;
+      new_elements = FastElementsAccessorSubclass::ConvertElementsWithCapacity(
+          receiver, backing_store, KindTraits::Kind, capacity, 0);
+      FastElementsAccessorSubclass::CopyElementsImpl(
+          *backing_store, 0, *new_elements, KindTraits::Kind, add_count,
+          kPackedSizeNotKnown, ElementsAccessor::kCopyToEndAndInitializeToHole);
+    } else {
+      DisallowHeapAllocation no_gc;
+      Heap* heap = receiver->GetIsolate()->heap();
+      FastElementsAccessorSubclass::MoveElements(heap, backing_store, add_count,
+                                                 0, len, 0, 0);
+      new_elements = backing_store;
+    }
+
+    // Add the provided values.
+    DisallowHeapAllocation no_gc;
+    for (uint32_t i = 0; i < add_count; i++) {
+      FastElementsAccessorSubclass::SetImpl(*new_elements, i, args[i + 1]);
+    }
+    if (!new_elements.is_identical_to(backing_store)) {
+      receiver->set_elements(*new_elements);
+    }
+    // Set the length.
+    receiver->set_length(Smi::FromInt(new_length));
+    return new_length;
+  }
+
+
   static uint32_t PushImpl(Handle<JSArray> receiver,
                            Handle<FixedArrayBase> backing_store,
                            Object** objects, uint32_t push_size,
                            int direction) {
     uint32_t len = Smi::cast(receiver->length())->value();
     if (push_size == 0) {
       return len;
     }
-    uint32_t elms_len = backing_store->length();
     // Currently fixed arrays cannot grow too big, so
     // we should never hit this case.
     DCHECK(push_size <= static_cast<uint32_t>(Smi::kMaxValue - len));
     uint32_t new_length = len + push_size;
     Handle<FixedArrayBase> new_elms;
 
-    if (new_length > elms_len) {
+    if (new_length > static_cast<uint32_t>(backing_store->length())) {
       // New backing storage is needed.
       uint32_t capacity = new_length + (new_length >> 1) + 16;
       new_elms = FastElementsAccessorSubclass::ConvertElementsWithCapacity(
           receiver, backing_store, KindTraits::Kind, capacity);
     } else {
       // push_size is > 0 and new_length <= elms_len, so backing_store cannot be
       // the empty_fixed_array.
       new_elms = backing_store;
     }
 
@@ skipping 54 matching lines @@
     if (add_count < delete_count) {
       elms_changed = SpliceShrinkStep(backing_store, heap, start, delete_count,
                                       add_count, len, new_length);
     } else if (add_count > delete_count) {
       elms_changed =
           SpliceGrowStep(receiver, backing_store, isolate, heap, start,
                          delete_count, add_count, len, new_length);
     }
 
     // Copy new Elements from args
-    if (IsFastDoubleElementsKind(KindTraits::Kind)) {
-      for (uint32_t index = start; index < start + add_count; index++) {
-        Object* arg = args[3 + index - start];
-        FastElementsAccessorSubclass::SetImpl(*backing_store, index, arg);
-      }
-    } else {
-      // FastSmiOrObjectElementsKind
-      Handle<FixedArray> elms = Handle<FixedArray>::cast(backing_store);
-      DisallowHeapAllocation no_gc;
-      WriteBarrierMode mode = elms->GetWriteBarrierMode(no_gc);
-      for (uint32_t index = start; index < start + add_count; index++) {
-        elms->set(index, args[3 + index - start], mode);
-      }
+    DisallowHeapAllocation no_gc;
+    for (uint32_t index = start; index < start + add_count; index++) {
+      Object* object = args[3 + index - start];
+      FastElementsAccessorSubclass::SetImpl(*backing_store, index, object);
     }
 
     if (elms_changed) {
       receiver->set_elements(*backing_store);
     }
     receiver->set_length(Smi::FromInt(new_length));
     return deleted_elements;
   }
 
  private:
@@ skipping 851 matching lines @@
 #define ACCESSOR_DELETE(Class, Kind, Store) delete elements_accessors_[Kind];
   ELEMENTS_LIST(ACCESSOR_DELETE)
 #undef ACCESSOR_DELETE
   elements_accessors_ = NULL;
 }
 
 
 ElementsAccessor** ElementsAccessor::elements_accessors_ = NULL;
 }  // namespace internal
 }  // namespace v8