forked from ~ljy/RK356X_SDK_RELEASE
blame | history | patch | commit | commitdiff
hc
2024-01-04 1543e317f1da31b75942316931e8f491a8920811 
 kernel/drivers/gpu/drm/drm_mm.c
....@@ -42,12 +42,13 @@
4242  * Thomas Hellström <thomas-at-tungstengraphics-dot-com>
4343  */
4444 
45
-#include <drm/drmP.h>
46
-#include <drm/drm_mm.h>
47
-#include <linux/slab.h>
48
-#include <linux/seq_file.h>
4945 #include <linux/export.h>
5046 #include <linux/interval_tree_generic.h>
47
+#include <linux/seq_file.h>
48
+#include <linux/slab.h>
49
+#include <linux/stacktrace.h>
50
+
51
+#include <drm/drm_mm.h>
5152 
5253 /**
5354  * DOC: Overview
....@@ -106,25 +107,19 @@
106107 static noinline void save_stack(struct drm_mm_node *node)
107108 {
108109 	unsigned long entries[STACKDEPTH];
109
-	struct stack_trace trace = {
110
-		.entries = entries,
111
-		.max_entries = STACKDEPTH,
112
-		.skip = 1
113
-	};
110
+	unsigned int n;
114111 
115
-	save_stack_trace(&trace);
116
-	if (trace.nr_entries != 0 &&
117
-	    trace.entries[trace.nr_entries-1] == ULONG_MAX)
118
-		trace.nr_entries--;
112
+	n = stack_trace_save(entries, ARRAY_SIZE(entries), 1);
119113 
120114 	/* May be called under spinlock, so avoid sleeping */
121
-	node->stack = depot_save_stack(&trace, GFP_NOWAIT);
115
+	node->stack = stack_depot_save(entries, n, GFP_NOWAIT);
122116 }
123117 
124118 static void show_leaks(struct drm_mm *mm)
125119 {
126120 	struct drm_mm_node *node;
127
-	unsigned long entries[STACKDEPTH];
121
+	unsigned long *entries;
122
+	unsigned int nr_entries;
128123 	char *buf;
129124 
130125 	buf = kmalloc(BUFSZ, GFP_KERNEL);
....@@ -132,19 +127,14 @@
132127 		return;
133128 
134129 	list_for_each_entry(node, drm_mm_nodes(mm), node_list) {
135
-		struct stack_trace trace = {
136
-			.entries = entries,
137
-			.max_entries = STACKDEPTH
138
-		};
139
-
140130 		if (!node->stack) {
141131 			DRM_ERROR("node [%08llx + %08llx]: unknown owner\n",
142132 				  node->start, node->size);
143133 			continue;
144134 		}
145135 
146
-		depot_fetch_stack(node->stack, &trace);
147
-		snprint_stack_trace(buf, BUFSZ, &trace, 0);
136
+		nr_entries = stack_depot_fetch(node->stack, &entries);
137
+		stack_trace_snprint(buf, BUFSZ, entries, nr_entries, 0);
148138 		DRM_ERROR("node [%08llx + %08llx]: inserted at\n%s",
149139 			  node->start, node->size, buf);
150140 	}
....@@ -184,7 +174,7 @@
184174 
185175 	node->__subtree_last = LAST(node);
186176 
187
-	if (hole_node->allocated) {
177
+	if (drm_mm_node_allocated(hole_node)) {
188178 		rb = &hole_node->rb;
189179 		while (rb) {
190180 			parent = rb_entry(rb, struct drm_mm_node, rb);
....@@ -222,20 +212,6 @@
222212 				   &drm_mm_interval_tree_augment);
223213 }
224214 
225
-#define RB_INSERT(root, member, expr) do { \
226
-	struct rb_node **link = &root.rb_node, *rb = NULL; \
227
-	u64 x = expr(node); \
228
-	while (*link) { \
229
-		rb = *link; \
230
-		if (x < expr(rb_entry(rb, struct drm_mm_node, member))) \
231
-			link = &rb->rb_left; \
232
-		else \
233
-			link = &rb->rb_right; \
234
-	} \
235
-	rb_link_node(&node->member, rb, link); \
236
-	rb_insert_color(&node->member, &root); \
237
-} while (0)
238
-
239215 #define HOLE_SIZE(NODE) ((NODE)->hole_size)
240216 #define HOLE_ADDR(NODE) (__drm_mm_hole_node_start(NODE))
241217 
....@@ -265,16 +241,42 @@
265241 	rb_insert_color_cached(&node->rb_hole_size, root, first);
266242 }
267243 
244
+RB_DECLARE_CALLBACKS_MAX(static, augment_callbacks,
245
+			 struct drm_mm_node, rb_hole_addr,
246
+			 u64, subtree_max_hole, HOLE_SIZE)
247
+
248
+static void insert_hole_addr(struct rb_root *root, struct drm_mm_node *node)
249
+{
250
+	struct rb_node **link = &root->rb_node, *rb_parent = NULL;
251
+	u64 start = HOLE_ADDR(node), subtree_max_hole = node->subtree_max_hole;
252
+	struct drm_mm_node *parent;
253
+
254
+	while (*link) {
255
+		rb_parent = *link;
256
+		parent = rb_entry(rb_parent, struct drm_mm_node, rb_hole_addr);
257
+		if (parent->subtree_max_hole < subtree_max_hole)
258
+			parent->subtree_max_hole = subtree_max_hole;
259
+		if (start < HOLE_ADDR(parent))
260
+			link = &parent->rb_hole_addr.rb_left;
261
+		else
262
+			link = &parent->rb_hole_addr.rb_right;
263
+	}
264
+
265
+	rb_link_node(&node->rb_hole_addr, rb_parent, link);
266
+	rb_insert_augmented(&node->rb_hole_addr, root, &augment_callbacks);
267
+}
268
+
268269 static void add_hole(struct drm_mm_node *node)
269270 {
270271 	struct drm_mm *mm = node->mm;
271272 
272273 	node->hole_size =
273274 		__drm_mm_hole_node_end(node) - __drm_mm_hole_node_start(node);
275
+	node->subtree_max_hole = node->hole_size;
274276 	DRM_MM_BUG_ON(!drm_mm_hole_follows(node));
275277 
276278 	insert_hole_size(&mm->holes_size, node);
277
-	RB_INSERT(mm->holes_addr, rb_hole_addr, HOLE_ADDR);
279
+	insert_hole_addr(&mm->holes_addr, node);
278280 
279281 	list_add(&node->hole_stack, &mm->hole_stack);
280282 }
....@@ -285,8 +287,10 @@
285287 
286288 	list_del(&node->hole_stack);
287289 	rb_erase_cached(&node->rb_hole_size, &node->mm->holes_size);
288
-	rb_erase(&node->rb_hole_addr, &node->mm->holes_addr);
290
+	rb_erase_augmented(&node->rb_hole_addr, &node->mm->holes_addr,
291
+			   &augment_callbacks);
289292 	node->hole_size = 0;
293
+	node->subtree_max_hole = 0;
290294 
291295 	DRM_MM_BUG_ON(drm_mm_hole_follows(node));
292296 }
....@@ -299,11 +303,6 @@
299303 static inline struct drm_mm_node *rb_hole_addr_to_node(struct rb_node *rb)
300304 {
301305 	return rb_entry_safe(rb, struct drm_mm_node, rb_hole_addr);
302
-}
303
-
304
-static inline u64 rb_hole_size(struct rb_node *rb)
305
-{
306
-	return rb_entry(rb, struct drm_mm_node, rb_hole_size)->hole_size;
307306 }
308307 
309308 static struct drm_mm_node *best_hole(struct drm_mm *mm, u64 size)
....@@ -326,13 +325,21 @@
326325 	return best;
327326 }
328327 
329
-static struct drm_mm_node *find_hole(struct drm_mm *mm, u64 addr)
328
+static bool usable_hole_addr(struct rb_node *rb, u64 size)
329
+{
330
+	return rb && rb_hole_addr_to_node(rb)->subtree_max_hole >= size;
331
+}
332
+
333
+static struct drm_mm_node *find_hole_addr(struct drm_mm *mm, u64 addr, u64 size)
330334 {
331335 	struct rb_node *rb = mm->holes_addr.rb_node;
332336 	struct drm_mm_node *node = NULL;
333337 
334338 	while (rb) {
335339 		u64 hole_start;
340
+
341
+		if (!usable_hole_addr(rb, size))
342
+			break;
336343 
337344 		node = rb_hole_addr_to_node(rb);
338345 		hole_start = __drm_mm_hole_node_start(node);
....@@ -359,10 +366,10 @@
359366 		return best_hole(mm, size);
360367 
361368 	case DRM_MM_INSERT_LOW:
362
-		return find_hole(mm, start);
369
+		return find_hole_addr(mm, start, size);
363370 
364371 	case DRM_MM_INSERT_HIGH:
365
-		return find_hole(mm, end);
372
+		return find_hole_addr(mm, end, size);
366373 
367374 	case DRM_MM_INSERT_EVICT:
368375 		return list_first_entry_or_null(&mm->hole_stack,
....@@ -371,9 +378,45 @@
371378 	}
372379 }
373380 
381
+/**
382
+ * DECLARE_NEXT_HOLE_ADDR - macro to declare next hole functions
383
+ * @name: name of function to declare
384
+ * @first: first rb member to traverse (either rb_left or rb_right).
385
+ * @last: last rb member to traverse (either rb_right or rb_left).
386
+ *
387
+ * This macro declares a function to return the next hole of the addr rb tree.
388
+ * While traversing the tree we take the searched size into account and only
389
+ * visit branches with potential big enough holes.
390
+ */
391
+
392
+#define DECLARE_NEXT_HOLE_ADDR(name, first, last)			\
393
+static struct drm_mm_node *name(struct drm_mm_node *entry, u64 size)	\
394
+{									\
395
+	struct rb_node *parent, *node = &entry->rb_hole_addr;		\
396
+									\
397
+	if (!entry || RB_EMPTY_NODE(node))				\
398
+		return NULL;						\
399
+									\
400
+	if (usable_hole_addr(node->first, size)) {			\
401
+		node = node->first;					\
402
+		while (usable_hole_addr(node->last, size))		\
403
+			node = node->last;				\
404
+		return rb_hole_addr_to_node(node);			\
405
+	}								\
406
+									\
407
+	while ((parent = rb_parent(node)) && node == parent->first)	\
408
+		node = parent;						\
409
+									\
410
+	return rb_hole_addr_to_node(parent);				\
411
+}
412
+
413
+DECLARE_NEXT_HOLE_ADDR(next_hole_high_addr, rb_left, rb_right)
414
+DECLARE_NEXT_HOLE_ADDR(next_hole_low_addr, rb_right, rb_left)
415
+
374416 static struct drm_mm_node *
375417 next_hole(struct drm_mm *mm,
376418 	  struct drm_mm_node *node,
419
+	  u64 size,
377420 	  enum drm_mm_insert_mode mode)
378421 {
379422 	switch (mode) {
....@@ -382,10 +425,10 @@
382425 		return rb_hole_size_to_node(rb_prev(&node->rb_hole_size));
383426 
384427 	case DRM_MM_INSERT_LOW:
385
-		return rb_hole_addr_to_node(rb_next(&node->rb_hole_addr));
428
+		return next_hole_low_addr(node, size);
386429 
387430 	case DRM_MM_INSERT_HIGH:
388
-		return rb_hole_addr_to_node(rb_prev(&node->rb_hole_addr));
431
+		return next_hole_high_addr(node, size);
389432 
390433 	case DRM_MM_INSERT_EVICT:
391434 		node = list_next_entry(node, hole_stack);
....@@ -409,17 +452,17 @@
409452  */
410453 int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node)
411454 {
412
-	u64 end = node->start + node->size;
413455 	struct drm_mm_node *hole;
414456 	u64 hole_start, hole_end;
415457 	u64 adj_start, adj_end;
458
+	u64 end;
416459 
417460 	end = node->start + node->size;
418461 	if (unlikely(end <= node->start))
419462 		return -ENOSPC;
420463 
421464 	/* Find the relevant hole to add our node to */
422
-	hole = find_hole(mm, node->start);
465
+	hole = find_hole_addr(mm, node->start, 0);
423466 	if (!hole)
424467 		return -ENOSPC;
425468 
....@@ -434,9 +477,9 @@
434477 
435478 	node->mm = mm;
436479 
480
+	__set_bit(DRM_MM_NODE_ALLOCATED_BIT, &node->flags);
437481 	list_add(&node->node_list, &hole->node_list);
438482 	drm_mm_interval_tree_add_node(hole, node);
439
-	node->allocated = true;
440483 	node->hole_size = 0;
441484 
442485 	rm_hole(hole);
....@@ -482,7 +525,7 @@
482525 	u64 remainder_mask;
483526 	bool once;
484527 
485
-	DRM_MM_BUG_ON(range_start >= range_end);
528
+	DRM_MM_BUG_ON(range_start > range_end);
486529 
487530 	if (unlikely(size == 0 || range_end - range_start < size))
488531 		return -ENOSPC;
....@@ -499,7 +542,7 @@
499542 	remainder_mask = is_power_of_2(alignment) ? alignment - 1 : 0;
500543 	for (hole = first_hole(mm, range_start, range_end, size, mode);
501544 	     hole;
502
-	     hole = once ? NULL : next_hole(mm, hole, mode)) {
545
+	     hole = once ? NULL : next_hole(mm, hole, size, mode)) {
503546 		u64 hole_start = __drm_mm_hole_node_start(hole);
504547 		u64 hole_end = hole_start + hole->hole_size;
505548 		u64 adj_start, adj_end;
....@@ -553,9 +596,9 @@
553596 		node->color = color;
554597 		node->hole_size = 0;
555598 
599
+		__set_bit(DRM_MM_NODE_ALLOCATED_BIT, &node->flags);
556600 		list_add(&node->node_list, &hole->node_list);
557601 		drm_mm_interval_tree_add_node(hole, node);
558
-		node->allocated = true;
559602 
560603 		rm_hole(hole);
561604 		if (adj_start > hole_start)
....@@ -571,6 +614,11 @@
571614 }
572615 EXPORT_SYMBOL(drm_mm_insert_node_in_range);
573616 
617
+static inline bool drm_mm_node_scanned_block(const struct drm_mm_node *node)
618
+{
619
+	return test_bit(DRM_MM_NODE_SCANNED_BIT, &node->flags);
620
+}
621
+
574622 /**
575623  * drm_mm_remove_node - Remove a memory node from the allocator.
576624  * @node: drm_mm_node to remove
....@@ -584,8 +632,8 @@
584632 	struct drm_mm *mm = node->mm;
585633 	struct drm_mm_node *prev_node;
586634 
587
-	DRM_MM_BUG_ON(!node->allocated);
588
-	DRM_MM_BUG_ON(node->scanned_block);
635
+	DRM_MM_BUG_ON(!drm_mm_node_allocated(node));
636
+	DRM_MM_BUG_ON(drm_mm_node_scanned_block(node));
589637 
590638 	prev_node = list_prev_entry(node, node_list);
591639 
....@@ -594,11 +642,12 @@
594642 
595643 	drm_mm_interval_tree_remove(node, &mm->interval_tree);
596644 	list_del(&node->node_list);
597
-	node->allocated = false;
598645 
599646 	if (drm_mm_hole_follows(prev_node))
600647 		rm_hole(prev_node);
601648 	add_hole(prev_node);
649
+
650
+	clear_bit_unlock(DRM_MM_NODE_ALLOCATED_BIT, &node->flags);
602651 }
603652 EXPORT_SYMBOL(drm_mm_remove_node);
604653 
....@@ -615,10 +664,11 @@
615664 {
616665 	struct drm_mm *mm = old->mm;
617666 
618
-	DRM_MM_BUG_ON(!old->allocated);
667
+	DRM_MM_BUG_ON(!drm_mm_node_allocated(old));
619668 
620669 	*new = *old;
621670 
671
+	__set_bit(DRM_MM_NODE_ALLOCATED_BIT, &new->flags);
622672 	list_replace(&old->node_list, &new->node_list);
623673 	rb_replace_node_cached(&old->rb, &new->rb, &mm->interval_tree);
624674 
....@@ -632,8 +682,7 @@
632682 				&mm->holes_addr);
633683 	}
634684 
635
-	old->allocated = false;
636
-	new->allocated = true;
685
+	clear_bit_unlock(DRM_MM_NODE_ALLOCATED_BIT, &old->flags);
637686 }
638687 EXPORT_SYMBOL(drm_mm_replace_node);
639688 
....@@ -741,9 +790,9 @@
741790 	u64 adj_start, adj_end;
742791 
743792 	DRM_MM_BUG_ON(node->mm != mm);
744
-	DRM_MM_BUG_ON(!node->allocated);
745
-	DRM_MM_BUG_ON(node->scanned_block);
746
-	node->scanned_block = true;
793
+	DRM_MM_BUG_ON(!drm_mm_node_allocated(node));
794
+	DRM_MM_BUG_ON(drm_mm_node_scanned_block(node));
795
+	__set_bit(DRM_MM_NODE_SCANNED_BIT, &node->flags);
747796 	mm->scan_active++;
748797 
749798 	/* Remove this block from the node_list so that we enlarge the hole
....@@ -816,7 +865,7 @@
816865  * When the scan list is empty, the selected memory nodes can be freed. An
817866  * immediately following drm_mm_insert_node_in_range_generic() or one of the
818867  * simpler versions of that function with !DRM_MM_SEARCH_BEST will then return
819
- * the just freed block (because its at the top of the free_stack list).
868
+ * the just freed block (because it's at the top of the free_stack list).
820869  *
821870  * Returns:
822871  * True if this block should be evicted, false otherwise. Will always
....@@ -828,8 +877,8 @@
828877 	struct drm_mm_node *prev_node;
829878 
830879 	DRM_MM_BUG_ON(node->mm != scan->mm);
831
-	DRM_MM_BUG_ON(!node->scanned_block);
832
-	node->scanned_block = false;
880
+	DRM_MM_BUG_ON(!drm_mm_node_scanned_block(node));
881
+	__clear_bit(DRM_MM_NODE_SCANNED_BIT, &node->flags);
833882 
834883 	DRM_MM_BUG_ON(!node->mm->scan_active);
835884 	node->mm->scan_active--;
....@@ -927,7 +976,7 @@
927976 
928977 	/* Clever trick to avoid a special case in the free hole tracking. */
929978 	INIT_LIST_HEAD(&mm->head_node.node_list);
930
-	mm->head_node.allocated = false;
979
+	mm->head_node.flags = 0;
931980 	mm->head_node.mm = mm;
932981 	mm->head_node.start = start + size;
933982 	mm->head_node.size = -size;