1 /************************************************************************** 2 * 3 * Copyright 2006-2008 Tungsten Graphics, Inc., Cedar Park, TX. USA. 4 * All Rights Reserved. 5 * 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: 13 * 14 * The above copyright notice and this permission notice (including the 15 * next paragraph) shall be included in all copies or substantial portions 16 * of the Software. 17 * 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. 25 * 26 * 27 **************************************************************************/ 28 /* 29 * Authors: 30 * Thomas Hellstrom <thomas-at-tungstengraphics-dot-com> 31 */ 32 33 #ifndef _DRM_MM_H_ 34 #define _DRM_MM_H_ 35 36 /* 37 * Generic range manager structs 38 */ 39 #include <linux/list.h> 40 #ifdef CONFIG_DEBUG_FS 41 #include <linux/seq_file.h> 42 #endif 43 44 struct drm_mm_node { 45 struct list_head node_list; 46 struct list_head hole_stack; 47 unsigned hole_follows : 1; 48 unsigned scanned_block : 1; 49 unsigned scanned_prev_free : 1; 50 unsigned scanned_next_free : 1; 51 unsigned scanned_preceeds_hole : 1; 52 unsigned allocated : 1; 53 unsigned long color; 54 unsigned long start; 55 unsigned long size; 56 struct drm_mm *mm; 57 }; 58 59 struct drm_mm { 60 /* List of all memory nodes that immediately precede a free hole. */ 61 struct list_head hole_stack; 62 /* head_node.node_list is the list of all memory nodes, ordered 63 * according to the (increasing) start address of the memory node. */ 64 struct drm_mm_node head_node; 65 struct list_head unused_nodes; 66 int num_unused; 67 spinlock_t unused_lock; 68 unsigned int scan_check_range : 1; 69 unsigned scan_alignment; 70 unsigned long scan_color; 71 unsigned long scan_size; 72 unsigned long scan_hit_start; 73 unsigned long scan_hit_end; 74 unsigned scanned_blocks; 75 unsigned long scan_start; 76 unsigned long scan_end; 77 struct drm_mm_node *prev_scanned_node; 78 79 void (*color_adjust)(struct drm_mm_node *node, unsigned long color, 80 unsigned long *start, unsigned long *end); 81 }; 82 83 static inline bool drm_mm_node_allocated(struct drm_mm_node *node) 84 { 85 return node->allocated; 86 } 87 88 static inline bool drm_mm_initialized(struct drm_mm *mm) 89 { 90 return mm->hole_stack.next; 91 } 92 93 static inline unsigned long __drm_mm_hole_node_start(struct drm_mm_node *hole_node) 94 { 95 return hole_node->start + hole_node->size; 96 } 97 98 static inline unsigned long drm_mm_hole_node_start(struct drm_mm_node *hole_node) 99 { 100 BUG_ON(!hole_node->hole_follows); 101 return __drm_mm_hole_node_start(hole_node); 102 } 103 104 static inline unsigned long __drm_mm_hole_node_end(struct drm_mm_node *hole_node) 105 { 106 return list_entry(hole_node->node_list.next, 107 struct drm_mm_node, node_list)->start; 108 } 109 110 static inline unsigned long drm_mm_hole_node_end(struct drm_mm_node *hole_node) 111 { 112 return __drm_mm_hole_node_end(hole_node); 113 } 114 115 #define drm_mm_for_each_node(entry, mm) list_for_each_entry(entry, \ 116 &(mm)->head_node.node_list, \ 117 node_list) 118 #define drm_mm_for_each_scanned_node_reverse(entry, n, mm) \ 119 for (entry = (mm)->prev_scanned_node, \ 120 next = entry ? list_entry(entry->node_list.next, \ 121 struct drm_mm_node, node_list) : NULL; \ 122 entry != NULL; entry = next, \ 123 next = entry ? list_entry(entry->node_list.next, \ 124 struct drm_mm_node, node_list) : NULL) \ 125 126 /* Note that we need to unroll list_for_each_entry in order to inline 127 * setting hole_start and hole_end on each iteration and keep the 128 * macro sane. 129 */ 130 #define drm_mm_for_each_hole(entry, mm, hole_start, hole_end) \ 131 for (entry = list_entry((mm)->hole_stack.next, struct drm_mm_node, hole_stack); \ 132 &entry->hole_stack != &(mm)->hole_stack ? \ 133 hole_start = drm_mm_hole_node_start(entry), \ 134 hole_end = drm_mm_hole_node_end(entry), \ 135 1 : 0; \ 136 entry = list_entry(entry->hole_stack.next, struct drm_mm_node, hole_stack)) 137 138 /* 139 * Basic range manager support (drm_mm.c) 140 */ 141 extern int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node); 142 extern struct drm_mm_node *drm_mm_get_block_generic(struct drm_mm_node *node, 143 unsigned long size, 144 unsigned alignment, 145 unsigned long color, 146 int atomic); 147 extern struct drm_mm_node *drm_mm_get_block_range_generic( 148 struct drm_mm_node *node, 149 unsigned long size, 150 unsigned alignment, 151 unsigned long color, 152 unsigned long start, 153 unsigned long end, 154 int atomic); 155 156 static inline struct drm_mm_node *drm_mm_get_block(struct drm_mm_node *parent, 157 unsigned long size, 158 unsigned alignment) 159 { 160 return drm_mm_get_block_generic(parent, size, alignment, 0, 0); 161 } 162 static inline struct drm_mm_node *drm_mm_get_block_atomic(struct drm_mm_node *parent, 163 unsigned long size, 164 unsigned alignment) 165 { 166 return drm_mm_get_block_generic(parent, size, alignment, 0, 1); 167 } 168 static inline struct drm_mm_node *drm_mm_get_block_range( 169 struct drm_mm_node *parent, 170 unsigned long size, 171 unsigned alignment, 172 unsigned long start, 173 unsigned long end) 174 { 175 return drm_mm_get_block_range_generic(parent, size, alignment, 0, 176 start, end, 0); 177 } 178 static inline struct drm_mm_node *drm_mm_get_color_block_range( 179 struct drm_mm_node *parent, 180 unsigned long size, 181 unsigned alignment, 182 unsigned long color, 183 unsigned long start, 184 unsigned long end) 185 { 186 return drm_mm_get_block_range_generic(parent, size, alignment, color, 187 start, end, 0); 188 } 189 static inline struct drm_mm_node *drm_mm_get_block_atomic_range( 190 struct drm_mm_node *parent, 191 unsigned long size, 192 unsigned alignment, 193 unsigned long start, 194 unsigned long end) 195 { 196 return drm_mm_get_block_range_generic(parent, size, alignment, 0, 197 start, end, 1); 198 } 199 200 extern int drm_mm_insert_node(struct drm_mm *mm, 201 struct drm_mm_node *node, 202 unsigned long size, 203 unsigned alignment); 204 extern int drm_mm_insert_node_in_range(struct drm_mm *mm, 205 struct drm_mm_node *node, 206 unsigned long size, 207 unsigned alignment, 208 unsigned long start, 209 unsigned long end); 210 extern int drm_mm_insert_node_generic(struct drm_mm *mm, 211 struct drm_mm_node *node, 212 unsigned long size, 213 unsigned alignment, 214 unsigned long color); 215 extern int drm_mm_insert_node_in_range_generic(struct drm_mm *mm, 216 struct drm_mm_node *node, 217 unsigned long size, 218 unsigned alignment, 219 unsigned long color, 220 unsigned long start, 221 unsigned long end); 222 extern void drm_mm_put_block(struct drm_mm_node *cur); 223 extern void drm_mm_remove_node(struct drm_mm_node *node); 224 extern void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new); 225 extern struct drm_mm_node *drm_mm_search_free_generic(const struct drm_mm *mm, 226 unsigned long size, 227 unsigned alignment, 228 unsigned long color, 229 bool best_match); 230 extern struct drm_mm_node *drm_mm_search_free_in_range_generic( 231 const struct drm_mm *mm, 232 unsigned long size, 233 unsigned alignment, 234 unsigned long color, 235 unsigned long start, 236 unsigned long end, 237 bool best_match); 238 static inline struct drm_mm_node *drm_mm_search_free(const struct drm_mm *mm, 239 unsigned long size, 240 unsigned alignment, 241 bool best_match) 242 { 243 return drm_mm_search_free_generic(mm,size, alignment, 0, best_match); 244 } 245 static inline struct drm_mm_node *drm_mm_search_free_in_range( 246 const struct drm_mm *mm, 247 unsigned long size, 248 unsigned alignment, 249 unsigned long start, 250 unsigned long end, 251 bool best_match) 252 { 253 return drm_mm_search_free_in_range_generic(mm, size, alignment, 0, 254 start, end, best_match); 255 } 256 static inline struct drm_mm_node *drm_mm_search_free_color(const struct drm_mm *mm, 257 unsigned long size, 258 unsigned alignment, 259 unsigned long color, 260 bool best_match) 261 { 262 return drm_mm_search_free_generic(mm,size, alignment, color, best_match); 263 } 264 static inline struct drm_mm_node *drm_mm_search_free_in_range_color( 265 const struct drm_mm *mm, 266 unsigned long size, 267 unsigned alignment, 268 unsigned long color, 269 unsigned long start, 270 unsigned long end, 271 bool best_match) 272 { 273 return drm_mm_search_free_in_range_generic(mm, size, alignment, color, 274 start, end, best_match); 275 } 276 extern int drm_mm_init(struct drm_mm *mm, 277 unsigned long start, 278 unsigned long size); 279 extern void drm_mm_takedown(struct drm_mm *mm); 280 extern int drm_mm_clean(struct drm_mm *mm); 281 extern int drm_mm_pre_get(struct drm_mm *mm); 282 283 static inline struct drm_mm *drm_get_mm(struct drm_mm_node *block) 284 { 285 return block->mm; 286 } 287 288 void drm_mm_init_scan(struct drm_mm *mm, 289 unsigned long size, 290 unsigned alignment, 291 unsigned long color); 292 void drm_mm_init_scan_with_range(struct drm_mm *mm, 293 unsigned long size, 294 unsigned alignment, 295 unsigned long color, 296 unsigned long start, 297 unsigned long end); 298 int drm_mm_scan_add_block(struct drm_mm_node *node); 299 int drm_mm_scan_remove_block(struct drm_mm_node *node); 300 301 extern void drm_mm_debug_table(struct drm_mm *mm, const char *prefix); 302 #ifdef CONFIG_DEBUG_FS 303 int drm_mm_dump_table(struct seq_file *m, struct drm_mm *mm); 304 #endif 305 306 #endif 307