Rev 3764 | Rev 4104 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1123 | serge | 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: |
||
41 | * Thomas Hellström |
||
42 | */ |
||
43 | |||
3031 | serge | 44 | #include |
45 | #include |
||
1963 | serge | 46 | #include |
1179 | serge | 47 | #include |
3031 | serge | 48 | #include |
1123 | serge | 49 | |
50 | #define MM_UNUSED_TARGET 4 |
||
51 | |||
52 | static struct drm_mm_node *drm_mm_kmalloc(struct drm_mm *mm, int atomic) |
||
53 | { |
||
54 | struct drm_mm_node *child; |
||
55 | |||
1963 | serge | 56 | if (atomic) |
57 | child = kzalloc(sizeof(*child), GFP_ATOMIC); |
||
58 | else |
||
59 | child = kzalloc(sizeof(*child), GFP_KERNEL); |
||
1123 | serge | 60 | |
61 | if (unlikely(child == NULL)) { |
||
62 | spin_lock(&mm->unused_lock); |
||
63 | if (list_empty(&mm->unused_nodes)) |
||
64 | child = NULL; |
||
65 | else { |
||
66 | child = |
||
67 | list_entry(mm->unused_nodes.next, |
||
1963 | serge | 68 | struct drm_mm_node, node_list); |
69 | list_del(&child->node_list); |
||
1123 | serge | 70 | --mm->num_unused; |
71 | } |
||
72 | spin_unlock(&mm->unused_lock); |
||
73 | } |
||
74 | return child; |
||
75 | } |
||
76 | |||
1321 | serge | 77 | /* drm_mm_pre_get() - pre allocate drm_mm_node structure |
78 | * drm_mm: memory manager struct we are pre-allocating for |
||
79 | * |
||
80 | * Returns 0 on success or -ENOMEM if allocation fails. |
||
81 | */ |
||
1123 | serge | 82 | int drm_mm_pre_get(struct drm_mm *mm) |
83 | { |
||
84 | struct drm_mm_node *node; |
||
85 | |||
86 | spin_lock(&mm->unused_lock); |
||
87 | while (mm->num_unused < MM_UNUSED_TARGET) { |
||
88 | spin_unlock(&mm->unused_lock); |
||
1963 | serge | 89 | node = kzalloc(sizeof(*node), GFP_KERNEL); |
1123 | serge | 90 | spin_lock(&mm->unused_lock); |
91 | |||
92 | if (unlikely(node == NULL)) { |
||
93 | int ret = (mm->num_unused < 2) ? -ENOMEM : 0; |
||
94 | spin_unlock(&mm->unused_lock); |
||
95 | return ret; |
||
96 | } |
||
97 | ++mm->num_unused; |
||
1963 | serge | 98 | list_add_tail(&node->node_list, &mm->unused_nodes); |
1123 | serge | 99 | } |
100 | spin_unlock(&mm->unused_lock); |
||
101 | return 0; |
||
102 | } |
||
1126 | serge | 103 | EXPORT_SYMBOL(drm_mm_pre_get); |
1123 | serge | 104 | |
1963 | serge | 105 | static void drm_mm_insert_helper(struct drm_mm_node *hole_node, |
106 | struct drm_mm_node *node, |
||
3031 | serge | 107 | unsigned long size, unsigned alignment, |
108 | unsigned long color) |
||
1123 | serge | 109 | { |
1963 | serge | 110 | struct drm_mm *mm = hole_node->mm; |
111 | unsigned long hole_start = drm_mm_hole_node_start(hole_node); |
||
112 | unsigned long hole_end = drm_mm_hole_node_end(hole_node); |
||
3031 | serge | 113 | unsigned long adj_start = hole_start; |
114 | unsigned long adj_end = hole_end; |
||
1123 | serge | 115 | |
3480 | Serge | 116 | BUG_ON(node->allocated); |
1963 | serge | 117 | |
3031 | serge | 118 | if (mm->color_adjust) |
119 | mm->color_adjust(hole_node, color, &adj_start, &adj_end); |
||
1963 | serge | 120 | |
3031 | serge | 121 | if (alignment) { |
122 | unsigned tmp = adj_start % alignment; |
||
123 | if (tmp) |
||
124 | adj_start += alignment - tmp; |
||
125 | } |
||
126 | |||
127 | if (adj_start == hole_start) { |
||
1963 | serge | 128 | hole_node->hole_follows = 0; |
3031 | serge | 129 | list_del(&hole_node->hole_stack); |
130 | } |
||
1963 | serge | 131 | |
3031 | serge | 132 | node->start = adj_start; |
1963 | serge | 133 | node->size = size; |
134 | node->mm = mm; |
||
3031 | serge | 135 | node->color = color; |
1963 | serge | 136 | node->allocated = 1; |
137 | |||
138 | INIT_LIST_HEAD(&node->hole_stack); |
||
139 | list_add(&node->node_list, &hole_node->node_list); |
||
140 | |||
3031 | serge | 141 | BUG_ON(node->start + node->size > adj_end); |
1963 | serge | 142 | |
3031 | serge | 143 | node->hole_follows = 0; |
3480 | Serge | 144 | if (__drm_mm_hole_node_start(node) < hole_end) { |
1963 | serge | 145 | list_add(&node->hole_stack, &mm->hole_stack); |
146 | node->hole_follows = 1; |
||
1123 | serge | 147 | } |
148 | } |
||
149 | |||
3480 | Serge | 150 | struct drm_mm_node *drm_mm_create_block(struct drm_mm *mm, |
151 | unsigned long start, |
||
152 | unsigned long size, |
||
153 | bool atomic) |
||
154 | { |
||
155 | struct drm_mm_node *hole, *node; |
||
156 | unsigned long end = start + size; |
||
157 | unsigned long hole_start; |
||
158 | unsigned long hole_end; |
||
159 | |||
160 | drm_mm_for_each_hole(hole, mm, hole_start, hole_end) { |
||
161 | if (hole_start > start || hole_end < end) |
||
162 | continue; |
||
163 | |||
164 | node = drm_mm_kmalloc(mm, atomic); |
||
165 | if (unlikely(node == NULL)) |
||
166 | return NULL; |
||
167 | |||
168 | node->start = start; |
||
169 | node->size = size; |
||
170 | node->mm = mm; |
||
171 | node->allocated = 1; |
||
172 | |||
173 | INIT_LIST_HEAD(&node->hole_stack); |
||
174 | list_add(&node->node_list, &hole->node_list); |
||
175 | |||
176 | if (start == hole_start) { |
||
177 | hole->hole_follows = 0; |
||
178 | list_del_init(&hole->hole_stack); |
||
179 | } |
||
180 | |||
181 | node->hole_follows = 0; |
||
182 | if (end != hole_end) { |
||
183 | list_add(&node->hole_stack, &mm->hole_stack); |
||
184 | node->hole_follows = 1; |
||
185 | } |
||
186 | |||
187 | return node; |
||
188 | } |
||
189 | |||
190 | WARN(1, "no hole found for block 0x%lx + 0x%lx\n", start, size); |
||
191 | return NULL; |
||
192 | } |
||
193 | EXPORT_SYMBOL(drm_mm_create_block); |
||
194 | |||
1963 | serge | 195 | struct drm_mm_node *drm_mm_get_block_generic(struct drm_mm_node *hole_node, |
1123 | serge | 196 | unsigned long size, |
1963 | serge | 197 | unsigned alignment, |
3031 | serge | 198 | unsigned long color, |
1123 | serge | 199 | int atomic) |
200 | { |
||
1963 | serge | 201 | struct drm_mm_node *node; |
1123 | serge | 202 | |
1963 | serge | 203 | node = drm_mm_kmalloc(hole_node->mm, atomic); |
204 | if (unlikely(node == NULL)) |
||
1123 | serge | 205 | return NULL; |
206 | |||
3031 | serge | 207 | drm_mm_insert_helper(hole_node, node, size, alignment, color); |
1123 | serge | 208 | |
1963 | serge | 209 | return node; |
210 | } |
||
211 | EXPORT_SYMBOL(drm_mm_get_block_generic); |
||
1123 | serge | 212 | |
1963 | serge | 213 | /** |
214 | * Search for free space and insert a preallocated memory node. Returns |
||
215 | * -ENOSPC if no suitable free area is available. The preallocated memory node |
||
216 | * must be cleared. |
||
217 | */ |
||
3192 | Serge | 218 | int drm_mm_insert_node_generic(struct drm_mm *mm, struct drm_mm_node *node, |
219 | unsigned long size, unsigned alignment, |
||
220 | unsigned long color) |
||
1963 | serge | 221 | { |
222 | struct drm_mm_node *hole_node; |
||
1123 | serge | 223 | |
3192 | Serge | 224 | hole_node = drm_mm_search_free_generic(mm, size, alignment, |
225 | color, 0); |
||
1963 | serge | 226 | if (!hole_node) |
227 | return -ENOSPC; |
||
228 | |||
3192 | Serge | 229 | drm_mm_insert_helper(hole_node, node, size, alignment, color); |
1963 | serge | 230 | return 0; |
1123 | serge | 231 | } |
3192 | Serge | 232 | EXPORT_SYMBOL(drm_mm_insert_node_generic); |
233 | |||
234 | int drm_mm_insert_node(struct drm_mm *mm, struct drm_mm_node *node, |
||
235 | unsigned long size, unsigned alignment) |
||
236 | { |
||
237 | return drm_mm_insert_node_generic(mm, node, size, alignment, 0); |
||
238 | } |
||
1963 | serge | 239 | EXPORT_SYMBOL(drm_mm_insert_node); |
1123 | serge | 240 | |
1963 | serge | 241 | static void drm_mm_insert_helper_range(struct drm_mm_node *hole_node, |
242 | struct drm_mm_node *node, |
||
243 | unsigned long size, unsigned alignment, |
||
3031 | serge | 244 | unsigned long color, |
1963 | serge | 245 | unsigned long start, unsigned long end) |
1123 | serge | 246 | { |
1963 | serge | 247 | struct drm_mm *mm = hole_node->mm; |
248 | unsigned long hole_start = drm_mm_hole_node_start(hole_node); |
||
249 | unsigned long hole_end = drm_mm_hole_node_end(hole_node); |
||
3031 | serge | 250 | unsigned long adj_start = hole_start; |
251 | unsigned long adj_end = hole_end; |
||
1123 | serge | 252 | |
1963 | serge | 253 | BUG_ON(!hole_node->hole_follows || node->allocated); |
1123 | serge | 254 | |
3192 | Serge | 255 | if (adj_start < start) |
256 | adj_start = start; |
||
257 | if (adj_end > end) |
||
258 | adj_end = end; |
||
259 | |||
3031 | serge | 260 | if (mm->color_adjust) |
261 | mm->color_adjust(hole_node, color, &adj_start, &adj_end); |
||
1123 | serge | 262 | |
3031 | serge | 263 | if (alignment) { |
264 | unsigned tmp = adj_start % alignment; |
||
1963 | serge | 265 | if (tmp) |
3031 | serge | 266 | adj_start += alignment - tmp; |
267 | } |
||
1963 | serge | 268 | |
3031 | serge | 269 | if (adj_start == hole_start) { |
1963 | serge | 270 | hole_node->hole_follows = 0; |
3031 | serge | 271 | list_del(&hole_node->hole_stack); |
1123 | serge | 272 | } |
273 | |||
3031 | serge | 274 | node->start = adj_start; |
1963 | serge | 275 | node->size = size; |
276 | node->mm = mm; |
||
3031 | serge | 277 | node->color = color; |
1963 | serge | 278 | node->allocated = 1; |
279 | |||
280 | INIT_LIST_HEAD(&node->hole_stack); |
||
281 | list_add(&node->node_list, &hole_node->node_list); |
||
282 | |||
3031 | serge | 283 | BUG_ON(node->start + node->size > adj_end); |
1963 | serge | 284 | BUG_ON(node->start + node->size > end); |
285 | |||
3031 | serge | 286 | node->hole_follows = 0; |
3480 | Serge | 287 | if (__drm_mm_hole_node_start(node) < hole_end) { |
1963 | serge | 288 | list_add(&node->hole_stack, &mm->hole_stack); |
289 | node->hole_follows = 1; |
||
1123 | serge | 290 | } |
291 | } |
||
292 | |||
1963 | serge | 293 | struct drm_mm_node *drm_mm_get_block_range_generic(struct drm_mm_node *hole_node, |
1321 | serge | 294 | unsigned long size, |
295 | unsigned alignment, |
||
3031 | serge | 296 | unsigned long color, |
1321 | serge | 297 | unsigned long start, |
298 | unsigned long end, |
||
299 | int atomic) |
||
300 | { |
||
1963 | serge | 301 | struct drm_mm_node *node; |
1321 | serge | 302 | |
1963 | serge | 303 | node = drm_mm_kmalloc(hole_node->mm, atomic); |
304 | if (unlikely(node == NULL)) |
||
1321 | serge | 305 | return NULL; |
306 | |||
3031 | serge | 307 | drm_mm_insert_helper_range(hole_node, node, size, alignment, color, |
1963 | serge | 308 | start, end); |
1321 | serge | 309 | |
310 | return node; |
||
311 | } |
||
312 | EXPORT_SYMBOL(drm_mm_get_block_range_generic); |
||
313 | |||
1963 | serge | 314 | /** |
315 | * Search for free space and insert a preallocated memory node. Returns |
||
316 | * -ENOSPC if no suitable free area is available. This is for range |
||
317 | * restricted allocations. The preallocated memory node must be cleared. |
||
1123 | serge | 318 | */ |
3192 | Serge | 319 | int drm_mm_insert_node_in_range_generic(struct drm_mm *mm, struct drm_mm_node *node, |
320 | unsigned long size, unsigned alignment, unsigned long color, |
||
1963 | serge | 321 | unsigned long start, unsigned long end) |
322 | { |
||
323 | struct drm_mm_node *hole_node; |
||
1123 | serge | 324 | |
3192 | Serge | 325 | hole_node = drm_mm_search_free_in_range_generic(mm, |
326 | size, alignment, color, |
||
327 | start, end, 0); |
||
1963 | serge | 328 | if (!hole_node) |
329 | return -ENOSPC; |
||
330 | |||
3192 | Serge | 331 | drm_mm_insert_helper_range(hole_node, node, |
332 | size, alignment, color, |
||
1963 | serge | 333 | start, end); |
334 | return 0; |
||
335 | } |
||
3192 | Serge | 336 | EXPORT_SYMBOL(drm_mm_insert_node_in_range_generic); |
337 | |||
338 | int drm_mm_insert_node_in_range(struct drm_mm *mm, struct drm_mm_node *node, |
||
339 | unsigned long size, unsigned alignment, |
||
340 | unsigned long start, unsigned long end) |
||
341 | { |
||
342 | return drm_mm_insert_node_in_range_generic(mm, node, size, alignment, 0, start, end); |
||
343 | } |
||
1963 | serge | 344 | EXPORT_SYMBOL(drm_mm_insert_node_in_range); |
345 | |||
346 | /** |
||
347 | * Remove a memory node from the allocator. |
||
348 | */ |
||
349 | void drm_mm_remove_node(struct drm_mm_node *node) |
||
1123 | serge | 350 | { |
1963 | serge | 351 | struct drm_mm *mm = node->mm; |
352 | struct drm_mm_node *prev_node; |
||
1123 | serge | 353 | |
1963 | serge | 354 | BUG_ON(node->scanned_block || node->scanned_prev_free |
355 | || node->scanned_next_free); |
||
1123 | serge | 356 | |
1963 | serge | 357 | prev_node = |
358 | list_entry(node->node_list.prev, struct drm_mm_node, node_list); |
||
1123 | serge | 359 | |
1963 | serge | 360 | if (node->hole_follows) { |
3480 | Serge | 361 | BUG_ON(__drm_mm_hole_node_start(node) == |
362 | __drm_mm_hole_node_end(node)); |
||
1963 | serge | 363 | list_del(&node->hole_stack); |
364 | } else |
||
3480 | Serge | 365 | BUG_ON(__drm_mm_hole_node_start(node) != |
366 | __drm_mm_hole_node_end(node)); |
||
1963 | serge | 367 | |
3480 | Serge | 368 | |
1963 | serge | 369 | if (!prev_node->hole_follows) { |
370 | prev_node->hole_follows = 1; |
||
371 | list_add(&prev_node->hole_stack, &mm->hole_stack); |
||
1123 | serge | 372 | } else |
1963 | serge | 373 | list_move(&prev_node->hole_stack, &mm->hole_stack); |
374 | |||
375 | list_del(&node->node_list); |
||
376 | node->allocated = 0; |
||
377 | } |
||
378 | EXPORT_SYMBOL(drm_mm_remove_node); |
||
379 | |||
380 | /* |
||
381 | * Remove a memory node from the allocator and free the allocated struct |
||
382 | * drm_mm_node. Only to be used on a struct drm_mm_node obtained by one of the |
||
383 | * drm_mm_get_block functions. |
||
384 | */ |
||
385 | void drm_mm_put_block(struct drm_mm_node *node) |
||
386 | { |
||
387 | |||
388 | struct drm_mm *mm = node->mm; |
||
389 | |||
4075 | Serge | 390 | drm_mm_remove_node(node); |
1963 | serge | 391 | |
4075 | Serge | 392 | spin_lock(&mm->unused_lock); |
393 | if (mm->num_unused < MM_UNUSED_TARGET) { |
||
394 | list_add(&node->node_list, &mm->unused_nodes); |
||
395 | ++mm->num_unused; |
||
396 | } else |
||
397 | kfree(node); |
||
398 | spin_unlock(&mm->unused_lock); |
||
1963 | serge | 399 | } |
400 | EXPORT_SYMBOL(drm_mm_put_block); |
||
401 | |||
402 | static int check_free_hole(unsigned long start, unsigned long end, |
||
403 | unsigned long size, unsigned alignment) |
||
404 | { |
||
405 | if (end - start < size) |
||
406 | return 0; |
||
407 | |||
408 | if (alignment) { |
||
409 | unsigned tmp = start % alignment; |
||
410 | if (tmp) |
||
3031 | serge | 411 | start += alignment - tmp; |
1123 | serge | 412 | } |
1963 | serge | 413 | |
3031 | serge | 414 | return end >= start + size; |
1123 | serge | 415 | } |
416 | |||
3031 | serge | 417 | struct drm_mm_node *drm_mm_search_free_generic(const struct drm_mm *mm, |
1123 | serge | 418 | unsigned long size, |
3031 | serge | 419 | unsigned alignment, |
420 | unsigned long color, |
||
421 | bool best_match) |
||
1123 | serge | 422 | { |
423 | struct drm_mm_node *entry; |
||
424 | struct drm_mm_node *best; |
||
3480 | Serge | 425 | unsigned long adj_start; |
426 | unsigned long adj_end; |
||
1123 | serge | 427 | unsigned long best_size; |
428 | |||
1963 | serge | 429 | BUG_ON(mm->scanned_blocks); |
430 | |||
1123 | serge | 431 | best = NULL; |
432 | best_size = ~0UL; |
||
433 | |||
3480 | Serge | 434 | drm_mm_for_each_hole(entry, mm, adj_start, adj_end) { |
3031 | serge | 435 | if (mm->color_adjust) { |
436 | mm->color_adjust(entry, color, &adj_start, &adj_end); |
||
437 | if (adj_end <= adj_start) |
||
438 | continue; |
||
439 | } |
||
440 | |||
441 | if (!check_free_hole(adj_start, adj_end, size, alignment)) |
||
1123 | serge | 442 | continue; |
443 | |||
444 | if (!best_match) |
||
445 | return entry; |
||
1963 | serge | 446 | |
1404 | serge | 447 | if (entry->size < best_size) { |
1123 | serge | 448 | best = entry; |
449 | best_size = entry->size; |
||
450 | } |
||
451 | } |
||
452 | |||
453 | return best; |
||
454 | } |
||
3031 | serge | 455 | EXPORT_SYMBOL(drm_mm_search_free_generic); |
1123 | serge | 456 | |
3031 | serge | 457 | struct drm_mm_node *drm_mm_search_free_in_range_generic(const struct drm_mm *mm, |
1321 | serge | 458 | unsigned long size, |
459 | unsigned alignment, |
||
3031 | serge | 460 | unsigned long color, |
1321 | serge | 461 | unsigned long start, |
462 | unsigned long end, |
||
3031 | serge | 463 | bool best_match) |
1321 | serge | 464 | { |
465 | struct drm_mm_node *entry; |
||
466 | struct drm_mm_node *best; |
||
3480 | Serge | 467 | unsigned long adj_start; |
468 | unsigned long adj_end; |
||
1321 | serge | 469 | unsigned long best_size; |
470 | |||
1963 | serge | 471 | BUG_ON(mm->scanned_blocks); |
472 | |||
1321 | serge | 473 | best = NULL; |
474 | best_size = ~0UL; |
||
475 | |||
3480 | Serge | 476 | drm_mm_for_each_hole(entry, mm, adj_start, adj_end) { |
477 | if (adj_start < start) |
||
478 | adj_start = start; |
||
479 | if (adj_end > end) |
||
480 | adj_end = end; |
||
1321 | serge | 481 | |
3031 | serge | 482 | if (mm->color_adjust) { |
483 | mm->color_adjust(entry, color, &adj_start, &adj_end); |
||
484 | if (adj_end <= adj_start) |
||
485 | continue; |
||
486 | } |
||
487 | |||
1963 | serge | 488 | if (!check_free_hole(adj_start, adj_end, size, alignment)) |
1321 | serge | 489 | continue; |
490 | |||
491 | if (!best_match) |
||
492 | return entry; |
||
1963 | serge | 493 | |
1404 | serge | 494 | if (entry->size < best_size) { |
1321 | serge | 495 | best = entry; |
496 | best_size = entry->size; |
||
497 | } |
||
498 | } |
||
499 | |||
500 | return best; |
||
501 | } |
||
3031 | serge | 502 | EXPORT_SYMBOL(drm_mm_search_free_in_range_generic); |
1321 | serge | 503 | |
1963 | serge | 504 | /** |
505 | * Moves an allocation. To be used with embedded struct drm_mm_node. |
||
506 | */ |
||
507 | void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new) |
||
508 | { |
||
509 | list_replace(&old->node_list, &new->node_list); |
||
510 | list_replace(&old->hole_stack, &new->hole_stack); |
||
511 | new->hole_follows = old->hole_follows; |
||
512 | new->mm = old->mm; |
||
513 | new->start = old->start; |
||
514 | new->size = old->size; |
||
3031 | serge | 515 | new->color = old->color; |
1963 | serge | 516 | |
517 | old->allocated = 0; |
||
518 | new->allocated = 1; |
||
519 | } |
||
520 | EXPORT_SYMBOL(drm_mm_replace_node); |
||
521 | |||
522 | /** |
||
523 | * Initializa lru scanning. |
||
524 | * |
||
525 | * This simply sets up the scanning routines with the parameters for the desired |
||
526 | * hole. |
||
527 | * |
||
528 | * Warning: As long as the scan list is non-empty, no other operations than |
||
529 | * adding/removing nodes to/from the scan list are allowed. |
||
530 | */ |
||
3031 | serge | 531 | void drm_mm_init_scan(struct drm_mm *mm, |
532 | unsigned long size, |
||
533 | unsigned alignment, |
||
534 | unsigned long color) |
||
1963 | serge | 535 | { |
3031 | serge | 536 | mm->scan_color = color; |
1963 | serge | 537 | mm->scan_alignment = alignment; |
538 | mm->scan_size = size; |
||
539 | mm->scanned_blocks = 0; |
||
540 | mm->scan_hit_start = 0; |
||
3192 | Serge | 541 | mm->scan_hit_end = 0; |
1963 | serge | 542 | mm->scan_check_range = 0; |
543 | mm->prev_scanned_node = NULL; |
||
544 | } |
||
545 | EXPORT_SYMBOL(drm_mm_init_scan); |
||
546 | |||
547 | /** |
||
548 | * Initializa lru scanning. |
||
549 | * |
||
550 | * This simply sets up the scanning routines with the parameters for the desired |
||
551 | * hole. This version is for range-restricted scans. |
||
552 | * |
||
553 | * Warning: As long as the scan list is non-empty, no other operations than |
||
554 | * adding/removing nodes to/from the scan list are allowed. |
||
555 | */ |
||
3031 | serge | 556 | void drm_mm_init_scan_with_range(struct drm_mm *mm, |
557 | unsigned long size, |
||
1963 | serge | 558 | unsigned alignment, |
3031 | serge | 559 | unsigned long color, |
1963 | serge | 560 | unsigned long start, |
561 | unsigned long end) |
||
562 | { |
||
3031 | serge | 563 | mm->scan_color = color; |
1963 | serge | 564 | mm->scan_alignment = alignment; |
565 | mm->scan_size = size; |
||
566 | mm->scanned_blocks = 0; |
||
567 | mm->scan_hit_start = 0; |
||
3192 | Serge | 568 | mm->scan_hit_end = 0; |
1963 | serge | 569 | mm->scan_start = start; |
570 | mm->scan_end = end; |
||
571 | mm->scan_check_range = 1; |
||
572 | mm->prev_scanned_node = NULL; |
||
573 | } |
||
574 | EXPORT_SYMBOL(drm_mm_init_scan_with_range); |
||
575 | |||
576 | /** |
||
577 | * Add a node to the scan list that might be freed to make space for the desired |
||
578 | * hole. |
||
579 | * |
||
580 | * Returns non-zero, if a hole has been found, zero otherwise. |
||
581 | */ |
||
582 | int drm_mm_scan_add_block(struct drm_mm_node *node) |
||
583 | { |
||
584 | struct drm_mm *mm = node->mm; |
||
585 | struct drm_mm_node *prev_node; |
||
586 | unsigned long hole_start, hole_end; |
||
3192 | Serge | 587 | unsigned long adj_start, adj_end; |
1963 | serge | 588 | |
589 | mm->scanned_blocks++; |
||
590 | |||
591 | BUG_ON(node->scanned_block); |
||
592 | node->scanned_block = 1; |
||
593 | |||
594 | prev_node = list_entry(node->node_list.prev, struct drm_mm_node, |
||
595 | node_list); |
||
596 | |||
597 | node->scanned_preceeds_hole = prev_node->hole_follows; |
||
598 | prev_node->hole_follows = 1; |
||
599 | list_del(&node->node_list); |
||
600 | node->node_list.prev = &prev_node->node_list; |
||
601 | node->node_list.next = &mm->prev_scanned_node->node_list; |
||
602 | mm->prev_scanned_node = node; |
||
603 | |||
3192 | Serge | 604 | adj_start = hole_start = drm_mm_hole_node_start(prev_node); |
605 | adj_end = hole_end = drm_mm_hole_node_end(prev_node); |
||
3031 | serge | 606 | |
607 | if (mm->scan_check_range) { |
||
608 | if (adj_start < mm->scan_start) |
||
609 | adj_start = mm->scan_start; |
||
610 | if (adj_end > mm->scan_end) |
||
611 | adj_end = mm->scan_end; |
||
1963 | serge | 612 | } |
613 | |||
3192 | Serge | 614 | if (mm->color_adjust) |
615 | mm->color_adjust(prev_node, mm->scan_color, |
||
616 | &adj_start, &adj_end); |
||
617 | |||
3031 | serge | 618 | if (check_free_hole(adj_start, adj_end, |
1963 | serge | 619 | mm->scan_size, mm->scan_alignment)) { |
620 | mm->scan_hit_start = hole_start; |
||
3192 | Serge | 621 | mm->scan_hit_end = hole_end; |
1963 | serge | 622 | return 1; |
623 | } |
||
624 | |||
625 | return 0; |
||
626 | } |
||
627 | EXPORT_SYMBOL(drm_mm_scan_add_block); |
||
628 | |||
629 | /** |
||
630 | * Remove a node from the scan list. |
||
631 | * |
||
632 | * Nodes _must_ be removed in the exact same order from the scan list as they |
||
633 | * have been added, otherwise the internal state of the memory manager will be |
||
634 | * corrupted. |
||
635 | * |
||
636 | * When the scan list is empty, the selected memory nodes can be freed. An |
||
637 | * immediately following drm_mm_search_free with best_match = 0 will then return |
||
638 | * the just freed block (because its at the top of the free_stack list). |
||
639 | * |
||
640 | * Returns one if this block should be evicted, zero otherwise. Will always |
||
641 | * return zero when no hole has been found. |
||
642 | */ |
||
643 | int drm_mm_scan_remove_block(struct drm_mm_node *node) |
||
644 | { |
||
645 | struct drm_mm *mm = node->mm; |
||
646 | struct drm_mm_node *prev_node; |
||
647 | |||
648 | mm->scanned_blocks--; |
||
649 | |||
650 | BUG_ON(!node->scanned_block); |
||
651 | node->scanned_block = 0; |
||
652 | |||
653 | prev_node = list_entry(node->node_list.prev, struct drm_mm_node, |
||
654 | node_list); |
||
655 | |||
656 | prev_node->hole_follows = node->scanned_preceeds_hole; |
||
657 | list_add(&node->node_list, &prev_node->node_list); |
||
658 | |||
3192 | Serge | 659 | return (drm_mm_hole_node_end(node) > mm->scan_hit_start && |
660 | node->start < mm->scan_hit_end); |
||
1963 | serge | 661 | } |
662 | EXPORT_SYMBOL(drm_mm_scan_remove_block); |
||
663 | |||
1123 | serge | 664 | int drm_mm_clean(struct drm_mm * mm) |
665 | { |
||
1963 | serge | 666 | struct list_head *head = &mm->head_node.node_list; |
1123 | serge | 667 | |
668 | return (head->next->next == head); |
||
669 | } |
||
1126 | serge | 670 | EXPORT_SYMBOL(drm_mm_clean); |
1123 | serge | 671 | |
4075 | Serge | 672 | void drm_mm_init(struct drm_mm * mm, unsigned long start, unsigned long size) |
1123 | serge | 673 | { |
1963 | serge | 674 | INIT_LIST_HEAD(&mm->hole_stack); |
1123 | serge | 675 | INIT_LIST_HEAD(&mm->unused_nodes); |
676 | mm->num_unused = 0; |
||
1963 | serge | 677 | mm->scanned_blocks = 0; |
1123 | serge | 678 | spin_lock_init(&mm->unused_lock); |
679 | |||
1963 | serge | 680 | /* Clever trick to avoid a special case in the free hole tracking. */ |
681 | INIT_LIST_HEAD(&mm->head_node.node_list); |
||
682 | INIT_LIST_HEAD(&mm->head_node.hole_stack); |
||
683 | mm->head_node.hole_follows = 1; |
||
684 | mm->head_node.scanned_block = 0; |
||
685 | mm->head_node.scanned_prev_free = 0; |
||
686 | mm->head_node.scanned_next_free = 0; |
||
687 | mm->head_node.mm = mm; |
||
688 | mm->head_node.start = start + size; |
||
689 | mm->head_node.size = start - mm->head_node.start; |
||
690 | list_add_tail(&mm->head_node.hole_stack, &mm->hole_stack); |
||
691 | |||
3031 | serge | 692 | mm->color_adjust = NULL; |
1123 | serge | 693 | } |
1126 | serge | 694 | EXPORT_SYMBOL(drm_mm_init); |
1123 | serge | 695 | |
696 | void drm_mm_takedown(struct drm_mm * mm) |
||
697 | { |
||
1963 | serge | 698 | struct drm_mm_node *entry, *next; |
1123 | serge | 699 | |
4075 | Serge | 700 | if (WARN(!list_empty(&mm->head_node.node_list), |
701 | "Memory manager not clean. Delaying takedown\n")) { |
||
1123 | serge | 702 | return; |
703 | } |
||
704 | |||
1963 | serge | 705 | spin_lock(&mm->unused_lock); |
706 | list_for_each_entry_safe(entry, next, &mm->unused_nodes, node_list) { |
||
707 | list_del(&entry->node_list); |
||
1123 | serge | 708 | kfree(entry); |
709 | --mm->num_unused; |
||
710 | } |
||
711 | spin_unlock(&mm->unused_lock); |
||
712 | |||
713 | BUG_ON(mm->num_unused != 0); |
||
714 | } |
||
1126 | serge | 715 | EXPORT_SYMBOL(drm_mm_takedown); |
3192 | Serge | 716 | |
4075 | Serge | 717 | static unsigned long drm_mm_debug_hole(struct drm_mm_node *entry, |
718 | const char *prefix) |
||
3192 | Serge | 719 | { |
720 | unsigned long hole_start, hole_end, hole_size; |
||
721 | |||
4075 | Serge | 722 | if (entry->hole_follows) { |
723 | hole_start = drm_mm_hole_node_start(entry); |
||
724 | hole_end = drm_mm_hole_node_end(entry); |
||
3192 | Serge | 725 | hole_size = hole_end - hole_start; |
726 | printk(KERN_DEBUG "%s 0x%08lx-0x%08lx: %8lu: free\n", |
||
727 | prefix, hole_start, hole_end, |
||
728 | hole_size); |
||
4075 | Serge | 729 | return hole_size; |
730 | } |
||
3192 | Serge | 731 | |
4075 | Serge | 732 | return 0; |
733 | } |
||
734 | |||
735 | void drm_mm_debug_table(struct drm_mm *mm, const char *prefix) |
||
736 | { |
||
737 | struct drm_mm_node *entry; |
||
738 | unsigned long total_used = 0, total_free = 0, total = 0; |
||
739 | |||
740 | total_free += drm_mm_debug_hole(&mm->head_node, prefix); |
||
741 | |||
3192 | Serge | 742 | drm_mm_for_each_node(entry, mm) { |
743 | printk(KERN_DEBUG "%s 0x%08lx-0x%08lx: %8lu: used\n", |
||
744 | prefix, entry->start, entry->start + entry->size, |
||
745 | entry->size); |
||
746 | total_used += entry->size; |
||
4075 | Serge | 747 | total_free += drm_mm_debug_hole(entry, prefix); |
3192 | Serge | 748 | } |
749 | total = total_free + total_used; |
||
750 | |||
751 | printk(KERN_DEBUG "%s total: %lu, used %lu free %lu\n", prefix, total, |
||
752 | total_used, total_free); |
||
753 | } |
||
754 | EXPORT_SYMBOL(drm_mm_debug_table); |
||
755 | |||
756 | #if defined(CONFIG_DEBUG_FS) |
||
3764 | Serge | 757 | static unsigned long drm_mm_dump_hole(struct seq_file *m, struct drm_mm_node *entry) |
3192 | Serge | 758 | { |
759 | unsigned long hole_start, hole_end, hole_size; |
||
760 | |||
3764 | Serge | 761 | if (entry->hole_follows) { |
762 | hole_start = drm_mm_hole_node_start(entry); |
||
763 | hole_end = drm_mm_hole_node_end(entry); |
||
3192 | Serge | 764 | hole_size = hole_end - hole_start; |
765 | seq_printf(m, "0x%08lx-0x%08lx: 0x%08lx: free\n", |
||
766 | hole_start, hole_end, hole_size); |
||
3764 | Serge | 767 | return hole_size; |
768 | } |
||
3192 | Serge | 769 | |
3764 | Serge | 770 | return 0; |
771 | } |
||
772 | |||
773 | int drm_mm_dump_table(struct seq_file *m, struct drm_mm *mm) |
||
774 | { |
||
775 | struct drm_mm_node *entry; |
||
776 | unsigned long total_used = 0, total_free = 0, total = 0; |
||
777 | |||
778 | total_free += drm_mm_dump_hole(m, &mm->head_node); |
||
779 | |||
3192 | Serge | 780 | drm_mm_for_each_node(entry, mm) { |
781 | seq_printf(m, "0x%08lx-0x%08lx: 0x%08lx: used\n", |
||
782 | entry->start, entry->start + entry->size, |
||
783 | entry->size); |
||
784 | total_used += entry->size; |
||
3764 | Serge | 785 | total_free += drm_mm_dump_hole(m, entry); |
3192 | Serge | 786 | } |
787 | total = total_free + total_used; |
||
788 | |||
789 | seq_printf(m, "total: %lu, used %lu free %lu\n", total, total_used, total_free); |
||
790 | return 0; |
||
791 | } |
||
792 | EXPORT_SYMBOL(drm_mm_dump_table); |
||
793 | #endif>>>=>>>=>>>>>>>>> |