1249d6048SJerome Glisse /************************************************************************** 2249d6048SJerome Glisse * 3249d6048SJerome Glisse * Copyright 2006-2008 Tungsten Graphics, Inc., Cedar Park, TX. USA. 4249d6048SJerome Glisse * All Rights Reserved. 5249d6048SJerome Glisse * 6249d6048SJerome Glisse * Permission is hereby granted, free of charge, to any person obtaining a 7249d6048SJerome Glisse * copy of this software and associated documentation files (the 8249d6048SJerome Glisse * "Software"), to deal in the Software without restriction, including 9249d6048SJerome Glisse * without limitation the rights to use, copy, modify, merge, publish, 10249d6048SJerome Glisse * distribute, sub license, and/or sell copies of the Software, and to 11249d6048SJerome Glisse * permit persons to whom the Software is furnished to do so, subject to 12249d6048SJerome Glisse * the following conditions: 13249d6048SJerome Glisse * 14249d6048SJerome Glisse * The above copyright notice and this permission notice (including the 15249d6048SJerome Glisse * next paragraph) shall be included in all copies or substantial portions 16249d6048SJerome Glisse * of the Software. 17249d6048SJerome Glisse * 18249d6048SJerome Glisse * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 19249d6048SJerome Glisse * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 20249d6048SJerome Glisse * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL 21249d6048SJerome Glisse * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, 22249d6048SJerome Glisse * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR 23249d6048SJerome Glisse * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE 24249d6048SJerome Glisse * USE OR OTHER DEALINGS IN THE SOFTWARE. 25249d6048SJerome Glisse * 26249d6048SJerome Glisse * 27249d6048SJerome Glisse **************************************************************************/ 28249d6048SJerome Glisse /* 29249d6048SJerome Glisse * Authors: 30249d6048SJerome Glisse * Thomas Hellstrom <thomas-at-tungstengraphics-dot-com> 31249d6048SJerome Glisse */ 32249d6048SJerome Glisse 33249d6048SJerome Glisse #ifndef _DRM_MM_H_ 34249d6048SJerome Glisse #define _DRM_MM_H_ 35249d6048SJerome Glisse 36249d6048SJerome Glisse /* 37249d6048SJerome Glisse * Generic range manager structs 38249d6048SJerome Glisse */ 3986e81f0eSDavid Herrmann #include <linux/bug.h> 40202b52b7SChris Wilson #include <linux/rbtree.h> 4186e81f0eSDavid Herrmann #include <linux/kernel.h> 42249d6048SJerome Glisse #include <linux/list.h> 4386e81f0eSDavid Herrmann #include <linux/spinlock.h> 44f1938cd6SDave Airlie #ifdef CONFIG_DEBUG_FS 45f1938cd6SDave Airlie #include <linux/seq_file.h> 46f1938cd6SDave Airlie #endif 475705670dSChris Wilson #ifdef CONFIG_DRM_DEBUG_MM 485705670dSChris Wilson #include <linux/stackdepot.h> 495705670dSChris Wilson #endif 50249d6048SJerome Glisse 5131e5d7c6SDavid Herrmann enum drm_mm_search_flags { 5231e5d7c6SDavid Herrmann DRM_MM_SEARCH_DEFAULT = 0, 5331e5d7c6SDavid Herrmann DRM_MM_SEARCH_BEST = 1 << 0, 5462347f9eSLauri Kasanen DRM_MM_SEARCH_BELOW = 1 << 1, 5531e5d7c6SDavid Herrmann }; 5631e5d7c6SDavid Herrmann 5762347f9eSLauri Kasanen enum drm_mm_allocator_flags { 5862347f9eSLauri Kasanen DRM_MM_CREATE_DEFAULT = 0, 5962347f9eSLauri Kasanen DRM_MM_CREATE_TOP = 1 << 0, 6062347f9eSLauri Kasanen }; 6162347f9eSLauri Kasanen 6262347f9eSLauri Kasanen #define DRM_MM_BOTTOMUP DRM_MM_SEARCH_DEFAULT, DRM_MM_CREATE_DEFAULT 6362347f9eSLauri Kasanen #define DRM_MM_TOPDOWN DRM_MM_SEARCH_BELOW, DRM_MM_CREATE_TOP 6462347f9eSLauri Kasanen 65249d6048SJerome Glisse struct drm_mm_node { 66d1024ce9SDaniel Vetter struct list_head node_list; 67ea7b1dd4SDaniel Vetter struct list_head hole_stack; 68202b52b7SChris Wilson struct rb_node rb; 69ea7b1dd4SDaniel Vetter unsigned hole_follows : 1; 70709ea971SDaniel Vetter unsigned scanned_block : 1; 71709ea971SDaniel Vetter unsigned scanned_prev_free : 1; 72709ea971SDaniel Vetter unsigned scanned_next_free : 1; 73ea7b1dd4SDaniel Vetter unsigned scanned_preceeds_hole : 1; 74b0b7af18SDaniel Vetter unsigned allocated : 1; 756b9d89b4SChris Wilson unsigned long color; 76440fd528SThierry Reding u64 start; 77440fd528SThierry Reding u64 size; 78202b52b7SChris Wilson u64 __subtree_last; 79249d6048SJerome Glisse struct drm_mm *mm; 805705670dSChris Wilson #ifdef CONFIG_DRM_DEBUG_MM 815705670dSChris Wilson depot_stack_handle_t stack; 825705670dSChris Wilson #endif 83249d6048SJerome Glisse }; 84249d6048SJerome Glisse 85249d6048SJerome Glisse struct drm_mm { 8625985edcSLucas De Marchi /* List of all memory nodes that immediately precede a free hole. */ 87ea7b1dd4SDaniel Vetter struct list_head hole_stack; 88ea7b1dd4SDaniel Vetter /* head_node.node_list is the list of all memory nodes, ordered 89ea7b1dd4SDaniel Vetter * according to the (increasing) start address of the memory node. */ 90ea7b1dd4SDaniel Vetter struct drm_mm_node head_node; 91202b52b7SChris Wilson /* Keep an interval_tree for fast lookup of drm_mm_nodes by address. */ 92202b52b7SChris Wilson struct rb_root interval_tree; 93202b52b7SChris Wilson 94d935cc61SDaniel Vetter unsigned int scan_check_range : 1; 95709ea971SDaniel Vetter unsigned scan_alignment; 966b9d89b4SChris Wilson unsigned long scan_color; 97440fd528SThierry Reding u64 scan_size; 98440fd528SThierry Reding u64 scan_hit_start; 99440fd528SThierry Reding u64 scan_hit_end; 100709ea971SDaniel Vetter unsigned scanned_blocks; 101440fd528SThierry Reding u64 scan_start; 102440fd528SThierry Reding u64 scan_end; 103ae0cec28SDaniel Vetter struct drm_mm_node *prev_scanned_node; 1046b9d89b4SChris Wilson 10545b186f1SChris Wilson void (*color_adjust)(const struct drm_mm_node *node, 10645b186f1SChris Wilson unsigned long color, 107440fd528SThierry Reding u64 *start, u64 *end); 108249d6048SJerome Glisse }; 109249d6048SJerome Glisse 110e18c0412SDaniel Vetter /** 111e18c0412SDaniel Vetter * drm_mm_node_allocated - checks whether a node is allocated 112e18c0412SDaniel Vetter * @node: drm_mm_node to check 113e18c0412SDaniel Vetter * 114e18c0412SDaniel Vetter * Drivers should use this helpers for proper encapusulation of drm_mm 115e18c0412SDaniel Vetter * internals. 116e18c0412SDaniel Vetter * 117e18c0412SDaniel Vetter * Returns: 118e18c0412SDaniel Vetter * True if the @node is allocated. 119e18c0412SDaniel Vetter */ 12045b186f1SChris Wilson static inline bool drm_mm_node_allocated(const struct drm_mm_node *node) 121b0b7af18SDaniel Vetter { 122b0b7af18SDaniel Vetter return node->allocated; 123b0b7af18SDaniel Vetter } 124b0b7af18SDaniel Vetter 125e18c0412SDaniel Vetter /** 126e18c0412SDaniel Vetter * drm_mm_initialized - checks whether an allocator is initialized 127e18c0412SDaniel Vetter * @mm: drm_mm to check 128e18c0412SDaniel Vetter * 129e18c0412SDaniel Vetter * Drivers should use this helpers for proper encapusulation of drm_mm 130e18c0412SDaniel Vetter * internals. 131e18c0412SDaniel Vetter * 132e18c0412SDaniel Vetter * Returns: 133e18c0412SDaniel Vetter * True if the @mm is initialized. 134e18c0412SDaniel Vetter */ 13545b186f1SChris Wilson static inline bool drm_mm_initialized(const struct drm_mm *mm) 13631a5b8ceSDaniel Vetter { 137ea7b1dd4SDaniel Vetter return mm->hole_stack.next; 13831a5b8ceSDaniel Vetter } 1399e8944abSChris Wilson 14045b186f1SChris Wilson static inline u64 __drm_mm_hole_node_start(const struct drm_mm_node *hole_node) 1419e8944abSChris Wilson { 1429e8944abSChris Wilson return hole_node->start + hole_node->size; 1439e8944abSChris Wilson } 1449e8944abSChris Wilson 145e18c0412SDaniel Vetter /** 146e18c0412SDaniel Vetter * drm_mm_hole_node_start - computes the start of the hole following @node 147e18c0412SDaniel Vetter * @hole_node: drm_mm_node which implicitly tracks the following hole 148e18c0412SDaniel Vetter * 149e18c0412SDaniel Vetter * This is useful for driver-sepific debug dumpers. Otherwise drivers should not 150e18c0412SDaniel Vetter * inspect holes themselves. Drivers must check first whether a hole indeed 151e18c0412SDaniel Vetter * follows by looking at node->hole_follows. 152e18c0412SDaniel Vetter * 153e18c0412SDaniel Vetter * Returns: 154e18c0412SDaniel Vetter * Start of the subsequent hole. 155e18c0412SDaniel Vetter */ 15645b186f1SChris Wilson static inline u64 drm_mm_hole_node_start(const struct drm_mm_node *hole_node) 1579e8944abSChris Wilson { 1589e8944abSChris Wilson BUG_ON(!hole_node->hole_follows); 1599e8944abSChris Wilson return __drm_mm_hole_node_start(hole_node); 1609e8944abSChris Wilson } 1619e8944abSChris Wilson 16245b186f1SChris Wilson static inline u64 __drm_mm_hole_node_end(const struct drm_mm_node *hole_node) 1639e8944abSChris Wilson { 16487069f44SGeliang Tang return list_next_entry(hole_node, node_list)->start; 1659e8944abSChris Wilson } 1669e8944abSChris Wilson 167e18c0412SDaniel Vetter /** 168e18c0412SDaniel Vetter * drm_mm_hole_node_end - computes the end of the hole following @node 169e18c0412SDaniel Vetter * @hole_node: drm_mm_node which implicitly tracks the following hole 170e18c0412SDaniel Vetter * 171e18c0412SDaniel Vetter * This is useful for driver-sepific debug dumpers. Otherwise drivers should not 172e18c0412SDaniel Vetter * inspect holes themselves. Drivers must check first whether a hole indeed 173e18c0412SDaniel Vetter * follows by looking at node->hole_follows. 174e18c0412SDaniel Vetter * 175e18c0412SDaniel Vetter * Returns: 176e18c0412SDaniel Vetter * End of the subsequent hole. 177e18c0412SDaniel Vetter */ 17845b186f1SChris Wilson static inline u64 drm_mm_hole_node_end(const struct drm_mm_node *hole_node) 1799e8944abSChris Wilson { 1809e8944abSChris Wilson return __drm_mm_hole_node_end(hole_node); 1819e8944abSChris Wilson } 1829e8944abSChris Wilson 1832bc98c86SChris Wilson /** 1842bc98c86SChris Wilson * drm_mm_nodes - list of nodes under the drm_mm range manager 1852bc98c86SChris Wilson * @mm: the struct drm_mm range manger 1862bc98c86SChris Wilson * 1872bc98c86SChris Wilson * As the drm_mm range manager hides its node_list deep with its 1882bc98c86SChris Wilson * structure, extracting it looks painful and repetitive. This is 1892bc98c86SChris Wilson * not expected to be used outside of the drm_mm_for_each_node() 1902bc98c86SChris Wilson * macros and similar internal functions. 1912bc98c86SChris Wilson * 1922bc98c86SChris Wilson * Returns: 1932bc98c86SChris Wilson * The node list, may be empty. 1942bc98c86SChris Wilson */ 1952bc98c86SChris Wilson #define drm_mm_nodes(mm) (&(mm)->head_node.node_list) 196ad579002SChris Wilson 197e18c0412SDaniel Vetter /** 198e18c0412SDaniel Vetter * drm_mm_for_each_node - iterator to walk over all allocated nodes 199e18c0412SDaniel Vetter * @entry: drm_mm_node structure to assign to in each iteration step 200e18c0412SDaniel Vetter * @mm: drm_mm allocator to walk 201e18c0412SDaniel Vetter * 202e18c0412SDaniel Vetter * This iterator walks over all nodes in the range allocator. It is implemented 203e18c0412SDaniel Vetter * with list_for_each, so not save against removal of elements. 204e18c0412SDaniel Vetter */ 205ad579002SChris Wilson #define drm_mm_for_each_node(entry, mm) \ 2062bc98c86SChris Wilson list_for_each_entry(entry, drm_mm_nodes(mm), node_list) 207ad579002SChris Wilson 208ad579002SChris Wilson /** 209ad579002SChris Wilson * drm_mm_for_each_node_safe - iterator to walk over all allocated nodes 210ad579002SChris Wilson * @entry: drm_mm_node structure to assign to in each iteration step 211ad579002SChris Wilson * @next: drm_mm_node structure to store the next step 212ad579002SChris Wilson * @mm: drm_mm allocator to walk 213ad579002SChris Wilson * 214ad579002SChris Wilson * This iterator walks over all nodes in the range allocator. It is implemented 215ad579002SChris Wilson * with list_for_each_safe, so save against removal of elements. 216ad579002SChris Wilson */ 217ad579002SChris Wilson #define drm_mm_for_each_node_safe(entry, next, mm) \ 2182bc98c86SChris Wilson list_for_each_entry_safe(entry, next, drm_mm_nodes(mm), node_list) 2199e8944abSChris Wilson 22018b40c58SGeliang Tang #define __drm_mm_for_each_hole(entry, mm, hole_start, hole_end, backwards) \ 22118b40c58SGeliang Tang for (entry = list_entry((backwards) ? (mm)->hole_stack.prev : (mm)->hole_stack.next, struct drm_mm_node, hole_stack); \ 22218b40c58SGeliang Tang &entry->hole_stack != &(mm)->hole_stack ? \ 22318b40c58SGeliang Tang hole_start = drm_mm_hole_node_start(entry), \ 22418b40c58SGeliang Tang hole_end = drm_mm_hole_node_end(entry), \ 22518b40c58SGeliang Tang 1 : 0; \ 22618b40c58SGeliang Tang entry = list_entry((backwards) ? entry->hole_stack.prev : entry->hole_stack.next, struct drm_mm_node, hole_stack)) 22718b40c58SGeliang Tang 228e18c0412SDaniel Vetter /** 229e18c0412SDaniel Vetter * drm_mm_for_each_hole - iterator to walk over all holes 230e18c0412SDaniel Vetter * @entry: drm_mm_node used internally to track progress 231e18c0412SDaniel Vetter * @mm: drm_mm allocator to walk 232e18c0412SDaniel Vetter * @hole_start: ulong variable to assign the hole start to on each iteration 233e18c0412SDaniel Vetter * @hole_end: ulong variable to assign the hole end to on each iteration 234e18c0412SDaniel Vetter * 235e18c0412SDaniel Vetter * This iterator walks over all holes in the range allocator. It is implemented 236e18c0412SDaniel Vetter * with list_for_each, so not save against removal of elements. @entry is used 237e18c0412SDaniel Vetter * internally and will not reflect a real drm_mm_node for the very first hole. 238e18c0412SDaniel Vetter * Hence users of this iterator may not access it. 239e18c0412SDaniel Vetter * 240e18c0412SDaniel Vetter * Implementation Note: 241e18c0412SDaniel Vetter * We need to inline list_for_each_entry in order to be able to set hole_start 242e18c0412SDaniel Vetter * and hole_end on each iteration while keeping the macro sane. 24362347f9eSLauri Kasanen * 24462347f9eSLauri Kasanen * The __drm_mm_for_each_hole version is similar, but with added support for 24562347f9eSLauri Kasanen * going backwards. 2469e8944abSChris Wilson */ 2479e8944abSChris Wilson #define drm_mm_for_each_hole(entry, mm, hole_start, hole_end) \ 24818b40c58SGeliang Tang __drm_mm_for_each_hole(entry, mm, hole_start, hole_end, 0) 24962347f9eSLauri Kasanen 250249d6048SJerome Glisse /* 251249d6048SJerome Glisse * Basic range manager support (drm_mm.c) 252249d6048SJerome Glisse */ 253e18c0412SDaniel Vetter int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node); 254b8103450SChris Wilson 255e18c0412SDaniel Vetter int drm_mm_insert_node_generic(struct drm_mm *mm, 256b8103450SChris Wilson struct drm_mm_node *node, 257440fd528SThierry Reding u64 size, 258b8103450SChris Wilson unsigned alignment, 25931e5d7c6SDavid Herrmann unsigned long color, 26062347f9eSLauri Kasanen enum drm_mm_search_flags sflags, 26162347f9eSLauri Kasanen enum drm_mm_allocator_flags aflags); 262e18c0412SDaniel Vetter /** 263e18c0412SDaniel Vetter * drm_mm_insert_node - search for space and insert @node 264e18c0412SDaniel Vetter * @mm: drm_mm to allocate from 265e18c0412SDaniel Vetter * @node: preallocate node to insert 266e18c0412SDaniel Vetter * @size: size of the allocation 267e18c0412SDaniel Vetter * @alignment: alignment of the allocation 268e18c0412SDaniel Vetter * @flags: flags to fine-tune the allocation 269e18c0412SDaniel Vetter * 270e18c0412SDaniel Vetter * This is a simplified version of drm_mm_insert_node_generic() with @color set 271e18c0412SDaniel Vetter * to 0. 272e18c0412SDaniel Vetter * 273e18c0412SDaniel Vetter * The preallocated node must be cleared to 0. 274e18c0412SDaniel Vetter * 275e18c0412SDaniel Vetter * Returns: 276e18c0412SDaniel Vetter * 0 on success, -ENOSPC if there's no suitable hole. 277e18c0412SDaniel Vetter */ 27831e5d7c6SDavid Herrmann static inline int drm_mm_insert_node(struct drm_mm *mm, 27931e5d7c6SDavid Herrmann struct drm_mm_node *node, 280440fd528SThierry Reding u64 size, 28131e5d7c6SDavid Herrmann unsigned alignment, 28231e5d7c6SDavid Herrmann enum drm_mm_search_flags flags) 28331e5d7c6SDavid Herrmann { 28462347f9eSLauri Kasanen return drm_mm_insert_node_generic(mm, node, size, alignment, 0, flags, 28562347f9eSLauri Kasanen DRM_MM_CREATE_DEFAULT); 28631e5d7c6SDavid Herrmann } 28731e5d7c6SDavid Herrmann 288e18c0412SDaniel Vetter int drm_mm_insert_node_in_range_generic(struct drm_mm *mm, 289b8103450SChris Wilson struct drm_mm_node *node, 290440fd528SThierry Reding u64 size, 291b8103450SChris Wilson unsigned alignment, 292b8103450SChris Wilson unsigned long color, 293440fd528SThierry Reding u64 start, 294440fd528SThierry Reding u64 end, 29562347f9eSLauri Kasanen enum drm_mm_search_flags sflags, 29662347f9eSLauri Kasanen enum drm_mm_allocator_flags aflags); 297e18c0412SDaniel Vetter /** 298e18c0412SDaniel Vetter * drm_mm_insert_node_in_range - ranged search for space and insert @node 299e18c0412SDaniel Vetter * @mm: drm_mm to allocate from 300e18c0412SDaniel Vetter * @node: preallocate node to insert 301e18c0412SDaniel Vetter * @size: size of the allocation 302e18c0412SDaniel Vetter * @alignment: alignment of the allocation 303e18c0412SDaniel Vetter * @start: start of the allowed range for this node 304e18c0412SDaniel Vetter * @end: end of the allowed range for this node 305e18c0412SDaniel Vetter * @flags: flags to fine-tune the allocation 306e18c0412SDaniel Vetter * 307e18c0412SDaniel Vetter * This is a simplified version of drm_mm_insert_node_in_range_generic() with 308e18c0412SDaniel Vetter * @color set to 0. 309e18c0412SDaniel Vetter * 310e18c0412SDaniel Vetter * The preallocated node must be cleared to 0. 311e18c0412SDaniel Vetter * 312e18c0412SDaniel Vetter * Returns: 313e18c0412SDaniel Vetter * 0 on success, -ENOSPC if there's no suitable hole. 314e18c0412SDaniel Vetter */ 31531e5d7c6SDavid Herrmann static inline int drm_mm_insert_node_in_range(struct drm_mm *mm, 31631e5d7c6SDavid Herrmann struct drm_mm_node *node, 317440fd528SThierry Reding u64 size, 31831e5d7c6SDavid Herrmann unsigned alignment, 319440fd528SThierry Reding u64 start, 320440fd528SThierry Reding u64 end, 32131e5d7c6SDavid Herrmann enum drm_mm_search_flags flags) 32231e5d7c6SDavid Herrmann { 32331e5d7c6SDavid Herrmann return drm_mm_insert_node_in_range_generic(mm, node, size, alignment, 32462347f9eSLauri Kasanen 0, start, end, flags, 32562347f9eSLauri Kasanen DRM_MM_CREATE_DEFAULT); 32631e5d7c6SDavid Herrmann } 32731e5d7c6SDavid Herrmann 328e18c0412SDaniel Vetter void drm_mm_remove_node(struct drm_mm_node *node); 329e18c0412SDaniel Vetter void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new); 33045b186f1SChris Wilson void drm_mm_init(struct drm_mm *mm, u64 start, u64 size); 331e18c0412SDaniel Vetter void drm_mm_takedown(struct drm_mm *mm); 33245b186f1SChris Wilson bool drm_mm_clean(const struct drm_mm *mm); 333249d6048SJerome Glisse 334202b52b7SChris Wilson struct drm_mm_node * 33545b186f1SChris Wilson __drm_mm_interval_first(const struct drm_mm *mm, u64 start, u64 last); 336202b52b7SChris Wilson 337522e85ddSChris Wilson /** 338522e85ddSChris Wilson * drm_mm_for_each_node_in_range - iterator to walk over a range of 339522e85ddSChris Wilson * allocated nodes 3408b2fb7b6SChris Wilson * @node__: drm_mm_node structure to assign to in each iteration step 3418b2fb7b6SChris Wilson * @mm__: drm_mm allocator to walk 3428b2fb7b6SChris Wilson * @start__: starting offset, the first node will overlap this 3438b2fb7b6SChris Wilson * @end__: ending offset, the last node will start before this (but may overlap) 344522e85ddSChris Wilson * 345522e85ddSChris Wilson * This iterator walks over all nodes in the range allocator that lie 346522e85ddSChris Wilson * between @start and @end. It is implemented similarly to list_for_each(), 347522e85ddSChris Wilson * but using the internal interval tree to accelerate the search for the 348522e85ddSChris Wilson * starting node, and so not safe against removal of elements. It assumes 349522e85ddSChris Wilson * that @end is within (or is the upper limit of) the drm_mm allocator. 350522e85ddSChris Wilson */ 3518b2fb7b6SChris Wilson #define drm_mm_for_each_node_in_range(node__, mm__, start__, end__) \ 3528b2fb7b6SChris Wilson for (node__ = __drm_mm_interval_first((mm__), (start__), (end__)-1); \ 3538b2fb7b6SChris Wilson node__ && node__->start < (end__); \ 3548b2fb7b6SChris Wilson node__ = list_next_entry(node__, node_list)) 355202b52b7SChris Wilson 3566b9d89b4SChris Wilson void drm_mm_init_scan(struct drm_mm *mm, 357440fd528SThierry Reding u64 size, 358d935cc61SDaniel Vetter unsigned alignment, 3596b9d89b4SChris Wilson unsigned long color); 3606b9d89b4SChris Wilson void drm_mm_init_scan_with_range(struct drm_mm *mm, 361440fd528SThierry Reding u64 size, 3626b9d89b4SChris Wilson unsigned alignment, 3636b9d89b4SChris Wilson unsigned long color, 364440fd528SThierry Reding u64 start, 365440fd528SThierry Reding u64 end); 366e18c0412SDaniel Vetter bool drm_mm_scan_add_block(struct drm_mm_node *node); 367e18c0412SDaniel Vetter bool drm_mm_scan_remove_block(struct drm_mm_node *node); 368709ea971SDaniel Vetter 36945b186f1SChris Wilson void drm_mm_debug_table(const struct drm_mm *mm, const char *prefix); 370fa8a1238SDave Airlie #ifdef CONFIG_DEBUG_FS 37145b186f1SChris Wilson int drm_mm_dump_table(struct seq_file *m, const struct drm_mm *mm); 372fa8a1238SDave Airlie #endif 373fa8a1238SDave Airlie 374249d6048SJerome Glisse #endif 375