| 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 <algorithm> | 5 #include <algorithm> |
| 6 | 6 |
| 7 #include "src/v8.h" | 7 #include "src/v8.h" |
| 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" |
| (...skipping 480 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 491 case HeapObjectContents::kTaggedValues: { | 491 case HeapObjectContents::kTaggedValues: { |
| 492 Address start_address = obj_address + start_offset; | 492 Address start_address = obj_address + start_offset; |
| 493 Address end_address = obj_address + end_offset; | 493 Address end_address = obj_address + end_offset; |
| 494 // Object has only tagged fields. | 494 // Object has only tagged fields. |
| 495 FindPointersToNewSpaceInRegion(start_address, end_address, | 495 FindPointersToNewSpaceInRegion(start_address, end_address, |
| 496 slot_callback); | 496 slot_callback); |
| 497 break; | 497 break; |
| 498 } | 498 } |
| 499 | 499 |
| 500 case HeapObjectContents::kMixedValues: { | 500 case HeapObjectContents::kMixedValues: { |
| 501 if (FLAG_unbox_double_fields) { | 501 if (heap_object->IsFixedTypedArrayBase()) { |
| 502 FindPointersToNewSpaceInRegion( |
| 503 obj_address + FixedTypedArrayBase::kBasePointerOffset, |
| 504 obj_address + FixedTypedArrayBase::kHeaderSize, |
| 505 slot_callback); |
| 506 } else if (FLAG_unbox_double_fields) { |
| 502 LayoutDescriptorHelper helper(heap_object->map()); | 507 LayoutDescriptorHelper helper(heap_object->map()); |
| 503 DCHECK(!helper.all_fields_tagged()); | 508 DCHECK(!helper.all_fields_tagged()); |
| 504 for (int offset = start_offset; offset < end_offset;) { | 509 for (int offset = start_offset; offset < end_offset;) { |
| 505 int end_of_region_offset; | 510 int end_of_region_offset; |
| 506 if (helper.IsTagged(offset, end_offset, | 511 if (helper.IsTagged(offset, end_offset, |
| 507 &end_of_region_offset)) { | 512 &end_of_region_offset)) { |
| 508 FindPointersToNewSpaceInRegion( | 513 FindPointersToNewSpaceInRegion( |
| 509 obj_address + offset, | 514 obj_address + offset, |
| 510 obj_address + end_of_region_offset, slot_callback); | 515 obj_address + end_of_region_offset, slot_callback); |
| 511 } | 516 } |
| (...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 580 } | 585 } |
| 581 old_buffer_is_sorted_ = false; | 586 old_buffer_is_sorted_ = false; |
| 582 old_buffer_is_filtered_ = false; | 587 old_buffer_is_filtered_ = false; |
| 583 *old_top_++ = reinterpret_cast<Address>(int_addr << kPointerSizeLog2); | 588 *old_top_++ = reinterpret_cast<Address>(int_addr << kPointerSizeLog2); |
| 584 DCHECK(old_top_ <= old_limit_); | 589 DCHECK(old_top_ <= old_limit_); |
| 585 } | 590 } |
| 586 heap_->isolate()->counters()->store_buffer_compactions()->Increment(); | 591 heap_->isolate()->counters()->store_buffer_compactions()->Increment(); |
| 587 } | 592 } |
| 588 } // namespace internal | 593 } // namespace internal |
| 589 } // namespace v8 | 594 } // namespace v8 |
| OLD | NEW |