Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2011 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 "bit_vector.h" |
| 18 | |
Ian Rogers | 5a2e4cc | 2014-10-30 15:13:22 -0700 | [diff] [blame] | 19 | #include <limits> |
Ian Rogers | c7dd295 | 2014-10-21 23:31:19 -0700 | [diff] [blame] | 20 | #include <sstream> |
| 21 | |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 22 | #include "allocator.h" |
| 23 | #include "bit_vector-inl.h" |
| 24 | |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 25 | namespace art { |
| 26 | |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 27 | // The number of words necessary to encode bits. |
| 28 | static constexpr uint32_t BitsToWords(uint32_t bits) { |
| 29 | return RoundUp(bits, 32) / 32; |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 30 | } |
| 31 | |
| 32 | // TODO: replace excessive argument defaulting when we are at gcc 4.7 |
| 33 | // or later on host with delegating constructor support. Specifically, |
| 34 | // starts_bits and storage_size/storage are mutually exclusive. |
Brian Carlstrom | ba150c3 | 2013-08-27 17:31:03 -0700 | [diff] [blame] | 35 | BitVector::BitVector(uint32_t start_bits, |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 36 | bool expandable, |
| 37 | Allocator* allocator, |
| 38 | uint32_t storage_size, |
| 39 | uint32_t* storage) |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 40 | : storage_(storage), |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 41 | storage_size_(storage_size), |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 42 | allocator_(allocator), |
| 43 | expandable_(expandable) { |
Andreas Gampe | 575e78c | 2014-11-03 23:41:03 -0800 | [diff] [blame] | 44 | static_assert(sizeof(*storage_) == kWordBytes, "word bytes"); |
| 45 | static_assert(sizeof(*storage_) * 8u == kWordBits, "word bits"); |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 46 | if (storage_ == nullptr) { |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 47 | storage_size_ = BitsToWords(start_bits); |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 48 | storage_ = static_cast<uint32_t*>(allocator_->Alloc(storage_size_ * kWordBytes)); |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 49 | } |
| 50 | } |
| 51 | |
| 52 | BitVector::~BitVector() { |
| 53 | allocator_->Free(storage_); |
| 54 | } |
| 55 | |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 56 | bool BitVector::SameBitsSet(const BitVector *src) const { |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 57 | int our_highest = GetHighestBitSet(); |
| 58 | int src_highest = src->GetHighestBitSet(); |
| 59 | |
| 60 | // If the highest bit set is different, we are different. |
| 61 | if (our_highest != src_highest) { |
Jean Christophe Beyler | b5c9b40 | 2014-04-30 14:52:00 -0700 | [diff] [blame] | 62 | return false; |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 63 | } |
| 64 | |
| 65 | // If the highest bit set is -1, both are cleared, we are the same. |
| 66 | // If the highest bit set is 0, both have a unique bit set, we are the same. |
Jean Christophe Beyler | b5c9b40 | 2014-04-30 14:52:00 -0700 | [diff] [blame] | 67 | if (our_highest <= 0) { |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 68 | return true; |
| 69 | } |
| 70 | |
Jean Christophe Beyler | b5c9b40 | 2014-04-30 14:52:00 -0700 | [diff] [blame] | 71 | // Get the highest bit set's cell's index |
| 72 | // No need of highest + 1 here because it can't be 0 so BitsToWords will work here. |
| 73 | int our_highest_index = BitsToWords(our_highest); |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 74 | |
| 75 | // This memcmp is enough: we know that the highest bit set is the same for both: |
| 76 | // - Therefore, min_size goes up to at least that, we are thus comparing at least what we need to, but not less. |
| 77 | // ie. we are comparing all storage cells that could have difference, if both vectors have cells above our_highest_index, |
| 78 | // they are automatically at 0. |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 79 | return (memcmp(storage_, src->GetRawStorage(), our_highest_index * kWordBytes) == 0); |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 80 | } |
| 81 | |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 82 | void BitVector::Intersect(const BitVector* src) { |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 83 | uint32_t src_storage_size = src->storage_size_; |
| 84 | |
| 85 | // Get the minimum size between us and source. |
| 86 | uint32_t min_size = (storage_size_ < src_storage_size) ? storage_size_ : src_storage_size; |
| 87 | |
| 88 | uint32_t idx; |
| 89 | for (idx = 0; idx < min_size; idx++) { |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 90 | storage_[idx] &= src->GetRawStorageWord(idx); |
| 91 | } |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 92 | |
| 93 | // Now, due to this being an intersection, there are two possibilities: |
| 94 | // - Either src was larger than us: we don't care, all upper bits would thus be 0. |
| 95 | // - Either we are larger than src: we don't care, all upper bits would have been 0 too. |
| 96 | // So all we need to do is set all remaining bits to 0. |
| 97 | for (; idx < storage_size_; idx++) { |
| 98 | storage_[idx] = 0; |
| 99 | } |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 100 | } |
| 101 | |
Nicolas Geoffray | 804d093 | 2014-05-02 08:46:00 +0100 | [diff] [blame] | 102 | bool BitVector::Union(const BitVector* src) { |
Jean Christophe Beyler | 5afa08f | 2014-04-15 15:54:35 -0700 | [diff] [blame] | 103 | // Get the highest bit to determine how much we need to expand. |
| 104 | int highest_bit = src->GetHighestBitSet(); |
Nicolas Geoffray | 804d093 | 2014-05-02 08:46:00 +0100 | [diff] [blame] | 105 | bool changed = false; |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 106 | |
Jean Christophe Beyler | 5afa08f | 2014-04-15 15:54:35 -0700 | [diff] [blame] | 107 | // If src has no bit set, we are done: there is no need for a union with src. |
| 108 | if (highest_bit == -1) { |
Nicolas Geoffray | 804d093 | 2014-05-02 08:46:00 +0100 | [diff] [blame] | 109 | return changed; |
Jean Christophe Beyler | 5afa08f | 2014-04-15 15:54:35 -0700 | [diff] [blame] | 110 | } |
| 111 | |
| 112 | // Update src_size to how many cells we actually care about: where the bit is + 1. |
| 113 | uint32_t src_size = BitsToWords(highest_bit + 1); |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 114 | |
| 115 | // Is the storage size smaller than src's? |
| 116 | if (storage_size_ < src_size) { |
Nicolas Geoffray | 804d093 | 2014-05-02 08:46:00 +0100 | [diff] [blame] | 117 | changed = true; |
| 118 | |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 119 | EnsureSize(highest_bit); |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 120 | |
| 121 | // Paranoid: storage size should be big enough to hold this bit now. |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 122 | DCHECK_LT(static_cast<uint32_t> (highest_bit), storage_size_ * kWordBits); |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 123 | } |
| 124 | |
Jean Christophe Beyler | 5afa08f | 2014-04-15 15:54:35 -0700 | [diff] [blame] | 125 | for (uint32_t idx = 0; idx < src_size; idx++) { |
Nicolas Geoffray | 804d093 | 2014-05-02 08:46:00 +0100 | [diff] [blame] | 126 | uint32_t existing = storage_[idx]; |
| 127 | uint32_t update = existing | src->GetRawStorageWord(idx); |
| 128 | if (existing != update) { |
| 129 | changed = true; |
| 130 | storage_[idx] = update; |
| 131 | } |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 132 | } |
Nicolas Geoffray | 804d093 | 2014-05-02 08:46:00 +0100 | [diff] [blame] | 133 | return changed; |
| 134 | } |
| 135 | |
| 136 | bool BitVector::UnionIfNotIn(const BitVector* union_with, const BitVector* not_in) { |
| 137 | // Get the highest bit to determine how much we need to expand. |
| 138 | int highest_bit = union_with->GetHighestBitSet(); |
| 139 | bool changed = false; |
| 140 | |
| 141 | // If src has no bit set, we are done: there is no need for a union with src. |
| 142 | if (highest_bit == -1) { |
| 143 | return changed; |
| 144 | } |
| 145 | |
| 146 | // Update union_with_size to how many cells we actually care about: where the bit is + 1. |
| 147 | uint32_t union_with_size = BitsToWords(highest_bit + 1); |
| 148 | |
| 149 | // Is the storage size smaller than src's? |
| 150 | if (storage_size_ < union_with_size) { |
Nicolas Geoffray | b556761 | 2014-10-22 10:25:24 +0100 | [diff] [blame] | 151 | EnsureSize(highest_bit); |
Nicolas Geoffray | 804d093 | 2014-05-02 08:46:00 +0100 | [diff] [blame] | 152 | |
| 153 | // Paranoid: storage size should be big enough to hold this bit now. |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 154 | DCHECK_LT(static_cast<uint32_t> (highest_bit), storage_size_ * kWordBits); |
Nicolas Geoffray | 804d093 | 2014-05-02 08:46:00 +0100 | [diff] [blame] | 155 | } |
| 156 | |
| 157 | uint32_t not_in_size = not_in->GetStorageSize(); |
| 158 | |
| 159 | uint32_t idx = 0; |
| 160 | for (; idx < std::min(not_in_size, union_with_size); idx++) { |
| 161 | uint32_t existing = storage_[idx]; |
| 162 | uint32_t update = existing | |
| 163 | (union_with->GetRawStorageWord(idx) & ~not_in->GetRawStorageWord(idx)); |
| 164 | if (existing != update) { |
| 165 | changed = true; |
| 166 | storage_[idx] = update; |
| 167 | } |
| 168 | } |
| 169 | |
| 170 | for (; idx < union_with_size; idx++) { |
| 171 | uint32_t existing = storage_[idx]; |
| 172 | uint32_t update = existing | union_with->GetRawStorageWord(idx); |
| 173 | if (existing != update) { |
| 174 | changed = true; |
| 175 | storage_[idx] = update; |
| 176 | } |
| 177 | } |
| 178 | return changed; |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 179 | } |
| 180 | |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 181 | void BitVector::Subtract(const BitVector *src) { |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 182 | uint32_t src_size = src->storage_size_; |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 183 | |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 184 | // We only need to operate on bytes up to the smaller of the sizes of the two operands. |
| 185 | unsigned int min_size = (storage_size_ > src_size) ? src_size : storage_size_; |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 186 | |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 187 | // Difference until max, we know both accept it: |
| 188 | // There is no need to do more: |
| 189 | // If we are bigger than src, the upper bits are unchanged. |
| 190 | // If we are smaller than src, the non-existant upper bits are 0 and thus can't get subtracted. |
| 191 | for (uint32_t idx = 0; idx < min_size; idx++) { |
| 192 | storage_[idx] &= (~(src->GetRawStorageWord(idx))); |
| 193 | } |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 194 | } |
| 195 | |
Brian Carlstrom | ba150c3 | 2013-08-27 17:31:03 -0700 | [diff] [blame] | 196 | uint32_t BitVector::NumSetBits() const { |
| 197 | uint32_t count = 0; |
| 198 | for (uint32_t word = 0; word < storage_size_; word++) { |
Vladimir Marko | 8194963 | 2014-05-02 11:53:22 +0100 | [diff] [blame] | 199 | count += POPCOUNT(storage_[word]); |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 200 | } |
| 201 | return count; |
| 202 | } |
| 203 | |
Vladimir Marko | d3c5beb | 2014-04-11 16:32:51 +0100 | [diff] [blame] | 204 | uint32_t BitVector::NumSetBits(uint32_t end) const { |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 205 | DCHECK_LE(end, storage_size_ * kWordBits); |
Vladimir Marko | d3c5beb | 2014-04-11 16:32:51 +0100 | [diff] [blame] | 206 | return NumSetBits(storage_, end); |
Brian Carlstrom | ba150c3 | 2013-08-27 17:31:03 -0700 | [diff] [blame] | 207 | } |
| 208 | |
Brian Carlstrom | ba150c3 | 2013-08-27 17:31:03 -0700 | [diff] [blame] | 209 | void BitVector::SetInitialBits(uint32_t num_bits) { |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 210 | // If num_bits is 0, clear everything. |
| 211 | if (num_bits == 0) { |
| 212 | ClearAllBits(); |
| 213 | return; |
| 214 | } |
| 215 | |
| 216 | // Set the highest bit we want to set to get the BitVector allocated if need be. |
| 217 | SetBit(num_bits - 1); |
| 218 | |
Brian Carlstrom | ba150c3 | 2013-08-27 17:31:03 -0700 | [diff] [blame] | 219 | uint32_t idx; |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 220 | // We can set every storage element with -1. |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 221 | for (idx = 0; idx < WordIndex(num_bits); idx++) { |
Ian Rogers | 5a2e4cc | 2014-10-30 15:13:22 -0700 | [diff] [blame] | 222 | storage_[idx] = std::numeric_limits<uint32_t>::max(); |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 223 | } |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 224 | |
| 225 | // Handle the potentially last few bits. |
Brian Carlstrom | ba150c3 | 2013-08-27 17:31:03 -0700 | [diff] [blame] | 226 | uint32_t rem_num_bits = num_bits & 0x1f; |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 227 | if (rem_num_bits != 0) { |
Ian Rogers | 5a2e4cc | 2014-10-30 15:13:22 -0700 | [diff] [blame] | 228 | storage_[idx] = (1U << rem_num_bits) - 1; |
Vladimir Marko | 4812d43 | 2014-03-11 12:42:25 +0000 | [diff] [blame] | 229 | ++idx; |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 230 | } |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 231 | |
| 232 | // Now set the upper ones to 0. |
| 233 | for (; idx < storage_size_; idx++) { |
| 234 | storage_[idx] = 0; |
| 235 | } |
| 236 | } |
| 237 | |
| 238 | int BitVector::GetHighestBitSet() const { |
| 239 | unsigned int max = storage_size_; |
| 240 | for (int idx = max - 1; idx >= 0; idx--) { |
| 241 | // If not 0, we have more work: check the bits. |
| 242 | uint32_t value = storage_[idx]; |
| 243 | |
| 244 | if (value != 0) { |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 245 | // Return highest bit set in value plus bits from previous storage indexes. |
| 246 | return 31 - CLZ(value) + (idx * kWordBits); |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 247 | } |
| 248 | } |
| 249 | |
| 250 | // All zero, therefore return -1. |
| 251 | return -1; |
| 252 | } |
| 253 | |
| 254 | void BitVector::Copy(const BitVector *src) { |
| 255 | // Get highest bit set, we only need to copy till then. |
| 256 | int highest_bit = src->GetHighestBitSet(); |
| 257 | |
| 258 | // If nothing is set, clear everything. |
| 259 | if (highest_bit == -1) { |
| 260 | ClearAllBits(); |
| 261 | return; |
| 262 | } |
| 263 | |
| 264 | // Set upper bit to ensure right size before copy. |
| 265 | SetBit(highest_bit); |
| 266 | |
| 267 | // Now set until highest bit's storage. |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 268 | uint32_t size = 1 + (highest_bit / kWordBits); |
| 269 | memcpy(storage_, src->GetRawStorage(), kWordBytes * size); |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 270 | |
| 271 | // Set upper bits to 0. |
| 272 | uint32_t left = storage_size_ - size; |
| 273 | |
| 274 | if (left > 0) { |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 275 | memset(storage_ + size, 0, kWordBytes * left); |
Jean Christophe Beyler | ad0d30a | 2014-01-16 09:00:18 -0800 | [diff] [blame] | 276 | } |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 277 | } |
| 278 | |
Chih-Hung Hsieh | 1675f2c | 2015-01-30 15:37:34 -0800 | [diff] [blame] | 279 | #if defined(__clang__) && defined(__ARM_64BIT_STATE) |
| 280 | // b/19180814 When POPCOUNT is inlined, boot up failed on arm64 devices. |
| 281 | __attribute__((optnone)) |
| 282 | #endif |
Vladimir Marko | d3c5beb | 2014-04-11 16:32:51 +0100 | [diff] [blame] | 283 | uint32_t BitVector::NumSetBits(const uint32_t* storage, uint32_t end) { |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 284 | uint32_t word_end = WordIndex(end); |
Vladimir Marko | d3c5beb | 2014-04-11 16:32:51 +0100 | [diff] [blame] | 285 | uint32_t partial_word_bits = end & 0x1f; |
| 286 | |
| 287 | uint32_t count = 0u; |
| 288 | for (uint32_t word = 0u; word < word_end; word++) { |
Vladimir Marko | 8194963 | 2014-05-02 11:53:22 +0100 | [diff] [blame] | 289 | count += POPCOUNT(storage[word]); |
Vladimir Marko | d3c5beb | 2014-04-11 16:32:51 +0100 | [diff] [blame] | 290 | } |
| 291 | if (partial_word_bits != 0u) { |
Vladimir Marko | 8194963 | 2014-05-02 11:53:22 +0100 | [diff] [blame] | 292 | count += POPCOUNT(storage[word_end] & ~(0xffffffffu << partial_word_bits)); |
Vladimir Marko | d3c5beb | 2014-04-11 16:32:51 +0100 | [diff] [blame] | 293 | } |
| 294 | return count; |
| 295 | } |
| 296 | |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 297 | void BitVector::Dump(std::ostream& os, const char *prefix) const { |
Jean Christophe Beyler | 5afa08f | 2014-04-15 15:54:35 -0700 | [diff] [blame] | 298 | std::ostringstream buffer; |
Jean Christophe Beyler | 520f37b | 2014-05-22 15:43:50 -0700 | [diff] [blame] | 299 | DumpHelper(prefix, buffer); |
Nicolas Geoffray | 804d093 | 2014-05-02 08:46:00 +0100 | [diff] [blame] | 300 | os << buffer.str() << std::endl; |
Jean Christophe Beyler | 5afa08f | 2014-04-15 15:54:35 -0700 | [diff] [blame] | 301 | } |
| 302 | |
Jean Christophe Beyler | 520f37b | 2014-05-22 15:43:50 -0700 | [diff] [blame] | 303 | void BitVector::DumpHelper(const char* prefix, std::ostringstream& buffer) const { |
Jean Christophe Beyler | 5afa08f | 2014-04-15 15:54:35 -0700 | [diff] [blame] | 304 | // Initialize it. |
| 305 | if (prefix != nullptr) { |
| 306 | buffer << prefix; |
| 307 | } |
| 308 | |
Nicolas Geoffray | 804d093 | 2014-05-02 08:46:00 +0100 | [diff] [blame] | 309 | buffer << '('; |
Jean Christophe Beyler | 014d77a | 2014-06-02 11:21:21 -0700 | [diff] [blame] | 310 | for (size_t i = 0; i < storage_size_ * kWordBits; i++) { |
Nicolas Geoffray | 804d093 | 2014-05-02 08:46:00 +0100 | [diff] [blame] | 311 | buffer << IsBitSet(i); |
Jean Christophe Beyler | 5afa08f | 2014-04-15 15:54:35 -0700 | [diff] [blame] | 312 | } |
Nicolas Geoffray | 804d093 | 2014-05-02 08:46:00 +0100 | [diff] [blame] | 313 | buffer << ')'; |
Jean Christophe Beyler | 5afa08f | 2014-04-15 15:54:35 -0700 | [diff] [blame] | 314 | } |
| 315 | |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 316 | void BitVector::EnsureSize(uint32_t idx) { |
| 317 | if (idx >= storage_size_ * kWordBits) { |
| 318 | DCHECK(expandable_) << "Attempted to expand a non-expandable bitmap to position " << idx; |
| 319 | |
| 320 | /* Round up to word boundaries for "idx+1" bits */ |
| 321 | uint32_t new_size = BitsToWords(idx + 1); |
| 322 | DCHECK_GT(new_size, storage_size_); |
| 323 | uint32_t *new_storage = |
| 324 | static_cast<uint32_t*>(allocator_->Alloc(new_size * kWordBytes)); |
| 325 | memcpy(new_storage, storage_, storage_size_ * kWordBytes); |
| 326 | // Zero out the new storage words. |
| 327 | memset(&new_storage[storage_size_], 0, (new_size - storage_size_) * kWordBytes); |
Andreas Gampe | dc8aa69 | 2014-10-24 21:32:07 -0700 | [diff] [blame] | 328 | // TODO: collect stats on space wasted because of resize. |
| 329 | |
| 330 | // Free old storage. |
| 331 | allocator_->Free(storage_); |
| 332 | |
| 333 | // Set fields. |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 334 | storage_ = new_storage; |
| 335 | storage_size_ = new_size; |
| 336 | } |
| 337 | } |
| 338 | |
Brian Carlstrom | 413e89f | 2013-10-21 23:53:49 -0700 | [diff] [blame] | 339 | } // namespace art |