105 						u64 start,
151 				  node->start, node->size);  in show_leaks()
158 			  node->start, node->size, buf);  in show_leaks()
171 #define START(node) ((node)->start)
172 #define LAST(node)  ((node)->start + (node)->size - 1)
180 drm_mm_interval_tree_iter_first(struct rb_root *rb, u64 start, u64 last)  in INTERVAL_TREE_DEFINE()
186 		if (LAST(node) >= start && START(node) <= last)  in INTERVAL_TREE_DEFINE()
194 __drm_mm_interval_first(const struct drm_mm *mm, u64 start, u64 last)
197 					       start, last) ?: (struct drm_mm_node *)&mm->head_node;
242 	node->start = adj_start;  in drm_mm_insert_helper()
250 	DRM_MM_BUG_ON(node->start < range_start);  in drm_mm_insert_helper()
251 	DRM_MM_BUG_ON(node->start < adj_start);  in drm_mm_insert_helper()
252 	DRM_MM_BUG_ON(node->start + node->size > adj_end);  in drm_mm_insert_helper()
253 	DRM_MM_BUG_ON(node->start + node->size > range_end);  in drm_mm_insert_helper()
280 	u64 end = node->start + node->size;  in drm_mm_reserve_node()
285 	end = node->start + node->size;  in drm_mm_reserve_node()
286 	if (unlikely(end <= node->start))  in drm_mm_reserve_node()
291 					       node->start, ~(u64)0);  in drm_mm_reserve_node()
293 		if (hole->start < end)  in drm_mm_reserve_node()
309 	if (adj_start > node->start || adj_end < end)  in drm_mm_reserve_node()
321 	if (node->start == hole_start) {  in drm_mm_reserve_node()
358 					u64 start, u64 end,  in drm_mm_insert_node_in_range_generic()  argument
369 							start, end, sflags);  in drm_mm_insert_node_in_range_generic()
375 			     start, end, aflags);  in drm_mm_insert_node_in_range_generic()
423 static int check_free_hole(u64 start, u64 end, u64 size, u64 alignment)  in check_free_hole()  argument
425 	if (end - start < size)  in check_free_hole()
431 		div64_u64_rem(start, alignment, &rem);  in check_free_hole()
433 			start += alignment - rem;  in check_free_hole()
436 	return end >= start + size;  in check_free_hole()
443 							u64 start,  in drm_mm_search_free_in_range_generic()  argument
468 		adj_start = max(adj_start, start);  in drm_mm_search_free_in_range_generic()
503 	new->start = old->start;  in drm_mm_replace_node()
567 				 u64 start,  in drm_mm_scan_init_with_range()  argument
571 	DRM_MM_BUG_ON(start >= end);  in drm_mm_scan_init_with_range()
572 	DRM_MM_BUG_ON(!size || size > end - start);  in drm_mm_scan_init_with_range()
586 	DRM_MM_BUG_ON(end <= start);  in drm_mm_scan_init_with_range()
587 	scan->range_start = start;  in drm_mm_scan_init_with_range()
722 	return (node->start + node->size > scan->hit_start &&  in drm_mm_scan_remove_block()
723 		node->start < scan->hit_end);  in drm_mm_scan_remove_block()
774 void drm_mm_init(struct drm_mm *mm, u64 start, u64 size)  in drm_mm_init()  argument
776 	DRM_MM_BUG_ON(start + size <= start);  in drm_mm_init()
787 	mm->head_node.start = start + size;  in drm_mm_init()
788 	mm->head_node.size = start - mm->head_node.start;  in drm_mm_init()
839 		drm_printf(p, "%#018llx-%#018llx: %llu: used\n", entry->start,  in drm_mm_print()
840 			   entry->start + entry->size, entry->size);  in drm_mm_print()