Home
last modified time | relevance | path

Searched refs:storage_size_ (Results 1 – 3 of 3) sorted by relevance

/art/libartbase/base/
Dbit_vector-inl.h30 DCHECK_EQ(storage_size_, other.storage_size_);
54 if (UNLIKELY(word_index == storage_size_)) { in FindIndex()
62 if (UNLIKELY(word_index == storage_size_)) { in FindIndex()
72 storage_size_(bit_vector->storage_size_), in IndexIterator()
77 storage_size_(bit_vector->storage_size_), in IndexIterator()
89 memset(storage_, 0, storage_size_ * kWordBytes); in ClearAllBits()
93 return (storage_size_ == src->GetStorageSize()) && in Equal()
95 (memcmp(storage_, src->GetRawStorage(), storage_size_ * sizeof(uint32_t)) == 0); in Equal()
Dbit_vector.cc32 storage_size_(storage_size), in BitVector()
56 src.storage_size_, in BitVector()
57 static_cast<uint32_t*>(allocator->Alloc(src.storage_size_ * kWordBytes))) { in BitVector()
119 uint32_t src_storage_size = src->storage_size_; in Intersect()
122 uint32_t min_size = (storage_size_ < src_storage_size) ? storage_size_ : src_storage_size; in Intersect()
133 for (; idx < storage_size_; idx++) { in Intersect()
152 if (storage_size_ < src_size) { in Union()
158 DCHECK_LT(static_cast<uint32_t> (highest_bit), storage_size_ * kWordBits); in Union()
186 if (storage_size_ < union_with_size) { in UnionIfNotIn()
190 DCHECK_LT(static_cast<uint32_t> (highest_bit), storage_size_ * kWordBits); in UnionIfNotIn()
[all …]
Dbit_vector.h77 return storage_size_ * kWordBits; in BitSize()
82 const uint32_t storage_size_; // Size of vector in words. variable
109 storage_size_(other.storage_size_), in BitVector()
113 other.storage_size_ = 0u; in BitVector()
142 if (idx >= storage_size_ * kWordBits) { in SetBit()
151 if (idx < storage_size_ * kWordBits) { in ClearBit()
161 return (idx < (storage_size_ * kWordBits)) && IsBitSet(storage_, idx); in IsBitSet()
206 return storage_size_; in GetStorageSize()
226 return storage_size_ * kWordBytes; in GetSizeOf()
288 uint32_t storage_size_; // Current size, in 32-bit words. variable