[linux-2.6-block.git] / drivers / gpu / drm / i915 / 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;
	struct drm_i915_master_private *master_priv = dev->primary->master->driver_priv;
	drm_i915_sarea_t *sarea_priv = master_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("called with no initialization\n");
		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("called with no initialization\n");
		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("called with no initialization\n");
		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( "called with no initialization\n" );
		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	{
1da177e4 LT	48	drm_i915_private_t *dev_priv = dev->dev_private;
7c1c2871 DA	49	struct drm_i915_master_private *master_priv = dev->primary->master->driver_priv;
7c1c2871 DA	50	drm_i915_sarea_t *sarea_priv = master_priv->sarea_priv;
c60ce623	51	struct drm_tex_region *list;
1da177e4 LT	52	unsigned shift, nr;
	53	unsigned start;
	54	unsigned end;
	55	unsigned i;
	56	int age;
	57
	58	shift = dev_priv->tex_lru_log_granularity;
	59	nr = I915_NR_TEX_REGIONS;
	60
	61	start = p->start >> shift;
	62	end = (p->start + p->size - 1) >> shift;
	63
	64	age = ++sarea_priv->texAge;
	65	list = sarea_priv->texList;
	66
	67	/* Mark the regions with the new flag and update their age. Move
	68	* them to head of list to preserve LRU semantics.
	69	*/
	70	for (i = start; i <= end; i++) {
	71	list[i].in_use = in_use;
	72	list[i].age = age;
	73
	74	/* remove_from_list(i)
	75	*/
	76	list[(unsigned)list[i].next].prev = list[i].prev;
	77	list[(unsigned)list[i].prev].next = list[i].next;
	78
	79	/* insert_at_head(list, i)
	80	*/
	81	list[i].prev = nr;
	82	list[i].next = list[nr].next;
	83	list[(unsigned)list[nr].next].prev = i;
	84	list[nr].next = i;
	85	}
	86	}
	87
	88	/* Very simple allocator for agp memory, working on a static range
b5e89ed5	89	* already mapped into each client's address space.
1da177e4 LT	90	*/
	91
	92	static struct mem_block split_block(struct mem_block p, int start, int size,
6c340eac	93	struct drm_file *file_priv)
1da177e4 LT	94	{
	95	/* Maybe cut off the start of an existing block */
	96	if (start > p->start) {
b5e89ed5 DA	97	struct mem_block *newblock =
b5e89ed5 DA	98	drm_alloc(sizeof(*newblock), DRM_MEM_BUFLISTS);
1da177e4 LT	99	if (!newblock)
	100	goto out;
	101	newblock->start = start;
	102	newblock->size = p->size - (start - p->start);
6c340eac	103	newblock->file_priv = NULL;
1da177e4 LT	104	newblock->next = p->next;
	105	newblock->prev = p;
	106	p->next->prev = newblock;
	107	p->next = newblock;
	108	p->size -= newblock->size;
	109	p = newblock;
	110	}
	111
	112	/* Maybe cut off the end of an existing block */
	113	if (size < p->size) {
b5e89ed5 DA	114	struct mem_block *newblock =
b5e89ed5 DA	115	drm_alloc(sizeof(*newblock), DRM_MEM_BUFLISTS);
1da177e4 LT	116	if (!newblock)
	117	goto out;
	118	newblock->start = start + size;
	119	newblock->size = p->size - size;
6c340eac	120	newblock->file_priv = NULL;
1da177e4 LT	121	newblock->next = p->next;
	122	newblock->prev = p;
	123	p->next->prev = newblock;
	124	p->next = newblock;
	125	p->size = size;
	126	}
	127
	128	out:
	129	/* Our block is in the middle */
6c340eac	130	p->file_priv = file_priv;
1da177e4 LT	131	return p;
	132	}
	133
	134	static struct mem_block alloc_block(struct mem_block heap, int size,
6c340eac	135	int align2, struct drm_file *file_priv)
1da177e4 LT	136	{
	137	struct mem_block *p;
	138	int mask = (1 << align2) - 1;
	139
	140	for (p = heap->next; p != heap; p = p->next) {
	141	int start = (p->start + mask) & ~mask;
6c340eac EA	142	if (p->file_priv == NULL && start + size <= p->start + p->size)
6c340eac EA	143	return split_block(p, start, size, file_priv);
1da177e4 LT	144	}
	145
	146	return NULL;
	147	}
	148
	149	static struct mem_block find_block(struct mem_block heap, int start)
	150	{
	151	struct mem_block *p;
	152
	153	for (p = heap->next; p != heap; p = p->next)
	154	if (p->start == start)
	155	return p;
	156
	157	return NULL;
	158	}
	159
	160	static void free_block(struct mem_block *p)
	161	{
6c340eac	162	p->file_priv = NULL;
1da177e4	163
6c340eac	164	/* Assumes a single contiguous range. Needs a special file_priv in
1da177e4 LT	165	* 'heap' to stop it being subsumed.
1da177e4 LT	166	*/
6c340eac	167	if (p->next->file_priv == NULL) {
1da177e4 LT	168	struct mem_block *q = p->next;
	169	p->size += q->size;
	170	p->next = q->next;
	171	p->next->prev = p;
	172	drm_free(q, sizeof(*q), DRM_MEM_BUFLISTS);
	173	}
	174
6c340eac	175	if (p->prev->file_priv == NULL) {
1da177e4 LT	176	struct mem_block *q = p->prev;
	177	q->size += p->size;
	178	q->next = p->next;
	179	q->next->prev = q;
	180	drm_free(p, sizeof(*q), DRM_MEM_BUFLISTS);
	181	}
	182	}
	183
	184	/* Initialize. How to check for an uninitialized heap?
	185	*/
	186	static int init_heap(struct mem_block **heap, int start, int size)
	187	{
	188	struct mem_block blocks = drm_alloc(sizeof(blocks), DRM_MEM_BUFLISTS);
	189
	190	if (!blocks)
	191	return -ENOMEM;
	192
	193	heap = drm_alloc(sizeof(*heap), DRM_MEM_BUFLISTS);
	194	if (!*heap) {
	195	drm_free(blocks, sizeof(*blocks), DRM_MEM_BUFLISTS);
	196	return -ENOMEM;
	197	}
	198
	199	blocks->start = start;
	200	blocks->size = size;
6c340eac	201	blocks->file_priv = NULL;
1da177e4 LT	202	blocks->next = blocks->prev = *heap;
	203
	204	memset(heap, 0, sizeof(*heap));
6c340eac	205	(heap)->file_priv = (struct drm_file ) - 1;
1da177e4 LT	206	(heap)->next = (heap)->prev = blocks;
	207	return 0;
	208	}
	209
	210	/* Free all blocks associated with the releasing file.
	211	*/
