31   : storage_(storage),  in BitVector()
35   DCHECK(storage_ != nullptr);  in BitVector()
37   static_assert(sizeof(*storage_) == kWordBytes, "word bytes");  in BitVector()
38   static_assert(sizeof(*storage_) * 8u == kWordBits, "word bits");  in BitVector()
59   if (storage_ != nullptr) {  in ~BitVector()
61     allocator_->Free(storage_);  in ~BitVector()
88   return (memcmp(storage_, src->GetRawStorage(), our_highest_index * kWordBytes) == 0);  in SameBitsSet()
108     uint32_t this_storage = storage_[i];  in IsSubsetOf()
109     uint32_t other_storage = other->storage_[i];  in IsSubsetOf()
125     storage_[idx] &= src->GetRawStorageWord(idx);  in Intersect()
133     storage_[idx] = 0;  in Intersect()
161     uint32_t existing = storage_[idx];  in Union()
165       storage_[idx] = update;  in Union()
196     uint32_t existing = storage_[idx];  in UnionIfNotIn()
201       storage_[idx] = update;  in UnionIfNotIn()
206     uint32_t existing = storage_[idx];  in UnionIfNotIn()
210       storage_[idx] = update;  in UnionIfNotIn()
227     storage_[idx] &= (~(src->GetRawStorageWord(idx)));  in Subtract()
234     count += POPCOUNT(storage_[word]);  in NumSetBits()
241   return NumSetBits(storage_, end);  in NumSetBits()
257     storage_[idx] = std::numeric_limits<uint32_t>::max();  in SetInitialBits()
263     storage_[idx] = (1U << rem_num_bits) - 1;  in SetInitialBits()
269     storage_[idx] = 0;  in SetInitialBits()
277     uint32_t value = storage_[idx];  in GetHighestBitSet()
304   memcpy(storage_, src->GetRawStorage(), kWordBytes * size);  in Copy()
310     memset(storage_ + size, 0, kWordBytes * left);  in Copy()
356     memcpy(new_storage, storage_, storage_size_ * kWordBytes);  in EnsureSize()
362     allocator_->Free(storage_);  in EnsureSize()
365     storage_ = new_storage;  in EnsureSize()