[net-next-2.6.git] / drivers / gpu / drm / drm_mm.c

/**************************************************************************
 *
 * Copyright 2006 Tungsten Graphics, Inc., Bismarck, ND., USA.
 * 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
 * THE COPYRIGHT HOLDERS, AUTHORS 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.
 *
 *
 **************************************************************************/

/*
 * Generic simple memory manager implementation. Intended to be used as a base
 * class implementation for more advanced memory managers.
 *
 * Note that the algorithm used is quite simple and there might be substantial
 * performance gains if a smarter free list is implemented. Currently it is just an
 * unordered stack of free regions. This could easily be improved if an RB-tree
 * is used instead. At least if we expect heavy fragmentation.
 *
 * Aligned allocations can also see improvement.
 *
 * Authors:
 * Thomas Hellström <thomas-at-tungstengraphics-dot-com>
 */

#include "drmP.h"
#include "drm_mm.h"
#include <linux/slab.h>
#include <linux/seq_file.h>

#define MM_UNUSED_TARGET 4

static struct drm_mm_node *drm_mm_kmalloc(struct drm_mm *mm, int atomic)
{
	struct drm_mm_node *child;

	if (atomic)
		child = kmalloc(sizeof(*child), GFP_ATOMIC);
	else
		child = kmalloc(sizeof(*child), GFP_KERNEL);

	if (unlikely(child == NULL)) {
		spin_lock(&mm->unused_lock);
		if (list_empty(&mm->unused_nodes))
			child = NULL;
		else {
			child =
			    list_entry(mm->unused_nodes.next,
				       struct drm_mm_node, free_stack);
			list_del(&child->free_stack);
			--mm->num_unused;
		}
		spin_unlock(&mm->unused_lock);
	}
	return child;
}

/* drm_mm_pre_get() - pre allocate drm_mm_node structure
 * drm_mm:	memory manager struct we are pre-allocating for
 *
 * Returns 0 on success or -ENOMEM if allocation fails.
 */
int drm_mm_pre_get(struct drm_mm *mm)
{
	struct drm_mm_node *node;

	spin_lock(&mm->unused_lock);
	while (mm->num_unused < MM_UNUSED_TARGET) {
		spin_unlock(&mm->unused_lock);
		node = kmalloc(sizeof(*node), GFP_KERNEL);
		spin_lock(&mm->unused_lock);

		if (unlikely(node == NULL)) {
			int ret = (mm->num_unused < 2) ? -ENOMEM : 0;
			spin_unlock(&mm->unused_lock);
			return ret;
		}
		++mm->num_unused;
		list_add_tail(&node->free_stack, &mm->unused_nodes);
	}
	spin_unlock(&mm->unused_lock);
	return 0;
}
EXPORT_SYMBOL(drm_mm_pre_get);

static int drm_mm_create_tail_node(struct drm_mm *mm,
				   unsigned long start,
				   unsigned long size, int atomic)
{
	struct drm_mm_node *child;

	child = drm_mm_kmalloc(mm, atomic);
	if (unlikely(child == NULL))
		return -ENOMEM;

	child->free = 1;
	child->size = size;
	child->start = start;
	child->mm = mm;

	list_add_tail(&child->node_list, &mm->node_list);
	list_add_tail(&child->free_stack, &mm->free_stack);

	return 0;
}

static struct drm_mm_node *drm_mm_split_at_start(struct drm_mm_node *parent,
						 unsigned long size,
						 int atomic)
{
	struct drm_mm_node *child;

	child = drm_mm_kmalloc(parent->mm, atomic);
	if (unlikely(child == NULL))
		return NULL;

	INIT_LIST_HEAD(&child->free_stack);

	child->free = 0;
	child->size = size;
	child->start = parent->start;
	child->mm = parent->mm;

	list_add_tail(&child->node_list, &parent->node_list);
	INIT_LIST_HEAD(&child->free_stack);

	parent->size -= size;
	parent->start += size;
	return child;
}


