Home
last modified time | relevance | path

Searched refs:kBitsPerIntPtrT (Results 1 – 9 of 9) sorted by relevance

/art/libartbase/base/
Dhex_dump.cc38 char out[(kBitsPerIntPtrT / 4) + /* offset */ in Dump()
52 out[kBitsPerIntPtrT / 4] = ':'; in Dump()
61 char* asc = out + (kBitsPerIntPtrT / 4) + /* offset */ 1 + /* colon */ in Dump()
64 for (int i = 0; i < (kBitsPerIntPtrT / 4); i++) { in Dump()
65 *hex++ = gHexDigit[line_offset >> (kBitsPerIntPtrT - 4)]; in Dump()
Dhex_dump_test.cc59 EXPECT_STREQ(oss.str().c_str() + (kBitsPerIntPtrT / 4), in TEST()
Dglobals.h32 static constexpr int kBitsPerIntPtrT = sizeof(intptr_t) * kBitsPerByte; variable
/art/runtime/gc/accounting/
Dspace_bitmap.h68 return offset / kAlignment / kBitsPerIntPtrT; in OffsetToIndex()
75 return static_cast<T>(index * kAlignment * kBitsPerIntPtrT); in IndexToOffset()
82 return (offset / kAlignment) % kBitsPerIntPtrT; in OffsetBitIndex()
Dspace_bitmap.cc39 const uint64_t kBytesCoveredPerWord = kAlignment * kBitsPerIntPtrT; in ComputeBitmapSize()
100 DCHECK_ALIGNED(new_end, kBitsPerIntPtrT * kAlignment); in SetHeapLimit()
171 size_t buffer_size = sizeof(intptr_t) * kBitsPerIntPtrT; in SweepWalk()
191 mirror::Object** pointer_end = cur_pointer + (buffer_size - kBitsPerIntPtrT); in SweepWalk()
Dspace_bitmap_test.cc69 for (size_t j = 0; j < kBitsPerIntPtrT * 3; ++j) { in TEST_F()
80 for (size_t i = 0; i < static_cast<size_t>(kBitsPerIntPtrT); ++i) { in TEST_F()
83 for (size_t j = 0; j < static_cast<size_t>(kBitsPerIntPtrT * 2); ++j) { in TEST_F()
Dspace_bitmap-inl.h89 const size_t bit_start = (offset_start / kAlignment) % kBitsPerIntPtrT; in VisitMarkedRange()
90 const size_t bit_end = (offset_end / kAlignment) % kBitsPerIntPtrT; in VisitMarkedRange()
/art/libdexfile/dex/
Dcompact_offset_table.cc53 size_t count = POPCOUNT(static_cast<uintptr_t>(bit_mask) << (kBitsPerIntPtrT - 1 - bit_index)); in GetOffset()
/art/compiler/optimizing/
Dlocations.h403 static constexpr uint32_t kBitsForPayload = kBitsPerIntPtrT - kBitsForKind;