| /art/libartbase/base/ |
| D | memory_region_test.cc | 30 + (2u << kBitsPerByte) in TEST()
31 + (3u << 2 * kBitsPerByte) in TEST()
32 + (4u << 3 * kBitsPerByte), in TEST()
34 ASSERT_EQ(5 + (6 << kBitsPerByte), region.LoadUnaligned<int16_t>(5)); in TEST()
44 region.StoreUnaligned<int16_t>(1, 6 + (5 << kBitsPerByte)); in TEST()
47 + (3u << kBitsPerByte) in TEST()
48 + (2u << 2 * kBitsPerByte) in TEST()
49 + (1u << 3 * kBitsPerByte)); in TEST()
|
| D | bit_memory_region_test.cc | 29 for (size_t i = 0; i < size * kBitsPerByte; i++) { in CheckBits()
31 uint8_t actual = data[i / kBitsPerByte] >> (i % kBitsPerByte); in CheckBits()
46 uint32_t upper_bound = RoundUp(MinimumBitsToStore(value), kBitsPerByte) + kVarintBits; in TEST()
56 for (size_t bit_offset = 0; bit_offset < 2 * sizeof(uint32_t) * kBitsPerByte; ++bit_offset) { in TEST()
78 for (size_t bit_offset = 0; bit_offset < 3 * sizeof(uint32_t) * kBitsPerByte; ++bit_offset) { in TEST()
80 for (size_t bit_length = 0; bit_length < sizeof(uint32_t) * kBitsPerByte; ++bit_length) { in TEST()
|
| D | bit_memory_region.h | 37 bit_start_ = bit_start + kBitsPerByte * (data - data_); in BitMemoryRegion()
51 DCHECK_ALIGNED(bit_start_, kBitsPerByte); in data()
52 return data_ + bit_start_ / kBitsPerByte; in data()
84 size_t index = (bit_start_ + bit_offset) / kBitsPerByte; in LoadBit()
85 size_t shift = (bit_start_ + bit_offset) % kBitsPerByte; in LoadBit()
91 size_t index = (bit_start_ + bit_offset) / kBitsPerByte; in StoreBit()
92 size_t shift = (bit_start_ + bit_offset) % kBitsPerByte; in StoreBit()
144 size_t index = (bit_start_ + bit_offset) / kBitsPerByte; in StoreBits()
145 size_t shift = (bit_start_ + bit_offset) % kBitsPerByte; in StoreBits()
148 size_t finished_bits = kBitsPerByte - shift; in StoreBits()
[all …]
|
| D | bit_field.h | 37 static_assert(position < sizeof(uintptr_t) * kBitsPerByte, "Invalid position.");
39 static_assert(size <= sizeof(uintptr_t) * kBitsPerByte, "Invalid size.");
40 static_assert(size + position <= sizeof(uintptr_t) * kBitsPerByte, "Invalid position + size.");
|
| D | bit_struct_detail.h | 61 using StorageType = typename MinimumTypeHelper<T, sizeof(T) * kBitsPerByte>::type;
151 const size_t kExpectedSize = (BitStructSizeOf<T>() < kBitsPerByte) in ValidateBitStructSize()
152 ? kBitsPerByte in ValidateBitStructSize()
156 const size_t kActualSize = sizeof(T) * kBitsPerByte; in ValidateBitStructSize()
|
| D | data_hash.h | 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()
105 uint8_t byte = region.LoadBits(i * kBitsPerByte, kBitsPerByte); in operator()
109 uint32_t end_bits = region.LoadBits(num_full_bytes * kBitsPerByte, num_end_bits); in operator()
|
| D | memory_region.h | 50 size_t size_in_bits() const { return size_ * kBitsPerByte; } in size_in_bits()
88 *ComputeInternalPointer<uint8_t>(offset + i) << (i * kBitsPerByte); in LoadUnaligned()
103 (equivalent_unsigned_integer_value >> (i * kBitsPerByte)) & 0xFF; in StoreUnaligned()
145 uintptr_t bit_remainder = (bit_offset & (kBitsPerByte - 1)); in ComputeBitPointer()
|
| D | globals.h | 30 static constexpr size_t kBitsPerByte = 8; variable
32 static constexpr int kBitsPerIntPtrT = sizeof(intptr_t) * kBitsPerByte;
|
| D | bit_struct_test.cc | 28 const size_t kExpectedSize = (BitStructSizeOf<T>() < kBitsPerByte) in ValidateBitStructSize()
29 ? kBitsPerByte in ValidateBitStructSize()
33 const size_t kActualSize = sizeof(T) * kBitsPerByte; in ValidateBitStructSize()
|
| D | utils.h | 91 return ((bitmap[idx / kBitsPerByte] >> (idx % kBitsPerByte)) & 0x01) != 0; in TestBitmap()
|
| D | stats.h | 38 void AddBits(double bits, size_t count = 1) { Add(bits / kBitsPerByte, count); }
|
| D | bit_utils.h | 504 return RoundUp(num_bits, kBitsPerByte) / kBitsPerByte; in BitsToBytesRoundUp()
|
| /art/tools/cpp-define-generator/ |
| D | mirror_object.def | 29 art::LockWord::kReadBarrierStateShift / art::kBitsPerByte)
31 art::LockWord::kReadBarrierStateShift % art::kBitsPerByte)
33 static_cast<int8_t>(1 << (art::LockWord::kReadBarrierStateShift % art::kBitsPerByte)))
|
| D | mirror_class.def | 55 (art::SubtypeCheckBits::BitStructSizeOf() / art::kBitsPerByte))
58 (art::SubtypeCheckBits::BitStructSizeOf() % art::kBitsPerByte))
61 (art::SubtypeCheckBits::BitStructSizeOf() % art::kBitsPerByte))
64 (art::SubtypeCheckBits::BitStructSizeOf() % art::kBitsPerByte))
|
| /art/dex2oat/linker/ |
| D | code_info_table_deduper.cc | 40 DCHECK_ALIGNED(start_bit_offset, kBitsPerByte); in Dedupe()
136 CodeInfo new_code_info(writer_.data() + start_bit_offset / kBitsPerByte); in Dedupe()
148 return start_bit_offset / kBitsPerByte; in Dedupe()
|
| /art/runtime/ |
| D | subtype_check_bits_and_status.h | 36 return kBitsPerByte * sizeof(T); in NonNumericBitSizeOf()
|
| D | obj_ptr.h | 43 kHeapReferenceSize * kBitsPerByte - kObjectAlignmentShift;
44 static constexpr size_t kCookieBits = sizeof(uintptr_t) * kBitsPerByte - kCookieShift;
|
| /art/libdexfile/dex/ |
| D | compact_offset_table.cc | 43 bit_mask = (bit_mask << kBitsPerByte) | *block; in GetOffset()
106 out_data->push_back(static_cast<uint8_t>(bit_mask >> kBitsPerByte)); in Build()
|
| D | compact_dex_file.h | 122 static constexpr size_t kInsnsSizeBits = sizeof(uint16_t) * kBitsPerByte - kInsnsSizeShift;
|
| /art/libprofile/profile/ |
| D | profile_helpers.h | 50 buffer->push_back((value >> (i * kBitsPerByte)) & 0xff); in AddUintToBuffer()
|
| /art/compiler/optimizing/ |
| D | intrinsics.h | 173 DCHECK_LT(bit, sizeof(uint32_t) * kBitsPerByte); in IsBitSet()
178 DCHECK_LT(bit, sizeof(uint32_t) * kBitsPerByte); in SetBit()
|
| D | code_generator.h | 67 mirror::Class::StatusOffset().SizeValue() + (status_lsb_position / kBitsPerByte);
69 enum_cast<uint32_t>(ClassStatus::kVisiblyInitialized) << (status_lsb_position % kBitsPerByte);
71 enum_cast<uint32_t>(ClassStatus::kInitializing) << (status_lsb_position % kBitsPerByte);
73 enum_cast<uint32_t>(ClassStatus::kInitialized) << (status_lsb_position % kBitsPerByte);
|
| /art/dex2oat/driver/ |
| D | compiled_method.h | 69 static constexpr size_t kMaxNumberOfPackedBits = sizeof(uint32_t) * kBitsPerByte;
|
| /art/runtime/gc/accounting/ |
| D | card_table-inl.h | 42 const size_t shift_in_bits = shift_in_bytes * kBitsPerByte; in byte_cas()
|
| D | space_bitmap.cc | 50 return bitmap_bytes * kBitsPerByte * kAlignment; in ComputeHeapSize()
|