HomeSort by relevance Sort by last modified time
    Searched refs:kBitsPerWord (Results 1 - 6 of 6) sorted by null

  /art/runtime/
globals.h 38 const int kBitsPerWord = kWordSize * kBitsPerByte;
39 const int kWordHighBitMask = 1 << (kBitsPerWord - 1);
utils.h 75 CHECK_LT(N, kBitsPerWord);
82 CHECK_LT(N, kBitsPerWord);
89 CHECK_LT(N, kBitsPerWord);
  /art/runtime/gc/accounting/
space_bitmap_test.cc 69 for (size_t j = 0; j < kBitsPerWord * 3; ++j) {
77 // possible length up to a maximum of kBitsPerWord * 2 - 1 bits.
80 for (size_t i = 0; i < static_cast<size_t>(kBitsPerWord); ++i) {
83 for (size_t j = 0; j < static_cast<size_t>(kBitsPerWord * 2); ++j) {
space_bitmap-inl.h 63 size_t word_start = bit_index_start / kBitsPerWord;
64 size_t word_end = bit_index_end / kBitsPerWord;
71 size_t left_bits = bit_index_start & (kBitsPerWord - 1);
73 edge_word &= (1 << (kBitsPerWord - left_bits)) - 1;
102 size_t right_bits = bit_index_end & (kBitsPerWord - 1);
space_bitmap.cc 57 size_t bitmap_size = OffsetToIndex(RoundUp(heap_capacity, kAlignment * kBitsPerWord)) * kWordSize;
63 // Round up since heap_capacity is not necessarily a multiple of kAlignment * kBitsPerWord.
64 size_t bitmap_size = OffsetToIndex(RoundUp(heap_capacity, kAlignment * kBitsPerWord)) * kWordSize;
77 DCHECK(IsAligned<kBitsPerWord * kAlignment>(new_end));
145 const size_t buffer_size = kWordSize * kBitsPerWord;
164 if (pb >= &pointer_buf[buffer_size - kBitsPerWord]) {
space_bitmap.h 67 return offset / kAlignment / kBitsPerWord;
71 return static_cast<uintptr_t>(index * kAlignment * kBitsPerWord);
76 return static_cast<uintptr_t>(kWordHighBitMask) >> ((offset_ / kAlignment) % kBitsPerWord);

Completed in 118 milliseconds