Home
last modified time | relevance | path

Searched refs:free_list_ (Results 1 – 5 of 5) sorted by relevance

/external/webrtc/webrtc/base/
Dbufferqueue.cc25 for (Buffer* buffer : free_list_) { in ~BufferQueue()
50 free_list_.push_back(packet); in ReadFront()
66 if (!free_list_.empty()) { in WriteBack()
67 packet = free_list_.back(); in WriteBack()
68 free_list_.pop_back(); in WriteBack()
Dbufferqueue.h50 std::vector<Buffer*> free_list_ GUARDED_BY(crit_);
/external/v8/src/heap/
Dspaces.cc81 free_list_(0), in CodeRange()
165 free_list_.AddAll(allocation_list_); in GetNextAllocationBlock()
167 free_list_.Sort(&CompareFreeBlockAddress); in GetNextAllocationBlock()
168 for (int i = 0; i < free_list_.length();) { in GetNextAllocationBlock()
169 FreeBlock merged = free_list_[i]; in GetNextAllocationBlock()
172 while (i < free_list_.length() && in GetNextAllocationBlock()
173 free_list_[i].start == merged.start + merged.size) { in GetNextAllocationBlock()
174 merged.size += free_list_[i].size; in GetNextAllocationBlock()
181 free_list_.Clear(); in GetNextAllocationBlock()
234 free_list_.Add(FreeBlock(address, length)); in FreeRawMemory()
[all …]
Dspaces.h1135 List<FreeBlock> free_list_; variable
1995 free_list_.ResetStats(); in ClearStats()
2008 intptr_t Available() override { return free_list_.Available(); } in Available()
2022 virtual intptr_t Waste() { return free_list_.wasted_bytes(); } in Waste()
2059 int wasted = free_list_.Free(start, size_in_bytes); in Free()
2064 void ResetFreeList() { free_list_.Reset(); } in ResetFreeList()
2169 FreeList* free_list() { return &free_list_; } in free_list()
2210 FreeList free_list_; variable
Dspaces-inl.h366 object = free_list_.Allocate(size_in_bytes); in AllocateRawUnaligned()
403 object = free_list_.Allocate(allocation_size); in AllocateRawAligned()