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()
63   allocator_->Free(storage_);  in ~BitVector()
89   return (memcmp(storage_, src->GetRawStorage(), our_highest_index * kWordBytes) == 0);  in SameBitsSet()
109     uint32_t this_storage = storage_[i];  in IsSubsetOf()
110     uint32_t other_storage = other->storage_[i];  in IsSubsetOf()
126     storage_[idx] &= src->GetRawStorageWord(idx);  in Intersect()
134     storage_[idx] = 0;  in Intersect()
162     uint32_t existing = storage_[idx];  in Union()
166       storage_[idx] = update;  in Union()
197     uint32_t existing = storage_[idx];  in UnionIfNotIn()
202       storage_[idx] = update;  in UnionIfNotIn()
207     uint32_t existing = storage_[idx];  in UnionIfNotIn()
211       storage_[idx] = update;  in UnionIfNotIn()
228     storage_[idx] &= (~(src->GetRawStorageWord(idx)));  in Subtract()
235     count += POPCOUNT(storage_[word]);  in NumSetBits()
242   return NumSetBits(storage_, end);  in NumSetBits()
258     storage_[idx] = std::numeric_limits<uint32_t>::max();  in SetInitialBits()
264     storage_[idx] = (1U << rem_num_bits) - 1;  in SetInitialBits()
270     storage_[idx] = 0;  in SetInitialBits()
278     uint32_t value = storage_[idx];  in GetHighestBitSet()
305   memcpy(storage_, src->GetRawStorage(), kWordBytes * size);  in Copy()
311     memset(storage_ + size, 0, kWordBytes * left);  in Copy()
357     memcpy(new_storage, storage_, storage_size_ * kWordBytes);  in EnsureSize()
363     allocator_->Free(storage_);  in EnsureSize()
366     storage_ = new_storage;  in EnsureSize()