[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

unsigned long drm_mm_tail_space(struct drm_mm *mm)
{
	struct list_head *tail_node;
	struct drm_mm_node *entry;

	tail_node = mm->ml_entry.prev;
	entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
	if (!entry->free)
		return 0;

	return entry->size;
}

int drm_mm_remove_space_from_tail(struct drm_mm *mm, unsigned long size)
{
	struct list_head *tail_node;
	struct drm_mm_node *entry;

	tail_node = mm->ml_entry.prev;
	entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
	if (!entry->free)
		return -ENOMEM;

	if (entry->size <= size)
		return -ENOMEM;

	entry->size -= size;
	return 0;
}

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, fl_entry);
			list_del(&child->fl_entry);
			--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->fl_entry, &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->ml_entry, &mm->ml_entry);
	list_add_tail(&child->fl_entry, &mm->fl_entry);

	return 0;
}

int drm_mm_add_space_to_tail(struct drm_mm *mm, unsigned long size, int atomic)
{
	struct list_head *tail_node;
	struct drm_mm_node *entry;

	tail_node = mm->ml_entry.prev;
	entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
	if (!entry->free) {
		return drm_mm_create_tail_node(mm, entry->start + entry->size,
					       size, atomic);
	}
	entry->size += size;
	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->fl_entry);

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

	list_add_tail(&child->ml_entry, &parent->ml_entry);
	INIT_LIST_HEAD(&child->fl_entry);

	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->fl_entry);
		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);

/*
 * 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->ml_entry;
	struct list_head *root_head = &mm->ml_entry;
	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, ml_entry);
		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, ml_entry);
		if (next_node->free) {
			if (merged) {
				prev_node->size += next_node->size;
				list_del(&next_node->ml_entry);
				list_del(&next_node->fl_entry);
				spin_lock(&mm->unused_lock);
				if (mm->num_unused < MM_UNUSED_TARGET) {
					list_add(&next_node->fl_entry,
						 &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->fl_entry, &mm->fl_entry);
	} else {
		list_del(&cur->ml_entry);
		spin_lock(&mm->unused_lock);
		if (mm->num_unused < MM_UNUSED_TARGET) {
			list_add(&cur->fl_entry, &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 list_head *list;
	const struct list_head *free_stack = &mm->fl_entry;
	struct drm_mm_node *entry;
	struct drm_mm_node *best;
	unsigned long best_size;
	unsigned wasted;

	best = NULL;
	best_size = ~0UL;

	list_for_each(list, free_stack) {
		entry = list_entry(list, struct drm_mm_node, fl_entry);
		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 (size < best_size) {
				best = entry;
				best_size = entry->size;
			}
		}
	}

	return best;
}
EXPORT_SYMBOL(drm_mm_search_free);

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

	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->ml_entry);
	INIT_LIST_HEAD(&mm->fl_entry);
	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->fl_entry.next;
	struct drm_mm_node *entry;
	struct drm_mm_node *next;

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

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

	list_del(&entry->fl_entry);
	list_del(&entry->ml_entry);
	kfree(entry);

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

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

#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->ml_entry, ml_entry) {
		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
55910517	51	unsigned long drm_mm_tail_space(struct drm_mm *mm)
1d58420b TH	52	{
1d58420b TH	53	struct list_head *tail_node;
55910517	54	struct drm_mm_node *entry;
1d58420b TH	55
1d58420b TH	56	tail_node = mm->ml_entry.prev;
55910517	57	entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
1d58420b TH	58	if (!entry->free)
	59	return 0;
	60
	61	return entry->size;
	62	}
	63
55910517	64	int drm_mm_remove_space_from_tail(struct drm_mm *mm, unsigned long size)
1d58420b TH	65	{
1d58420b TH	66	struct list_head *tail_node;
55910517	67	struct drm_mm_node *entry;
1d58420b TH	68
1d58420b TH	69	tail_node = mm->ml_entry.prev;
55910517	70	entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
1d58420b TH	71	if (!entry->free)
	72	return -ENOMEM;
	73
	74	if (entry->size <= size)
	75	return -ENOMEM;
	76
	77	entry->size -= size;
	78	return 0;
	79	}
	80
249d6048 JG	81	static struct drm_mm_node drm_mm_kmalloc(struct drm_mm mm, int atomic)
	82	{
	83	struct drm_mm_node *child;
	84
	85	if (atomic)
	86	child = kmalloc(sizeof(*child), GFP_ATOMIC);
	87	else
	88	child = kmalloc(sizeof(*child), GFP_KERNEL);
	89
	90	if (unlikely(child == NULL)) {
	91	spin_lock(&mm->unused_lock);
	92	if (list_empty(&mm->unused_nodes))
	93	child = NULL;
	94	else {
	95	child =
	96	list_entry(mm->unused_nodes.next,
	97	struct drm_mm_node, fl_entry);
	98	list_del(&child->fl_entry);
	99	--mm->num_unused;
	100	}
	101	spin_unlock(&mm->unused_lock);
	102	}
	103	return child;
	104	}
	105
a698cf34 JG	106	/* drm_mm_pre_get() - pre allocate drm_mm_node structure
	107	* drm_mm: memory manager struct we are pre-allocating for
	108	*
	109	* Returns 0 on success or -ENOMEM if allocation fails.
	110	*/
