[deliverable/linux.git] / include / drm / drm_mm.h

/**************************************************************************
 *
 * Copyright 2006-2008 Tungsten Graphics, Inc., Cedar Park, TX. 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.
 *
 *
 **************************************************************************/
/*
 * Authors:
 * Thomas Hellstrom <thomas-at-tungstengraphics-dot-com>
 */

#ifndef _DRM_MM_H_
#define _DRM_MM_H_

/*
 * Generic range manager structs
 */
#include <linux/list.h>
#ifdef CONFIG_DEBUG_FS
#include <linux/seq_file.h>
#endif

struct drm_mm_node {
	struct list_head node_list;
	struct list_head hole_stack;
	unsigned hole_follows : 1;
	unsigned scanned_block : 1;
	unsigned scanned_prev_free : 1;
	unsigned scanned_next_free : 1;
	unsigned scanned_preceeds_hole : 1;
	unsigned allocated : 1;
	unsigned long color;
	unsigned long start;
	unsigned long size;
	struct drm_mm *mm;
};

struct drm_mm {
	/* List of all memory nodes that immediately precede a free hole. */
	struct list_head hole_stack;
	/* head_node.node_list is the list of all memory nodes, ordered
	 * according to the (increasing) start address of the memory node. */
	struct drm_mm_node head_node;
	struct list_head unused_nodes;
	int num_unused;
	spinlock_t unused_lock;
	unsigned int scan_check_range : 1;
	unsigned scan_alignment;
	unsigned long scan_color;
	unsigned long scan_size;
	unsigned long scan_hit_start;
	unsigned long scan_hit_end;
	unsigned scanned_blocks;
	unsigned long scan_start;
	unsigned long scan_end;
	struct drm_mm_node *prev_scanned_node;

	void (*color_adjust)(struct drm_mm_node *node, unsigned long color,
			     unsigned long *start, unsigned long *end);
};

static inline bool drm_mm_node_allocated(struct drm_mm_node *node)
{
	return node->allocated;
}

static inline bool drm_mm_initialized(struct drm_mm *mm)
{
	return mm->hole_stack.next;
}

static inline unsigned long __drm_mm_hole_node_start(struct drm_mm_node *hole_node)
{
	return hole_node->start + hole_node->size;
}

static inline unsigned long drm_mm_hole_node_start(struct drm_mm_node *hole_node)
{
	BUG_ON(!hole_node->hole_follows);
	return __drm_mm_hole_node_start(hole_node);
}

static inline unsigned long __drm_mm_hole_node_end(struct drm_mm_node *hole_node)
{
	return list_entry(hole_node->node_list.next,
			  struct drm_mm_node, node_list)->start;
}

static inline unsigned long drm_mm_hole_node_end(struct drm_mm_node *hole_node)
{
	return __drm_mm_hole_node_end(hole_node);
}

#define drm_mm_for_each_node(entry, mm) list_for_each_entry(entry, \
						&(mm)->head_node.node_list, \
						node_list)
#define drm_mm_for_each_scanned_node_reverse(entry, n, mm) \
	for (entry = (mm)->prev_scanned_node, \
		next = entry ? list_entry(entry->node_list.next, \
			struct drm_mm_node, node_list) : NULL; \
	     entry != NULL; entry = next, \
		next = entry ? list_entry(entry->node_list.next, \
			struct drm_mm_node, node_list) : NULL) \

/* Note that we need to unroll list_for_each_entry in order to inline
 * setting hole_start and hole_end on each iteration and keep the
 * macro sane.
 */
#define drm_mm_for_each_hole(entry, mm, hole_start, hole_end) \
	for (entry = list_entry((mm)->hole_stack.next, struct drm_mm_node, hole_stack); \
	     &entry->hole_stack != &(mm)->hole_stack ? \
	     hole_start = drm_mm_hole_node_start(entry), \
	     hole_end = drm_mm_hole_node_end(entry), \
	     1 : 0; \
	     entry = list_entry(entry->hole_stack.next, struct drm_mm_node, hole_stack))

/*
 * Basic range manager support (drm_mm.c)
 */
extern struct drm_mm_node *drm_mm_create_block(struct drm_mm *mm,
					       unsigned long start,
					       unsigned long size,
					       bool atomic);
extern struct drm_mm_node *drm_mm_get_block_generic(struct drm_mm_node *node,
						    unsigned long size,
						    unsigned alignment,
						    unsigned long color,
						    int atomic);
