drm_mm.c 19.9 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
#define MM_UNUSED_TARGET 4

static struct drm_mm_node *drm_mm_kmalloc(struct drm_mm *mm, int atomic)
{
	struct drm_mm_node *child;

	if (atomic)
57
		child = kzalloc(sizeof(*child), GFP_ATOMIC);
58
	else
59
		child = kzalloc(sizeof(*child), GFP_KERNEL);
60 61 62 63 64 65 66 67

	if (unlikely(child == NULL)) {
		spin_lock(&mm->unused_lock);
		if (list_empty(&mm->unused_nodes))
			child = NULL;
		else {
			child =
			    list_entry(mm->unused_nodes.next,
68 69
				       struct drm_mm_node, node_list);
			list_del(&child->node_list);
70 71 72 73 74 75 76
			--mm->num_unused;
		}
		spin_unlock(&mm->unused_lock);
	}
	return child;
}

77 78 79 80 81
/* drm_mm_pre_get() - pre allocate drm_mm_node structure
 * drm_mm:	memory manager struct we are pre-allocating for
 *
 * Returns 0 on success or -ENOMEM if allocation fails.
 */
82 83 84 85 86 87 88
int drm_mm_pre_get(struct drm_mm *mm)
{
	struct drm_mm_node *node;

	spin_lock(&mm->unused_lock);
	while (mm->num_unused < MM_UNUSED_TARGET) {
		spin_unlock(&mm->unused_lock);
89
		node = kzalloc(sizeof(*node), GFP_KERNEL);
90 91 92 93 94 95 96 97
		spin_lock(&mm->unused_lock);

		if (unlikely(node == NULL)) {
			int ret = (mm->num_unused < 2) ? -ENOMEM : 0;
			spin_unlock(&mm->unused_lock);
			return ret;
		}
		++mm->num_unused;
98
		list_add_tail(&node->node_list, &mm->unused_nodes);
99 100 101 102 103
	}
	spin_unlock(&mm->unused_lock);
	return 0;
}
EXPORT_SYMBOL(drm_mm_pre_get);
104

105
static inline unsigned long drm_mm_hole_node_start(struct drm_mm_node *hole_node)
106
{
107
	return hole_node->start + hole_node->size;
108 109
}

110
static inline unsigned long drm_mm_hole_node_end(struct drm_mm_node *hole_node)
111
{
112 113 114
	struct drm_mm_node *next_node =
		list_entry(hole_node->node_list.next, struct drm_mm_node,
			   node_list);
115

116
	return next_node->start;
117 118
}

119 120
static void drm_mm_insert_helper(struct drm_mm_node *hole_node,
				 struct drm_mm_node *node,
121 122
				 unsigned long size, unsigned alignment,
				 unsigned long color)
123
{
124 125 126
	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);
127 128
	unsigned long adj_start = hole_start;
	unsigned long adj_end = hole_end;
129

130 131
	BUG_ON(!hole_node->hole_follows || node->allocated);

132 133
	if (mm->color_adjust)
		mm->color_adjust(hole_node, color, &adj_start, &adj_end);
134

135 136 137 138 139 140 141
	if (alignment) {
		unsigned tmp = adj_start % alignment;
		if (tmp)
			adj_start += alignment - tmp;
	}

	if (adj_start == hole_start) {
142
		hole_node->hole_follows = 0;
143 144
		list_del(&hole_node->hole_stack);
	}
145

146
	node->start = adj_start;
147 148
	node->size = size;
	node->mm = mm;
149
	node->color = color;
150
	node->allocated = 1;
151

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

155
	BUG_ON(node->start + node->size > adj_end);
156

157
	node->hole_follows = 0;
158 159 160
	if (node->start + node->size < hole_end) {
		list_add(&node->hole_stack, &mm->hole_stack);
		node->hole_follows = 1;
161
	}
162 163 164 165 166
}

struct drm_mm_node *drm_mm_get_block_generic(struct drm_mm_node *hole_node,
					     unsigned long size,
					     unsigned alignment,
167
					     unsigned long color,
168 169 170 171 172 173 174 175
					     int atomic)
{
	struct drm_mm_node *node;

	node = drm_mm_kmalloc(hole_node->mm, atomic);
	if (unlikely(node == NULL))
		return NULL;

176
	drm_mm_insert_helper(hole_node, node, size, alignment, color);
177

178
	return node;
179
}
180
EXPORT_SYMBOL(drm_mm_get_block_generic);
181

182 183 184 185 186 187 188 189 190 191
/**
 * Search for free space and insert a preallocated memory node. Returns
 * -ENOSPC if no suitable free area is available. The preallocated memory node
 * must be cleared.
 */
