Home
last modified time | relevance | path

Searched refs:size_in_bits (Results 1 – 10 of 10) sorted by relevance

/art/libartbase/base/
Dbit_memory_region.h47 : BitMemoryRegion(region.begin(), /* bit_start */ 0, region.size_in_bits()) { in BitMemoryRegion()
61 size_t size_in_bits() const { in size_in_bits() function
182 if (lhs.size_in_bits() != rhs.size_in_bits()) { in Compare()
183 return (lhs.size_in_bits() < rhs.size_in_bits()) ? -1 : 1; in Compare()
187 for (; bit + kNumBits <= lhs.size_in_bits(); bit += kNumBits) { in Compare()
194 size_t num_bits = lhs.size_in_bits() - bit; in Compare()
227 size_t NumberOfReadBits() const { return finished_region_.size_in_bits(); } in NumberOfReadBits()
230 size_t bit_offset = finished_region_.size_in_bits(); in ReadRegion()
288 Allocate(region.size_in_bits()).StoreBits(/* bit_offset */ 0, region, region.size_in_bits()); in WriteRegion()
Dbit_table.h91 size_t DataBitSize() const { return table_data_.size_in_bits(); } in DataBitSize()
420 DCHECK_EQ(BitMemoryRegion(region).LoadBits(num_bits, region.size_in_bits() - num_bits), 0u); in Dedup()
455 dst.StoreBits(/* bit_offset */ 0, src, std::min(max_num_bits_, src.size_in_bits())); in Encode()
469 size_t num_bits = std::max(expected.size_in_bits(), seen.size_in_bits()); in Encode()
471 bool e = b < expected.size_in_bits() && expected.LoadBit(b); in Encode()
472 bool s = b < seen.size_in_bits() && seen.LoadBit(b); in Encode()
Dbit_table_test.cc160 EXPECT_GE(actual.size_in_bits(), MinimumBitsToStore(expected)); in TEST()
161 for (size_t b = 0; b < actual.size_in_bits(); b++, expected >>= 1) { in TEST()
Dmemory_region.h50 size_t size_in_bits() const { return size_ * kBitsPerByte; } in size_in_bits() function
/art/runtime/
Dstack_map.cc75 if (it.second /* new bit table */ || region.size_in_bits() < 32) { in Dedupe()
142 if (mask.size_in_bits() <= first_dex_register) { in DecodeDexRegisterMap()
152 mask = mask.Subregion(first_dex_register, mask.size_in_bits() - first_dex_register); in DecodeDexRegisterMap()
156 const uint32_t end = std::min<uint32_t>(map->size(), mask.size_in_bits()); in DecodeDexRegisterMap()
256 for (size_t b = 0, e = bits.size_in_bits(); b < e; b++) { in Dump()
291 for (size_t i = 0, e = stack_mask.size_in_bits(); i < e; ++i) { in Dump()
Dquick_exception_handler.cc503 if (bit < stack_mask.size_in_bits() && stack_mask.LoadBit(bit)) { in HandleOptimizingDeoptimization()
Dthread.cc3791 for (size_t i = 0; i < stack_mask.size_in_bits(); ++i) { in VisitQuickFrameWithVregCallback()
/art/compiler/optimizing/
Dstack_map_stream.cc129 CHECK_GE(seen_stack_mask.size_in_bits(), stack_mask ? stack_mask->GetNumberOfBits() : 0); in BeginStackMapEntry()
130 for (size_t b = 0; b < seen_stack_mask.size_in_bits(); b++) { in BeginStackMapEntry()
Dstack_map_test.cc35 if (bit_vector.GetNumberOfBits() > stack_mask.size_in_bits()) { in CheckStackMask()
38 for (size_t i = 0; i < stack_mask.size_in_bits(); ++i) { in CheckStackMask()
Dcode_generator_arm64.cc1306 int size_in_bits) { in AcquireFPOrCoreCPURegisterOfSize() argument
1308 ? CPURegister(temps->AcquireRegisterOfSize(size_in_bits)) in AcquireFPOrCoreCPURegisterOfSize()
1309 : CPURegister(temps->AcquireVRegisterOfSize(size_in_bits)); in AcquireFPOrCoreCPURegisterOfSize()