Lines Matching refs:size

41     if (last_size != entry.size) {  in DumpFreeMap()
42 last_size = entry.size; in DumpFreeMap()
46 << " size=" << std::dec << entry.free_by_start_entry->size; in DumpFreeMap()
57 DCHECK_NE(chunk.size, 0u); in InsertChunk()
60 free_by_size_.emplace(chunk.size, insert_result.first); in InsertChunk()
76 if (munmap(chunk.ptr, chunk.size) != 0) { in ~SwapSpace()
78 << static_cast<const void*>(chunk.ptr) << " size=" << chunk.size; in ~SwapSpace()
87 if (free_by_start.size() != free_by_size.size()) { in CollectFree()
88 LOG(FATAL) << "Size: " << free_by_start.size() << " vs " << free_by_size.size(); in CollectFree()
94 sum1 += entry.free_by_start_entry->size; in CollectFree()
100 sum2 += entry.size; in CollectFree()
109 void* SwapSpace::Alloc(size_t size) { in Alloc() argument
111 size = RoundUp(size, 8U); in Alloc()
117 : free_by_size_.lower_bound(FreeBySizeEntry { size, free_by_start_.begin() }); in Alloc()
120 if (old_chunk.size == size) { in Alloc()
128 it->free_by_start_entry->ptr += size; in Alloc()
129 it->free_by_start_entry->size -= size; in Alloc()
132 node.value().size -= size; in Alloc()
138 SpaceChunk new_chunk = NewFileChunk(size); in Alloc()
139 if (new_chunk.size != size) { in Alloc()
141 SpaceChunk remainder = { new_chunk.ptr + size, new_chunk.size - size }; in Alloc()
177 void SwapSpace::Free(void* ptr, size_t size) { in Free() argument
179 size = RoundUp(size, 8U); in Free()
186 SpaceChunk chunk = { reinterpret_cast<uint8_t*>(ptr), size }; in Free()
194 chunk.size += prev->size; in Free()
195 chunk.ptr -= prev->size; in Free()
196 auto erase_pos = free_by_size_.find(FreeBySizeEntry { prev->size, prev }); in Free()
206 chunk.size += it->size; in Free()
207 auto erase_pos = free_by_size_.find(FreeBySizeEntry { it->size, it }); in Free()
218 if (free_after != free_before + size) { in Free()
220 …CHECK_EQ(free_after, free_before + size) << "Should be " << size << " difference from " << free_be… in Free()