struct drm_mm_node *drm_mm_get_block_generic(struct drm_mm_node *node,
					     unsigned long size,
					     unsigned alignment,
					     int atomic)
{

	struct drm_mm_node *align_splitoff = NULL;
	unsigned tmp = 0;

	if (alignment)
		tmp = node->start % alignment;

	if (tmp) {
		align_splitoff =
		    drm_mm_split_at_start(node, alignment - tmp, atomic);
		if (unlikely(align_splitoff == NULL))
			return NULL;
	}

	if (node->size == size) {
		list_del_init(&node->free_stack);
		node->free = 0;
	} else {
		node = drm_mm_split_at_start(node, size, atomic);
	}

	if (align_splitoff)
		drm_mm_put_block(align_splitoff);

	return node;
}
EXPORT_SYMBOL(drm_mm_get_block_generic);

struct drm_mm_node *drm_mm_get_block_range_generic(struct drm_mm_node *node,
						unsigned long size,
						unsigned alignment,
						unsigned long start,
						unsigned long end,
						int atomic)
{
	struct drm_mm_node *align_splitoff = NULL;
	unsigned tmp = 0;
	unsigned wasted = 0;

	if (node->start < start)
		wasted += start - node->start;
	if (alignment)
		tmp = ((node->start + wasted) % alignment);

	if (tmp)
		wasted += alignment - tmp;
	if (wasted) {
		align_splitoff = drm_mm_split_at_start(node, wasted, atomic);
		if (unlikely(align_splitoff == NULL))
			return NULL;
	}

	if (node->size == size) {
		list_del_init(&node->free_stack);
		node->free = 0;
	} else {
		node = drm_mm_split_at_start(node, size, atomic);
	}

	if (align_splitoff)
		drm_mm_put_block(align_splitoff);

	return node;
}
EXPORT_SYMBOL(drm_mm_get_block_range_generic);

/*
 * Put a block. Merge with the previous and / or next block if they are free.
 * Otherwise add to the free stack.
 */

void drm_mm_put_block(struct drm_mm_node *cur)
{

	struct drm_mm *mm = cur->mm;
	struct list_head *cur_head = &cur->node_list;
	struct list_head *root_head = &mm->node_list;
	struct drm_mm_node *prev_node = NULL;
	struct drm_mm_node *next_node;

	int merged = 0;

	if (cur_head->prev != root_head) {
		prev_node =
		    list_entry(cur_head->prev, struct drm_mm_node, node_list);
		if (prev_node->free) {
			prev_node->size += cur->size;
			merged = 1;
		}
	}
	if (cur_head->next != root_head) {
		next_node =
		    list_entry(cur_head->next, struct drm_mm_node, node_list);
		if (next_node->free) {
			if (merged) {
				prev_node->size += next_node->size;
				list_del(&next_node->node_list);
				list_del(&next_node->free_stack);
				spin_lock(&mm->unused_lock);
				if (mm->num_unused < MM_UNUSED_TARGET) {
					list_add(&next_node->free_stack,
						 &mm->unused_nodes);
					++mm->num_unused;
				} else
					kfree(next_node);
				spin_unlock(&mm->unused_lock);
			} else {
				next_node->size += cur->size;
				next_node->start = cur->start;
				merged = 1;
			}
		}
	}
	if (!merged) {
		cur->free = 1;
		list_add(&cur->free_stack, &mm->free_stack);
	} else {
		list_del(&cur->node_list);
		spin_lock(&mm->unused_lock);
		if (mm->num_unused < MM_UNUSED_TARGET) {
			list_add(&cur->free_stack, &mm->unused_nodes);
			++mm->num_unused;
		} else
			kfree(cur);
		spin_unlock(&mm->unused_lock);
	}
}

EXPORT_SYMBOL(drm_mm_put_block);

