Lines Matching defs:chunk

56 		struct chunk* chunk = fChunks.RemoveHead();
57 if (chunk == NULL)
60 delete_area(chunk->area);
61 free(chunk);
88 // another chunk, or resize an existing chunk
95 // We need to split the chunk into two parts: the one to keep
114 usedBlock->chunk = best->chunk;
139 if (freeBlock->size != freeBlock->chunk->size) {
141 // and if we had one free blocks list per chunk!
145 if (block->chunk != freeBlock->chunk)
176 if (freeBlock->size == freeBlock->chunk->size) {
177 // We can delete the chunk now
178 struct chunk* chunk = freeBlock->chunk;
184 fChunks.Remove(chunk);
185 delete_area(chunk->area);
188 fApplication->NotifyDeleteClientArea(chunk->area);
190 free(chunk);
213 while (struct chunk* chunk = iterator.Next()) {
215 "size %lu\n", i++, chunk, chunk->area, chunk->base, chunk->size);
223 debug_printf(" [%6" B_PRId32 "] %p, chunk %p, base %p, size %lu\n",
224 i++, block, block->chunk, block->base, block->size);
238 struct chunk* chunk;
239 while ((chunk = iterator.Next()) != NULL) {
240 status_t status = resize_area(chunk->area, chunk->size + size);
252 if (chunk == NULL) {
259 chunk = (struct chunk*)malloc(sizeof(struct chunk));
260 if (chunk == NULL)
265 free(chunk);
280 free(chunk);
284 // add chunk to list
286 chunk->area = area;
287 chunk->base = address;
288 chunk->size = size;
290 fChunks.Add(chunk);
293 // create new free block for this chunk
298 address = chunk->base + chunk->size;
299 chunk->size += size;
304 block->chunk = chunk;
349 return fBlock->chunk->area;
367 return fBlock->base - fBlock->chunk->base;