drm_mm.c 24.3 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
/**************************************************************************
 *
 * Copyright 2006 Tungsten Graphics, Inc., Bismarck, ND., USA.
 * All Rights Reserved.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the
 * "Software"), to deal in the Software without restriction, including
 * without limitation the rights to use, copy, modify, merge, publish,
 * distribute, sub license, and/or sell copies of the Software, and to
 * permit persons to whom the Software is furnished to do so, subject to
 * the following conditions:
 *
 * The above copyright notice and this permission notice (including the
 * next paragraph) shall be included in all copies or substantial portions
 * of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
 * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
 * USE OR OTHER DEALINGS IN THE SOFTWARE.
 *
 *
 **************************************************************************/

/*
 * Generic simple memory manager implementation. Intended to be used as a base
 * class implementation for more advanced memory managers.
 *
 * Note that the algorithm used is quite simple and there might be substantial
 * performance gains if a smarter free list is implemented. Currently it is just an
 * unordered stack of free regions. This could easily be improved if an RB-tree
 * is used instead. At least if we expect heavy fragmentation.
 *
 * Aligned allocations can also see improvement.
 *
 * Authors:
41
 * Thomas Hellström <thomas-at-tungstengraphics-dot-com>
42 43
 */

44 45
#include <drm/drmP.h>
#include <drm/drm_mm.h>
46
#include <linux/slab.h>
47
#include <linux/seq_file.h>
48
#include <linux/export.h>
49

50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88
/**
 * DOC: Overview
 *
 * drm_mm provides a simple range allocator. The drivers are free to use the
 * resource allocator from the linux core if it suits them, the upside of drm_mm
 * is that it's in the DRM core. Which means that it's easier to extend for
 * some of the crazier special purpose needs of gpus.
 *
 * The main data struct is &drm_mm, allocations are tracked in &drm_mm_node.
 * Drivers are free to embed either of them into their own suitable
 * datastructures. drm_mm itself will not do any allocations of its own, so if
 * drivers choose not to embed nodes they need to still allocate them
 * themselves.
 *
 * The range allocator also supports reservation of preallocated blocks. This is
 * useful for taking over initial mode setting configurations from the firmware,
 * where an object needs to be created which exactly matches the firmware's
 * scanout target. As long as the range is still free it can be inserted anytime
 * after the allocator is initialized, which helps with avoiding looped
 * depencies in the driver load sequence.
 *
 * drm_mm maintains a stack of most recently freed holes, which of all
 * simplistic datastructures seems to be a fairly decent approach to clustering
 * allocations and avoiding too much fragmentation. This means free space
 * searches are O(num_holes). Given that all the fancy features drm_mm supports
 * something better would be fairly complex and since gfx thrashing is a fairly
 * steep cliff not a real concern. Removing a node again is O(1).
 *
 * drm_mm supports a few features: Alignment and range restrictions can be
 * supplied. Further more every &drm_mm_node has a color value (which is just an
 * opaqua unsigned long) which in conjunction with a driver callback can be used
 * to implement sophisticated placement restrictions. The i915 DRM driver uses
 * this to implement guard pages between incompatible caching domains in the
 * graphics TT.
 *
 * Finally iteration helpers to walk all nodes and all holes are provided as are
 * some basic allocator dumpers for debugging.
 */

D
David Herrmann 已提交
89 90 91 92 93 94 95 96 97 98 99 100
static struct drm_mm_node *drm_mm_search_free_generic(const struct drm_mm *mm,
						unsigned long size,
						unsigned alignment,
						unsigned long color,
						enum drm_mm_search_flags flags);
static struct drm_mm_node *drm_mm_search_free_in_range_generic(const struct drm_mm *mm,
						unsigned long size,
						unsigned alignment,
						unsigned long color,
						unsigned long start,
						unsigned long end,
						enum drm_mm_search_flags flags);
101