extern struct drm_mm_node *drm_mm_get_block_range_generic(
						struct drm_mm_node *node,
						unsigned long size,
						unsigned alignment,
						unsigned long color,
						unsigned long start,
						unsigned long end,
						int atomic);
static inline struct drm_mm_node *drm_mm_get_block(struct drm_mm_node *parent,
						   unsigned long size,
						   unsigned alignment)
{
	return drm_mm_get_block_generic(parent, size, alignment, 0, 0);
}
static inline struct drm_mm_node *drm_mm_get_block_atomic(struct drm_mm_node *parent,
							  unsigned long size,
							  unsigned alignment)
{
	return drm_mm_get_block_generic(parent, size, alignment, 0, 1);
}
static inline struct drm_mm_node *drm_mm_get_block_range(
						struct drm_mm_node *parent,
						unsigned long size,
						unsigned alignment,
						unsigned long start,
						unsigned long end)
{
	return drm_mm_get_block_range_generic(parent, size, alignment, 0,
					      start, end, 0);
}
static inline struct drm_mm_node *drm_mm_get_color_block_range(
						struct drm_mm_node *parent,
						unsigned long size,
						unsigned alignment,
						unsigned long color,
						unsigned long start,
						unsigned long end)
{
	return drm_mm_get_block_range_generic(parent, size, alignment, color,
					      start, end, 0);
}
static inline struct drm_mm_node *drm_mm_get_block_atomic_range(
						struct drm_mm_node *parent,
						unsigned long size,
						unsigned alignment,
						unsigned long start,
						unsigned long end)
{
	return drm_mm_get_block_range_generic(parent, size, alignment, 0,
						start, end, 1);
}

extern int drm_mm_insert_node(struct drm_mm *mm,
			      struct drm_mm_node *node,
			      unsigned long size,
			      unsigned alignment);
extern int drm_mm_insert_node_in_range(struct drm_mm *mm,
				       struct drm_mm_node *node,
				       unsigned long size,
				       unsigned alignment,
				       unsigned long start,
				       unsigned long end);
extern int drm_mm_insert_node_generic(struct drm_mm *mm,
				      struct drm_mm_node *node,
				      unsigned long size,
				      unsigned alignment,
				      unsigned long color);
extern int drm_mm_insert_node_in_range_generic(struct drm_mm *mm,
				       struct drm_mm_node *node,
				       unsigned long size,
				       unsigned alignment,
				       unsigned long color,
				       unsigned long start,
				       unsigned long end);
extern void drm_mm_put_block(struct drm_mm_node *cur);
extern void drm_mm_remove_node(struct drm_mm_node *node);
extern void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new);
extern struct drm_mm_node *drm_mm_search_free_generic(const struct drm_mm *mm,
						      unsigned long size,
						      unsigned alignment,
						      unsigned long color,
						      bool best_match);
extern struct drm_mm_node *drm_mm_search_free_in_range_generic(
						const struct drm_mm *mm,
						unsigned long size,
						unsigned alignment,
						unsigned long color,
						unsigned long start,
						unsigned long end,
						bool best_match);
static inline struct drm_mm_node *drm_mm_search_free(const struct drm_mm *mm,
						     unsigned long size,
						     unsigned alignment,
						     bool best_match)
{
	return drm_mm_search_free_generic(mm,size, alignment, 0, best_match);
}
static inline  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,
						bool best_match)
{
	return drm_mm_search_free_in_range_generic(mm, size, alignment, 0,
						   start, end, best_match);
}
static inline struct drm_mm_node *drm_mm_search_free_color(const struct drm_mm *mm,
							   unsigned long size,
							   unsigned alignment,
							   unsigned long color,
							   bool best_match)
{
	return drm_mm_search_free_generic(mm,size, alignment, color, best_match);
}
static inline  struct drm_mm_node *drm_mm_search_free_in_range_color(
						const struct drm_mm *mm,
						unsigned long size,
						unsigned alignment,
						unsigned long color,
						unsigned long start,
						unsigned long end,
						bool best_match)
{
	return drm_mm_search_free_in_range_generic(mm, size, alignment, color,
						   start, end, best_match);
}
extern int drm_mm_init(struct drm_mm *mm,
		       unsigned long start,
		       unsigned long size);
extern void drm_mm_takedown(struct drm_mm *mm);
extern int drm_mm_clean(struct drm_mm *mm);
extern int drm_mm_pre_get(struct drm_mm *mm);

static inline struct drm_mm *drm_get_mm(struct drm_mm_node *block)
{
	return block->mm;
}