struct drm_mm_node *drm_mm_search_free(const struct drm_mm *mm,
				       unsigned long size,
				       unsigned alignment, int best_match)
{
	struct drm_mm_node *entry;
	struct drm_mm_node *best;
	unsigned long best_size;
	unsigned wasted;

	best = NULL;
	best_size = ~0UL;

	list_for_each_entry(entry, &mm->free_stack, free_stack) {
		wasted = 0;

		if (entry->size < size)
			continue;

		if (alignment) {
			register unsigned tmp = entry->start % alignment;
			if (tmp)
				wasted += alignment - tmp;
		}

		if (entry->size >= size + wasted) {
			if (!best_match)
				return entry;
			if (entry->size < best_size) {
				best = entry;
				best_size = entry->size;
			}
		}
	}

	return best;
}
EXPORT_SYMBOL(drm_mm_search_free);

struct drm_mm_node *drm_mm_search_free_in_range(const struct drm_mm *mm,
						unsigned long size,
						unsigned alignment,
						unsigned long start,
						unsigned long end,
						int best_match)
{
	struct drm_mm_node *entry;
	struct drm_mm_node *best;
	unsigned long best_size;
	unsigned wasted;

	best = NULL;
	best_size = ~0UL;

	list_for_each_entry(entry, &mm->free_stack, free_stack) {
		wasted = 0;

		if (entry->size < size)
			continue;

		if (entry->start > end || (entry->start+entry->size) < start)
			continue;

		if (entry->start < start)
			wasted += start - entry->start;

		if (alignment) {
			register unsigned tmp = (entry->start + wasted) % alignment;
			if (tmp)
				wasted += alignment - tmp;
		}

		if (entry->size >= size + wasted &&
		    (entry->start + wasted + size) <= end) {
			if (!best_match)
				return entry;
			if (entry->size < best_size) {
				best = entry;
				best_size = entry->size;
			}
		}
	}

	return best;
}
EXPORT_SYMBOL(drm_mm_search_free_in_range);

int drm_mm_clean(struct drm_mm * mm)
{
	struct list_head *head = &mm->node_list;

	return (head->next->next == head);
}
EXPORT_SYMBOL(drm_mm_clean);

int drm_mm_init(struct drm_mm * mm, unsigned long start, unsigned long size)
{
	INIT_LIST_HEAD(&mm->node_list);
	INIT_LIST_HEAD(&mm->free_stack);
	INIT_LIST_HEAD(&mm->unused_nodes);
	mm->num_unused = 0;
	spin_lock_init(&mm->unused_lock);

	return drm_mm_create_tail_node(mm, start, size, 0);
}
EXPORT_SYMBOL(drm_mm_init);

void drm_mm_takedown(struct drm_mm * mm)
{
	struct list_head *bnode = mm->free_stack.next;
	struct drm_mm_node *entry;
	struct drm_mm_node *next;

	entry = list_entry(bnode, struct drm_mm_node, free_stack);

	if (entry->node_list.next != &mm->node_list ||
	    entry->free_stack.next != &mm->free_stack) {
		DRM_ERROR("Memory manager not clean. Delaying takedown\n");
		return;
	}

	list_del(&entry->free_stack);
	list_del(&entry->node_list);
	kfree(entry);

	spin_lock(&mm->unused_lock);
	list_for_each_entry_safe(entry, next, &mm->unused_nodes, free_stack) {
		list_del(&entry->free_stack);
		kfree(entry);
		--mm->num_unused;
	}
	spin_unlock(&mm->unused_lock);

	BUG_ON(mm->num_unused != 0);
}
EXPORT_SYMBOL(drm_mm_takedown);

void drm_mm_debug_table(struct drm_mm *mm, const char *prefix)
{
	struct drm_mm_node *entry;
	int total_used = 0, total_free = 0, total = 0;

	list_for_each_entry(entry, &mm->node_list, node_list) {
		printk(KERN_DEBUG "%s 0x%08lx-0x%08lx: %8ld: %s\n",
			prefix, entry->start, entry->start + entry->size,
			entry->size, entry->free ? "free" : "used");
		total += entry->size;
		if (entry->free)
			total_free += entry->size;
		else
			total_used += entry->size;
	}
	printk(KERN_DEBUG "%s total: %d, used %d free %d\n", prefix, total,
		total_used, total_free);
}
EXPORT_SYMBOL(drm_mm_debug_table);

