OLD | NEW |
1 // Copyright 2016 the V8 project authors. All rights reserved. | 1 // Copyright 2016 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 HEAP_HEAP_UTILS_H_ | 5 #ifndef HEAP_HEAP_UTILS_H_ |
6 #define HEAP_HEAP_UTILS_H_ | 6 #define HEAP_HEAP_UTILS_H_ |
7 | 7 |
8 #include "src/heap/heap.h" | 8 #include "src/heap/heap.h" |
9 | 9 |
10 namespace v8 { | 10 namespace v8 { |
(...skipping 26 matching lines...) Expand all Loading... |
37 // marking is completed. | 37 // marking is completed. |
38 void SimulateIncrementalMarking(i::Heap* heap, bool force_completion = true); | 38 void SimulateIncrementalMarking(i::Heap* heap, bool force_completion = true); |
39 | 39 |
40 // Helper function that simulates a full old-space in the heap. | 40 // Helper function that simulates a full old-space in the heap. |
41 void SimulateFullSpace(v8::internal::PagedSpace* space); | 41 void SimulateFullSpace(v8::internal::PagedSpace* space); |
42 | 42 |
43 void AbandonCurrentlyFreeMemory(PagedSpace* space); | 43 void AbandonCurrentlyFreeMemory(PagedSpace* space); |
44 | 44 |
45 void GcAndSweep(Heap* heap, AllocationSpace space); | 45 void GcAndSweep(Heap* heap, AllocationSpace space); |
46 | 46 |
| 47 // Helper function to make sure that the new space's top is not double-aligned. |
| 48 void MakeSureNewSpaceTopIsNotDoubleAligned(i::Heap* heap); |
| 49 |
47 } // namespace heap | 50 } // namespace heap |
48 } // namespace internal | 51 } // namespace internal |
49 } // namespace v8 | 52 } // namespace v8 |
50 | 53 |
51 #endif // HEAP_HEAP_UTILS_H_ | 54 #endif // HEAP_HEAP_UTILS_H_ |
OLD | NEW |