Lines Matching full:mm
14 static struct drm_buddy_block *drm_block_alloc(struct drm_buddy *mm, in drm_block_alloc() argument
35 static void drm_block_free(struct drm_buddy *mm, in drm_block_free() argument
41 static void list_insert_sorted(struct drm_buddy *mm, in list_insert_sorted() argument
47 head = &mm->free_list[drm_buddy_block_order(block)]; in list_insert_sorted()
68 static void mark_free(struct drm_buddy *mm, in mark_free() argument
74 list_insert_sorted(mm, block); in mark_free()
88 * @mm: DRM buddy manager to initialize
97 int drm_buddy_init(struct drm_buddy *mm, u64 size, u64 chunk_size) in drm_buddy_init() argument
113 mm->size = size; in drm_buddy_init()
114 mm->avail = size; in drm_buddy_init()
115 mm->chunk_size = chunk_size; in drm_buddy_init()
116 mm->max_order = ilog2(size) - ilog2(chunk_size); in drm_buddy_init()
118 BUG_ON(mm->max_order > DRM_BUDDY_MAX_ORDER); in drm_buddy_init()
120 mm->free_list = kmalloc_array(mm->max_order + 1, in drm_buddy_init()
123 if (!mm->free_list) in drm_buddy_init()
126 for (i = 0; i <= mm->max_order; ++i) in drm_buddy_init()
127 INIT_LIST_HEAD(&mm->free_list[i]); in drm_buddy_init()
129 mm->n_roots = hweight64(size); in drm_buddy_init()
131 mm->roots = kmalloc_array(mm->n_roots, in drm_buddy_init()
134 if (!mm->roots) in drm_buddy_init()
152 root = drm_block_alloc(mm, NULL, order, offset); in drm_buddy_init()
156 mark_free(mm, root); in drm_buddy_init()
158 BUG_ON(i > mm->max_order); in drm_buddy_init()
159 BUG_ON(drm_buddy_block_size(mm, root) < chunk_size); in drm_buddy_init()
161 mm->roots[i] = root; in drm_buddy_init()
172 drm_block_free(mm, mm->roots[i]); in drm_buddy_init()
173 kfree(mm->roots); in drm_buddy_init()
175 kfree(mm->free_list); in drm_buddy_init()
183 * @mm: DRM buddy manager to free
187 void drm_buddy_fini(struct drm_buddy *mm) in drm_buddy_fini() argument
191 for (i = 0; i < mm->n_roots; ++i) { in drm_buddy_fini()
192 WARN_ON(!drm_buddy_block_is_free(mm->roots[i])); in drm_buddy_fini()
193 drm_block_free(mm, mm->roots[i]); in drm_buddy_fini()
196 WARN_ON(mm->avail != mm->size); in drm_buddy_fini()
198 kfree(mm->roots); in drm_buddy_fini()
199 kfree(mm->free_list); in drm_buddy_fini()
203 static int split_block(struct drm_buddy *mm, in split_block() argument
212 block->left = drm_block_alloc(mm, block, block_order, offset); in split_block()
216 block->right = drm_block_alloc(mm, block, block_order, in split_block()
217 offset + (mm->chunk_size << block_order)); in split_block()
219 drm_block_free(mm, block->left); in split_block()
223 mark_free(mm, block->left); in split_block()
224 mark_free(mm, block->right); in split_block()
263 static void __drm_buddy_free(struct drm_buddy *mm, in __drm_buddy_free() argument
278 drm_block_free(mm, block); in __drm_buddy_free()
279 drm_block_free(mm, buddy); in __drm_buddy_free()
284 mark_free(mm, block); in __drm_buddy_free()
290 * @mm: DRM buddy manager
293 void drm_buddy_free_block(struct drm_buddy *mm, in drm_buddy_free_block() argument
297 mm->avail += drm_buddy_block_size(mm, block); in drm_buddy_free_block()
298 __drm_buddy_free(mm, block); in drm_buddy_free_block()
305 * @mm: DRM buddy manager
308 void drm_buddy_free_list(struct drm_buddy *mm, struct list_head *objects) in drm_buddy_free_list() argument
313 drm_buddy_free_block(mm, block); in drm_buddy_free_list()
331 alloc_range_bias(struct drm_buddy *mm, in alloc_range_bias() argument
335 u64 req_size = mm->chunk_size << order; in alloc_range_bias()
344 for (i = 0; i < mm->n_roots; ++i) in alloc_range_bias()
345 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in alloc_range_bias()
363 block_end = block_start + drm_buddy_block_size(mm, block) - 1; in alloc_range_bias()
392 err = split_block(mm, block); in alloc_range_bias()
413 __drm_buddy_free(mm, block); in alloc_range_bias()
418 get_maxblock(struct drm_buddy *mm, unsigned int order) in get_maxblock() argument
423 for (i = order; i <= mm->max_order; ++i) { in get_maxblock()
424 if (!list_empty(&mm->free_list[i])) { in get_maxblock()
425 node = list_last_entry(&mm->free_list[i], in get_maxblock()
444 alloc_from_freelist(struct drm_buddy *mm, in alloc_from_freelist() argument
453 block = get_maxblock(mm, order); in alloc_from_freelist()
458 for (tmp = order; tmp <= mm->max_order; ++tmp) { in alloc_from_freelist()
459 if (!list_empty(&mm->free_list[tmp])) { in alloc_from_freelist()
460 block = list_last_entry(&mm->free_list[tmp], in alloc_from_freelist()
475 err = split_block(mm, block); in alloc_from_freelist()
486 __drm_buddy_free(mm, block); in alloc_from_freelist()
490 static int __alloc_range(struct drm_buddy *mm, in __alloc_range() argument
518 block_end = block_start + drm_buddy_block_size(mm, block) - 1; in __alloc_range()
535 total_allocated += drm_buddy_block_size(mm, block); in __alloc_range()
536 mm->avail -= drm_buddy_block_size(mm, block); in __alloc_range()
542 err = split_block(mm, block); in __alloc_range()
570 __drm_buddy_free(mm, block); in __alloc_range()
577 drm_buddy_free_list(mm, &allocated); in __alloc_range()
583 static int __drm_buddy_alloc_range(struct drm_buddy *mm, in __drm_buddy_alloc_range() argument
592 for (i = 0; i < mm->n_roots; ++i) in __drm_buddy_alloc_range()
593 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in __drm_buddy_alloc_range()
595 return __alloc_range(mm, &dfs, start, size, in __drm_buddy_alloc_range()
599 static int __alloc_contig_try_harder(struct drm_buddy *mm, in __alloc_contig_try_harder() argument
614 pages = modify_size >> ilog2(mm->chunk_size); in __alloc_contig_try_harder()
619 list = &mm->free_list[order]; in __alloc_contig_try_harder()
626 err = __drm_buddy_alloc_range(mm, rhs_offset, size, in __alloc_contig_try_harder()
637 err = __drm_buddy_alloc_range(mm, lhs_offset, lhs_size, in __alloc_contig_try_harder()
643 drm_buddy_free_list(mm, blocks); in __alloc_contig_try_harder()
647 drm_buddy_free_list(mm, blocks); in __alloc_contig_try_harder()
656 * @mm: DRM buddy manager
671 int drm_buddy_block_trim(struct drm_buddy *mm, in drm_buddy_block_trim() argument
691 if (new_size > drm_buddy_block_size(mm, block)) in drm_buddy_block_trim()
694 if (!new_size || !IS_ALIGNED(new_size, mm->chunk_size)) in drm_buddy_block_trim()
697 if (new_size == drm_buddy_block_size(mm, block)) in drm_buddy_block_trim()
701 mark_free(mm, block); in drm_buddy_block_trim()
702 mm->avail += drm_buddy_block_size(mm, block); in drm_buddy_block_trim()
710 err = __alloc_range(mm, &dfs, new_start, new_size, blocks, NULL); in drm_buddy_block_trim()
713 mm->avail -= drm_buddy_block_size(mm, block); in drm_buddy_block_trim()
725 * @mm: DRM buddy manager to allocate from
742 int drm_buddy_alloc_blocks(struct drm_buddy *mm, in drm_buddy_alloc_blocks() argument
755 if (size < mm->chunk_size) in drm_buddy_alloc_blocks()
758 if (min_block_size < mm->chunk_size) in drm_buddy_alloc_blocks()
764 if (!IS_ALIGNED(start | end | size, mm->chunk_size)) in drm_buddy_alloc_blocks()
767 if (end > mm->size) in drm_buddy_alloc_blocks()
770 if (range_overflows(start, size, mm->size)) in drm_buddy_alloc_blocks()
778 return __drm_buddy_alloc_range(mm, start, size, NULL, blocks); in drm_buddy_alloc_blocks()
793 pages = size >> ilog2(mm->chunk_size); in drm_buddy_alloc_blocks()
795 min_order = ilog2(min_block_size) - ilog2(mm->chunk_size); in drm_buddy_alloc_blocks()
799 BUG_ON(order > mm->max_order); in drm_buddy_alloc_blocks()
805 block = alloc_range_bias(mm, start, end, order); in drm_buddy_alloc_blocks()
808 block = alloc_from_freelist(mm, order, flags); in drm_buddy_alloc_blocks()
820 return __alloc_contig_try_harder(mm, in drm_buddy_alloc_blocks()
830 mm->avail -= drm_buddy_block_size(mm, block); in drm_buddy_alloc_blocks()
853 trim_size = drm_buddy_block_size(mm, block) - in drm_buddy_alloc_blocks()
857 drm_buddy_block_trim(mm, in drm_buddy_alloc_blocks()
869 drm_buddy_free_list(mm, &allocated); in drm_buddy_alloc_blocks()
877 * @mm: DRM buddy manager
881 void drm_buddy_block_print(struct drm_buddy *mm, in drm_buddy_block_print() argument
886 u64 size = drm_buddy_block_size(mm, block); in drm_buddy_block_print()
895 * @mm: DRM buddy manager
898 void drm_buddy_print(struct drm_buddy *mm, struct drm_printer *p) in drm_buddy_print() argument
903 mm->chunk_size >> 10, mm->size >> 20, mm->avail >> 20); in drm_buddy_print()
905 for (order = mm->max_order; order >= 0; order--) { in drm_buddy_print()
909 list_for_each_entry(block, &mm->free_list[order], link) { in drm_buddy_print()
916 free = count * (mm->chunk_size << order); in drm_buddy_print()