852 std::string RosAlloc::Run::BitMapToStr(uint32_t* bit_map_base, size_t num_vec) {  in BitMapToStr()  argument
854   for (size_t v = 0; v < num_vec; v++) {  in BitMapToStr()
856     if (v != num_vec - 1) {  in BitMapToStr()
868   size_t num_vec = RoundUp(num_slots, 32) / 32;  in Dump()  local
876          << " alloc_bit_map=" << BitMapToStr(alloc_bit_map_, num_vec)  in Dump()
877          << " bulk_free_bit_map=" << BitMapToStr(BulkFreeBitMap(), num_vec)  in Dump()
878          << " thread_local_bit_map=" << BitMapToStr(ThreadLocalFreeBitMap(), num_vec)  in Dump()
894     size_t num_vec = RoundUp(numOfSlots[idx], 32) / 32;  in FreeSlot()  local
895     DCHECK_LT(vec_idx, num_vec);  in FreeSlot()
917   const size_t num_vec = RoundUp(num_slots, 32) / 32;  in NumberOfFreeSlots()  local
918   DCHECK_NE(num_vec, 0U);  in NumberOfFreeSlots()
919   for (size_t v = 0; v < num_vec - 1; v++) {  in NumberOfFreeSlots()
923   uint32_t last_vec_masked = alloc_bit_map_[num_vec - 1] &  in NumberOfFreeSlots()
924       ~GetBitmapLastVectorMask(num_slots, num_vec);  in NumberOfFreeSlots()
937   const size_t num_vec = RoundUp(num_of_slots, 32) / 32;  in MergeThreadLocalFreeBitMapToAllocBitMap()  local
942   for (size_t v = 0; v < num_vec; v++, vecp++, tl_free_vecp++) {  in MergeThreadLocalFreeBitMapToAllocBitMap()
956       if (v == num_vec - 1) {  in MergeThreadLocalFreeBitMapToAllocBitMap()
959             is_all_free_after && GetBitmapLastVectorMask(num_of_slots, num_vec) == vec_after;  in MergeThreadLocalFreeBitMapToAllocBitMap()
975   const size_t num_vec = NumberOfBitmapVectors();  in MergeBulkFreeBitMapIntoAllocBitMap()  local
978   for (size_t v = 0; v < num_vec; v++, vecp++, free_vecp++) {  in MergeBulkFreeBitMapIntoAllocBitMap()
992   size_t num_vec = NumberOfBitmapVectors();  in UnionBulkFreeBitMapToThreadLocalFreeBitMap()  local
995   for (size_t v = 0; v < num_vec; v++, to_vecp++, from_vecp++) {  in UnionBulkFreeBitMapToThreadLocalFreeBitMap()
1026     size_t num_vec = NumberOfBitmapVectors();  in MarkFreeBitMapShared()  local
1027     DCHECK_LT(vec_idx, num_vec);  in MarkFreeBitMapShared()
1043 inline uint32_t RosAlloc::Run::GetBitmapLastVectorMask(size_t num_slots, size_t num_vec) {  in GetBitmapLastVectorMask()  argument
1045   DCHECK_GE(num_vec * kBitsPerVec, num_slots);  in GetBitmapLastVectorMask()
1046   DCHECK_NE(num_vec, 0U);  in GetBitmapLastVectorMask()
1047   size_t remain = num_vec * kBitsPerVec - num_slots;  in GetBitmapLastVectorMask()
1055   const size_t num_vec = NumberOfBitmapVectors();  in IsAllFree()  local
1056   DCHECK_NE(num_vec, 0U);  in IsAllFree()
1058   for (size_t v = 0; v < num_vec - 1; v++) {  in IsAllFree()
1065   return alloc_bit_map_[num_vec - 1] == GetBitmapLastVectorMask(num_slots, num_vec);  in IsAllFree()
1069   const size_t num_vec = NumberOfBitmapVectors();  in IsBulkFreeBitmapClean()  local
1070   for (size_t v = 0; v < num_vec; v++) {  in IsBulkFreeBitmapClean()
1080   const size_t num_vec = NumberOfBitmapVectors();  in IsThreadLocalFreeBitmapClean()  local
1081   for (size_t v = 0; v < num_vec; v++) {  in IsThreadLocalFreeBitmapClean()
1093   const size_t num_vec = RoundUp(num_slots, 32) / 32;  in SetAllocBitMapBitsForInvalidSlots()  local
1094   DCHECK_NE(num_vec, 0U);  in SetAllocBitMapBitsForInvalidSlots()
1097   alloc_bit_map_[num_vec - 1] |= GetBitmapLastVectorMask(num_slots, num_vec);  in SetAllocBitMapBitsForInvalidSlots()
1112   size_t num_vec = NumberOfBitmapVectors();  in FillAllocBitMap()  local
1113   memset(alloc_bit_map_, 0xFF, sizeof(uint32_t) * num_vec);  in FillAllocBitMap()
1114   first_search_vec_idx_ = num_vec - 1;  // No free bits in any of the bitmap words.  in FillAllocBitMap()
1125   size_t num_vec = RoundUp(num_slots, 32) / 32;  in InspectAllSlots()  local
1128   for (size_t v = 0; v < num_vec; v++, slots += 32) {  in InspectAllSlots()
2024   const size_t num_vec = RoundUp(num_slots, 32) / 32;  in Verify()  local
2025   CHECK_GT(num_vec, 0U);  in Verify()
2032   uint32_t last_word_mask = GetBitmapLastVectorMask(num_slots, num_vec);  in Verify()
2034   CHECK_EQ(alloc_bit_map_[num_vec - 1] & last_word_mask, last_word_mask);  in Verify()
2036   CHECK_LT(first_search_vec_idx_, num_vec);  in Verify()
2104   for (size_t v = 0; v < num_vec; v++, slots += 32) {  in Verify()