Searched refs:kBitsInWord (Results 1 – 12 of 12) sorted by relevance
23 static const size_t kBitsInWord = (sizeof(uintptr_t) * 8); member24 static const size_t kMapSizeInWords = kMapSizeInBits / kBitsInWord;35 uintptr_t WordIdx = Idx / kBitsInWord; in AddValue()36 uintptr_t BitIdx = Idx % kBitsInWord; in AddValue()50 uintptr_t WordIdx = Idx / kBitsInWord; in Get()51 uintptr_t BitIdx = Idx % kBitsInWord; in Get()
21 static const size_t kBitsInWord = (sizeof(uintptr_t) * 8); member22 static const size_t kMapSizeInWords = kMapSizeInBitsAligned / kBitsInWord;
23 uintptr_t WordIdx = Idx / kBitsInWord; in Update()24 uintptr_t BitIdx = Idx % kBitsInWord; in Update()
430 auto word_idx = static_cast<uint32_t>(i / kBitsInWord); in FromSortedIndexVector()431 auto in_word_idx = static_cast<uint32_t>(i % kBitsInWord); in FromSortedIndexVector()450 auto word_idx = static_cast<uint32_t>(i / kBitsInWord); in FromUnsortedIndexVector()455 auto in_word_idx = static_cast<uint32_t>(i % kBitsInWord); in FromUnsortedIndexVector()
49 static constexpr uint32_t kBitsInWord = 64;
81 for (uint32_t i = 0; i < fast_path_elements; i += BitVector::kBitsInWord) { in LinearSearchWithComparator()84 for (uint32_t k = 0; k < BitVector::kBitsInWord; ++k, ++cur_val) { in LinearSearchWithComparator()
114 for (uint32_t i = 0; i < fast_path_elements; i += BitVector::kBitsInWord) { in SearchValidated()117 for (uint32_t k = 0; k < BitVector::kBitsInWord; ++k, ++cur_val) { in SearchValidated()
121 for (uint32_t i = 0; i < fast_path_elements; i += BitVector::kBitsInWord) { in SearchValidated()124 for (uint32_t k = 0; k < BitVector::kBitsInWord; ++k, ++arrangement_idx) { in SearchValidated()