254 	size_t aligned_size;  in region_alloc()  local
260 	aligned_size = REGION_ALIGN_UP(size, ALIGNMENT);  in region_alloc()
262 	if (aligned_size >= region->large_object_size) {  in region_alloc()
278 	if (region->recycle_bin && region->recycle_bin[aligned_size]) {  in region_alloc()
279 		result = (void*)region->recycle_bin[aligned_size];  in region_alloc()
280 		region->recycle_bin[aligned_size] = region->recycle_bin[aligned_size]->next;  in region_alloc()
281 		region->recycle_size -= aligned_size;  in region_alloc()
282 		region->unused_space += aligned_size - size;  in region_alloc()
286 	if (region->allocated + aligned_size > region->chunk_size) {  in region_alloc()
321 	region->allocated += aligned_size;  in region_alloc()
323 	region->total_allocated += aligned_size;  in region_alloc()
324 	region->unused_space += aligned_size - size;  in region_alloc()
434 	size_t aligned_size;  in region_recycle()  local
442 	aligned_size = REGION_ALIGN_UP(size, ALIGNMENT);  in region_recycle()
444 	if(aligned_size < region->large_object_size) {  in region_recycle()
447 		assert(aligned_size >= sizeof(struct recycle_elem));  in region_recycle()
452 			struct recycle_elem *p = region->recycle_bin[aligned_size];  in region_recycle()
460 		elem->next = region->recycle_bin[aligned_size];  in region_recycle()
461 		region->recycle_bin[aligned_size] = elem;  in region_recycle()
462 		region->recycle_size += aligned_size;  in region_recycle()
463 		region->unused_space -= aligned_size - size;  in region_recycle()