102 103
static void drm_mm_insert_helper(struct drm_mm_node *hole_node,
				 struct drm_mm_node *node,
104 105
				 unsigned long size, unsigned alignment,
				 unsigned long color)
106
{
107 108 109
	struct drm_mm *mm = hole_node->mm;
	unsigned long hole_start = drm_mm_hole_node_start(hole_node);
	unsigned long hole_end = drm_mm_hole_node_end(hole_node);
110 111
	unsigned long adj_start = hole_start;
	unsigned long adj_end = hole_end;
112

113
	BUG_ON(node->allocated);
114

115 116
	if (mm->color_adjust)
		mm->color_adjust(hole_node, color, &adj_start, &adj_end);
117

118 119 120 121 122 123 124
	if (alignment) {
		unsigned tmp = adj_start % alignment;
		if (tmp)
			adj_start += alignment - tmp;
	}

	if (adj_start == hole_start) {
125
		hole_node->hole_follows = 0;
126 127
		list_del(&hole_node->hole_stack);
	}
128

129
	node->start = adj_start;
130 131
	node->size = size;
	node->mm = mm;
132
	node->color = color;
133
	node->allocated = 1;
134

135 136 137
	INIT_LIST_HEAD(&node->hole_stack);
	list_add(&node->node_list, &hole_node->node_list);

138
	BUG_ON(node->start + node->size > adj_end);
139

140
	node->hole_follows = 0;
141
	if (__drm_mm_hole_node_start(node) < hole_end) {
142 143
		list_add(&node->hole_stack, &mm->hole_stack);
		node->hole_follows = 1;
144
	}
145 146
}

147 148 149 150 151 152 153 154 155 156 157 158 159 160
/**
 * drm_mm_reserve_node - insert an pre-initialized node
 * @mm: drm_mm allocator to insert @node into
 * @node: drm_mm_node to insert
 *
 * This functions inserts an already set-up drm_mm_node into the allocator,
 * meaning that start, size and color must be set by the caller. This is useful
 * to initialize the allocator with preallocated objects which must be set-up
 * before the range allocator can be set-up, e.g. when taking over a firmware
 * framebuffer.
 *
 * Returns:
 * 0 on success, -ENOSPC if there's no hole where @node is.
 */
161
int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node)
162
{
163
	struct drm_mm_node *hole;
164
	unsigned long end = node->start + node->size;
165 166
	unsigned long hole_start;
	unsigned long hole_end;
167

168 169 170
	BUG_ON(node == NULL);

	/* Find the relevant hole to add our node to */
171
	drm_mm_for_each_hole(hole, mm, hole_start, hole_end) {
172
		if (hole_start > node->start || hole_end < end)
173 174 175 176 177 178 179 180
			continue;

		node->mm = mm;
		node->allocated = 1;

		INIT_LIST_HEAD(&node->hole_stack);
		list_add(&node->node_list, &hole->node_list);

181
		if (node->start == hole_start) {
182 183 184 185 186 187 188 189 190 191
			hole->hole_follows = 0;
			list_del_init(&hole->hole_stack);
		}

		node->hole_follows = 0;
		if (end != hole_end) {
			list_add(&node->hole_stack, &mm->hole_stack);
			node->hole_follows = 1;
		}

192
		return 0;
193 194
	}

195 196
	WARN(1, "no hole found for node 0x%lx + 0x%lx\n",
	     node->start, node->size);
197
	return -ENOSPC;
198
}
199
EXPORT_SYMBOL(drm_mm_reserve_node);
200

201
/**
202 203 204 205 206 207 208 209 210 211 212 213
 * drm_mm_insert_node_generic - search for space and insert @node
 * @mm: drm_mm to allocate from
 * @node: preallocate node to insert
 * @size: size of the allocation
 * @alignment: alignment of the allocation
 * @color: opaque tag value to use for this node
 * @flags: flags to fine-tune the allocation
 *
 * The preallocated node must be cleared to 0.
 *
 * Returns:
 * 0 on success, -ENOSPC if there's no suitable hole.
214
 */