void drm_mm_init_scan(struct drm_mm *mm,
		      unsigned long size,
		      unsigned alignment,
		      unsigned long color);
void drm_mm_init_scan_with_range(struct drm_mm *mm,
				 unsigned long size,
				 unsigned alignment,
				 unsigned long color,
				 unsigned long start,
				 unsigned long end);
int drm_mm_scan_add_block(struct drm_mm_node *node);
int drm_mm_scan_remove_block(struct drm_mm_node *node);

extern void drm_mm_debug_table(struct drm_mm *mm, const char *prefix);
#ifdef CONFIG_DEBUG_FS
int drm_mm_dump_table(struct seq_file *m, struct drm_mm *mm);
#endif

#endif
Commit	Line	Data
249d6048 JG	1	/**************************************************************************
	2	*
	3	* Copyright 2006-2008 Tungsten Graphics, Inc., Cedar Park, TX. 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	* Authors:
	30	* Thomas Hellstrom <thomas-at-tungstengraphics-dot-com>
	31	*/
	32
	33	#ifndef _DRM_MM_H_
	34	#define _DRM_MM_H_
	35
	36	/*
	37	* Generic range manager structs
	38	*/
	39	#include <linux/list.h>
f1938cd6 DA	40	#ifdef CONFIG_DEBUG_FS
	41	#include <linux/seq_file.h>
	42	#endif
249d6048 JG	43
249d6048 JG	44	struct drm_mm_node {
d1024ce9	45	struct list_head node_list;
ea7b1dd4 DV	46	struct list_head hole_stack;
ea7b1dd4 DV	47	unsigned hole_follows : 1;
709ea971 DV	48	unsigned scanned_block : 1;
	49	unsigned scanned_prev_free : 1;
	50	unsigned scanned_next_free : 1;
ea7b1dd4	51	unsigned scanned_preceeds_hole : 1;
b0b7af18	52	unsigned allocated : 1;
6b9d89b4	53	unsigned long color;
249d6048 JG	54	unsigned long start;
	55	unsigned long size;
	56	struct drm_mm *mm;
249d6048 JG	57	};
	58
	59	struct drm_mm {
25985edc	60	/* List of all memory nodes that immediately precede a free hole. */
ea7b1dd4 DV	61	struct list_head hole_stack;
	62	/* head_node.node_list is the list of all memory nodes, ordered
	63	* according to the (increasing) start address of the memory node. */
	64	struct drm_mm_node head_node;
249d6048 JG	65	struct list_head unused_nodes;
	66	int num_unused;
	67	spinlock_t unused_lock;
d935cc61	68	unsigned int scan_check_range : 1;
709ea971	69	unsigned scan_alignment;
6b9d89b4	70	unsigned long scan_color;
709ea971 DV	71	unsigned long scan_size;
709ea971 DV	72	unsigned long scan_hit_start;
901593f2	73	unsigned long scan_hit_end;
709ea971	74	unsigned scanned_blocks;
d935cc61 DV	75	unsigned long scan_start;
d935cc61 DV	76	unsigned long scan_end;
ae0cec28	77	struct drm_mm_node *prev_scanned_node;
6b9d89b4 CW	78
	79	void (color_adjust)(struct drm_mm_node node, unsigned long color,
	80	unsigned long start, unsigned long end);
249d6048 JG	81	};
249d6048 JG	82
b0b7af18 DV	83	static inline bool drm_mm_node_allocated(struct drm_mm_node *node)
	84	{
	85	return node->allocated;
	86	}
	87
31a5b8ce DV	88	static inline bool drm_mm_initialized(struct drm_mm *mm)
31a5b8ce DV	89	{
ea7b1dd4	90	return mm->hole_stack.next;
31a5b8ce	91	}
9e8944ab CW	92
	93	static inline unsigned long __drm_mm_hole_node_start(struct drm_mm_node *hole_node)
	94	{
	95	return hole_node->start + hole_node->size;
	96	}
	97
	98	static inline unsigned long drm_mm_hole_node_start(struct drm_mm_node *hole_node)
	99	{
	100	BUG_ON(!hole_node->hole_follows);
	101	return __drm_mm_hole_node_start(hole_node);
	102	}
	103
	104	static inline unsigned long __drm_mm_hole_node_end(struct drm_mm_node *hole_node)
	105	{
	106	return list_entry(hole_node->node_list.next,
	107	struct drm_mm_node, node_list)->start;
	108	}
	109
	110	static inline unsigned long drm_mm_hole_node_end(struct drm_mm_node *hole_node)
	111	{
	112	return __drm_mm_hole_node_end(hole_node);
	113	}
	114
