OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 264 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
275 | 275 |
276 #ifdef DEBUG | 276 #ifdef DEBUG |
277 class HeapDebugUtils; | 277 class HeapDebugUtils; |
278 #endif | 278 #endif |
279 | 279 |
280 | 280 |
281 // A queue of objects promoted during scavenge. Each object is accompanied | 281 // A queue of objects promoted during scavenge. Each object is accompanied |
282 // by it's size to avoid dereferencing a map pointer for scanning. | 282 // by it's size to avoid dereferencing a map pointer for scanning. |
283 class PromotionQueue { | 283 class PromotionQueue { |
284 public: | 284 public: |
285 PromotionQueue(Heap* heap) | 285 explicit PromotionQueue(Heap* heap) |
286 : front_(NULL), | 286 : front_(NULL), |
287 rear_(NULL), | 287 rear_(NULL), |
288 limit_(NULL), | 288 limit_(NULL), |
289 emergency_stack_(0), | 289 emergency_stack_(0), |
290 heap_(heap) { } | 290 heap_(heap) { } |
291 | 291 |
292 void Initialize(); | 292 void Initialize(); |
293 | 293 |
294 void Destroy() { | 294 void Destroy() { |
295 ASSERT(is_empty()); | 295 ASSERT(is_empty()); |
(...skipping 2233 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2529 | 2529 |
2530 DISALLOW_IMPLICIT_CONSTRUCTORS(PathTracer); | 2530 DISALLOW_IMPLICIT_CONSTRUCTORS(PathTracer); |
2531 }; | 2531 }; |
2532 #endif // DEBUG || LIVE_OBJECT_LIST | 2532 #endif // DEBUG || LIVE_OBJECT_LIST |
2533 | 2533 |
2534 } } // namespace v8::internal | 2534 } } // namespace v8::internal |
2535 | 2535 |
2536 #undef HEAP | 2536 #undef HEAP |
2537 | 2537 |
2538 #endif // V8_HEAP_H_ | 2538 #endif // V8_HEAP_H_ |
OLD | NEW |