73 	struct drm_mm *mm;  member
122 static inline bool drm_mm_initialized(struct drm_mm *mm)  in drm_mm_initialized()  argument
124 	return mm->hole_stack.next;  in drm_mm_initialized()
179 #define drm_mm_for_each_node(entry, mm) list_for_each_entry(entry, \  argument
180 						&(mm)->head_node.node_list, \
202 #define drm_mm_for_each_hole(entry, mm, hole_start, hole_end) \  argument
203 	for (entry = list_entry((mm)->hole_stack.next, struct drm_mm_node, hole_stack); \
204 	     &entry->hole_stack != &(mm)->hole_stack ? \
210 #define __drm_mm_for_each_hole(entry, mm, hole_start, hole_end, backwards) \  argument
211 …for (entry = list_entry((backwards) ? (mm)->hole_stack.prev : (mm)->hole_stack.next, struct drm_mm…
212 	     &entry->hole_stack != &(mm)->hole_stack ? \
221 int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node);
223 int drm_mm_insert_node_generic(struct drm_mm *mm,
246 static inline int drm_mm_insert_node(struct drm_mm *mm,  in drm_mm_insert_node()  argument
252 	return drm_mm_insert_node_generic(mm, node, size, alignment, 0, flags,  in drm_mm_insert_node()
256 int drm_mm_insert_node_in_range_generic(struct drm_mm *mm,
283 static inline int drm_mm_insert_node_in_range(struct drm_mm *mm,  in drm_mm_insert_node_in_range()  argument
291 	return drm_mm_insert_node_in_range_generic(mm, node, size, alignment,  in drm_mm_insert_node_in_range()
298 void drm_mm_init(struct drm_mm *mm,
301 void drm_mm_takedown(struct drm_mm *mm);
302 bool drm_mm_clean(struct drm_mm *mm);
304 void drm_mm_init_scan(struct drm_mm *mm,
308 void drm_mm_init_scan_with_range(struct drm_mm *mm,
317 void drm_mm_debug_table(struct drm_mm *mm, const char *prefix);
319 int drm_mm_dump_table(struct seq_file *m, struct drm_mm *mm);