[deliverable/linux.git] / drivers / char / drm / i915_mem.c

/* i915_mem.c -- Simple agp/fb memory manager for i915 -*- linux-c -*-
 */
/*
 * Copyright 2003 Tungsten Graphics, Inc., Cedar Park, Texas.
 * All Rights Reserved.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the
 * "Software"), to deal in the Software without restriction, including
 * without limitation the rights to use, copy, modify, merge, publish,
 * distribute, sub license, and/or sell copies of the Software, and to
 * permit persons to whom the Software is furnished to do so, subject to
 * the following conditions:
 *
 * The above copyright notice and this permission notice (including the
 * next paragraph) shall be included in all copies or substantial portions
 * of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
 * IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 *
 */

#include "drmP.h"
#include "drm.h"
#include "i915_drm.h"
#include "i915_drv.h"

/* This memory manager is integrated into the global/local lru
 * mechanisms used by the clients.  Specifically, it operates by
 * setting the 'in_use' fields of the global LRU to indicate whether
 * this region is privately allocated to a client.
 *
 * This does require the client to actually respect that field.
 *
 * Currently no effort is made to allocate 'private' memory in any
 * clever way - the LRU information isn't used to determine which
 * block to allocate, and the ring is drained prior to allocations --
 * in other words allocation is expensive.
 */
static void mark_block(struct drm_device * dev, struct mem_block *p, int in_use)
{
	drm_i915_private_t *dev_priv = dev->dev_private;
	drm_i915_sarea_t *sarea_priv = dev_priv->sarea_priv;
	struct drm_tex_region *list;
	unsigned shift, nr;
	unsigned start;
	unsigned end;
	unsigned i;
	int age;

	shift = dev_priv->tex_lru_log_granularity;
	nr = I915_NR_TEX_REGIONS;

	start = p->start >> shift;
	end = (p->start + p->size - 1) >> shift;

	age = ++sarea_priv->texAge;
	list = sarea_priv->texList;

	/* Mark the regions with the new flag and update their age.  Move
	 * them to head of list to preserve LRU semantics.
	 */
	for (i = start; i <= end; i++) {
		list[i].in_use = in_use;
		list[i].age = age;

		/* remove_from_list(i)
		 */
		list[(unsigned)list[i].next].prev = list[i].prev;
		list[(unsigned)list[i].prev].next = list[i].next;

		/* insert_at_head(list, i)
		 */
		list[i].prev = nr;
		list[i].next = list[nr].next;
		list[(unsigned)list[nr].next].prev = i;
		list[nr].next = i;
	}
}

/* Very simple allocator for agp memory, working on a static range
 * already mapped into each client's address space.
 */

static struct mem_block *split_block(struct mem_block *p, int start, int size,
				     struct drm_file *file_priv)
{
	/* Maybe cut off the start of an existing block */
	if (start > p->start) {
		struct mem_block *newblock =
		    drm_alloc(sizeof(*newblock), DRM_MEM_BUFLISTS);
		if (!newblock)
			goto out;
		newblock->start = start;
		newblock->size = p->size - (start - p->start);
		newblock->file_priv = NULL;
		newblock->next = p->next;
		newblock->prev = p;
		p->next->prev = newblock;
		p->next = newblock;
		p->size -= newblock->size;
		p = newblock;
	}

	/* Maybe cut off the end of an existing block */
	if (size < p->size) {
		struct mem_block *newblock =
		    drm_alloc(sizeof(*newblock), DRM_MEM_BUFLISTS);
		if (!newblock)
			goto out;
		newblock->start = start + size;
		newblock->size = p->size - size;
		newblock->file_priv = NULL;
		newblock->next = p->next;
		newblock->prev = p;
		p->next->prev = newblock;
		p->next = newblock;
		p->size = size;
	}

      out:
	/* Our block is in the middle */
	p->file_priv = file_priv;
	return p;
}

static struct mem_block *alloc_block(struct mem_block *heap, int size,
				     int align2, struct drm_file *file_priv)
{
	struct mem_block *p;
	int mask = (1 << align2) - 1;

	for (p = heap->next; p != heap; p = p->next) {
		int start = (p->start + mask) & ~mask;
		if (p->file_priv == NULL && start + size <= p->start + p->size)
			return split_block(p, start, size, file_priv);
	}

	return NULL;
}

static struct mem_block *find_block(struct mem_block *heap, int start)
{
	struct mem_block *p;