215 216
int drm_mm_insert_node_generic(struct drm_mm *mm, struct drm_mm_node *node,
			       unsigned long size, unsigned alignment,
217 218
			       unsigned long color,
			       enum drm_mm_search_flags flags)
219 220 221
{
	struct drm_mm_node *hole_node;

222
	hole_node = drm_mm_search_free_generic(mm, size, alignment,
223
					       color, flags);
224 225 226
	if (!hole_node)
		return -ENOSPC;

227
	drm_mm_insert_helper(hole_node, node, size, alignment, color);
228 229
	return 0;
}
230 231
EXPORT_SYMBOL(drm_mm_insert_node_generic);

232 233 234
static void drm_mm_insert_helper_range(struct drm_mm_node *hole_node,
				       struct drm_mm_node *node,
				       unsigned long size, unsigned alignment,
235
				       unsigned long color,
236
				       unsigned long start, unsigned long end)
237
{
238 239 240
	struct drm_mm *mm = hole_node->mm;
	unsigned long hole_start = drm_mm_hole_node_start(hole_node);
	unsigned long hole_end = drm_mm_hole_node_end(hole_node);
241 242
	unsigned long adj_start = hole_start;
	unsigned long adj_end = hole_end;
243

244 245
	BUG_ON(!hole_node->hole_follows || node->allocated);

246 247
	if (adj_start < start)
		adj_start = start;
248 249 250 251 252
	if (adj_end > end)
		adj_end = end;

	if (mm->color_adjust)
		mm->color_adjust(hole_node, color, &adj_start, &adj_end);
253 254 255 256 257 258

	if (alignment) {
		unsigned tmp = adj_start % alignment;
		if (tmp)
			adj_start += alignment - tmp;
	}
259

260
	if (adj_start == hole_start) {
261
		hole_node->hole_follows = 0;
262
		list_del(&hole_node->hole_stack);
263 264
	}

265
	node->start = adj_start;
266 267
	node->size = size;
	node->mm = mm;
268
	node->color = color;
269
	node->allocated = 1;
270 271 272 273

	INIT_LIST_HEAD(&node->hole_stack);
	list_add(&node->node_list, &hole_node->node_list);

274
	BUG_ON(node->start + node->size > adj_end);
275 276
	BUG_ON(node->start + node->size > end);

277
	node->hole_follows = 0;
278
	if (__drm_mm_hole_node_start(node) < hole_end) {
279 280
		list_add(&node->hole_stack, &mm->hole_stack);
		node->hole_follows = 1;
281
	}
282 283
}

284
/**
285 286 287 288 289 290 291 292 293 294 295 296 297 298
 * drm_mm_insert_node_in_range_generic - ranged search for space and insert @node
 * @mm: drm_mm to allocate from
 * @node: preallocate node to insert
 * @size: size of the allocation
 * @alignment: alignment of the allocation
 * @color: opaque tag value to use for this node
 * @start: start of the allowed range for this node
 * @end: end of the allowed range for this node
 * @flags: flags to fine-tune the allocation
 *
 * The preallocated node must be cleared to 0.
 *
 * Returns:
 * 0 on success, -ENOSPC if there's no suitable hole.
299
 */
300 301
int drm_mm_insert_node_in_range_generic(struct drm_mm *mm, struct drm_mm_node *node,
					unsigned long size, unsigned alignment, unsigned long color,
302 303
					unsigned long start, unsigned long end,
					enum drm_mm_search_flags flags)
304
{
305 306
	struct drm_mm_node *hole_node;

307 308
	hole_node = drm_mm_search_free_in_range_generic(mm,
							size, alignment, color,
309
							start, end, flags);
310 311 312
	if (!hole_node)
		return -ENOSPC;

313 314
	drm_mm_insert_helper_range(hole_node, node,
				   size, alignment, color,
315 316 317
				   start, end);
	return 0;
}
318 319
EXPORT_SYMBOL(drm_mm_insert_node_in_range_generic);

