29 					       unsigned int order,  in drm_block_alloc()  argument
34 	BUG_ON(order > DRM_BUDDY_MAX_ORDER);  in drm_block_alloc()
41 	block->header |= order;  in drm_block_alloc()
105 	unsigned int order = drm_buddy_block_order(block);  in rbtree_remove()  local
110 	root = &mm->free_trees[tree][order];  in rbtree_remove()
186 	unsigned int order;  in __drm_buddy_free()  local
219 	order = drm_buddy_block_order(block);  in __drm_buddy_free()
222 	return order;  in __drm_buddy_free()
230 	unsigned int tree, order;  in __force_merge()  local
277 				order = __drm_buddy_free(mm, block, true);  in __force_merge()
278 				if (order >= min_order)  in __force_merge()
349 		unsigned int order;  in drm_buddy_init()  local
352 		order = ilog2(size) - ilog2(chunk_size);  in drm_buddy_init()
353 		root_size = chunk_size << order;  in drm_buddy_init()
355 		root = drm_block_alloc(mm, NULL, order, offset);  in drm_buddy_init()
395 	unsigned int order;  in drm_buddy_fini()  local
401 		order = ilog2(size) - ilog2(mm->chunk_size);  in drm_buddy_fini()
403 		__force_merge(mm, start, start + size, order);  in drm_buddy_fini()
410 		root_size = mm->chunk_size << order;  in drm_buddy_fini()
487 	unsigned int order;  in drm_buddy_reset_clear()  local
492 		order = ilog2(size) - ilog2(mm->chunk_size);  in drm_buddy_reset_clear()
494 		__force_merge(mm, start, start + size, order);  in drm_buddy_reset_clear()
496 		root_size = mm->chunk_size << order;  in drm_buddy_reset_clear()
599 		   unsigned int order,  in __alloc_range_bias()  argument
603 	u64 req_size = mm->chunk_size << order;  in __alloc_range_bias()
627 		if (drm_buddy_block_order(block) < order)  in __alloc_range_bias()
652 		    order == drm_buddy_block_order(block)) {  in __alloc_range_bias()
691 			     unsigned int order,  in __drm_buddy_alloc_range_bias()  argument
697 	block = __alloc_range_bias(mm, start, end, order,  in __drm_buddy_alloc_range_bias()
700 		return __alloc_range_bias(mm, start, end, order,  in __drm_buddy_alloc_range_bias()
708 	     unsigned int order,  in get_maxblock()  argument
715 	for (i = order; i <= mm->max_order; ++i) {  in get_maxblock()
737 		    unsigned int order,  in alloc_from_freetree()  argument
750 		block = get_maxblock(mm, order, tree);  in alloc_from_freetree()
755 		for (tmp = order; tmp <= mm->max_order; ++tmp) {  in alloc_from_freetree()
769 		for (tmp = order; tmp <= mm->max_order; ++tmp) {  in alloc_from_freetree()
782 	while (tmp != order) {  in alloc_from_freetree()
793 	if (tmp != order)  in alloc_from_freetree()
916 	unsigned int tree, order;  in __alloc_contig_try_harder()  local
924 	order = fls(pages) - 1;  in __alloc_contig_try_harder()
925 	if (order == 0)  in __alloc_contig_try_harder()
932 		root = &mm->free_trees[tree][order];  in __alloc_contig_try_harder()
1067 			 unsigned int order,  in __drm_buddy_alloc_blocks()  argument
1073 						     order, flags);  in __drm_buddy_alloc_blocks()
1076 		return alloc_from_freetree(mm, order, flags);  in __drm_buddy_alloc_blocks()
1107 	unsigned int min_order, order;  in drm_buddy_alloc_blocks()  local
1151 	order = fls(pages) - 1;  in drm_buddy_alloc_blocks()
1154 	if (order > mm->max_order || size > mm->size) {  in drm_buddy_alloc_blocks()
1164 		order = min(order, (unsigned int)fls(pages) - 1);  in drm_buddy_alloc_blocks()
1165 		BUG_ON(order > mm->max_order);  in drm_buddy_alloc_blocks()
1166 		BUG_ON(order < min_order);  in drm_buddy_alloc_blocks()
1171 							 order,  in drm_buddy_alloc_blocks()
1176 			if (order-- == min_order) {  in drm_buddy_alloc_blocks()
1185 						order = min_order;  in drm_buddy_alloc_blocks()
1212 		pages -= BIT(order);  in drm_buddy_alloc_blocks()
1280 	int order;  in drm_buddy_print()  local
1285 	for (order = mm->max_order; order >= 0; order--) {  in drm_buddy_print()
1292 			root = &mm->free_trees[tree][order];  in drm_buddy_print()
1300 		drm_printf(p, "order-%2d ", order);  in drm_buddy_print()
1302 		free = count * (mm->chunk_size << order);  in drm_buddy_print()