	for (p = heap->next; p != heap; p = p->next)
		if (p->start == start)
			return p;

	return NULL;
}

static void free_block(struct mem_block *p)
{
	p->file_priv = NULL;

	/* Assumes a single contiguous range.  Needs a special file_priv in
	 * 'heap' to stop it being subsumed.
	 */
	if (p->next->file_priv == NULL) {
		struct mem_block *q = p->next;
		p->size += q->size;
		p->next = q->next;
		p->next->prev = p;
		drm_free(q, sizeof(*q), DRM_MEM_BUFLISTS);
	}

	if (p->prev->file_priv == NULL) {
		struct mem_block *q = p->prev;
		q->size += p->size;
		q->next = p->next;
		q->next->prev = q;
		drm_free(p, sizeof(*q), DRM_MEM_BUFLISTS);
	}
}

/* Initialize.  How to check for an uninitialized heap?
 */
static int init_heap(struct mem_block **heap, int start, int size)
{
	struct mem_block *blocks = drm_alloc(sizeof(*blocks), DRM_MEM_BUFLISTS);

	if (!blocks)
		return -ENOMEM;

	*heap = drm_alloc(sizeof(**heap), DRM_MEM_BUFLISTS);
	if (!*heap) {
		drm_free(blocks, sizeof(*blocks), DRM_MEM_BUFLISTS);
		return -ENOMEM;
	}

	blocks->start = start;
	blocks->size = size;
	blocks->file_priv = NULL;
	blocks->next = blocks->prev = *heap;

	memset(*heap, 0, sizeof(**heap));
	(*heap)->file_priv = (struct drm_file *) - 1;
	(*heap)->next = (*heap)->prev = blocks;
	return 0;
}

/* Free all blocks associated with the releasing file.
 */
void i915_mem_release(struct drm_device * dev, struct drm_file *file_priv,
		      struct mem_block *heap)
{
	struct mem_block *p;

	if (!heap || !heap->next)
		return;

	for (p = heap->next; p != heap; p = p->next) {
		if (p->file_priv == file_priv) {
			p->file_priv = NULL;
			mark_block(dev, p, 0);
		}
	}

	/* Assumes a single contiguous range.  Needs a special file_priv in
	 * 'heap' to stop it being subsumed.
	 */
	for (p = heap->next; p != heap; p = p->next) {
		while (p->file_priv == NULL && p->next->file_priv == NULL) {
			struct mem_block *q = p->next;
			p->size += q->size;
			p->next = q->next;
			p->next->prev = p;
			drm_free(q, sizeof(*q), DRM_MEM_BUFLISTS);
		}
	}
}

/* Shutdown.
 */
void i915_mem_takedown(struct mem_block **heap)
{
	struct mem_block *p;

	if (!*heap)
		return;

	for (p = (*heap)->next; p != *heap;) {
		struct mem_block *q = p;
		p = p->next;
		drm_free(q, sizeof(*q), DRM_MEM_BUFLISTS);
	}

	drm_free(*heap, sizeof(**heap), DRM_MEM_BUFLISTS);
	*heap = NULL;
}

static struct mem_block **get_heap(drm_i915_private_t * dev_priv, int region)
{
	switch (region) {
	case I915_MEM_REGION_AGP:
		return &dev_priv->agp_heap;
	default:
		return NULL;
	}
}

/* IOCTL HANDLERS */

int i915_mem_alloc(struct drm_device *dev, void *data,
		   struct drm_file *file_priv)
{
	drm_i915_private_t *dev_priv = dev->dev_private;
	drm_i915_mem_alloc_t *alloc = data;
	struct mem_block *block, **heap;

	if (!dev_priv) {
		DRM_ERROR("%s called with no initialization\n", __FUNCTION__);
		return -EINVAL;
	}

	heap = get_heap(dev_priv, alloc->region);
	if (!heap || !*heap)
		return -EFAULT;

	/* Make things easier on ourselves: all allocations at least
	 * 4k aligned.
	 */
	if (alloc->alignment < 12)
		alloc->alignment = 12;

	block = alloc_block(*heap, alloc->size, alloc->alignment, file_priv);

	if (!block)
		return -ENOMEM;

	mark_block(dev, block, 1);

	if (DRM_COPY_TO_USER(alloc->region_offset, &block->start,
			     sizeof(int))) {
		DRM_ERROR("copy_to_user\n");
		return -EFAULT;
	}

	return 0;
}