320
/**
321 322 323 324 325 326
 * drm_mm_remove_node - Remove a memory node from the allocator.
 * @node: drm_mm_node to remove
 *
 * This just removes a node from its drm_mm allocator. The node does not need to
 * be cleared again before it can be re-inserted into this or any other drm_mm
 * allocator. It is a bug to call this function on a un-allocated node.
327 328 329
 */
void drm_mm_remove_node(struct drm_mm_node *node)
{
330 331
	struct drm_mm *mm = node->mm;
	struct drm_mm_node *prev_node;
332

333 334 335
	if (WARN_ON(!node->allocated))
		return;

336 337
	BUG_ON(node->scanned_block || node->scanned_prev_free
				   || node->scanned_next_free);
338

339 340
	prev_node =
	    list_entry(node->node_list.prev, struct drm_mm_node, node_list);
341

342
	if (node->hole_follows) {
343 344
		BUG_ON(__drm_mm_hole_node_start(node) ==
		       __drm_mm_hole_node_end(node));
345 346
		list_del(&node->hole_stack);
	} else
347 348 349
		BUG_ON(__drm_mm_hole_node_start(node) !=
		       __drm_mm_hole_node_end(node));

350

351 352 353 354 355 356 357
	if (!prev_node->hole_follows) {
		prev_node->hole_follows = 1;
		list_add(&prev_node->hole_stack, &mm->hole_stack);
	} else
		list_move(&prev_node->hole_stack, &mm->hole_stack);

	list_del(&node->node_list);
358 359 360 361
	node->allocated = 0;
}
EXPORT_SYMBOL(drm_mm_remove_node);

362 363
static int check_free_hole(unsigned long start, unsigned long end,
			   unsigned long size, unsigned alignment)
364
{
365
	if (end - start < size)
366 367 368
		return 0;

	if (alignment) {
369
		unsigned tmp = start % alignment;
370
		if (tmp)
371
			start += alignment - tmp;
372 373
	}

374
	return end >= start + size;
375 376
}

D
David Herrmann 已提交
377 378 379 380 381
static struct drm_mm_node *drm_mm_search_free_generic(const struct drm_mm *mm,
						      unsigned long size,
						      unsigned alignment,
						      unsigned long color,
						      enum drm_mm_search_flags flags)
382
{
D
Dave Airlie 已提交
383 384
	struct drm_mm_node *entry;
	struct drm_mm_node *best;
385 386
	unsigned long adj_start;
	unsigned long adj_end;
387 388
	unsigned long best_size;

389 390
	BUG_ON(mm->scanned_blocks);

391 392 393
	best = NULL;
	best_size = ~0UL;

394
	drm_mm_for_each_hole(entry, mm, adj_start, adj_end) {
395 396 397 398 399 400 401
		if (mm->color_adjust) {
			mm->color_adjust(entry, color, &adj_start, &adj_end);
			if (adj_end <= adj_start)
				continue;
		}

		if (!check_free_hole(adj_start, adj_end, size, alignment))
402 403
			continue;

404
		if (!(flags & DRM_MM_SEARCH_BEST))
405
			return entry;
406

407 408 409
		if (entry->size < best_size) {
			best = entry;
			best_size = entry->size;
410 411 412 413 414
		}
	}

	return best;
}
415

D
David Herrmann 已提交
416
static struct drm_mm_node *drm_mm_search_free_in_range_generic(const struct drm_mm *mm,
417 418 419 420 421
							unsigned long size,
							unsigned alignment,
							unsigned long color,
							unsigned long start,
							unsigned long end,
422
							enum drm_mm_search_flags flags)
