1249d6048SJerome Glisse /************************************************************************** 2249d6048SJerome Glisse * 3249d6048SJerome Glisse * Copyright 2006-2008 Tungsten Graphics, Inc., Cedar Park, TX. USA. 4ba004e39SChris Wilson * Copyright 2016 Intel Corporation 5249d6048SJerome Glisse * All Rights Reserved. 6249d6048SJerome Glisse * 7249d6048SJerome Glisse * Permission is hereby granted, free of charge, to any person obtaining a 8249d6048SJerome Glisse * copy of this software and associated documentation files (the 9249d6048SJerome Glisse * "Software"), to deal in the Software without restriction, including 10249d6048SJerome Glisse * without limitation the rights to use, copy, modify, merge, publish, 11249d6048SJerome Glisse * distribute, sub license, and/or sell copies of the Software, and to 12249d6048SJerome Glisse * permit persons to whom the Software is furnished to do so, subject to 13249d6048SJerome Glisse * the following conditions: 14249d6048SJerome Glisse * 15249d6048SJerome Glisse * The above copyright notice and this permission notice (including the 16249d6048SJerome Glisse * next paragraph) shall be included in all copies or substantial portions 17249d6048SJerome Glisse * of the Software. 18249d6048SJerome Glisse * 19249d6048SJerome Glisse * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 20249d6048SJerome Glisse * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 21249d6048SJerome Glisse * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL 22249d6048SJerome Glisse * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, 23249d6048SJerome Glisse * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR 24249d6048SJerome Glisse * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE 25249d6048SJerome Glisse * USE OR OTHER DEALINGS IN THE SOFTWARE. 26249d6048SJerome Glisse * 27249d6048SJerome Glisse * 28249d6048SJerome Glisse **************************************************************************/ 29249d6048SJerome Glisse /* 30249d6048SJerome Glisse * Authors: 31249d6048SJerome Glisse * Thomas Hellstrom <thomas-at-tungstengraphics-dot-com> 32249d6048SJerome Glisse */ 33249d6048SJerome Glisse 34249d6048SJerome Glisse #ifndef _DRM_MM_H_ 35249d6048SJerome Glisse #define _DRM_MM_H_ 36249d6048SJerome Glisse 37249d6048SJerome Glisse /* 38249d6048SJerome Glisse * Generic range manager structs 39249d6048SJerome Glisse */ 4086e81f0eSDavid Herrmann #include <linux/bug.h> 41202b52b7SChris Wilson #include <linux/rbtree.h> 4286e81f0eSDavid Herrmann #include <linux/kernel.h> 43249d6048SJerome Glisse #include <linux/list.h> 4486e81f0eSDavid Herrmann #include <linux/spinlock.h> 45f1938cd6SDave Airlie #ifdef CONFIG_DEBUG_FS 46f1938cd6SDave Airlie #include <linux/seq_file.h> 47f1938cd6SDave Airlie #endif 485705670dSChris Wilson #ifdef CONFIG_DRM_DEBUG_MM 495705670dSChris Wilson #include <linux/stackdepot.h> 505705670dSChris Wilson #endif 51249d6048SJerome Glisse 52b3ee963fSChris Wilson #ifdef CONFIG_DRM_DEBUG_MM 53b3ee963fSChris Wilson #define DRM_MM_BUG_ON(expr) BUG_ON(expr) 54b3ee963fSChris Wilson #else 55b3ee963fSChris Wilson #define DRM_MM_BUG_ON(expr) BUILD_BUG_ON_INVALID(expr) 56b3ee963fSChris Wilson #endif 57b3ee963fSChris Wilson 5831e5d7c6SDavid Herrmann enum drm_mm_search_flags { 5931e5d7c6SDavid Herrmann DRM_MM_SEARCH_DEFAULT = 0, 6031e5d7c6SDavid Herrmann DRM_MM_SEARCH_BEST = 1 << 0, 6162347f9eSLauri Kasanen DRM_MM_SEARCH_BELOW = 1 << 1, 6231e5d7c6SDavid Herrmann }; 6331e5d7c6SDavid Herrmann 6462347f9eSLauri Kasanen enum drm_mm_allocator_flags { 6562347f9eSLauri Kasanen DRM_MM_CREATE_DEFAULT = 0, 6662347f9eSLauri Kasanen DRM_MM_CREATE_TOP = 1 << 0, 6762347f9eSLauri Kasanen }; 6862347f9eSLauri Kasanen 6962347f9eSLauri Kasanen #define DRM_MM_BOTTOMUP DRM_MM_SEARCH_DEFAULT, DRM_MM_CREATE_DEFAULT 7062347f9eSLauri Kasanen #define DRM_MM_TOPDOWN DRM_MM_SEARCH_BELOW, DRM_MM_CREATE_TOP 7162347f9eSLauri Kasanen 72249d6048SJerome Glisse struct drm_mm_node { 73d1024ce9SDaniel Vetter struct list_head node_list; 74ea7b1dd4SDaniel Vetter struct list_head hole_stack; 75202b52b7SChris Wilson struct rb_node rb; 76ea7b1dd4SDaniel Vetter unsigned hole_follows : 1; 77709ea971SDaniel Vetter unsigned scanned_block : 1; 78709ea971SDaniel Vetter unsigned scanned_prev_free : 1; 79709ea971SDaniel Vetter unsigned scanned_next_free : 1; 80ea7b1dd4SDaniel Vetter unsigned scanned_preceeds_hole : 1; 81b0b7af18SDaniel Vetter unsigned allocated : 1; 826b9d89b4SChris Wilson unsigned long color; 83440fd528SThierry Reding u64 start; 84440fd528SThierry Reding u64 size; 85202b52b7SChris Wilson u64 __subtree_last; 86249d6048SJerome Glisse struct drm_mm *mm; 875705670dSChris Wilson #ifdef CONFIG_DRM_DEBUG_MM 885705670dSChris Wilson depot_stack_handle_t stack; 895705670dSChris Wilson #endif 90249d6048SJerome Glisse }; 91249d6048SJerome Glisse 92249d6048SJerome Glisse struct drm_mm { 9325985edcSLucas De Marchi /* List of all memory nodes that immediately precede a free hole. */ 94ea7b1dd4SDaniel Vetter struct list_head hole_stack; 95ea7b1dd4SDaniel Vetter /* head_node.node_list is the list of all memory nodes, ordered 96ea7b1dd4SDaniel Vetter * according to the (increasing) start address of the memory node. */ 97ea7b1dd4SDaniel Vetter struct drm_mm_node head_node; 98202b52b7SChris Wilson /* Keep an interval_tree for fast lookup of drm_mm_nodes by address. */ 99202b52b7SChris Wilson struct rb_root interval_tree; 100202b52b7SChris Wilson 101d935cc61SDaniel Vetter unsigned int scan_check_range : 1; 10271733207SChris Wilson unsigned int scanned_blocks; 1036b9d89b4SChris Wilson unsigned long scan_color; 10471733207SChris Wilson u64 scan_alignment; 105440fd528SThierry Reding u64 scan_size; 106440fd528SThierry Reding u64 scan_hit_start; 107440fd528SThierry Reding u64 scan_hit_end; 108440fd528SThierry Reding u64 scan_start; 109440fd528SThierry Reding u64 scan_end; 110ae0cec28SDaniel Vetter struct drm_mm_node *prev_scanned_node; 1116b9d89b4SChris Wilson 11245b186f1SChris Wilson void (*color_adjust)(const struct drm_mm_node *node, 11345b186f1SChris Wilson unsigned long color, 114440fd528SThierry Reding u64 *start, u64 *end); 115249d6048SJerome Glisse }; 116249d6048SJerome Glisse 117e18c0412SDaniel Vetter /** 118e18c0412SDaniel Vetter * drm_mm_node_allocated - checks whether a node is allocated 119e18c0412SDaniel Vetter * @node: drm_mm_node to check 120e18c0412SDaniel Vetter * 121ba004e39SChris Wilson * Drivers are required to clear a node prior to using it with the 122ba004e39SChris Wilson * drm_mm range manager. 123ba004e39SChris Wilson * 124ba004e39SChris Wilson * Drivers should use this helper for proper encapsulation of drm_mm 125e18c0412SDaniel Vetter * internals. 126e18c0412SDaniel Vetter * 127e18c0412SDaniel Vetter * Returns: 128e18c0412SDaniel Vetter * True if the @node is allocated. 129e18c0412SDaniel Vetter */ 13045b186f1SChris Wilson static inline bool drm_mm_node_allocated(const struct drm_mm_node *node) 131b0b7af18SDaniel Vetter { 132b0b7af18SDaniel Vetter return node->allocated; 133b0b7af18SDaniel Vetter } 134b0b7af18SDaniel Vetter 135e18c0412SDaniel Vetter /** 136e18c0412SDaniel Vetter * drm_mm_initialized - checks whether an allocator is initialized 137e18c0412SDaniel Vetter * @mm: drm_mm to check 138e18c0412SDaniel Vetter * 139ba004e39SChris Wilson * Drivers should clear the struct drm_mm prior to initialisation if they 140ba004e39SChris Wilson * want to use this function. 141ba004e39SChris Wilson * 142ba004e39SChris Wilson * Drivers should use this helper for proper encapsulation of drm_mm 143e18c0412SDaniel Vetter * internals. 144e18c0412SDaniel Vetter * 145e18c0412SDaniel Vetter * Returns: 146e18c0412SDaniel Vetter * True if the @mm is initialized. 147e18c0412SDaniel Vetter */ 14845b186f1SChris Wilson static inline bool drm_mm_initialized(const struct drm_mm *mm) 14931a5b8ceSDaniel Vetter { 150ea7b1dd4SDaniel Vetter return mm->hole_stack.next; 15131a5b8ceSDaniel Vetter } 1529e8944abSChris Wilson 15345b186f1SChris Wilson static inline u64 __drm_mm_hole_node_start(const struct drm_mm_node *hole_node) 1549e8944abSChris Wilson { 1559e8944abSChris Wilson return hole_node->start + hole_node->size; 1569e8944abSChris Wilson } 1579e8944abSChris Wilson 158e18c0412SDaniel Vetter /** 159e18c0412SDaniel Vetter * drm_mm_hole_node_start - computes the start of the hole following @node 160e18c0412SDaniel Vetter * @hole_node: drm_mm_node which implicitly tracks the following hole 161e18c0412SDaniel Vetter * 162ba004e39SChris Wilson * This is useful for driver-specific debug dumpers. Otherwise drivers should 163ba004e39SChris Wilson * not inspect holes themselves. Drivers must check first whether a hole indeed 164e18c0412SDaniel Vetter * follows by looking at node->hole_follows. 165e18c0412SDaniel Vetter * 166e18c0412SDaniel Vetter * Returns: 167e18c0412SDaniel Vetter * Start of the subsequent hole. 168e18c0412SDaniel Vetter */ 16945b186f1SChris Wilson static inline u64 drm_mm_hole_node_start(const struct drm_mm_node *hole_node) 1709e8944abSChris Wilson { 171b3ee963fSChris Wilson DRM_MM_BUG_ON(!hole_node->hole_follows); 1729e8944abSChris Wilson return __drm_mm_hole_node_start(hole_node); 1739e8944abSChris Wilson } 1749e8944abSChris Wilson 17545b186f1SChris Wilson static inline u64 __drm_mm_hole_node_end(const struct drm_mm_node *hole_node) 1769e8944abSChris Wilson { 17787069f44SGeliang Tang return list_next_entry(hole_node, node_list)->start; 1789e8944abSChris Wilson } 1799e8944abSChris Wilson 180e18c0412SDaniel Vetter /** 181e18c0412SDaniel Vetter * drm_mm_hole_node_end - computes the end of the hole following @node 182e18c0412SDaniel Vetter * @hole_node: drm_mm_node which implicitly tracks the following hole 183e18c0412SDaniel Vetter * 184ba004e39SChris Wilson * This is useful for driver-specific debug dumpers. Otherwise drivers should 185ba004e39SChris Wilson * not inspect holes themselves. Drivers must check first whether a hole indeed 186e18c0412SDaniel Vetter * follows by looking at node->hole_follows. 187e18c0412SDaniel Vetter * 188e18c0412SDaniel Vetter * Returns: 189e18c0412SDaniel Vetter * End of the subsequent hole. 190e18c0412SDaniel Vetter */ 19145b186f1SChris Wilson static inline u64 drm_mm_hole_node_end(const struct drm_mm_node *hole_node) 1929e8944abSChris Wilson { 1939e8944abSChris Wilson return __drm_mm_hole_node_end(hole_node); 1949e8944abSChris Wilson } 1959e8944abSChris Wilson 1962bc98c86SChris Wilson /** 1972bc98c86SChris Wilson * drm_mm_nodes - list of nodes under the drm_mm range manager 1982bc98c86SChris Wilson * @mm: the struct drm_mm range manger 1992bc98c86SChris Wilson * 2002bc98c86SChris Wilson * As the drm_mm range manager hides its node_list deep with its 2012bc98c86SChris Wilson * structure, extracting it looks painful and repetitive. This is 2022bc98c86SChris Wilson * not expected to be used outside of the drm_mm_for_each_node() 2032bc98c86SChris Wilson * macros and similar internal functions. 2042bc98c86SChris Wilson * 2052bc98c86SChris Wilson * Returns: 2062bc98c86SChris Wilson * The node list, may be empty. 2072bc98c86SChris Wilson */ 2082bc98c86SChris Wilson #define drm_mm_nodes(mm) (&(mm)->head_node.node_list) 209ad579002SChris Wilson 210e18c0412SDaniel Vetter /** 211e18c0412SDaniel Vetter * drm_mm_for_each_node - iterator to walk over all allocated nodes 212e18c0412SDaniel Vetter * @entry: drm_mm_node structure to assign to in each iteration step 213e18c0412SDaniel Vetter * @mm: drm_mm allocator to walk 214e18c0412SDaniel Vetter * 215e18c0412SDaniel Vetter * This iterator walks over all nodes in the range allocator. It is implemented 216e18c0412SDaniel Vetter * with list_for_each, so not save against removal of elements. 217e18c0412SDaniel Vetter */ 218ad579002SChris Wilson #define drm_mm_for_each_node(entry, mm) \ 2192bc98c86SChris Wilson list_for_each_entry(entry, drm_mm_nodes(mm), node_list) 220ad579002SChris Wilson 221ad579002SChris Wilson /** 222ad579002SChris Wilson * drm_mm_for_each_node_safe - iterator to walk over all allocated nodes 223ad579002SChris Wilson * @entry: drm_mm_node structure to assign to in each iteration step 224ad579002SChris Wilson * @next: drm_mm_node structure to store the next step 225ad579002SChris Wilson * @mm: drm_mm allocator to walk 226ad579002SChris Wilson * 227ad579002SChris Wilson * This iterator walks over all nodes in the range allocator. It is implemented 228ad579002SChris Wilson * with list_for_each_safe, so save against removal of elements. 229ad579002SChris Wilson */ 230ad579002SChris Wilson #define drm_mm_for_each_node_safe(entry, next, mm) \ 2312bc98c86SChris Wilson list_for_each_entry_safe(entry, next, drm_mm_nodes(mm), node_list) 2329e8944abSChris Wilson 23318b40c58SGeliang Tang #define __drm_mm_for_each_hole(entry, mm, hole_start, hole_end, backwards) \ 23418b40c58SGeliang Tang for (entry = list_entry((backwards) ? (mm)->hole_stack.prev : (mm)->hole_stack.next, struct drm_mm_node, hole_stack); \ 23518b40c58SGeliang Tang &entry->hole_stack != &(mm)->hole_stack ? \ 23618b40c58SGeliang Tang hole_start = drm_mm_hole_node_start(entry), \ 23718b40c58SGeliang Tang hole_end = drm_mm_hole_node_end(entry), \ 23818b40c58SGeliang Tang 1 : 0; \ 23918b40c58SGeliang Tang entry = list_entry((backwards) ? entry->hole_stack.prev : entry->hole_stack.next, struct drm_mm_node, hole_stack)) 24018b40c58SGeliang Tang 241e18c0412SDaniel Vetter /** 242e18c0412SDaniel Vetter * drm_mm_for_each_hole - iterator to walk over all holes 243e18c0412SDaniel Vetter * @entry: drm_mm_node used internally to track progress 244e18c0412SDaniel Vetter * @mm: drm_mm allocator to walk 245e18c0412SDaniel Vetter * @hole_start: ulong variable to assign the hole start to on each iteration 246e18c0412SDaniel Vetter * @hole_end: ulong variable to assign the hole end to on each iteration 247e18c0412SDaniel Vetter * 248e18c0412SDaniel Vetter * This iterator walks over all holes in the range allocator. It is implemented 249e18c0412SDaniel Vetter * with list_for_each, so not save against removal of elements. @entry is used 250e18c0412SDaniel Vetter * internally and will not reflect a real drm_mm_node for the very first hole. 251e18c0412SDaniel Vetter * Hence users of this iterator may not access it. 252e18c0412SDaniel Vetter * 253e18c0412SDaniel Vetter * Implementation Note: 254e18c0412SDaniel Vetter * We need to inline list_for_each_entry in order to be able to set hole_start 255e18c0412SDaniel Vetter * and hole_end on each iteration while keeping the macro sane. 25662347f9eSLauri Kasanen * 25762347f9eSLauri Kasanen * The __drm_mm_for_each_hole version is similar, but with added support for 25862347f9eSLauri Kasanen * going backwards. 2599e8944abSChris Wilson */ 2609e8944abSChris Wilson #define drm_mm_for_each_hole(entry, mm, hole_start, hole_end) \ 26118b40c58SGeliang Tang __drm_mm_for_each_hole(entry, mm, hole_start, hole_end, 0) 26262347f9eSLauri Kasanen 263249d6048SJerome Glisse /* 264249d6048SJerome Glisse * Basic range manager support (drm_mm.c) 265249d6048SJerome Glisse */ 266e18c0412SDaniel Vetter int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node); 267b8103450SChris Wilson 268e18c0412SDaniel Vetter int drm_mm_insert_node_generic(struct drm_mm *mm, 269b8103450SChris Wilson struct drm_mm_node *node, 270440fd528SThierry Reding u64 size, 27171733207SChris Wilson u64 alignment, 27231e5d7c6SDavid Herrmann unsigned long color, 27362347f9eSLauri Kasanen enum drm_mm_search_flags sflags, 27462347f9eSLauri Kasanen enum drm_mm_allocator_flags aflags); 275e18c0412SDaniel Vetter /** 276e18c0412SDaniel Vetter * drm_mm_insert_node - search for space and insert @node 277e18c0412SDaniel Vetter * @mm: drm_mm to allocate from 278e18c0412SDaniel Vetter * @node: preallocate node to insert 279e18c0412SDaniel Vetter * @size: size of the allocation 280e18c0412SDaniel Vetter * @alignment: alignment of the allocation 281e18c0412SDaniel Vetter * @flags: flags to fine-tune the allocation 282e18c0412SDaniel Vetter * 283e18c0412SDaniel Vetter * This is a simplified version of drm_mm_insert_node_generic() with @color set 284e18c0412SDaniel Vetter * to 0. 285e18c0412SDaniel Vetter * 286e18c0412SDaniel Vetter * The preallocated node must be cleared to 0. 287e18c0412SDaniel Vetter * 288e18c0412SDaniel Vetter * Returns: 289e18c0412SDaniel Vetter * 0 on success, -ENOSPC if there's no suitable hole. 290e18c0412SDaniel Vetter */ 29131e5d7c6SDavid Herrmann static inline int drm_mm_insert_node(struct drm_mm *mm, 29231e5d7c6SDavid Herrmann struct drm_mm_node *node, 293440fd528SThierry Reding u64 size, 29471733207SChris Wilson u64 alignment, 29531e5d7c6SDavid Herrmann enum drm_mm_search_flags flags) 29631e5d7c6SDavid Herrmann { 29762347f9eSLauri Kasanen return drm_mm_insert_node_generic(mm, node, size, alignment, 0, flags, 29862347f9eSLauri Kasanen DRM_MM_CREATE_DEFAULT); 29931e5d7c6SDavid Herrmann } 30031e5d7c6SDavid Herrmann 301e18c0412SDaniel Vetter int drm_mm_insert_node_in_range_generic(struct drm_mm *mm, 302b8103450SChris Wilson struct drm_mm_node *node, 303440fd528SThierry Reding u64 size, 30471733207SChris Wilson u64 alignment, 305b8103450SChris Wilson unsigned long color, 306440fd528SThierry Reding u64 start, 307440fd528SThierry Reding u64 end, 30862347f9eSLauri Kasanen enum drm_mm_search_flags sflags, 30962347f9eSLauri Kasanen enum drm_mm_allocator_flags aflags); 310e18c0412SDaniel Vetter /** 311e18c0412SDaniel Vetter * drm_mm_insert_node_in_range - ranged search for space and insert @node 312e18c0412SDaniel Vetter * @mm: drm_mm to allocate from 313e18c0412SDaniel Vetter * @node: preallocate node to insert 314e18c0412SDaniel Vetter * @size: size of the allocation 315e18c0412SDaniel Vetter * @alignment: alignment of the allocation 316e18c0412SDaniel Vetter * @start: start of the allowed range for this node 317e18c0412SDaniel Vetter * @end: end of the allowed range for this node 318e18c0412SDaniel Vetter * @flags: flags to fine-tune the allocation 319e18c0412SDaniel Vetter * 320e18c0412SDaniel Vetter * This is a simplified version of drm_mm_insert_node_in_range_generic() with 321e18c0412SDaniel Vetter * @color set to 0. 322e18c0412SDaniel Vetter * 323e18c0412SDaniel Vetter * The preallocated node must be cleared to 0. 324e18c0412SDaniel Vetter * 325e18c0412SDaniel Vetter * Returns: 326e18c0412SDaniel Vetter * 0 on success, -ENOSPC if there's no suitable hole. 327e18c0412SDaniel Vetter */ 32831e5d7c6SDavid Herrmann static inline int drm_mm_insert_node_in_range(struct drm_mm *mm, 32931e5d7c6SDavid Herrmann struct drm_mm_node *node, 330440fd528SThierry Reding u64 size, 33171733207SChris Wilson u64 alignment, 332440fd528SThierry Reding u64 start, 333440fd528SThierry Reding u64 end, 33431e5d7c6SDavid Herrmann enum drm_mm_search_flags flags) 33531e5d7c6SDavid Herrmann { 33631e5d7c6SDavid Herrmann return drm_mm_insert_node_in_range_generic(mm, node, size, alignment, 33762347f9eSLauri Kasanen 0, start, end, flags, 33862347f9eSLauri Kasanen DRM_MM_CREATE_DEFAULT); 33931e5d7c6SDavid Herrmann } 34031e5d7c6SDavid Herrmann 341e18c0412SDaniel Vetter void drm_mm_remove_node(struct drm_mm_node *node); 342e18c0412SDaniel Vetter void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new); 34345b186f1SChris Wilson void drm_mm_init(struct drm_mm *mm, u64 start, u64 size); 344e18c0412SDaniel Vetter void drm_mm_takedown(struct drm_mm *mm); 34545b186f1SChris Wilson bool drm_mm_clean(const struct drm_mm *mm); 346249d6048SJerome Glisse 347202b52b7SChris Wilson struct drm_mm_node * 34845b186f1SChris Wilson __drm_mm_interval_first(const struct drm_mm *mm, u64 start, u64 last); 349202b52b7SChris Wilson 350522e85ddSChris Wilson /** 351522e85ddSChris Wilson * drm_mm_for_each_node_in_range - iterator to walk over a range of 352522e85ddSChris Wilson * allocated nodes 3538b2fb7b6SChris Wilson * @node__: drm_mm_node structure to assign to in each iteration step 3548b2fb7b6SChris Wilson * @mm__: drm_mm allocator to walk 3558b2fb7b6SChris Wilson * @start__: starting offset, the first node will overlap this 3568b2fb7b6SChris Wilson * @end__: ending offset, the last node will start before this (but may overlap) 357522e85ddSChris Wilson * 358522e85ddSChris Wilson * This iterator walks over all nodes in the range allocator that lie 359522e85ddSChris Wilson * between @start and @end. It is implemented similarly to list_for_each(), 360522e85ddSChris Wilson * but using the internal interval tree to accelerate the search for the 361522e85ddSChris Wilson * starting node, and so not safe against removal of elements. It assumes 362522e85ddSChris Wilson * that @end is within (or is the upper limit of) the drm_mm allocator. 363522e85ddSChris Wilson */ 3648b2fb7b6SChris Wilson #define drm_mm_for_each_node_in_range(node__, mm__, start__, end__) \ 3658b2fb7b6SChris Wilson for (node__ = __drm_mm_interval_first((mm__), (start__), (end__)-1); \ 3668b2fb7b6SChris Wilson node__ && node__->start < (end__); \ 3678b2fb7b6SChris Wilson node__ = list_next_entry(node__, node_list)) 368202b52b7SChris Wilson 3696b9d89b4SChris Wilson void drm_mm_init_scan(struct drm_mm *mm, 370440fd528SThierry Reding u64 size, 37171733207SChris Wilson u64 alignment, 3726b9d89b4SChris Wilson unsigned long color); 3736b9d89b4SChris Wilson void drm_mm_init_scan_with_range(struct drm_mm *mm, 374440fd528SThierry Reding u64 size, 37571733207SChris Wilson u64 alignment, 3766b9d89b4SChris Wilson unsigned long color, 377440fd528SThierry Reding u64 start, 378440fd528SThierry Reding u64 end); 379e18c0412SDaniel Vetter bool drm_mm_scan_add_block(struct drm_mm_node *node); 380e18c0412SDaniel Vetter bool drm_mm_scan_remove_block(struct drm_mm_node *node); 381709ea971SDaniel Vetter 38245b186f1SChris Wilson void drm_mm_debug_table(const struct drm_mm *mm, const char *prefix); 383fa8a1238SDave Airlie #ifdef CONFIG_DEBUG_FS 38445b186f1SChris Wilson int drm_mm_dump_table(struct seq_file *m, const struct drm_mm *mm); 385fa8a1238SDave Airlie #endif 386fa8a1238SDave Airlie 387249d6048SJerome Glisse #endif 388