Searched refs:kBitsPerByte (Results 1 - 20 of 20) sorted by relevance

/art/runtime/
H A Dmemory_region_test.cc30 + (2u << kBitsPerByte)
31 + (3u << 2 * kBitsPerByte)
32 + (4u << 3 * kBitsPerByte),
34 ASSERT_EQ(5 + (6 << kBitsPerByte), region.LoadUnaligned<int16_t>(5));
44 region.StoreUnaligned<int16_t>(1, 6 + (5 << kBitsPerByte));
47 + (3u << kBitsPerByte)
48 + (2u << 2 * kBitsPerByte)
49 + (1u << 3 * kBitsPerByte));
H A Dglobals.h32 static constexpr size_t kBitsPerByte = 8; member in namespace:art
34 static constexpr int kBitsPerIntPtrT = sizeof(intptr_t) * kBitsPerByte;
H A Dmemory_region.h43 size_t size_in_bits() const { return size_ * kBitsPerByte; }
81 *ComputeInternalPointer<uint8_t>(offset + i) << (i * kBitsPerByte);
96 (equivalent_unsigned_integer_value >> (i * kBitsPerByte)) & 0xFF;
128 CHECK_LE(length, sizeof(uint32_t) * kBitsPerByte);
174 uintptr_t bit_remainder = (bit_offset & (kBitsPerByte - 1));
H A Dstack_map.h523 GetLocationMappingDataOffset(number_of_dex_registers) * kBitsPerByte;
553 GetLocationMappingDataOffset(number_of_dex_registers) * kBitsPerByte;
564 size_t live_bit_mask_offset_in_bits = GetLiveBitMaskOffset() * kBitsPerByte;
571 size_t live_bit_mask_offset_in_bits = GetLiveBitMaskOffset() * kBitsPerByte;
592 return RoundUp(number_of_dex_registers, kBitsPerByte) / kBitsPerByte;
604 return RoundUp(location_mapping_data_size_in_bits, kBitsPerByte) / kBitsPerByte;
672 uint8_t* address = region.start() + start_offset_ / kBitsPerByte;
673 const uint32_t shift = start_offset_ & (kBitsPerByte
[all...]
H A Dutils.h329 return ((bitmap[idx / kBitsPerByte] >> (idx % kBitsPerByte)) & 0x01) != 0;
/art/runtime/base/
H A Dbit_field.h36 static_assert(position < sizeof(uintptr_t) * kBitsPerByte, "Invalid position.");
38 static_assert(size <= sizeof(uintptr_t) * kBitsPerByte, "Invalid size.");
39 static_assert(size + position <= sizeof(uintptr_t) * kBitsPerByte, "Invalid position + size.");
H A Dbit_vector.h261 DCHECK_LE(static_cast<size_t>(GetHighestBitSet() + 1), len * kBitsPerByte); local
/art/compiler/optimizing/
H A Dintrinsics.h142 DCHECK_LT(bit, sizeof(uint32_t) * kBitsPerByte);
147 DCHECK_LT(bit, sizeof(uint32_t) * kBitsPerByte);
H A Dstack_map_stream.cc93 (current_dex_register_ % (sizeof(current_entry_.dex_register_map_hash) * kBitsPerByte)));
206 RoundUp(map_entries_size_in_bits, kBitsPerByte) / kBitsPerByte;
H A Dinstruction_simplifier.cc325 size_t reg_bits = Primitive::ComponentSize(ushr->GetType()) * kBitsPerByte;
386 size_t reg_bits = Primitive::ComponentSize(ushr->GetType()) * kBitsPerByte;
876 if (trailing_ones >= kBitsPerByte * Primitive::ComponentSize(result_type)) {
H A Dcode_generator_arm.h35 static constexpr size_t kArmBitsPerWord = kArmWordSize * kBitsPerByte;
H A Dcode_generator_arm64.cc1344 __ Sbfx(Register(dst), Register(dst), 0, Primitive::ComponentSize(type) * kBitsPerByte);
1357 __ Sbfx(Register(dst), Register(dst), 0, Primitive::ComponentSize(type) * kBitsPerByte);
4694 0, Primitive::ComponentSize(Primitive::kPrimChar) * kBitsPerByte);
4696 __ Sbfx(output, output.IsX() ? source.X() : source.W(), 0, min_size * kBitsPerByte);
H A Dnodes.cc546 DCHECK(IsInt(Primitive::ComponentSize(type) * kBitsPerByte, value));
H A Dcode_generator_mips.cc1422 static constexpr size_t kMipsBitsPerWord = kMipsWordSize * kBitsPerByte;
H A Dnodes.h2053 static constexpr size_t kMaxNumberOfPackedBits = sizeof(uint32_t) * kBitsPerByte;
/art/runtime/gc/accounting/
H A Dbitmap.h103 static constexpr size_t kBitsPerBitmapWord = sizeof(uintptr_t) * kBitsPerByte;
H A Dcard_table-inl.h40 const size_t shift_in_bits = shift_in_bytes * kBitsPerByte;
H A Dspace_bitmap.cc39 return bitmap_bytes * kBitsPerByte * kAlignment;
/art/runtime/jit/
H A Doffline_profiling_info.cc162 buffer->push_back((value >> (i * kBitsPerByte)) & 0xff);
326 value += ptr_current_[i] << (i * kBitsPerByte);
/art/runtime/verifier/
H A Dreg_type_cache.cc347 kDefaultArenaBitVectorBytes * kBitsPerByte, // Allocate at least 8 bytes.

Completed in 1519 milliseconds