powerpc/lib/rheap.c

47 	rh_block_t *block, *blk;
57 	block = kmalloc_array(max_blocks, sizeof(rh_block_t), GFP_ATOMIC);
58 	if (block == NULL)
63 		/* copy old block area */
64 		memcpy(block, info->block,
67 		delta = (char *)block - (char *)info->block;
70 		blks = (unsigned long)info->block;
71 		blke = (unsigned long)(info->block + info->max_blocks);
73 		for (i = 0, blk = block; i < info->max_blocks; i++, blk++)
82 			kfree(info->block);
85 	info->block = block;
91 	blk = block + info->max_blocks - new_blocks;
100  * causes a grow in the block area then all pointers kept to the block
115 	/* Next 16 sized block */
213 	/* Grow the before block */
219 	/* Grow the after block backwards */
226 	/* Grow the before block, and release the after block */
237 	/* Find the block immediately before the given one (if any) */
268 	info->block = NULL;
288 		kfree(info->block);
296  * Initialize in place a remote heap info block.  This is needed to support
301 	     rh_block_t * block)
313 	info->block = block;
323 	for (i = 0, blk = block; i < max_blocks; i++, blk++)
369 /* Detatch given address range, splits free block if needed. */
397 		/* The range must lie entirely inside one free block */
438 /* Allocate a block of memory at the specified alignment.  The value returned
480 		/* Create block for fragment in the beginning */
513 /* Allocate a block of memory at the default alignment.  The value returned is
523 /* Allocate a block of memory at the given offset, rounded up to the default
554 		/* The range must lie entirely inside one free block */
609  * The return value is the size of the deallocated block, or a negative number
618 	/* Linear search for block */
633 	/* Get size of freed block */
662 	/* Linear search for block */
685 	/* Linear search for block */