#if defined(CONFIG_DEBUG_FS)
int drm_mm_dump_table(struct seq_file *m, struct drm_mm *mm)
{
	struct drm_mm_node *entry;
	int total_used = 0, total_free = 0, total = 0;

	list_for_each_entry(entry, &mm->node_list, node_list) {
		seq_printf(m, "0x%08lx-0x%08lx: 0x%08lx: %s\n", entry->start, entry->start + entry->size, entry->size, entry->free ? "free" : "used");
		total += entry->size;
		if (entry->free)
			total_free += entry->size;
		else
			total_used += entry->size;
	}
	seq_printf(m, "total: %d, used %d free %d\n", total, total_used, total_free);
	return 0;
}
EXPORT_SYMBOL(drm_mm_dump_table);
#endif
Commit	Line	Data
3a1bd924 TH	1	/**************************************************************************
	2	*
	3	* Copyright 2006 Tungsten Graphics, Inc., Bismarck, ND., USA.
	4	* All Rights Reserved.
	5	*
	6	* Permission is hereby granted, free of charge, to any person obtaining a
	7	* copy of this software and associated documentation files (the
	8	* "Software"), to deal in the Software without restriction, including
	9	* without limitation the rights to use, copy, modify, merge, publish,
	10	* distribute, sub license, and/or sell copies of the Software, and to
	11	* permit persons to whom the Software is furnished to do so, subject to
	12	* the following conditions:
	13	*
	14	* The above copyright notice and this permission notice (including the
	15	* next paragraph) shall be included in all copies or substantial portions
	16	* of the Software.
	17	*
	18	* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
	19	* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
	20	* FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
	21	* THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
	22	* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
	23	* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
	24	* USE OR OTHER DEALINGS IN THE SOFTWARE.
	25	*
	26	*
	27	**************************************************************************/
	28
	29	/*
	30	* Generic simple memory manager implementation. Intended to be used as a base
	31	* class implementation for more advanced memory managers.
	32	*
	33	* Note that the algorithm used is quite simple and there might be substantial
	34	* performance gains if a smarter free list is implemented. Currently it is just an
	35	* unordered stack of free regions. This could easily be improved if an RB-tree
	36	* is used instead. At least if we expect heavy fragmentation.
	37	*
	38	* Aligned allocations can also see improvement.
	39	*
	40	* Authors:
96de0e25	41	* Thomas Hellström <thomas-at-tungstengraphics-dot-com>
3a1bd924 TH	42	*/
	43
	44	#include "drmP.h"
249d6048	45	#include "drm_mm.h"
1d58420b	46	#include <linux/slab.h>
fa8a1238	47	#include <linux/seq_file.h>
1d58420b	48
249d6048 JG	49	#define MM_UNUSED_TARGET 4
249d6048 JG	50
249d6048 JG	51	static struct drm_mm_node drm_mm_kmalloc(struct drm_mm mm, int atomic)
	52	{
	53	struct drm_mm_node *child;
	54
	55	if (atomic)
	56	child = kmalloc(sizeof(*child), GFP_ATOMIC);
	57	else
	58	child = kmalloc(sizeof(*child), GFP_KERNEL);
	59
	60	if (unlikely(child == NULL)) {
	61	spin_lock(&mm->unused_lock);
	62	if (list_empty(&mm->unused_nodes))
	63	child = NULL;
	64	else {
	65	child =
	66	list_entry(mm->unused_nodes.next,
d1024ce9 DV	67	struct drm_mm_node, free_stack);
d1024ce9 DV	68	list_del(&child->free_stack);
249d6048 JG	69	--mm->num_unused;
	70	}
	71	spin_unlock(&mm->unused_lock);
	72	}
	73	return child;
	74	}
	75
a698cf34 JG	76	/* drm_mm_pre_get() - pre allocate drm_mm_node structure
	77	* drm_mm: memory manager struct we are pre-allocating for
	78	*
	79	* Returns 0 on success or -ENOMEM if allocation fails.
	80	*/