6c340eac EA	212	void i915_mem_release(struct drm_device * dev, struct drm_file *file_priv,
6c340eac EA	213	struct mem_block *heap)
1da177e4 LT	214	{
	215	struct mem_block *p;
	216
	217	if (!heap \|\| !heap->next)
	218	return;
	219
	220	for (p = heap->next; p != heap; p = p->next) {
6c340eac EA	221	if (p->file_priv == file_priv) {
6c340eac EA	222	p->file_priv = NULL;
1da177e4 LT	223	mark_block(dev, p, 0);
	224	}
	225	}
	226
6c340eac	227	/* Assumes a single contiguous range. Needs a special file_priv in
1da177e4 LT	228	* 'heap' to stop it being subsumed.
	229	*/
	230	for (p = heap->next; p != heap; p = p->next) {
6c340eac	231	while (p->file_priv == NULL && p->next->file_priv == NULL) {
1da177e4 LT	232	struct mem_block *q = p->next;
	233	p->size += q->size;
	234	p->next = q->next;
	235	p->next->prev = p;
	236	drm_free(q, sizeof(*q), DRM_MEM_BUFLISTS);
	237	}
	238	}
	239	}
	240
	241	/* Shutdown.
	242	*/
	243	void i915_mem_takedown(struct mem_block **heap)
	244	{
	245	struct mem_block *p;
	246
	247	if (!*heap)
	248	return;
	249
	250	for (p = (heap)->next; p != heap;) {
	251	struct mem_block *q = p;
	252	p = p->next;
	253	drm_free(q, sizeof(*q), DRM_MEM_BUFLISTS);
	254	}
	255
	256	drm_free(heap, sizeof(*heap), DRM_MEM_BUFLISTS);
	257	*heap = NULL;
	258	}
	259
	260	static struct mem_block *get_heap(drm_i915_private_t dev_priv, int region)
	261	{
	262	switch (region) {
	263	case I915_MEM_REGION_AGP:
	264	return &dev_priv->agp_heap;
	265	default:
	266	return NULL;
	267	}
	268	}
	269
	270	/* IOCTL HANDLERS */
	271