int i915_mem_free(struct drm_device *dev, void *data,
		  struct drm_file *file_priv)
{
	drm_i915_private_t *dev_priv = dev->dev_private;
	drm_i915_mem_free_t *memfree = data;
	struct mem_block *block, **heap;

	if (!dev_priv) {
		DRM_ERROR("%s called with no initialization\n", __FUNCTION__);
		return -EINVAL;
	}

	heap = get_heap(dev_priv, memfree->region);
	if (!heap || !*heap)
		return -EFAULT;

	block = find_block(*heap, memfree->region_offset);
	if (!block)
		return -EFAULT;

	if (block->file_priv != file_priv)
		return -EPERM;

	mark_block(dev, block, 0);
	free_block(block);
	return 0;
}

int i915_mem_init_heap(struct drm_device *dev, void *data,
		       struct drm_file *file_priv)
{
	drm_i915_private_t *dev_priv = dev->dev_private;
	drm_i915_mem_init_heap_t *initheap = data;
	struct mem_block **heap;

	if (!dev_priv) {
		DRM_ERROR("%s called with no initialization\n", __FUNCTION__);
		return -EINVAL;
	}

	heap = get_heap(dev_priv, initheap->region);
	if (!heap)
		return -EFAULT;

	if (*heap) {
		DRM_ERROR("heap already initialized?");
		return -EFAULT;
	}

	return init_heap(heap, initheap->start, initheap->size);
}

int i915_mem_destroy_heap( struct drm_device *dev, void *data,
			   struct drm_file *file_priv )
{
	drm_i915_private_t *dev_priv = dev->dev_private;
	drm_i915_mem_destroy_heap_t *destroyheap = data;
	struct mem_block **heap;

	if ( !dev_priv ) {
		DRM_ERROR( "%s called with no initialization\n", __FUNCTION__ );
		return -EINVAL;
	}

	heap = get_heap( dev_priv, destroyheap->region );
	if (!heap) {
		DRM_ERROR("get_heap failed");
		return -EFAULT;
	}

	if (!*heap) {
		DRM_ERROR("heap not initialized?");
		return -EFAULT;
	}

	i915_mem_takedown( heap );
	return 0;
}
Commit	Line	Data
1da177e4 LT	1	/* i915_mem.c -- Simple agp/fb memory manager for i915 -- linux-c --
1da177e4 LT	2	*/
0d6aa60b	3	/*
1da177e4 LT	4	* Copyright 2003 Tungsten Graphics, Inc., Cedar Park, Texas.
1da177e4 LT	5	* All Rights Reserved.
bc54fd1a DA	6	*
	7	* Permission is hereby granted, free of charge, to any person obtaining a
	8	* copy of this software and associated documentation files (the
	9	* "Software"), to deal in the Software without restriction, including
	10	* without limitation the rights to use, copy, modify, merge, publish,
	11	* distribute, sub license, and/or sell copies of the Software, and to
	12	* permit persons to whom the Software is furnished to do so, subject to
	13	* the following conditions:
	14	*
	15	* The above copyright notice and this permission notice (including the
	16	* next paragraph) shall be included in all copies or substantial portions
	17	* of the Software.
	18	*
	19	* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
	20	* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
	21	* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
	22	* IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
	23	* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
	24	* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
	25	* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
	26	*
0d6aa60b	27	*/
1da177e4 LT	28
	29	#include "drmP.h"
	30	#include "drm.h"
	31	#include "i915_drm.h"
	32	#include "i915_drv.h"
	33
	34	/* This memory manager is integrated into the global/local lru
	35	* mechanisms used by the clients. Specifically, it operates by
	36	* setting the 'in_use' fields of the global LRU to indicate whether
	37	* this region is privately allocated to a client.
	38	*
	39	* This does require the client to actually respect that field.
	40	*
	41	* Currently no effort is made to allocate 'private' memory in any
	42	* clever way - the LRU information isn't used to determine which
	43	* block to allocate, and the ring is drained prior to allocations --
	44	* in other words allocation is expensive.
	45	*/
