29                      uint32_t storage_size,  in BitVector()
30                      uint32_t* storage)  in BitVector()
41 BitVector::BitVector(uint32_t start_bits,  in BitVector()
47               static_cast<uint32_t*>(allocator->Alloc(BitsToWords(start_bits) * kWordBytes))) {  in BitVector()
58               static_cast<uint32_t*>(allocator->Alloc(src.storage_size_ * kWordBytes))) {  in BitVector()
113     uint32_t this_storage = storage_[i];  in IsSubsetOf()
114     uint32_t other_storage = other->storage_[i];  in IsSubsetOf()
123   uint32_t src_storage_size = src->storage_size_;  in Intersect()
126   uint32_t min_size = (storage_size_ < src_storage_size) ? storage_size_ : src_storage_size;  in Intersect()
128   uint32_t idx;  in Intersect()
153   uint32_t src_size = BitsToWords(highest_bit + 1);  in Union()
162     DCHECK_LT(static_cast<uint32_t> (highest_bit), storage_size_ * kWordBits);  in Union()
165   for (uint32_t idx = 0; idx < src_size; idx++) {  in Union()
166     uint32_t existing = storage_[idx];  in Union()
167     uint32_t update = existing | src->GetRawStorageWord(idx);  in Union()
187   uint32_t union_with_size = BitsToWords(highest_bit + 1);  in UnionIfNotIn()
194     DCHECK_LT(static_cast<uint32_t> (highest_bit), storage_size_ * kWordBits);  in UnionIfNotIn()
197   uint32_t not_in_size = not_in->GetStorageSize();  in UnionIfNotIn()
199   uint32_t idx = 0;  in UnionIfNotIn()
201     uint32_t existing = storage_[idx];  in UnionIfNotIn()
202     uint32_t update = existing |  in UnionIfNotIn()
211     uint32_t existing = storage_[idx];  in UnionIfNotIn()
212     uint32_t update = existing | union_with->GetRawStorageWord(idx);  in UnionIfNotIn()
222   uint32_t src_size = src->storage_size_;  in Subtract()
231   for (uint32_t idx = 0; idx < min_size; idx++) {  in Subtract()
236 uint32_t BitVector::NumSetBits() const {  in NumSetBits()
237   uint32_t count = 0;  in NumSetBits()
238   for (uint32_t word = 0; word < storage_size_; word++) {  in NumSetBits()
244 uint32_t BitVector::NumSetBits(uint32_t end) const {  in NumSetBits()
249 void BitVector::SetInitialBits(uint32_t num_bits) {  in SetInitialBits()
259   uint32_t idx;  in SetInitialBits()
262     storage_[idx] = std::numeric_limits<uint32_t>::max();  in SetInitialBits()
266   uint32_t rem_num_bits = num_bits & 0x1f;  in SetInitialBits()
282     uint32_t value = storage_[idx];  in GetHighestBitSet()
308   uint32_t size = 1 + (highest_bit / kWordBits);  in Copy()
312   uint32_t left = storage_size_ - size;  in Copy()
319 uint32_t BitVector::NumSetBits(const uint32_t* storage, uint32_t end) {  in NumSetBits()
320   uint32_t word_end = WordIndex(end);  in NumSetBits()
321   uint32_t partial_word_bits = end & 0x1f;  in NumSetBits()
323   uint32_t count = 0u;  in NumSetBits()
324   for (uint32_t word = 0u; word < word_end; word++) {  in NumSetBits()
352 void BitVector::EnsureSize(uint32_t idx) {  in EnsureSize()
357     uint32_t new_size = BitsToWords(idx + 1);  in EnsureSize()
359     uint32_t *new_storage =  in EnsureSize()
360         static_cast<uint32_t*>(allocator_->Alloc(new_size * kWordBytes));  in EnsureSize()
398   uint32_t* dest =  in UnionRows()
400   uint32_t* source = GetRawData().GetRawStorage() + ((other * num_columns_) / BitVector::kWordBits);  in UnionRows()
401   for (uint32_t i = 0; i < block_words; ++i, ++dest, ++source) {  in UnionRows()