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/base/atomicops.h" | 9 #include "src/base/atomicops.h" |
10 #include "src/counters.h" | 10 #include "src/counters.h" |
(...skipping 468 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
479 PagedSpace* owner = reinterpret_cast<PagedSpace*>(page->owner()); | 479 PagedSpace* owner = reinterpret_cast<PagedSpace*>(page->owner()); |
480 Address start = page->area_start(); | 480 Address start = page->area_start(); |
481 Address end = page->area_end(); | 481 Address end = page->area_end(); |
482 if (owner == heap_->map_space()) { | 482 if (owner == heap_->map_space()) { |
483 DCHECK(page->WasSweptPrecisely()); | 483 DCHECK(page->WasSweptPrecisely()); |
484 HeapObjectIterator iterator(page, NULL); | 484 HeapObjectIterator iterator(page, NULL); |
485 for (HeapObject* heap_object = iterator.Next(); heap_object != NULL; | 485 for (HeapObject* heap_object = iterator.Next(); heap_object != NULL; |
486 heap_object = iterator.Next()) { | 486 heap_object = iterator.Next()) { |
487 // We skip free space objects. | 487 // We skip free space objects. |
488 if (!heap_object->IsFiller()) { | 488 if (!heap_object->IsFiller()) { |
| 489 DCHECK(heap_object->IsMap()); |
489 FindPointersToNewSpaceInRegion( | 490 FindPointersToNewSpaceInRegion( |
490 heap_object->address() + HeapObject::kHeaderSize, | 491 heap_object->address() + Map::kPointerFieldsBeginOffset, |
491 heap_object->address() + heap_object->Size(), slot_callback, | 492 heap_object->address() + Map::kPointerFieldsEndOffset, |
492 clear_maps); | 493 slot_callback, clear_maps); |
493 } | 494 } |
494 } | 495 } |
495 } else { | 496 } else { |
496 if (!page->SweepingCompleted()) { | 497 if (!page->SweepingCompleted()) { |
497 heap_->mark_compact_collector()->SweepInParallel(page, owner); | 498 heap_->mark_compact_collector()->SweepInParallel(page, owner); |
498 if (!page->SweepingCompleted()) { | 499 if (!page->SweepingCompleted()) { |
499 // We were not able to sweep that page, i.e., a concurrent | 500 // We were not able to sweep that page, i.e., a concurrent |
500 // sweeper thread currently owns this page. | 501 // sweeper thread currently owns this page. |
501 // TODO(hpayer): This may introduce a huge pause here. We | 502 // TODO(hpayer): This may introduce a huge pause here. We |
502 // just care about finish sweeping of the scan on scavenge page. | 503 // just care about finish sweeping of the scan on scavenge page. |
(...skipping 77 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
580 } | 581 } |
581 old_buffer_is_sorted_ = false; | 582 old_buffer_is_sorted_ = false; |
582 old_buffer_is_filtered_ = false; | 583 old_buffer_is_filtered_ = false; |
583 *old_top_++ = reinterpret_cast<Address>(int_addr << kPointerSizeLog2); | 584 *old_top_++ = reinterpret_cast<Address>(int_addr << kPointerSizeLog2); |
584 DCHECK(old_top_ <= old_limit_); | 585 DCHECK(old_top_ <= old_limit_); |
585 } | 586 } |
586 heap_->isolate()->counters()->store_buffer_compactions()->Increment(); | 587 heap_->isolate()->counters()->store_buffer_compactions()->Increment(); |
587 } | 588 } |
588 } | 589 } |
589 } // namespace v8::internal | 590 } // namespace v8::internal |
OLD | NEW |