423 424 425
{
	struct drm_mm_node *entry;
	struct drm_mm_node *best;
426 427
	unsigned long adj_start;
	unsigned long adj_end;
428 429
	unsigned long best_size;

430 431
	BUG_ON(mm->scanned_blocks);

432 433 434
	best = NULL;
	best_size = ~0UL;

435 436 437 438 439
	drm_mm_for_each_hole(entry, mm, adj_start, adj_end) {
		if (adj_start < start)
			adj_start = start;
		if (adj_end > end)
			adj_end = end;
440 441 442 443 444 445 446

		if (mm->color_adjust) {
			mm->color_adjust(entry, color, &adj_start, &adj_end);
			if (adj_end <= adj_start)
				continue;
		}

447
		if (!check_free_hole(adj_start, adj_end, size, alignment))
448 449
			continue;

450
		if (!(flags & DRM_MM_SEARCH_BEST))
451
			return entry;
452

453 454 455
		if (entry->size < best_size) {
			best = entry;
			best_size = entry->size;
456 457 458 459 460 461
		}
	}

	return best;
}

462
/**
463 464 465 466 467 468 469
 * drm_mm_replace_node - move an allocation from @old to @new
 * @old: drm_mm_node to remove from the allocator
 * @new: drm_mm_node which should inherit @old's allocation
 *
 * This is useful for when drivers embed the drm_mm_node structure and hence
 * can't move allocations by reassigning pointers. It's a combination of remove
 * and insert with the guarantee that the allocation start will match.
470 471 472 473
 */
void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new)
{
	list_replace(&old->node_list, &new->node_list);
D
Daniel Vetter 已提交
474
	list_replace(&old->hole_stack, &new->hole_stack);
475 476 477 478
	new->hole_follows = old->hole_follows;
	new->mm = old->mm;
	new->start = old->start;
	new->size = old->size;
479
	new->color = old->color;
480 481 482 483 484 485

	old->allocated = 0;
	new->allocated = 1;
}
EXPORT_SYMBOL(drm_mm_replace_node);

486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513
/**
 * DOC: lru scan roaster
 *
 * Very often GPUs need to have continuous allocations for a given object. When
 * evicting objects to make space for a new one it is therefore not most
 * efficient when we simply start to select all objects from the tail of an LRU
 * until there's a suitable hole: Especially for big objects or nodes that
 * otherwise have special allocation constraints there's a good chance we evict
 * lots of (smaller) objects unecessarily.
 *
 * The DRM range allocator supports this use-case through the scanning
 * interfaces. First a scan operation needs to be initialized with
 * drm_mm_init_scan() or drm_mm_init_scan_with_range(). The the driver adds
 * objects to the roaster (probably by walking an LRU list, but this can be
 * freely implemented) until a suitable hole is found or there's no further
 * evitable object.
 *
 * The the driver must walk through all objects again in exactly the reverse
 * order to restore the allocator state. Note that while the allocator is used
 * in the scan mode no other operation is allowed.
 *
 * Finally the driver evicts all objects selected in the scan. Adding and
 * removing an object is O(1), and since freeing a node is also O(1) the overall
 * complexity is O(scanned_objects). So like the free stack which needs to be
 * walked before a scan operation even begins this is linear in the number of
 * objects. It doesn't seem to hurt badly.
 */

514
/**
515 516 517 518 519
 * drm_mm_init_scan - initialize lru scanning
 * @mm: drm_mm to scan
 * @size: size of the allocation
 * @alignment: alignment of the allocation
 * @color: opaque tag value to use for the allocation
520 521
 *
 * This simply sets up the scanning routines with the parameters for the desired
522 523
 * hole. Note that there's no need to specify allocation flags, since they only
 * change the place a node is allocated from within a suitable hole.
524
 *
525 526
 * Warning:
 * As long as the scan list is non-empty, no other operations than
527 528
 * adding/removing nodes to/from the scan list are allowed.
 */
529 530 531 532
void drm_mm_init_scan(struct drm_mm *mm,
		      unsigned long size,
		      unsigned alignment,
		      unsigned long color)
