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_OBJECTS_VISITING_H_ | 5 #ifndef V8_OBJECTS_VISITING_H_ |
6 #define V8_OBJECTS_VISITING_H_ | 6 #define V8_OBJECTS_VISITING_H_ |
7 | 7 |
8 #include "src/allocation.h" | 8 #include "src/allocation.h" |
9 #include "src/layout-descriptor.h" | 9 #include "src/layout-descriptor.h" |
10 | 10 |
(...skipping 471 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
482 | 482 |
483 class WeakObjectRetainer; | 483 class WeakObjectRetainer; |
484 | 484 |
485 | 485 |
486 // A weak list is single linked list where each element has a weak pointer to | 486 // A weak list is single linked list where each element has a weak pointer to |
487 // the next element. Given the head of the list, this function removes dead | 487 // the next element. Given the head of the list, this function removes dead |
488 // elements from the list and if requested records slots for next-element | 488 // elements from the list and if requested records slots for next-element |
489 // pointers. The template parameter T is a WeakListVisitor that defines how to | 489 // pointers. The template parameter T is a WeakListVisitor that defines how to |
490 // access the next-element pointers. | 490 // access the next-element pointers. |
491 template <class T> | 491 template <class T> |
492 Object* VisitWeakList(Heap* heap, Object* list, WeakObjectRetainer* retainer, | 492 Object* VisitWeakList(Heap* heap, Object* list, WeakObjectRetainer* retainer); |
493 bool stop_after_young); | |
494 } | 493 } |
495 } // namespace v8::internal | 494 } // namespace v8::internal |
496 | 495 |
497 #endif // V8_OBJECTS_VISITING_H_ | 496 #endif // V8_OBJECTS_VISITING_H_ |
OLD | NEW |