Lines Matching defs:fpr
130 FreePageRun* fpr = *it;
131 DCHECK(fpr->IsFree());
132 size_t fpr_byte_size = fpr->ByteSize(this);
139 << std::hex << reinterpret_cast<intptr_t>(fpr)
144 FreePageRun* remainder = reinterpret_cast<FreePageRun*>(reinterpret_cast<uint8_t*>(fpr) + req_byte_size);
157 fpr->SetByteSize(this, req_byte_size);
158 DCHECK_EQ(fpr->ByteSize(this) % kPageSize, static_cast<size_t>(0));
160 res = fpr;
227 FreePageRun* fpr = *it;
230 DCHECK_EQ(last_free_page_run, fpr);
232 size_t fpr_byte_size = fpr->ByteSize(this);
235 free_page_runs_.erase(fpr);
237 LOG(INFO) << "RosAlloc::AllocPages() : Erased run 0x" << std::hex << reinterpret_cast<intptr_t>(fpr)
242 FreePageRun* remainder = reinterpret_cast<FreePageRun*>(reinterpret_cast<uint8_t*>(fpr) + req_byte_size);
254 fpr->SetByteSize(this, req_byte_size);
255 DCHECK_EQ(fpr->ByteSize(this) % kPageSize, static_cast<size_t>(0));
257 res = fpr;
351 FreePageRun* fpr = reinterpret_cast<FreePageRun*>(ptr);
353 fpr->magic_num_ = kMagicNumFree;
355 fpr->SetByteSize(this, byte_size);
356 DCHECK_ALIGNED(fpr->ByteSize(this), kPageSize);
358 DCHECK(free_page_runs_.find(fpr) == free_page_runs_.end());
363 << std::hex << reinterpret_cast<uintptr_t>(fpr) << " [" << std::dec << pm_idx << "] -0x"
364 << std::hex << reinterpret_cast<uintptr_t>(fpr->End(this)) << " [" << std::dec
365 << (fpr->End(this) == End() ? page_map_size_ : ToPageMapIndex(fpr->End(this))) << "]";
367 auto higher_it = free_page_runs_.upper_bound(fpr);
378 if (fpr->End(this) == h->Begin()) {
392 fpr->SetByteSize(this, fpr->ByteSize(this) + h->ByteSize(this));
393 fpr->ByteSize(this) % kPageSize, static_cast<size_t>(0));
404 auto lower_it = free_page_runs_.upper_bound(fpr);
420 if (l->End(this) == fpr->Begin()) {
430 l->SetByteSize(this, l->ByteSize(this) + fpr->ByteSize(this));
434 fpr->magic_num_ = 0;
436 fpr = l;
452 DCHECK_EQ(fpr->ByteSize(this) % kPageSize, static_cast<size_t>(0));
453 DCHECK(free_page_runs_.find(fpr) == free_page_runs_.end());
454 DCHECK(fpr->IsFree());
455 fpr->ReleasePages(this);
456 DCHECK(fpr->IsFree());
457 free_page_runs_.insert(fpr);
458 DCHECK(free_page_runs_.find(fpr) != free_page_runs_.end());
460 LOG(INFO) << "RosAlloc::FreePages() : Inserted run 0x" << std::hex << reinterpret_cast<intptr_t>(fpr)
1227 FreePageRun* fpr = reinterpret_cast<FreePageRun*>(base_ + i * kPageSize);
1228 if (free_page_runs_.find(fpr) != free_page_runs_.end()) {
1231 DCHECK(fpr->IsFree());
1234 curr_fpr = fpr;
1235 curr_fpr_size = fpr->ByteSize(this);
1239 << " (FPR start) fpr_size=" << curr_fpr_size
1255 stream << "[" << i << "]=Empty (FPR part)"
1418 FreePageRun* fpr = reinterpret_cast<FreePageRun*>(base_ + i * kPageSize);
1419 DCHECK(free_page_runs_.find(fpr) != free_page_runs_.end());
1420 size_t fpr_size = fpr->ByteSize(this);
1422 void* start = fpr;
1426 start = reinterpret_cast<uint8_t*>(fpr) + kPageSize;
1428 void* end = reinterpret_cast<uint8_t*>(fpr) + fpr_size;
1767 FreePageRun* fpr = reinterpret_cast<FreePageRun*>(base_ + i * kPageSize);
1768 DCHECK_EQ(fpr->magic_num_, kMagicNumFree);
1769 CHECK(free_page_runs_.find(fpr) != free_page_runs_.end())
1771 size_t fpr_size = fpr->ByteSize(this);
2010 FreePageRun* fpr = reinterpret_cast<FreePageRun*>(base_ + i * kPageSize);
2011 // There is a race condition where FreePage can coalesce fpr with the previous
2013 // a run starting at fpr. To handle this race, we skip reclaiming the page range and go
2015 if (free_page_runs_.find(fpr) != free_page_runs_.end()) {
2016 size_t fpr_size = fpr->ByteSize(this);
2018 uint8_t* start = reinterpret_cast<uint8_t*>(fpr);
2082 for (FreePageRun* fpr : free_page_runs_) {
2084 fpr->ByteSize(this));
