[interpreter] A couple of minor tweaks to BytecodeArray.

test/cctest/test-heap.cc

 // Copyright 2012 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 553 matching lines @@
   heap->CollectGarbage(OLD_SPACE);
 
   CHECK(WeakPointerCleared);
 }
 
 
 TEST(BytecodeArray) {
   static const uint8_t kRawBytes[] = {0xc3, 0x7e, 0xa5, 0x5a};
   static const int kRawBytesSize = sizeof(kRawBytes);
   static const int kFrameSize = 32;
-  static const int kNumberOfLocals = 20;
 
   CcTest::InitializeVM();
   Isolate* isolate = CcTest::i_isolate();
   Heap* heap = isolate->heap();
   Factory* factory = isolate->factory();
   HandleScope scope(isolate);
 
   // Allocate and initialize BytecodeArray
   Handle<BytecodeArray> array =
-      factory->NewBytecodeArray(kRawBytesSize, kRawBytes);
-
-  array->set_frame_size(kFrameSize);
-  array->set_number_of_locals(kNumberOfLocals);
+      factory->NewBytecodeArray(kRawBytesSize, kRawBytes, kFrameSize);
 
   CHECK(array->IsBytecodeArray());
   CHECK_EQ(array->length(), (int)sizeof(kRawBytes));
+  CHECK_EQ(array->frame_size(), kFrameSize);
   CHECK_LE(array->address(), array->GetFirstBytecodeAddress());
   CHECK_GE(array->address() + array->BytecodeArraySize(),
            array->GetFirstBytecodeAddress() + array->length());
   for (int i = 0; i < kRawBytesSize; i++) {
     CHECK_EQ(array->GetFirstBytecodeAddress()[i], kRawBytes[i]);
     CHECK_EQ(array->get(i), kRawBytes[i]);
   }
 
   // Full garbage collection
   heap->CollectAllGarbage();
 
   // BytecodeArray should survive
   CHECK_EQ(array->length(), kRawBytesSize);
-  CHECK_EQ(array->number_of_locals(), kNumberOfLocals);
   CHECK_EQ(array->frame_size(), kFrameSize);
 
   for (int i = 0; i < kRawBytesSize; i++) {
     CHECK_EQ(array->get(i), kRawBytes[i]);
     CHECK_EQ(array->GetFirstBytecodeAddress()[i], kRawBytes[i]);
   }
 }
 
 
 static const char* not_so_random_string_table[] = {
@@ skipping 5431 matching lines @@
   size_t counter2 = 2000;
   tracer->SampleAllocation(time2, counter2, counter2);
   size_t throughput = tracer->AllocationThroughputInBytesPerMillisecond(100);
   CHECK_EQ(2 * (counter2 - counter1) / (time2 - time1), throughput);
   int time3 = 1000;
   size_t counter3 = 30000;
   tracer->SampleAllocation(time3, counter3, counter3);
   throughput = tracer->AllocationThroughputInBytesPerMillisecond(100);
   CHECK_EQ(2 * (counter3 - counter1) / (time3 - time1), throughput);
 }