| Index: src/heap.cc
|
| diff --git a/src/heap.cc b/src/heap.cc
|
| index e81a0e3b3b3e3dd7fc7ec8826f323949e6f093d3..a363143db6ea5af87e0fe780ea9183e1e1b2d36e 100644
|
| --- a/src/heap.cc
|
| +++ b/src/heap.cc
|
| @@ -2911,23 +2911,6 @@ MaybeObject* Heap::AllocateHeapNumber(double value, PretenureFlag pretenure) {
|
| }
|
|
|
|
|
| -MaybeObject* Heap::AllocateHeapNumber(double value) {
|
| - // Use general version, if we're forced to always allocate.
|
| - if (always_allocate()) return AllocateHeapNumber(value, TENURED);
|
| -
|
| - // This version of AllocateHeapNumber is optimized for
|
| - // allocation in new space.
|
| - STATIC_ASSERT(HeapNumber::kSize <= Page::kMaxNonCodeHeapObjectSize);
|
| - Object* result;
|
| - { MaybeObject* maybe_result = new_space_.AllocateRaw(HeapNumber::kSize);
|
| - if (!maybe_result->ToObject(&result)) return maybe_result;
|
| - }
|
| - HeapObject::cast(result)->set_map_no_write_barrier(heap_number_map());
|
| - HeapNumber::cast(result)->set_value(value);
|
| - return result;
|
| -}
|
| -
|
| -
|
| MaybeObject* Heap::AllocateCell(Object* value) {
|
| Object* result;
|
| { MaybeObject* maybe_result = AllocateRawCell();
|
| @@ -4065,9 +4048,6 @@ MaybeObject* Heap::AllocateByteArray(int length, PretenureFlag pretenure) {
|
| if (length < 0 || length > ByteArray::kMaxLength) {
|
| return Failure::OutOfMemoryException(0x7);
|
| }
|
| - if (pretenure == NOT_TENURED) {
|
| - return AllocateByteArray(length);
|
| - }
|
| int size = ByteArray::SizeFor(length);
|
| AllocationSpace space =
|
| (size > Page::kMaxNonCodeHeapObjectSize) ? LO_SPACE : OLD_DATA_SPACE;
|
| @@ -4083,25 +4063,6 @@ MaybeObject* Heap::AllocateByteArray(int length, PretenureFlag pretenure) {
|
| }
|
|
|
|
|
| -MaybeObject* Heap::AllocateByteArray(int length) {
|
| - if (length < 0 || length > ByteArray::kMaxLength) {
|
| - return Failure::OutOfMemoryException(0x8);
|
| - }
|
| - int size = ByteArray::SizeFor(length);
|
| - AllocationSpace space =
|
| - (size > Page::kMaxNonCodeHeapObjectSize) ? LO_SPACE : NEW_SPACE;
|
| - Object* result;
|
| - { MaybeObject* maybe_result = AllocateRaw(size, space, OLD_DATA_SPACE);
|
| - if (!maybe_result->ToObject(&result)) return maybe_result;
|
| - }
|
| -
|
| - reinterpret_cast<ByteArray*>(result)->set_map_no_write_barrier(
|
| - byte_array_map());
|
| - reinterpret_cast<ByteArray*>(result)->set_length(length);
|
| - return result;
|
| -}
|
| -
|
| -
|
| void Heap::CreateFillerObjectAt(Address addr, int size) {
|
| if (size == 0) return;
|
| HeapObject* filler = HeapObject::FromAddress(addr);
|
| @@ -5452,24 +5413,6 @@ MaybeObject* Heap::CopyFixedDoubleArrayWithMap(FixedDoubleArray* src,
|
| }
|
|
|
|
|
| -MaybeObject* Heap::AllocateFixedArray(int length) {
|
| - ASSERT(length >= 0);
|
| - if (length == 0) return empty_fixed_array();
|
| - Object* result;
|
| - { MaybeObject* maybe_result = AllocateRawFixedArray(length);
|
| - if (!maybe_result->ToObject(&result)) return maybe_result;
|
| - }
|
| - // Initialize header.
|
| - FixedArray* array = reinterpret_cast<FixedArray*>(result);
|
| - array->set_map_no_write_barrier(fixed_array_map());
|
| - array->set_length(length);
|
| - // Initialize body.
|
| - ASSERT(!InNewSpace(undefined_value()));
|
| - MemsetPointer(array->data_start(), undefined_value(), length);
|
| - return result;
|
| -}
|
| -
|
| -
|
| MaybeObject* Heap::AllocateRawFixedArray(int length, PretenureFlag pretenure) {
|
| if (length < 0 || length > FixedArray::kMaxLength) {
|
| return Failure::OutOfMemoryException(0xe);
|
|
|