servers/app/ClientMemoryAllocator.cpp

56 		struct chunk* chunk = fChunks.RemoveHead();
57 		if (chunk == NULL)
60 		delete_area(chunk->area);
61 		free(chunk);
84 		// another chunk, or resize an existing chunk
91 	// We need to split the chunk into two parts: the one to keep
110 	usedBlock->chunk = best->chunk;
135 	if (freeBlock->size != freeBlock->chunk->size) {
137 		//	and if we had one free blocks list per chunk!
141 			if (block->chunk != freeBlock->chunk)
172 	if (freeBlock->size == freeBlock->chunk->size) {
173 		// We can delete the chunk now
174 		struct chunk* chunk = freeBlock->chunk;
180 		fChunks.Remove(chunk);
181 		delete_area(chunk->area);
182 		fApplication->NotifyDeleteClientArea(chunk->area);
184 		free(chunk);
197 	while (struct chunk* chunk = iterator.Next()) {
199 			"size %lu\n", i++, chunk, chunk->area, chunk->base, chunk->size);
207 		debug_printf("  [%6" B_PRId32 "] %p, chunk %p, base %p, size %lu\n",
208 			i++, block, block->chunk, block->base, block->size);
222 	struct chunk* chunk;
223 	while ((chunk = iterator.Next()) != NULL) {
224 		status_t status = resize_area(chunk->area, chunk->size + size);
236 	if (chunk == NULL) {
243 		chunk = (struct chunk*)malloc(sizeof(struct chunk));
244 		if (chunk == NULL)
249 			free(chunk);
264 			free(chunk);
268 		// add chunk to list
270 		chunk->area = area;
271 		chunk->base = address;
272 		chunk->size = size;
274 		fChunks.Add(chunk);
277 		// create new free block for this chunk
282 		address = chunk->base + chunk->size;
283 		chunk->size += size;
288 	block->chunk = chunk;
328 		return fBlock->chunk->area;
346 		return fBlock->base - fBlock->chunk->base;