OLD | NEW |
1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 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 #include "src/v8.h" | 5 #include "src/v8.h" |
6 | 6 |
7 #include "src/gc-tracer.h" | 7 #include "src/heap/gc-tracer.h" |
8 | 8 |
9 namespace v8 { | 9 namespace v8 { |
10 namespace internal { | 10 namespace internal { |
11 | 11 |
12 static intptr_t CountTotalHolesSize(Heap* heap) { | 12 static intptr_t CountTotalHolesSize(Heap* heap) { |
13 intptr_t holes_size = 0; | 13 intptr_t holes_size = 0; |
14 OldSpaces spaces(heap); | 14 OldSpaces spaces(heap); |
15 for (OldSpace* space = spaces.next(); space != NULL; space = spaces.next()) { | 15 for (OldSpace* space = spaces.next(); space != NULL; space = spaces.next()) { |
16 holes_size += space->Waste() + space->Available(); | 16 holes_size += space->Waste() + space->Available(); |
17 } | 17 } |
(...skipping 358 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
376 durations += iter->incremental_marking_duration; | 376 durations += iter->incremental_marking_duration; |
377 ++iter; | 377 ++iter; |
378 } | 378 } |
379 | 379 |
380 if (durations == 0.0) return 0; | 380 if (durations == 0.0) return 0; |
381 | 381 |
382 return static_cast<intptr_t>(bytes / durations); | 382 return static_cast<intptr_t>(bytes / durations); |
383 } | 383 } |
384 } | 384 } |
385 } // namespace v8::internal | 385 } // namespace v8::internal |
OLD | NEW |