533
{
534
	mm->scan_color = color;
535 536 537 538
	mm->scan_alignment = alignment;
	mm->scan_size = size;
	mm->scanned_blocks = 0;
	mm->scan_hit_start = 0;
539
	mm->scan_hit_end = 0;
540
	mm->scan_check_range = 0;
541
	mm->prev_scanned_node = NULL;
542 543 544
}
EXPORT_SYMBOL(drm_mm_init_scan);

545
/**
546 547 548 549 550 551 552
 * drm_mm_init_scan - initialize range-restricted lru scanning
 * @mm: drm_mm to scan
 * @size: size of the allocation
 * @alignment: alignment of the allocation
 * @color: opaque tag value to use for the allocation
 * @start: start of the allowed range for the allocation
 * @end: end of the allowed range for the allocation
553 554
 *
 * This simply sets up the scanning routines with the parameters for the desired
555 556
 * hole. Note that there's no need to specify allocation flags, since they only
 * change the place a node is allocated from within a suitable hole.
557
 *
558 559
 * Warning:
 * As long as the scan list is non-empty, no other operations than
560 561
 * adding/removing nodes to/from the scan list are allowed.
 */
562 563
void drm_mm_init_scan_with_range(struct drm_mm *mm,
				 unsigned long size,
564
				 unsigned alignment,
565
				 unsigned long color,
566 567 568
				 unsigned long start,
				 unsigned long end)
{
569
	mm->scan_color = color;
570 571 572 573
	mm->scan_alignment = alignment;
	mm->scan_size = size;
	mm->scanned_blocks = 0;
	mm->scan_hit_start = 0;
574
	mm->scan_hit_end = 0;
575 576 577
	mm->scan_start = start;
	mm->scan_end = end;
	mm->scan_check_range = 1;
578
	mm->prev_scanned_node = NULL;
579 580 581
}
EXPORT_SYMBOL(drm_mm_init_scan_with_range);

582
/**
583 584 585
 * drm_mm_scan_add_block - add a node to the scan list
 * @node: drm_mm_node to add
 *
586 587 588
 * Add a node to the scan list that might be freed to make space for the desired
 * hole.
 *
589 590
 * Returns:
 * True if a hole has been found, false otherwise.
591
 */
592
bool drm_mm_scan_add_block(struct drm_mm_node *node)
593 594
{
	struct drm_mm *mm = node->mm;
595 596
	struct drm_mm_node *prev_node;
	unsigned long hole_start, hole_end;
597
	unsigned long adj_start, adj_end;
598 599 600

	mm->scanned_blocks++;

601
	BUG_ON(node->scanned_block);
602 603
	node->scanned_block = 1;

604 605
	prev_node = list_entry(node->node_list.prev, struct drm_mm_node,
			       node_list);
606

607 608 609 610
	node->scanned_preceeds_hole = prev_node->hole_follows;
	prev_node->hole_follows = 1;
	list_del(&node->node_list);
	node->node_list.prev = &prev_node->node_list;
611 612
	node->node_list.next = &mm->prev_scanned_node->node_list;
	mm->prev_scanned_node = node;
613

614 615
	adj_start = hole_start = drm_mm_hole_node_start(prev_node);
	adj_end = hole_end = drm_mm_hole_node_end(prev_node);
616

617
	if (mm->scan_check_range) {
618 619 620 621
		if (adj_start < mm->scan_start)
			adj_start = mm->scan_start;
		if (adj_end > mm->scan_end)
			adj_end = mm->scan_end;
622 623
	}

624 625 626 627
	if (mm->color_adjust)
		mm->color_adjust(prev_node, mm->scan_color,
				 &adj_start, &adj_end);

628
	if (check_free_hole(adj_start, adj_end,
629
			    mm->scan_size, mm->scan_alignment)) {
630
		mm->scan_hit_start = hole_start;
631
		mm->scan_hit_end = hole_end;
632
		return true;
633 634
	}

635
	return false;
636 637 638 639
}
EXPORT_SYMBOL(drm_mm_scan_add_block);

