Home
last modified time | relevance | path

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

/art/libartbase/base/
Dbit_memory_region.h48 : BitMemoryRegion(region.begin(), /* bit_start */ 0, region.size_in_bits()) { in BitMemoryRegion()
62 size_t size_in_bits() const { in size_in_bits() function
166 DCHECK_EQ(size_in_bits(), src.size_in_bits()); in CopyBits()
177 DCHECK_EQ(size_in_bits(), src.size_in_bits()); in AndBits()
186 DCHECK_EQ(size_in_bits(), src.size_in_bits()); in OrBits()
195 DCHECK_EQ(size_in_bits(), src.size_in_bits()); in XorBits()
236 if (lhs.size_in_bits() != rhs.size_in_bits()) { in Compare()
237 return (lhs.size_in_bits() < rhs.size_in_bits()) ? -1 : 1; in Compare()
257 if (lhs.size_in_bits() != rhs.size_in_bits()) { in Equals()
378 size_t NumberOfReadBits() const { return finished_region_.size_in_bits(); } in NumberOfReadBits()
[all …]
Ddata_hash.h88 size_t num_full_blocks = region.size_in_bits() / kMurmur3BlockBits; in operator()
89 size_t num_end_bits = region.size_in_bits() % kMurmur3BlockBits; in operator()
101 size_t num_full_bytes = region.size_in_bits() / kBitsPerByte; in operator()
102 size_t num_end_bits = region.size_in_bits() % kBitsPerByte; in operator()
Dbit_table.h90 size_t DataBitSize() const { return table_data_.size_in_bits(); } in DataBitSize()
419 DCHECK_EQ(BitMemoryRegion(region).LoadBits(num_bits, region.size_in_bits() - num_bits), 0u); in Dedup()
454 size_t bits_to_copy = std::min(max_num_bits_, row.size_in_bits()); in Encode()
470 size_t num_bits = std::max(expected.size_in_bits(), seen.size_in_bits()); in Encode()
472 bool e = b < expected.size_in_bits() && expected.LoadBit(b); in Encode()
473 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/oat/
Dstack_map.cc123 if (mask.size_in_bits() <= first_dex_register) { in DecodeDexRegisterMap()
133 mask = mask.Subregion(first_dex_register, mask.size_in_bits() - first_dex_register); in DecodeDexRegisterMap()
137 const uint32_t end = std::min<uint32_t>(map->size(), mask.size_in_bits()); in DecodeDexRegisterMap()
174 table_stats.AddBits(region.size_in_bits()); in CollectSizeStats()
175 table_stats["Header"].AddBits(region.size_in_bits() - table->DataBitSize()); in CollectSizeStats()
233 for (size_t b = 0, e = bits.size_in_bits(); b < e; b++) { in Dump()
268 for (size_t i = 0, e = stack_mask.size_in_bits(); i < e; ++i) { in Dump()
/art/dex2oat/linker/
Dcode_info_table_deduper.cc77 writer_.WriteBytesAligned(code_info_data, BitsToBytesRoundUp(read_region.size_in_bits())); in Dedupe()
/art/compiler/optimizing/
Dstack_map_stream.cc174 CHECK_GE(seen_stack_mask.size_in_bits(), stack_mask ? stack_mask->GetNumberOfBits() : 0); in BeginStackMapEntry()
175 for (size_t b = 0; b < seen_stack_mask.size_in_bits(); b++) { in BeginStackMapEntry()
Dstack_map_test.cc36 if (bit_vector.GetNumberOfBits() > stack_mask.size_in_bits()) { in CheckStackMask()
39 for (size_t i = 0; i < stack_mask.size_in_bits(); ++i) { in CheckStackMask()
Dcode_generator_arm64.cc1675 int size_in_bits) { in AcquireFPOrCoreCPURegisterOfSize() argument
1677 ? CPURegister(temps->AcquireRegisterOfSize(size_in_bits)) in AcquireFPOrCoreCPURegisterOfSize()
1678 : CPURegister(temps->AcquireVRegisterOfSize(size_in_bits)); in AcquireFPOrCoreCPURegisterOfSize()
/art/runtime/
Dquick_exception_handler.cc626 if (bit < stack_mask.size_in_bits() && stack_mask.LoadBit(bit)) { in HandleOptimizingDeoptimization()
Dthread.cc4254 for (size_t i = 0; i < stack_mask.size_in_bits(); ++i) { in VisitQuickFrameWithVregCallback()