• Home
  • History
  • Annotate
  • Raw
  • Download

Lines Matching refs:run

500   Run* run = nullptr;  in FreeInternal()  local
523 run = reinterpret_cast<Run*>(base_ + pm_idx * kPageSize); in FreeInternal()
524 DCHECK_EQ(run->magic_num_, kMagicNum); in FreeInternal()
536 DCHECK(run != nullptr); in FreeInternal()
537 return FreeFromRun(self, ptr, run); in FreeInternal()
756 size_t RosAlloc::FreeFromRun(Thread* self, void* ptr, Run* run) { in FreeFromRun() argument
757 DCHECK_EQ(run->magic_num_, kMagicNum); in FreeFromRun()
758 DCHECK_LT(run, ptr); in FreeFromRun()
759 DCHECK_LT(ptr, run->End()); in FreeFromRun()
760 const size_t idx = run->size_bracket_idx_; in FreeFromRun()
765 run_was_full = run->IsFull(); in FreeFromRun()
770 if (LIKELY(run->IsThreadLocal())) { in FreeFromRun()
772 DCHECK_LT(run->size_bracket_idx_, kNumThreadLocalSizeBrackets); in FreeFromRun()
773 DCHECK(non_full_runs_[idx].find(run) == non_full_runs_[idx].end()); in FreeFromRun()
774 DCHECK(full_runs_[idx].find(run) == full_runs_[idx].end()); in FreeFromRun()
775 run->AddToThreadLocalFreeList(ptr); in FreeFromRun()
778 << reinterpret_cast<intptr_t>(run); in FreeFromRun()
784 run->FreeSlot(ptr); in FreeFromRun()
786 if (run->IsAllFree()) { in FreeFromRun()
788 std::set<Run*>::iterator pos = non_full_runs->find(run); in FreeFromRun()
793 << reinterpret_cast<intptr_t>(run) << " from non_full_runs_"; in FreeFromRun()
796 if (run == current_runs_[idx]) { in FreeFromRun()
799 DCHECK(non_full_runs_[idx].find(run) == non_full_runs_[idx].end()); in FreeFromRun()
800 DCHECK(full_runs_[idx].find(run) == full_runs_[idx].end()); in FreeFromRun()
801 run->ZeroHeaderAndSlotHeaders(); in FreeFromRun()
804 FreePages(self, run, true); in FreeFromRun()
810 if (run != current_runs_[idx]) { in FreeFromRun()
812 auto pos = non_full_runs->find(run); in FreeFromRun()
815 DCHECK(full_runs->find(run) != full_runs->end()); in FreeFromRun()
817 full_runs->erase(run); in FreeFromRun()
820 << reinterpret_cast<intptr_t>(run) << " from full_runs_"; in FreeFromRun()
823 non_full_runs->insert(run); in FreeFromRun()
824 DCHECK(!run->IsFull()); in FreeFromRun()
827 << reinterpret_cast<intptr_t>(run) in FreeFromRun()
1027 Run* run = nullptr; in BulkFree() local
1037 run = reinterpret_cast<Run*>(base_ + pm_idx * kPageSize); in BulkFree()
1045 run = reinterpret_cast<Run*>(base_ + pi * kPageSize); in BulkFree()
1064 run = reinterpret_cast<Run*>(base_ + pm_idx * kPageSize); in BulkFree()
1072 run = reinterpret_cast<Run*>(base_ + pi * kPageSize); in BulkFree()
1080 DCHECK(run != nullptr); in BulkFree()
1081 DCHECK_EQ(run->magic_num_, kMagicNum); in BulkFree()
1083 freed_bytes += run->AddToBulkFreeList(ptr); in BulkFree()
1085 if (!run->to_be_bulk_freed_) { in BulkFree()
1086 run->to_be_bulk_freed_ = true; in BulkFree()
1087 runs.push_back(run); in BulkFree()
1090 runs.insert(run); in BulkFree()
1098 for (Run* run : runs) { in BulkFree()
1100 DCHECK(run->to_be_bulk_freed_); in BulkFree()
1101 run->to_be_bulk_freed_ = false; in BulkFree()
1103 size_t idx = run->size_bracket_idx_; in BulkFree()
1105 if (run->IsThreadLocal()) { in BulkFree()
1106 DCHECK_LT(run->size_bracket_idx_, kNumThreadLocalSizeBrackets); in BulkFree()
1107 DCHECK(non_full_runs_[idx].find(run) == non_full_runs_[idx].end()); in BulkFree()
1108 DCHECK(full_runs_[idx].find(run) == full_runs_[idx].end()); in BulkFree()
1109 run->MergeBulkFreeListToThreadLocalFreeList(); in BulkFree()
1112 << std::hex << reinterpret_cast<intptr_t>(run); in BulkFree()
1114 DCHECK(run->IsThreadLocal()); in BulkFree()
1118 bool run_was_full = run->IsFull(); in BulkFree()
1119 run->MergeBulkFreeListToFreeList(); in BulkFree()
1122 << reinterpret_cast<intptr_t>(run); in BulkFree()
1128 if (run->IsAllFree()) { in BulkFree()
1131 bool run_was_current = run == current_runs_[idx]; in BulkFree()
1133 DCHECK(full_runs->find(run) == full_runs->end()); in BulkFree()
1134 DCHECK(non_full_runs->find(run) == non_full_runs->end()); in BulkFree()
1140 std::unordered_set<Run*, hash_run, eq_run>::iterator pos = full_runs->find(run); in BulkFree()
1145 << reinterpret_cast<intptr_t>(run) in BulkFree()
1148 DCHECK(full_runs->find(run) == full_runs->end()); in BulkFree()
1152 DCHECK(full_runs->find(run) == full_runs->end()); in BulkFree()
1153 DCHECK(non_full_runs->find(run) != non_full_runs->end()); in BulkFree()
1154 non_full_runs->erase(run); in BulkFree()
1157 << reinterpret_cast<intptr_t>(run) in BulkFree()
1160 DCHECK(non_full_runs->find(run) == non_full_runs->end()); in BulkFree()
1163 run->ZeroHeaderAndSlotHeaders(); in BulkFree()
1165 FreePages(self, run, true); in BulkFree()
1171 if (run == current_runs_[idx]) { in BulkFree()
1172 DCHECK(non_full_runs->find(run) == non_full_runs->end()); in BulkFree()
1173 DCHECK(full_runs->find(run) == full_runs->end()); in BulkFree()
1178 DCHECK(full_runs->find(run) != full_runs->end()); in BulkFree()
1179 DCHECK(non_full_runs->find(run) == non_full_runs->end()); in BulkFree()
1181 full_runs->erase(run); in BulkFree()
1184 << reinterpret_cast<intptr_t>(run) in BulkFree()
1188 non_full_runs->insert(run); in BulkFree()
1191 << reinterpret_cast<intptr_t>(run) in BulkFree()
1196 DCHECK(full_runs->find(run) == full_runs->end()); in BulkFree()
1197 DCHECK(non_full_runs->find(run) != non_full_runs->end()); in BulkFree()
1273 Run* run = reinterpret_cast<Run*>(base_ + i * kPageSize); in DumpPageMap() local
1274 size_t idx = run->size_bracket_idx_; in DumpPageMap()
1278 << " is_thread_local=" << run->is_thread_local_ in DumpPageMap()
1279 << " is_all_free=" << (run->IsAllFree() ? 1 : 0) in DumpPageMap()
1330 Run* run = reinterpret_cast<Run*>(base_ + pm_idx * kPageSize); in UsableSize() local
1331 DCHECK_EQ(run->magic_num_, kMagicNum); in UsableSize()
1332 size_t idx = run->size_bracket_idx_; in UsableSize()
1334 - (reinterpret_cast<uint8_t*>(run) + headerSizes[idx]); in UsableSize()
1459 Run* run = reinterpret_cast<Run*>(base_ + i * kPageSize); in InspectAll() local
1460 DCHECK_EQ(run->magic_num_, kMagicNum); in InspectAll()
1463 run->InspectAllSlots(handler, arg); in InspectAll()
1464 size_t num_pages = numOfPages[run->size_bracket_idx_]; in InspectAll()
1541 void RosAlloc::RevokeRun(Thread* self, size_t idx, Run* run) { in RevokeRun() argument
1543 DCHECK(run != dedicated_full_run_); in RevokeRun()
1544 if (run->IsFull()) { in RevokeRun()
1546 full_runs_[idx].insert(run); in RevokeRun()
1547 DCHECK(full_runs_[idx].find(run) != full_runs_[idx].end()); in RevokeRun()
1550 << reinterpret_cast<intptr_t>(run) in RevokeRun()
1554 } else if (run->IsAllFree()) { in RevokeRun()
1555 run->ZeroHeaderAndSlotHeaders(); in RevokeRun()
1557 FreePages(self, run, true); in RevokeRun()
1559 non_full_runs_[idx].insert(run); in RevokeRun()
1560 DCHECK(non_full_runs_[idx].find(run) != non_full_runs_[idx].end()); in RevokeRun()
1563 << reinterpret_cast<intptr_t>(run) in RevokeRun()
1812 Run* run = reinterpret_cast<Run*>(base_ + i * kPageSize); in Verify() local
1813 DCHECK_EQ(run->magic_num_, kMagicNum); in Verify()
1814 size_t idx = run->size_bracket_idx_; in Verify()
1827 runs.push_back(run); in Verify()
1863 for (auto& run : runs) { in Verify() local
1864 run->Verify(self, this, is_running_on_memory_tool_); in Verify()
2140 Run* run = reinterpret_cast<Run*>(base_ + i * kPageSize); in DumpStats() local
2141 size_t idx = run->size_bracket_idx_; in DumpStats()
2146 size_t num_free_slots = run->NumberOfFreeSlots(); in DumpStats()