Commit | Line | Data |
---|---|---|
3a1bd924 TH |
1 | /************************************************************************** |
2 | * | |
3 | * Copyright 2006 Tungsten Graphics, Inc., Bismarck, ND., USA. | |
ba004e39 | 4 | * Copyright 2016 Intel Corporation |
3a1bd924 TH |
5 | * All Rights Reserved. |
6 | * | |
7 | * Permission is hereby granted, free of charge, to any person obtaining a | |
8 | * copy of this software and associated documentation files (the | |
9 | * "Software"), to deal in the Software without restriction, including | |
10 | * without limitation the rights to use, copy, modify, merge, publish, | |
11 | * distribute, sub license, and/or sell copies of the Software, and to | |
12 | * permit persons to whom the Software is furnished to do so, subject to | |
13 | * the following conditions: | |
14 | * | |
15 | * The above copyright notice and this permission notice (including the | |
16 | * next paragraph) shall be included in all copies or substantial portions | |
17 | * of the Software. | |
18 | * | |
19 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | |
20 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | |
21 | * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL | |
22 | * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, | |
23 | * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR | |
24 | * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE | |
25 | * USE OR OTHER DEALINGS IN THE SOFTWARE. | |
26 | * | |
27 | * | |
28 | **************************************************************************/ | |
29 | ||
30 | /* | |
31 | * Generic simple memory manager implementation. Intended to be used as a base | |
32 | * class implementation for more advanced memory managers. | |
33 | * | |
34 | * Note that the algorithm used is quite simple and there might be substantial | |
ba004e39 CW |
35 | * performance gains if a smarter free list is implemented. Currently it is |
36 | * just an unordered stack of free regions. This could easily be improved if | |
37 | * an RB-tree is used instead. At least if we expect heavy fragmentation. | |
3a1bd924 TH |
38 | * |
39 | * Aligned allocations can also see improvement. | |
40 | * | |
41 | * Authors: | |
96de0e25 | 42 | * Thomas Hellström <thomas-at-tungstengraphics-dot-com> |
3a1bd924 TH |
43 | */ |
44 | ||
2d1a8a48 | 45 | #include <linux/export.h> |
202b52b7 | 46 | #include <linux/interval_tree_generic.h> |
0500c04e SR |
47 | #include <linux/seq_file.h> |
48 | #include <linux/slab.h> | |
49 | #include <linux/stacktrace.h> | |
50 | ||
51 | #include <drm/drm_mm.h> | |
1d58420b | 52 | |
93110be6 DV |
53 | /** |
54 | * DOC: Overview | |
55 | * | |
56 | * drm_mm provides a simple range allocator. The drivers are free to use the | |
57 | * resource allocator from the linux core if it suits them, the upside of drm_mm | |
58 | * is that it's in the DRM core. Which means that it's easier to extend for | |
59 | * some of the crazier special purpose needs of gpus. | |
60 | * | |
61 | * The main data struct is &drm_mm, allocations are tracked in &drm_mm_node. | |
62 | * Drivers are free to embed either of them into their own suitable | |
05fc0321 DV |
63 | * datastructures. drm_mm itself will not do any memory allocations of its own, |
64 | * so if drivers choose not to embed nodes they need to still allocate them | |
93110be6 DV |
65 | * themselves. |
66 | * | |
67 | * The range allocator also supports reservation of preallocated blocks. This is | |
68 | * useful for taking over initial mode setting configurations from the firmware, | |
69 | * where an object needs to be created which exactly matches the firmware's | |
70 | * scanout target. As long as the range is still free it can be inserted anytime | |
71 | * after the allocator is initialized, which helps with avoiding looped | |
ba004e39 | 72 | * dependencies in the driver load sequence. |
93110be6 DV |
73 | * |
74 | * drm_mm maintains a stack of most recently freed holes, which of all | |
75 | * simplistic datastructures seems to be a fairly decent approach to clustering | |
76 | * allocations and avoiding too much fragmentation. This means free space | |
77 | * searches are O(num_holes). Given that all the fancy features drm_mm supports | |
78 | * something better would be fairly complex and since gfx thrashing is a fairly | |
79 | * steep cliff not a real concern. Removing a node again is O(1). | |
80 | * | |
81 | * drm_mm supports a few features: Alignment and range restrictions can be | |
05fc0321 | 82 | * supplied. Furthermore every &drm_mm_node has a color value (which is just an |
ba004e39 | 83 | * opaque unsigned long) which in conjunction with a driver callback can be used |
93110be6 DV |
84 | * to implement sophisticated placement restrictions. The i915 DRM driver uses |
85 | * this to implement guard pages between incompatible caching domains in the | |
86 | * graphics TT. | |
87 | * | |
ba004e39 CW |
88 | * Two behaviors are supported for searching and allocating: bottom-up and |
89 | * top-down. The default is bottom-up. Top-down allocation can be used if the | |
90 | * memory area has different restrictions, or just to reduce fragmentation. | |
62347f9e | 91 | * |
93110be6 DV |
92 | * Finally iteration helpers to walk all nodes and all holes are provided as are |
93 | * some basic allocator dumpers for debugging. | |
1c9bd1ed DV |
94 | * |
95 | * Note that this range allocator is not thread-safe, drivers need to protect | |
21be9154 | 96 | * modifications with their own locking. The idea behind this is that for a full |
1c9bd1ed DV |
97 | * memory manager additional data needs to be protected anyway, hence internal |
98 | * locking would be fully redundant. | |
93110be6 DV |
99 | */ |
100 | ||
5705670d | 101 | #ifdef CONFIG_DRM_DEBUG_MM |
93ce75fa CW |
102 | #include <linux/stackdepot.h> |
103 | ||
5705670d CW |
104 | #define STACKDEPTH 32 |
105 | #define BUFSZ 4096 | |
106 | ||
107 | static noinline void save_stack(struct drm_mm_node *node) | |
108 | { | |
109 | unsigned long entries[STACKDEPTH]; | |
487f3c7f | 110 | unsigned int n; |
5705670d | 111 | |
487f3c7f | 112 | n = stack_trace_save(entries, ARRAY_SIZE(entries), 1); |
5705670d CW |
113 | |
114 | /* May be called under spinlock, so avoid sleeping */ | |
487f3c7f | 115 | node->stack = stack_depot_save(entries, n, GFP_NOWAIT); |
5705670d CW |
116 | } |
117 | ||
118 | static void show_leaks(struct drm_mm *mm) | |
119 | { | |
120 | struct drm_mm_node *node; | |
487f3c7f TG |
121 | unsigned long *entries; |
122 | unsigned int nr_entries; | |
5705670d CW |
123 | char *buf; |
124 | ||
125 | buf = kmalloc(BUFSZ, GFP_KERNEL); | |
126 | if (!buf) | |
127 | return; | |
128 | ||
2bc98c86 | 129 | list_for_each_entry(node, drm_mm_nodes(mm), node_list) { |
5705670d CW |
130 | if (!node->stack) { |
131 | DRM_ERROR("node [%08llx + %08llx]: unknown owner\n", | |
132 | node->start, node->size); | |
133 | continue; | |
134 | } | |
135 | ||
487f3c7f TG |
136 | nr_entries = stack_depot_fetch(node->stack, &entries); |
137 | stack_trace_snprint(buf, BUFSZ, entries, nr_entries, 0); | |
5705670d CW |
138 | DRM_ERROR("node [%08llx + %08llx]: inserted at\n%s", |
139 | node->start, node->size, buf); | |
140 | } | |
141 | ||
142 | kfree(buf); | |
143 | } | |
144 | ||
145 | #undef STACKDEPTH | |
146 | #undef BUFSZ | |
147 | #else | |
148 | static void save_stack(struct drm_mm_node *node) { } | |
149 | static void show_leaks(struct drm_mm *mm) { } | |
150 | #endif | |
151 | ||
202b52b7 CW |
152 | #define START(node) ((node)->start) |
153 | #define LAST(node) ((node)->start + (node)->size - 1) | |
154 | ||
155 | INTERVAL_TREE_DEFINE(struct drm_mm_node, rb, | |
156 | u64, __subtree_last, | |
157 | START, LAST, static inline, drm_mm_interval_tree) | |
158 | ||
159 | struct drm_mm_node * | |
45b186f1 | 160 | __drm_mm_interval_first(const struct drm_mm *mm, u64 start, u64 last) |
202b52b7 | 161 | { |
f808c13f | 162 | return drm_mm_interval_tree_iter_first((struct rb_root_cached *)&mm->interval_tree, |
bbba9693 | 163 | start, last) ?: (struct drm_mm_node *)&mm->head_node; |
202b52b7 | 164 | } |
522e85dd | 165 | EXPORT_SYMBOL(__drm_mm_interval_first); |
202b52b7 CW |
166 | |
167 | static void drm_mm_interval_tree_add_node(struct drm_mm_node *hole_node, | |
168 | struct drm_mm_node *node) | |
169 | { | |
170 | struct drm_mm *mm = hole_node->mm; | |
171 | struct rb_node **link, *rb; | |
172 | struct drm_mm_node *parent; | |
8a194945 | 173 | bool leftmost; |
202b52b7 CW |
174 | |
175 | node->__subtree_last = LAST(node); | |
176 | ||
71724f70 | 177 | if (drm_mm_node_allocated(hole_node)) { |
202b52b7 CW |
178 | rb = &hole_node->rb; |
179 | while (rb) { | |
180 | parent = rb_entry(rb, struct drm_mm_node, rb); | |
181 | if (parent->__subtree_last >= node->__subtree_last) | |
182 | break; | |
183 | ||
184 | parent->__subtree_last = node->__subtree_last; | |
185 | rb = rb_parent(rb); | |
186 | } | |
187 | ||
188 | rb = &hole_node->rb; | |
189 | link = &hole_node->rb.rb_right; | |
f808c13f | 190 | leftmost = false; |
202b52b7 CW |
191 | } else { |
192 | rb = NULL; | |
f808c13f | 193 | link = &mm->interval_tree.rb_root.rb_node; |
8a194945 | 194 | leftmost = true; |
202b52b7 CW |
195 | } |
196 | ||
197 | while (*link) { | |
198 | rb = *link; | |
199 | parent = rb_entry(rb, struct drm_mm_node, rb); | |
200 | if (parent->__subtree_last < node->__subtree_last) | |
201 | parent->__subtree_last = node->__subtree_last; | |
8a194945 | 202 | if (node->start < parent->start) { |
202b52b7 | 203 | link = &parent->rb.rb_left; |
8a194945 | 204 | } else { |
202b52b7 | 205 | link = &parent->rb.rb_right; |
8a194945 | 206 | leftmost = false; |
f808c13f | 207 | } |
202b52b7 CW |
208 | } |
209 | ||
210 | rb_link_node(&node->rb, rb, link); | |
f808c13f DB |
211 | rb_insert_augmented_cached(&node->rb, &mm->interval_tree, leftmost, |
212 | &drm_mm_interval_tree_augment); | |
202b52b7 CW |
213 | } |
214 | ||
4e64e553 CW |
215 | #define HOLE_SIZE(NODE) ((NODE)->hole_size) |
216 | #define HOLE_ADDR(NODE) (__drm_mm_hole_node_start(NODE)) | |
217 | ||
2f7e8769 CW |
218 | static u64 rb_to_hole_size(struct rb_node *rb) |
219 | { | |
220 | return rb_entry(rb, struct drm_mm_node, rb_hole_size)->hole_size; | |
221 | } | |
222 | ||
223 | static void insert_hole_size(struct rb_root_cached *root, | |
224 | struct drm_mm_node *node) | |
225 | { | |
226 | struct rb_node **link = &root->rb_root.rb_node, *rb = NULL; | |
227 | u64 x = node->hole_size; | |
228 | bool first = true; | |
229 | ||
230 | while (*link) { | |
231 | rb = *link; | |
232 | if (x > rb_to_hole_size(rb)) { | |
233 | link = &rb->rb_left; | |
234 | } else { | |
235 | link = &rb->rb_right; | |
236 | first = false; | |
237 | } | |
238 | } | |
239 | ||
240 | rb_link_node(&node->rb_hole_size, rb, link); | |
241 | rb_insert_color_cached(&node->rb_hole_size, root, first); | |
242 | } | |
243 | ||
0cdea445 ND |
244 | RB_DECLARE_CALLBACKS_MAX(static, augment_callbacks, |
245 | struct drm_mm_node, rb_hole_addr, | |
246 | u64, subtree_max_hole, HOLE_SIZE) | |
247 | ||
248 | static void insert_hole_addr(struct rb_root *root, struct drm_mm_node *node) | |
249 | { | |
250 | struct rb_node **link = &root->rb_node, *rb_parent = NULL; | |
251 | u64 start = HOLE_ADDR(node), subtree_max_hole = node->subtree_max_hole; | |
252 | struct drm_mm_node *parent; | |
253 | ||
254 | while (*link) { | |
255 | rb_parent = *link; | |
256 | parent = rb_entry(rb_parent, struct drm_mm_node, rb_hole_addr); | |
257 | if (parent->subtree_max_hole < subtree_max_hole) | |
258 | parent->subtree_max_hole = subtree_max_hole; | |
259 | if (start < HOLE_ADDR(parent)) | |
260 | link = &parent->rb_hole_addr.rb_left; | |
261 | else | |
262 | link = &parent->rb_hole_addr.rb_right; | |
263 | } | |
264 | ||
265 | rb_link_node(&node->rb_hole_addr, rb_parent, link); | |
266 | rb_insert_augmented(&node->rb_hole_addr, root, &augment_callbacks); | |
267 | } | |
268 | ||
4e64e553 | 269 | static void add_hole(struct drm_mm_node *node) |
3a1bd924 | 270 | { |
4e64e553 | 271 | struct drm_mm *mm = node->mm; |
ea7b1dd4 | 272 | |
4e64e553 CW |
273 | node->hole_size = |
274 | __drm_mm_hole_node_end(node) - __drm_mm_hole_node_start(node); | |
0cdea445 | 275 | node->subtree_max_hole = node->hole_size; |
4e64e553 | 276 | DRM_MM_BUG_ON(!drm_mm_hole_follows(node)); |
b0b7af18 | 277 | |
2f7e8769 | 278 | insert_hole_size(&mm->holes_size, node); |
0cdea445 | 279 | insert_hole_addr(&mm->holes_addr, node); |
1d58420b | 280 | |
4e64e553 CW |
281 | list_add(&node->hole_stack, &mm->hole_stack); |
282 | } | |
adb040b8 | 283 | |
4e64e553 CW |
284 | static void rm_hole(struct drm_mm_node *node) |
285 | { | |
286 | DRM_MM_BUG_ON(!drm_mm_hole_follows(node)); | |
62347f9e | 287 | |
4e64e553 | 288 | list_del(&node->hole_stack); |
2f7e8769 | 289 | rb_erase_cached(&node->rb_hole_size, &node->mm->holes_size); |
0cdea445 ND |
290 | rb_erase_augmented(&node->rb_hole_addr, &node->mm->holes_addr, |
291 | &augment_callbacks); | |
4e64e553 | 292 | node->hole_size = 0; |
0cdea445 | 293 | node->subtree_max_hole = 0; |
440fd528 | 294 | |
4e64e553 CW |
295 | DRM_MM_BUG_ON(drm_mm_hole_follows(node)); |
296 | } | |
297 | ||
298 | static inline struct drm_mm_node *rb_hole_size_to_node(struct rb_node *rb) | |
299 | { | |
300 | return rb_entry_safe(rb, struct drm_mm_node, rb_hole_size); | |
301 | } | |
302 | ||
303 | static inline struct drm_mm_node *rb_hole_addr_to_node(struct rb_node *rb) | |
304 | { | |
305 | return rb_entry_safe(rb, struct drm_mm_node, rb_hole_addr); | |
306 | } | |
307 | ||
4e64e553 CW |
308 | static struct drm_mm_node *best_hole(struct drm_mm *mm, u64 size) |
309 | { | |
2f7e8769 CW |
310 | struct rb_node *rb = mm->holes_size.rb_root.rb_node; |
311 | struct drm_mm_node *best = NULL; | |
4e64e553 | 312 | |
2f7e8769 CW |
313 | do { |
314 | struct drm_mm_node *node = | |
315 | rb_entry(rb, struct drm_mm_node, rb_hole_size); | |
4e64e553 | 316 | |
2f7e8769 CW |
317 | if (size <= node->hole_size) { |
318 | best = node; | |
319 | rb = rb->rb_right; | |
4e64e553 | 320 | } else { |
2f7e8769 | 321 | rb = rb->rb_left; |
62347f9e | 322 | } |
2f7e8769 | 323 | } while (rb); |
6b9d89b4 | 324 | |
2f7e8769 | 325 | return best; |
4e64e553 CW |
326 | } |
327 | ||
5fad79fd CK |
328 | static bool usable_hole_addr(struct rb_node *rb, u64 size) |
329 | { | |
330 | return rb && rb_hole_addr_to_node(rb)->subtree_max_hole >= size; | |
331 | } | |
332 | ||
271e7dec | 333 | static struct drm_mm_node *find_hole_addr(struct drm_mm *mm, u64 addr, u64 size) |
4e64e553 | 334 | { |
2f7e8769 | 335 | struct rb_node *rb = mm->holes_addr.rb_node; |
4e64e553 | 336 | struct drm_mm_node *node = NULL; |
4e64e553 | 337 | |
2f7e8769 | 338 | while (rb) { |
4e64e553 CW |
339 | u64 hole_start; |
340 | ||
5fad79fd | 341 | if (!usable_hole_addr(rb, size)) |
271e7dec CK |
342 | break; |
343 | ||
2f7e8769 | 344 | node = rb_hole_addr_to_node(rb); |
4e64e553 CW |
345 | hole_start = __drm_mm_hole_node_start(node); |
346 | ||
347 | if (addr < hole_start) | |
2f7e8769 | 348 | rb = node->rb_hole_addr.rb_left; |
4e64e553 | 349 | else if (addr > hole_start + node->hole_size) |
2f7e8769 | 350 | rb = node->rb_hole_addr.rb_right; |
4e64e553 CW |
351 | else |
352 | break; | |
6b9d89b4 | 353 | } |
ea7b1dd4 | 354 | |
4e64e553 CW |
355 | return node; |
356 | } | |
3a1bd924 | 357 | |
4e64e553 CW |
358 | static struct drm_mm_node * |
359 | first_hole(struct drm_mm *mm, | |
360 | u64 start, u64 end, u64 size, | |
361 | enum drm_mm_insert_mode mode) | |
362 | { | |
4e64e553 CW |
363 | switch (mode) { |
364 | default: | |
365 | case DRM_MM_INSERT_BEST: | |
366 | return best_hole(mm, size); | |
202b52b7 | 367 | |
4e64e553 | 368 | case DRM_MM_INSERT_LOW: |
271e7dec | 369 | return find_hole_addr(mm, start, size); |
ea7b1dd4 | 370 | |
4e64e553 | 371 | case DRM_MM_INSERT_HIGH: |
271e7dec | 372 | return find_hole_addr(mm, end, size); |
4e64e553 CW |
373 | |
374 | case DRM_MM_INSERT_EVICT: | |
375 | return list_first_entry_or_null(&mm->hole_stack, | |
376 | struct drm_mm_node, | |
377 | hole_stack); | |
1d58420b | 378 | } |
4e64e553 | 379 | } |
5705670d | 380 | |
0cdea445 | 381 | /** |
5fad79fd CK |
382 | * DECLARE_NEXT_HOLE_ADDR - macro to declare next hole functions |
383 | * @name: name of function to declare | |
384 | * @first: first rb member to traverse (either rb_left or rb_right). | |
385 | * @last: last rb member to traverse (either rb_right or rb_left). | |
0cdea445 | 386 | * |
5fad79fd CK |
387 | * This macro declares a function to return the next hole of the addr rb tree. |
388 | * While traversing the tree we take the searched size into account and only | |
389 | * visit branches with potential big enough holes. | |
0cdea445 | 390 | */ |
0cdea445 | 391 | |
5fad79fd CK |
392 | #define DECLARE_NEXT_HOLE_ADDR(name, first, last) \ |
393 | static struct drm_mm_node *name(struct drm_mm_node *entry, u64 size) \ | |
394 | { \ | |
395 | struct rb_node *parent, *node = &entry->rb_hole_addr; \ | |
396 | \ | |
397 | if (!entry || RB_EMPTY_NODE(node)) \ | |
398 | return NULL; \ | |
399 | \ | |
400 | if (usable_hole_addr(node->first, size)) { \ | |
401 | node = node->first; \ | |
402 | while (usable_hole_addr(node->last, size)) \ | |
403 | node = node->last; \ | |
404 | return rb_hole_addr_to_node(node); \ | |
405 | } \ | |
406 | \ | |
407 | while ((parent = rb_parent(node)) && node == parent->first) \ | |
408 | node = parent; \ | |
409 | \ | |
410 | return rb_hole_addr_to_node(parent); \ | |
0cdea445 ND |
411 | } |
412 | ||
5fad79fd CK |
413 | DECLARE_NEXT_HOLE_ADDR(next_hole_high_addr, rb_left, rb_right) |
414 | DECLARE_NEXT_HOLE_ADDR(next_hole_low_addr, rb_right, rb_left) | |
0cdea445 | 415 | |
4e64e553 CW |
416 | static struct drm_mm_node * |
417 | next_hole(struct drm_mm *mm, | |
418 | struct drm_mm_node *node, | |
0cdea445 | 419 | u64 size, |
4e64e553 CW |
420 | enum drm_mm_insert_mode mode) |
421 | { | |
422 | switch (mode) { | |
423 | default: | |
424 | case DRM_MM_INSERT_BEST: | |
2f7e8769 | 425 | return rb_hole_size_to_node(rb_prev(&node->rb_hole_size)); |
4e64e553 CW |
426 | |
427 | case DRM_MM_INSERT_LOW: | |
0cdea445 | 428 | return next_hole_low_addr(node, size); |
4e64e553 CW |
429 | |
430 | case DRM_MM_INSERT_HIGH: | |
0cdea445 | 431 | return next_hole_high_addr(node, size); |
4e64e553 CW |
432 | |
433 | case DRM_MM_INSERT_EVICT: | |
434 | node = list_next_entry(node, hole_stack); | |
435 | return &node->hole_stack == &mm->hole_stack ? NULL : node; | |
436 | } | |
9fc935de DV |
437 | } |
438 | ||
e18c0412 DV |
439 | /** |
440 | * drm_mm_reserve_node - insert an pre-initialized node | |
441 | * @mm: drm_mm allocator to insert @node into | |
442 | * @node: drm_mm_node to insert | |
443 | * | |
05fc0321 DV |
444 | * This functions inserts an already set-up &drm_mm_node into the allocator, |
445 | * meaning that start, size and color must be set by the caller. All other | |
446 | * fields must be cleared to 0. This is useful to initialize the allocator with | |
447 | * preallocated objects which must be set-up before the range allocator can be | |
448 | * set-up, e.g. when taking over a firmware framebuffer. | |
e18c0412 DV |
449 | * |
450 | * Returns: | |
451 | * 0 on success, -ENOSPC if there's no hole where @node is. | |
452 | */ | |
338710e7 | 453 | int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node) |
5973c7ee | 454 | { |
b3a070cc | 455 | struct drm_mm_node *hole; |
202b52b7 | 456 | u64 hole_start, hole_end; |
2db86dfc | 457 | u64 adj_start, adj_end; |
0d1650fa | 458 | u64 end; |
338710e7 | 459 | |
b80d3942 | 460 | end = node->start + node->size; |
c820186d CW |
461 | if (unlikely(end <= node->start)) |
462 | return -ENOSPC; | |
b80d3942 | 463 | |
338710e7 | 464 | /* Find the relevant hole to add our node to */ |
271e7dec | 465 | hole = find_hole_addr(mm, node->start, 0); |
4e64e553 | 466 | if (!hole) |
202b52b7 | 467 | return -ENOSPC; |
5973c7ee | 468 | |
2db86dfc | 469 | adj_start = hole_start = __drm_mm_hole_node_start(hole); |
4e64e553 | 470 | adj_end = hole_end = hole_start + hole->hole_size; |
2db86dfc CW |
471 | |
472 | if (mm->color_adjust) | |
473 | mm->color_adjust(hole, node->color, &adj_start, &adj_end); | |
474 | ||
475 | if (adj_start > node->start || adj_end < end) | |
202b52b7 | 476 | return -ENOSPC; |
5973c7ee | 477 | |
202b52b7 | 478 | node->mm = mm; |
5973c7ee | 479 | |
3dda22d3 | 480 | __set_bit(DRM_MM_NODE_ALLOCATED_BIT, &node->flags); |
202b52b7 | 481 | list_add(&node->node_list, &hole->node_list); |
202b52b7 | 482 | drm_mm_interval_tree_add_node(hole, node); |
4e64e553 | 483 | node->hole_size = 0; |
202b52b7 | 484 | |
4e64e553 CW |
485 | rm_hole(hole); |
486 | if (node->start > hole_start) | |
487 | add_hole(hole); | |
488 | if (end < hole_end) | |
489 | add_hole(node); | |
5973c7ee | 490 | |
5705670d | 491 | save_stack(node); |
202b52b7 | 492 | return 0; |
5973c7ee | 493 | } |
338710e7 | 494 | EXPORT_SYMBOL(drm_mm_reserve_node); |
5973c7ee | 495 | |
2f7e8769 CW |
496 | static u64 rb_to_hole_size_or_zero(struct rb_node *rb) |
497 | { | |
498 | return rb ? rb_to_hole_size(rb) : 0; | |
499 | } | |
500 | ||
b0b7af18 | 501 | /** |
4e64e553 | 502 | * drm_mm_insert_node_in_range - ranged search for space and insert @node |
e18c0412 DV |
503 | * @mm: drm_mm to allocate from |
504 | * @node: preallocate node to insert | |
505 | * @size: size of the allocation | |
506 | * @alignment: alignment of the allocation | |
507 | * @color: opaque tag value to use for this node | |
4e64e553 CW |
508 | * @range_start: start of the allowed range for this node |
509 | * @range_end: end of the allowed range for this node | |
510 | * @mode: fine-tune the allocation search and placement | |
e18c0412 | 511 | * |
05fc0321 | 512 | * The preallocated @node must be cleared to 0. |
e18c0412 DV |
513 | * |
514 | * Returns: | |
515 | * 0 on success, -ENOSPC if there's no suitable hole. | |
3a1bd924 | 516 | */ |
4e64e553 CW |
517 | int drm_mm_insert_node_in_range(struct drm_mm * const mm, |
518 | struct drm_mm_node * const node, | |
519 | u64 size, u64 alignment, | |
520 | unsigned long color, | |
521 | u64 range_start, u64 range_end, | |
522 | enum drm_mm_insert_mode mode) | |
3a1bd924 | 523 | { |
4e64e553 CW |
524 | struct drm_mm_node *hole; |
525 | u64 remainder_mask; | |
83bc4ec3 | 526 | bool once; |
b0b7af18 | 527 | |
c1a495a5 | 528 | DRM_MM_BUG_ON(range_start > range_end); |
aafdcfd3 | 529 | |
4e64e553 | 530 | if (unlikely(size == 0 || range_end - range_start < size)) |
b0b7af18 DV |
531 | return -ENOSPC; |
532 | ||
2f7e8769 CW |
533 | if (rb_to_hole_size_or_zero(rb_first_cached(&mm->holes_size)) < size) |
534 | return -ENOSPC; | |
535 | ||
4e64e553 CW |
536 | if (alignment <= 1) |
537 | alignment = 0; | |
538 | ||
83bc4ec3 CW |
539 | once = mode & DRM_MM_INSERT_ONCE; |
540 | mode &= ~DRM_MM_INSERT_ONCE; | |
541 | ||
4e64e553 | 542 | remainder_mask = is_power_of_2(alignment) ? alignment - 1 : 0; |
83bc4ec3 CW |
543 | for (hole = first_hole(mm, range_start, range_end, size, mode); |
544 | hole; | |
0cdea445 | 545 | hole = once ? NULL : next_hole(mm, hole, size, mode)) { |
4e64e553 CW |
546 | u64 hole_start = __drm_mm_hole_node_start(hole); |
547 | u64 hole_end = hole_start + hole->hole_size; | |
548 | u64 adj_start, adj_end; | |
549 | u64 col_start, col_end; | |
550 | ||
551 | if (mode == DRM_MM_INSERT_LOW && hole_start >= range_end) | |
552 | break; | |
553 | ||
554 | if (mode == DRM_MM_INSERT_HIGH && hole_end <= range_start) | |
555 | break; | |
556 | ||
557 | col_start = hole_start; | |
558 | col_end = hole_end; | |
559 | if (mm->color_adjust) | |
560 | mm->color_adjust(hole, color, &col_start, &col_end); | |
561 | ||
562 | adj_start = max(col_start, range_start); | |
563 | adj_end = min(col_end, range_end); | |
564 | ||
565 | if (adj_end <= adj_start || adj_end - adj_start < size) | |
566 | continue; | |
567 | ||
568 | if (mode == DRM_MM_INSERT_HIGH) | |
569 | adj_start = adj_end - size; | |
570 | ||
571 | if (alignment) { | |
572 | u64 rem; | |
573 | ||
574 | if (likely(remainder_mask)) | |
575 | rem = adj_start & remainder_mask; | |
576 | else | |
577 | div64_u64_rem(adj_start, alignment, &rem); | |
578 | if (rem) { | |
579 | adj_start -= rem; | |
580 | if (mode != DRM_MM_INSERT_HIGH) | |
581 | adj_start += alignment; | |
582 | ||
583 | if (adj_start < max(col_start, range_start) || | |
584 | min(col_end, range_end) - adj_start < size) | |
585 | continue; | |
586 | ||
587 | if (adj_end <= adj_start || | |
588 | adj_end - adj_start < size) | |
589 | continue; | |
590 | } | |
591 | } | |
592 | ||
593 | node->mm = mm; | |
594 | node->size = size; | |
595 | node->start = adj_start; | |
596 | node->color = color; | |
597 | node->hole_size = 0; | |
598 | ||
3dda22d3 | 599 | __set_bit(DRM_MM_NODE_ALLOCATED_BIT, &node->flags); |
4e64e553 CW |
600 | list_add(&node->node_list, &hole->node_list); |
601 | drm_mm_interval_tree_add_node(hole, node); | |
4e64e553 CW |
602 | |
603 | rm_hole(hole); | |
604 | if (adj_start > hole_start) | |
605 | add_hole(hole); | |
606 | if (adj_start + size < hole_end) | |
607 | add_hole(node); | |
608 | ||
609 | save_stack(node); | |
610 | return 0; | |
611 | } | |
612 | ||
2713778c | 613 | return -ENOSPC; |
b0b7af18 | 614 | } |
4e64e553 | 615 | EXPORT_SYMBOL(drm_mm_insert_node_in_range); |
b8103450 | 616 | |
71724f70 CW |
617 | static inline bool drm_mm_node_scanned_block(const struct drm_mm_node *node) |
618 | { | |
4ee92c71 | 619 | return test_bit(DRM_MM_NODE_SCANNED_BIT, &node->flags); |
71724f70 CW |
620 | } |
621 | ||
b0b7af18 | 622 | /** |
e18c0412 DV |
623 | * drm_mm_remove_node - Remove a memory node from the allocator. |
624 | * @node: drm_mm_node to remove | |
625 | * | |
626 | * This just removes a node from its drm_mm allocator. The node does not need to | |
627 | * be cleared again before it can be re-inserted into this or any other drm_mm | |
ba004e39 | 628 | * allocator. It is a bug to call this function on a unallocated node. |
b0b7af18 DV |
629 | */ |
630 | void drm_mm_remove_node(struct drm_mm_node *node) | |
631 | { | |
ea7b1dd4 DV |
632 | struct drm_mm *mm = node->mm; |
633 | struct drm_mm_node *prev_node; | |
3a1bd924 | 634 | |
71724f70 CW |
635 | DRM_MM_BUG_ON(!drm_mm_node_allocated(node)); |
636 | DRM_MM_BUG_ON(drm_mm_node_scanned_block(node)); | |
3a1bd924 | 637 | |
4e64e553 | 638 | prev_node = list_prev_entry(node, node_list); |
9e8944ab | 639 | |
4e64e553 CW |
640 | if (drm_mm_hole_follows(node)) |
641 | rm_hole(node); | |
ea7b1dd4 | 642 | |
202b52b7 | 643 | drm_mm_interval_tree_remove(node, &mm->interval_tree); |
ea7b1dd4 | 644 | list_del(&node->node_list); |
7a6b2896 | 645 | |
4e64e553 CW |
646 | if (drm_mm_hole_follows(prev_node)) |
647 | rm_hole(prev_node); | |
648 | add_hole(prev_node); | |
3dda22d3 CW |
649 | |
650 | clear_bit_unlock(DRM_MM_NODE_ALLOCATED_BIT, &node->flags); | |
a2e68e92 | 651 | } |
4e64e553 | 652 | EXPORT_SYMBOL(drm_mm_remove_node); |
a2e68e92 | 653 | |
b0b7af18 | 654 | /** |
e18c0412 DV |
655 | * drm_mm_replace_node - move an allocation from @old to @new |
656 | * @old: drm_mm_node to remove from the allocator | |
657 | * @new: drm_mm_node which should inherit @old's allocation | |
658 | * | |
659 | * This is useful for when drivers embed the drm_mm_node structure and hence | |
660 | * can't move allocations by reassigning pointers. It's a combination of remove | |
661 | * and insert with the guarantee that the allocation start will match. | |
b0b7af18 DV |
662 | */ |
663 | void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new) | |
664 | { | |
338f1d9d CW |
665 | struct drm_mm *mm = old->mm; |
666 | ||
71724f70 | 667 | DRM_MM_BUG_ON(!drm_mm_node_allocated(old)); |
b3ee963f | 668 | |
4e64e553 CW |
669 | *new = *old; |
670 | ||
3dda22d3 | 671 | __set_bit(DRM_MM_NODE_ALLOCATED_BIT, &new->flags); |
b0b7af18 | 672 | list_replace(&old->node_list, &new->node_list); |
338f1d9d | 673 | rb_replace_node_cached(&old->rb, &new->rb, &mm->interval_tree); |
4e64e553 CW |
674 | |
675 | if (drm_mm_hole_follows(old)) { | |
676 | list_replace(&old->hole_stack, &new->hole_stack); | |
2f7e8769 CW |
677 | rb_replace_node_cached(&old->rb_hole_size, |
678 | &new->rb_hole_size, | |
679 | &mm->holes_size); | |
4e64e553 CW |
680 | rb_replace_node(&old->rb_hole_addr, |
681 | &new->rb_hole_addr, | |
338f1d9d | 682 | &mm->holes_addr); |
4e64e553 CW |
683 | } |
684 | ||
3dda22d3 | 685 | clear_bit_unlock(DRM_MM_NODE_ALLOCATED_BIT, &old->flags); |
b0b7af18 DV |
686 | } |
687 | EXPORT_SYMBOL(drm_mm_replace_node); | |
688 | ||
93110be6 | 689 | /** |
05fc0321 | 690 | * DOC: lru scan roster |
93110be6 DV |
691 | * |
692 | * Very often GPUs need to have continuous allocations for a given object. When | |
693 | * evicting objects to make space for a new one it is therefore not most | |
694 | * efficient when we simply start to select all objects from the tail of an LRU | |
695 | * until there's a suitable hole: Especially for big objects or nodes that | |
696 | * otherwise have special allocation constraints there's a good chance we evict | |
ba004e39 | 697 | * lots of (smaller) objects unnecessarily. |
93110be6 DV |
698 | * |
699 | * The DRM range allocator supports this use-case through the scanning | |
700 | * interfaces. First a scan operation needs to be initialized with | |
9a71e277 | 701 | * drm_mm_scan_init() or drm_mm_scan_init_with_range(). The driver adds |
05fc0321 DV |
702 | * objects to the roster, probably by walking an LRU list, but this can be |
703 | * freely implemented. Eviction candiates are added using | |
704 | * drm_mm_scan_add_block() until a suitable hole is found or there are no | |
940eba2d DV |
705 | * further evictable objects. Eviction roster metadata is tracked in &struct |
706 | * drm_mm_scan. | |
93110be6 | 707 | * |
ba004e39 | 708 | * The driver must walk through all objects again in exactly the reverse |
93110be6 DV |
709 | * order to restore the allocator state. Note that while the allocator is used |
710 | * in the scan mode no other operation is allowed. | |
711 | * | |
3fa489da CW |
712 | * Finally the driver evicts all objects selected (drm_mm_scan_remove_block() |
713 | * reported true) in the scan, and any overlapping nodes after color adjustment | |
05fc0321 | 714 | * (drm_mm_scan_color_evict()). Adding and removing an object is O(1), and |
3fa489da CW |
715 | * since freeing a node is also O(1) the overall complexity is |
716 | * O(scanned_objects). So like the free stack which needs to be walked before a | |
717 | * scan operation even begins this is linear in the number of objects. It | |
718 | * doesn't seem to hurt too badly. | |
93110be6 DV |
719 | */ |
720 | ||
d935cc61 | 721 | /** |
9a71e277 CW |
722 | * drm_mm_scan_init_with_range - initialize range-restricted lru scanning |
723 | * @scan: scan state | |
e18c0412 DV |
724 | * @mm: drm_mm to scan |
725 | * @size: size of the allocation | |
726 | * @alignment: alignment of the allocation | |
727 | * @color: opaque tag value to use for the allocation | |
728 | * @start: start of the allowed range for the allocation | |
729 | * @end: end of the allowed range for the allocation | |
4e64e553 | 730 | * @mode: fine-tune the allocation search and placement |
d935cc61 DV |
731 | * |
732 | * This simply sets up the scanning routines with the parameters for the desired | |
0b04d474 | 733 | * hole. |
d935cc61 | 734 | * |
e18c0412 DV |
735 | * Warning: |
736 | * As long as the scan list is non-empty, no other operations than | |
d935cc61 DV |
737 | * adding/removing nodes to/from the scan list are allowed. |
738 | */ | |
9a71e277 CW |
739 | void drm_mm_scan_init_with_range(struct drm_mm_scan *scan, |
740 | struct drm_mm *mm, | |
440fd528 | 741 | u64 size, |
71733207 | 742 | u64 alignment, |
6b9d89b4 | 743 | unsigned long color, |
440fd528 | 744 | u64 start, |
0b04d474 | 745 | u64 end, |
4e64e553 | 746 | enum drm_mm_insert_mode mode) |
d935cc61 | 747 | { |
6259a56b CW |
748 | DRM_MM_BUG_ON(start >= end); |
749 | DRM_MM_BUG_ON(!size || size > end - start); | |
9a71e277 CW |
750 | DRM_MM_BUG_ON(mm->scan_active); |
751 | ||
752 | scan->mm = mm; | |
753 | ||
9a956b15 CW |
754 | if (alignment <= 1) |
755 | alignment = 0; | |
756 | ||
9a71e277 CW |
757 | scan->color = color; |
758 | scan->alignment = alignment; | |
9a956b15 | 759 | scan->remainder_mask = is_power_of_2(alignment) ? alignment - 1 : 0; |
9a71e277 | 760 | scan->size = size; |
4e64e553 | 761 | scan->mode = mode; |
9a71e277 CW |
762 | |
763 | DRM_MM_BUG_ON(end <= start); | |
764 | scan->range_start = start; | |
765 | scan->range_end = end; | |
6259a56b | 766 | |
9a71e277 CW |
767 | scan->hit_start = U64_MAX; |
768 | scan->hit_end = 0; | |
d935cc61 | 769 | } |
9a71e277 | 770 | EXPORT_SYMBOL(drm_mm_scan_init_with_range); |
d935cc61 | 771 | |
709ea971 | 772 | /** |
e18c0412 | 773 | * drm_mm_scan_add_block - add a node to the scan list |
9b8b75de | 774 | * @scan: the active drm_mm scanner |
e18c0412 DV |
775 | * @node: drm_mm_node to add |
776 | * | |
709ea971 DV |
777 | * Add a node to the scan list that might be freed to make space for the desired |
778 | * hole. | |
779 | * | |
e18c0412 DV |
780 | * Returns: |
781 | * True if a hole has been found, false otherwise. | |
709ea971 | 782 | */ |
9a71e277 CW |
783 | bool drm_mm_scan_add_block(struct drm_mm_scan *scan, |
784 | struct drm_mm_node *node) | |
709ea971 | 785 | { |
9a71e277 | 786 | struct drm_mm *mm = scan->mm; |
4a6c156f | 787 | struct drm_mm_node *hole; |
440fd528 | 788 | u64 hole_start, hole_end; |
268c6498 | 789 | u64 col_start, col_end; |
440fd528 | 790 | u64 adj_start, adj_end; |
709ea971 | 791 | |
9a71e277 | 792 | DRM_MM_BUG_ON(node->mm != mm); |
71724f70 CW |
793 | DRM_MM_BUG_ON(!drm_mm_node_allocated(node)); |
794 | DRM_MM_BUG_ON(drm_mm_node_scanned_block(node)); | |
4ee92c71 | 795 | __set_bit(DRM_MM_NODE_SCANNED_BIT, &node->flags); |
9a71e277 | 796 | mm->scan_active++; |
709ea971 | 797 | |
f29051f1 CW |
798 | /* Remove this block from the node_list so that we enlarge the hole |
799 | * (distance between the end of our previous node and the start of | |
800 | * or next), without poisoning the link so that we can restore it | |
801 | * later in drm_mm_scan_remove_block(). | |
802 | */ | |
4a6c156f | 803 | hole = list_prev_entry(node, node_list); |
f29051f1 CW |
804 | DRM_MM_BUG_ON(list_next_entry(hole, node_list) != node); |
805 | __list_del_entry(&node->node_list); | |
709ea971 | 806 | |
268c6498 CW |
807 | hole_start = __drm_mm_hole_node_start(hole); |
808 | hole_end = __drm_mm_hole_node_end(hole); | |
d935cc61 | 809 | |
268c6498 CW |
810 | col_start = hole_start; |
811 | col_end = hole_end; | |
901593f2 | 812 | if (mm->color_adjust) |
268c6498 CW |
813 | mm->color_adjust(hole, scan->color, &col_start, &col_end); |
814 | ||
815 | adj_start = max(col_start, scan->range_start); | |
816 | adj_end = min(col_end, scan->range_end); | |
0b04d474 CW |
817 | if (adj_end <= adj_start || adj_end - adj_start < scan->size) |
818 | return false; | |
819 | ||
4e64e553 | 820 | if (scan->mode == DRM_MM_INSERT_HIGH) |
0b04d474 CW |
821 | adj_start = adj_end - scan->size; |
822 | ||
823 | if (scan->alignment) { | |
824 | u64 rem; | |
825 | ||
9a956b15 CW |
826 | if (likely(scan->remainder_mask)) |
827 | rem = adj_start & scan->remainder_mask; | |
828 | else | |
829 | div64_u64_rem(adj_start, scan->alignment, &rem); | |
0b04d474 CW |
830 | if (rem) { |
831 | adj_start -= rem; | |
4e64e553 | 832 | if (scan->mode != DRM_MM_INSERT_HIGH) |
0b04d474 CW |
833 | adj_start += scan->alignment; |
834 | if (adj_start < max(col_start, scan->range_start) || | |
835 | min(col_end, scan->range_end) - adj_start < scan->size) | |
836 | return false; | |
837 | ||
838 | if (adj_end <= adj_start || | |
839 | adj_end - adj_start < scan->size) | |
840 | return false; | |
841 | } | |
842 | } | |
901593f2 | 843 | |
3fa489da CW |
844 | scan->hit_start = adj_start; |
845 | scan->hit_end = adj_start + scan->size; | |
709ea971 | 846 | |
0b04d474 CW |
847 | DRM_MM_BUG_ON(scan->hit_start >= scan->hit_end); |
848 | DRM_MM_BUG_ON(scan->hit_start < hole_start); | |
849 | DRM_MM_BUG_ON(scan->hit_end > hole_end); | |
850 | ||
851 | return true; | |
709ea971 DV |
852 | } |
853 | EXPORT_SYMBOL(drm_mm_scan_add_block); | |
854 | ||
855 | /** | |
e18c0412 | 856 | * drm_mm_scan_remove_block - remove a node from the scan list |
9b8b75de | 857 | * @scan: the active drm_mm scanner |
e18c0412 | 858 | * @node: drm_mm_node to remove |
709ea971 | 859 | * |
05fc0321 DV |
860 | * Nodes **must** be removed in exactly the reverse order from the scan list as |
861 | * they have been added (e.g. using list_add() as they are added and then | |
862 | * list_for_each() over that eviction list to remove), otherwise the internal | |
ba004e39 | 863 | * state of the memory manager will be corrupted. |
709ea971 DV |
864 | * |
865 | * When the scan list is empty, the selected memory nodes can be freed. An | |
05fc0321 DV |
866 | * immediately following drm_mm_insert_node_in_range_generic() or one of the |
867 | * simpler versions of that function with !DRM_MM_SEARCH_BEST will then return | |
1e55a53a | 868 | * the just freed block (because it's at the top of the free_stack list). |
709ea971 | 869 | * |
e18c0412 DV |
870 | * Returns: |
871 | * True if this block should be evicted, false otherwise. Will always | |
872 | * return false when no hole has been found. | |
709ea971 | 873 | */ |
9a71e277 CW |
874 | bool drm_mm_scan_remove_block(struct drm_mm_scan *scan, |
875 | struct drm_mm_node *node) | |
709ea971 | 876 | { |
ea7b1dd4 | 877 | struct drm_mm_node *prev_node; |
709ea971 | 878 | |
9a71e277 | 879 | DRM_MM_BUG_ON(node->mm != scan->mm); |
71724f70 | 880 | DRM_MM_BUG_ON(!drm_mm_node_scanned_block(node)); |
4ee92c71 | 881 | __clear_bit(DRM_MM_NODE_SCANNED_BIT, &node->flags); |
709ea971 | 882 | |
9a71e277 CW |
883 | DRM_MM_BUG_ON(!node->mm->scan_active); |
884 | node->mm->scan_active--; | |
885 | ||
f29051f1 CW |
886 | /* During drm_mm_scan_add_block() we decoupled this node leaving |
887 | * its pointers intact. Now that the caller is walking back along | |
888 | * the eviction list we can restore this block into its rightful | |
889 | * place on the full node_list. To confirm that the caller is walking | |
890 | * backwards correctly we check that prev_node->next == node->next, | |
891 | * i.e. both believe the same node should be on the other side of the | |
892 | * hole. | |
893 | */ | |
9a71e277 | 894 | prev_node = list_prev_entry(node, node_list); |
f29051f1 CW |
895 | DRM_MM_BUG_ON(list_next_entry(prev_node, node_list) != |
896 | list_next_entry(node, node_list)); | |
ea7b1dd4 | 897 | list_add(&node->node_list, &prev_node->node_list); |
709ea971 | 898 | |
0b04d474 | 899 | return (node->start + node->size > scan->hit_start && |
9a71e277 | 900 | node->start < scan->hit_end); |
709ea971 DV |
901 | } |
902 | EXPORT_SYMBOL(drm_mm_scan_remove_block); | |
903 | ||
3fa489da CW |
904 | /** |
905 | * drm_mm_scan_color_evict - evict overlapping nodes on either side of hole | |
906 | * @scan: drm_mm scan with target hole | |
907 | * | |
908 | * After completing an eviction scan and removing the selected nodes, we may | |
909 | * need to remove a few more nodes from either side of the target hole if | |
910 | * mm.color_adjust is being used. | |
911 | * | |
912 | * Returns: | |
913 | * A node to evict, or NULL if there are no overlapping nodes. | |
914 | */ | |
915 | struct drm_mm_node *drm_mm_scan_color_evict(struct drm_mm_scan *scan) | |
916 | { | |
917 | struct drm_mm *mm = scan->mm; | |
918 | struct drm_mm_node *hole; | |
919 | u64 hole_start, hole_end; | |
920 | ||
921 | DRM_MM_BUG_ON(list_empty(&mm->hole_stack)); | |
922 | ||
923 | if (!mm->color_adjust) | |
924 | return NULL; | |
925 | ||
b8ff1802 CW |
926 | /* |
927 | * The hole found during scanning should ideally be the first element | |
928 | * in the hole_stack list, but due to side-effects in the driver it | |
929 | * may not be. | |
930 | */ | |
931 | list_for_each_entry(hole, &mm->hole_stack, hole_stack) { | |
932 | hole_start = __drm_mm_hole_node_start(hole); | |
933 | hole_end = hole_start + hole->hole_size; | |
934 | ||
935 | if (hole_start <= scan->hit_start && | |
936 | hole_end >= scan->hit_end) | |
937 | break; | |
938 | } | |
939 | ||
940 | /* We should only be called after we found the hole previously */ | |
941 | DRM_MM_BUG_ON(&hole->hole_stack == &mm->hole_stack); | |
942 | if (unlikely(&hole->hole_stack == &mm->hole_stack)) | |
943 | return NULL; | |
3fa489da CW |
944 | |
945 | DRM_MM_BUG_ON(hole_start > scan->hit_start); | |
946 | DRM_MM_BUG_ON(hole_end < scan->hit_end); | |
947 | ||
948 | mm->color_adjust(hole, scan->color, &hole_start, &hole_end); | |
949 | if (hole_start > scan->hit_start) | |
950 | return hole; | |
951 | if (hole_end < scan->hit_end) | |
952 | return list_next_entry(hole, node_list); | |
953 | ||
954 | return NULL; | |
955 | } | |
956 | EXPORT_SYMBOL(drm_mm_scan_color_evict); | |
957 | ||
e18c0412 DV |
958 | /** |
959 | * drm_mm_init - initialize a drm-mm allocator | |
960 | * @mm: the drm_mm structure to initialize | |
961 | * @start: start of the range managed by @mm | |
962 | * @size: end of the range managed by @mm | |
963 | * | |
964 | * Note that @mm must be cleared to 0 before calling this function. | |
965 | */ | |
45b186f1 | 966 | void drm_mm_init(struct drm_mm *mm, u64 start, u64 size) |
1d58420b | 967 | { |
6259a56b CW |
968 | DRM_MM_BUG_ON(start + size <= start); |
969 | ||
4e64e553 CW |
970 | mm->color_adjust = NULL; |
971 | ||
ea7b1dd4 | 972 | INIT_LIST_HEAD(&mm->hole_stack); |
f808c13f | 973 | mm->interval_tree = RB_ROOT_CACHED; |
2f7e8769 | 974 | mm->holes_size = RB_ROOT_CACHED; |
4e64e553 | 975 | mm->holes_addr = RB_ROOT; |
3a1bd924 | 976 | |
ea7b1dd4 DV |
977 | /* Clever trick to avoid a special case in the free hole tracking. */ |
978 | INIT_LIST_HEAD(&mm->head_node.node_list); | |
4ee92c71 | 979 | mm->head_node.flags = 0; |
ea7b1dd4 DV |
980 | mm->head_node.mm = mm; |
981 | mm->head_node.start = start + size; | |
4e64e553 CW |
982 | mm->head_node.size = -size; |
983 | add_hole(&mm->head_node); | |
ea7b1dd4 | 984 | |
4e64e553 | 985 | mm->scan_active = 0; |
3a1bd924 | 986 | } |
673a394b | 987 | EXPORT_SYMBOL(drm_mm_init); |
3a1bd924 | 988 | |
e18c0412 DV |
989 | /** |
990 | * drm_mm_takedown - clean up a drm_mm allocator | |
991 | * @mm: drm_mm allocator to clean up | |
992 | * | |
993 | * Note that it is a bug to call this function on an allocator which is not | |
994 | * clean. | |
995 | */ | |
5705670d | 996 | void drm_mm_takedown(struct drm_mm *mm) |
3a1bd924 | 997 | { |
ac9bb7b7 | 998 | if (WARN(!drm_mm_clean(mm), |
5705670d CW |
999 | "Memory manager not clean during takedown.\n")) |
1000 | show_leaks(mm); | |
3a1bd924 | 1001 | } |
f453ba04 | 1002 | EXPORT_SYMBOL(drm_mm_takedown); |
fa8a1238 | 1003 | |
b5c3714f | 1004 | static u64 drm_mm_dump_hole(struct drm_printer *p, const struct drm_mm_node *entry) |
99d7e48e | 1005 | { |
4e64e553 CW |
1006 | u64 start, size; |
1007 | ||
1008 | size = entry->hole_size; | |
1009 | if (size) { | |
1010 | start = drm_mm_hole_node_start(entry); | |
1011 | drm_printf(p, "%#018llx-%#018llx: %llu: free\n", | |
1012 | start, start + size, size); | |
3a359f0b DV |
1013 | } |
1014 | ||
4e64e553 | 1015 | return size; |
3a359f0b | 1016 | } |
e18c0412 | 1017 | /** |
b5c3714f DV |
1018 | * drm_mm_print - print allocator state |
1019 | * @mm: drm_mm allocator to print | |
1020 | * @p: DRM printer to use | |
e18c0412 | 1021 | */ |
b5c3714f | 1022 | void drm_mm_print(const struct drm_mm *mm, struct drm_printer *p) |
3a359f0b | 1023 | { |
45b186f1 | 1024 | const struct drm_mm_node *entry; |
440fd528 | 1025 | u64 total_used = 0, total_free = 0, total = 0; |
3a359f0b | 1026 | |
b5c3714f | 1027 | total_free += drm_mm_dump_hole(p, &mm->head_node); |
ea7b1dd4 DV |
1028 | |
1029 | drm_mm_for_each_node(entry, mm) { | |
b5c3714f | 1030 | drm_printf(p, "%#018llx-%#018llx: %llu: used\n", entry->start, |
440fd528 | 1031 | entry->start + entry->size, entry->size); |
ea7b1dd4 | 1032 | total_used += entry->size; |
b5c3714f | 1033 | total_free += drm_mm_dump_hole(p, entry); |
fa8a1238 | 1034 | } |
ea7b1dd4 DV |
1035 | total = total_free + total_used; |
1036 | ||
b5c3714f | 1037 | drm_printf(p, "total: %llu, used %llu free %llu\n", total, |
440fd528 | 1038 | total_used, total_free); |
fa8a1238 | 1039 | } |
b5c3714f | 1040 | EXPORT_SYMBOL(drm_mm_print); |