ea7b1dd4 DV	115	#define drm_mm_for_each_node(entry, mm) list_for_each_entry(entry, \
ea7b1dd4 DV	116	&(mm)->head_node.node_list, \
2bbd4492	117	node_list)
ae0cec28 DV	118	#define drm_mm_for_each_scanned_node_reverse(entry, n, mm) \
	119	for (entry = (mm)->prev_scanned_node, \
	120	next = entry ? list_entry(entry->node_list.next, \
	121	struct drm_mm_node, node_list) : NULL; \
	122	entry != NULL; entry = next, \
	123	next = entry ? list_entry(entry->node_list.next, \
	124	struct drm_mm_node, node_list) : NULL) \
9e8944ab CW	125
	126	/* Note that we need to unroll list_for_each_entry in order to inline
	127	* setting hole_start and hole_end on each iteration and keep the
	128	* macro sane.
	129	*/
	130	#define drm_mm_for_each_hole(entry, mm, hole_start, hole_end) \
	131	for (entry = list_entry((mm)->hole_stack.next, struct drm_mm_node, hole_stack); \
	132	&entry->hole_stack != &(mm)->hole_stack ? \
	133	hole_start = drm_mm_hole_node_start(entry), \
	134	hole_end = drm_mm_hole_node_end(entry), \
	135	1 : 0; \
	136	entry = list_entry(entry->hole_stack.next, struct drm_mm_node, hole_stack))
	137
249d6048 JG	138	/*
	139	* Basic range manager support (drm_mm.c)
	140	*/
5973c7ee CW	141	extern struct drm_mm_node drm_mm_create_block(struct drm_mm mm,
	142	unsigned long start,
	143	unsigned long size,
	144	bool atomic);
89579f77 TH	145	extern struct drm_mm_node drm_mm_get_block_generic(struct drm_mm_node node,
	146	unsigned long size,
	147	unsigned alignment,
6b9d89b4	148	unsigned long color,
89579f77	149	int atomic);
a2e68e92 JG	150	extern struct drm_mm_node *drm_mm_get_block_range_generic(
	151	struct drm_mm_node *node,
	152	unsigned long size,
	153	unsigned alignment,
6b9d89b4	154	unsigned long color,
a2e68e92 JG	155	unsigned long start,
	156	unsigned long end,
	157	int atomic);
89579f77	158	static inline struct drm_mm_node drm_mm_get_block(struct drm_mm_node parent,
249d6048	159	unsigned long size,
89579f77 TH	160	unsigned alignment)
89579f77 TH	161	{
6b9d89b4	162	return drm_mm_get_block_generic(parent, size, alignment, 0, 0);
89579f77 TH	163	}
	164	static inline struct drm_mm_node drm_mm_get_block_atomic(struct drm_mm_node parent,
	165	unsigned long size,
	166	unsigned alignment)
	167	{
6b9d89b4	168	return drm_mm_get_block_generic(parent, size, alignment, 0, 1);
89579f77	169	}
a2e68e92 JG	170	static inline struct drm_mm_node *drm_mm_get_block_range(
	171	struct drm_mm_node *parent,
	172	unsigned long size,
	173	unsigned alignment,
	174	unsigned long start,
	175	unsigned long end)
	176	{
6b9d89b4 CW	177	return drm_mm_get_block_range_generic(parent, size, alignment, 0,
	178	start, end, 0);
	179	}
	180	static inline struct drm_mm_node *drm_mm_get_color_block_range(
	181	struct drm_mm_node *parent,
	182	unsigned long size,
	183	unsigned alignment,
	184	unsigned long color,
	185	unsigned long start,
	186	unsigned long end)
	187	{
	188	return drm_mm_get_block_range_generic(parent, size, alignment, color,
	189	start, end, 0);
a2e68e92 JG	190	}
	191	static inline struct drm_mm_node *drm_mm_get_block_atomic_range(
	192	struct drm_mm_node *parent,
	193	unsigned long size,
	194	unsigned alignment,
	195	unsigned long start,
	196	unsigned long end)
	197	{
6b9d89b4	198	return drm_mm_get_block_range_generic(parent, size, alignment, 0,
a2e68e92 JG	199	start, end, 1);
a2e68e92 JG	200	}
b8103450 CW	201
	202	extern int drm_mm_insert_node(struct drm_mm *mm,
	203	struct drm_mm_node *node,
	204	unsigned long size,
	205	unsigned alignment);