249d6048 JG	111	int drm_mm_pre_get(struct drm_mm *mm)
	112	{
	113	struct drm_mm_node *node;
	114
	115	spin_lock(&mm->unused_lock);
	116	while (mm->num_unused < MM_UNUSED_TARGET) {
	117	spin_unlock(&mm->unused_lock);
	118	node = kmalloc(sizeof(*node), GFP_KERNEL);
	119	spin_lock(&mm->unused_lock);
	120
	121	if (unlikely(node == NULL)) {
	122	int ret = (mm->num_unused < 2) ? -ENOMEM : 0;
	123	spin_unlock(&mm->unused_lock);
	124	return ret;
	125	}
	126	++mm->num_unused;
	127	list_add_tail(&node->fl_entry, &mm->unused_nodes);
	128	}
	129	spin_unlock(&mm->unused_lock);
	130	return 0;
	131	}
	132	EXPORT_SYMBOL(drm_mm_pre_get);
1d58420b	133
55910517	134	static int drm_mm_create_tail_node(struct drm_mm *mm,
249d6048 JG	135	unsigned long start,
249d6048 JG	136	unsigned long size, int atomic)
1d58420b	137	{
55910517	138	struct drm_mm_node *child;
1d58420b	139
249d6048 JG	140	child = drm_mm_kmalloc(mm, atomic);
249d6048 JG	141	if (unlikely(child == NULL))
1d58420b TH	142	return -ENOMEM;
	143
	144	child->free = 1;
	145	child->size = size;
	146	child->start = start;
	147	child->mm = mm;
	148
	149	list_add_tail(&child->ml_entry, &mm->ml_entry);
	150	list_add_tail(&child->fl_entry, &mm->fl_entry);
	151
	152	return 0;
	153	}
	154
249d6048	155	int drm_mm_add_space_to_tail(struct drm_mm *mm, unsigned long size, int atomic)
1d58420b TH	156	{
1d58420b TH	157	struct list_head *tail_node;
55910517	158	struct drm_mm_node *entry;
1d58420b TH	159
1d58420b TH	160	tail_node = mm->ml_entry.prev;
55910517	161	entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
1d58420b	162	if (!entry->free) {
249d6048 JG	163	return drm_mm_create_tail_node(mm, entry->start + entry->size,
249d6048 JG	164	size, atomic);
1d58420b TH	165	}
	166	entry->size += size;
	167	return 0;
	168	}
	169
55910517	170	static struct drm_mm_node drm_mm_split_at_start(struct drm_mm_node parent,
249d6048 JG	171	unsigned long size,
249d6048 JG	172	int atomic)
1d58420b	173	{
55910517	174	struct drm_mm_node *child;
1d58420b	175
249d6048 JG	176	child = drm_mm_kmalloc(parent->mm, atomic);
249d6048 JG	177	if (unlikely(child == NULL))
1d58420b TH	178	return NULL;
	179
	180	INIT_LIST_HEAD(&child->fl_entry);
	181
	182	child->free = 0;
	183	child->size = size;
	184	child->start = parent->start;
	185	child->mm = parent->mm;
	186
	187	list_add_tail(&child->ml_entry, &parent->ml_entry);
	188	INIT_LIST_HEAD(&child->fl_entry);
	189
	190	parent->size -= size;
	191	parent->start += size;
	192	return child;
	193	}
	194
	195
89579f77 TH	196	struct drm_mm_node drm_mm_get_block_generic(struct drm_mm_node node,
	197	unsigned long size,
	198	unsigned alignment,
	199	int atomic)
