61 struct drm_mm_node {  struct
81 	struct drm_mm_node head_node;  argument
91 	struct drm_mm_node *prev_scanned_node;
93 	void (*color_adjust)(struct drm_mm_node *node, unsigned long color,
107 static inline bool drm_mm_node_allocated(struct drm_mm_node *node)  in drm_mm_node_allocated()
127 static inline u64 __drm_mm_hole_node_start(struct drm_mm_node *hole_node)  in __drm_mm_hole_node_start()
143 static inline u64 drm_mm_hole_node_start(struct drm_mm_node *hole_node)  in drm_mm_hole_node_start()
149 static inline u64 __drm_mm_hole_node_end(struct drm_mm_node *hole_node)  in __drm_mm_hole_node_end()
152 			  struct drm_mm_node, node_list)->start;  in __drm_mm_hole_node_end()
166 static inline u64 drm_mm_hole_node_end(struct drm_mm_node *hole_node)  in drm_mm_hole_node_end()
203 	for (entry = list_entry((mm)->hole_stack.next, struct drm_mm_node, hole_stack); \
208 	     entry = list_entry(entry->hole_stack.next, struct drm_mm_node, hole_stack))
211 …try((backwards) ? (mm)->hole_stack.prev : (mm)->hole_stack.next, struct drm_mm_node, hole_stack); \
216 …try((backwards) ? entry->hole_stack.prev : entry->hole_stack.next, struct drm_mm_node, hole_stack))
221 int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node);
224 			       struct drm_mm_node *node,
247 				     struct drm_mm_node *node,  in drm_mm_insert_node()
257 					struct drm_mm_node *node,
284 					      struct drm_mm_node *node,  in drm_mm_insert_node_in_range()
296 void drm_mm_remove_node(struct drm_mm_node *node);
297 void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new);
314 bool drm_mm_scan_add_block(struct drm_mm_node *node);
315 bool drm_mm_scan_remove_block(struct drm_mm_node *node);