/**
640 641
 * drm_mm_scan_remove_block - remove a node from the scan list
 * @node: drm_mm_node to remove
642 643 644 645 646 647
 *
 * Nodes _must_ be removed in the exact same order from the scan list as they
 * have been added, otherwise the internal state of the memory manager will be
 * corrupted.
 *
 * When the scan list is empty, the selected memory nodes can be freed. An
648 649
 * immediately following drm_mm_search_free with !DRM_MM_SEARCH_BEST will then
 * return the just freed block (because its at the top of the free_stack list).
650
 *
651 652 653
 * Returns:
 * True if this block should be evicted, false otherwise. Will always
 * return false when no hole has been found.
654
 */
655
bool drm_mm_scan_remove_block(struct drm_mm_node *node)
656 657
{
	struct drm_mm *mm = node->mm;
658
	struct drm_mm_node *prev_node;
659 660 661 662 663 664

	mm->scanned_blocks--;

	BUG_ON(!node->scanned_block);
	node->scanned_block = 0;

665 666
	prev_node = list_entry(node->node_list.prev, struct drm_mm_node,
			       node_list);
667

668 669
	prev_node->hole_follows = node->scanned_preceeds_hole;
	list_add(&node->node_list, &prev_node->node_list);
670

671 672
	 return (drm_mm_hole_node_end(node) > mm->scan_hit_start &&
		 node->start < mm->scan_hit_end);
673 674 675
}
EXPORT_SYMBOL(drm_mm_scan_remove_block);

676 677 678 679 680 681 682 683 684
/**
 * drm_mm_clean - checks whether an allocator is clean
 * @mm: drm_mm allocator to check
 *
 * Returns:
 * True if the allocator is completely free, false if there's still a node
 * allocated in it.
 */
bool drm_mm_clean(struct drm_mm * mm)
685
{
686
	struct list_head *head = &mm->head_node.node_list;
687

688 689
	return (head->next->next == head);
}
690
EXPORT_SYMBOL(drm_mm_clean);
691

692 693 694 695 696 697 698 699
/**
 * drm_mm_init - initialize a drm-mm allocator
 * @mm: the drm_mm structure to initialize
 * @start: start of the range managed by @mm
 * @size: end of the range managed by @mm
 *
 * Note that @mm must be cleared to 0 before calling this function.
 */
700
void drm_mm_init(struct drm_mm * mm, unsigned long start, unsigned long size)
701
{
702
	INIT_LIST_HEAD(&mm->hole_stack);
703
	mm->scanned_blocks = 0;
704

705 706 707 708 709 710 711 712 713 714 715 716
	/* Clever trick to avoid a special case in the free hole tracking. */
	INIT_LIST_HEAD(&mm->head_node.node_list);
	INIT_LIST_HEAD(&mm->head_node.hole_stack);
	mm->head_node.hole_follows = 1;
	mm->head_node.scanned_block = 0;
	mm->head_node.scanned_prev_free = 0;
	mm->head_node.scanned_next_free = 0;
	mm->head_node.mm = mm;
	mm->head_node.start = start + size;
	mm->head_node.size = start - mm->head_node.start;
	list_add_tail(&mm->head_node.hole_stack, &mm->hole_stack);

717
	mm->color_adjust = NULL;
718
}
719
EXPORT_SYMBOL(drm_mm_init);
720

721 722 723 724 725 726 727
/**
 * drm_mm_takedown - clean up a drm_mm allocator
 * @mm: drm_mm allocator to clean up
 *
 * Note that it is a bug to call this function on an allocator which is not
 * clean.
 */
D
Dave Airlie 已提交
728
void drm_mm_takedown(struct drm_mm * mm)
729
{
D
David Herrmann 已提交
730 731
	WARN(!list_empty(&mm->head_node.node_list),
	     "Memory manager not clean during takedown.\n");
732
}
D
Dave Airlie 已提交
733
EXPORT_SYMBOL(drm_mm_takedown);
734