84b1fd10	46	static void mark_block(struct drm_device * dev, struct mem_block *p, int in_use)
1da177e4 LT	47	{
	48	drm_i915_private_t *dev_priv = dev->dev_private;
	49	drm_i915_sarea_t *sarea_priv = dev_priv->sarea_priv;
c60ce623	50	struct drm_tex_region *list;
1da177e4 LT	51	unsigned shift, nr;
	52	unsigned start;
	53	unsigned end;
	54	unsigned i;
	55	int age;
	56
	57	shift = dev_priv->tex_lru_log_granularity;
	58	nr = I915_NR_TEX_REGIONS;
	59
	60	start = p->start >> shift;
	61	end = (p->start + p->size - 1) >> shift;
	62
	63	age = ++sarea_priv->texAge;
	64	list = sarea_priv->texList;
	65
	66	/* Mark the regions with the new flag and update their age. Move
	67	* them to head of list to preserve LRU semantics.
	68	*/
	69	for (i = start; i <= end; i++) {
	70	list[i].in_use = in_use;
	71	list[i].age = age;
	72
	73	/* remove_from_list(i)
	74	*/
	75	list[(unsigned)list[i].next].prev = list[i].prev;
	76	list[(unsigned)list[i].prev].next = list[i].next;
	77
	78	/* insert_at_head(list, i)
	79	*/
	80	list[i].prev = nr;
	81	list[i].next = list[nr].next;
	82	list[(unsigned)list[nr].next].prev = i;
	83	list[nr].next = i;
	84	}
	85	}
	86
	87	/* Very simple allocator for agp memory, working on a static range
b5e89ed5	88	* already mapped into each client's address space.
1da177e4 LT	89	*/
	90
	91	static struct mem_block split_block(struct mem_block p, int start, int size,
6c340eac	92	struct drm_file *file_priv)
1da177e4 LT	93	{
	94	/* Maybe cut off the start of an existing block */
	95	if (start > p->start) {
b5e89ed5 DA	96	struct mem_block *newblock =
b5e89ed5 DA	97	drm_alloc(sizeof(*newblock), DRM_MEM_BUFLISTS);
1da177e4 LT	98	if (!newblock)
	99	goto out;
	100	newblock->start = start;
	101	newblock->size = p->size - (start - p->start);
6c340eac	102	newblock->file_priv = NULL;
1da177e4 LT	103	newblock->next = p->next;
	104	newblock->prev = p;
	105	p->next->prev = newblock;
	106	p->next = newblock;
	107	p->size -= newblock->size;
	108	p = newblock;
	109	}
	110
	111	/* Maybe cut off the end of an existing block */
	112	if (size < p->size) {
b5e89ed5 DA	113	struct mem_block *newblock =
b5e89ed5 DA	114	drm_alloc(sizeof(*newblock), DRM_MEM_BUFLISTS);
1da177e4 LT	115	if (!newblock)
	116	goto out;
	117	newblock->start = start + size;
	118	newblock->size = p->size - size;
6c340eac	119	newblock->file_priv = NULL;
1da177e4 LT	120	newblock->next = p->next;
	121	newblock->prev = p;
	122	p->next->prev = newblock;
	123	p->next = newblock;
	124	p->size = size;
	125	}
	126
	127	out:
	128	/* Our block is in the middle */
6c340eac	129	p->file_priv = file_priv;
1da177e4 LT	130	return p;
	131	}
	132
	133	static struct mem_block alloc_block(struct mem_block heap, int size,
6c340eac	134	int align2, struct drm_file *file_priv)
1da177e4 LT	135	{
	136	struct mem_block *p;
	137	int mask = (1 << align2) - 1;
	138
	139	for (p = heap->next; p != heap; p = p->next) {
	140	int start = (p->start + mask) & ~mask;
6c340eac EA	141	if (p->file_priv == NULL && start + size <= p->start + p->size)
6c340eac EA	142	return split_block(p, start, size, file_priv);
1da177e4 LT	143	}
	144
	145	return NULL;
	146	}
	147
	148	static struct mem_block find_block(struct mem_block heap, int start)
	149	{
	150	struct mem_block *p;
	151
	152	for (p = heap->next; p != heap; p = p->next)
	153	if (p->start == start)
	154	return p;
	155
	156	return NULL;
	157	}
	158
	159	static void free_block(struct mem_block *p)
	160	{
6c340eac	161	p->file_priv = NULL;
1da177e4	162
6c340eac	163	/* Assumes a single contiguous range. Needs a special file_priv in
1da177e4 LT	164	* 'heap' to stop it being subsumed.
1da177e4 LT	165	*/
6c340eac	166	if (p->next->file_priv == NULL) {
1da177e4 LT	167	struct mem_block *q = p->next;
	168	p->size += q->size;
	169	p->next = q->next;
	170	p->next->prev = p;
	171	drm_free(q, sizeof(*q), DRM_MEM_BUFLISTS);
	172	}
	173
6c340eac	174	if (p->prev->file_priv == NULL) {
1da177e4 LT	175	struct mem_block *q = p->prev;
	176	q->size += p->size;
	177	q->next = p->next;
	178	q->next->prev = q;
	179	drm_free(p, sizeof(*q), DRM_MEM_BUFLISTS);
	180	}
	181	}
	182
	183	/* Initialize. How to check for an uninitialized heap?
	184	*/
	185	static int init_heap(struct mem_block **heap, int start, int size)
	186	{
	187	struct mem_block blocks = drm_alloc(sizeof(blocks), DRM_MEM_BUFLISTS);
	188
	189	if (!blocks)
	190	return -ENOMEM;
	191
	192	heap = drm_alloc(sizeof(*heap), DRM_MEM_BUFLISTS);
	193	if (!*heap) {
	194	drm_free(blocks, sizeof(*blocks), DRM_MEM_BUFLISTS);
	195	return -ENOMEM;
	196	}
	197
	198	blocks->start = start;
	199	blocks->size = size;
6c340eac	200	blocks->file_priv = NULL;
1da177e4 LT	201	blocks->next = blocks->prev = *heap;
	202
	203	memset(heap, 0, sizeof(*heap));
6c340eac	204	(heap)->file_priv = (struct drm_file ) - 1;
1da177e4 LT	205	(heap)->next = (heap)->prev = blocks;
	206	return 0;
	207	}
	208
	209	/* Free all blocks associated with the releasing file.
	210	*/
