Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2012 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 "heap.h" |
| 18 | #include "heap_bitmap.h" |
| 19 | #include "mark_sweep.h" |
| 20 | #include "mod_union_table.h" |
| 21 | #include "space.h" |
| 22 | #include "stl_util.h" |
| 23 | #include "UniquePtr.h" |
| 24 | |
| 25 | namespace art { |
| 26 | |
| 27 | class MarkIfReachesAllocspaceVisitor { |
| 28 | public: |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 29 | explicit MarkIfReachesAllocspaceVisitor(MarkSweep* const mark_sweep, SpaceBitmap* bitmap) |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 30 | : mark_sweep_(mark_sweep), |
| 31 | bitmap_(bitmap) { |
| 32 | } |
| 33 | |
| 34 | // Extra parameters are required since we use this same visitor signature for checking objects. |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 35 | void operator ()(const Object* obj, const Object* ref, const MemberOffset& /* offset */, bool /* is_static */) const { |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 36 | // TODO: Optimize? |
| 37 | // TODO: C++0x auto |
| 38 | const Spaces& spaces = mark_sweep_->heap_->GetSpaces(); |
| 39 | for (Spaces::const_iterator cur = spaces.begin(); cur != spaces.end(); ++cur) { |
| 40 | if ((*cur)->IsAllocSpace() && (*cur)->Contains(ref)) { |
| 41 | bitmap_->Set(obj); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 42 | break; |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 43 | } |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 44 | } |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 45 | } |
| 46 | |
| 47 | private: |
| 48 | MarkSweep* const mark_sweep_; |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 49 | SpaceBitmap* bitmap_; |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 50 | }; |
| 51 | |
| 52 | class ModUnionVisitor { |
| 53 | public: |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 54 | explicit ModUnionVisitor(MarkSweep* const mark_sweep, SpaceBitmap* bitmap) |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 55 | : mark_sweep_(mark_sweep), |
| 56 | bitmap_(bitmap) { |
| 57 | } |
| 58 | |
| 59 | void operator ()(Object* obj) const { |
| 60 | DCHECK(obj != NULL); |
| 61 | // We don't have an early exit since we use the visitor pattern, an early |
| 62 | // exit should significantly speed this up. |
| 63 | MarkIfReachesAllocspaceVisitor visitor(mark_sweep_, bitmap_); |
| 64 | mark_sweep_->VisitObjectReferences(obj, visitor); |
| 65 | } |
| 66 | private: |
| 67 | MarkSweep* const mark_sweep_; |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 68 | SpaceBitmap* bitmap_; |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 69 | }; |
| 70 | |
| 71 | class ModUnionClearCardVisitor { |
| 72 | public: |
| 73 | explicit ModUnionClearCardVisitor(std::vector<byte*>* cleared_cards) |
| 74 | : cleared_cards_(cleared_cards) { |
| 75 | } |
| 76 | |
| 77 | void operator ()(byte* card) const { |
| 78 | cleared_cards_->push_back(card); |
| 79 | } |
| 80 | private: |
| 81 | std::vector<byte*>* cleared_cards_; |
| 82 | }; |
| 83 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 84 | ModUnionTableBitmap::ModUnionTableBitmap(Heap* heap) : ModUnionTable(heap) { |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 85 | // Prevent fragmentation of the heap which is caused by resizing of the vector. |
| 86 | // TODO: Make a new vector which uses madvise (basically same as a mark stack). |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 87 | cleared_cards_.reserve(32); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 88 | const Spaces& spaces = mark_sweep_->GetHeap()->GetSpaces(); |
| 89 | // Create one heap bitmap per image space. |
| 90 | // TODO: C++0x auto |
| 91 | for (Spaces::const_iterator it = spaces.begin(); it != spaces.end(); ++it) { |
| 92 | Space* space = *it; |
| 93 | if (space->IsImageSpace()) { |
| 94 | // The mod-union table is only needed when we have an image space since it's purpose is to |
| 95 | // cache image roots. |
| 96 | UniquePtr<SpaceBitmap> bitmap(SpaceBitmap::Create("mod-union table bitmap", space->Begin(), space->Capacity())); |
| 97 | CHECK(bitmap.get() != NULL) << "Failed to create mod-union bitmap"; |
| 98 | bitmaps_.Put(space, bitmap.release()); |
| 99 | } |
| 100 | } |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 101 | } |
| 102 | |
| 103 | ModUnionTableBitmap::~ModUnionTableBitmap() { |
| 104 | STLDeleteValues(&bitmaps_); |
| 105 | } |
| 106 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 107 | void ModUnionTableBitmap::ClearCards(Space* space) { |
| 108 | CardTable* card_table = mark_sweep_->heap_->GetCardTable(); |
| 109 | ModUnionClearCardVisitor visitor(&cleared_cards_); |
| 110 | // Clear dirty cards in the this image space and update the corresponding mod-union bits. |
| 111 | card_table->VisitClear(space->Begin(), space->End(), visitor); |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 112 | } |
| 113 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 114 | void ModUnionTableBitmap::Update() { |
| 115 | CardTable* card_table = mark_sweep_->heap_->GetCardTable(); |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 116 | while (!cleared_cards_.empty()) { |
| 117 | byte* card = cleared_cards_.back(); |
| 118 | cleared_cards_.pop_back(); |
| 119 | |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 120 | uintptr_t start = reinterpret_cast<uintptr_t>(card_table->AddrFromCard(card)); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 121 | uintptr_t end = start + GC_CARD_SIZE; |
| 122 | Space* space = heap_->FindSpaceFromObject(reinterpret_cast<Object*>(start)); |
| 123 | SpaceBitmap* bitmap = space->GetLiveBitmap(); |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 124 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 125 | // Clear the mod-union bitmap range corresponding to this card so that we don't have any |
| 126 | // objects marked which do not reach the alloc space. |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 127 | bitmap->VisitRange(start, end, SpaceBitmap::ClearVisitor(bitmap)); |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 128 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 129 | // At this point we need to update the mod-union bitmap to contain all the objects which reach |
| 130 | // the alloc space. |
| 131 | ModUnionVisitor visitor(mark_sweep_, bitmap); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 132 | space->GetLiveBitmap()->VisitMarkedRange(start, end, visitor); |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 133 | } |
| 134 | } |
| 135 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 136 | class ModUnionScanImageRootVisitor { |
| 137 | public: |
| 138 | ModUnionScanImageRootVisitor(MarkSweep* const mark_sweep) : mark_sweep_(mark_sweep) { |
| 139 | |
| 140 | } |
| 141 | |
| 142 | void operator ()(const Object* root) const { |
| 143 | DCHECK(root != NULL); |
| 144 | mark_sweep_->ScanObject(root); |
| 145 | } |
| 146 | |
| 147 | private: |
| 148 | MarkSweep* const mark_sweep_; |
| 149 | }; |
| 150 | |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 151 | void ModUnionTableBitmap::MarkReferences(MarkSweep* mark_sweep) { |
| 152 | // Some tests have no image space, and therefore no mod-union bitmap. |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 153 | ModUnionScanImageRootVisitor image_root_scanner(mark_sweep); |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 154 | for (BitmapMap::iterator cur = bitmaps_.begin(); cur != bitmaps_.end(); ++cur) { |
| 155 | const Space* space = cur->first; |
| 156 | uintptr_t begin = reinterpret_cast<uintptr_t>(space->Begin()); |
| 157 | uintptr_t end = reinterpret_cast<uintptr_t>(space->End()); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 158 | cur->second->VisitMarkedRange(begin, end, image_root_scanner); |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 159 | } |
| 160 | } |
| 161 | |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 162 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 163 | ModUnionTableReferenceCache::ModUnionTableReferenceCache(Heap* heap) : ModUnionTable(heap) { |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 164 | cleared_cards_.reserve(32); |
| 165 | } |
| 166 | |
| 167 | ModUnionTableReferenceCache::~ModUnionTableReferenceCache() { |
| 168 | |
| 169 | } |
| 170 | |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 171 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 172 | void ModUnionTableReferenceCache::ClearCards(Space* space) { |
| 173 | CardTable* card_table = GetMarkSweep()->GetHeap()->GetCardTable(); |
| 174 | ModUnionClearCardVisitor visitor(&cleared_cards_); |
| 175 | // Clear dirty cards in the this space and update the corresponding mod-union bits. |
| 176 | card_table->VisitClear(space->Begin(), space->End(), visitor); |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 177 | } |
| 178 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 179 | class AddToReferenceArrayVisitor { |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 180 | public: |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 181 | explicit AddToReferenceArrayVisitor( |
| 182 | ModUnionTableReferenceCache* const mod_union_table, |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 183 | ModUnionTableReferenceCache::ReferenceArray* references) |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 184 | : mod_union_table_(mod_union_table), |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 185 | references_(references) { |
| 186 | } |
| 187 | |
| 188 | // Extra parameters are required since we use this same visitor signature for checking objects. |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 189 | void operator ()(const Object* obj, const Object* ref, const MemberOffset& /* offset */, |
| 190 | bool /* is_static */) const { |
| 191 | // Only add the reference if it fits our criteria. |
| 192 | if (mod_union_table_->AddReference(obj, ref)) { |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 193 | references_->push_back(ref); |
| 194 | } |
| 195 | } |
| 196 | |
| 197 | private: |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 198 | ModUnionTableReferenceCache* mod_union_table_; |
| 199 | ModUnionTable::ReferenceArray* references_; |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 200 | }; |
| 201 | |
| 202 | class ModUnionReferenceVisitor { |
| 203 | public: |
| 204 | explicit ModUnionReferenceVisitor( |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 205 | ModUnionTableReferenceCache* const mod_union_table, |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 206 | ModUnionTableReferenceCache::ReferenceArray* references) |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 207 | : mod_union_table_(mod_union_table), |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 208 | references_(references) { |
| 209 | } |
| 210 | |
| 211 | void operator ()(Object* obj) const { |
| 212 | DCHECK(obj != NULL); |
| 213 | // We don't have an early exit since we use the visitor pattern, an early |
| 214 | // exit should significantly speed this up. |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 215 | AddToReferenceArrayVisitor visitor(mod_union_table_, references_); |
| 216 | mod_union_table_->GetMarkSweep()->VisitObjectReferences(obj, visitor); |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 217 | } |
| 218 | private: |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 219 | ModUnionTableReferenceCache* const mod_union_table_; |
| 220 | ModUnionTable::ReferenceArray* references_; |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 221 | }; |
| 222 | |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 223 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 224 | class CheckReferenceVisitor { |
| 225 | public: |
| 226 | typedef std::set<const Object*> ReferenceSet; |
| 227 | |
| 228 | explicit CheckReferenceVisitor( |
| 229 | ModUnionTableReferenceCache* const mod_union_table, |
| 230 | const ReferenceSet& references) |
| 231 | : mod_union_table_(mod_union_table), |
| 232 | references_(references) { |
| 233 | } |
| 234 | |
| 235 | // Extra parameters are required since we use this same visitor signature for checking objects. |
| 236 | void operator ()(const Object* obj, const Object* ref, const MemberOffset& /* offset */, bool /* is_static */) const { |
| 237 | Heap* heap = mod_union_table_->GetMarkSweep()->GetHeap(); |
| 238 | if (mod_union_table_->AddReference(obj, ref) && references_.find(ref) == references_.end()) { |
| 239 | Space* from_space = heap->FindSpaceFromObject(obj); |
| 240 | Space* to_space = heap->FindSpaceFromObject(ref); |
| 241 | LOG(INFO) << "Object " << reinterpret_cast<const void*>(obj) << "(" << PrettyTypeOf(obj) << ")" |
| 242 | << "References " << reinterpret_cast<const void*>(ref) |
| 243 | << "(" << PrettyTypeOf(ref) << ") without being in mod-union table"; |
| 244 | LOG(INFO) << "FromSpace " << from_space->GetName() << " type " << from_space->GetGcRetentionPolicy(); |
| 245 | LOG(INFO) << "ToSpace " << to_space->GetName() << " type " << to_space->GetGcRetentionPolicy(); |
| 246 | mod_union_table_->GetHeap()->DumpSpaces(); |
| 247 | LOG(FATAL) << "FATAL ERROR"; |
| 248 | } |
| 249 | } |
| 250 | |
| 251 | private: |
| 252 | ModUnionTableReferenceCache* const mod_union_table_; |
| 253 | const ReferenceSet& references_; |
| 254 | }; |
| 255 | |
| 256 | class ModUnionCheckReferences { |
| 257 | public: |
| 258 | typedef std::set<const Object*> ReferenceSet; |
| 259 | |
| 260 | explicit ModUnionCheckReferences ( |
| 261 | ModUnionTableReferenceCache* const mod_union_table, |
| 262 | const ReferenceSet& references) |
| 263 | : mod_union_table_(mod_union_table), |
| 264 | references_(references) { |
| 265 | } |
| 266 | |
| 267 | void operator ()(Object* obj) const { |
| 268 | DCHECK(obj != NULL); |
| 269 | MarkSweep* mark_sweep = mod_union_table_->GetMarkSweep(); |
| 270 | CheckReferenceVisitor visitor(mod_union_table_, references_); |
| 271 | mark_sweep->VisitObjectReferences(obj, visitor); |
| 272 | } |
| 273 | |
| 274 | private: |
| 275 | ModUnionTableReferenceCache* const mod_union_table_; |
| 276 | const ReferenceSet& references_; |
| 277 | }; |
| 278 | |
| 279 | void ModUnionTableReferenceCache::Verify() { |
| 280 | #if VERIFY_MOD_UNION |
| 281 | // Start by checking that everything in the mod union table is marked. |
| 282 | Heap* heap = GetMarkSweep()->GetHeap(); |
| 283 | for (ReferenceMap::const_iterator it = references_.begin(); it != references_.end(); ++it) { |
| 284 | for (ReferenceArray::const_iterator it_ref = it->second.begin(); it_ref != it->second.end(); ++it_ref ) { |
| 285 | DCHECK(heap->GetLiveBitmap()->Test(*it_ref)); |
| 286 | } |
| 287 | } |
| 288 | |
| 289 | // Check the references of each clean card which is also in the mod union table. |
| 290 | for (ReferenceMap::const_iterator it = references_.begin(); it != references_.end(); ++it) { |
| 291 | const byte* card = &*it->first; |
| 292 | if (*card == GC_CARD_CLEAN) { |
| 293 | std::set<const Object*> reference_set; |
| 294 | for (ReferenceArray::const_iterator itr = it->second.begin(); itr != it->second.end();++itr) { |
| 295 | reference_set.insert(*itr); |
| 296 | } |
| 297 | ModUnionCheckReferences visitor(this, reference_set); |
| 298 | CardTable* card_table = heap->GetCardTable(); |
| 299 | uintptr_t start = reinterpret_cast<uintptr_t>(card_table->AddrFromCard(card)); |
| 300 | uintptr_t end = start + GC_CARD_SIZE; |
| 301 | SpaceBitmap* live_bitmap = |
| 302 | heap->FindSpaceFromObject(reinterpret_cast<Object*>(start))->GetLiveBitmap(); |
| 303 | live_bitmap->VisitMarkedRange(start, end, visitor); |
| 304 | } |
| 305 | } |
| 306 | #endif |
| 307 | } |
| 308 | |
| 309 | void ModUnionTableReferenceCache::Update() { |
| 310 | Heap* heap = GetMarkSweep()->GetHeap(); |
| 311 | CardTable* card_table = heap->GetCardTable(); |
| 312 | |
| 313 | ReferenceArray cards_references; |
| 314 | ModUnionReferenceVisitor visitor(this, &cards_references); |
| 315 | |
| 316 | for (size_t i = 0; i < cleared_cards_.size(); ++i) { |
| 317 | byte* card = cleared_cards_[i]; |
| 318 | |
| 319 | // Clear and re-compute alloc space references associated with this card. |
| 320 | cards_references.clear(); |
| 321 | uintptr_t start = reinterpret_cast<uintptr_t>(card_table->AddrFromCard(card)); |
| 322 | uintptr_t end = start + GC_CARD_SIZE; |
| 323 | SpaceBitmap* live_bitmap = |
| 324 | heap->FindSpaceFromObject(reinterpret_cast<Object*>(start))->GetLiveBitmap(); |
| 325 | live_bitmap->VisitMarkedRange(start, end, visitor); |
| 326 | |
| 327 | // Update the corresponding references for the card. |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 328 | // TODO: C++0x auto |
| 329 | ReferenceMap::iterator found = references_.find(card); |
| 330 | if (found == references_.end()) { |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 331 | if (cards_references.empty()) { |
| 332 | // No reason to add empty array. |
| 333 | continue; |
| 334 | } |
| 335 | references_.Put(card, cards_references); |
| 336 | } else { |
| 337 | found->second = cards_references; |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 338 | } |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 339 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 340 | cleared_cards_.clear(); |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 341 | } |
| 342 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 343 | void ModUnionTableReferenceCache::MarkReferences() { |
| 344 | Heap* heap = GetMarkSweep()->GetHeap(); |
| 345 | HeapBitmap* mark_bitmap = heap->GetMarkBitmap(); |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 346 | // TODO: C++0x auto |
| 347 | size_t count = 0; |
| 348 | for (ReferenceMap::const_iterator it = references_.begin(); it != references_.end(); ++it) { |
| 349 | for (ReferenceArray::const_iterator it_ref = it->second.begin(); it_ref != it->second.end(); ++it_ref ) { |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 350 | mark_bitmap->Set(*it_ref); |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 351 | ++count; |
| 352 | } |
| 353 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame^] | 354 | if (VLOG_IS_ON(heap)) { |
| 355 | VLOG(gc) << "Marked " << count << " references in mod union table"; |
| 356 | } |
| 357 | } |
| 358 | |
| 359 | ModUnionTableCardCache::ModUnionTableCardCache(Heap* heap) : ModUnionTable(heap) { |
| 360 | |
| 361 | } |
| 362 | |
| 363 | ModUnionTableCardCache::~ModUnionTableCardCache() { |
| 364 | |
| 365 | } |
| 366 | |
| 367 | class ModUnionClearCardSetVisitor { |
| 368 | public: |
| 369 | explicit ModUnionClearCardSetVisitor(std::set<byte*>* const cleared_cards) |
| 370 | : cleared_cards_(cleared_cards) { |
| 371 | } |
| 372 | |
| 373 | void operator ()(byte* card) const { |
| 374 | cleared_cards_->insert(card); |
| 375 | } |
| 376 | private: |
| 377 | std::set<byte*>* const cleared_cards_; |
| 378 | }; |
| 379 | |
| 380 | void ModUnionTableCardCache::ClearCards(Space* space) { |
| 381 | CardTable* card_table = GetMarkSweep()->GetHeap()->GetCardTable(); |
| 382 | ModUnionClearCardSetVisitor visitor(&cleared_cards_); |
| 383 | // Clear dirty cards in the this space and update the corresponding mod-union bits. |
| 384 | card_table->VisitClear(space->Begin(), space->End(), visitor); |
| 385 | } |
| 386 | |
| 387 | // Mark all references to the alloc space(s). |
| 388 | void ModUnionTableCardCache::MarkReferences() { |
| 389 | CardTable* card_table = heap_->GetCardTable(); |
| 390 | ModUnionScanImageRootVisitor visitor(GetMarkSweep()); |
| 391 | for (ClearedCards::const_iterator it = cleared_cards_.begin(); it != cleared_cards_.end(); ++it) { |
| 392 | byte* card = *it; |
| 393 | uintptr_t start = reinterpret_cast<uintptr_t>(card_table->AddrFromCard(card)); |
| 394 | uintptr_t end = start + GC_CARD_SIZE; |
| 395 | SpaceBitmap* live_bitmap = |
| 396 | heap_->FindSpaceFromObject(reinterpret_cast<Object*>(start))->GetLiveBitmap(); |
| 397 | live_bitmap->VisitMarkedRange(start, end, visitor); |
| 398 | } |
Mathieu Chartier | e6e0651 | 2012-06-26 15:00:26 -0700 | [diff] [blame] | 399 | } |
| 400 | |
| 401 | } // namespace art |