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 10145b186f1SChris Wilson void (*color_adjust)(const struct drm_mm_node *node, 10245b186f1SChris Wilson unsigned long color, 103440fd528SThierry Reding u64 *start, u64 *end); 1049a71e277SChris Wilson 1059a71e277SChris Wilson unsigned long scan_active; 1069a71e277SChris Wilson }; 1079a71e277SChris Wilson 1089a71e277SChris Wilson struct drm_mm_scan { 1099a71e277SChris Wilson struct drm_mm *mm; 1109a71e277SChris Wilson 1119a71e277SChris Wilson u64 size; 1129a71e277SChris Wilson u64 alignment; 1139a956b15SChris Wilson u64 remainder_mask; 1149a71e277SChris Wilson 1159a71e277SChris Wilson u64 range_start; 1169a71e277SChris Wilson u64 range_end; 1179a71e277SChris Wilson 1189a71e277SChris Wilson u64 hit_start; 1199a71e277SChris Wilson u64 hit_end; 1209a71e277SChris Wilson 1219a71e277SChris Wilson struct drm_mm_node *prev_scanned_node; 1229a71e277SChris Wilson 1239a71e277SChris Wilson unsigned long color; 1240b04d474SChris Wilson unsigned int flags; 125249d6048SJerome Glisse }; 126249d6048SJerome Glisse 127e18c0412SDaniel Vetter /** 128e18c0412SDaniel Vetter * drm_mm_node_allocated - checks whether a node is allocated 129e18c0412SDaniel Vetter * @node: drm_mm_node to check 130e18c0412SDaniel Vetter * 131ba004e39SChris Wilson * Drivers are required to clear a node prior to using it with the 132ba004e39SChris Wilson * drm_mm range manager. 133ba004e39SChris Wilson * 134ba004e39SChris Wilson * Drivers should use this helper for proper encapsulation of drm_mm 135e18c0412SDaniel Vetter * internals. 136e18c0412SDaniel Vetter * 137e18c0412SDaniel Vetter * Returns: 138e18c0412SDaniel Vetter * True if the @node is allocated. 139e18c0412SDaniel Vetter */ 14045b186f1SChris Wilson static inline bool drm_mm_node_allocated(const struct drm_mm_node *node) 141b0b7af18SDaniel Vetter { 142b0b7af18SDaniel Vetter return node->allocated; 143b0b7af18SDaniel Vetter } 144b0b7af18SDaniel Vetter 145e18c0412SDaniel Vetter /** 146e18c0412SDaniel Vetter * drm_mm_initialized - checks whether an allocator is initialized 147e18c0412SDaniel Vetter * @mm: drm_mm to check 148e18c0412SDaniel Vetter * 149ba004e39SChris Wilson * Drivers should clear the struct drm_mm prior to initialisation if they 150ba004e39SChris Wilson * want to use this function. 151ba004e39SChris Wilson * 152ba004e39SChris Wilson * Drivers should use this helper for proper encapsulation of drm_mm 153e18c0412SDaniel Vetter * internals. 154e18c0412SDaniel Vetter * 155e18c0412SDaniel Vetter * Returns: 156e18c0412SDaniel Vetter * True if the @mm is initialized. 157e18c0412SDaniel Vetter */ 15845b186f1SChris Wilson static inline bool drm_mm_initialized(const struct drm_mm *mm) 15931a5b8ceSDaniel Vetter { 160ea7b1dd4SDaniel Vetter return mm->hole_stack.next; 16131a5b8ceSDaniel Vetter } 1629e8944abSChris Wilson 16345b186f1SChris Wilson static inline u64 __drm_mm_hole_node_start(const struct drm_mm_node *hole_node) 1649e8944abSChris Wilson { 1659e8944abSChris Wilson return hole_node->start + hole_node->size; 1669e8944abSChris Wilson } 1679e8944abSChris Wilson 168e18c0412SDaniel Vetter /** 169e18c0412SDaniel Vetter * drm_mm_hole_node_start - computes the start of the hole following @node 170e18c0412SDaniel Vetter * @hole_node: drm_mm_node which implicitly tracks the following hole 171e18c0412SDaniel Vetter * 172ba004e39SChris Wilson * This is useful for driver-specific debug dumpers. Otherwise drivers should 173ba004e39SChris Wilson * not inspect holes themselves. Drivers must check first whether a hole indeed 174e18c0412SDaniel Vetter * follows by looking at node->hole_follows. 175e18c0412SDaniel Vetter * 176e18c0412SDaniel Vetter * Returns: 177e18c0412SDaniel Vetter * Start of the subsequent hole. 178e18c0412SDaniel Vetter */ 17945b186f1SChris Wilson static inline u64 drm_mm_hole_node_start(const struct drm_mm_node *hole_node) 1809e8944abSChris Wilson { 181b3ee963fSChris Wilson DRM_MM_BUG_ON(!hole_node->hole_follows); 1829e8944abSChris Wilson return __drm_mm_hole_node_start(hole_node); 1839e8944abSChris Wilson } 1849e8944abSChris Wilson 18545b186f1SChris Wilson static inline u64 __drm_mm_hole_node_end(const struct drm_mm_node *hole_node) 1869e8944abSChris Wilson { 18787069f44SGeliang Tang return list_next_entry(hole_node, node_list)->start; 1889e8944abSChris Wilson } 1899e8944abSChris Wilson 190e18c0412SDaniel Vetter /** 191e18c0412SDaniel Vetter * drm_mm_hole_node_end - computes the end of the hole following @node 192e18c0412SDaniel Vetter * @hole_node: drm_mm_node which implicitly tracks the following hole 193e18c0412SDaniel Vetter * 194ba004e39SChris Wilson * This is useful for driver-specific debug dumpers. Otherwise drivers should 195ba004e39SChris Wilson * not inspect holes themselves. Drivers must check first whether a hole indeed 196e18c0412SDaniel Vetter * follows by looking at node->hole_follows. 197e18c0412SDaniel Vetter * 198e18c0412SDaniel Vetter * Returns: 199e18c0412SDaniel Vetter * End of the subsequent hole. 200e18c0412SDaniel Vetter */ 20145b186f1SChris Wilson static inline u64 drm_mm_hole_node_end(const struct drm_mm_node *hole_node) 2029e8944abSChris Wilson { 2039e8944abSChris Wilson return __drm_mm_hole_node_end(hole_node); 2049e8944abSChris Wilson } 2059e8944abSChris Wilson 2062bc98c86SChris Wilson /** 2072bc98c86SChris Wilson * drm_mm_nodes - list of nodes under the drm_mm range manager 2082bc98c86SChris Wilson * @mm: the struct drm_mm range manger 2092bc98c86SChris Wilson * 2102bc98c86SChris Wilson * As the drm_mm range manager hides its node_list deep with its 2112bc98c86SChris Wilson * structure, extracting it looks painful and repetitive. This is 2122bc98c86SChris Wilson * not expected to be used outside of the drm_mm_for_each_node() 2132bc98c86SChris Wilson * macros and similar internal functions. 2142bc98c86SChris Wilson * 2152bc98c86SChris Wilson * Returns: 2162bc98c86SChris Wilson * The node list, may be empty. 2172bc98c86SChris Wilson */ 2182bc98c86SChris Wilson #define drm_mm_nodes(mm) (&(mm)->head_node.node_list) 219ad579002SChris Wilson 220e18c0412SDaniel Vetter /** 221e18c0412SDaniel Vetter * drm_mm_for_each_node - iterator to walk over all allocated nodes 222e18c0412SDaniel Vetter * @entry: drm_mm_node structure to assign to in each iteration step 223e18c0412SDaniel Vetter * @mm: drm_mm allocator to walk 224e18c0412SDaniel Vetter * 225e18c0412SDaniel Vetter * This iterator walks over all nodes in the range allocator. It is implemented 226e18c0412SDaniel Vetter * with list_for_each, so not save against removal of elements. 227e18c0412SDaniel Vetter */ 228ad579002SChris Wilson #define drm_mm_for_each_node(entry, mm) \ 2292bc98c86SChris Wilson list_for_each_entry(entry, drm_mm_nodes(mm), node_list) 230ad579002SChris Wilson 231ad579002SChris Wilson /** 232ad579002SChris Wilson * drm_mm_for_each_node_safe - iterator to walk over all allocated nodes 233ad579002SChris Wilson * @entry: drm_mm_node structure to assign to in each iteration step 234ad579002SChris Wilson * @next: drm_mm_node structure to store the next step 235ad579002SChris Wilson * @mm: drm_mm allocator to walk 236ad579002SChris Wilson * 237ad579002SChris Wilson * This iterator walks over all nodes in the range allocator. It is implemented 238ad579002SChris Wilson * with list_for_each_safe, so save against removal of elements. 239ad579002SChris Wilson */ 240ad579002SChris Wilson #define drm_mm_for_each_node_safe(entry, next, mm) \ 2412bc98c86SChris Wilson list_for_each_entry_safe(entry, next, drm_mm_nodes(mm), node_list) 2429e8944abSChris Wilson 24318b40c58SGeliang Tang #define __drm_mm_for_each_hole(entry, mm, hole_start, hole_end, backwards) \ 24418b40c58SGeliang Tang for (entry = list_entry((backwards) ? (mm)->hole_stack.prev : (mm)->hole_stack.next, struct drm_mm_node, hole_stack); \ 24518b40c58SGeliang Tang &entry->hole_stack != &(mm)->hole_stack ? \ 24618b40c58SGeliang Tang hole_start = drm_mm_hole_node_start(entry), \ 24718b40c58SGeliang Tang hole_end = drm_mm_hole_node_end(entry), \ 24818b40c58SGeliang Tang 1 : 0; \ 24918b40c58SGeliang Tang entry = list_entry((backwards) ? entry->hole_stack.prev : entry->hole_stack.next, struct drm_mm_node, hole_stack)) 25018b40c58SGeliang Tang 251e18c0412SDaniel Vetter /** 252e18c0412SDaniel Vetter * drm_mm_for_each_hole - iterator to walk over all holes 253e18c0412SDaniel Vetter * @entry: drm_mm_node used internally to track progress 254e18c0412SDaniel Vetter * @mm: drm_mm allocator to walk 255e18c0412SDaniel Vetter * @hole_start: ulong variable to assign the hole start to on each iteration 256e18c0412SDaniel Vetter * @hole_end: ulong variable to assign the hole end to on each iteration 257e18c0412SDaniel Vetter * 258e18c0412SDaniel Vetter * This iterator walks over all holes in the range allocator. It is implemented 259e18c0412SDaniel Vetter * with list_for_each, so not save against removal of elements. @entry is used 260e18c0412SDaniel Vetter * internally and will not reflect a real drm_mm_node for the very first hole. 261e18c0412SDaniel Vetter * Hence users of this iterator may not access it. 262e18c0412SDaniel Vetter * 263e18c0412SDaniel Vetter * Implementation Note: 264e18c0412SDaniel Vetter * We need to inline list_for_each_entry in order to be able to set hole_start 265e18c0412SDaniel Vetter * and hole_end on each iteration while keeping the macro sane. 26662347f9eSLauri Kasanen * 26762347f9eSLauri Kasanen * The __drm_mm_for_each_hole version is similar, but with added support for 26862347f9eSLauri Kasanen * going backwards. 2699e8944abSChris Wilson */ 2709e8944abSChris Wilson #define drm_mm_for_each_hole(entry, mm, hole_start, hole_end) \ 27118b40c58SGeliang Tang __drm_mm_for_each_hole(entry, mm, hole_start, hole_end, 0) 27262347f9eSLauri Kasanen 273249d6048SJerome Glisse /* 274249d6048SJerome Glisse * Basic range manager support (drm_mm.c) 275249d6048SJerome Glisse */ 276e18c0412SDaniel Vetter int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node); 277b8103450SChris Wilson 278e18c0412SDaniel Vetter int drm_mm_insert_node_generic(struct drm_mm *mm, 279b8103450SChris Wilson struct drm_mm_node *node, 280440fd528SThierry Reding u64 size, 28171733207SChris Wilson u64 alignment, 28231e5d7c6SDavid Herrmann unsigned long color, 28362347f9eSLauri Kasanen enum drm_mm_search_flags sflags, 28462347f9eSLauri Kasanen enum drm_mm_allocator_flags aflags); 285e18c0412SDaniel Vetter /** 286e18c0412SDaniel Vetter * drm_mm_insert_node - search for space and insert @node 287e18c0412SDaniel Vetter * @mm: drm_mm to allocate from 288e18c0412SDaniel Vetter * @node: preallocate node to insert 289e18c0412SDaniel Vetter * @size: size of the allocation 290e18c0412SDaniel Vetter * @alignment: alignment of the allocation 291e18c0412SDaniel Vetter * @flags: flags to fine-tune the allocation 292e18c0412SDaniel Vetter * 293e18c0412SDaniel Vetter * This is a simplified version of drm_mm_insert_node_generic() with @color set 294e18c0412SDaniel Vetter * to 0. 295e18c0412SDaniel Vetter * 296e18c0412SDaniel Vetter * The preallocated node must be cleared to 0. 297e18c0412SDaniel Vetter * 298e18c0412SDaniel Vetter * Returns: 299e18c0412SDaniel Vetter * 0 on success, -ENOSPC if there's no suitable hole. 300e18c0412SDaniel Vetter */ 30131e5d7c6SDavid Herrmann static inline int drm_mm_insert_node(struct drm_mm *mm, 30231e5d7c6SDavid Herrmann struct drm_mm_node *node, 303440fd528SThierry Reding u64 size, 30471733207SChris Wilson u64 alignment, 30531e5d7c6SDavid Herrmann enum drm_mm_search_flags flags) 30631e5d7c6SDavid Herrmann { 30762347f9eSLauri Kasanen return drm_mm_insert_node_generic(mm, node, size, alignment, 0, flags, 30862347f9eSLauri Kasanen DRM_MM_CREATE_DEFAULT); 30931e5d7c6SDavid Herrmann } 31031e5d7c6SDavid Herrmann 311e18c0412SDaniel Vetter int drm_mm_insert_node_in_range_generic(struct drm_mm *mm, 312b8103450SChris Wilson struct drm_mm_node *node, 313440fd528SThierry Reding u64 size, 31471733207SChris Wilson u64 alignment, 315b8103450SChris Wilson unsigned long color, 316440fd528SThierry Reding u64 start, 317440fd528SThierry Reding u64 end, 31862347f9eSLauri Kasanen enum drm_mm_search_flags sflags, 31962347f9eSLauri Kasanen enum drm_mm_allocator_flags aflags); 320e18c0412SDaniel Vetter /** 321e18c0412SDaniel Vetter * drm_mm_insert_node_in_range - ranged search for space and insert @node 322e18c0412SDaniel Vetter * @mm: drm_mm to allocate from 323e18c0412SDaniel Vetter * @node: preallocate node to insert 324e18c0412SDaniel Vetter * @size: size of the allocation 325e18c0412SDaniel Vetter * @alignment: alignment of the allocation 326e18c0412SDaniel Vetter * @start: start of the allowed range for this node 327e18c0412SDaniel Vetter * @end: end of the allowed range for this node 328e18c0412SDaniel Vetter * @flags: flags to fine-tune the allocation 329e18c0412SDaniel Vetter * 330e18c0412SDaniel Vetter * This is a simplified version of drm_mm_insert_node_in_range_generic() with 331e18c0412SDaniel Vetter * @color set to 0. 332e18c0412SDaniel Vetter * 333e18c0412SDaniel Vetter * The preallocated node must be cleared to 0. 334e18c0412SDaniel Vetter * 335e18c0412SDaniel Vetter * Returns: 336e18c0412SDaniel Vetter * 0 on success, -ENOSPC if there's no suitable hole. 337e18c0412SDaniel Vetter */ 33831e5d7c6SDavid Herrmann static inline int drm_mm_insert_node_in_range(struct drm_mm *mm, 33931e5d7c6SDavid Herrmann struct drm_mm_node *node, 340440fd528SThierry Reding u64 size, 34171733207SChris Wilson u64 alignment, 342440fd528SThierry Reding u64 start, 343440fd528SThierry Reding u64 end, 34431e5d7c6SDavid Herrmann enum drm_mm_search_flags flags) 34531e5d7c6SDavid Herrmann { 34631e5d7c6SDavid Herrmann return drm_mm_insert_node_in_range_generic(mm, node, size, alignment, 34762347f9eSLauri Kasanen 0, start, end, flags, 34862347f9eSLauri Kasanen DRM_MM_CREATE_DEFAULT); 34931e5d7c6SDavid Herrmann } 35031e5d7c6SDavid Herrmann 351e18c0412SDaniel Vetter void drm_mm_remove_node(struct drm_mm_node *node); 352e18c0412SDaniel Vetter void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new); 35345b186f1SChris Wilson void drm_mm_init(struct drm_mm *mm, u64 start, u64 size); 354e18c0412SDaniel Vetter void drm_mm_takedown(struct drm_mm *mm); 355ac9bb7b7SChris Wilson 356ac9bb7b7SChris Wilson /** 357ac9bb7b7SChris Wilson * drm_mm_clean - checks whether an allocator is clean 358ac9bb7b7SChris Wilson * @mm: drm_mm allocator to check 359ac9bb7b7SChris Wilson * 360ac9bb7b7SChris Wilson * Returns: 361ac9bb7b7SChris Wilson * True if the allocator is completely free, false if there's still a node 362ac9bb7b7SChris Wilson * allocated in it. 363ac9bb7b7SChris Wilson */ 364ac9bb7b7SChris Wilson static inline bool drm_mm_clean(const struct drm_mm *mm) 365ac9bb7b7SChris Wilson { 366ac9bb7b7SChris Wilson return list_empty(drm_mm_nodes(mm)); 367ac9bb7b7SChris Wilson } 368249d6048SJerome Glisse 369202b52b7SChris Wilson struct drm_mm_node * 37045b186f1SChris Wilson __drm_mm_interval_first(const struct drm_mm *mm, u64 start, u64 last); 371202b52b7SChris Wilson 372522e85ddSChris Wilson /** 373522e85ddSChris Wilson * drm_mm_for_each_node_in_range - iterator to walk over a range of 374522e85ddSChris Wilson * allocated nodes 3758b2fb7b6SChris Wilson * @node__: drm_mm_node structure to assign to in each iteration step 3768b2fb7b6SChris Wilson * @mm__: drm_mm allocator to walk 3778b2fb7b6SChris Wilson * @start__: starting offset, the first node will overlap this 3788b2fb7b6SChris Wilson * @end__: ending offset, the last node will start before this (but may overlap) 379522e85ddSChris Wilson * 380522e85ddSChris Wilson * This iterator walks over all nodes in the range allocator that lie 381522e85ddSChris Wilson * between @start and @end. It is implemented similarly to list_for_each(), 382522e85ddSChris Wilson * but using the internal interval tree to accelerate the search for the 383522e85ddSChris Wilson * starting node, and so not safe against removal of elements. It assumes 384522e85ddSChris Wilson * that @end is within (or is the upper limit of) the drm_mm allocator. 385522e85ddSChris Wilson */ 3868b2fb7b6SChris Wilson #define drm_mm_for_each_node_in_range(node__, mm__, start__, end__) \ 3878b2fb7b6SChris Wilson for (node__ = __drm_mm_interval_first((mm__), (start__), (end__)-1); \ 3888b2fb7b6SChris Wilson node__ && node__->start < (end__); \ 3898b2fb7b6SChris Wilson node__ = list_next_entry(node__, node_list)) 390202b52b7SChris Wilson 3919a71e277SChris Wilson void drm_mm_scan_init_with_range(struct drm_mm_scan *scan, 3929a71e277SChris Wilson struct drm_mm *mm, 3930b04d474SChris Wilson u64 size, u64 alignment, unsigned long color, 3940b04d474SChris Wilson u64 start, u64 end, 3950b04d474SChris Wilson unsigned int flags); 3962c4b3895SChris Wilson 3972c4b3895SChris Wilson /** 3982c4b3895SChris Wilson * drm_mm_scan_init - initialize lru scanning 3992c4b3895SChris Wilson * @scan: scan state 4002c4b3895SChris Wilson * @mm: drm_mm to scan 4012c4b3895SChris Wilson * @size: size of the allocation 4022c4b3895SChris Wilson * @alignment: alignment of the allocation 4032c4b3895SChris Wilson * @color: opaque tag value to use for the allocation 4040b04d474SChris Wilson * @flags: flags to specify how the allocation will be performed afterwards 4052c4b3895SChris Wilson * 4062c4b3895SChris Wilson * This simply sets up the scanning routines with the parameters for the desired 4070b04d474SChris Wilson * hole. 4082c4b3895SChris Wilson * 4092c4b3895SChris Wilson * Warning: 4102c4b3895SChris Wilson * As long as the scan list is non-empty, no other operations than 4112c4b3895SChris Wilson * adding/removing nodes to/from the scan list are allowed. 4122c4b3895SChris Wilson */ 4132c4b3895SChris Wilson static inline void drm_mm_scan_init(struct drm_mm_scan *scan, 4142c4b3895SChris Wilson struct drm_mm *mm, 4152c4b3895SChris Wilson u64 size, 4162c4b3895SChris Wilson u64 alignment, 4170b04d474SChris Wilson unsigned long color, 4180b04d474SChris Wilson unsigned int flags) 4192c4b3895SChris Wilson { 4200b04d474SChris Wilson drm_mm_scan_init_with_range(scan, mm, 4210b04d474SChris Wilson size, alignment, color, 4220b04d474SChris Wilson 0, U64_MAX, 4230b04d474SChris Wilson flags); 4242c4b3895SChris Wilson } 4252c4b3895SChris Wilson 4269a71e277SChris Wilson bool drm_mm_scan_add_block(struct drm_mm_scan *scan, 4279a71e277SChris Wilson struct drm_mm_node *node); 4289a71e277SChris Wilson bool drm_mm_scan_remove_block(struct drm_mm_scan *scan, 4299a71e277SChris Wilson struct drm_mm_node *node); 430709ea971SDaniel Vetter 43145b186f1SChris Wilson void drm_mm_debug_table(const struct drm_mm *mm, const char *prefix); 432fa8a1238SDave Airlie #ifdef CONFIG_DEBUG_FS 43345b186f1SChris Wilson int drm_mm_dump_table(struct seq_file *m, const struct drm_mm *mm); 434fa8a1238SDave Airlie #endif 435fa8a1238SDave Airlie 436249d6048SJerome Glisse #endif 437