int drm_mm_insert_node(struct drm_mm *mm, struct drm_mm_node *node,
		       unsigned long size, unsigned alignment)
{
	struct drm_mm_node *hole_node;

192
	hole_node = drm_mm_search_free(mm, size, alignment, false);
193 194 195
	if (!hole_node)
		return -ENOSPC;

196
	drm_mm_insert_helper(hole_node, node, size, alignment, 0);
197 198 199 200 201

	return 0;
}
EXPORT_SYMBOL(drm_mm_insert_node);

202 203 204
static void drm_mm_insert_helper_range(struct drm_mm_node *hole_node,
				       struct drm_mm_node *node,
				       unsigned long size, unsigned alignment,
205
				       unsigned long color,
206
				       unsigned long start, unsigned long end)
207
{
208 209 210
	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);
211 212
	unsigned long adj_start = hole_start;
	unsigned long adj_end = hole_end;
213

214 215
	BUG_ON(!hole_node->hole_follows || node->allocated);

216 217
	if (mm->color_adjust)
		mm->color_adjust(hole_node, color, &adj_start, &adj_end);
218

219 220 221 222 223 224 225 226
	if (adj_start < start)
		adj_start = start;

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

228
	if (adj_start == hole_start) {
229
		hole_node->hole_follows = 0;
230
		list_del(&hole_node->hole_stack);
231 232
	}

233
	node->start = adj_start;
234 235
	node->size = size;
	node->mm = mm;
236
	node->color = color;
237
	node->allocated = 1;
238 239 240 241

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

242
	BUG_ON(node->start + node->size > adj_end);
243 244
	BUG_ON(node->start + node->size > end);

245
	node->hole_follows = 0;
246 247 248
	if (node->start + node->size < hole_end) {
		list_add(&node->hole_stack, &mm->hole_stack);
		node->hole_follows = 1;
249
	}
250 251 252 253 254
}

struct drm_mm_node *drm_mm_get_block_range_generic(struct drm_mm_node *hole_node,
						unsigned long size,
						unsigned alignment,
255
						unsigned long color,
256 257 258 259 260 261 262 263 264 265
						unsigned long start,
						unsigned long end,
						int atomic)
{
	struct drm_mm_node *node;

	node = drm_mm_kmalloc(hole_node->mm, atomic);
	if (unlikely(node == NULL))
		return NULL;

266
	drm_mm_insert_helper_range(hole_node, node, size, alignment, color,
267
				   start, end);
268 269 270 271 272

	return node;
}
EXPORT_SYMBOL(drm_mm_get_block_range_generic);

273 274 275 276
/**
 * Search for free space and insert a preallocated memory node. Returns
 * -ENOSPC if no suitable free area is available. This is for range
 * restricted allocations. The preallocated memory node must be cleared.
277
 */
278 279 280
int drm_mm_insert_node_in_range(struct drm_mm *mm, struct drm_mm_node *node,
				unsigned long size, unsigned alignment,
				unsigned long start, unsigned long end)
281
{
282 283 284
	struct drm_mm_node *hole_node;

	hole_node = drm_mm_search_free_in_range(mm, size, alignment,
285
						start, end, false);
286 287 288
	if (!hole_node)
		return -ENOSPC;

289
	drm_mm_insert_helper_range(hole_node, node, size, alignment, 0,
290
				   start, end);
291

292 293 294 295 296 297 298 299 300
	return 0;
}
EXPORT_SYMBOL(drm_mm_insert_node_in_range);

/**
 * Remove a memory node from the allocator.
 */
void drm_mm_remove_node(struct drm_mm_node *node)
{
301 302
	struct drm_mm *mm = node->mm;
	struct drm_mm_node *prev_node;
303

304 305
	BUG_ON(node->scanned_block || node->scanned_prev_free
				   || node->scanned_next_free);
306

307 308
	prev_node =
	    list_entry(node->node_list.prev, struct drm_mm_node, node_list);
309

310 311 312 313 314 315 316
	if (node->hole_follows) {
		BUG_ON(drm_mm_hole_node_start(node)
				== drm_mm_hole_node_end(node));
		list_del(&node->hole_stack);
	} else
		BUG_ON(drm_mm_hole_node_start(node)
				!= drm_mm_hole_node_end(node));
317

318 319 320 321 322 323 324
	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);
325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340
	node->allocated = 0;
}
EXPORT_SYMBOL(drm_mm_remove_node);