249d6048 JG	81	int drm_mm_pre_get(struct drm_mm *mm)
	82	{
	83	struct drm_mm_node *node;
	84
	85	spin_lock(&mm->unused_lock);
	86	while (mm->num_unused < MM_UNUSED_TARGET) {
	87	spin_unlock(&mm->unused_lock);
	88	node = kmalloc(sizeof(*node), GFP_KERNEL);
	89	spin_lock(&mm->unused_lock);
	90
	91	if (unlikely(node == NULL)) {
	92	int ret = (mm->num_unused < 2) ? -ENOMEM : 0;
	93	spin_unlock(&mm->unused_lock);
	94	return ret;
	95	}
	96	++mm->num_unused;
d1024ce9	97	list_add_tail(&node->free_stack, &mm->unused_nodes);
249d6048 JG	98	}
	99	spin_unlock(&mm->unused_lock);
	100	return 0;
	101	}
	102	EXPORT_SYMBOL(drm_mm_pre_get);
1d58420b	103
55910517	104	static int drm_mm_create_tail_node(struct drm_mm *mm,
249d6048 JG	105	unsigned long start,
249d6048 JG	106	unsigned long size, int atomic)
1d58420b	107	{
55910517	108	struct drm_mm_node *child;
1d58420b	109
249d6048 JG	110	child = drm_mm_kmalloc(mm, atomic);
249d6048 JG	111	if (unlikely(child == NULL))
1d58420b TH	112	return -ENOMEM;
	113
	114	child->free = 1;
	115	child->size = size;
	116	child->start = start;
	117	child->mm = mm;
	118
d1024ce9 DV	119	list_add_tail(&child->node_list, &mm->node_list);
d1024ce9 DV	120	list_add_tail(&child->free_stack, &mm->free_stack);
1d58420b TH	121
	122	return 0;
	123	}
	124
55910517	125	static struct drm_mm_node drm_mm_split_at_start(struct drm_mm_node parent,
249d6048 JG	126	unsigned long size,
249d6048 JG	127	int atomic)
1d58420b	128	{
55910517	129	struct drm_mm_node *child;
1d58420b	130
249d6048 JG	131	child = drm_mm_kmalloc(parent->mm, atomic);
249d6048 JG	132	if (unlikely(child == NULL))
1d58420b TH	133	return NULL;
1d58420b TH	134
d1024ce9	135	INIT_LIST_HEAD(&child->free_stack);
1d58420b TH	136
	137	child->free = 0;
	138	child->size = size;
	139	child->start = parent->start;
	140	child->mm = parent->mm;
	141
d1024ce9 DV	142	list_add_tail(&child->node_list, &parent->node_list);
d1024ce9 DV	143	INIT_LIST_HEAD(&child->free_stack);
1d58420b TH	144
	145	parent->size -= size;
	146	parent->start += size;
	147	return child;
	148	}
	149
	150
89579f77 TH	151	struct drm_mm_node drm_mm_get_block_generic(struct drm_mm_node node,
	152	unsigned long size,
	153	unsigned alignment,
	154	int atomic)
