107 static noinline void save_stack(struct drm_mm_node *node)  in save_stack()
120 	struct drm_mm_node *node;  in show_leaks()
145 static void save_stack(struct drm_mm_node *node) { }  in save_stack()
152 INTERVAL_TREE_DEFINE(struct drm_mm_node, rb,  in INTERVAL_TREE_DEFINE()  argument
156 struct drm_mm_node *  in INTERVAL_TREE_DEFINE()
160 					       start, last) ?: (struct drm_mm_node *)&mm->head_node;  in INTERVAL_TREE_DEFINE()
164 static void drm_mm_interval_tree_add_node(struct drm_mm_node *hole_node,  in drm_mm_interval_tree_add_node()
165 					  struct drm_mm_node *node)  in drm_mm_interval_tree_add_node()
169 	struct drm_mm_node *parent;  in drm_mm_interval_tree_add_node()
177 			parent = rb_entry(rb, struct drm_mm_node, rb);  in drm_mm_interval_tree_add_node()
196 		parent = rb_entry(rb, struct drm_mm_node, rb);  in drm_mm_interval_tree_add_node()
217 	return rb_entry(rb, struct drm_mm_node, rb_hole_size)->hole_size;  in rb_to_hole_size()
221 			     struct drm_mm_node *node)  in insert_hole_size()
242 			 struct drm_mm_node, rb_hole_addr,  in RB_DECLARE_CALLBACKS_MAX()  argument
245 static void insert_hole_addr(struct rb_root *root, struct drm_mm_node *node)  in RB_DECLARE_CALLBACKS_MAX()
249 	struct drm_mm_node *parent;  in RB_DECLARE_CALLBACKS_MAX()
253 		parent = rb_entry(rb_parent, struct drm_mm_node, rb_hole_addr);  in RB_DECLARE_CALLBACKS_MAX()
266 static void add_hole(struct drm_mm_node *node)  in add_hole()
281 static void rm_hole(struct drm_mm_node *node)  in rm_hole()
295 static inline struct drm_mm_node *rb_hole_size_to_node(struct rb_node *rb)  in rb_hole_size_to_node()
297 	return rb_entry_safe(rb, struct drm_mm_node, rb_hole_size);  in rb_hole_size_to_node()
300 static inline struct drm_mm_node *rb_hole_addr_to_node(struct rb_node *rb)  in rb_hole_addr_to_node()
302 	return rb_entry_safe(rb, struct drm_mm_node, rb_hole_addr);  in rb_hole_addr_to_node()
305 static struct drm_mm_node *best_hole(struct drm_mm *mm, u64 size)  in best_hole()
308 	struct drm_mm_node *best = NULL;  in best_hole()
311 		struct drm_mm_node *node =  in best_hole()
312 			rb_entry(rb, struct drm_mm_node, rb_hole_size);  in best_hole()
330 static struct drm_mm_node *find_hole_addr(struct drm_mm *mm, u64 addr, u64 size)  in find_hole_addr()
333 	struct drm_mm_node *node = NULL;  in find_hole_addr()
355 static struct drm_mm_node *
373 						struct drm_mm_node,  in first_hole()
390 static struct drm_mm_node *name(struct drm_mm_node *entry, u64 size)	\
413 static struct drm_mm_node *  in DECLARE_NEXT_HOLE_ADDR()
415 	  struct drm_mm_node *node,  in DECLARE_NEXT_HOLE_ADDR()
450 int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node)  in drm_mm_reserve_node()
452 	struct drm_mm_node *hole;  in drm_mm_reserve_node()
515 				struct drm_mm_node * const node,  in drm_mm_insert_node_in_range()
521 	struct drm_mm_node *hole;  in drm_mm_insert_node_in_range()
614 static inline bool drm_mm_node_scanned_block(const struct drm_mm_node *node)  in drm_mm_node_scanned_block()
627 void drm_mm_remove_node(struct drm_mm_node *node)  in drm_mm_remove_node()
630 	struct drm_mm_node *prev_node;  in drm_mm_remove_node()
660 void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new)  in drm_mm_replace_node()
781 			   struct drm_mm_node *node)  in drm_mm_scan_add_block()
784 	struct drm_mm_node *hole;  in drm_mm_scan_add_block()
872 			      struct drm_mm_node *node)  in drm_mm_scan_remove_block()
874 	struct drm_mm_node *prev_node;  in drm_mm_scan_remove_block()
912 struct drm_mm_node *drm_mm_scan_color_evict(struct drm_mm_scan *scan)  in drm_mm_scan_color_evict()
915 	struct drm_mm_node *hole;  in drm_mm_scan_color_evict()
1005 static u64 drm_mm_dump_hole(struct drm_printer *p, const struct drm_mm_node *entry)  in drm_mm_dump_hole()
1025 	const struct drm_mm_node *entry;  in drm_mm_print()