Home
last modified time | relevance | path

Searched refs:kWordBits (Results 1 – 4 of 4) sorted by relevance

/art/libartbase/base/
Dbit_vector.cc38 static_assert(sizeof(*storage_) * 8u == kWordBits, "word bits"); in BitVector()
162 DCHECK_LT(static_cast<uint32_t> (highest_bit), storage_size_ * kWordBits); in Union()
194 DCHECK_LT(static_cast<uint32_t> (highest_bit), storage_size_ * kWordBits); in UnionIfNotIn()
245 DCHECK_LE(end, storage_size_ * kWordBits); in NumSetBits()
286 return 31 - CLZ(value) + (idx * kWordBits); in GetHighestBitSet()
308 uint32_t size = 1 + (highest_bit / kWordBits); in Copy()
346 for (size_t i = 0; i < storage_size_ * kWordBits; i++) { in DumpHelper()
353 if (idx >= storage_size_ * kWordBits) { in EnsureSize()
384 cols = RoundUp(cols, BitVector::kWordBits); in Resize()
397 size_t block_words = num_columns_ / BitVector::kWordBits; in UnionRows()
[all …]
Dbit_vector.h39 static constexpr uint32_t kWordBits = kWordBytes * 8; variable
82 return storage_size_ * kWordBits; in BitSize()
138 return RoundUp(bits, kWordBits) / kWordBits; in BitsToWords()
147 if (idx >= storage_size_ * kWordBits) { in SetBit()
156 if (idx < storage_size_ * kWordBits) { in ClearBit()
166 return (idx < (storage_size_ * kWordBits)) && IsBitSet(storage_, idx); in IsBitSet()
235 return storage_size_ * kWordBits; in GetBitSizeOf()
315 : num_columns_(RoundUp(num_columns, BitVector::kWordBits)), num_rows_(num_rows) {} in BaseBitVectorArray()
366 return rows * RoundUp(cols, BitVector::kWordBits); in RequiredBitVectorSize()
370 return cols != 0 ? bv.GetBitSizeOf() / RoundUp(cols, BitVector::kWordBits) : 0; in MaxRowsFor()
Dbit_vector-inl.h53 uint32_t word_index = start_index / kWordBits; in FindIndex()
/art/compiler/optimizing/
Dnodes.cc316 block_size_(RoundUp(graph_->GetBlocks().size(), BitVector::kWordBits)), in ReachabilityAnalysisHelper()