3a1bd924 TH	200	{
3a1bd924 TH	201
55910517	202	struct drm_mm_node *align_splitoff = NULL;
1d58420b	203	unsigned tmp = 0;
3a1bd924 TH	204
3a1bd924 TH	205	if (alignment)
e6c03c5b	206	tmp = node->start % alignment;
1d58420b TH	207
1d58420b TH	208	if (tmp) {
249d6048	209	align_splitoff =
89579f77	210	drm_mm_split_at_start(node, alignment - tmp, atomic);
249d6048	211	if (unlikely(align_splitoff == NULL))
1d58420b TH	212	return NULL;
1d58420b TH	213	}
3a1bd924	214
e6c03c5b CW	215	if (node->size == size) {
	216	list_del_init(&node->fl_entry);
	217	node->free = 0;
3a1bd924	218	} else {
89579f77	219	node = drm_mm_split_at_start(node, size, atomic);
1d58420b	220	}
3a1bd924	221
1d58420b TH	222	if (align_splitoff)
1d58420b TH	223	drm_mm_put_block(align_splitoff);
3a1bd924	224
e6c03c5b	225	return node;
3a1bd924	226	}
89579f77	227	EXPORT_SYMBOL(drm_mm_get_block_generic);
249d6048	228
3a1bd924 TH	229	/*
	230	* Put a block. Merge with the previous and / or next block if they are free.
	231	* Otherwise add to the free stack.
	232	*/
	233
249d6048	234	void drm_mm_put_block(struct drm_mm_node *cur)
3a1bd924 TH	235	{
3a1bd924 TH	236
55910517	237	struct drm_mm *mm = cur->mm;
3a1bd924	238	struct list_head *cur_head = &cur->ml_entry;
1d58420b	239	struct list_head *root_head = &mm->ml_entry;
55910517 DA	240	struct drm_mm_node *prev_node = NULL;
55910517 DA	241	struct drm_mm_node *next_node;
3a1bd924	242
a1d0fcf5	243	int merged = 0;
3a1bd924 TH	244
3a1bd924 TH	245	if (cur_head->prev != root_head) {
249d6048 JG	246	prev_node =
249d6048 JG	247	list_entry(cur_head->prev, struct drm_mm_node, ml_entry);
3a1bd924 TH	248	if (prev_node->free) {
3a1bd924 TH	249	prev_node->size += cur->size;
a1d0fcf5	250	merged = 1;
3a1bd924 TH	251	}
	252	}
	253	if (cur_head->next != root_head) {
249d6048 JG	254	next_node =
249d6048 JG	255	list_entry(cur_head->next, struct drm_mm_node, ml_entry);
3a1bd924 TH	256	if (next_node->free) {
	257	if (merged) {
	258	prev_node->size += next_node->size;
	259	list_del(&next_node->ml_entry);
	260	list_del(&next_node->fl_entry);
a698cf34	261	spin_lock(&mm->unused_lock);
249d6048 JG	262	if (mm->num_unused < MM_UNUSED_TARGET) {
	263	list_add(&next_node->fl_entry,
	264	&mm->unused_nodes);
	265	++mm->num_unused;
	266	} else
	267	kfree(next_node);
a698cf34	268	spin_unlock(&mm->unused_lock);
3a1bd924 TH	269	} else {
	270	next_node->size += cur->size;
	271	next_node->start = cur->start;
a1d0fcf5	272	merged = 1;
3a1bd924 TH	273	}
	274	}
	275	}
	276	if (!merged) {
a1d0fcf5	277	cur->free = 1;
1d58420b	278	list_add(&cur->fl_entry, &mm->fl_entry);
3a1bd924 TH	279	} else {
3a1bd924 TH	280	list_del(&cur->ml_entry);
a698cf34	281	spin_lock(&mm->unused_lock);
249d6048 JG	282	if (mm->num_unused < MM_UNUSED_TARGET) {
	283	list_add(&cur->fl_entry, &mm->unused_nodes);
	284	++mm->num_unused;
	285	} else
	286	kfree(cur);
a698cf34	287	spin_unlock(&mm->unused_lock);
3a1bd924 TH	288	}
3a1bd924 TH	289	}
249d6048	290
673a394b	291	EXPORT_SYMBOL(drm_mm_put_block);
3a1bd924	292
249d6048 JG	293	struct drm_mm_node drm_mm_search_free(const struct drm_mm mm,
	294	unsigned long size,
	295	unsigned alignment, int best_match)
