| Index: src/heap.cc
|
| ===================================================================
|
| --- src/heap.cc (revision 8209)
|
| +++ src/heap.cc (working copy)
|
| @@ -153,29 +153,6 @@
|
| max_semispace_size_ = reserved_semispace_size_ = V8_MAX_SEMISPACE_SIZE;
|
| #endif
|
|
|
| - intptr_t max_virtual = OS::MaxVirtualMemory();
|
| -
|
| - if (max_virtual > 0) {
|
| - intptr_t half = max_virtual >> 1;
|
| - intptr_t quarter = max_virtual >> 2;
|
| - // If we have limits on the amount of virtual memory we can use then we may
|
| - // be forced to lower the allocation limits. We reserve one quarter of the
|
| - // memory for young space and off-heap data. The rest is distributed as
|
| - // described below.
|
| - if (code_range_size_ > 0) {
|
| - // Reserve a quarter of the memory for the code range. The old space
|
| - // heap gets the remaining half. There is some unavoidable double
|
| - // counting going on here since the heap size is measured in committed
|
| - // virtual memory and the code range is only reserved virtual memory.
|
| - code_range_size_ = Min(code_range_size_, quarter);
|
| - max_old_generation_size_ = Min(max_old_generation_size_, half);
|
| - } else {
|
| - // Reserve three quarters of the memory for the old space heap including
|
| - // the executable code.
|
| - max_old_generation_size_ = Min(max_old_generation_size_, half + quarter);
|
| - }
|
| - }
|
| -
|
| memset(roots_, 0, sizeof(roots_[0]) * kRootListLength);
|
| global_contexts_list_ = NULL;
|
| mark_compact_collector_.heap_ = this;
|
|
|