blob: afa50540c232b4371f5a2dedcfee2a965c3350eb [file] [log] [blame]
Hiroshi Yamauchi38e68e92014-03-07 13:59:08 -08001/*
2 * Copyright (C) 2014 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17#include "remembered_set.h"
18
19#include "base/stl_util.h"
20#include "card_table-inl.h"
21#include "heap_bitmap.h"
22#include "gc/collector/mark_sweep.h"
23#include "gc/collector/mark_sweep-inl.h"
24#include "gc/collector/semi_space.h"
25#include "gc/heap.h"
26#include "gc/space/space.h"
27#include "mirror/art_field-inl.h"
28#include "mirror/object-inl.h"
29#include "mirror/class-inl.h"
30#include "mirror/object_array-inl.h"
31#include "space_bitmap-inl.h"
32#include "thread.h"
33#include "UniquePtr.h"
34
35namespace art {
36namespace gc {
37namespace accounting {
38
39class RememberedSetCardVisitor {
40 public:
41 explicit RememberedSetCardVisitor(RememberedSet::CardSet* const dirty_cards)
42 : dirty_cards_(dirty_cards) {}
43
44 void operator()(byte* card, byte expected_value, byte new_value) const {
45 if (expected_value == CardTable::kCardDirty) {
46 dirty_cards_->insert(card);
47 }
48 }
49
50 private:
51 RememberedSet::CardSet* const dirty_cards_;
52};
53
54void RememberedSet::ClearCards() {
55 CardTable* card_table = GetHeap()->GetCardTable();
56 RememberedSetCardVisitor card_visitor(&dirty_cards_);
57 // Clear dirty cards in the space and insert them into the dirty card set.
58 card_table->ModifyCardsAtomic(space_->Begin(), space_->End(), AgeCardVisitor(), card_visitor);
59}
60
61class RememberedSetReferenceVisitor {
62 public:
Mathieu Chartier407f7022014-02-18 14:37:05 -080063 RememberedSetReferenceVisitor(MarkHeapReferenceCallback* callback,
64 space::ContinuousSpace* target_space,
Hiroshi Yamauchi38e68e92014-03-07 13:59:08 -080065 bool* const contains_reference_to_target_space, void* arg)
66 : callback_(callback), target_space_(target_space), arg_(arg),
67 contains_reference_to_target_space_(contains_reference_to_target_space) {}
68
Mathieu Chartier407f7022014-02-18 14:37:05 -080069 void operator()(mirror::Object* obj, MemberOffset offset, bool /* is_static */) const
Hiroshi Yamauchi38e68e92014-03-07 13:59:08 -080070 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) {
Mathieu Chartier407f7022014-02-18 14:37:05 -080071 mirror::HeapReference<mirror::Object>* ref_ptr = obj->GetFieldObjectReferenceAddr(offset);
72 if (target_space_->HasAddress(ref_ptr->AsMirrorPtr())) {
73 *contains_reference_to_target_space_ = true;
74 callback_(ref_ptr, arg_);
75 DCHECK(!target_space_->HasAddress(ref_ptr->AsMirrorPtr()));
Hiroshi Yamauchi38e68e92014-03-07 13:59:08 -080076 }
77 }
78
79 private:
Mathieu Chartier407f7022014-02-18 14:37:05 -080080 MarkHeapReferenceCallback* const callback_;
Hiroshi Yamauchi38e68e92014-03-07 13:59:08 -080081 space::ContinuousSpace* const target_space_;
82 void* const arg_;
83 bool* const contains_reference_to_target_space_;
84};
85
86class RememberedSetObjectVisitor {
87 public:
Mathieu Chartier407f7022014-02-18 14:37:05 -080088 RememberedSetObjectVisitor(MarkHeapReferenceCallback* callback,
89 space::ContinuousSpace* target_space,
Hiroshi Yamauchi38e68e92014-03-07 13:59:08 -080090 bool* const contains_reference_to_target_space, void* arg)
91 : callback_(callback), target_space_(target_space), arg_(arg),
92 contains_reference_to_target_space_(contains_reference_to_target_space) {}
93
94 void operator()(mirror::Object* obj) const EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_)
95 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) {
Hiroshi Yamauchi38e68e92014-03-07 13:59:08 -080096 RememberedSetReferenceVisitor ref_visitor(callback_, target_space_,
97 contains_reference_to_target_space_, arg_);
Mathieu Chartier407f7022014-02-18 14:37:05 -080098 obj->VisitReferences<kMovingClasses>(ref_visitor);
Hiroshi Yamauchi38e68e92014-03-07 13:59:08 -080099 }
100
101 private:
Mathieu Chartier407f7022014-02-18 14:37:05 -0800102 MarkHeapReferenceCallback* const callback_;
Hiroshi Yamauchi38e68e92014-03-07 13:59:08 -0800103 space::ContinuousSpace* const target_space_;
104 void* const arg_;
105 bool* const contains_reference_to_target_space_;
106};
107
Mathieu Chartier407f7022014-02-18 14:37:05 -0800108void RememberedSet::UpdateAndMarkReferences(MarkHeapReferenceCallback* callback,
Hiroshi Yamauchi38e68e92014-03-07 13:59:08 -0800109 space::ContinuousSpace* target_space, void* arg) {
110 CardTable* card_table = heap_->GetCardTable();
111 bool contains_reference_to_target_space = false;
112 RememberedSetObjectVisitor obj_visitor(callback, target_space,
113 &contains_reference_to_target_space, arg);
114 SpaceBitmap* bitmap = space_->GetLiveBitmap();
115 CardSet remove_card_set;
116 for (byte* const card_addr : dirty_cards_) {
117 contains_reference_to_target_space = false;
118 uintptr_t start = reinterpret_cast<uintptr_t>(card_table->AddrFromCard(card_addr));
119 DCHECK(space_->HasAddress(reinterpret_cast<mirror::Object*>(start)));
120 bitmap->VisitMarkedRange(start, start + CardTable::kCardSize, obj_visitor);
121 if (!contains_reference_to_target_space) {
122 // It was in the dirty card set, but it didn't actually contain
123 // a reference to the target space. So, remove it from the dirty
124 // card set so we won't have to scan it again (unless it gets
125 // dirty again.)
126 remove_card_set.insert(card_addr);
127 }
128 }
129
130 // Remove the cards that didn't contain a reference to the target
131 // space from the dirty card set.
132 for (byte* const card_addr : remove_card_set) {
133 DCHECK(dirty_cards_.find(card_addr) != dirty_cards_.end());
134 dirty_cards_.erase(card_addr);
135 }
136}
137
138void RememberedSet::Dump(std::ostream& os) {
139 CardTable* card_table = heap_->GetCardTable();
140 os << "RememberedSet dirty cards: [";
141 for (const byte* card_addr : dirty_cards_) {
142 auto start = reinterpret_cast<uintptr_t>(card_table->AddrFromCard(card_addr));
143 auto end = start + CardTable::kCardSize;
144 os << reinterpret_cast<void*>(start) << "-" << reinterpret_cast<void*>(end) << "\n";
145 }
146 os << "]";
147}
148
149void RememberedSet::AssertAllDirtyCardsAreWithinSpace() const {
150 CardTable* card_table = heap_->GetCardTable();
151 for (const byte* card_addr : dirty_cards_) {
152 auto start = reinterpret_cast<byte*>(card_table->AddrFromCard(card_addr));
153 auto end = start + CardTable::kCardSize;
Hiroshi Yamauchic93c5302014-03-20 16:15:37 -0700154 DCHECK_LE(space_->Begin(), start);
155 DCHECK_LE(end, space_->Limit());
Hiroshi Yamauchi38e68e92014-03-07 13:59:08 -0800156 }
157}
158
159} // namespace accounting
160} // namespace gc
161} // namespace art