/*
 * Remove a memory node from the allocator and free the allocated struct
 * drm_mm_node. Only to be used on a struct drm_mm_node obtained by one of the
 * drm_mm_get_block functions.
 */
void drm_mm_put_block(struct drm_mm_node *node)
{

	struct drm_mm *mm = node->mm;

	drm_mm_remove_node(node);

341 342 343 344 345 346 347 348
	spin_lock(&mm->unused_lock);
	if (mm->num_unused < MM_UNUSED_TARGET) {
		list_add(&node->node_list, &mm->unused_nodes);
		++mm->num_unused;
	} else
		kfree(node);
	spin_unlock(&mm->unused_lock);
}
349
EXPORT_SYMBOL(drm_mm_put_block);
350

351 352
static int check_free_hole(unsigned long start, unsigned long end,
			   unsigned long size, unsigned alignment)
353
{
354
	if (end - start < size)
355 356 357
		return 0;

	if (alignment) {
358
		unsigned tmp = start % alignment;
359
		if (tmp)
360
			start += alignment - tmp;
361 362
	}

363
	return end >= start + size;
364 365
}

366 367 368 369 370
struct drm_mm_node *drm_mm_search_free_generic(const struct drm_mm *mm,
					       unsigned long size,
					       unsigned alignment,
					       unsigned long color,
					       bool best_match)
371
{
D
Dave Airlie 已提交
372 373
	struct drm_mm_node *entry;
	struct drm_mm_node *best;
374 375
	unsigned long best_size;

376 377
	BUG_ON(mm->scanned_blocks);

378 379 380
	best = NULL;
	best_size = ~0UL;

381
	list_for_each_entry(entry, &mm->hole_stack, hole_stack) {
382 383 384 385 386 387 388 389 390
		unsigned long adj_start = drm_mm_hole_node_start(entry);
		unsigned long adj_end = drm_mm_hole_node_end(entry);

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

391
		BUG_ON(!entry->hole_follows);
392
		if (!check_free_hole(adj_start, adj_end, size, alignment))
393 394
			continue;

395 396
		if (!best_match)
			return entry;
397

398 399 400
		if (entry->size < best_size) {
			best = entry;
			best_size = entry->size;
401 402 403 404 405
		}
	}

	return best;
}
406 407 408 409 410 411 412 413 414
EXPORT_SYMBOL(drm_mm_search_free_generic);

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,
							bool best_match)
415 416 417 418 419
{
	struct drm_mm_node *entry;
	struct drm_mm_node *best;
	unsigned long best_size;

420 421
	BUG_ON(mm->scanned_blocks);

422 423 424
	best = NULL;
	best_size = ~0UL;

425 426 427 428 429
	list_for_each_entry(entry, &mm->hole_stack, hole_stack) {
		unsigned long adj_start = drm_mm_hole_node_start(entry) < start ?
			start : drm_mm_hole_node_start(entry);
		unsigned long adj_end = drm_mm_hole_node_end(entry) > end ?
			end : drm_mm_hole_node_end(entry);
430

431
		BUG_ON(!entry->hole_follows);
432 433 434 435 436 437 438

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

439
		if (!check_free_hole(adj_start, adj_end, size, alignment))
440 441
			continue;

442 443
		if (!best_match)
			return entry;
444

445 446 447
		if (entry->size < best_size) {
			best = entry;
			best_size = entry->size;
448 449 450 451 452
		}
	}

	return best;
}
453
EXPORT_SYMBOL(drm_mm_search_free_in_range_generic);
454

455 456 457 458 459 460
/**
 * Moves an allocation. To be used with embedded struct drm_mm_node.
 */
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 已提交
461
	list_replace(&old->hole_stack, &new->hole_stack);
462 463 464 465
	new->hole_follows = old->hole_follows;
	new->mm = old->mm;
	new->start = old->start;
	new->size = old->size;
466
	new->color = old->color;
467 468 469 470 471 472

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

473 474 475 476 477 478 479 480 481
/**
 * Initializa lru scanning.
 *
 * This simply sets up the scanning routines with the parameters for the desired
 * hole.
 *
 * Warning: As long as the scan list is non-empty, no other operations than
 * adding/removing nodes to/from the scan list are allowed.
 */
482 483 484 485
void drm_mm_init_scan(struct drm_mm *mm,
		      unsigned long size,
		      unsigned alignment,
		      unsigned long color)
486
{
487
	mm->scan_color = color;
488 489 490 491 492
	mm->scan_alignment = alignment;
	mm->scan_size = size;
	mm->scanned_blocks = 0;
	mm->scan_hit_start = 0;
	mm->scan_hit_size = 0;
493
	mm->scan_check_range = 0;
494
	mm->prev_scanned_node = NULL;
495 496 497
}
EXPORT_SYMBOL(drm_mm_init_scan);

