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> |
1d58420b | 49 | |
249d6048 JG |
50 | #define MM_UNUSED_TARGET 4 |
51 | ||
c700c67b DH |
52 | static struct drm_mm_node *drm_mm_search_free_generic(const struct drm_mm *mm, |
53 | unsigned long size, | |
54 | unsigned alignment, | |
55 | unsigned long color, | |
56 | enum drm_mm_search_flags flags); | |
57 | static struct drm_mm_node *drm_mm_search_free_in_range_generic(const struct drm_mm *mm, | |
58 | unsigned long size, | |
59 | unsigned alignment, | |
60 | unsigned long color, | |
61 | unsigned long start, | |
62 | unsigned long end, | |
63 | enum drm_mm_search_flags flags); | |
1d58420b | 64 | |
9fc935de DV |
65 | static void drm_mm_insert_helper(struct drm_mm_node *hole_node, |
66 | struct drm_mm_node *node, | |
6b9d89b4 CW |
67 | unsigned long size, unsigned alignment, |
68 | unsigned long color) | |
3a1bd924 | 69 | { |
ea7b1dd4 | 70 | struct drm_mm *mm = hole_node->mm; |
ea7b1dd4 DV |
71 | unsigned long hole_start = drm_mm_hole_node_start(hole_node); |
72 | unsigned long hole_end = drm_mm_hole_node_end(hole_node); | |
6b9d89b4 CW |
73 | unsigned long adj_start = hole_start; |
74 | unsigned long adj_end = hole_end; | |
ea7b1dd4 | 75 | |
9e8944ab | 76 | BUG_ON(node->allocated); |
b0b7af18 | 77 | |
6b9d89b4 CW |
78 | if (mm->color_adjust) |
79 | mm->color_adjust(hole_node, color, &adj_start, &adj_end); | |
1d58420b | 80 | |
6b9d89b4 CW |
81 | if (alignment) { |
82 | unsigned tmp = adj_start % alignment; | |
83 | if (tmp) | |
84 | adj_start += alignment - tmp; | |
85 | } | |
86 | ||
87 | if (adj_start == hole_start) { | |
ea7b1dd4 | 88 | hole_node->hole_follows = 0; |
6b9d89b4 CW |
89 | list_del(&hole_node->hole_stack); |
90 | } | |
ea7b1dd4 | 91 | |
6b9d89b4 | 92 | node->start = adj_start; |
ea7b1dd4 DV |
93 | node->size = size; |
94 | node->mm = mm; | |
6b9d89b4 | 95 | node->color = color; |
b0b7af18 | 96 | node->allocated = 1; |
3a1bd924 | 97 | |
ea7b1dd4 DV |
98 | INIT_LIST_HEAD(&node->hole_stack); |
99 | list_add(&node->node_list, &hole_node->node_list); | |
100 | ||
6b9d89b4 | 101 | BUG_ON(node->start + node->size > adj_end); |
ea7b1dd4 | 102 | |
6b9d89b4 | 103 | node->hole_follows = 0; |
9e8944ab | 104 | if (__drm_mm_hole_node_start(node) < hole_end) { |
ea7b1dd4 DV |
105 | list_add(&node->hole_stack, &mm->hole_stack); |
106 | node->hole_follows = 1; | |
1d58420b | 107 | } |
9fc935de DV |
108 | } |
109 | ||
338710e7 | 110 | int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node) |
5973c7ee | 111 | { |
b3a070cc | 112 | struct drm_mm_node *hole; |
338710e7 | 113 | unsigned long end = node->start + node->size; |
9e8944ab CW |
114 | unsigned long hole_start; |
115 | unsigned long hole_end; | |
5973c7ee | 116 | |
338710e7 BW |
117 | BUG_ON(node == NULL); |
118 | ||
119 | /* Find the relevant hole to add our node to */ | |
9e8944ab | 120 | drm_mm_for_each_hole(hole, mm, hole_start, hole_end) { |
338710e7 | 121 | if (hole_start > node->start || hole_end < end) |
5973c7ee CW |
122 | continue; |
123 | ||
5973c7ee CW |
124 | node->mm = mm; |
125 | node->allocated = 1; | |
126 | ||
127 | INIT_LIST_HEAD(&node->hole_stack); | |
128 | list_add(&node->node_list, &hole->node_list); | |
129 | ||
338710e7 | 130 | if (node->start == hole_start) { |
5973c7ee CW |
131 | hole->hole_follows = 0; |
132 | list_del_init(&hole->hole_stack); | |
133 | } | |
134 | ||
135 | node->hole_follows = 0; | |
136 | if (end != hole_end) { | |
137 | list_add(&node->hole_stack, &mm->hole_stack); | |
138 | node->hole_follows = 1; | |
139 | } | |
140 | ||
b3a070cc | 141 | return 0; |
5973c7ee CW |
142 | } |
143 | ||
338710e7 BW |
144 | WARN(1, "no hole found for node 0x%lx + 0x%lx\n", |
145 | node->start, node->size); | |
b3a070cc | 146 | return -ENOSPC; |
5973c7ee | 147 | } |
338710e7 | 148 | EXPORT_SYMBOL(drm_mm_reserve_node); |
5973c7ee | 149 | |
b0b7af18 DV |
150 | /** |
151 | * Search for free space and insert a preallocated memory node. Returns | |
152 | * -ENOSPC if no suitable free area is available. The preallocated memory node | |
153 | * must be cleared. | |
154 | */ | |
b8103450 CW |
155 | int drm_mm_insert_node_generic(struct drm_mm *mm, struct drm_mm_node *node, |
156 | unsigned long size, unsigned alignment, | |
31e5d7c6 DH |
157 | unsigned long color, |
158 | enum drm_mm_search_flags flags) | |
b0b7af18 DV |
159 | { |
160 | struct drm_mm_node *hole_node; | |
161 | ||
b8103450 | 162 | hole_node = drm_mm_search_free_generic(mm, size, alignment, |
31e5d7c6 | 163 | color, flags); |
b0b7af18 DV |
164 | if (!hole_node) |
165 | return -ENOSPC; | |
166 | ||
b8103450 | 167 | drm_mm_insert_helper(hole_node, node, size, alignment, color); |
b0b7af18 DV |
168 | return 0; |
169 | } | |
b8103450 CW |
170 | EXPORT_SYMBOL(drm_mm_insert_node_generic); |
171 | ||
9fc935de DV |
172 | static void drm_mm_insert_helper_range(struct drm_mm_node *hole_node, |
173 | struct drm_mm_node *node, | |
174 | unsigned long size, unsigned alignment, | |
6b9d89b4 | 175 | unsigned long color, |
9fc935de | 176 | unsigned long start, unsigned long end) |
a2e68e92 | 177 | { |
ea7b1dd4 | 178 | struct drm_mm *mm = hole_node->mm; |
ea7b1dd4 DV |
179 | unsigned long hole_start = drm_mm_hole_node_start(hole_node); |
180 | unsigned long hole_end = drm_mm_hole_node_end(hole_node); | |
6b9d89b4 CW |
181 | unsigned long adj_start = hole_start; |
182 | unsigned long adj_end = hole_end; | |
a2e68e92 | 183 | |
b0b7af18 DV |
184 | BUG_ON(!hole_node->hole_follows || node->allocated); |
185 | ||
6b9d89b4 CW |
186 | if (adj_start < start) |
187 | adj_start = start; | |
901593f2 CW |
188 | if (adj_end > end) |
189 | adj_end = end; | |
190 | ||
191 | if (mm->color_adjust) | |
192 | mm->color_adjust(hole_node, color, &adj_start, &adj_end); | |
6b9d89b4 CW |
193 | |
194 | if (alignment) { | |
195 | unsigned tmp = adj_start % alignment; | |
196 | if (tmp) | |
197 | adj_start += alignment - tmp; | |
198 | } | |
ea7b1dd4 | 199 | |
6b9d89b4 | 200 | if (adj_start == hole_start) { |
ea7b1dd4 | 201 | hole_node->hole_follows = 0; |
6b9d89b4 | 202 | list_del(&hole_node->hole_stack); |
a2e68e92 JG |
203 | } |
204 | ||
6b9d89b4 | 205 | node->start = adj_start; |
ea7b1dd4 DV |
206 | node->size = size; |
207 | node->mm = mm; | |
6b9d89b4 | 208 | node->color = color; |
b0b7af18 | 209 | node->allocated = 1; |
ea7b1dd4 DV |
210 | |
211 | INIT_LIST_HEAD(&node->hole_stack); | |
212 | list_add(&node->node_list, &hole_node->node_list); | |
213 | ||
6b9d89b4 | 214 | BUG_ON(node->start + node->size > adj_end); |
ea7b1dd4 DV |
215 | BUG_ON(node->start + node->size > end); |
216 | ||
6b9d89b4 | 217 | node->hole_follows = 0; |
9e8944ab | 218 | if (__drm_mm_hole_node_start(node) < hole_end) { |
ea7b1dd4 DV |
219 | list_add(&node->hole_stack, &mm->hole_stack); |
220 | node->hole_follows = 1; | |
a2e68e92 | 221 | } |
9fc935de DV |
222 | } |
223 | ||
b0b7af18 DV |
224 | /** |
225 | * Search for free space and insert a preallocated memory node. Returns | |
226 | * -ENOSPC if no suitable free area is available. This is for range | |
227 | * restricted allocations. The preallocated memory node must be cleared. | |
3a1bd924 | 228 | */ |
b8103450 CW |
229 | int drm_mm_insert_node_in_range_generic(struct drm_mm *mm, struct drm_mm_node *node, |
230 | unsigned long size, unsigned alignment, unsigned long color, | |
31e5d7c6 DH |
231 | unsigned long start, unsigned long end, |
232 | enum drm_mm_search_flags flags) | |
3a1bd924 | 233 | { |
b0b7af18 DV |
234 | struct drm_mm_node *hole_node; |
235 | ||
b8103450 CW |
236 | hole_node = drm_mm_search_free_in_range_generic(mm, |
237 | size, alignment, color, | |
31e5d7c6 | 238 | start, end, flags); |
b0b7af18 DV |
239 | if (!hole_node) |
240 | return -ENOSPC; | |
241 | ||
b8103450 CW |
242 | drm_mm_insert_helper_range(hole_node, node, |
243 | size, alignment, color, | |
b0b7af18 | 244 | start, end); |
b0b7af18 DV |
245 | return 0; |
246 | } | |
b8103450 CW |
247 | EXPORT_SYMBOL(drm_mm_insert_node_in_range_generic); |
248 | ||
b0b7af18 DV |
249 | /** |
250 | * Remove a memory node from the allocator. | |
251 | */ | |
252 | void drm_mm_remove_node(struct drm_mm_node *node) | |
253 | { | |
ea7b1dd4 DV |
254 | struct drm_mm *mm = node->mm; |
255 | struct drm_mm_node *prev_node; | |
3a1bd924 | 256 | |
3ef80a81 BW |
257 | if (WARN_ON(!node->allocated)) |
258 | return; | |
259 | ||
ea7b1dd4 DV |
260 | BUG_ON(node->scanned_block || node->scanned_prev_free |
261 | || node->scanned_next_free); | |
3a1bd924 | 262 | |
ea7b1dd4 DV |
263 | prev_node = |
264 | list_entry(node->node_list.prev, struct drm_mm_node, node_list); | |
709ea971 | 265 | |
ea7b1dd4 | 266 | if (node->hole_follows) { |
9e8944ab CW |
267 | BUG_ON(__drm_mm_hole_node_start(node) == |
268 | __drm_mm_hole_node_end(node)); | |
ea7b1dd4 DV |
269 | list_del(&node->hole_stack); |
270 | } else | |
9e8944ab CW |
271 | BUG_ON(__drm_mm_hole_node_start(node) != |
272 | __drm_mm_hole_node_end(node)); | |
273 | ||
249d6048 | 274 | |
ea7b1dd4 DV |
275 | if (!prev_node->hole_follows) { |
276 | prev_node->hole_follows = 1; | |
277 | list_add(&prev_node->hole_stack, &mm->hole_stack); | |
278 | } else | |
279 | list_move(&prev_node->hole_stack, &mm->hole_stack); | |
280 | ||
281 | list_del(&node->node_list); | |
b0b7af18 DV |
282 | node->allocated = 0; |
283 | } | |
284 | EXPORT_SYMBOL(drm_mm_remove_node); | |
285 | ||
75214733 DV |
286 | static int check_free_hole(unsigned long start, unsigned long end, |
287 | unsigned long size, unsigned alignment) | |
7a6b2896 | 288 | { |
75214733 | 289 | if (end - start < size) |
7a6b2896 DV |
290 | return 0; |
291 | ||
292 | if (alignment) { | |
75214733 | 293 | unsigned tmp = start % alignment; |
7a6b2896 | 294 | if (tmp) |
6b9d89b4 | 295 | start += alignment - tmp; |
7a6b2896 DV |
296 | } |
297 | ||
6b9d89b4 | 298 | return end >= start + size; |
7a6b2896 DV |
299 | } |
300 | ||
c700c67b DH |
301 | static struct drm_mm_node *drm_mm_search_free_generic(const struct drm_mm *mm, |
302 | unsigned long size, | |
303 | unsigned alignment, | |
304 | unsigned long color, | |
305 | enum drm_mm_search_flags flags) | |
3a1bd924 | 306 | { |
55910517 DA |
307 | struct drm_mm_node *entry; |
308 | struct drm_mm_node *best; | |
9e8944ab CW |
309 | unsigned long adj_start; |
310 | unsigned long adj_end; | |
3a1bd924 TH |
311 | unsigned long best_size; |
312 | ||
709ea971 DV |
313 | BUG_ON(mm->scanned_blocks); |
314 | ||
3a1bd924 TH |
315 | best = NULL; |
316 | best_size = ~0UL; | |
317 | ||
9e8944ab | 318 | drm_mm_for_each_hole(entry, mm, adj_start, adj_end) { |
6b9d89b4 CW |
319 | if (mm->color_adjust) { |
320 | mm->color_adjust(entry, color, &adj_start, &adj_end); | |
321 | if (adj_end <= adj_start) | |
322 | continue; | |
323 | } | |
324 | ||
6b9d89b4 | 325 | if (!check_free_hole(adj_start, adj_end, size, alignment)) |
1d58420b TH |
326 | continue; |
327 | ||
31e5d7c6 | 328 | if (!(flags & DRM_MM_SEARCH_BEST)) |
7a6b2896 | 329 | return entry; |
1d58420b | 330 | |
7a6b2896 DV |
331 | if (entry->size < best_size) { |
332 | best = entry; | |
333 | best_size = entry->size; | |
3a1bd924 TH |
334 | } |
335 | } | |
336 | ||
337 | return best; | |
338 | } | |
6b9d89b4 | 339 | |
c700c67b | 340 | static struct drm_mm_node *drm_mm_search_free_in_range_generic(const struct drm_mm *mm, |
6b9d89b4 CW |
341 | unsigned long size, |
342 | unsigned alignment, | |
343 | unsigned long color, | |
344 | unsigned long start, | |
345 | unsigned long end, | |
31e5d7c6 | 346 | enum drm_mm_search_flags flags) |
a2e68e92 | 347 | { |
a2e68e92 JG |
348 | struct drm_mm_node *entry; |
349 | struct drm_mm_node *best; | |
9e8944ab CW |
350 | unsigned long adj_start; |
351 | unsigned long adj_end; | |
a2e68e92 | 352 | unsigned long best_size; |
a2e68e92 | 353 | |
709ea971 DV |
354 | BUG_ON(mm->scanned_blocks); |
355 | ||
a2e68e92 JG |
356 | best = NULL; |
357 | best_size = ~0UL; | |
358 | ||
9e8944ab CW |
359 | drm_mm_for_each_hole(entry, mm, adj_start, adj_end) { |
360 | if (adj_start < start) | |
361 | adj_start = start; | |
362 | if (adj_end > end) | |
363 | adj_end = end; | |
6b9d89b4 CW |
364 | |
365 | if (mm->color_adjust) { | |
366 | mm->color_adjust(entry, color, &adj_start, &adj_end); | |
367 | if (adj_end <= adj_start) | |
368 | continue; | |
369 | } | |
370 | ||
75214733 | 371 | if (!check_free_hole(adj_start, adj_end, size, alignment)) |
a2e68e92 JG |
372 | continue; |
373 | ||
31e5d7c6 | 374 | if (!(flags & DRM_MM_SEARCH_BEST)) |
7a6b2896 | 375 | return entry; |
a2e68e92 | 376 | |
7a6b2896 DV |
377 | if (entry->size < best_size) { |
378 | best = entry; | |
379 | best_size = entry->size; | |
a2e68e92 JG |
380 | } |
381 | } | |
382 | ||
383 | return best; | |
384 | } | |
a2e68e92 | 385 | |
b0b7af18 DV |
386 | /** |
387 | * Moves an allocation. To be used with embedded struct drm_mm_node. | |
388 | */ | |
389 | void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new) | |
390 | { | |
391 | list_replace(&old->node_list, &new->node_list); | |
2bbd4492 | 392 | list_replace(&old->hole_stack, &new->hole_stack); |
b0b7af18 DV |
393 | new->hole_follows = old->hole_follows; |
394 | new->mm = old->mm; | |
395 | new->start = old->start; | |
396 | new->size = old->size; | |
6b9d89b4 | 397 | new->color = old->color; |
b0b7af18 DV |
398 | |
399 | old->allocated = 0; | |
400 | new->allocated = 1; | |
401 | } | |
402 | EXPORT_SYMBOL(drm_mm_replace_node); | |
403 | ||
709ea971 DV |
404 | /** |
405 | * Initializa lru scanning. | |
406 | * | |
407 | * This simply sets up the scanning routines with the parameters for the desired | |
408 | * hole. | |
409 | * | |
410 | * Warning: As long as the scan list is non-empty, no other operations than | |
411 | * adding/removing nodes to/from the scan list are allowed. | |
412 | */ | |
6b9d89b4 CW |
413 | void drm_mm_init_scan(struct drm_mm *mm, |
414 | unsigned long size, | |
415 | unsigned alignment, | |
416 | unsigned long color) | |
709ea971 | 417 | { |
6b9d89b4 | 418 | mm->scan_color = color; |
709ea971 DV |
419 | mm->scan_alignment = alignment; |
420 | mm->scan_size = size; | |
421 | mm->scanned_blocks = 0; | |
422 | mm->scan_hit_start = 0; | |
901593f2 | 423 | mm->scan_hit_end = 0; |
d935cc61 | 424 | mm->scan_check_range = 0; |
ae0cec28 | 425 | mm->prev_scanned_node = NULL; |
709ea971 DV |
426 | } |
427 | EXPORT_SYMBOL(drm_mm_init_scan); | |
428 | ||
d935cc61 DV |
429 | /** |
430 | * Initializa lru scanning. | |
431 | * | |
432 | * This simply sets up the scanning routines with the parameters for the desired | |
433 | * hole. This version is for range-restricted scans. | |
434 | * | |
435 | * Warning: As long as the scan list is non-empty, no other operations than | |
436 | * adding/removing nodes to/from the scan list are allowed. | |
437 | */ | |
6b9d89b4 CW |
438 | void drm_mm_init_scan_with_range(struct drm_mm *mm, |
439 | unsigned long size, | |
d935cc61 | 440 | unsigned alignment, |
6b9d89b4 | 441 | unsigned long color, |
d935cc61 DV |
442 | unsigned long start, |
443 | unsigned long end) | |
444 | { | |
6b9d89b4 | 445 | mm->scan_color = color; |
d935cc61 DV |
446 | mm->scan_alignment = alignment; |
447 | mm->scan_size = size; | |
448 | mm->scanned_blocks = 0; | |
449 | mm->scan_hit_start = 0; | |
901593f2 | 450 | mm->scan_hit_end = 0; |
d935cc61 DV |
451 | mm->scan_start = start; |
452 | mm->scan_end = end; | |
453 | mm->scan_check_range = 1; | |
ae0cec28 | 454 | mm->prev_scanned_node = NULL; |
d935cc61 DV |
455 | } |
456 | EXPORT_SYMBOL(drm_mm_init_scan_with_range); | |
457 | ||
709ea971 DV |
458 | /** |
459 | * Add a node to the scan list that might be freed to make space for the desired | |
460 | * hole. | |
461 | * | |
462 | * Returns non-zero, if a hole has been found, zero otherwise. | |
463 | */ | |
464 | int drm_mm_scan_add_block(struct drm_mm_node *node) | |
465 | { | |
466 | struct drm_mm *mm = node->mm; | |
ea7b1dd4 DV |
467 | struct drm_mm_node *prev_node; |
468 | unsigned long hole_start, hole_end; | |
901593f2 | 469 | unsigned long adj_start, adj_end; |
709ea971 DV |
470 | |
471 | mm->scanned_blocks++; | |
472 | ||
ea7b1dd4 | 473 | BUG_ON(node->scanned_block); |
709ea971 | 474 | node->scanned_block = 1; |
709ea971 | 475 | |
ea7b1dd4 DV |
476 | prev_node = list_entry(node->node_list.prev, struct drm_mm_node, |
477 | node_list); | |
709ea971 | 478 | |
ea7b1dd4 DV |
479 | node->scanned_preceeds_hole = prev_node->hole_follows; |
480 | prev_node->hole_follows = 1; | |
481 | list_del(&node->node_list); | |
482 | node->node_list.prev = &prev_node->node_list; | |
ae0cec28 DV |
483 | node->node_list.next = &mm->prev_scanned_node->node_list; |
484 | mm->prev_scanned_node = node; | |
709ea971 | 485 | |
901593f2 CW |
486 | adj_start = hole_start = drm_mm_hole_node_start(prev_node); |
487 | adj_end = hole_end = drm_mm_hole_node_end(prev_node); | |
6b9d89b4 | 488 | |
d935cc61 | 489 | if (mm->scan_check_range) { |
6b9d89b4 CW |
490 | if (adj_start < mm->scan_start) |
491 | adj_start = mm->scan_start; | |
492 | if (adj_end > mm->scan_end) | |
493 | adj_end = mm->scan_end; | |
d935cc61 DV |
494 | } |
495 | ||
901593f2 CW |
496 | if (mm->color_adjust) |
497 | mm->color_adjust(prev_node, mm->scan_color, | |
498 | &adj_start, &adj_end); | |
499 | ||
6b9d89b4 | 500 | if (check_free_hole(adj_start, adj_end, |
75214733 | 501 | mm->scan_size, mm->scan_alignment)) { |
ea7b1dd4 | 502 | mm->scan_hit_start = hole_start; |
901593f2 | 503 | mm->scan_hit_end = hole_end; |
709ea971 DV |
504 | return 1; |
505 | } | |
506 | ||
507 | return 0; | |
508 | } | |
509 | EXPORT_SYMBOL(drm_mm_scan_add_block); | |
510 | ||
511 | /** | |
512 | * Remove a node from the scan list. | |
513 | * | |
514 | * Nodes _must_ be removed in the exact same order from the scan list as they | |
515 | * have been added, otherwise the internal state of the memory manager will be | |
516 | * corrupted. | |
517 | * | |
518 | * When the scan list is empty, the selected memory nodes can be freed. An | |
31e5d7c6 DH |
519 | * immediately following drm_mm_search_free with !DRM_MM_SEARCH_BEST will then |
520 | * return the just freed block (because its at the top of the free_stack list). | |
709ea971 DV |
521 | * |
522 | * Returns one if this block should be evicted, zero otherwise. Will always | |
523 | * return zero when no hole has been found. | |
524 | */ | |
525 | int drm_mm_scan_remove_block(struct drm_mm_node *node) | |
526 | { | |
527 | struct drm_mm *mm = node->mm; | |
ea7b1dd4 | 528 | struct drm_mm_node *prev_node; |
709ea971 DV |
529 | |
530 | mm->scanned_blocks--; | |
531 | ||
532 | BUG_ON(!node->scanned_block); | |
533 | node->scanned_block = 0; | |
709ea971 | 534 | |
ea7b1dd4 DV |
535 | prev_node = list_entry(node->node_list.prev, struct drm_mm_node, |
536 | node_list); | |
709ea971 | 537 | |
ea7b1dd4 | 538 | prev_node->hole_follows = node->scanned_preceeds_hole; |
ea7b1dd4 | 539 | list_add(&node->node_list, &prev_node->node_list); |
709ea971 | 540 | |
901593f2 CW |
541 | return (drm_mm_hole_node_end(node) > mm->scan_hit_start && |
542 | node->start < mm->scan_hit_end); | |
709ea971 DV |
543 | } |
544 | EXPORT_SYMBOL(drm_mm_scan_remove_block); | |
545 | ||
55910517 | 546 | int drm_mm_clean(struct drm_mm * mm) |
3a1bd924 | 547 | { |
ea7b1dd4 | 548 | struct list_head *head = &mm->head_node.node_list; |
3a1bd924 | 549 | |
1d58420b TH |
550 | return (head->next->next == head); |
551 | } | |
249d6048 | 552 | EXPORT_SYMBOL(drm_mm_clean); |
3a1bd924 | 553 | |
77ef8bbc | 554 | void drm_mm_init(struct drm_mm * mm, unsigned long start, unsigned long size) |
1d58420b | 555 | { |
ea7b1dd4 | 556 | INIT_LIST_HEAD(&mm->hole_stack); |
709ea971 | 557 | mm->scanned_blocks = 0; |
3a1bd924 | 558 | |
ea7b1dd4 DV |
559 | /* Clever trick to avoid a special case in the free hole tracking. */ |
560 | INIT_LIST_HEAD(&mm->head_node.node_list); | |
561 | INIT_LIST_HEAD(&mm->head_node.hole_stack); | |
562 | mm->head_node.hole_follows = 1; | |
563 | mm->head_node.scanned_block = 0; | |
564 | mm->head_node.scanned_prev_free = 0; | |
565 | mm->head_node.scanned_next_free = 0; | |
566 | mm->head_node.mm = mm; | |
567 | mm->head_node.start = start + size; | |
568 | mm->head_node.size = start - mm->head_node.start; | |
569 | list_add_tail(&mm->head_node.hole_stack, &mm->hole_stack); | |
570 | ||
6b9d89b4 | 571 | mm->color_adjust = NULL; |
3a1bd924 | 572 | } |
673a394b | 573 | EXPORT_SYMBOL(drm_mm_init); |
3a1bd924 | 574 | |
55910517 | 575 | void drm_mm_takedown(struct drm_mm * mm) |
3a1bd924 | 576 | { |
c700c67b DH |
577 | WARN(!list_empty(&mm->head_node.node_list), |
578 | "Memory manager not clean during takedown.\n"); | |
3a1bd924 | 579 | } |
f453ba04 | 580 | EXPORT_SYMBOL(drm_mm_takedown); |
fa8a1238 | 581 | |
2c54b133 DV |
582 | static unsigned long drm_mm_debug_hole(struct drm_mm_node *entry, |
583 | const char *prefix) | |
99d7e48e | 584 | { |
ea7b1dd4 DV |
585 | unsigned long hole_start, hole_end, hole_size; |
586 | ||
2c54b133 DV |
587 | if (entry->hole_follows) { |
588 | hole_start = drm_mm_hole_node_start(entry); | |
589 | hole_end = drm_mm_hole_node_end(entry); | |
590 | hole_size = hole_end - hole_start; | |
ea7b1dd4 DV |
591 | printk(KERN_DEBUG "%s 0x%08lx-0x%08lx: %8lu: free\n", |
592 | prefix, hole_start, hole_end, | |
593 | hole_size); | |
2c54b133 DV |
594 | return hole_size; |
595 | } | |
596 | ||
597 | return 0; | |
598 | } | |
599 | ||
600 | void drm_mm_debug_table(struct drm_mm *mm, const char *prefix) | |
601 | { | |
602 | struct drm_mm_node *entry; | |
603 | unsigned long total_used = 0, total_free = 0, total = 0; | |
604 | ||
605 | total_free += drm_mm_debug_hole(&mm->head_node, prefix); | |
ea7b1dd4 DV |
606 | |
607 | drm_mm_for_each_node(entry, mm) { | |
608 | printk(KERN_DEBUG "%s 0x%08lx-0x%08lx: %8lu: used\n", | |
99d7e48e | 609 | prefix, entry->start, entry->start + entry->size, |
ea7b1dd4 DV |
610 | entry->size); |
611 | total_used += entry->size; | |
2c54b133 | 612 | total_free += drm_mm_debug_hole(entry, prefix); |
99d7e48e | 613 | } |
ea7b1dd4 DV |
614 | total = total_free + total_used; |
615 | ||
616 | printk(KERN_DEBUG "%s total: %lu, used %lu free %lu\n", prefix, total, | |
99d7e48e JG |
617 | total_used, total_free); |
618 | } | |
619 | EXPORT_SYMBOL(drm_mm_debug_table); | |
620 | ||
fa8a1238 | 621 | #if defined(CONFIG_DEBUG_FS) |
3a359f0b | 622 | static unsigned long drm_mm_dump_hole(struct seq_file *m, struct drm_mm_node *entry) |
fa8a1238 | 623 | { |
ea7b1dd4 DV |
624 | unsigned long hole_start, hole_end, hole_size; |
625 | ||
3a359f0b DV |
626 | if (entry->hole_follows) { |
627 | hole_start = drm_mm_hole_node_start(entry); | |
628 | hole_end = drm_mm_hole_node_end(entry); | |
629 | hole_size = hole_end - hole_start; | |
ea7b1dd4 DV |
630 | seq_printf(m, "0x%08lx-0x%08lx: 0x%08lx: free\n", |
631 | hole_start, hole_end, hole_size); | |
3a359f0b DV |
632 | return hole_size; |
633 | } | |
634 | ||
635 | return 0; | |
636 | } | |
637 | ||
638 | int drm_mm_dump_table(struct seq_file *m, struct drm_mm *mm) | |
639 | { | |
640 | struct drm_mm_node *entry; | |
641 | unsigned long total_used = 0, total_free = 0, total = 0; | |
642 | ||
643 | total_free += drm_mm_dump_hole(m, &mm->head_node); | |
ea7b1dd4 DV |
644 | |
645 | drm_mm_for_each_node(entry, mm) { | |
646 | seq_printf(m, "0x%08lx-0x%08lx: 0x%08lx: used\n", | |
647 | entry->start, entry->start + entry->size, | |
648 | entry->size); | |
649 | total_used += entry->size; | |
3a359f0b | 650 | total_free += drm_mm_dump_hole(m, entry); |
fa8a1238 | 651 | } |
ea7b1dd4 DV |
652 | total = total_free + total_used; |
653 | ||
654 | seq_printf(m, "total: %lu, used %lu free %lu\n", total, total_used, total_free); | |
fa8a1238 DA |
655 | return 0; |
656 | } | |
657 | EXPORT_SYMBOL(drm_mm_dump_table); | |
658 | #endif |