Searched refs:kMaxPages (Results 1 – 9 of 9) sorted by relevance
60 release_index_(kMaxPages) { in PageHeap()64 for (int i = 0; i < kMaxPages; i++) { in PageHeap()75 for (Length s = n; s < kMaxPages; s++) { in SearchFreeAndLargeLists()243 SpanList* list = (span->length < kMaxPages) ? &free_[span->length] : &large_; in PrependToFreeList()319 for (int i = 0; i < kMaxPages+1 && released_pages < num_pages; in ReleaseAtLeastNPages()321 if (release_index_ > kMaxPages) release_index_ = 0; in ReleaseAtLeastNPages()322 SpanList* slist = (release_index_ == kMaxPages) ? in ReleaseAtLeastNPages()346 for (int s = 0; s < kMaxPages; s++) { in GetSmallSpanStats()406 ASSERT(kMaxPages >= kMinSystemAlloc); in GrowHeap()462 CheckList(&large_.normal, kMaxPages, 1000000000, Span::ON_NORMAL_FREELIST); in CheckExpensive()[all …]
155 int64 normal_length[kMaxPages];156 int64 returned_length[kMaxPages];204 static const int kMinSystemAlloc = kMaxPages;233 SpanList free_[kMaxPages];
78 static const size_t kMaxPages = 1 << (20 - kPageShift); variable
436 for (int s = 0; s < kMaxPages; s++) { in DumpStats()448 for (int s = 0; s < kMaxPages; s++) { in DumpStats()867 span_info.min_object_size = kMaxPages << kPageShift; in GetFreeListSizes()877 for (int s = 1; s < kMaxPages; s++) { in GetFreeListSizes()
60 release_index_(kMaxPages) { in PageHeap()64 for (int i = 0; i < kMaxPages; i++) { in PageHeap()75 for (Length s = n; s < kMaxPages; s++) { in SearchFreeAndLargeLists()304 SpanList* list = (span->length < kMaxPages) ? &free_[span->length] : &large_; in PrependToFreeList()380 for (int i = 0; i < kMaxPages+1 && released_pages < num_pages; in ReleaseAtLeastNPages()382 if (release_index_ > kMaxPages) release_index_ = 0; in ReleaseAtLeastNPages()383 SpanList* slist = (release_index_ == kMaxPages) ? in ReleaseAtLeastNPages()407 for (int s = 0; s < kMaxPages; s++) { in GetSmallSpanStats()467 ASSERT(kMaxPages >= kMinSystemAlloc); in GrowHeap()525 CheckList(&large_.normal, kMaxPages, 1000000000, Span::ON_NORMAL_FREELIST); in CheckExpensive()[all …]
165 int64 normal_length[kMaxPages];166 int64 returned_length[kMaxPages];214 static const int kMinSystemAlloc = kMaxPages;245 SpanList free_[kMaxPages];
95 static const size_t kMaxPages = 1 << (20 - kPageShift); variable
464 for (int s = 0; s < kMaxPages; s++) { in DumpStats()476 for (int s = 0; s < kMaxPages; s++) { in DumpStats()874 span_info.min_object_size = kMaxPages << kPageShift; in GetFreeListSizes()884 for (int s = 1; s < kMaxPages; s++) { in GetFreeListSizes()
496 static const size_t kMaxPages = kMinSystemAlloc; variable1510 SpanList free_[kMaxPages];1619 scavenge_index_ = kMaxPages-1; in init()1623 for (size_t i = 0; i < kMaxPages; i++) { in init()1767 for (int i = kMaxPages; i > 0 && free_committed_pages_ >= targetPageCount; i--) { in scavenge()1768 SpanList* slist = (static_cast<size_t>(i) == kMaxPages) ? &large_ : &free_[i]; in scavenge()1808 for (Length s = n; s < kMaxPages; s++) { in New()1947 SpanList* listpair = (static_cast<size_t>(extra) < kMaxPages) ? &free_[extra] : &large_; in Carve()2026 if (span->length < kMaxPages) in Delete()2031 if (span->length < kMaxPages) in Delete()[all …]