498 499 500 501 502 503 504 505 506
/**
 * Initializa lru scanning.
 *
 * This simply sets up the scanning routines with the parameters for the desired
 * hole. This version is for range-restricted scans.
 *
 * Warning: As long as the scan list is non-empty, no other operations than
 * adding/removing nodes to/from the scan list are allowed.
 */
507 508
void drm_mm_init_scan_with_range(struct drm_mm *mm,
				 unsigned long size,
509
				 unsigned alignment,
510
				 unsigned long color,
511 512 513
				 unsigned long start,
				 unsigned long end)
{
514
	mm->scan_color = color;
515 516 517 518 519 520 521 522
	mm->scan_alignment = alignment;
	mm->scan_size = size;
	mm->scanned_blocks = 0;
	mm->scan_hit_start = 0;
	mm->scan_hit_size = 0;
	mm->scan_start = start;
	mm->scan_end = end;
	mm->scan_check_range = 1;
523
	mm->prev_scanned_node = NULL;
524 525 526
}
EXPORT_SYMBOL(drm_mm_init_scan_with_range);

527 528 529 530 531 532 533 534 535
/**
 * Add a node to the scan list that might be freed to make space for the desired
 * hole.
 *
 * Returns non-zero, if a hole has been found, zero otherwise.
 */
int drm_mm_scan_add_block(struct drm_mm_node *node)
{
	struct drm_mm *mm = node->mm;
536 537
	struct drm_mm_node *prev_node;
	unsigned long hole_start, hole_end;
538 539
	unsigned long adj_start;
	unsigned long adj_end;
540 541 542

	mm->scanned_blocks++;

543
	BUG_ON(node->scanned_block);
544 545
	node->scanned_block = 1;

546 547
	prev_node = list_entry(node->node_list.prev, struct drm_mm_node,
			       node_list);
548

549 550 551 552
	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;
553 554
	node->node_list.next = &mm->prev_scanned_node->node_list;
	mm->prev_scanned_node = node;
555

556 557
	hole_start = drm_mm_hole_node_start(prev_node);
	hole_end = drm_mm_hole_node_end(prev_node);
558 559 560 561 562 563 564

	adj_start = hole_start;
	adj_end = hole_end;

	if (mm->color_adjust)
		mm->color_adjust(prev_node, mm->scan_color, &adj_start, &adj_end);

565
	if (mm->scan_check_range) {
566 567 568 569
		if (adj_start < mm->scan_start)
			adj_start = mm->scan_start;
		if (adj_end > mm->scan_end)
			adj_end = mm->scan_end;
570 571
	}

572
	if (check_free_hole(adj_start, adj_end,
573
			    mm->scan_size, mm->scan_alignment)) {
574 575
		mm->scan_hit_start = hole_start;
		mm->scan_hit_size = hole_end;
576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591

		return 1;
	}

	return 0;
}
EXPORT_SYMBOL(drm_mm_scan_add_block);

/**
 * Remove a node from the scan list.
 *
 * 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
L
Lucas De Marchi 已提交
592
 * immediately following drm_mm_search_free with best_match = 0 will then return
593 594 595 596 597 598 599 600
 * the just freed block (because its at the top of the free_stack list).
 *
 * Returns one if this block should be evicted, zero otherwise. Will always
 * return zero when no hole has been found.
 */
int drm_mm_scan_remove_block(struct drm_mm_node *node)
{
	struct drm_mm *mm = node->mm;
601
	struct drm_mm_node *prev_node;
602 603 604 605 606 607

	mm->scanned_blocks--;

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

608 609
	prev_node = list_entry(node->node_list.prev, struct drm_mm_node,
			       node_list);
610

611 612 613
	prev_node->hole_follows = node->scanned_preceeds_hole;
	INIT_LIST_HEAD(&node->node_list);
	list_add(&node->node_list, &prev_node->node_list);
614 615 616 617 618 619 620 621 622 623 624 625 626 627

	/* Only need to check for containement because start&size for the
	 * complete resulting free block (not just the desired part) is
	 * stored. */
	if (node->start >= mm->scan_hit_start &&
	    node->start + node->size
	    		<= mm->scan_hit_start + mm->scan_hit_size) {
		return 1;
	}

	return 0;
}
EXPORT_SYMBOL(drm_mm_scan_remove_block);