b0b7af18 DV	206	extern int drm_mm_insert_node_in_range(struct drm_mm *mm,
b0b7af18 DV	207	struct drm_mm_node *node,
b8103450 CW	208	unsigned long size,
	209	unsigned alignment,
	210	unsigned long start,
	211	unsigned long end);
	212	extern int drm_mm_insert_node_generic(struct drm_mm *mm,
	213	struct drm_mm_node *node,
	214	unsigned long size,
	215	unsigned alignment,
	216	unsigned long color);
	217	extern int drm_mm_insert_node_in_range_generic(struct drm_mm *mm,
	218	struct drm_mm_node *node,
	219	unsigned long size,
	220	unsigned alignment,
	221	unsigned long color,
	222	unsigned long start,
	223	unsigned long end);
249d6048	224	extern void drm_mm_put_block(struct drm_mm_node *cur);
b0b7af18 DV	225	extern void drm_mm_remove_node(struct drm_mm_node *node);
b0b7af18 DV	226	extern void drm_mm_replace_node(struct drm_mm_node old, struct drm_mm_node new);
6b9d89b4 CW	227	extern struct drm_mm_node drm_mm_search_free_generic(const struct drm_mm mm,
	228	unsigned long size,
	229	unsigned alignment,
	230	unsigned long color,
	231	bool best_match);
	232	extern struct drm_mm_node *drm_mm_search_free_in_range_generic(
	233	const struct drm_mm *mm,
	234	unsigned long size,
	235	unsigned alignment,
	236	unsigned long color,
	237	unsigned long start,
	238	unsigned long end,
	239	bool best_match);
	240	static inline struct drm_mm_node drm_mm_search_free(const struct drm_mm mm,
	241	unsigned long size,
	242	unsigned alignment,
	243	bool best_match)
	244	{
	245	return drm_mm_search_free_generic(mm,size, alignment, 0, best_match);
	246	}
	247	static inline struct drm_mm_node *drm_mm_search_free_in_range(
a2e68e92 JG	248	const struct drm_mm *mm,
	249	unsigned long size,
	250	unsigned alignment,
	251	unsigned long start,
	252	unsigned long end,
6b9d89b4 CW	253	bool best_match)
	254	{
	255	return drm_mm_search_free_in_range_generic(mm, size, alignment, 0,
	256	start, end, best_match);
	257	}
	258	static inline struct drm_mm_node drm_mm_search_free_color(const struct drm_mm mm,
	259	unsigned long size,
	260	unsigned alignment,
	261	unsigned long color,
	262	bool best_match)
	263	{
	264	return drm_mm_search_free_generic(mm,size, alignment, color, best_match);
	265	}
	266	static inline struct drm_mm_node *drm_mm_search_free_in_range_color(
	267	const struct drm_mm *mm,
	268	unsigned long size,
	269	unsigned alignment,
	270	unsigned long color,
	271	unsigned long start,
	272	unsigned long end,
	273	bool best_match)
	274	{
	275	return drm_mm_search_free_in_range_generic(mm, size, alignment, color,
	276	start, end, best_match);
	277	}
	278	extern int drm_mm_init(struct drm_mm *mm,
	279	unsigned long start,
249d6048 JG	280	unsigned long size);
	281	extern void drm_mm_takedown(struct drm_mm *mm);
	282	extern int drm_mm_clean(struct drm_mm *mm);
249d6048 JG	283	extern int drm_mm_pre_get(struct drm_mm *mm);
	284
	285	static inline struct drm_mm drm_get_mm(struct drm_mm_node block)
	286	{
	287	return block->mm;
	288	}
	289
6b9d89b4 CW	290	void drm_mm_init_scan(struct drm_mm *mm,
	291	unsigned long size,
	292	unsigned alignment,
	293	unsigned long color);
	294	void drm_mm_init_scan_with_range(struct drm_mm *mm,
	295	unsigned long size,
d935cc61	296	unsigned alignment,
6b9d89b4	297	unsigned long color,
d935cc61 DV	298	unsigned long start,
d935cc61 DV	299	unsigned long end);
709ea971 DV	300	int drm_mm_scan_add_block(struct drm_mm_node *node);
	301	int drm_mm_scan_remove_block(struct drm_mm_node *node);
	302
99d7e48e	303	extern void drm_mm_debug_table(struct drm_mm mm, const char prefix);
fa8a1238 DA	304	#ifdef CONFIG_DEBUG_FS
	305	int drm_mm_dump_table(struct seq_file m, struct drm_mm mm);
	306	#endif
	307
249d6048	308	#endif