| 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 22 matching lines...) Expand all Loading... |
| 33 void SimulateFullSpace(v8::internal::NewSpace* space, | 33 void SimulateFullSpace(v8::internal::NewSpace* space, |
| 34 std::vector<Handle<FixedArray>>* out_handles = nullptr); | 34 std::vector<Handle<FixedArray>>* out_handles = nullptr); |
| 35 | 35 |
| 36 // Helper function that simulates many incremental marking steps until | 36 // Helper function that simulates many incremental marking steps until |
| 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); |
| 44 |
| 45 void GcAndSweep(Heap* heap, AllocationSpace space); |
| 46 |
| 43 } // namespace heap | 47 } // namespace heap |
| 44 } // namespace internal | 48 } // namespace internal |
| 45 } // namespace v8 | 49 } // namespace v8 |
| 46 | 50 |
| 47 #endif // HEAP_HEAP_UTILS_H_ | 51 #endif // HEAP_HEAP_UTILS_H_ |
| OLD | NEW |