1 /**************************************************************************
3 * Copyright 2006 Tungsten Graphics, Inc., Bismarck, ND., USA.
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
19 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
20 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
21 * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
22 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
23 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
24 * USE OR OTHER DEALINGS IN THE SOFTWARE.
27 **************************************************************************/
30 * Generic simple memory manager implementation. Intended to be used as a base
31 * class implementation for more advanced memory managers.
33 * Note that the algorithm used is quite simple and there might be substantial
34 * performance gains if a smarter free list is implemented. Currently it is just an
35 * unordered stack of free regions. This could easily be improved if an RB-tree
36 * is used instead. At least if we expect heavy fragmentation.
38 * Aligned allocations can also see improvement.
41 * Thomas Hellström <thomas-at-tungstengraphics-dot-com>
45 #include <drm/drm_mm.h>
46 #include <linux/slab.h>
47 #include <linux/seq_file.h>
48 #include <linux/export.h>
53 * drm_mm provides a simple range allocator. The drivers are free to use the
54 * resource allocator from the linux core if it suits them, the upside of drm_mm
55 * is that it's in the DRM core. Which means that it's easier to extend for
56 * some of the crazier special purpose needs of gpus.
58 * The main data struct is &drm_mm, allocations are tracked in &drm_mm_node.
59 * Drivers are free to embed either of them into their own suitable
60 * datastructures. drm_mm itself will not do any allocations of its own, so if
61 * drivers choose not to embed nodes they need to still allocate them
64 * The range allocator also supports reservation of preallocated blocks. This is
65 * useful for taking over initial mode setting configurations from the firmware,
66 * where an object needs to be created which exactly matches the firmware's
67 * scanout target. As long as the range is still free it can be inserted anytime
68 * after the allocator is initialized, which helps with avoiding looped
69 * depencies in the driver load sequence.
71 * drm_mm maintains a stack of most recently freed holes, which of all
72 * simplistic datastructures seems to be a fairly decent approach to clustering
73 * allocations and avoiding too much fragmentation. This means free space
74 * searches are O(num_holes). Given that all the fancy features drm_mm supports
75 * something better would be fairly complex and since gfx thrashing is a fairly
76 * steep cliff not a real concern. Removing a node again is O(1).
78 * drm_mm supports a few features: Alignment and range restrictions can be
79 * supplied. Further more every &drm_mm_node has a color value (which is just an
80 * opaqua unsigned long) which in conjunction with a driver callback can be used
81 * to implement sophisticated placement restrictions. The i915 DRM driver uses
82 * this to implement guard pages between incompatible caching domains in the
85 * Two behaviors are supported for searching and allocating: bottom-up and top-down.
86 * The default is bottom-up. Top-down allocation can be used if the memory area
87 * has different restrictions, or just to reduce fragmentation.
89 * Finally iteration helpers to walk all nodes and all holes are provided as are
90 * some basic allocator dumpers for debugging.
93 static struct drm_mm_node *drm_mm_search_free_generic(const struct drm_mm *mm,
97 enum drm_mm_search_flags flags);
98 static struct drm_mm_node *drm_mm_search_free_in_range_generic(const struct drm_mm *mm,
104 enum drm_mm_search_flags flags);
106 static void drm_mm_insert_helper(struct drm_mm_node *hole_node,
107 struct drm_mm_node *node,
108 u64 size, unsigned alignment,
110 enum drm_mm_allocator_flags flags)
112 struct drm_mm *mm = hole_node->mm;
113 u64 hole_start = drm_mm_hole_node_start(hole_node);
114 u64 hole_end = drm_mm_hole_node_end(hole_node);
115 u64 adj_start = hole_start;
116 u64 adj_end = hole_end;
118 BUG_ON(node->allocated);
120 if (mm->color_adjust)
121 mm->color_adjust(hole_node, color, &adj_start, &adj_end);
123 if (flags & DRM_MM_CREATE_TOP)
124 adj_start = adj_end - size;
130 rem = do_div(tmp, alignment);
132 if (flags & DRM_MM_CREATE_TOP)
135 adj_start += alignment - rem;
139 BUG_ON(adj_start < hole_start);
140 BUG_ON(adj_end > hole_end);
142 if (adj_start == hole_start) {
143 hole_node->hole_follows = 0;
144 list_del(&hole_node->hole_stack);
147 node->start = adj_start;
153 INIT_LIST_HEAD(&node->hole_stack);
154 list_add(&node->node_list, &hole_node->node_list);
156 BUG_ON(node->start + node->size > adj_end);
158 node->hole_follows = 0;
159 if (__drm_mm_hole_node_start(node) < hole_end) {
160 list_add(&node->hole_stack, &mm->hole_stack);
161 node->hole_follows = 1;
166 * drm_mm_reserve_node - insert an pre-initialized node
167 * @mm: drm_mm allocator to insert @node into
168 * @node: drm_mm_node to insert
170 * This functions inserts an already set-up drm_mm_node into the allocator,
171 * meaning that start, size and color must be set by the caller. This is useful
172 * to initialize the allocator with preallocated objects which must be set-up
173 * before the range allocator can be set-up, e.g. when taking over a firmware
177 * 0 on success, -ENOSPC if there's no hole where @node is.
179 int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node)
181 struct drm_mm_node *hole;
186 BUG_ON(node == NULL);
188 end = node->start + node->size;
190 /* Find the relevant hole to add our node to */
191 drm_mm_for_each_hole(hole, mm, hole_start, hole_end) {
192 if (hole_start > node->start || hole_end < end)
198 INIT_LIST_HEAD(&node->hole_stack);
199 list_add(&node->node_list, &hole->node_list);
201 if (node->start == hole_start) {
202 hole->hole_follows = 0;
203 list_del_init(&hole->hole_stack);
206 node->hole_follows = 0;
207 if (end != hole_end) {
208 list_add(&node->hole_stack, &mm->hole_stack);
209 node->hole_follows = 1;
217 EXPORT_SYMBOL(drm_mm_reserve_node);
220 * drm_mm_insert_node_generic - search for space and insert @node
221 * @mm: drm_mm to allocate from
222 * @node: preallocate node to insert
223 * @size: size of the allocation
224 * @alignment: alignment of the allocation
225 * @color: opaque tag value to use for this node
226 * @sflags: flags to fine-tune the allocation search
227 * @aflags: flags to fine-tune the allocation behavior
229 * The preallocated node must be cleared to 0.
232 * 0 on success, -ENOSPC if there's no suitable hole.
234 int drm_mm_insert_node_generic(struct drm_mm *mm, struct drm_mm_node *node,
235 u64 size, unsigned alignment,
237 enum drm_mm_search_flags sflags,
238 enum drm_mm_allocator_flags aflags)
240 struct drm_mm_node *hole_node;
242 hole_node = drm_mm_search_free_generic(mm, size, alignment,
247 drm_mm_insert_helper(hole_node, node, size, alignment, color, aflags);
250 EXPORT_SYMBOL(drm_mm_insert_node_generic);
252 static void drm_mm_insert_helper_range(struct drm_mm_node *hole_node,
253 struct drm_mm_node *node,
254 u64 size, unsigned alignment,
257 enum drm_mm_allocator_flags flags)
259 struct drm_mm *mm = hole_node->mm;
260 u64 hole_start = drm_mm_hole_node_start(hole_node);
261 u64 hole_end = drm_mm_hole_node_end(hole_node);
262 u64 adj_start = hole_start;
263 u64 adj_end = hole_end;
265 BUG_ON(!hole_node->hole_follows || node->allocated);
267 if (adj_start < start)
272 if (mm->color_adjust)
273 mm->color_adjust(hole_node, color, &adj_start, &adj_end);
275 if (flags & DRM_MM_CREATE_TOP)
276 adj_start = adj_end - size;
282 rem = do_div(tmp, alignment);
284 if (flags & DRM_MM_CREATE_TOP)
287 adj_start += alignment - rem;
291 if (adj_start == hole_start) {
292 hole_node->hole_follows = 0;
293 list_del(&hole_node->hole_stack);
296 node->start = adj_start;
302 INIT_LIST_HEAD(&node->hole_stack);
303 list_add(&node->node_list, &hole_node->node_list);
305 BUG_ON(node->start < start);
306 BUG_ON(node->start < adj_start);
307 BUG_ON(node->start + node->size > adj_end);
308 BUG_ON(node->start + node->size > end);
310 node->hole_follows = 0;
311 if (__drm_mm_hole_node_start(node) < hole_end) {
312 list_add(&node->hole_stack, &mm->hole_stack);
313 node->hole_follows = 1;
318 * drm_mm_insert_node_in_range_generic - ranged search for space and insert @node
319 * @mm: drm_mm to allocate from
320 * @node: preallocate node to insert
321 * @size: size of the allocation
322 * @alignment: alignment of the allocation
323 * @color: opaque tag value to use for this node
324 * @start: start of the allowed range for this node
325 * @end: end of the allowed range for this node
326 * @sflags: flags to fine-tune the allocation search
327 * @aflags: flags to fine-tune the allocation behavior
329 * The preallocated node must be cleared to 0.
332 * 0 on success, -ENOSPC if there's no suitable hole.
334 int drm_mm_insert_node_in_range_generic(struct drm_mm *mm, struct drm_mm_node *node,
335 u64 size, unsigned alignment,
338 enum drm_mm_search_flags sflags,
339 enum drm_mm_allocator_flags aflags)
341 struct drm_mm_node *hole_node;
343 hole_node = drm_mm_search_free_in_range_generic(mm,
344 size, alignment, color,
349 drm_mm_insert_helper_range(hole_node, node,
350 size, alignment, color,
354 EXPORT_SYMBOL(drm_mm_insert_node_in_range_generic);
357 * drm_mm_remove_node - Remove a memory node from the allocator.
358 * @node: drm_mm_node to remove
360 * This just removes a node from its drm_mm allocator. The node does not need to
361 * be cleared again before it can be re-inserted into this or any other drm_mm
362 * allocator. It is a bug to call this function on a un-allocated node.
364 void drm_mm_remove_node(struct drm_mm_node *node)
366 struct drm_mm *mm = node->mm;
367 struct drm_mm_node *prev_node;
369 if (WARN_ON(!node->allocated))
372 BUG_ON(node->scanned_block || node->scanned_prev_free
373 || node->scanned_next_free);
376 list_entry(node->node_list.prev, struct drm_mm_node, node_list);
378 if (node->hole_follows) {
379 BUG_ON(__drm_mm_hole_node_start(node) ==
380 __drm_mm_hole_node_end(node));
381 list_del(&node->hole_stack);
383 BUG_ON(__drm_mm_hole_node_start(node) !=
384 __drm_mm_hole_node_end(node));
387 if (!prev_node->hole_follows) {
388 prev_node->hole_follows = 1;
389 list_add(&prev_node->hole_stack, &mm->hole_stack);
391 list_move(&prev_node->hole_stack, &mm->hole_stack);
393 list_del(&node->node_list);
396 EXPORT_SYMBOL(drm_mm_remove_node);
398 static int check_free_hole(u64 start, u64 end, u64 size, unsigned alignment)
400 if (end - start < size)
407 rem = do_div(tmp, alignment);
409 start += alignment - rem;
412 return end >= start + size;
415 static struct drm_mm_node *drm_mm_search_free_generic(const struct drm_mm *mm,
419 enum drm_mm_search_flags flags)
421 struct drm_mm_node *entry;
422 struct drm_mm_node *best;
427 BUG_ON(mm->scanned_blocks);
432 __drm_mm_for_each_hole(entry, mm, adj_start, adj_end,
433 flags & DRM_MM_SEARCH_BELOW) {
434 u64 hole_size = adj_end - adj_start;
436 if (mm->color_adjust) {
437 mm->color_adjust(entry, color, &adj_start, &adj_end);
438 if (adj_end <= adj_start)
442 if (!check_free_hole(adj_start, adj_end, size, alignment))
445 if (!(flags & DRM_MM_SEARCH_BEST))
448 if (hole_size < best_size) {
450 best_size = hole_size;
457 static struct drm_mm_node *drm_mm_search_free_in_range_generic(const struct drm_mm *mm,
463 enum drm_mm_search_flags flags)
465 struct drm_mm_node *entry;
466 struct drm_mm_node *best;
471 BUG_ON(mm->scanned_blocks);
476 __drm_mm_for_each_hole(entry, mm, adj_start, adj_end,
477 flags & DRM_MM_SEARCH_BELOW) {
478 u64 hole_size = adj_end - adj_start;
480 if (adj_start < start)
485 if (mm->color_adjust) {
486 mm->color_adjust(entry, color, &adj_start, &adj_end);
487 if (adj_end <= adj_start)
491 if (!check_free_hole(adj_start, adj_end, size, alignment))
494 if (!(flags & DRM_MM_SEARCH_BEST))
497 if (hole_size < best_size) {
499 best_size = hole_size;
507 * drm_mm_replace_node - move an allocation from @old to @new
508 * @old: drm_mm_node to remove from the allocator
509 * @new: drm_mm_node which should inherit @old's allocation
511 * This is useful for when drivers embed the drm_mm_node structure and hence
512 * can't move allocations by reassigning pointers. It's a combination of remove
513 * and insert with the guarantee that the allocation start will match.
515 void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new)
517 list_replace(&old->node_list, &new->node_list);
518 list_replace(&old->hole_stack, &new->hole_stack);
519 new->hole_follows = old->hole_follows;
521 new->start = old->start;
522 new->size = old->size;
523 new->color = old->color;
528 EXPORT_SYMBOL(drm_mm_replace_node);
531 * DOC: lru scan roaster
533 * Very often GPUs need to have continuous allocations for a given object. When
534 * evicting objects to make space for a new one it is therefore not most
535 * efficient when we simply start to select all objects from the tail of an LRU
536 * until there's a suitable hole: Especially for big objects or nodes that
537 * otherwise have special allocation constraints there's a good chance we evict
538 * lots of (smaller) objects unecessarily.
540 * The DRM range allocator supports this use-case through the scanning
541 * interfaces. First a scan operation needs to be initialized with
542 * drm_mm_init_scan() or drm_mm_init_scan_with_range(). The the driver adds
543 * objects to the roaster (probably by walking an LRU list, but this can be
544 * freely implemented) until a suitable hole is found or there's no further
547 * The the driver must walk through all objects again in exactly the reverse
548 * order to restore the allocator state. Note that while the allocator is used
549 * in the scan mode no other operation is allowed.
551 * Finally the driver evicts all objects selected in the scan. Adding and
552 * removing an object is O(1), and since freeing a node is also O(1) the overall
553 * complexity is O(scanned_objects). So like the free stack which needs to be
554 * walked before a scan operation even begins this is linear in the number of
555 * objects. It doesn't seem to hurt badly.
559 * drm_mm_init_scan - initialize lru scanning
560 * @mm: drm_mm to scan
561 * @size: size of the allocation
562 * @alignment: alignment of the allocation
563 * @color: opaque tag value to use for the allocation
565 * This simply sets up the scanning routines with the parameters for the desired
566 * hole. Note that there's no need to specify allocation flags, since they only
567 * change the place a node is allocated from within a suitable hole.
570 * As long as the scan list is non-empty, no other operations than
571 * adding/removing nodes to/from the scan list are allowed.
573 void drm_mm_init_scan(struct drm_mm *mm,
578 mm->scan_color = color;
579 mm->scan_alignment = alignment;
580 mm->scan_size = size;
581 mm->scanned_blocks = 0;
582 mm->scan_hit_start = 0;
583 mm->scan_hit_end = 0;
584 mm->scan_check_range = 0;
585 mm->prev_scanned_node = NULL;
587 EXPORT_SYMBOL(drm_mm_init_scan);
590 * drm_mm_init_scan - initialize range-restricted lru scanning
591 * @mm: drm_mm to scan
592 * @size: size of the allocation
593 * @alignment: alignment of the allocation
594 * @color: opaque tag value to use for the allocation
595 * @start: start of the allowed range for the allocation
596 * @end: end of the allowed range for the allocation
598 * This simply sets up the scanning routines with the parameters for the desired
599 * hole. Note that there's no need to specify allocation flags, since they only
600 * change the place a node is allocated from within a suitable hole.
603 * As long as the scan list is non-empty, no other operations than
604 * adding/removing nodes to/from the scan list are allowed.
606 void drm_mm_init_scan_with_range(struct drm_mm *mm,
613 mm->scan_color = color;
614 mm->scan_alignment = alignment;
615 mm->scan_size = size;
616 mm->scanned_blocks = 0;
617 mm->scan_hit_start = 0;
618 mm->scan_hit_end = 0;
619 mm->scan_start = start;
621 mm->scan_check_range = 1;
622 mm->prev_scanned_node = NULL;
624 EXPORT_SYMBOL(drm_mm_init_scan_with_range);
627 * drm_mm_scan_add_block - add a node to the scan list
628 * @node: drm_mm_node to add
630 * Add a node to the scan list that might be freed to make space for the desired
634 * True if a hole has been found, false otherwise.
636 bool drm_mm_scan_add_block(struct drm_mm_node *node)
638 struct drm_mm *mm = node->mm;
639 struct drm_mm_node *prev_node;
640 u64 hole_start, hole_end;
641 u64 adj_start, adj_end;
643 mm->scanned_blocks++;
645 BUG_ON(node->scanned_block);
646 node->scanned_block = 1;
648 prev_node = list_entry(node->node_list.prev, struct drm_mm_node,
651 node->scanned_preceeds_hole = prev_node->hole_follows;
652 prev_node->hole_follows = 1;
653 list_del(&node->node_list);
654 node->node_list.prev = &prev_node->node_list;
655 node->node_list.next = &mm->prev_scanned_node->node_list;
656 mm->prev_scanned_node = node;
658 adj_start = hole_start = drm_mm_hole_node_start(prev_node);
659 adj_end = hole_end = drm_mm_hole_node_end(prev_node);
661 if (mm->scan_check_range) {
662 if (adj_start < mm->scan_start)
663 adj_start = mm->scan_start;
664 if (adj_end > mm->scan_end)
665 adj_end = mm->scan_end;
668 if (mm->color_adjust)
669 mm->color_adjust(prev_node, mm->scan_color,
670 &adj_start, &adj_end);
672 if (check_free_hole(adj_start, adj_end,
673 mm->scan_size, mm->scan_alignment)) {
674 mm->scan_hit_start = hole_start;
675 mm->scan_hit_end = hole_end;
681 EXPORT_SYMBOL(drm_mm_scan_add_block);
684 * drm_mm_scan_remove_block - remove a node from the scan list
685 * @node: drm_mm_node to remove
687 * Nodes _must_ be removed in the exact same order from the scan list as they
688 * have been added, otherwise the internal state of the memory manager will be
691 * When the scan list is empty, the selected memory nodes can be freed. An
692 * immediately following drm_mm_search_free with !DRM_MM_SEARCH_BEST will then
693 * return the just freed block (because its at the top of the free_stack list).
696 * True if this block should be evicted, false otherwise. Will always
697 * return false when no hole has been found.
699 bool drm_mm_scan_remove_block(struct drm_mm_node *node)
701 struct drm_mm *mm = node->mm;
702 struct drm_mm_node *prev_node;
704 mm->scanned_blocks--;
706 BUG_ON(!node->scanned_block);
707 node->scanned_block = 0;
709 prev_node = list_entry(node->node_list.prev, struct drm_mm_node,
712 prev_node->hole_follows = node->scanned_preceeds_hole;
713 list_add(&node->node_list, &prev_node->node_list);
715 return (drm_mm_hole_node_end(node) > mm->scan_hit_start &&
716 node->start < mm->scan_hit_end);
718 EXPORT_SYMBOL(drm_mm_scan_remove_block);
721 * drm_mm_clean - checks whether an allocator is clean
722 * @mm: drm_mm allocator to check
725 * True if the allocator is completely free, false if there's still a node
728 bool drm_mm_clean(struct drm_mm * mm)
730 struct list_head *head = &mm->head_node.node_list;
732 return (head->next->next == head);
734 EXPORT_SYMBOL(drm_mm_clean);
737 * drm_mm_init - initialize a drm-mm allocator
738 * @mm: the drm_mm structure to initialize
739 * @start: start of the range managed by @mm
740 * @size: end of the range managed by @mm
742 * Note that @mm must be cleared to 0 before calling this function.
744 void drm_mm_init(struct drm_mm * mm, u64 start, u64 size)
746 INIT_LIST_HEAD(&mm->hole_stack);
747 mm->scanned_blocks = 0;
749 /* Clever trick to avoid a special case in the free hole tracking. */
750 INIT_LIST_HEAD(&mm->head_node.node_list);
751 INIT_LIST_HEAD(&mm->head_node.hole_stack);
752 mm->head_node.hole_follows = 1;
753 mm->head_node.scanned_block = 0;
754 mm->head_node.scanned_prev_free = 0;
755 mm->head_node.scanned_next_free = 0;
756 mm->head_node.mm = mm;
757 mm->head_node.start = start + size;
758 mm->head_node.size = start - mm->head_node.start;
759 list_add_tail(&mm->head_node.hole_stack, &mm->hole_stack);
761 mm->color_adjust = NULL;
763 EXPORT_SYMBOL(drm_mm_init);
766 * drm_mm_takedown - clean up a drm_mm allocator
767 * @mm: drm_mm allocator to clean up
769 * Note that it is a bug to call this function on an allocator which is not
772 void drm_mm_takedown(struct drm_mm * mm)
774 WARN(!list_empty(&mm->head_node.node_list),
775 "Memory manager not clean during takedown.\n");
777 EXPORT_SYMBOL(drm_mm_takedown);
779 static u64 drm_mm_debug_hole(struct drm_mm_node *entry,
782 u64 hole_start, hole_end, hole_size;
784 if (entry->hole_follows) {
785 hole_start = drm_mm_hole_node_start(entry);
786 hole_end = drm_mm_hole_node_end(entry);
787 hole_size = hole_end - hole_start;
788 pr_debug("%s %#llx-%#llx: %llu: free\n", prefix, hole_start,
789 hole_end, hole_size);
797 * drm_mm_debug_table - dump allocator state to dmesg
798 * @mm: drm_mm allocator to dump
799 * @prefix: prefix to use for dumping to dmesg
801 void drm_mm_debug_table(struct drm_mm *mm, const char *prefix)
803 struct drm_mm_node *entry;
804 u64 total_used = 0, total_free = 0, total = 0;
806 total_free += drm_mm_debug_hole(&mm->head_node, prefix);
808 drm_mm_for_each_node(entry, mm) {
809 pr_debug("%s %#llx-%#llx: %llu: used\n", prefix, entry->start,
810 entry->start + entry->size, entry->size);
811 total_used += entry->size;
812 total_free += drm_mm_debug_hole(entry, prefix);
814 total = total_free + total_used;
816 pr_debug("%s total: %llu, used %llu free %llu\n", prefix, total,
817 total_used, total_free);
819 EXPORT_SYMBOL(drm_mm_debug_table);
821 #if defined(CONFIG_DEBUG_FS)
822 static u64 drm_mm_dump_hole(struct seq_file *m, struct drm_mm_node *entry)
824 u64 hole_start, hole_end, hole_size;
826 if (entry->hole_follows) {
827 hole_start = drm_mm_hole_node_start(entry);
828 hole_end = drm_mm_hole_node_end(entry);
829 hole_size = hole_end - hole_start;
830 seq_printf(m, "%#018llx-%#018llx: %llu: free\n", hole_start,
831 hole_end, hole_size);
839 * drm_mm_dump_table - dump allocator state to a seq_file
840 * @m: seq_file to dump to
841 * @mm: drm_mm allocator to dump
843 int drm_mm_dump_table(struct seq_file *m, struct drm_mm *mm)
845 struct drm_mm_node *entry;
846 u64 total_used = 0, total_free = 0, total = 0;
848 total_free += drm_mm_dump_hole(m, &mm->head_node);
850 drm_mm_for_each_node(entry, mm) {
851 seq_printf(m, "%#018llx-%#018llx: %llu: used\n", entry->start,
852 entry->start + entry->size, entry->size);
853 total_used += entry->size;
854 total_free += drm_mm_dump_hole(m, entry);
856 total = total_free + total_used;
858 seq_printf(m, "total: %llu, used %llu free %llu\n", total,
859 total_used, total_free);
862 EXPORT_SYMBOL(drm_mm_dump_table);