6c340eac EA	211	void i915_mem_release(struct drm_device * dev, struct drm_file *file_priv,
6c340eac EA	212	struct mem_block *heap)
1da177e4 LT	213	{
	214	struct mem_block *p;
	215
	216	if (!heap \|\| !heap->next)
	217	return;
	218
	219	for (p = heap->next; p != heap; p = p->next) {
6c340eac EA	220	if (p->file_priv == file_priv) {
6c340eac EA	221	p->file_priv = NULL;
1da177e4 LT	222	mark_block(dev, p, 0);
	223	}
	224	}
	225
6c340eac	226	/* Assumes a single contiguous range. Needs a special file_priv in
1da177e4 LT	227	* 'heap' to stop it being subsumed.
	228	*/
	229	for (p = heap->next; p != heap; p = p->next) {
6c340eac	230	while (p->file_priv == NULL && p->next->file_priv == NULL) {
1da177e4 LT	231	struct mem_block *q = p->next;
	232	p->size += q->size;
	233	p->next = q->next;
	234	p->next->prev = p;
	235	drm_free(q, sizeof(*q), DRM_MEM_BUFLISTS);
	236	}
	237	}
	238	}
	239
	240	/* Shutdown.
	241	*/
	242	void i915_mem_takedown(struct mem_block **heap)
	243	{
	244	struct mem_block *p;
	245
	246	if (!*heap)
	247	return;
	248
	249	for (p = (heap)->next; p != heap;) {
	250	struct mem_block *q = p;
	251	p = p->next;
	252	drm_free(q, sizeof(*q), DRM_MEM_BUFLISTS);
	253	}
	254
	255	drm_free(heap, sizeof(*heap), DRM_MEM_BUFLISTS);
	256	*heap = NULL;
	257	}
	258
	259	static struct mem_block *get_heap(drm_i915_private_t dev_priv, int region)
	260	{
	261	switch (region) {
	262	case I915_MEM_REGION_AGP:
	263	return &dev_priv->agp_heap;
	264	default:
	265	return NULL;
	266	}
	267	}
	268
	269	/* IOCTL HANDLERS */
	270
