Lines Matching defs:fpr
137 FreePageRun* fpr = *it;
138 DCHECK(fpr->IsFree());
139 size_t fpr_byte_size = fpr->ByteSize(this);
146 << std::hex << reinterpret_cast<intptr_t>(fpr)
152 reinterpret_cast<FreePageRun*>(reinterpret_cast<uint8_t*>(fpr) + req_byte_size);
165 fpr->SetByteSize(this, req_byte_size);
166 DCHECK_EQ(fpr->ByteSize(this) % kPageSize, static_cast<size_t>(0));
168 res = fpr;
235 FreePageRun* fpr = *it;
238 DCHECK_EQ(last_free_page_run, fpr);
240 size_t fpr_byte_size = fpr->ByteSize(this);
243 free_page_runs_.erase(fpr);
245 LOG(INFO) << "RosAlloc::AllocPages() : Erased run 0x" << std::hex << reinterpret_cast<intptr_t>(fpr)
250 FreePageRun* remainder = reinterpret_cast<FreePageRun*>(reinterpret_cast<uint8_t*>(fpr) + req_byte_size);
262 fpr->SetByteSize(this, req_byte_size);
263 DCHECK_EQ(fpr->ByteSize(this) % kPageSize, static_cast<size_t>(0));
265 res = fpr;
359 FreePageRun* fpr = reinterpret_cast<FreePageRun*>(ptr);
361 fpr->magic_num_ = kMagicNumFree;
363 fpr->SetByteSize(this, byte_size);
364 DCHECK_ALIGNED(fpr->ByteSize(this), kPageSize);
366 DCHECK(free_page_runs_.find(fpr) == free_page_runs_.end());
371 << std::hex << reinterpret_cast<uintptr_t>(fpr) << " [" << std::dec << pm_idx << "] -0x"
372 << std::hex << reinterpret_cast<uintptr_t>(fpr->End(this)) << " [" << std::dec
373 << (fpr->End(this) == End() ? page_map_size_ : ToPageMapIndex(fpr->End(this))) << "]";
375 for (auto it = free_page_runs_.upper_bound(fpr); it != free_page_runs_.end(); ) {
384 if (fpr->End(this) == h->Begin()) {
398 fpr->SetByteSize(this, fpr->ByteSize(this) + h->ByteSize(this));
399 DCHECK_EQ(fpr->ByteSize(this) % kPageSize, static_cast<size_t>(0));
409 for (auto it = free_page_runs_.upper_bound(fpr); it != free_page_runs_.begin(); ) {
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;
448 DCHECK_EQ(fpr->ByteSize(this) % kPageSize, static_cast<size_t>(0));
449 DCHECK(free_page_runs_.find(fpr) == free_page_runs_.end());
450 DCHECK(fpr->IsFree());
451 fpr->ReleasePages(this);
452 DCHECK(fpr->IsFree());
453 free_page_runs_.insert(fpr);
454 DCHECK(free_page_runs_.find(fpr) != free_page_runs_.end());
456 LOG(INFO) << "RosAlloc::FreePages() : Inserted run 0x" << std::hex << reinterpret_cast<intptr_t>(fpr)
1223 FreePageRun* fpr = reinterpret_cast<FreePageRun*>(base_ + i * kPageSize);
1224 if (free_page_runs_.find(fpr) != free_page_runs_.end()) {
1227 DCHECK(fpr->IsFree());
1230 curr_fpr = fpr;
1231 curr_fpr_size = fpr->ByteSize(this);
1235 << " (FPR start) fpr_size=" << curr_fpr_size
1251 stream << "[" << i << "]=Empty (FPR part)"
1413 FreePageRun* fpr = reinterpret_cast<FreePageRun*>(base_ + i * kPageSize);
1414 DCHECK(free_page_runs_.find(fpr) != free_page_runs_.end());
1415 size_t fpr_size = fpr->ByteSize(this);
1417 void* start = fpr;
1421 start = reinterpret_cast<uint8_t*>(fpr) + kPageSize;
1423 void* end = reinterpret_cast<uint8_t*>(fpr) + fpr_size;
1762 FreePageRun* fpr = reinterpret_cast<FreePageRun*>(base_ + i * kPageSize);
1763 DCHECK_EQ(fpr->magic_num_, kMagicNumFree);
1764 CHECK(free_page_runs_.find(fpr) != free_page_runs_.end())
1766 size_t fpr_size = fpr->ByteSize(this);
2005 FreePageRun* fpr = reinterpret_cast<FreePageRun*>(base_ + i * kPageSize);
2006 // There is a race condition where FreePage can coalesce fpr with the previous
2008 // a run starting at fpr. To handle this race, we skip reclaiming the page range and go
2010 if (free_page_runs_.find(fpr) != free_page_runs_.end()) {
2011 size_t fpr_size = fpr->ByteSize(this);
2013 uint8_t* start = reinterpret_cast<uint8_t*>(fpr);
2078 for (FreePageRun* fpr : free_page_runs_) {
2080 fpr->ByteSize(this));
2081 total_free += fpr->ByteSize(this);