3a1bd924 TH	155	{
3a1bd924 TH	156
55910517	157	struct drm_mm_node *align_splitoff = NULL;
1d58420b	158	unsigned tmp = 0;
3a1bd924 TH	159
3a1bd924 TH	160	if (alignment)
e6c03c5b	161	tmp = node->start % alignment;
1d58420b TH	162
1d58420b TH	163	if (tmp) {
249d6048	164	align_splitoff =
89579f77	165	drm_mm_split_at_start(node, alignment - tmp, atomic);
249d6048	166	if (unlikely(align_splitoff == NULL))
1d58420b TH	167	return NULL;
1d58420b TH	168	}
3a1bd924	169
e6c03c5b	170	if (node->size == size) {
d1024ce9	171	list_del_init(&node->free_stack);
e6c03c5b	172	node->free = 0;
3a1bd924	173	} else {
89579f77	174	node = drm_mm_split_at_start(node, size, atomic);
1d58420b	175	}
3a1bd924	176
1d58420b TH	177	if (align_splitoff)
1d58420b TH	178	drm_mm_put_block(align_splitoff);
3a1bd924	179
e6c03c5b	180	return node;
3a1bd924	181	}
89579f77	182	EXPORT_SYMBOL(drm_mm_get_block_generic);
249d6048	183
a2e68e92 JG	184	struct drm_mm_node drm_mm_get_block_range_generic(struct drm_mm_node node,
	185	unsigned long size,
	186	unsigned alignment,
	187	unsigned long start,
	188	unsigned long end,
	189	int atomic)
	190	{
	191	struct drm_mm_node *align_splitoff = NULL;
	192	unsigned tmp = 0;
	193	unsigned wasted = 0;
	194
	195	if (node->start < start)
	196	wasted += start - node->start;
	197	if (alignment)
	198	tmp = ((node->start + wasted) % alignment);
	199
	200	if (tmp)
	201	wasted += alignment - tmp;
	202	if (wasted) {
	203	align_splitoff = drm_mm_split_at_start(node, wasted, atomic);
	204	if (unlikely(align_splitoff == NULL))
	205	return NULL;
	206	}
	207
	208	if (node->size == size) {
d1024ce9	209	list_del_init(&node->free_stack);
a2e68e92 JG	210	node->free = 0;
	211	} else {
	212	node = drm_mm_split_at_start(node, size, atomic);
	213	}
	214
	215	if (align_splitoff)
	216	drm_mm_put_block(align_splitoff);
	217
	218	return node;
	219	}
	220	EXPORT_SYMBOL(drm_mm_get_block_range_generic);
	221
3a1bd924 TH	222	/*
	223	* Put a block. Merge with the previous and / or next block if they are free.
	224	* Otherwise add to the free stack.
	225	*/
	226
249d6048	227	void drm_mm_put_block(struct drm_mm_node *cur)
3a1bd924 TH	228	{
3a1bd924 TH	229
55910517	230	struct drm_mm *mm = cur->mm;
d1024ce9 DV	231	struct list_head *cur_head = &cur->node_list;
d1024ce9 DV	232	struct list_head *root_head = &mm->node_list;
55910517 DA	233	struct drm_mm_node *prev_node = NULL;
55910517 DA	234	struct drm_mm_node *next_node;
3a1bd924	235
a1d0fcf5	236	int merged = 0;
3a1bd924 TH	237
3a1bd924 TH	238	if (cur_head->prev != root_head) {
249d6048	239	prev_node =
d1024ce9	240	list_entry(cur_head->prev, struct drm_mm_node, node_list);
3a1bd924 TH	241	if (prev_node->free) {
3a1bd924 TH	242	prev_node->size += cur->size;
a1d0fcf5	243	merged = 1;
3a1bd924 TH	244	}
	245	}
	246	if (cur_head->next != root_head) {
249d6048	247	next_node =
d1024ce9	248	list_entry(cur_head->next, struct drm_mm_node, node_list);
3a1bd924 TH	249	if (next_node->free) {
	250	if (merged) {
	251	prev_node->size += next_node->size;
d1024ce9 DV	252	list_del(&next_node->node_list);
d1024ce9 DV	253	list_del(&next_node->free_stack);
a698cf34	254	spin_lock(&mm->unused_lock);
249d6048	255	if (mm->num_unused < MM_UNUSED_TARGET) {
d1024ce9	256	list_add(&next_node->free_stack,
249d6048 JG	257	&mm->unused_nodes);
	258	++mm->num_unused;
	259	} else
	260	kfree(next_node);
a698cf34	261	spin_unlock(&mm->unused_lock);
3a1bd924 TH	262	} else {
	263	next_node->size += cur->size;
	264	next_node->start = cur->start;
a1d0fcf5	265	merged = 1;
3a1bd924 TH	266	}
	267	}
	268	}
	269	if (!merged) {
a1d0fcf5	270	cur->free = 1;
d1024ce9	271	list_add(&cur->free_stack, &mm->free_stack);
3a1bd924	272	} else {
d1024ce9	273	list_del(&cur->node_list);
a698cf34	274	spin_lock(&mm->unused_lock);
249d6048	275	if (mm->num_unused < MM_UNUSED_TARGET) {
d1024ce9	276	list_add(&cur->free_stack, &mm->unused_nodes);
249d6048 JG	277	++mm->num_unused;
	278	} else
	279	kfree(cur);
a698cf34	280	spin_unlock(&mm->unused_lock);
3a1bd924 TH	281	}
3a1bd924 TH	282	}
249d6048	283
673a394b	284	EXPORT_SYMBOL(drm_mm_put_block);
3a1bd924	285
249d6048 JG	286	struct drm_mm_node drm_mm_search_free(const struct drm_mm mm,
	287	unsigned long size,
	288	unsigned alignment, int best_match)
