Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1 | // Copyright (C) 2008 The Android Open Source Project |
| 2 | // |
| 3 | // Licensed under the Apache License, Version 2.0 (the "License"); |
| 4 | // you may not use this file except in compliance with the License. |
| 5 | // You may obtain a copy of the License at |
| 6 | // |
| 7 | // http://www.apache.org/licenses/LICENSE-2.0 |
| 8 | // |
| 9 | // Unless required by applicable law or agreed to in writing, software |
| 10 | // distributed under the License is distributed on an "AS IS" BASIS, |
| 11 | // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 12 | // See the License for the specific language governing permissions and |
| 13 | // limitations under the License. |
| 14 | |
Brian Carlstrom | 578bbdc | 2011-07-21 14:07:47 -0700 | [diff] [blame] | 15 | #include "object_bitmap.h" |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 16 | |
| 17 | #include <sys/mman.h> |
| 18 | |
Brian Carlstrom | 578bbdc | 2011-07-21 14:07:47 -0700 | [diff] [blame] | 19 | #include "logging.h" |
| 20 | #include "scoped_ptr.h" |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 21 | |
| 22 | namespace art { |
| 23 | |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 24 | HeapBitmap* HeapBitmap::Create(byte* base, size_t length) { |
| 25 | scoped_ptr<HeapBitmap> bitmap(new HeapBitmap(base, length)); |
| 26 | if (!bitmap->Init(base, length)) { |
| 27 | return NULL; |
| 28 | } else { |
| 29 | return bitmap.release(); |
| 30 | } |
| 31 | } |
| 32 | |
| 33 | // Initialize a HeapBitmap so that it points to a bitmap large enough |
| 34 | // to cover a heap at <base> of <maxSize> bytes, where objects are |
| 35 | // guaranteed to be kAlignment-aligned. |
| 36 | bool HeapBitmap::Init(const byte* base, size_t max_size) { |
| 37 | CHECK(base != NULL); |
| 38 | size_t length = HB_OFFSET_TO_INDEX(max_size) * kWordSize; |
Brian Carlstrom | db4d540 | 2011-08-09 12:18:28 -0700 | [diff] [blame^] | 39 | mem_map_.reset(MemMap::Map(length, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS)); |
| 40 | if (mem_map_ == NULL) { |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 41 | LOG(ERROR) << "mmap failed"; |
| 42 | return false; |
| 43 | } |
Brian Carlstrom | db4d540 | 2011-08-09 12:18:28 -0700 | [diff] [blame^] | 44 | words_ = reinterpret_cast<word*>(mem_map_->GetAddress()); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 45 | num_bytes_ = length; |
| 46 | base_ = reinterpret_cast<uintptr_t>(base); |
| 47 | max_ = base_ - 1; |
| 48 | return true; |
| 49 | } |
| 50 | |
| 51 | // Clean up any resources associated with the bitmap. |
Brian Carlstrom | db4d540 | 2011-08-09 12:18:28 -0700 | [diff] [blame^] | 52 | HeapBitmap::~HeapBitmap() {} |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 53 | |
| 54 | // Fill the bitmap with zeroes. Returns the bitmap's memory to the |
| 55 | // system as a side-effect. |
| 56 | void HeapBitmap::Clear() { |
| 57 | if (words_ != NULL) { |
| 58 | // This returns the memory to the system. Successive page faults |
| 59 | // will return zeroed memory. |
| 60 | int result = madvise(words_, num_bytes_, MADV_DONTNEED); |
| 61 | if (result == -1) { |
| 62 | PLOG(WARNING) << "madvise failed"; |
| 63 | } |
| 64 | max_ = base_ - 1; |
| 65 | } |
| 66 | } |
| 67 | |
| 68 | // Return true iff <obj> is within the range of pointers that this |
| 69 | // bitmap could potentially cover, even if a bit has not been set for |
| 70 | // it. |
| 71 | bool HeapBitmap::HasAddress(const void* obj) const { |
| 72 | if (obj != NULL) { |
| 73 | const uintptr_t offset = (uintptr_t)obj - base_; |
| 74 | const size_t index = HB_OFFSET_TO_INDEX(offset); |
| 75 | return index < num_bytes_ / kWordSize; |
| 76 | } |
| 77 | return false; |
| 78 | } |
| 79 | |
| 80 | // Visits set bits in address order. The callback is not permitted to |
| 81 | // change the bitmap bits or max during the traversal. |
| 82 | void HeapBitmap::Walk(HeapBitmap::Callback* callback, void* arg) { |
| 83 | CHECK(words_ != NULL); |
| 84 | CHECK(callback != NULL); |
| 85 | uintptr_t end = HB_OFFSET_TO_INDEX(max_ - base_); |
| 86 | for (uintptr_t i = 0; i <= end; ++i) { |
| 87 | unsigned long word = words_[i]; |
| 88 | if (word != 0) { |
| 89 | unsigned long high_bit = 1 << (kBitsPerWord - 1); |
| 90 | uintptr_t ptr_base = HB_INDEX_TO_OFFSET(i) + base_; |
| 91 | while (word != 0) { |
| 92 | const int shift = CLZ(word); |
| 93 | Object* obj = (Object *)(ptr_base + shift * kAlignment); |
| 94 | (*callback)(obj, arg); |
| 95 | word &= ~(high_bit >> shift); |
| 96 | } |
| 97 | } |
| 98 | } |
| 99 | } |
| 100 | |
| 101 | // Similar to Walk but the callback routine is permitted to change the |
| 102 | // bitmap bits and max during traversal. Used by the the root marking |
| 103 | // scan exclusively. |
| 104 | // |
| 105 | // The callback is invoked with a finger argument. The finger is a |
| 106 | // pointer to an address not yet visited by the traversal. If the |
| 107 | // callback sets a bit for an address at or above the finger, this |
| 108 | // address will be visited by the traversal. If the callback sets a |
| 109 | // bit for an address below the finger, this address will not be |
| 110 | // visited. |
| 111 | void HeapBitmap::ScanWalk(uintptr_t base, uintptr_t max, |
| 112 | ScanCallback* callback, void* arg) { |
| 113 | CHECK(words_ != NULL); |
| 114 | CHECK(callback != NULL); |
| 115 | CHECK(base <= max); |
| 116 | CHECK(base >= base_); |
| 117 | CHECK(max <= max_); |
| 118 | uintptr_t end = HB_OFFSET_TO_INDEX(max - base); |
| 119 | for (uintptr_t i = 0; i <= end; ++i) { |
| 120 | unsigned long word = words_[i]; |
| 121 | if (word != 0) { |
| 122 | unsigned long high_bit = 1 << (kBitsPerWord - 1); |
| 123 | uintptr_t ptr_base = HB_INDEX_TO_OFFSET(i) + base_; |
| 124 | void* finger = (void*)(HB_INDEX_TO_OFFSET(i + 1) + base_); |
| 125 | while (word != 0) { |
| 126 | const int shift = CLZ(word); |
| 127 | Object* obj = (Object*)(ptr_base + shift * kAlignment); |
| 128 | (*callback)(obj, finger, arg); |
| 129 | word &= ~(high_bit >> shift); |
| 130 | } |
| 131 | end = HB_OFFSET_TO_INDEX(max_ - base_); |
| 132 | } |
| 133 | } |
| 134 | } |
| 135 | |
| 136 | // Walk through the bitmaps in increasing address order, and find the |
| 137 | // object pointers that correspond to garbage objects. Call |
| 138 | // <callback> zero or more times with lists of these object pointers. |
| 139 | // |
| 140 | // The callback is not permitted to increase the max of either bitmap. |
| 141 | void HeapBitmap::SweepWalk(const HeapBitmap& live_bitmap, |
| 142 | const HeapBitmap& mark_bitmap, |
| 143 | uintptr_t base, uintptr_t max, |
| 144 | HeapBitmap::SweepCallback* callback, void* arg) { |
| 145 | CHECK(live_bitmap.words_ != NULL); |
| 146 | CHECK(mark_bitmap.words_ != NULL); |
| 147 | CHECK(live_bitmap.base_ == mark_bitmap.base_); |
| 148 | CHECK(live_bitmap.num_bytes_ == mark_bitmap.num_bytes_); |
| 149 | CHECK(callback != NULL); |
| 150 | CHECK(base <= max); |
| 151 | CHECK(base >= live_bitmap.base_); |
| 152 | CHECK(max <= live_bitmap.max_); |
| 153 | if (live_bitmap.max_ < live_bitmap.base_) { |
| 154 | // Easy case; both are obviously empty. |
| 155 | // TODO: this should never happen |
| 156 | return; |
| 157 | } |
| 158 | void* pointer_buf[4 * kBitsPerWord]; |
| 159 | void** pb = pointer_buf; |
| 160 | size_t start = HB_OFFSET_TO_INDEX(base - live_bitmap.base_); |
| 161 | size_t end = HB_OFFSET_TO_INDEX(max - live_bitmap.base_); |
Brian Carlstrom | db4d540 | 2011-08-09 12:18:28 -0700 | [diff] [blame^] | 162 | word* live = live_bitmap.words_; |
| 163 | word* mark = mark_bitmap.words_; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 164 | for (size_t i = start; i <= end; i++) { |
| 165 | unsigned long garbage = live[i] & ~mark[i]; |
| 166 | if (garbage != 0) { |
| 167 | unsigned long high_bit = 1 << (kBitsPerWord - 1); |
| 168 | uintptr_t ptr_base = HB_INDEX_TO_OFFSET(i) + live_bitmap.base_; |
| 169 | while (garbage != 0) { |
| 170 | int shift = CLZ(garbage); |
| 171 | garbage &= ~(high_bit >> shift); |
| 172 | *pb++ = (void*)(ptr_base + shift * kAlignment); |
| 173 | } |
| 174 | // Make sure that there are always enough slots available for an |
| 175 | // entire word of one bits. |
| 176 | if (pb >= &pointer_buf[ARRAYSIZE_UNSAFE(pointer_buf) - kBitsPerWord]) { |
| 177 | (*callback)(pb - pointer_buf, pointer_buf, arg); |
| 178 | pb = pointer_buf; |
| 179 | } |
| 180 | } |
| 181 | } |
| 182 | if (pb > pointer_buf) { |
| 183 | (*callback)(pb - pointer_buf, pointer_buf, arg); |
| 184 | } |
| 185 | } |
| 186 | |
| 187 | } // namespace art |