Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
| 4 | 4 |
| 5 #include "vm/scavenger.h" | 5 #include "vm/scavenger.h" |
| 6 | 6 |
| 7 #include <algorithm> | 7 #include <algorithm> |
| 8 #include <map> | 8 #include <map> |
| 9 #include <utility> | 9 #include <utility> |
| 10 | 10 |
| 11 #include "vm/dart.h" | 11 #include "vm/dart.h" |
| 12 #include "vm/dart_api_state.h" | 12 #include "vm/dart_api_state.h" |
| 13 #include "vm/isolate.h" | 13 #include "vm/isolate.h" |
| 14 #include "vm/object.h" | 14 #include "vm/object.h" |
| 15 #include "vm/stack_frame.h" | 15 #include "vm/stack_frame.h" |
| 16 #include "vm/store_buffer.h" | 16 #include "vm/store_buffer.h" |
| 17 #include "vm/verifier.h" | 17 #include "vm/verifier.h" |
| 18 #include "vm/visitor.h" | 18 #include "vm/visitor.h" |
| 19 #include "vm/weak_table.h" | |
| 19 | 20 |
| 20 namespace dart { | 21 namespace dart { |
| 21 | 22 |
| 22 // Scavenger uses RawObject::kMarkBit to distinguish forwaded and non-forwarded | 23 // Scavenger uses RawObject::kMarkBit to distinguish forwaded and non-forwarded |
| 23 // objects. The kMarkBit does not intersect with the target address because of | 24 // objects. The kMarkBit does not intersect with the target address because of |
| 24 // object alignment. | 25 // object alignment. |
| 25 enum { | 26 enum { |
| 26 kForwardingMask = 1 << RawObject::kMarkBit, | 27 kForwardingMask = 1 << RawObject::kMarkBit, |
| 27 kNotForwarded = 0, | 28 kNotForwarded = 0, |
| 28 kForwarded = kForwardingMask, | 29 kForwarded = kForwardingMask, |
| (...skipping 520 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 549 // Key is white. Delay the weak property. | 550 // Key is white. Delay the weak property. |
| 550 visitor->DelayWeakProperty(raw_weak); | 551 visitor->DelayWeakProperty(raw_weak); |
| 551 return raw_weak->Size(); | 552 return raw_weak->Size(); |
| 552 } | 553 } |
| 553 } | 554 } |
| 554 // Key is gray or black. Make the weak property black. | 555 // Key is gray or black. Make the weak property black. |
| 555 return raw_weak->VisitPointers(visitor); | 556 return raw_weak->VisitPointers(visitor); |
| 556 } | 557 } |
| 557 | 558 |
| 558 | 559 |
| 559 void Scavenger::ProcessPeerReferents() { | 560 void Scavenger::ProcessWeakTables() { |
| 560 PeerTable prev; | 561 for (Heap::WeakSelector sel = static_cast<Heap::WeakSelector>(0); |
| 561 std::swap(prev, peer_table_); | 562 sel < Heap::kNumWeakSelectors; |
| 562 for (PeerTable::iterator it = prev.begin(); it != prev.end(); ++it) { | 563 sel++) { |
| 563 RawObject* raw_obj = it->first; | 564 WeakTable* table = heap_->GetWeakTable(Heap::kNew, sel); |
| 564 ASSERT(raw_obj->IsHeapObject()); | 565 intptr_t size = table->size(); |
| 565 uword raw_addr = RawObject::ToAddr(raw_obj); | 566 heap_->SetWeakTable(Heap::kNew, sel, WeakTable::NewFrom(table)); |
| 566 uword header = *reinterpret_cast<uword*>(raw_addr); | 567 for (intptr_t i = 0; i < size; i++) { |
| 567 if (IsForwarding(header)) { | 568 if (table->IsValidEntryAt(i)) { |
| 568 // The object has survived. Preserve its record. | 569 RawObject* raw_obj = table->ObjectAt(i); |
| 569 uword new_addr = ForwardedAddr(header); | 570 ASSERT(raw_obj->IsHeapObject()); |
| 570 raw_obj = RawObject::FromAddr(new_addr); | 571 uword raw_addr = RawObject::ToAddr(raw_obj); |
| 571 heap_->SetPeer(raw_obj, it->second); | 572 uword header = *reinterpret_cast<uword*>(raw_addr); |
|
siva
2013/06/27 22:11:33
how does this work for deleted entries (they are c
Ivan Posva
2013/06/27 23:59:12
ditto.
| |
| 573 if (IsForwarding(header)) { | |
| 574 // The object has survived. Preserve its record. | |
| 575 uword new_addr = ForwardedAddr(header); | |
| 576 raw_obj = RawObject::FromAddr(new_addr); | |
| 577 heap_->SetWeakEntry(raw_obj, sel, table->ValueAt(i)); | |
| 578 } | |
| 579 } | |
| 572 } | 580 } |
| 573 } | 581 } |
| 574 } | 582 } |
| 575 | 583 |
| 576 | 584 |
| 577 void Scavenger::VisitObjectPointers(ObjectPointerVisitor* visitor) const { | 585 void Scavenger::VisitObjectPointers(ObjectPointerVisitor* visitor) const { |
| 578 uword cur = FirstObjectStart(); | 586 uword cur = FirstObjectStart(); |
| 579 while (cur < top_) { | 587 while (cur < top_) { |
| 580 RawObject* raw_obj = RawObject::FromAddr(cur); | 588 RawObject* raw_obj = RawObject::FromAddr(cur); |
| 581 cur += raw_obj->VisitPointers(visitor); | 589 cur += raw_obj->VisitPointers(visitor); |
| (...skipping 36 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 618 ScavengerVisitor visitor(isolate, this); | 626 ScavengerVisitor visitor(isolate, this); |
| 619 Prologue(isolate, invoke_api_callbacks); | 627 Prologue(isolate, invoke_api_callbacks); |
| 620 IterateRoots(isolate, &visitor, !invoke_api_callbacks); | 628 IterateRoots(isolate, &visitor, !invoke_api_callbacks); |
| 621 int64_t start = OS::GetCurrentTimeMicros(); | 629 int64_t start = OS::GetCurrentTimeMicros(); |
| 622 ProcessToSpace(&visitor); | 630 ProcessToSpace(&visitor); |
| 623 int64_t middle = OS::GetCurrentTimeMicros(); | 631 int64_t middle = OS::GetCurrentTimeMicros(); |
| 624 IterateWeakReferences(isolate, &visitor); | 632 IterateWeakReferences(isolate, &visitor); |
| 625 ScavengerWeakVisitor weak_visitor(this); | 633 ScavengerWeakVisitor weak_visitor(this); |
| 626 IterateWeakRoots(isolate, &weak_visitor, invoke_api_callbacks); | 634 IterateWeakRoots(isolate, &weak_visitor, invoke_api_callbacks); |
| 627 visitor.Finalize(); | 635 visitor.Finalize(); |
| 628 ProcessPeerReferents(); | 636 ProcessWeakTables(); |
| 629 int64_t end = OS::GetCurrentTimeMicros(); | 637 int64_t end = OS::GetCurrentTimeMicros(); |
| 630 heap_->RecordTime(kProcessToSpace, middle - start); | 638 heap_->RecordTime(kProcessToSpace, middle - start); |
| 631 heap_->RecordTime(kIterateWeaks, end - middle); | 639 heap_->RecordTime(kIterateWeaks, end - middle); |
| 632 Epilogue(isolate, invoke_api_callbacks); | 640 Epilogue(isolate, invoke_api_callbacks); |
| 633 | 641 |
| 634 if (FLAG_verify_after_gc) { | 642 if (FLAG_verify_after_gc) { |
| 635 OS::PrintErr("Verifying after Scavenge..."); | 643 OS::PrintErr("Verifying after Scavenge..."); |
| 636 heap_->Verify(); | 644 heap_->Verify(); |
| 637 OS::PrintErr(" done.\n"); | 645 OS::PrintErr(" done.\n"); |
| 638 } | 646 } |
| 639 | 647 |
| 640 // Done scavenging. Reset the marker. | 648 // Done scavenging. Reset the marker. |
| 641 ASSERT(scavenging_); | 649 ASSERT(scavenging_); |
| 642 scavenging_ = false; | 650 scavenging_ = false; |
| 643 } | 651 } |
| 644 | 652 |
| 645 | 653 |
| 646 void Scavenger::WriteProtect(bool read_only) { | 654 void Scavenger::WriteProtect(bool read_only) { |
| 647 space_->Protect( | 655 space_->Protect( |
| 648 read_only ? VirtualMemory::kReadOnly : VirtualMemory::kReadWrite); | 656 read_only ? VirtualMemory::kReadOnly : VirtualMemory::kReadWrite); |
| 649 } | 657 } |
| 650 | 658 |
| 651 | 659 |
| 652 void Scavenger::SetPeer(RawObject* raw_obj, void* peer) { | |
| 653 if (peer == NULL) { | |
| 654 peer_table_.erase(raw_obj); | |
| 655 } else { | |
| 656 peer_table_[raw_obj] = peer; | |
| 657 } | |
| 658 } | |
| 659 | |
| 660 | |
| 661 void* Scavenger::GetPeer(RawObject* raw_obj) { | |
| 662 PeerTable::iterator it = peer_table_.find(raw_obj); | |
| 663 return (it == peer_table_.end()) ? NULL : it->second; | |
| 664 } | |
| 665 | |
| 666 | |
| 667 int64_t Scavenger::PeerCount() const { | |
| 668 return static_cast<int64_t>(peer_table_.size()); | |
| 669 } | |
| 670 | |
| 671 } // namespace dart | 660 } // namespace dart |
| OLD | NEW |