| 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 "store-buffer.h" | 5 #include "src/store-buffer.h" |
| 6 | 6 |
| 7 #include <algorithm> | 7 #include <algorithm> |
| 8 | 8 |
| 9 #include "v8.h" | 9 #include "src/v8.h" |
| 10 #include "counters.h" | 10 #include "src/counters.h" |
| 11 #include "store-buffer-inl.h" | 11 #include "src/store-buffer-inl.h" |
| 12 | 12 |
| 13 namespace v8 { | 13 namespace v8 { |
| 14 namespace internal { | 14 namespace internal { |
| 15 | 15 |
| 16 StoreBuffer::StoreBuffer(Heap* heap) | 16 StoreBuffer::StoreBuffer(Heap* heap) |
| 17 : heap_(heap), | 17 : heap_(heap), |
| 18 start_(NULL), | 18 start_(NULL), |
| 19 limit_(NULL), | 19 limit_(NULL), |
| 20 old_start_(NULL), | 20 old_start_(NULL), |
| 21 old_limit_(NULL), | 21 old_limit_(NULL), |
| (...skipping 587 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 609 } | 609 } |
| 610 old_buffer_is_sorted_ = false; | 610 old_buffer_is_sorted_ = false; |
| 611 old_buffer_is_filtered_ = false; | 611 old_buffer_is_filtered_ = false; |
| 612 *old_top_++ = reinterpret_cast<Address>(int_addr << kPointerSizeLog2); | 612 *old_top_++ = reinterpret_cast<Address>(int_addr << kPointerSizeLog2); |
| 613 ASSERT(old_top_ <= old_limit_); | 613 ASSERT(old_top_ <= old_limit_); |
| 614 } | 614 } |
| 615 heap_->isolate()->counters()->store_buffer_compactions()->Increment(); | 615 heap_->isolate()->counters()->store_buffer_compactions()->Increment(); |
| 616 } | 616 } |
| 617 | 617 |
| 618 } } // namespace v8::internal | 618 } } // namespace v8::internal |
| OLD | NEW |