D
Daniel Vetter 已提交
735 736
static unsigned long drm_mm_debug_hole(struct drm_mm_node *entry,
				       const char *prefix)
737
{
738 739
	unsigned long hole_start, hole_end, hole_size;

D
Daniel Vetter 已提交
740 741 742 743
	if (entry->hole_follows) {
		hole_start = drm_mm_hole_node_start(entry);
		hole_end = drm_mm_hole_node_end(entry);
		hole_size = hole_end - hole_start;
744 745 746
		printk(KERN_DEBUG "%s 0x%08lx-0x%08lx: %8lu: free\n",
			prefix, hole_start, hole_end,
			hole_size);
D
Daniel Vetter 已提交
747 748 749 750 751 752
		return hole_size;
	}

	return 0;
}

753 754 755 756 757
/**
 * drm_mm_debug_table - dump allocator state to dmesg
 * @mm: drm_mm allocator to dump
 * @prefix: prefix to use for dumping to dmesg
 */
D
Daniel Vetter 已提交
758 759 760 761 762 763
void drm_mm_debug_table(struct drm_mm *mm, const char *prefix)
{
	struct drm_mm_node *entry;
	unsigned long total_used = 0, total_free = 0, total = 0;

	total_free += drm_mm_debug_hole(&mm->head_node, prefix);
764 765 766

	drm_mm_for_each_node(entry, mm) {
		printk(KERN_DEBUG "%s 0x%08lx-0x%08lx: %8lu: used\n",
767
			prefix, entry->start, entry->start + entry->size,
768 769
			entry->size);
		total_used += entry->size;
D
Daniel Vetter 已提交
770
		total_free += drm_mm_debug_hole(entry, prefix);
771
	}
772 773 774
	total = total_free + total_used;

	printk(KERN_DEBUG "%s total: %lu, used %lu free %lu\n", prefix, total,
775 776 777 778
		total_used, total_free);
}
EXPORT_SYMBOL(drm_mm_debug_table);

779
#if defined(CONFIG_DEBUG_FS)
D
Daniel Vetter 已提交
780
static unsigned long drm_mm_dump_hole(struct seq_file *m, struct drm_mm_node *entry)
781
{
782 783
	unsigned long hole_start, hole_end, hole_size;

D
Daniel Vetter 已提交
784 785 786 787
	if (entry->hole_follows) {
		hole_start = drm_mm_hole_node_start(entry);
		hole_end = drm_mm_hole_node_end(entry);
		hole_size = hole_end - hole_start;
788 789
		seq_printf(m, "0x%08lx-0x%08lx: 0x%08lx: free\n",
				hole_start, hole_end, hole_size);
D
Daniel Vetter 已提交
790 791 792 793 794 795
		return hole_size;
	}

	return 0;
}

796 797 798 799 800
/**
 * drm_mm_dump_table - dump allocator state to a seq_file
 * @m: seq_file to dump to
 * @mm: drm_mm allocator to dump
 */
D
Daniel Vetter 已提交
801 802 803 804 805 806
int drm_mm_dump_table(struct seq_file *m, struct drm_mm *mm)
{
	struct drm_mm_node *entry;
	unsigned long total_used = 0, total_free = 0, total = 0;

	total_free += drm_mm_dump_hole(m, &mm->head_node);
807 808 809 810 811 812

	drm_mm_for_each_node(entry, mm) {
		seq_printf(m, "0x%08lx-0x%08lx: 0x%08lx: used\n",
				entry->start, entry->start + entry->size,
				entry->size);
		total_used += entry->size;
D
Daniel Vetter 已提交
813
		total_free += drm_mm_dump_hole(m, entry);
814
	}
815 816 817
	total = total_free + total_used;

	seq_printf(m, "total: %lu, used %lu free %lu\n", total, total_used, total_free);
818 819 820 821
	return 0;
}
EXPORT_SYMBOL(drm_mm_dump_table);
#endif