[Interpreter] Add BytecodeArray class and add to SharedFunctionInfo.

src/heap/heap.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/v8.h"
 
 #include "src/accessors.h"
 #include "src/api.h"
 #include "src/base/bits.h"
 #include "src/base/once.h"
@@ skipping 3026 matching lines @@
     external_map()->set_is_extensible(false);
 #undef ALLOCATE_VARSIZE_MAP
 #undef ALLOCATE_MAP
   }
 
   {  // Empty arrays
     {
       ByteArray* byte_array;
       if (!AllocateByteArray(0, TENURED).To(&byte_array)) return false;
       set_empty_byte_array(byte_array);
+
+      BytecodeArray* bytecode_array;
+      if (!AllocateBytecodeArray(0, nullptr, TENURED).To(&bytecode_array)) {
+        return false;
+      }
+      set_empty_bytecode_array(bytecode_array);
     }
 
 #define ALLOCATE_EMPTY_EXTERNAL_ARRAY(Type, type, TYPE, ctype, size)  \
   {                                                                   \
     ExternalArray* obj;                                               \
     if (!AllocateEmptyExternalArray(kExternal##Type##Array).To(&obj)) \
       return false;                                                   \
     set_empty_external_##type##_array(obj);                           \
   }
 
@@ skipping 722 matching lines @@
     AllocationResult allocation = AllocateRaw(size, space, OLD_SPACE);
     if (!allocation.To(&result)) return allocation;
   }
 
   result->set_map_no_write_barrier(byte_array_map());
   ByteArray::cast(result)->set_length(length);
   return result;
 }
 
 
+AllocationResult Heap::AllocateBytecodeArray(int length,
+                                             const byte* const start,
+                                             PretenureFlag pretenure) {
+  if (length < 0 || length > BytecodeArray::kMaxLength) {
+    v8::internal::Heap::FatalProcessOutOfMemory("invalid array length", true);
+  }
+  int size = BytecodeArray::SizeFor(length);
+  AllocationSpace space = SelectSpace(size, pretenure);
+  HeapObject* result;
+  {
+    AllocationResult allocation = AllocateRaw(size, space, OLD_SPACE);
+    if (!allocation.To(&result)) return allocation;
+  }
+
+  BytecodeArray* instance = BytecodeArray::cast(result);
+  instance->set_length(length);
+  CopyBytes(instance->GetDataStartAddress(), start, length);
+  result->set_map_no_write_barrier(byte_array_map());
+  return result;
+}
+
+
 void Heap::CreateFillerObjectAt(Address addr, int size) {
   if (size == 0) return;
   HeapObject* filler = HeapObject::FromAddress(addr);
   if (size == kPointerSize) {
     filler->set_map_no_write_barrier(raw_unchecked_one_pointer_filler_map());
   } else if (size == 2 * kPointerSize) {
     filler->set_map_no_write_barrier(raw_unchecked_two_pointer_filler_map());
   } else {
     filler->set_map_no_write_barrier(raw_unchecked_free_space_map());
     FreeSpace::cast(filler)->nobarrier_set_size(size);
@@ skipping 3093 matching lines @@
     *object_type = "CODE_TYPE";                                                \
     *object_sub_type = "CODE_AGE/" #name;                                      \
     return true;
     CODE_AGE_LIST_COMPLETE(COMPARE_AND_RETURN_NAME)
 #undef COMPARE_AND_RETURN_NAME
   }
   return false;
 }
 }  // namespace internal
 }  // namespace v8