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 489 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
500 // TODO(hpayer): This may introduce a huge pause here. We | 500 // TODO(hpayer): This may introduce a huge pause here. We |
501 // just care about finish sweeping of the scan on scavenge page. | 501 // just care about finish sweeping of the scan on scavenge page. |
502 heap_->mark_compact_collector()->EnsureSweepingCompleted(); | 502 heap_->mark_compact_collector()->EnsureSweepingCompleted(); |
503 } | 503 } |
504 } | 504 } |
505 CHECK(page->owner() == heap_->old_pointer_space()); | 505 CHECK(page->owner() == heap_->old_pointer_space()); |
506 HeapObjectIterator iterator(page, NULL); | 506 HeapObjectIterator iterator(page, NULL); |
507 for (HeapObject* heap_object = iterator.Next(); heap_object != NULL; | 507 for (HeapObject* heap_object = iterator.Next(); heap_object != NULL; |
508 heap_object = iterator.Next()) { | 508 heap_object = iterator.Next()) { |
509 // We iterate over objects that contain new space pointers only. | 509 // We iterate over objects that contain new space pointers only. |
510 if (heap_object->MayContainNewSpacePointers()) { | 510 if (!heap_object->MayContainRawValues()) { |
511 FindPointersToNewSpaceInRegion( | 511 FindPointersToNewSpaceInRegion( |
512 heap_object->address() + HeapObject::kHeaderSize, | 512 heap_object->address() + HeapObject::kHeaderSize, |
513 heap_object->address() + heap_object->Size(), slot_callback, | 513 heap_object->address() + heap_object->Size(), slot_callback, |
514 clear_maps); | 514 clear_maps); |
515 } | 515 } |
516 } | 516 } |
517 } | 517 } |
518 } | 518 } |
519 } | 519 } |
520 } | 520 } |
(...skipping 51 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
572 } | 572 } |
573 old_buffer_is_sorted_ = false; | 573 old_buffer_is_sorted_ = false; |
574 old_buffer_is_filtered_ = false; | 574 old_buffer_is_filtered_ = false; |
575 *old_top_++ = reinterpret_cast<Address>(int_addr << kPointerSizeLog2); | 575 *old_top_++ = reinterpret_cast<Address>(int_addr << kPointerSizeLog2); |
576 DCHECK(old_top_ <= old_limit_); | 576 DCHECK(old_top_ <= old_limit_); |
577 } | 577 } |
578 heap_->isolate()->counters()->store_buffer_compactions()->Increment(); | 578 heap_->isolate()->counters()->store_buffer_compactions()->Increment(); |
579 } | 579 } |
580 } | 580 } |
581 } // namespace v8::internal | 581 } // namespace v8::internal |
OLD | NEW |