Home | History | Annotate | Download | only in isc

Lines Matching refs:new_size

188 	size_t new_size = quantize(size);
213 	if (size >= max_size || new_size >= max_size) {
218 		e = malloc(new_size);
245 	 * of memory and then break it up into "new_size"-sized blocks, adding
248 	if (freelists[new_size] == NULL) {
280 		if (new_size > mem_target_half)
291 		frags = total_size / new_size;
292 		stats[new_size].blocks++;
293 		stats[new_size].freefrags += frags;
294 		/* Set up a linked-list of blocks of size "new_size". */
296 		next = curr + new_size;
299 			memset(curr, 0xa5, new_size);
303 			next += new_size;
307 		memset(curr, 0xa5, new_size);
309 		((memcluster_element *)curr)->next = freelists[new_size];
310 		freelists[new_size] = new;
313 	/* The free list uses the "rounded-up" size "new_size". */
315 	e = freelists[new_size];
320 	check(ret, 0xa5, new_size - sizeof *e);
326 	ret = freelists[new_size];
328 	freelists[new_size] = freelists[new_size]->next;
351 	stats[new_size].freefrags--;
371 	size_t new_size = quantize(size);
407 	if (size == max_size || new_size >= max_size)
417 		if (size == max_size || new_size >= max_size)
426 	if (size == max_size || new_size >= max_size) {
440 	/* The free list uses the "rounded-up" size "new_size": */
442 	memset(mem, 0xa5, new_size - sizeof *e); /*%< catch write after free */
450 	el = freelists[new_size];
456 		freelists[new_size] = e;
458 	e->next = freelists[new_size];
459 	freelists[new_size] = (void *)e;
462 	((memcluster_element *)mem)->next = freelists[new_size];
463 	freelists[new_size] = (memcluster_element *)mem;
474 	stats[new_size].freefrags++;