Searched refs:size_in_bits (Results 1 – 8 of 8) sorted by relevance
| /art/libartbase/base/ |
| D | bit_memory_region.h | 47 : BitMemoryRegion(region.begin(), /* bit_start */ 0, region.size_in_bits()) { in BitMemoryRegion()
61 size_t size_in_bits() const { in size_in_bits() function
190 if (lhs.size_in_bits() != rhs.size_in_bits()) { in Compare()
191 return (lhs.size_in_bits() < rhs.size_in_bits()) ? -1 : 1; in Compare()
195 for (; bit + kNumBits <= lhs.size_in_bits(); bit += kNumBits) { in Compare()
202 size_t num_bits = lhs.size_in_bits() - bit; in Compare()
234 size_t NumberOfReadBits() const { return finished_region_.size_in_bits(); } in NumberOfReadBits()
237 size_t bit_offset = finished_region_.size_in_bits(); in ReadRegion()
314 Allocate(region.size_in_bits()).StoreBits(/* bit_offset */ 0, region, region.size_in_bits()); in WriteRegion()
|
| D | bit_table.h | 90 size_t DataBitSize() const { return table_data_.size_in_bits(); } in DataBitSize()
417 DCHECK_EQ(BitMemoryRegion(region).LoadBits(num_bits, region.size_in_bits() - num_bits), 0u); in Dedup()
454 dst.StoreBits(/* bit_offset */ 0, src, std::min(max_num_bits_, src.size_in_bits())); in Encode()
467 size_t num_bits = std::max(expected.size_in_bits(), seen.size_in_bits()); in Encode()
469 bool e = b < expected.size_in_bits() && expected.LoadBit(b); in Encode()
470 bool s = b < seen.size_in_bits() && seen.LoadBit(b); in Encode()
|
| D | bit_table_test.cc | 160 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()
|
| D | memory_region.h | 50 size_t size_in_bits() const { return size_ * kBitsPerByte; } in size_in_bits() function
|
| /art/runtime/ |
| D | stack_map.cc | 102 if (it[i]->second != 0 && region.size_in_bits() > kMinDedupSize) { // Seen before and large? in Dedupe()
183 if (mask.size_in_bits() <= first_dex_register) { in DecodeDexRegisterMap()
193 mask = mask.Subregion(first_dex_register, mask.size_in_bits() - first_dex_register); in DecodeDexRegisterMap()
197 const uint32_t end = std::min<uint32_t>(map->size(), mask.size_in_bits()); in DecodeDexRegisterMap()
235 table_stats->AddBits(region.size_in_bits()); in CollectSizeStats()
292 for (size_t b = 0, e = bits.size_in_bits(); b < e; b++) { in Dump()
327 for (size_t i = 0, e = stack_mask.size_in_bits(); i < e; ++i) { in Dump()
|
| D | quick_exception_handler.cc | 490 if (bit < stack_mask.size_in_bits() && stack_mask.LoadBit(bit)) { in HandleOptimizingDeoptimization()
|
| /art/compiler/optimizing/ |
| D | stack_map_stream.cc | 141 CHECK_GE(seen_stack_mask.size_in_bits(), stack_mask ? stack_mask->GetNumberOfBits() : 0); in BeginStackMapEntry()
142 for (size_t b = 0; b < seen_stack_mask.size_in_bits(); b++) { in BeginStackMapEntry()
|
| D | stack_map_test.cc | 35 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()
|