107 static noinline void save_stack(struct drm_mm_node *node)  in save_stack()
120 	struct drm_mm_node *node;  in show_leaks()
148 static void save_stack(struct drm_mm_node *node) { }  in save_stack()
155 INTERVAL_TREE_DEFINE(struct drm_mm_node, rb,  in INTERVAL_TREE_DEFINE()  argument
159 struct drm_mm_node *  in INTERVAL_TREE_DEFINE()
163 					       start, last) ?: (struct drm_mm_node *)&mm->head_node;  in INTERVAL_TREE_DEFINE()
167 static void drm_mm_interval_tree_add_node(struct drm_mm_node *hole_node,  in drm_mm_interval_tree_add_node()
168 					  struct drm_mm_node *node)  in drm_mm_interval_tree_add_node()
172 	struct drm_mm_node *parent;  in drm_mm_interval_tree_add_node()
180 			parent = rb_entry(rb, struct drm_mm_node, rb);  in drm_mm_interval_tree_add_node()
199 		parent = rb_entry(rb, struct drm_mm_node, rb);  in drm_mm_interval_tree_add_node()
220 	return rb_entry(rb, struct drm_mm_node, rb_hole_size)->hole_size;  in rb_to_hole_size()
224 			     struct drm_mm_node *node)  in insert_hole_size()
245 			 struct drm_mm_node, rb_hole_addr,  in RB_DECLARE_CALLBACKS_MAX()  argument
248 static void insert_hole_addr(struct rb_root *root, struct drm_mm_node *node)  in RB_DECLARE_CALLBACKS_MAX()
252 	struct drm_mm_node *parent;  in RB_DECLARE_CALLBACKS_MAX()
256 		parent = rb_entry(rb_parent, struct drm_mm_node, rb_hole_addr);  in RB_DECLARE_CALLBACKS_MAX()
269 static void add_hole(struct drm_mm_node *node)  in add_hole()
284 static void rm_hole(struct drm_mm_node *node)  in rm_hole()
298 static inline struct drm_mm_node *rb_hole_size_to_node(struct rb_node *rb)  in rb_hole_size_to_node()
300 	return rb_entry_safe(rb, struct drm_mm_node, rb_hole_size);  in rb_hole_size_to_node()
303 static inline struct drm_mm_node *rb_hole_addr_to_node(struct rb_node *rb)  in rb_hole_addr_to_node()
305 	return rb_entry_safe(rb, struct drm_mm_node, rb_hole_addr);  in rb_hole_addr_to_node()
308 static struct drm_mm_node *best_hole(struct drm_mm *mm, u64 size)  in best_hole()
311 	struct drm_mm_node *best = NULL;  in best_hole()
314 		struct drm_mm_node *node =  in best_hole()
315 			rb_entry(rb, struct drm_mm_node, rb_hole_size);  in best_hole()
333 static struct drm_mm_node *find_hole_addr(struct drm_mm *mm, u64 addr, u64 size)  in find_hole_addr()
336 	struct drm_mm_node *node = NULL;  in find_hole_addr()
358 static struct drm_mm_node *
376 						struct drm_mm_node,  in first_hole()
393 static struct drm_mm_node *name(struct drm_mm_node *entry, u64 size)	\
416 static struct drm_mm_node *  in DECLARE_NEXT_HOLE_ADDR()
418 	  struct drm_mm_node *node,  in DECLARE_NEXT_HOLE_ADDR()
453 int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node)  in drm_mm_reserve_node()
455 	struct drm_mm_node *hole;  in drm_mm_reserve_node()
518 				struct drm_mm_node * const node,  in drm_mm_insert_node_in_range()
524 	struct drm_mm_node *hole;  in drm_mm_insert_node_in_range()
617 static inline bool drm_mm_node_scanned_block(const struct drm_mm_node *node)  in drm_mm_node_scanned_block()
630 void drm_mm_remove_node(struct drm_mm_node *node)  in drm_mm_remove_node()
633 	struct drm_mm_node *prev_node;  in drm_mm_remove_node()
663 void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new)  in drm_mm_replace_node()
784 			   struct drm_mm_node *node)  in drm_mm_scan_add_block()
787 	struct drm_mm_node *hole;  in drm_mm_scan_add_block()
875 			      struct drm_mm_node *node)  in drm_mm_scan_remove_block()
877 	struct drm_mm_node *prev_node;  in drm_mm_scan_remove_block()
915 struct drm_mm_node *drm_mm_scan_color_evict(struct drm_mm_scan *scan)  in drm_mm_scan_color_evict()
918 	struct drm_mm_node *hole;  in drm_mm_scan_color_evict()
1004 static u64 drm_mm_dump_hole(struct drm_printer *p, const struct drm_mm_node *entry)  in drm_mm_dump_hole()
1024 	const struct drm_mm_node *entry;  in drm_mm_print()