3a1bd924	289	{
55910517 DA	290	struct drm_mm_node *entry;
55910517 DA	291	struct drm_mm_node *best;
3a1bd924	292	unsigned long best_size;
1d58420b	293	unsigned wasted;
3a1bd924 TH	294
	295	best = NULL;
	296	best_size = ~0UL;
	297
d1024ce9	298	list_for_each_entry(entry, &mm->free_stack, free_stack) {
1d58420b TH	299	wasted = 0;
	300
	301	if (entry->size < size)
	302	continue;
	303
	304	if (alignment) {
	305	register unsigned tmp = entry->start % alignment;
	306	if (tmp)
	307	wasted += alignment - tmp;
	308	}
	309
1d58420b	310	if (entry->size >= size + wasted) {
3a1bd924 TH	311	if (!best_match)
3a1bd924 TH	312	return entry;
e2108eb1	313	if (entry->size < best_size) {
3a1bd924 TH	314	best = entry;
	315	best_size = entry->size;
	316	}
	317	}
	318	}
	319
	320	return best;
	321	}
249d6048	322	EXPORT_SYMBOL(drm_mm_search_free);
3a1bd924	323
a2e68e92 JG	324	struct drm_mm_node drm_mm_search_free_in_range(const struct drm_mm mm,
	325	unsigned long size,
	326	unsigned alignment,
	327	unsigned long start,
	328	unsigned long end,
	329	int best_match)
	330	{
a2e68e92 JG	331	struct drm_mm_node *entry;
	332	struct drm_mm_node *best;
	333	unsigned long best_size;
	334	unsigned wasted;
	335
	336	best = NULL;
	337	best_size = ~0UL;
	338
d1024ce9	339	list_for_each_entry(entry, &mm->free_stack, free_stack) {
a2e68e92 JG	340	wasted = 0;
	341
	342	if (entry->size < size)
	343	continue;
	344
	345	if (entry->start > end \|\| (entry->start+entry->size) < start)
	346	continue;
	347
	348	if (entry->start < start)
	349	wasted += start - entry->start;
	350
	351	if (alignment) {
	352	register unsigned tmp = (entry->start + wasted) % alignment;
	353	if (tmp)
	354	wasted += alignment - tmp;
	355	}
	356
775c6709 TH	357	if (entry->size >= size + wasted &&
775c6709 TH	358	(entry->start + wasted + size) <= end) {
a2e68e92 JG	359	if (!best_match)
a2e68e92 JG	360	return entry;
e2108eb1	361	if (entry->size < best_size) {
a2e68e92 JG	362	best = entry;
	363	best_size = entry->size;
	364	}
	365	}
	366	}
	367
	368	return best;
	369	}
	370	EXPORT_SYMBOL(drm_mm_search_free_in_range);
	371