c153f45f EA	271	int i915_mem_alloc(struct drm_device dev, void data,
c153f45f EA	272	struct drm_file *file_priv)
1da177e4	273	{
1da177e4	274	drm_i915_private_t *dev_priv = dev->dev_private;
c153f45f	275	drm_i915_mem_alloc_t *alloc = data;
1da177e4 LT	276	struct mem_block block, *heap;
	277
	278	if (!dev_priv) {
	279	DRM_ERROR("%s called with no initialization\n", __FUNCTION__);
20caafa6	280	return -EINVAL;
1da177e4 LT	281	}
1da177e4 LT	282
c153f45f	283	heap = get_heap(dev_priv, alloc->region);
1da177e4	284	if (!heap \|\| !*heap)
20caafa6	285	return -EFAULT;
1da177e4 LT	286
	287	/* Make things easier on ourselves: all allocations at least
	288	* 4k aligned.
	289	*/
c153f45f EA	290	if (alloc->alignment < 12)
c153f45f EA	291	alloc->alignment = 12;
1da177e4	292
c153f45f	293	block = alloc_block(*heap, alloc->size, alloc->alignment, file_priv);
1da177e4 LT	294
1da177e4 LT	295	if (!block)
20caafa6	296	return -ENOMEM;
1da177e4 LT	297
	298	mark_block(dev, block, 1);
	299
c153f45f EA	300	if (DRM_COPY_TO_USER(alloc->region_offset, &block->start,
c153f45f EA	301	sizeof(int))) {
1da177e4	302	DRM_ERROR("copy_to_user\n");
20caafa6	303	return -EFAULT;
1da177e4 LT	304	}
	305
	306	return 0;
	307	}
	308
c153f45f EA	309	int i915_mem_free(struct drm_device dev, void data,
c153f45f EA	310	struct drm_file *file_priv)
1da177e4	311	{
1da177e4	312	drm_i915_private_t *dev_priv = dev->dev_private;
c153f45f	313	drm_i915_mem_free_t *memfree = data;
1da177e4 LT	314	struct mem_block block, *heap;
	315
	316	if (!dev_priv) {
	317	DRM_ERROR("%s called with no initialization\n", __FUNCTION__);
20caafa6	318	return -EINVAL;
1da177e4 LT	319	}
1da177e4 LT	320
c153f45f	321	heap = get_heap(dev_priv, memfree->region);
1da177e4	322	if (!heap \|\| !*heap)
20caafa6	323	return -EFAULT;
1da177e4	324
c153f45f	325	block = find_block(*heap, memfree->region_offset);
1da177e4	326	if (!block)
20caafa6	327	return -EFAULT;
1da177e4	328
6c340eac	329	if (block->file_priv != file_priv)
20caafa6	330	return -EPERM;
1da177e4 LT	331
	332	mark_block(dev, block, 0);
	333	free_block(block);
	334	return 0;
	335	}
	336
c153f45f EA	337	int i915_mem_init_heap(struct drm_device dev, void data,
c153f45f EA	338	struct drm_file *file_priv)
1da177e4	339	{
1da177e4	340	drm_i915_private_t *dev_priv = dev->dev_private;
c153f45f	341	drm_i915_mem_init_heap_t *initheap = data;
1da177e4 LT	342	struct mem_block **heap;
	343
	344	if (!dev_priv) {
	345	DRM_ERROR("%s called with no initialization\n", __FUNCTION__);
20caafa6	346	return -EINVAL;
1da177e4 LT	347	}
1da177e4 LT	348
c153f45f	349	heap = get_heap(dev_priv, initheap->region);
1da177e4	350	if (!heap)
20caafa6	351	return -EFAULT;
1da177e4 LT	352
	353	if (*heap) {
	354	DRM_ERROR("heap already initialized?");
20caafa6	355	return -EFAULT;
1da177e4 LT	356	}
1da177e4 LT	357
c153f45f	358	return init_heap(heap, initheap->start, initheap->size);
1da177e4	359	}
de227f5f	360
c153f45f EA	361	int i915_mem_destroy_heap( struct drm_device dev, void data,
c153f45f EA	362	struct drm_file *file_priv )
de227f5f	363	{
de227f5f	364	drm_i915_private_t *dev_priv = dev->dev_private;
c153f45f	365	drm_i915_mem_destroy_heap_t *destroyheap = data;
de227f5f DA	366	struct mem_block **heap;
	367
	368	if ( !dev_priv ) {
	369	DRM_ERROR( "%s called with no initialization\n", __FUNCTION__ );
20caafa6	370	return -EINVAL;
de227f5f DA	371	}
de227f5f DA	372
c153f45f	373	heap = get_heap( dev_priv, destroyheap->region );
de227f5f DA	374	if (!heap) {
de227f5f DA	375	DRM_ERROR("get_heap failed");
20caafa6	376	return -EFAULT;
de227f5f	377	}
bc5f4523	378
de227f5f DA	379	if (!*heap) {
de227f5f DA	380	DRM_ERROR("heap not initialized?");
20caafa6	381	return -EFAULT;
de227f5f DA	382	}
	383
	384	i915_mem_takedown( heap );
	385	return 0;
	386	}