D
Dave Airlie 已提交
628
int drm_mm_clean(struct drm_mm * mm)
629
{
630
	struct list_head *head = &mm->head_node.node_list;
631

632 633
	return (head->next->next == head);
}
634
EXPORT_SYMBOL(drm_mm_clean);
635

D
Dave Airlie 已提交
636
int drm_mm_init(struct drm_mm * mm, unsigned long start, unsigned long size)
637
{
638
	INIT_LIST_HEAD(&mm->hole_stack);
639 640
	INIT_LIST_HEAD(&mm->unused_nodes);
	mm->num_unused = 0;
641
	mm->scanned_blocks = 0;
642
	spin_lock_init(&mm->unused_lock);
643

644 645 646 647 648 649 650 651 652 653 654 655
	/* 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);

656 657
	mm->color_adjust = NULL;

658
	return 0;
659
}
660
EXPORT_SYMBOL(drm_mm_init);
661

D
Dave Airlie 已提交
662
void drm_mm_takedown(struct drm_mm * mm)
663
{
664
	struct drm_mm_node *entry, *next;
665

666
	if (!list_empty(&mm->head_node.node_list)) {
667 668 669 670
		DRM_ERROR("Memory manager not clean. Delaying takedown\n");
		return;
	}

671
	spin_lock(&mm->unused_lock);
672 673
	list_for_each_entry_safe(entry, next, &mm->unused_nodes, node_list) {
		list_del(&entry->node_list);
674 675 676 677
		kfree(entry);
		--mm->num_unused;
	}
	spin_unlock(&mm->unused_lock);
678

679
	BUG_ON(mm->num_unused != 0);
680
}
D
Dave Airlie 已提交
681
EXPORT_SYMBOL(drm_mm_takedown);
682

683 684 685
void drm_mm_debug_table(struct drm_mm *mm, const char *prefix)
{
	struct drm_mm_node *entry;
686 687 688 689 690 691 692 693 694 695 696 697 698 699
	unsigned long total_used = 0, total_free = 0, total = 0;
	unsigned long hole_start, hole_end, hole_size;

	hole_start = drm_mm_hole_node_start(&mm->head_node);
	hole_end = drm_mm_hole_node_end(&mm->head_node);
	hole_size = hole_end - hole_start;
	if (hole_size)
		printk(KERN_DEBUG "%s 0x%08lx-0x%08lx: %8lu: free\n",
			prefix, hole_start, hole_end,
			hole_size);
	total_free += hole_size;

	drm_mm_for_each_node(entry, mm) {
		printk(KERN_DEBUG "%s 0x%08lx-0x%08lx: %8lu: used\n",
700
			prefix, entry->start, entry->start + entry->size,
701 702 703 704 705 706 707 708 709 710 711 712
			entry->size);
		total_used += entry->size;

		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;
			printk(KERN_DEBUG "%s 0x%08lx-0x%08lx: %8lu: free\n",
				prefix, hole_start, hole_end,
				hole_size);
			total_free += hole_size;
		}
713
	}
714 715 716
	total = total_free + total_used;

	printk(KERN_DEBUG "%s total: %lu, used %lu free %lu\n", prefix, total,
717 718 719 720
		total_used, total_free);
}
EXPORT_SYMBOL(drm_mm_debug_table);

721 722 723 724
#if defined(CONFIG_DEBUG_FS)
int drm_mm_dump_table(struct seq_file *m, struct drm_mm *mm)
{
	struct drm_mm_node *entry;
725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741
	unsigned long total_used = 0, total_free = 0, total = 0;
	unsigned long hole_start, hole_end, hole_size;

	hole_start = drm_mm_hole_node_start(&mm->head_node);
	hole_end = drm_mm_hole_node_end(&mm->head_node);
	hole_size = hole_end - hole_start;
	if (hole_size)
		seq_printf(m, "0x%08lx-0x%08lx: 0x%08lx: free\n",
				hole_start, hole_end, hole_size);
	total_free += hole_size;

	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;
		if (entry->hole_follows) {
D
Daniel Vetter 已提交
742 743
			hole_start = drm_mm_hole_node_start(entry);
			hole_end = drm_mm_hole_node_end(entry);
744 745 746 747 748
			hole_size = hole_end - hole_start;
			seq_printf(m, "0x%08lx-0x%08lx: 0x%08lx: free\n",
					hole_start, hole_end, hole_size);
			total_free += hole_size;
		}
749
	}
750 751 752
	total = total_free + total_used;

	seq_printf(m, "total: %lu, used %lu free %lu\n", total, total_used, total_free);
753 754 755 756
	return 0;
}
EXPORT_SYMBOL(drm_mm_dump_table);
#endif