Home
last modified time | relevance | path

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

/art/runtime/
Dmonitor_pool.h143 size_t index = offset / kChunkSize; in LookupMonitor()
146 size_t offset_in_chunk = offset % kChunkSize; in LookupMonitor()
153 return base_addr <= mon_ptr && (mon_ptr - base_addr < kChunkSize); in IsInChunk()
167 + i * (kMaxListSize * kChunkSize) + j * kChunkSize); in ComputeMonitorIdInPool()
195 static constexpr size_t kChunkSize = 4096; variable
196 static_assert(IsPowerOfTwo(kChunkSize), "kChunkSize must be power of 2");
197 static constexpr size_t kChunkCapacity = kChunkSize / kAlignedMonitorSize;
211 static_assert(kMaxListSize * kChunkSize < (1 << LockWord::kMonitorIdSize),
Dmonitor_pool.cc60 void* chunk = allocator_.allocate(kChunkSize); in AllocateChunk()
75 last->monitor_id_ = OffsetToMonitorId(current_chunk_list_index_* (kMaxListSize * kChunkSize) in AllocateChunk()
76 + (num_chunks_ - 1) * kChunkSize + (kChunkCapacity - 1) * kAlignedMonitorSize); in AllocateChunk()
99 allocator_.deallocate(reinterpret_cast<uint8_t*>(monitor_chunks_[i][j]), kChunkSize); in FreeInternal()
/art/libartbase/base/
Dbit_memory_region.h269 constexpr size_t kChunkSize = BitSizeOf<size_t>(); 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()
293 while (remaining_bits >= kChunkSize) { in VisitChunks()
295 if (!visitor(offset, kChunkSize, value)) { in VisitChunks()
298 offset += kChunkSize; in VisitChunks()
299 remaining_bits -= kChunkSize; in VisitChunks()