OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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/heap/store-buffer.h" | 5 #include "src/heap/store-buffer.h" |
6 | 6 |
7 #include <algorithm> | 7 #include <algorithm> |
8 | 8 |
9 #include "src/counters.h" | 9 #include "src/counters.h" |
10 #include "src/heap/store-buffer-inl.h" | 10 #include "src/heap/store-buffer-inl.h" |
| 11 #include "src/isolate.h" |
| 12 #include "src/objects-inl.h" |
11 #include "src/v8.h" | 13 #include "src/v8.h" |
12 | 14 |
13 namespace v8 { | 15 namespace v8 { |
14 namespace internal { | 16 namespace internal { |
15 | 17 |
16 StoreBuffer::StoreBuffer(Heap* heap) | 18 StoreBuffer::StoreBuffer(Heap* heap) |
17 : heap_(heap), | 19 : heap_(heap), |
18 start_(NULL), | 20 start_(NULL), |
19 limit_(NULL), | 21 limit_(NULL), |
20 old_start_(NULL), | 22 old_start_(NULL), |
(...skipping 550 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
571 } | 573 } |
572 old_buffer_is_sorted_ = false; | 574 old_buffer_is_sorted_ = false; |
573 old_buffer_is_filtered_ = false; | 575 old_buffer_is_filtered_ = false; |
574 *old_top_++ = reinterpret_cast<Address>(int_addr << kPointerSizeLog2); | 576 *old_top_++ = reinterpret_cast<Address>(int_addr << kPointerSizeLog2); |
575 DCHECK(old_top_ <= old_limit_); | 577 DCHECK(old_top_ <= old_limit_); |
576 } | 578 } |
577 heap_->isolate()->counters()->store_buffer_compactions()->Increment(); | 579 heap_->isolate()->counters()->store_buffer_compactions()->Increment(); |
578 } | 580 } |
579 } // namespace internal | 581 } // namespace internal |
580 } // namespace v8 | 582 } // namespace v8 |
OLD | NEW |