Add runtime function for string to array conversion.

src/builtins.cc

 // Copyright 2006-2008 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 224 matching lines @@
   }
 
   // Set length and elements on the array.
   array->set_elements(FixedArray::cast(obj));
   array->set_length(len);
 
   return array;
 }
 
 
-static Object* AllocateUninitializedFixedArray(int len) {
-  Object* obj = Heap::AllocateRawFixedArray(len);
-  if (obj->IsFailure()) return obj;
-
-  reinterpret_cast<FixedArray*>(obj)->set_map(Heap::fixed_array_map());
-  FixedArray::cast(obj)->set_length(len);
-  return obj;
-}
-
-
 static Object* AllocateJSArray() {
   JSFunction* array_function =
       Top::context()->global_context()->array_function();
   Object* result = Heap::AllocateJSObject(array_function);
   if (result->IsFailure()) return result;
   return result;
 }
 
 
 static void CopyElements(AssertNoAllocation* no_gc,
@@ skipping 91 matching lines @@
   // Currently fixed arrays cannot grow too big, so
   // we should never hit this case.
   ASSERT(to_add <= (Smi::kMaxValue - len));
 
   int new_length = len + to_add;
   FixedArray* elms = FixedArray::cast(array->elements());
 
   if (new_length > elms->length()) {
     // New backing storage is needed.
     int capacity = new_length + (new_length >> 1) + 16;
-    Object* obj = AllocateUninitializedFixedArray(capacity);
+    Object* obj = Heap::AllocateUninitializedFixedArray(capacity);
     if (obj->IsFailure()) return obj;
     FixedArray* new_elms = FixedArray::cast(obj);
 
     AssertNoAllocation no_gc;
     CopyElements(&no_gc, new_elms, 0, elms, 0, len);
     FillWithHoles(new_elms, new_length, capacity);
 
     elms = new_elms;
     array->set_elements(elms);
   }
@@ skipping 89 matching lines @@
   int new_length = len + to_add;
   // Currently fixed arrays cannot grow too big, so
   // we should never hit this case.
   ASSERT(to_add <= (Smi::kMaxValue - len));
 
   FixedArray* elms = FixedArray::cast(array->elements());
 
   if (new_length > elms->length()) {
     // New backing storage is needed.
     int capacity = new_length + (new_length >> 1) + 16;
-    Object* obj = AllocateUninitializedFixedArray(capacity);
+    Object* obj = Heap::AllocateUninitializedFixedArray(capacity);
     if (obj->IsFailure()) return obj;
     FixedArray* new_elms = FixedArray::cast(obj);
 
     AssertNoAllocation no_gc;
     CopyElements(&no_gc, new_elms, to_add, elms, 0, len);
     FillWithHoles(new_elms, new_length, capacity);
 
     elms = new_elms;
     array->set_elements(elms);
   } else {
@@ skipping 59 matching lines @@
   // Calculate the length of result array.
   int result_len = final - k;
   if (result_len < 0) {
     result_len = 0;
   }
 
   Object* result = AllocateJSArray();
   if (result->IsFailure()) return result;
   JSArray* result_array = JSArray::cast(result);
 
-  result = AllocateUninitializedFixedArray(result_len);
+  result = Heap::AllocateUninitializedFixedArray(result_len);
   if (result->IsFailure()) return result;
   FixedArray* result_elms = FixedArray::cast(result);
 
   FixedArray* elms = FixedArray::cast(array->elements());
 
   AssertNoAllocation no_gc;
   CopyElements(&no_gc, result_elms, 0, elms, k, result_len);
 
   // Set elements.
   result_array->set_elements(result_elms);
@@ skipping 48 matching lines @@
       return CallJsBuiltin("ArraySplice", args);
     }
   }
   int actualDeleteCount = Min(Max(deleteCount, 0), len - actualStart);
 
   // Allocate result array.
   Object* result = AllocateJSArray();
   if (result->IsFailure()) return result;
   JSArray* result_array = JSArray::cast(result);
 
-  result = AllocateUninitializedFixedArray(actualDeleteCount);
+  result = Heap::AllocateUninitializedFixedArray(actualDeleteCount);
   if (result->IsFailure()) return result;
   FixedArray* result_elms = FixedArray::cast(result);
 
   FixedArray* elms = FixedArray::cast(array->elements());
 
   AssertNoAllocation no_gc;
   // Fill newly created array.
   CopyElements(&no_gc, result_elms, 0, elms, actualStart, actualDeleteCount);
 
   // Set elements.
@@ skipping 17 matching lines @@
     // Currently fixed arrays cannot grow too big, so
     // we should never hit this case.
     ASSERT((itemCount - actualDeleteCount) <= (Smi::kMaxValue - len));
 
     FixedArray* source_elms = elms;
 
     // Check if array need to grow.
     if (new_length > elms->length()) {
       // New backing storage is needed.
       int capacity = new_length + (new_length >> 1) + 16;
-      Object* obj = AllocateUninitializedFixedArray(capacity);
+      Object* obj = Heap::AllocateUninitializedFixedArray(capacity);
       if (obj->IsFailure()) return obj;
       FixedArray* new_elms = FixedArray::cast(obj);
 
       // Copy the part before actualStart as is.
       CopyElements(&no_gc, new_elms, 0, elms, 0, actualStart);
       FillWithHoles(new_elms, new_length, capacity);
 
       source_elms = elms;
       elms = new_elms;
       array->set_elements(elms);
@@ skipping 661 matching lines @@
       if (entry->contains(pc)) {
         return names_[i];
       }
     }
   }
   return NULL;
 }
 
 
 } }  // namespace v8::internal