| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef V8_HEAP_SPACES_INL_H_ | 5 #ifndef V8_HEAP_SPACES_INL_H_ |
| 6 #define V8_HEAP_SPACES_INL_H_ | 6 #define V8_HEAP_SPACES_INL_H_ |
| 7 | 7 |
| 8 #include "src/heap/incremental-marking.h" | 8 #include "src/heap/incremental-marking.h" |
| 9 #include "src/heap/spaces.h" | 9 #include "src/heap/spaces.h" |
| 10 #include "src/isolate.h" | 10 #include "src/isolate.h" |
| (...skipping 147 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 158 return to_space_.ContainsSlow(a); | 158 return to_space_.ContainsSlow(a); |
| 159 } | 159 } |
| 160 | 160 |
| 161 bool NewSpace::FromSpaceContainsSlow(Address a) { | 161 bool NewSpace::FromSpaceContainsSlow(Address a) { |
| 162 return from_space_.ContainsSlow(a); | 162 return from_space_.ContainsSlow(a); |
| 163 } | 163 } |
| 164 | 164 |
| 165 bool NewSpace::ToSpaceContains(Object* o) { return to_space_.Contains(o); } | 165 bool NewSpace::ToSpaceContains(Object* o) { return to_space_.Contains(o); } |
| 166 bool NewSpace::FromSpaceContains(Object* o) { return from_space_.Contains(o); } | 166 bool NewSpace::FromSpaceContains(Object* o) { return from_space_.Contains(o); } |
| 167 | 167 |
| 168 size_t NewSpace::AllocatedSinceLastGC() { |
| 169 Page* top_page = Page::FromAllocationAreaAddress(top()); |
| 170 size_t allocated = 0; |
| 171 // If top gets reset to be in the range of pages that are below the age |
| 172 // mark, this loop will not trigger and we return 0 (invalid). |
| 173 for (Page* current_page = top_page; |
| 174 !current_page->InIntermediateGeneration() && |
| 175 current_page != to_space_.anchor(); |
| 176 current_page = current_page->prev_page()) { |
| 177 allocated += (top_page == current_page) |
| 178 ? static_cast<size_t>(top() - current_page->area_start()) |
| 179 : Page::kAllocatableMemory; |
| 180 } |
| 181 return allocated; |
| 182 } |
| 183 |
| 168 // -------------------------------------------------------------------------- | 184 // -------------------------------------------------------------------------- |
| 169 // AllocationResult | 185 // AllocationResult |
| 170 | 186 |
| 171 AllocationSpace AllocationResult::RetrySpace() { | 187 AllocationSpace AllocationResult::RetrySpace() { |
| 172 DCHECK(IsRetry()); | 188 DCHECK(IsRetry()); |
| 173 return static_cast<AllocationSpace>(Smi::cast(object_)->value()); | 189 return static_cast<AllocationSpace>(Smi::cast(object_)->value()); |
| 174 } | 190 } |
| 175 | 191 |
| 176 Page* Page::Initialize(Heap* heap, MemoryChunk* chunk, Executability executable, | 192 Page* Page::Initialize(Heap* heap, MemoryChunk* chunk, Executability executable, |
| 177 SemiSpace* owner) { | 193 SemiSpace* owner) { |
| (...skipping 457 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 635 other->allocation_info_.Reset(nullptr, nullptr); | 651 other->allocation_info_.Reset(nullptr, nullptr); |
| 636 return true; | 652 return true; |
| 637 } | 653 } |
| 638 return false; | 654 return false; |
| 639 } | 655 } |
| 640 | 656 |
| 641 } // namespace internal | 657 } // namespace internal |
| 642 } // namespace v8 | 658 } // namespace v8 |
| 643 | 659 |
| 644 #endif // V8_HEAP_SPACES_INL_H_ | 660 #endif // V8_HEAP_SPACES_INL_H_ |
| OLD | NEW |