3a1bd924 TH	296	{
3a1bd924 TH	297	struct list_head *list;
1d58420b	298	const struct list_head *free_stack = &mm->fl_entry;
55910517 DA	299	struct drm_mm_node *entry;
55910517 DA	300	struct drm_mm_node *best;
3a1bd924	301	unsigned long best_size;
1d58420b	302	unsigned wasted;
3a1bd924 TH	303
	304	best = NULL;
	305	best_size = ~0UL;
	306
3a1bd924	307	list_for_each(list, free_stack) {
55910517	308	entry = list_entry(list, struct drm_mm_node, fl_entry);
1d58420b TH	309	wasted = 0;
	310
	311	if (entry->size < size)
	312	continue;
	313
	314	if (alignment) {
	315	register unsigned tmp = entry->start % alignment;
	316	if (tmp)
	317	wasted += alignment - tmp;
	318	}
	319
1d58420b	320	if (entry->size >= size + wasted) {
3a1bd924 TH	321	if (!best_match)
	322	return entry;
	323	if (size < best_size) {
	324	best = entry;
	325	best_size = entry->size;
	326	}
	327	}
	328	}
	329
	330	return best;
	331	}
249d6048	332	EXPORT_SYMBOL(drm_mm_search_free);
3a1bd924	333
55910517	334	int drm_mm_clean(struct drm_mm * mm)
3a1bd924	335	{
1d58420b	336	struct list_head *head = &mm->ml_entry;
3a1bd924	337
1d58420b TH	338	return (head->next->next == head);
1d58420b TH	339	}
249d6048	340	EXPORT_SYMBOL(drm_mm_clean);
3a1bd924	341
55910517	342	int drm_mm_init(struct drm_mm * mm, unsigned long start, unsigned long size)
1d58420b TH	343	{
	344	INIT_LIST_HEAD(&mm->ml_entry);
	345	INIT_LIST_HEAD(&mm->fl_entry);
249d6048 JG	346	INIT_LIST_HEAD(&mm->unused_nodes);
	347	mm->num_unused = 0;
	348	spin_lock_init(&mm->unused_lock);
3a1bd924	349
249d6048	350	return drm_mm_create_tail_node(mm, start, size, 0);
3a1bd924	351	}
673a394b	352	EXPORT_SYMBOL(drm_mm_init);
3a1bd924	353
55910517	354	void drm_mm_takedown(struct drm_mm * mm)
3a1bd924	355	{
1d58420b	356	struct list_head *bnode = mm->fl_entry.next;
55910517	357	struct drm_mm_node *entry;
249d6048	358	struct drm_mm_node *next;
3a1bd924	359
55910517	360	entry = list_entry(bnode, struct drm_mm_node, fl_entry);
3a1bd924	361
1d58420b TH	362	if (entry->ml_entry.next != &mm->ml_entry \|\|
1d58420b TH	363	entry->fl_entry.next != &mm->fl_entry) {
3a1bd924 TH	364	DRM_ERROR("Memory manager not clean. Delaying takedown\n");
	365	return;
	366	}
	367
	368	list_del(&entry->fl_entry);
	369	list_del(&entry->ml_entry);
249d6048 JG	370	kfree(entry);
	371
	372	spin_lock(&mm->unused_lock);
	373	list_for_each_entry_safe(entry, next, &mm->unused_nodes, fl_entry) {
	374	list_del(&entry->fl_entry);
	375	kfree(entry);
	376	--mm->num_unused;
	377	}
	378	spin_unlock(&mm->unused_lock);
3a1bd924	379
249d6048	380	BUG_ON(mm->num_unused != 0);
3a1bd924	381	}
f453ba04	382	EXPORT_SYMBOL(drm_mm_takedown);
fa8a1238 DA	383
	384	#if defined(CONFIG_DEBUG_FS)
	385	int drm_mm_dump_table(struct seq_file m, struct drm_mm mm)
	386	{
	387	struct drm_mm_node *entry;
	388	int total_used = 0, total_free = 0, total = 0;
	389
	390	list_for_each_entry(entry, &mm->ml_entry, ml_entry) {
	391	seq_printf(m, "0x%08lx-0x%08lx: 0x%08lx: %s\n", entry->start, entry->start + entry->size, entry->size, entry->free ? "free" : "used");
	392	total += entry->size;
	393	if (entry->free)
	394	total_free += entry->size;
	395	else
	396	total_used += entry->size;
	397	}
01d01ba9	398	seq_printf(m, "total: %d, used %d free %d\n", total, total_used, total_free);
fa8a1238 DA	399	return 0;
	400	}
	401	EXPORT_SYMBOL(drm_mm_dump_table);
	402	#endif