54 	struct drm_mm *mm;  member
86 static inline bool drm_mm_initialized(struct drm_mm *mm)  in drm_mm_initialized()  argument
88 	return mm->hole_stack.next;  in drm_mm_initialized()
90 #define drm_mm_for_each_node(entry, mm) list_for_each_entry(entry, \  argument
91 						&(mm)->head_node.node_list, \
93 #define drm_mm_for_each_scanned_node_reverse(entry, n, mm) \  argument
94 	for (entry = (mm)->prev_scanned_node, \
160 extern int drm_mm_insert_node(struct drm_mm *mm,
164 extern int drm_mm_insert_node_in_range(struct drm_mm *mm,
170 extern int drm_mm_insert_node_generic(struct drm_mm *mm,
175 extern int drm_mm_insert_node_in_range_generic(struct drm_mm *mm,
185 extern struct drm_mm_node *drm_mm_search_free_generic(const struct drm_mm *mm,
191 						const struct drm_mm *mm,
198 static inline struct drm_mm_node *drm_mm_search_free(const struct drm_mm *mm,  in drm_mm_search_free()  argument
203 	return drm_mm_search_free_generic(mm,size, alignment, 0, best_match);  in drm_mm_search_free()
206 						const struct drm_mm *mm,  in drm_mm_search_free_in_range()  argument
213 	return drm_mm_search_free_in_range_generic(mm, size, alignment, 0,  in drm_mm_search_free_in_range()
216 static inline struct drm_mm_node *drm_mm_search_free_color(const struct drm_mm *mm,  in drm_mm_search_free_color()  argument
222 	return drm_mm_search_free_generic(mm,size, alignment, color, best_match);  in drm_mm_search_free_color()
225 						const struct drm_mm *mm,  in drm_mm_search_free_in_range_color()  argument
233 	return drm_mm_search_free_in_range_generic(mm, size, alignment, color,  in drm_mm_search_free_in_range_color()
236 extern int drm_mm_init(struct drm_mm *mm,
239 extern void drm_mm_takedown(struct drm_mm *mm);
240 extern int drm_mm_clean(struct drm_mm *mm);
241 extern int drm_mm_pre_get(struct drm_mm *mm);
245 	return block->mm;  in drm_get_mm()
248 void drm_mm_init_scan(struct drm_mm *mm,
252 void drm_mm_init_scan_with_range(struct drm_mm *mm,
261 extern void drm_mm_debug_table(struct drm_mm *mm, const char *prefix);