Commit | Line | Data |
---|---|---|
3a1bd924 TH |
1 | /************************************************************************** |
2 | * | |
3 | * Copyright 2006 Tungsten Graphics, Inc., Bismarck, ND., 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 | /* | |
30 | * Generic simple memory manager implementation. Intended to be used as a base | |
31 | * class implementation for more advanced memory managers. | |
32 | * | |
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. | |
37 | * | |
38 | * Aligned allocations can also see improvement. | |
39 | * | |
40 | * Authors: | |
96de0e25 | 41 | * Thomas Hellström <thomas-at-tungstengraphics-dot-com> |
3a1bd924 TH |
42 | */ |
43 | ||
760285e7 DH |
44 | #include <drm/drmP.h> |
45 | #include <drm/drm_mm.h> | |
1d58420b | 46 | #include <linux/slab.h> |
fa8a1238 | 47 | #include <linux/seq_file.h> |
2d1a8a48 | 48 | #include <linux/export.h> |
202b52b7 | 49 | #include <linux/interval_tree_generic.h> |
1d58420b | 50 | |
93110be6 DV |
51 | /** |
52 | * DOC: Overview | |
53 | * | |
54 | * drm_mm provides a simple range allocator. The drivers are free to use the | |
55 | * resource allocator from the linux core if it suits them, the upside of drm_mm | |
56 | * is that it's in the DRM core. Which means that it's easier to extend for | |
57 | * some of the crazier special purpose needs of gpus. | |
58 | * | |
59 | * The main data struct is &drm_mm, allocations are tracked in &drm_mm_node. | |
60 | * Drivers are free to embed either of them into their own suitable | |
61 | * datastructures. drm_mm itself will not do any allocations of its own, so if | |
62 | * drivers choose not to embed nodes they need to still allocate them | |
63 | * themselves. | |
64 | * | |
65 | * The range allocator also supports reservation of preallocated blocks. This is | |
66 | * useful for taking over initial mode setting configurations from the firmware, | |
67 | * where an object needs to be created which exactly matches the firmware's | |
68 | * scanout target. As long as the range is still free it can be inserted anytime | |
69 | * after the allocator is initialized, which helps with avoiding looped | |
70 | * depencies in the driver load sequence. | |
71 | * | |
72 | * drm_mm maintains a stack of most recently freed holes, which of all | |
73 | * simplistic datastructures seems to be a fairly decent approach to clustering | |
74 | * allocations and avoiding too much fragmentation. This means free space | |
75 | * searches are O(num_holes). Given that all the fancy features drm_mm supports | |
76 | * something better would be fairly complex and since gfx thrashing is a fairly | |
77 | * steep cliff not a real concern. Removing a node again is O(1). | |
78 | * | |
79 | * drm_mm supports a few features: Alignment and range restrictions can be | |
80 | * supplied. Further more every &drm_mm_node has a color value (which is just an | |
81 | * opaqua unsigned long) which in conjunction with a driver callback can be used | |
82 | * to implement sophisticated placement restrictions. The i915 DRM driver uses | |
83 | * this to implement guard pages between incompatible caching domains in the | |
84 | * graphics TT. | |
85 | * | |
62347f9e LK |
86 | * Two behaviors are supported for searching and allocating: bottom-up and top-down. |
87 | * The default is bottom-up. Top-down allocation can be used if the memory area | |
88 | * has different restrictions, or just to reduce fragmentation. | |
89 | * | |
93110be6 DV |
90 | * Finally iteration helpers to walk all nodes and all holes are provided as are |
91 | * some basic allocator dumpers for debugging. | |
92 | */ | |
93 | ||
c700c67b | 94 | static struct drm_mm_node *drm_mm_search_free_generic(const struct drm_mm *mm, |
440fd528 | 95 | u64 size, |
c700c67b DH |
96 | unsigned alignment, |
97 | unsigned long color, | |
98 | enum drm_mm_search_flags flags); | |
99 | static struct drm_mm_node *drm_mm_search_free_in_range_generic(const struct drm_mm *mm, | |
440fd528 | 100 | u64 size, |
c700c67b DH |
101 | unsigned alignment, |
102 | unsigned long color, | |
440fd528 TR |
103 | u64 start, |
104 | u64 end, | |
c700c67b | 105 | enum drm_mm_search_flags flags); |
1d58420b | 106 | |
5705670d | 107 | #ifdef CONFIG_DRM_DEBUG_MM |
93ce75fa CW |
108 | #include <linux/stackdepot.h> |
109 | ||
5705670d CW |
110 | #define STACKDEPTH 32 |
111 | #define BUFSZ 4096 | |
112 | ||
113 | static noinline void save_stack(struct drm_mm_node *node) | |
114 | { | |
115 | unsigned long entries[STACKDEPTH]; | |
116 | struct stack_trace trace = { | |
117 | .entries = entries, | |
118 | .max_entries = STACKDEPTH, | |
119 | .skip = 1 | |
120 | }; | |
121 | ||
122 | save_stack_trace(&trace); | |
123 | if (trace.nr_entries != 0 && | |
124 | trace.entries[trace.nr_entries-1] == ULONG_MAX) | |
125 | trace.nr_entries--; | |
126 | ||
127 | /* May be called under spinlock, so avoid sleeping */ | |
128 | node->stack = depot_save_stack(&trace, GFP_NOWAIT); | |
129 | } | |
130 | ||
131 | static void show_leaks(struct drm_mm *mm) | |
132 | { | |
133 | struct drm_mm_node *node; | |
134 | unsigned long entries[STACKDEPTH]; | |
135 | char *buf; | |
136 | ||
137 | buf = kmalloc(BUFSZ, GFP_KERNEL); | |
138 | if (!buf) | |
139 | return; | |
140 | ||
141 | list_for_each_entry(node, &mm->head_node.node_list, node_list) { | |
142 | struct stack_trace trace = { | |
143 | .entries = entries, | |
144 | .max_entries = STACKDEPTH | |
145 | }; | |
146 | ||
147 | if (!node->stack) { | |
148 | DRM_ERROR("node [%08llx + %08llx]: unknown owner\n", | |
149 | node->start, node->size); | |
150 | continue; | |
151 | } | |
152 | ||
153 | depot_fetch_stack(node->stack, &trace); | |
154 | snprint_stack_trace(buf, BUFSZ, &trace, 0); | |
155 | DRM_ERROR("node [%08llx + %08llx]: inserted at\n%s", | |
156 | node->start, node->size, buf); | |
157 | } | |
158 | ||
159 | kfree(buf); | |
160 | } | |
161 | ||
162 | #undef STACKDEPTH | |
163 | #undef BUFSZ | |
164 | #else | |
165 | static void save_stack(struct drm_mm_node *node) { } | |
166 | static void show_leaks(struct drm_mm *mm) { } | |
167 | #endif | |
168 | ||
202b52b7 CW |
169 | #define START(node) ((node)->start) |
170 | #define LAST(node) ((node)->start + (node)->size - 1) | |
171 | ||
172 | INTERVAL_TREE_DEFINE(struct drm_mm_node, rb, | |
173 | u64, __subtree_last, | |
174 | START, LAST, static inline, drm_mm_interval_tree) | |
175 | ||
176 | struct drm_mm_node * | |
522e85dd | 177 | __drm_mm_interval_first(struct drm_mm *mm, u64 start, u64 last) |
202b52b7 CW |
178 | { |
179 | return drm_mm_interval_tree_iter_first(&mm->interval_tree, | |
180 | start, last); | |
181 | } | |
522e85dd | 182 | EXPORT_SYMBOL(__drm_mm_interval_first); |
202b52b7 CW |
183 | |
184 | static void drm_mm_interval_tree_add_node(struct drm_mm_node *hole_node, | |
185 | struct drm_mm_node *node) | |
186 | { | |
187 | struct drm_mm *mm = hole_node->mm; | |
188 | struct rb_node **link, *rb; | |
189 | struct drm_mm_node *parent; | |
190 | ||
191 | node->__subtree_last = LAST(node); | |
192 | ||
193 | if (hole_node->allocated) { | |
194 | rb = &hole_node->rb; | |
195 | while (rb) { | |
196 | parent = rb_entry(rb, struct drm_mm_node, rb); | |
197 | if (parent->__subtree_last >= node->__subtree_last) | |
198 | break; | |
199 | ||
200 | parent->__subtree_last = node->__subtree_last; | |
201 | rb = rb_parent(rb); | |
202 | } | |
203 | ||
204 | rb = &hole_node->rb; | |
205 | link = &hole_node->rb.rb_right; | |
206 | } else { | |
207 | rb = NULL; | |
208 | link = &mm->interval_tree.rb_node; | |
209 | } | |
210 | ||
211 | while (*link) { | |
212 | rb = *link; | |
213 | parent = rb_entry(rb, struct drm_mm_node, rb); | |
214 | if (parent->__subtree_last < node->__subtree_last) | |
215 | parent->__subtree_last = node->__subtree_last; | |
216 | if (node->start < parent->start) | |
217 | link = &parent->rb.rb_left; | |
218 | else | |
219 | link = &parent->rb.rb_right; | |
220 | } | |
221 | ||
222 | rb_link_node(&node->rb, rb, link); | |
223 | rb_insert_augmented(&node->rb, | |
224 | &mm->interval_tree, | |
225 | &drm_mm_interval_tree_augment); | |
226 | } | |
227 | ||
9fc935de DV |
228 | static void drm_mm_insert_helper(struct drm_mm_node *hole_node, |
229 | struct drm_mm_node *node, | |
440fd528 | 230 | u64 size, unsigned alignment, |
62347f9e LK |
231 | unsigned long color, |
232 | enum drm_mm_allocator_flags flags) | |
3a1bd924 | 233 | { |
ea7b1dd4 | 234 | struct drm_mm *mm = hole_node->mm; |
440fd528 TR |
235 | u64 hole_start = drm_mm_hole_node_start(hole_node); |
236 | u64 hole_end = drm_mm_hole_node_end(hole_node); | |
237 | u64 adj_start = hole_start; | |
238 | u64 adj_end = hole_end; | |
ea7b1dd4 | 239 | |
9e8944ab | 240 | BUG_ON(node->allocated); |
b0b7af18 | 241 | |
6b9d89b4 CW |
242 | if (mm->color_adjust) |
243 | mm->color_adjust(hole_node, color, &adj_start, &adj_end); | |
1d58420b | 244 | |
62347f9e LK |
245 | if (flags & DRM_MM_CREATE_TOP) |
246 | adj_start = adj_end - size; | |
247 | ||
6b9d89b4 | 248 | if (alignment) { |
440fd528 TR |
249 | u64 tmp = adj_start; |
250 | unsigned rem; | |
251 | ||
252 | rem = do_div(tmp, alignment); | |
253 | if (rem) { | |
62347f9e | 254 | if (flags & DRM_MM_CREATE_TOP) |
440fd528 | 255 | adj_start -= rem; |
62347f9e | 256 | else |
440fd528 | 257 | adj_start += alignment - rem; |
62347f9e | 258 | } |
6b9d89b4 CW |
259 | } |
260 | ||
62347f9e LK |
261 | BUG_ON(adj_start < hole_start); |
262 | BUG_ON(adj_end > hole_end); | |
263 | ||
6b9d89b4 | 264 | if (adj_start == hole_start) { |
ea7b1dd4 | 265 | hole_node->hole_follows = 0; |
6b9d89b4 CW |
266 | list_del(&hole_node->hole_stack); |
267 | } | |
ea7b1dd4 | 268 | |
6b9d89b4 | 269 | node->start = adj_start; |
ea7b1dd4 DV |
270 | node->size = size; |
271 | node->mm = mm; | |
6b9d89b4 | 272 | node->color = color; |
b0b7af18 | 273 | node->allocated = 1; |
3a1bd924 | 274 | |
ea7b1dd4 DV |
275 | list_add(&node->node_list, &hole_node->node_list); |
276 | ||
202b52b7 CW |
277 | drm_mm_interval_tree_add_node(hole_node, node); |
278 | ||
6b9d89b4 | 279 | BUG_ON(node->start + node->size > adj_end); |
ea7b1dd4 | 280 | |
6b9d89b4 | 281 | node->hole_follows = 0; |
9e8944ab | 282 | if (__drm_mm_hole_node_start(node) < hole_end) { |
ea7b1dd4 DV |
283 | list_add(&node->hole_stack, &mm->hole_stack); |
284 | node->hole_follows = 1; | |
1d58420b | 285 | } |
5705670d CW |
286 | |
287 | save_stack(node); | |
9fc935de DV |
288 | } |
289 | ||
e18c0412 DV |
290 | /** |
291 | * drm_mm_reserve_node - insert an pre-initialized node | |
292 | * @mm: drm_mm allocator to insert @node into | |
293 | * @node: drm_mm_node to insert | |
294 | * | |
295 | * This functions inserts an already set-up drm_mm_node into the allocator, | |
296 | * meaning that start, size and color must be set by the caller. This is useful | |
297 | * to initialize the allocator with preallocated objects which must be set-up | |
298 | * before the range allocator can be set-up, e.g. when taking over a firmware | |
299 | * framebuffer. | |
300 | * | |
301 | * Returns: | |
302 | * 0 on success, -ENOSPC if there's no hole where @node is. | |
303 | */ | |
338710e7 | 304 | int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node) |
5973c7ee | 305 | { |
202b52b7 | 306 | u64 end = node->start + node->size; |
b3a070cc | 307 | struct drm_mm_node *hole; |
202b52b7 | 308 | u64 hole_start, hole_end; |
2db86dfc | 309 | u64 adj_start, adj_end; |
338710e7 | 310 | |
aafdcfd3 CW |
311 | if (WARN_ON(node->size == 0)) |
312 | return -EINVAL; | |
313 | ||
b80d3942 HS |
314 | end = node->start + node->size; |
315 | ||
338710e7 | 316 | /* Find the relevant hole to add our node to */ |
202b52b7 CW |
317 | hole = drm_mm_interval_tree_iter_first(&mm->interval_tree, |
318 | node->start, ~(u64)0); | |
319 | if (hole) { | |
320 | if (hole->start < end) | |
321 | return -ENOSPC; | |
322 | } else { | |
323 | hole = list_entry(&mm->head_node.node_list, | |
324 | typeof(*hole), node_list); | |
325 | } | |
5973c7ee | 326 | |
202b52b7 CW |
327 | hole = list_last_entry(&hole->node_list, typeof(*hole), node_list); |
328 | if (!hole->hole_follows) | |
329 | return -ENOSPC; | |
5973c7ee | 330 | |
2db86dfc CW |
331 | adj_start = hole_start = __drm_mm_hole_node_start(hole); |
332 | adj_end = hole_end = __drm_mm_hole_node_end(hole); | |
333 | ||
334 | if (mm->color_adjust) | |
335 | mm->color_adjust(hole, node->color, &adj_start, &adj_end); | |
336 | ||
337 | if (adj_start > node->start || adj_end < end) | |
202b52b7 | 338 | return -ENOSPC; |
5973c7ee | 339 | |
202b52b7 CW |
340 | node->mm = mm; |
341 | node->allocated = 1; | |
5973c7ee | 342 | |
202b52b7 | 343 | list_add(&node->node_list, &hole->node_list); |
5973c7ee | 344 | |
202b52b7 CW |
345 | drm_mm_interval_tree_add_node(hole, node); |
346 | ||
347 | if (node->start == hole_start) { | |
348 | hole->hole_follows = 0; | |
a7879005 | 349 | list_del(&hole->hole_stack); |
202b52b7 CW |
350 | } |
351 | ||
352 | node->hole_follows = 0; | |
353 | if (end != hole_end) { | |
354 | list_add(&node->hole_stack, &mm->hole_stack); | |
355 | node->hole_follows = 1; | |
5973c7ee CW |
356 | } |
357 | ||
5705670d CW |
358 | save_stack(node); |
359 | ||
202b52b7 | 360 | return 0; |
5973c7ee | 361 | } |
338710e7 | 362 | EXPORT_SYMBOL(drm_mm_reserve_node); |
5973c7ee | 363 | |
b0b7af18 | 364 | /** |
e18c0412 DV |
365 | * drm_mm_insert_node_generic - search for space and insert @node |
366 | * @mm: drm_mm to allocate from | |
367 | * @node: preallocate node to insert | |
368 | * @size: size of the allocation | |
369 | * @alignment: alignment of the allocation | |
370 | * @color: opaque tag value to use for this node | |
62347f9e LK |
371 | * @sflags: flags to fine-tune the allocation search |
372 | * @aflags: flags to fine-tune the allocation behavior | |
e18c0412 DV |
373 | * |
374 | * The preallocated node must be cleared to 0. | |
375 | * | |
376 | * Returns: | |
377 | * 0 on success, -ENOSPC if there's no suitable hole. | |
b0b7af18 | 378 | */ |
b8103450 | 379 | int drm_mm_insert_node_generic(struct drm_mm *mm, struct drm_mm_node *node, |
440fd528 | 380 | u64 size, unsigned alignment, |
31e5d7c6 | 381 | unsigned long color, |
62347f9e LK |
382 | enum drm_mm_search_flags sflags, |
383 | enum drm_mm_allocator_flags aflags) | |
b0b7af18 DV |
384 | { |
385 | struct drm_mm_node *hole_node; | |
386 | ||
aafdcfd3 CW |
387 | if (WARN_ON(size == 0)) |
388 | return -EINVAL; | |
389 | ||
b8103450 | 390 | hole_node = drm_mm_search_free_generic(mm, size, alignment, |
62347f9e | 391 | color, sflags); |
b0b7af18 DV |
392 | if (!hole_node) |
393 | return -ENOSPC; | |
394 | ||
62347f9e | 395 | drm_mm_insert_helper(hole_node, node, size, alignment, color, aflags); |
b0b7af18 DV |
396 | return 0; |
397 | } | |
b8103450 CW |
398 | EXPORT_SYMBOL(drm_mm_insert_node_generic); |
399 | ||
9fc935de DV |
400 | static void drm_mm_insert_helper_range(struct drm_mm_node *hole_node, |
401 | struct drm_mm_node *node, | |
440fd528 | 402 | u64 size, unsigned alignment, |
6b9d89b4 | 403 | unsigned long color, |
440fd528 | 404 | u64 start, u64 end, |
62347f9e | 405 | enum drm_mm_allocator_flags flags) |
a2e68e92 | 406 | { |
ea7b1dd4 | 407 | struct drm_mm *mm = hole_node->mm; |
440fd528 TR |
408 | u64 hole_start = drm_mm_hole_node_start(hole_node); |
409 | u64 hole_end = drm_mm_hole_node_end(hole_node); | |
410 | u64 adj_start = hole_start; | |
411 | u64 adj_end = hole_end; | |
a2e68e92 | 412 | |
b0b7af18 DV |
413 | BUG_ON(!hole_node->hole_follows || node->allocated); |
414 | ||
6b9d89b4 CW |
415 | if (adj_start < start) |
416 | adj_start = start; | |
901593f2 CW |
417 | if (adj_end > end) |
418 | adj_end = end; | |
419 | ||
420 | if (mm->color_adjust) | |
421 | mm->color_adjust(hole_node, color, &adj_start, &adj_end); | |
6b9d89b4 | 422 | |
fafecc01 MT |
423 | if (flags & DRM_MM_CREATE_TOP) |
424 | adj_start = adj_end - size; | |
425 | ||
6b9d89b4 | 426 | if (alignment) { |
440fd528 TR |
427 | u64 tmp = adj_start; |
428 | unsigned rem; | |
429 | ||
430 | rem = do_div(tmp, alignment); | |
431 | if (rem) { | |
62347f9e | 432 | if (flags & DRM_MM_CREATE_TOP) |
440fd528 | 433 | adj_start -= rem; |
62347f9e | 434 | else |
440fd528 | 435 | adj_start += alignment - rem; |
62347f9e | 436 | } |
6b9d89b4 | 437 | } |
ea7b1dd4 | 438 | |
6b9d89b4 | 439 | if (adj_start == hole_start) { |
ea7b1dd4 | 440 | hole_node->hole_follows = 0; |
6b9d89b4 | 441 | list_del(&hole_node->hole_stack); |
a2e68e92 JG |
442 | } |
443 | ||
6b9d89b4 | 444 | node->start = adj_start; |
ea7b1dd4 DV |
445 | node->size = size; |
446 | node->mm = mm; | |
6b9d89b4 | 447 | node->color = color; |
b0b7af18 | 448 | node->allocated = 1; |
ea7b1dd4 | 449 | |
ea7b1dd4 DV |
450 | list_add(&node->node_list, &hole_node->node_list); |
451 | ||
202b52b7 CW |
452 | drm_mm_interval_tree_add_node(hole_node, node); |
453 | ||
62347f9e LK |
454 | BUG_ON(node->start < start); |
455 | BUG_ON(node->start < adj_start); | |
6b9d89b4 | 456 | BUG_ON(node->start + node->size > adj_end); |
ea7b1dd4 DV |
457 | BUG_ON(node->start + node->size > end); |
458 | ||
6b9d89b4 | 459 | node->hole_follows = 0; |
9e8944ab | 460 | if (__drm_mm_hole_node_start(node) < hole_end) { |
ea7b1dd4 DV |
461 | list_add(&node->hole_stack, &mm->hole_stack); |
462 | node->hole_follows = 1; | |
a2e68e92 | 463 | } |
5705670d CW |
464 | |
465 | save_stack(node); | |
9fc935de DV |
466 | } |
467 | ||
b0b7af18 | 468 | /** |
e18c0412 DV |
469 | * drm_mm_insert_node_in_range_generic - ranged search for space and insert @node |
470 | * @mm: drm_mm to allocate from | |
471 | * @node: preallocate node to insert | |
472 | * @size: size of the allocation | |
473 | * @alignment: alignment of the allocation | |
474 | * @color: opaque tag value to use for this node | |
475 | * @start: start of the allowed range for this node | |
476 | * @end: end of the allowed range for this node | |
62347f9e LK |
477 | * @sflags: flags to fine-tune the allocation search |
478 | * @aflags: flags to fine-tune the allocation behavior | |
e18c0412 DV |
479 | * |
480 | * The preallocated node must be cleared to 0. | |
481 | * | |
482 | * Returns: | |
483 | * 0 on success, -ENOSPC if there's no suitable hole. | |
3a1bd924 | 484 | */ |
b8103450 | 485 | int drm_mm_insert_node_in_range_generic(struct drm_mm *mm, struct drm_mm_node *node, |
440fd528 | 486 | u64 size, unsigned alignment, |
62347f9e | 487 | unsigned long color, |
440fd528 | 488 | u64 start, u64 end, |
62347f9e LK |
489 | enum drm_mm_search_flags sflags, |
490 | enum drm_mm_allocator_flags aflags) | |
3a1bd924 | 491 | { |
b0b7af18 DV |
492 | struct drm_mm_node *hole_node; |
493 | ||
aafdcfd3 CW |
494 | if (WARN_ON(size == 0)) |
495 | return -EINVAL; | |
496 | ||
b8103450 CW |
497 | hole_node = drm_mm_search_free_in_range_generic(mm, |
498 | size, alignment, color, | |
62347f9e | 499 | start, end, sflags); |
b0b7af18 DV |
500 | if (!hole_node) |
501 | return -ENOSPC; | |
502 | ||
b8103450 CW |
503 | drm_mm_insert_helper_range(hole_node, node, |
504 | size, alignment, color, | |
62347f9e | 505 | start, end, aflags); |
b0b7af18 DV |
506 | return 0; |
507 | } | |
b8103450 CW |
508 | EXPORT_SYMBOL(drm_mm_insert_node_in_range_generic); |
509 | ||
b0b7af18 | 510 | /** |
e18c0412 DV |
511 | * drm_mm_remove_node - Remove a memory node from the allocator. |
512 | * @node: drm_mm_node to remove | |
513 | * | |
514 | * This just removes a node from its drm_mm allocator. The node does not need to | |
515 | * be cleared again before it can be re-inserted into this or any other drm_mm | |
516 | * allocator. It is a bug to call this function on a un-allocated node. | |
b0b7af18 DV |
517 | */ |
518 | void drm_mm_remove_node(struct drm_mm_node *node) | |
519 | { | |
ea7b1dd4 DV |
520 | struct drm_mm *mm = node->mm; |
521 | struct drm_mm_node *prev_node; | |
3a1bd924 | 522 | |
3ef80a81 BW |
523 | if (WARN_ON(!node->allocated)) |
524 | return; | |
525 | ||
ea7b1dd4 DV |
526 | BUG_ON(node->scanned_block || node->scanned_prev_free |
527 | || node->scanned_next_free); | |
3a1bd924 | 528 | |
ea7b1dd4 DV |
529 | prev_node = |
530 | list_entry(node->node_list.prev, struct drm_mm_node, node_list); | |
709ea971 | 531 | |
ea7b1dd4 | 532 | if (node->hole_follows) { |
9e8944ab CW |
533 | BUG_ON(__drm_mm_hole_node_start(node) == |
534 | __drm_mm_hole_node_end(node)); | |
ea7b1dd4 DV |
535 | list_del(&node->hole_stack); |
536 | } else | |
9e8944ab CW |
537 | BUG_ON(__drm_mm_hole_node_start(node) != |
538 | __drm_mm_hole_node_end(node)); | |
539 | ||
249d6048 | 540 | |
ea7b1dd4 DV |
541 | if (!prev_node->hole_follows) { |
542 | prev_node->hole_follows = 1; | |
543 | list_add(&prev_node->hole_stack, &mm->hole_stack); | |
544 | } else | |
545 | list_move(&prev_node->hole_stack, &mm->hole_stack); | |
546 | ||
202b52b7 | 547 | drm_mm_interval_tree_remove(node, &mm->interval_tree); |
ea7b1dd4 | 548 | list_del(&node->node_list); |
b0b7af18 DV |
549 | node->allocated = 0; |
550 | } | |
551 | EXPORT_SYMBOL(drm_mm_remove_node); | |
552 | ||
440fd528 | 553 | static int check_free_hole(u64 start, u64 end, u64 size, unsigned alignment) |
7a6b2896 | 554 | { |
75214733 | 555 | if (end - start < size) |
7a6b2896 DV |
556 | return 0; |
557 | ||
558 | if (alignment) { | |
440fd528 TR |
559 | u64 tmp = start; |
560 | unsigned rem; | |
561 | ||
562 | rem = do_div(tmp, alignment); | |
046d669c | 563 | if (rem) |
440fd528 | 564 | start += alignment - rem; |
7a6b2896 DV |
565 | } |
566 | ||
6b9d89b4 | 567 | return end >= start + size; |
7a6b2896 DV |
568 | } |
569 | ||
c700c67b | 570 | static struct drm_mm_node *drm_mm_search_free_generic(const struct drm_mm *mm, |
440fd528 | 571 | u64 size, |
c700c67b DH |
572 | unsigned alignment, |
573 | unsigned long color, | |
574 | enum drm_mm_search_flags flags) | |
3a1bd924 | 575 | { |
55910517 DA |
576 | struct drm_mm_node *entry; |
577 | struct drm_mm_node *best; | |
440fd528 TR |
578 | u64 adj_start; |
579 | u64 adj_end; | |
580 | u64 best_size; | |
3a1bd924 | 581 | |
709ea971 DV |
582 | BUG_ON(mm->scanned_blocks); |
583 | ||
3a1bd924 TH |
584 | best = NULL; |
585 | best_size = ~0UL; | |
586 | ||
62347f9e LK |
587 | __drm_mm_for_each_hole(entry, mm, adj_start, adj_end, |
588 | flags & DRM_MM_SEARCH_BELOW) { | |
440fd528 | 589 | u64 hole_size = adj_end - adj_start; |
145bccd2 | 590 | |
6b9d89b4 CW |
591 | if (mm->color_adjust) { |
592 | mm->color_adjust(entry, color, &adj_start, &adj_end); | |
593 | if (adj_end <= adj_start) | |
594 | continue; | |
595 | } | |
596 | ||
6b9d89b4 | 597 | if (!check_free_hole(adj_start, adj_end, size, alignment)) |
1d58420b TH |
598 | continue; |
599 | ||
31e5d7c6 | 600 | if (!(flags & DRM_MM_SEARCH_BEST)) |
7a6b2896 | 601 | return entry; |
1d58420b | 602 | |
145bccd2 | 603 | if (hole_size < best_size) { |
7a6b2896 | 604 | best = entry; |
145bccd2 | 605 | best_size = hole_size; |
3a1bd924 TH |
606 | } |
607 | } | |
608 | ||
609 | return best; | |
610 | } | |
6b9d89b4 | 611 | |
c700c67b | 612 | static struct drm_mm_node *drm_mm_search_free_in_range_generic(const struct drm_mm *mm, |
440fd528 | 613 | u64 size, |
6b9d89b4 CW |
614 | unsigned alignment, |
615 | unsigned long color, | |
440fd528 TR |
616 | u64 start, |
617 | u64 end, | |
31e5d7c6 | 618 | enum drm_mm_search_flags flags) |
a2e68e92 | 619 | { |
a2e68e92 JG |
620 | struct drm_mm_node *entry; |
621 | struct drm_mm_node *best; | |
440fd528 TR |
622 | u64 adj_start; |
623 | u64 adj_end; | |
624 | u64 best_size; | |
a2e68e92 | 625 | |
709ea971 DV |
626 | BUG_ON(mm->scanned_blocks); |
627 | ||
a2e68e92 JG |
628 | best = NULL; |
629 | best_size = ~0UL; | |
630 | ||
62347f9e LK |
631 | __drm_mm_for_each_hole(entry, mm, adj_start, adj_end, |
632 | flags & DRM_MM_SEARCH_BELOW) { | |
440fd528 | 633 | u64 hole_size = adj_end - adj_start; |
145bccd2 | 634 | |
9e8944ab CW |
635 | if (adj_start < start) |
636 | adj_start = start; | |
637 | if (adj_end > end) | |
638 | adj_end = end; | |
6b9d89b4 CW |
639 | |
640 | if (mm->color_adjust) { | |
641 | mm->color_adjust(entry, color, &adj_start, &adj_end); | |
642 | if (adj_end <= adj_start) | |
643 | continue; | |
644 | } | |
645 | ||
75214733 | 646 | if (!check_free_hole(adj_start, adj_end, size, alignment)) |
a2e68e92 JG |
647 | continue; |
648 | ||
31e5d7c6 | 649 | if (!(flags & DRM_MM_SEARCH_BEST)) |
7a6b2896 | 650 | return entry; |
a2e68e92 | 651 | |
145bccd2 | 652 | if (hole_size < best_size) { |
7a6b2896 | 653 | best = entry; |
145bccd2 | 654 | best_size = hole_size; |
a2e68e92 JG |
655 | } |
656 | } | |
657 | ||
658 | return best; | |
659 | } | |
a2e68e92 | 660 | |
b0b7af18 | 661 | /** |
e18c0412 DV |
662 | * drm_mm_replace_node - move an allocation from @old to @new |
663 | * @old: drm_mm_node to remove from the allocator | |
664 | * @new: drm_mm_node which should inherit @old's allocation | |
665 | * | |
666 | * This is useful for when drivers embed the drm_mm_node structure and hence | |
667 | * can't move allocations by reassigning pointers. It's a combination of remove | |
668 | * and insert with the guarantee that the allocation start will match. | |
b0b7af18 DV |
669 | */ |
670 | void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new) | |
671 | { | |
672 | list_replace(&old->node_list, &new->node_list); | |
2bbd4492 | 673 | list_replace(&old->hole_stack, &new->hole_stack); |
202b52b7 | 674 | rb_replace_node(&old->rb, &new->rb, &old->mm->interval_tree); |
b0b7af18 DV |
675 | new->hole_follows = old->hole_follows; |
676 | new->mm = old->mm; | |
677 | new->start = old->start; | |
678 | new->size = old->size; | |
6b9d89b4 | 679 | new->color = old->color; |
202b52b7 | 680 | new->__subtree_last = old->__subtree_last; |
b0b7af18 DV |
681 | |
682 | old->allocated = 0; | |
683 | new->allocated = 1; | |
684 | } | |
685 | EXPORT_SYMBOL(drm_mm_replace_node); | |
686 | ||
93110be6 DV |
687 | /** |
688 | * DOC: lru scan roaster | |
689 | * | |
690 | * Very often GPUs need to have continuous allocations for a given object. When | |
691 | * evicting objects to make space for a new one it is therefore not most | |
692 | * efficient when we simply start to select all objects from the tail of an LRU | |
693 | * until there's a suitable hole: Especially for big objects or nodes that | |
694 | * otherwise have special allocation constraints there's a good chance we evict | |
695 | * lots of (smaller) objects unecessarily. | |
696 | * | |
697 | * The DRM range allocator supports this use-case through the scanning | |
698 | * interfaces. First a scan operation needs to be initialized with | |
699 | * drm_mm_init_scan() or drm_mm_init_scan_with_range(). The the driver adds | |
700 | * objects to the roaster (probably by walking an LRU list, but this can be | |
701 | * freely implemented) until a suitable hole is found or there's no further | |
702 | * evitable object. | |
703 | * | |
704 | * The the driver must walk through all objects again in exactly the reverse | |
705 | * order to restore the allocator state. Note that while the allocator is used | |
706 | * in the scan mode no other operation is allowed. | |
707 | * | |
708 | * Finally the driver evicts all objects selected in the scan. Adding and | |
709 | * removing an object is O(1), and since freeing a node is also O(1) the overall | |
710 | * complexity is O(scanned_objects). So like the free stack which needs to be | |
711 | * walked before a scan operation even begins this is linear in the number of | |
712 | * objects. It doesn't seem to hurt badly. | |
713 | */ | |
714 | ||
709ea971 | 715 | /** |
e18c0412 DV |
716 | * drm_mm_init_scan - initialize lru scanning |
717 | * @mm: drm_mm to scan | |
718 | * @size: size of the allocation | |
719 | * @alignment: alignment of the allocation | |
720 | * @color: opaque tag value to use for the allocation | |
709ea971 DV |
721 | * |
722 | * This simply sets up the scanning routines with the parameters for the desired | |
e18c0412 DV |
723 | * hole. Note that there's no need to specify allocation flags, since they only |
724 | * change the place a node is allocated from within a suitable hole. | |
709ea971 | 725 | * |
e18c0412 DV |
726 | * Warning: |
727 | * As long as the scan list is non-empty, no other operations than | |
709ea971 DV |
728 | * adding/removing nodes to/from the scan list are allowed. |
729 | */ | |
6b9d89b4 | 730 | void drm_mm_init_scan(struct drm_mm *mm, |
440fd528 | 731 | u64 size, |
6b9d89b4 CW |
732 | unsigned alignment, |
733 | unsigned long color) | |
709ea971 | 734 | { |
6b9d89b4 | 735 | mm->scan_color = color; |
709ea971 DV |
736 | mm->scan_alignment = alignment; |
737 | mm->scan_size = size; | |
738 | mm->scanned_blocks = 0; | |
739 | mm->scan_hit_start = 0; | |
901593f2 | 740 | mm->scan_hit_end = 0; |
d935cc61 | 741 | mm->scan_check_range = 0; |
ae0cec28 | 742 | mm->prev_scanned_node = NULL; |
709ea971 DV |
743 | } |
744 | EXPORT_SYMBOL(drm_mm_init_scan); | |
745 | ||
d935cc61 | 746 | /** |
e18c0412 DV |
747 | * drm_mm_init_scan - initialize range-restricted lru scanning |
748 | * @mm: drm_mm to scan | |
749 | * @size: size of the allocation | |
750 | * @alignment: alignment of the allocation | |
751 | * @color: opaque tag value to use for the allocation | |
752 | * @start: start of the allowed range for the allocation | |
753 | * @end: end of the allowed range for the allocation | |
d935cc61 DV |
754 | * |
755 | * This simply sets up the scanning routines with the parameters for the desired | |
e18c0412 DV |
756 | * hole. Note that there's no need to specify allocation flags, since they only |
757 | * change the place a node is allocated from within a suitable hole. | |
d935cc61 | 758 | * |
e18c0412 DV |
759 | * Warning: |
760 | * As long as the scan list is non-empty, no other operations than | |
d935cc61 DV |
761 | * adding/removing nodes to/from the scan list are allowed. |
762 | */ | |
6b9d89b4 | 763 | void drm_mm_init_scan_with_range(struct drm_mm *mm, |
440fd528 | 764 | u64 size, |
d935cc61 | 765 | unsigned alignment, |
6b9d89b4 | 766 | unsigned long color, |
440fd528 TR |
767 | u64 start, |
768 | u64 end) | |
d935cc61 | 769 | { |
6b9d89b4 | 770 | mm->scan_color = color; |
d935cc61 DV |
771 | mm->scan_alignment = alignment; |
772 | mm->scan_size = size; | |
773 | mm->scanned_blocks = 0; | |
774 | mm->scan_hit_start = 0; | |
901593f2 | 775 | mm->scan_hit_end = 0; |
d935cc61 DV |
776 | mm->scan_start = start; |
777 | mm->scan_end = end; | |
778 | mm->scan_check_range = 1; | |
ae0cec28 | 779 | mm->prev_scanned_node = NULL; |
d935cc61 DV |
780 | } |
781 | EXPORT_SYMBOL(drm_mm_init_scan_with_range); | |
782 | ||
709ea971 | 783 | /** |
e18c0412 DV |
784 | * drm_mm_scan_add_block - add a node to the scan list |
785 | * @node: drm_mm_node to add | |
786 | * | |
709ea971 DV |
787 | * Add a node to the scan list that might be freed to make space for the desired |
788 | * hole. | |
789 | * | |
e18c0412 DV |
790 | * Returns: |
791 | * True if a hole has been found, false otherwise. | |
709ea971 | 792 | */ |
e18c0412 | 793 | bool drm_mm_scan_add_block(struct drm_mm_node *node) |
709ea971 DV |
794 | { |
795 | struct drm_mm *mm = node->mm; | |
ea7b1dd4 | 796 | struct drm_mm_node *prev_node; |
440fd528 TR |
797 | u64 hole_start, hole_end; |
798 | u64 adj_start, adj_end; | |
709ea971 DV |
799 | |
800 | mm->scanned_blocks++; | |
801 | ||
ea7b1dd4 | 802 | BUG_ON(node->scanned_block); |
709ea971 | 803 | node->scanned_block = 1; |
709ea971 | 804 | |
ea7b1dd4 DV |
805 | prev_node = list_entry(node->node_list.prev, struct drm_mm_node, |
806 | node_list); | |
709ea971 | 807 | |
ea7b1dd4 DV |
808 | node->scanned_preceeds_hole = prev_node->hole_follows; |
809 | prev_node->hole_follows = 1; | |
810 | list_del(&node->node_list); | |
811 | node->node_list.prev = &prev_node->node_list; | |
ae0cec28 DV |
812 | node->node_list.next = &mm->prev_scanned_node->node_list; |
813 | mm->prev_scanned_node = node; | |
709ea971 | 814 | |
901593f2 CW |
815 | adj_start = hole_start = drm_mm_hole_node_start(prev_node); |
816 | adj_end = hole_end = drm_mm_hole_node_end(prev_node); | |
6b9d89b4 | 817 | |
d935cc61 | 818 | if (mm->scan_check_range) { |
6b9d89b4 CW |
819 | if (adj_start < mm->scan_start) |
820 | adj_start = mm->scan_start; | |
821 | if (adj_end > mm->scan_end) | |
822 | adj_end = mm->scan_end; | |
d935cc61 DV |
823 | } |
824 | ||
901593f2 CW |
825 | if (mm->color_adjust) |
826 | mm->color_adjust(prev_node, mm->scan_color, | |
827 | &adj_start, &adj_end); | |
828 | ||
6b9d89b4 | 829 | if (check_free_hole(adj_start, adj_end, |
75214733 | 830 | mm->scan_size, mm->scan_alignment)) { |
ea7b1dd4 | 831 | mm->scan_hit_start = hole_start; |
901593f2 | 832 | mm->scan_hit_end = hole_end; |
e18c0412 | 833 | return true; |
709ea971 DV |
834 | } |
835 | ||
e18c0412 | 836 | return false; |
709ea971 DV |
837 | } |
838 | EXPORT_SYMBOL(drm_mm_scan_add_block); | |
839 | ||
840 | /** | |
e18c0412 DV |
841 | * drm_mm_scan_remove_block - remove a node from the scan list |
842 | * @node: drm_mm_node to remove | |
709ea971 DV |
843 | * |
844 | * Nodes _must_ be removed in the exact same order from the scan list as they | |
845 | * have been added, otherwise the internal state of the memory manager will be | |
846 | * corrupted. | |
847 | * | |
848 | * When the scan list is empty, the selected memory nodes can be freed. An | |
31e5d7c6 DH |
849 | * immediately following drm_mm_search_free with !DRM_MM_SEARCH_BEST will then |
850 | * return the just freed block (because its at the top of the free_stack list). | |
709ea971 | 851 | * |
e18c0412 DV |
852 | * Returns: |
853 | * True if this block should be evicted, false otherwise. Will always | |
854 | * return false when no hole has been found. | |
709ea971 | 855 | */ |
e18c0412 | 856 | bool drm_mm_scan_remove_block(struct drm_mm_node *node) |
709ea971 DV |
857 | { |
858 | struct drm_mm *mm = node->mm; | |
ea7b1dd4 | 859 | struct drm_mm_node *prev_node; |
709ea971 DV |
860 | |
861 | mm->scanned_blocks--; | |
862 | ||
863 | BUG_ON(!node->scanned_block); | |
864 | node->scanned_block = 0; | |
709ea971 | 865 | |
ea7b1dd4 DV |
866 | prev_node = list_entry(node->node_list.prev, struct drm_mm_node, |
867 | node_list); | |
709ea971 | 868 | |
ea7b1dd4 | 869 | prev_node->hole_follows = node->scanned_preceeds_hole; |
ea7b1dd4 | 870 | list_add(&node->node_list, &prev_node->node_list); |
709ea971 | 871 | |
901593f2 CW |
872 | return (drm_mm_hole_node_end(node) > mm->scan_hit_start && |
873 | node->start < mm->scan_hit_end); | |
709ea971 DV |
874 | } |
875 | EXPORT_SYMBOL(drm_mm_scan_remove_block); | |
876 | ||
e18c0412 DV |
877 | /** |
878 | * drm_mm_clean - checks whether an allocator is clean | |
879 | * @mm: drm_mm allocator to check | |
880 | * | |
881 | * Returns: | |
882 | * True if the allocator is completely free, false if there's still a node | |
883 | * allocated in it. | |
884 | */ | |
885 | bool drm_mm_clean(struct drm_mm * mm) | |
3a1bd924 | 886 | { |
ea7b1dd4 | 887 | struct list_head *head = &mm->head_node.node_list; |
3a1bd924 | 888 | |
1d58420b TH |
889 | return (head->next->next == head); |
890 | } | |
249d6048 | 891 | EXPORT_SYMBOL(drm_mm_clean); |
3a1bd924 | 892 | |
e18c0412 DV |
893 | /** |
894 | * drm_mm_init - initialize a drm-mm allocator | |
895 | * @mm: the drm_mm structure to initialize | |
896 | * @start: start of the range managed by @mm | |
897 | * @size: end of the range managed by @mm | |
898 | * | |
899 | * Note that @mm must be cleared to 0 before calling this function. | |
900 | */ | |
440fd528 | 901 | void drm_mm_init(struct drm_mm * mm, u64 start, u64 size) |
1d58420b | 902 | { |
ea7b1dd4 | 903 | INIT_LIST_HEAD(&mm->hole_stack); |
709ea971 | 904 | mm->scanned_blocks = 0; |
3a1bd924 | 905 | |
ea7b1dd4 DV |
906 | /* Clever trick to avoid a special case in the free hole tracking. */ |
907 | INIT_LIST_HEAD(&mm->head_node.node_list); | |
cc98e6ce | 908 | mm->head_node.allocated = 0; |
ea7b1dd4 DV |
909 | mm->head_node.hole_follows = 1; |
910 | mm->head_node.scanned_block = 0; | |
911 | mm->head_node.scanned_prev_free = 0; | |
912 | mm->head_node.scanned_next_free = 0; | |
913 | mm->head_node.mm = mm; | |
914 | mm->head_node.start = start + size; | |
915 | mm->head_node.size = start - mm->head_node.start; | |
916 | list_add_tail(&mm->head_node.hole_stack, &mm->hole_stack); | |
917 | ||
202b52b7 CW |
918 | mm->interval_tree = RB_ROOT; |
919 | ||
6b9d89b4 | 920 | mm->color_adjust = NULL; |
3a1bd924 | 921 | } |
673a394b | 922 | EXPORT_SYMBOL(drm_mm_init); |
3a1bd924 | 923 | |
e18c0412 DV |
924 | /** |
925 | * drm_mm_takedown - clean up a drm_mm allocator | |
926 | * @mm: drm_mm allocator to clean up | |
927 | * | |
928 | * Note that it is a bug to call this function on an allocator which is not | |
929 | * clean. | |
930 | */ | |
5705670d | 931 | void drm_mm_takedown(struct drm_mm *mm) |
3a1bd924 | 932 | { |
5705670d CW |
933 | if (WARN(!list_empty(&mm->head_node.node_list), |
934 | "Memory manager not clean during takedown.\n")) | |
935 | show_leaks(mm); | |
936 | ||
3a1bd924 | 937 | } |
f453ba04 | 938 | EXPORT_SYMBOL(drm_mm_takedown); |
fa8a1238 | 939 | |
440fd528 TR |
940 | static u64 drm_mm_debug_hole(struct drm_mm_node *entry, |
941 | const char *prefix) | |
99d7e48e | 942 | { |
440fd528 | 943 | u64 hole_start, hole_end, hole_size; |
ea7b1dd4 | 944 | |
2c54b133 DV |
945 | if (entry->hole_follows) { |
946 | hole_start = drm_mm_hole_node_start(entry); | |
947 | hole_end = drm_mm_hole_node_end(entry); | |
948 | hole_size = hole_end - hole_start; | |
440fd528 TR |
949 | pr_debug("%s %#llx-%#llx: %llu: free\n", prefix, hole_start, |
950 | hole_end, hole_size); | |
2c54b133 DV |
951 | return hole_size; |
952 | } | |
953 | ||
954 | return 0; | |
955 | } | |
956 | ||
e18c0412 DV |
957 | /** |
958 | * drm_mm_debug_table - dump allocator state to dmesg | |
959 | * @mm: drm_mm allocator to dump | |
960 | * @prefix: prefix to use for dumping to dmesg | |
961 | */ | |
2c54b133 DV |
962 | void drm_mm_debug_table(struct drm_mm *mm, const char *prefix) |
963 | { | |
964 | struct drm_mm_node *entry; | |
440fd528 | 965 | u64 total_used = 0, total_free = 0, total = 0; |
2c54b133 DV |
966 | |
967 | total_free += drm_mm_debug_hole(&mm->head_node, prefix); | |
ea7b1dd4 DV |
968 | |
969 | drm_mm_for_each_node(entry, mm) { | |
440fd528 TR |
970 | pr_debug("%s %#llx-%#llx: %llu: used\n", prefix, entry->start, |
971 | entry->start + entry->size, entry->size); | |
ea7b1dd4 | 972 | total_used += entry->size; |
2c54b133 | 973 | total_free += drm_mm_debug_hole(entry, prefix); |
99d7e48e | 974 | } |
ea7b1dd4 DV |
975 | total = total_free + total_used; |
976 | ||
440fd528 TR |
977 | pr_debug("%s total: %llu, used %llu free %llu\n", prefix, total, |
978 | total_used, total_free); | |
99d7e48e JG |
979 | } |
980 | EXPORT_SYMBOL(drm_mm_debug_table); | |
981 | ||
fa8a1238 | 982 | #if defined(CONFIG_DEBUG_FS) |
440fd528 | 983 | static u64 drm_mm_dump_hole(struct seq_file *m, struct drm_mm_node *entry) |
fa8a1238 | 984 | { |
440fd528 | 985 | u64 hole_start, hole_end, hole_size; |
ea7b1dd4 | 986 | |
3a359f0b DV |
987 | if (entry->hole_follows) { |
988 | hole_start = drm_mm_hole_node_start(entry); | |
989 | hole_end = drm_mm_hole_node_end(entry); | |
990 | hole_size = hole_end - hole_start; | |
2f15791c | 991 | seq_printf(m, "%#018llx-%#018llx: %llu: free\n", hole_start, |
440fd528 | 992 | hole_end, hole_size); |
3a359f0b DV |
993 | return hole_size; |
994 | } | |
995 | ||
996 | return 0; | |
997 | } | |
998 | ||
e18c0412 DV |
999 | /** |
1000 | * drm_mm_dump_table - dump allocator state to a seq_file | |
1001 | * @m: seq_file to dump to | |
1002 | * @mm: drm_mm allocator to dump | |
1003 | */ | |
3a359f0b DV |
1004 | int drm_mm_dump_table(struct seq_file *m, struct drm_mm *mm) |
1005 | { | |
1006 | struct drm_mm_node *entry; | |
440fd528 | 1007 | u64 total_used = 0, total_free = 0, total = 0; |
3a359f0b DV |
1008 | |
1009 | total_free += drm_mm_dump_hole(m, &mm->head_node); | |
ea7b1dd4 DV |
1010 | |
1011 | drm_mm_for_each_node(entry, mm) { | |
2f15791c | 1012 | seq_printf(m, "%#018llx-%#018llx: %llu: used\n", entry->start, |
440fd528 | 1013 | entry->start + entry->size, entry->size); |
ea7b1dd4 | 1014 | total_used += entry->size; |
3a359f0b | 1015 | total_free += drm_mm_dump_hole(m, entry); |
fa8a1238 | 1016 | } |
ea7b1dd4 DV |
1017 | total = total_free + total_used; |
1018 | ||
440fd528 TR |
1019 | seq_printf(m, "total: %llu, used %llu free %llu\n", total, |
1020 | total_used, total_free); | |
fa8a1238 DA |
1021 | return 0; |
1022 | } | |
1023 | EXPORT_SYMBOL(drm_mm_dump_table); | |
1024 | #endif |