c153f45f EA	272	int i915_mem_alloc(struct drm_device dev, void data,
c153f45f EA	273	struct drm_file *file_priv)
1da177e4	274	{
1da177e4	275	drm_i915_private_t *dev_priv = dev->dev_private;
c153f45f	276	drm_i915_mem_alloc_t *alloc = data;
1da177e4 LT	277	struct mem_block block, *heap;
	278
	279	if (!dev_priv) {
3e684eae	280	DRM_ERROR("called with no initialization\n");
20caafa6	281	return -EINVAL;
1da177e4 LT	282	}
1da177e4 LT	283
c153f45f	284	heap = get_heap(dev_priv, alloc->region);
1da177e4	285	if (!heap \|\| !*heap)
20caafa6	286	return -EFAULT;
1da177e4 LT	287
	288	/* Make things easier on ourselves: all allocations at least
	289	* 4k aligned.
	290	*/
c153f45f EA	291	if (alloc->alignment < 12)
c153f45f EA	292	alloc->alignment = 12;
1da177e4	293
c153f45f	294	block = alloc_block(*heap, alloc->size, alloc->alignment, file_priv);
1da177e4 LT	295
1da177e4 LT	296	if (!block)
20caafa6	297	return -ENOMEM;
1da177e4 LT	298
	299	mark_block(dev, block, 1);
	300
c153f45f EA	301	if (DRM_COPY_TO_USER(alloc->region_offset, &block->start,
c153f45f EA	302	sizeof(int))) {
1da177e4	303	DRM_ERROR("copy_to_user\n");
20caafa6	304	return -EFAULT;
1da177e4 LT	305	}
	306
	307	return 0;
	308	}
	309
c153f45f EA	310	int i915_mem_free(struct drm_device dev, void data,
c153f45f EA	311	struct drm_file *file_priv)
1da177e4	312	{
1da177e4	313	drm_i915_private_t *dev_priv = dev->dev_private;
c153f45f	314	drm_i915_mem_free_t *memfree = data;
1da177e4 LT	315	struct mem_block block, *heap;
	316
	317	if (!dev_priv) {
3e684eae	318	DRM_ERROR("called with no initialization\n");
20caafa6	319	return -EINVAL;
1da177e4 LT	320	}
1da177e4 LT	321
c153f45f	322	heap = get_heap(dev_priv, memfree->region);
1da177e4	323	if (!heap \|\| !*heap)
20caafa6	324	return -EFAULT;
1da177e4	325
c153f45f	326	block = find_block(*heap, memfree->region_offset);
1da177e4	327	if (!block)
20caafa6	328	return -EFAULT;
1da177e4	329
6c340eac	330	if (block->file_priv != file_priv)
20caafa6	331	return -EPERM;
1da177e4 LT	332
	333	mark_block(dev, block, 0);
	334	free_block(block);
	335	return 0;
	336	}
	337
c153f45f EA	338	int i915_mem_init_heap(struct drm_device dev, void data,
c153f45f EA	339	struct drm_file *file_priv)
1da177e4	340	{
1da177e4	341	drm_i915_private_t *dev_priv = dev->dev_private;
c153f45f	342	drm_i915_mem_init_heap_t *initheap = data;
1da177e4 LT	343	struct mem_block **heap;
	344
	345	if (!dev_priv) {
3e684eae	346	DRM_ERROR("called with no initialization\n");
20caafa6	347	return -EINVAL;
1da177e4 LT	348	}
1da177e4 LT	349
c153f45f	350	heap = get_heap(dev_priv, initheap->region);
1da177e4	351	if (!heap)
20caafa6	352	return -EFAULT;
1da177e4 LT	353
	354	if (*heap) {
	355	DRM_ERROR("heap already initialized?");
20caafa6	356	return -EFAULT;
1da177e4 LT	357	}
1da177e4 LT	358
c153f45f	359	return init_heap(heap, initheap->start, initheap->size);
1da177e4	360	}
de227f5f	361
c153f45f EA	362	int i915_mem_destroy_heap( struct drm_device dev, void data,
c153f45f EA	363	struct drm_file *file_priv )
de227f5f	364	{
de227f5f	365	drm_i915_private_t *dev_priv = dev->dev_private;
c153f45f	366	drm_i915_mem_destroy_heap_t *destroyheap = data;
de227f5f DA	367	struct mem_block **heap;
	368
	369	if ( !dev_priv ) {
3e684eae	370	DRM_ERROR( "called with no initialization\n" );
20caafa6	371	return -EINVAL;
de227f5f DA	372	}
de227f5f DA	373
c153f45f	374	heap = get_heap( dev_priv, destroyheap->region );
de227f5f DA	375	if (!heap) {
de227f5f DA	376	DRM_ERROR("get_heap failed");
20caafa6	377	return -EFAULT;
de227f5f	378	}
bc5f4523	379
de227f5f DA	380	if (!*heap) {
de227f5f DA	381	DRM_ERROR("heap not initialized?");
20caafa6	382	return -EFAULT;
de227f5f DA	383	}
	384
	385	i915_mem_takedown( heap );
	386	return 0;
	387	}