55910517	372	int drm_mm_clean(struct drm_mm * mm)
3a1bd924	373	{
d1024ce9	374	struct list_head *head = &mm->node_list;
3a1bd924	375
1d58420b TH	376	return (head->next->next == head);
1d58420b TH	377	}
249d6048	378	EXPORT_SYMBOL(drm_mm_clean);
3a1bd924	379
55910517	380	int drm_mm_init(struct drm_mm * mm, unsigned long start, unsigned long size)
1d58420b	381	{
d1024ce9 DV	382	INIT_LIST_HEAD(&mm->node_list);
d1024ce9 DV	383	INIT_LIST_HEAD(&mm->free_stack);
249d6048 JG	384	INIT_LIST_HEAD(&mm->unused_nodes);
	385	mm->num_unused = 0;
	386	spin_lock_init(&mm->unused_lock);
3a1bd924	387
249d6048	388	return drm_mm_create_tail_node(mm, start, size, 0);
3a1bd924	389	}
673a394b	390	EXPORT_SYMBOL(drm_mm_init);
3a1bd924	391
55910517	392	void drm_mm_takedown(struct drm_mm * mm)
3a1bd924	393	{
d1024ce9	394	struct list_head *bnode = mm->free_stack.next;
55910517	395	struct drm_mm_node *entry;
249d6048	396	struct drm_mm_node *next;
3a1bd924	397
d1024ce9	398	entry = list_entry(bnode, struct drm_mm_node, free_stack);
3a1bd924	399
d1024ce9 DV	400	if (entry->node_list.next != &mm->node_list \|\|
d1024ce9 DV	401	entry->free_stack.next != &mm->free_stack) {
3a1bd924 TH	402	DRM_ERROR("Memory manager not clean. Delaying takedown\n");
	403	return;
	404	}
	405
d1024ce9 DV	406	list_del(&entry->free_stack);
d1024ce9 DV	407	list_del(&entry->node_list);
249d6048 JG	408	kfree(entry);
	409
	410	spin_lock(&mm->unused_lock);
d1024ce9 DV	411	list_for_each_entry_safe(entry, next, &mm->unused_nodes, free_stack) {
d1024ce9 DV	412	list_del(&entry->free_stack);
249d6048 JG	413	kfree(entry);
	414	--mm->num_unused;
	415	}
	416	spin_unlock(&mm->unused_lock);
3a1bd924	417
249d6048	418	BUG_ON(mm->num_unused != 0);
3a1bd924	419	}
f453ba04	420	EXPORT_SYMBOL(drm_mm_takedown);
fa8a1238	421
99d7e48e JG	422	void drm_mm_debug_table(struct drm_mm mm, const char prefix)
	423	{
	424	struct drm_mm_node *entry;
	425	int total_used = 0, total_free = 0, total = 0;
	426
d1024ce9	427	list_for_each_entry(entry, &mm->node_list, node_list) {
99d7e48e JG	428	printk(KERN_DEBUG "%s 0x%08lx-0x%08lx: %8ld: %s\n",
	429	prefix, entry->start, entry->start + entry->size,
	430	entry->size, entry->free ? "free" : "used");
	431	total += entry->size;
	432	if (entry->free)
	433	total_free += entry->size;
	434	else
	435	total_used += entry->size;
	436	}
	437	printk(KERN_DEBUG "%s total: %d, used %d free %d\n", prefix, total,
	438	total_used, total_free);
	439	}
	440	EXPORT_SYMBOL(drm_mm_debug_table);
	441
fa8a1238 DA	442	#if defined(CONFIG_DEBUG_FS)
	443	int drm_mm_dump_table(struct seq_file m, struct drm_mm mm)
	444	{
	445	struct drm_mm_node *entry;
	446	int total_used = 0, total_free = 0, total = 0;
	447
d1024ce9	448	list_for_each_entry(entry, &mm->node_list, node_list) {
fa8a1238 DA	449	seq_printf(m, "0x%08lx-0x%08lx: 0x%08lx: %s\n", entry->start, entry->start + entry->size, entry->size, entry->free ? "free" : "used");
	450	total += entry->size;
	451	if (entry->free)
	452	total_free += entry->size;
	453	else
	454	total_used += entry->size;
	455	}
01d01ba9	456	seq_printf(m, "total: %d, used %d free %d\n", total, total_used, total_free);
fa8a1238 DA	457	return 0;
	458	}
	459	EXPORT_SYMBOL(drm_mm_dump_table);
	460	#endif