Searched refs:bit_start (Results 1 – 5 of 5) sorted by relevance
/art/runtime/gc/accounting/ |
D | bitmap-inl.h | 57 inline void Bitmap::VisitSetBits(uintptr_t bit_start, uintptr_t bit_end, const Visitor& visitor) in VisitSetBits() argument 59 DCHECK_LE(bit_start, bit_end); in VisitSetBits() 60 CheckValidBitIndex(bit_start); in VisitSetBits() 61 const uintptr_t index_start = BitIndexToWordIndex(bit_start); in VisitSetBits() 63 if (bit_start != bit_end) { in VisitSetBits() 77 left_edge &= ~((static_cast<uintptr_t>(1) << (bit_start % kBitsPerBitmapWord)) - 1); in VisitSetBits()
|
D | space_bitmap-inl.h | 126 const size_t bit_start = (offset_start / kAlignment) % kBitsPerIntPtrT; in VisitMarkedRange() local 139 left_edge &= ~((static_cast<uintptr_t>(1) << bit_start) - 1); in VisitMarkedRange()
|
/art/dex2oat/linker/ |
D | code_info_table_deduper.h | 47 uint32_t bit_start; member 66 return DataHash()(BitMemoryRegion(output_->data(), item.bit_start, item.bit_size)); in operator() 82 BitMemoryRegion(output_->data(), lhs.bit_start, lhs.bit_size), in operator() 83 BitMemoryRegion(output_->data(), rhs.bit_start, rhs.bit_size)); in operator()
|
D | code_info_table_deduper.cc | 118 size_t deduped_offset = dedupe_entries[i]->bit_start; in Dedupe() 126 dedupe_entries[i]->bit_start = current_bit_offset; in Dedupe()
|
/art/libartbase/base/ |
D | bit_memory_region.h | 34 ALWAYS_INLINE BitMemoryRegion(uint8_t* data, ssize_t bit_start, size_t bit_size) { in BitMemoryRegion() argument 36 data_ = AlignDown(data + (bit_start >> kBitsPerByteLog2), kPageSize); in BitMemoryRegion() 37 bit_start_ = bit_start + kBitsPerByte * (data - data_); in BitMemoryRegion() 277 size_t bit_start = bit_start_; in VisitChunks() local 278 data += bit_start / kChunkSize; in VisitChunks() 279 if ((bit_start % kChunkSize) != 0u) { in VisitChunks() 280 size_t leading_bits = kChunkSize - (bit_start % kChunkSize); in VisitChunks() 281 size_t value = (*data) >> (bit_start % kChunkSize); in VisitChunks()
|