1935   FreeSpace* new_node = free_list_.Allocate(size_in_bytes, &new_node_size);  in AllocateChunk()
2862 FreeSpace* FreeListCategory::PickNodeFromList(size_t minimum_size,  in AllocateChunk()
2865   FreeSpace* node = top();  in AllocateChunk()
2876 FreeSpace* FreeListCategory::SearchForNodeInList(size_t minimum_size,  in AllocateChunk()
2879   FreeSpace* prev_non_evac_node = nullptr;  in AllocateChunk()
2880   for (FreeSpace* cur_node = top(); cur_node != nullptr;  in AllocateChunk()
2909   FreeSpace* free_space = FreeSpace::cast(HeapObject::FromAddress(start));  in AllocateChunk()
2920   FreeSpace* n = top();  in AllocateChunk()
2974 FreeSpace* FreeList::FindNodeIn(FreeListCategoryType type, size_t minimum_size,  in AllocateChunk()
2977   FreeSpace* node = nullptr;  in AllocateChunk()
2990 FreeSpace* FreeList::TryFindNodeIn(FreeListCategoryType type,  in AllocateChunk()
2993   FreeSpace* node =  in AllocateChunk()
3001 FreeSpace* FreeList::SearchForNodeInList(FreeListCategoryType type,  in AllocateChunk()
3005   FreeSpace* node = nullptr;  in AllocateChunk()
3020 FreeSpace* FreeList::Allocate(size_t size_in_bytes, size_t* node_size) {  in AllocateChunk()
3022   FreeSpace* node = nullptr;  in AllocateChunk()
3131   FreeSpace* cur = top();  in AllocateChunk()
3142   FreeSpace* cur = top();  in AllocateChunk()