Lines Matching defs:new_size
186 size_t new_size = quantize(size);
211 if (size >= max_size || new_size >= max_size) {
216 e = malloc(new_size);
243 * of memory and then break it up into "new_size"-sized blocks, adding
246 if (freelists[new_size] == NULL) {
278 if (new_size > mem_target_half)
289 frags = total_size / new_size;
290 stats[new_size].blocks++;
291 stats[new_size].freefrags += frags;
292 /* Set up a linked-list of blocks of size "new_size". */
294 next = curr + new_size;
297 memset(curr, 0xa5, new_size);
301 next += new_size;
305 memset(curr, 0xa5, new_size);
307 ((memcluster_element *)curr)->next = freelists[new_size];
308 freelists[new_size] = new;
311 /* The free list uses the "rounded-up" size "new_size". */
313 e = freelists[new_size];
318 check(ret, 0xa5, new_size - sizeof *e);
324 ret = freelists[new_size];
326 freelists[new_size] = freelists[new_size]->next;
349 stats[new_size].freefrags--;
369 size_t new_size = quantize(size);
405 if (size == max_size || new_size >= max_size)
415 if (size == max_size || new_size >= max_size)
424 if (size == max_size || new_size >= max_size) {
438 /* The free list uses the "rounded-up" size "new_size": */
440 memset(mem, 0xa5, new_size - sizeof *e); /*%< catch write after free */
448 el = freelists[new_size];
454 freelists[new_size] = e;
456 e->next = freelists[new_size];
457 freelists[new_size] = (void *)e;
460 ((memcluster_element *)mem)->next = freelists[new_size];
461 freelists[new_size] = (memcluster_element *)mem;
472 stats[new_size].freefrags++;