OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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_INCREMENTAL_MARKING_H_ | 5 #ifndef V8_HEAP_INCREMENTAL_MARKING_H_ |
6 #define V8_HEAP_INCREMENTAL_MARKING_H_ | 6 #define V8_HEAP_INCREMENTAL_MARKING_H_ |
7 | 7 |
8 | 8 |
9 #include "src/execution.h" | 9 #include "src/execution.h" |
10 #include "src/heap/mark-compact.h" | 10 #include "src/heap/mark-compact.h" |
(...skipping 32 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
43 } | 43 } |
44 | 44 |
45 void SetWeakClosureWasOverApproximatedForTesting(bool val) { | 45 void SetWeakClosureWasOverApproximatedForTesting(bool val) { |
46 weak_closure_was_overapproximated_ = val; | 46 weak_closure_was_overapproximated_ = val; |
47 } | 47 } |
48 | 48 |
49 inline bool IsStopped() { return state() == STOPPED; } | 49 inline bool IsStopped() { return state() == STOPPED; } |
50 | 50 |
51 INLINE(bool IsMarking()) { return state() >= MARKING; } | 51 INLINE(bool IsMarking()) { return state() >= MARKING; } |
52 | 52 |
53 inline bool CanDoSteps() { | 53 inline bool IsMarkingIncomplete() { return state() == MARKING; } |
54 return FLAG_incremental_marking_steps && | |
55 (state() == MARKING || state() == SWEEPING); | |
56 } | |
57 | 54 |
58 inline bool IsComplete() { return state() == COMPLETE; } | 55 inline bool IsComplete() { return state() == COMPLETE; } |
59 | 56 |
60 inline bool IsReadyToOverApproximateWeakClosure() const { | 57 inline bool IsReadyToOverApproximateWeakClosure() const { |
61 return request_type_ == OVERAPPROXIMATION && | 58 return request_type_ == OVERAPPROXIMATION && |
62 !weak_closure_was_overapproximated_; | 59 !weak_closure_was_overapproximated_; |
63 } | 60 } |
64 | 61 |
65 GCRequestType request_type() const { return request_type_; } | 62 GCRequestType request_type() const { return request_type_; } |
66 | 63 |
(...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
98 // incremental marker until it completes. | 95 // incremental marker until it completes. |
99 // Do some marking every time this much memory has been allocated or that many | 96 // Do some marking every time this much memory has been allocated or that many |
100 // heavy (color-checking) write barriers have been invoked. | 97 // heavy (color-checking) write barriers have been invoked. |
101 static const intptr_t kAllocatedThreshold = 65536; | 98 static const intptr_t kAllocatedThreshold = 65536; |
102 static const intptr_t kWriteBarriersInvokedThreshold = 32768; | 99 static const intptr_t kWriteBarriersInvokedThreshold = 32768; |
103 // Start off by marking this many times more memory than has been allocated. | 100 // Start off by marking this many times more memory than has been allocated. |
104 static const intptr_t kInitialMarkingSpeed = 1; | 101 static const intptr_t kInitialMarkingSpeed = 1; |
105 // But if we are promoting a lot of data we need to mark faster to keep up | 102 // But if we are promoting a lot of data we need to mark faster to keep up |
106 // with the data that is entering the old space through promotion. | 103 // with the data that is entering the old space through promotion. |
107 static const intptr_t kFastMarking = 3; | 104 static const intptr_t kFastMarking = 3; |
108 static const intptr_t kOldSpaceAllocationMarkingFactor = | |
109 kFastMarking / kInitialMarkingSpeed; | |
110 // After this many steps we increase the marking/allocating factor. | 105 // After this many steps we increase the marking/allocating factor. |
111 static const intptr_t kMarkingSpeedAccellerationInterval = 1024; | 106 static const intptr_t kMarkingSpeedAccellerationInterval = 1024; |
112 // This is how much we increase the marking/allocating factor by. | 107 // This is how much we increase the marking/allocating factor by. |
113 static const intptr_t kMarkingSpeedAccelleration = 2; | 108 static const intptr_t kMarkingSpeedAccelleration = 2; |
114 static const intptr_t kMaxMarkingSpeed = 1000; | 109 static const intptr_t kMaxMarkingSpeed = 1000; |
115 | 110 |
116 // This is the upper bound for how many times we allow finalization of | 111 // This is the upper bound for how many times we allow finalization of |
117 // incremental marking to be postponed. | 112 // incremental marking to be postponed. |
118 static const size_t kMaxIdleMarkingDelayCounter = 3; | 113 static const size_t kMaxIdleMarkingDelayCounter = 3; |
119 | 114 |
(...skipping 141 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
261 int weak_closure_approximation_rounds_; | 256 int weak_closure_approximation_rounds_; |
262 | 257 |
263 GCRequestType request_type_; | 258 GCRequestType request_type_; |
264 | 259 |
265 DISALLOW_IMPLICIT_CONSTRUCTORS(IncrementalMarking); | 260 DISALLOW_IMPLICIT_CONSTRUCTORS(IncrementalMarking); |
266 }; | 261 }; |
267 } | 262 } |
268 } // namespace v8::internal | 263 } // namespace v8::internal |
269 | 264 |
270 #endif // V8_HEAP_INCREMENTAL_MARKING_H_ | 265 #endif // V8_HEAP_INCREMENTAL_MARKING_H_ |
OLD | NEW |