4 * Copyright (c) 2006, 2013, Oracle and/or its affiliates. All rights reserved.
8 * Copyright (c) 2012, 2013 Intel Corporation. All rights reserved.
11 /**************************************************************************
13 * Copyright 2006-2008 Tungsten Graphics, Inc., Cedar Park, TX. USA.
14 * All Rights Reserved.
16 * Permission is hereby granted, free of charge, to any person obtaining a
17 * copy of this software and associated documentation files (the
18 * "Software"), to deal in the Software without restriction, including
19 * without limitation the rights to use, copy, modify, merge, publish,
20 * distribute, sub license, and/or sell copies of the Software, and to
21 * permit persons to whom the Software is furnished to do so, subject to
22 * the following conditions:
24 * The above copyright notice and this permission notice (including the
25 * next paragraph) shall be included in all copies or substantial portions
28 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
29 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
30 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
31 * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
32 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
33 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
34 * USE OR OTHER DEALINGS IN THE SOFTWARE.
37 **************************************************************************/
40 * Thomas Hellstrom <thomas-at-tungstengraphics-dot-com>
47 * Generic range manager structs
51 struct list_head node_list
;
52 struct list_head hole_stack
;
53 unsigned hole_follows
;
54 unsigned scanned_block
;
55 unsigned scanned_prev_free
;
56 unsigned scanned_next_free
;
57 unsigned scanned_preceeds_hole
;
66 /* List of free memory blocks, most recently freed ordered. */
67 struct list_head hole_stack
;
68 /* head_node.node_list is the list of all memory nodes, ordered
69 * according to the (increasing) start address of the memory node. */
70 struct drm_mm_node head_node
;
71 struct list_head unused_nodes
;
73 spinlock_t unused_lock
;
74 unsigned int scan_check_range
: 1;
75 unsigned scan_alignment
;
76 unsigned long scan_color
;
77 unsigned long scan_size
;
78 unsigned long scan_hit_start
;
79 unsigned long scan_hit_end
;
80 unsigned scanned_blocks
;
81 unsigned long scan_start
;
82 unsigned long scan_end
;
83 struct drm_mm_node
*prev_scanned_node
;
85 void (*color_adjust
)(struct drm_mm_node
*node
, unsigned long color
,
86 unsigned long *start
, unsigned long *end
);
89 static inline bool drm_mm_node_allocated(struct drm_mm_node
*node
)
91 return node
->allocated
;
94 extern bool drm_mm_initialized(struct drm_mm
*mm
);
95 extern unsigned long __drm_mm_hole_node_start(struct drm_mm_node
*hole_node
);
96 extern unsigned long drm_mm_hole_node_start(struct drm_mm_node
*hole_node
);
97 extern unsigned long __drm_mm_hole_node_end(struct drm_mm_node
*hole_node
);
98 extern unsigned long drm_mm_hole_node_end(struct drm_mm_node
*hole_node
);
99 #define drm_mm_for_each_node(entry, type, mm) list_for_each_entry(entry, type, \
100 &(mm)->head_node.node_list, \
102 #define drm_mm_for_each_scanned_node_reverse(entry, n, mm) \
103 for (entry = (mm)->prev_scanned_node, \
104 next = entry ? list_entry(entry->node_list.next, \
105 struct drm_mm_node, node_list) : NULL; \
106 entry != NULL; entry = next, \
107 next = entry ? list_entry(entry->node_list.next, \
108 struct drm_mm_node, node_list) : NULL) \
110 /* Note that we need to unroll list_for_each_entry in order to inline
111 * setting hole_start and hole_end on each iteration and keep the
114 #define drm_mm_for_each_hole(entry, mm, hole_start, hole_end) \
115 for (entry = list_entry((mm)->hole_stack.next, struct drm_mm_node, hole_stack); \
116 (entry) && (&entry->hole_stack != &(mm)->hole_stack ? \
117 hole_start = drm_mm_hole_node_start(entry), \
118 hole_end = drm_mm_hole_node_end(entry), \
120 entry = list_entry(entry->hole_stack.next, struct drm_mm_node, hole_stack))
123 * Basic range manager support (drm_mm.c)
125 extern struct drm_mm_node
*drm_mm_create_block(struct drm_mm
*mm
,
129 extern struct drm_mm_node
*drm_mm_get_block_generic(struct drm_mm_node
*node
,
134 extern struct drm_mm_node
*drm_mm_get_block_range_generic(
135 struct drm_mm_node
*node
,
142 extern struct drm_mm_node
*drm_mm_get_block(struct drm_mm_node
*parent
,
146 extern struct drm_mm_node
*drm_mm_get_block_atomic(struct drm_mm_node
*parent
,
150 extern struct drm_mm_node
*drm_mm_get_block_range(
151 struct drm_mm_node
*parent
,
157 extern struct drm_mm_node
*drm_mm_get_block_atomic_range(
158 struct drm_mm_node
*parent
,
164 extern int drm_mm_insert_node(struct drm_mm
*mm
,
165 struct drm_mm_node
*node
,
168 extern int drm_mm_insert_node_in_range(struct drm_mm
*mm
,
169 struct drm_mm_node
*node
,
174 extern int drm_mm_insert_node_generic(struct drm_mm
*mm
,
175 struct drm_mm_node
*node
,
178 unsigned long color
);
179 extern int drm_mm_insert_node_in_range_generic(struct drm_mm
*mm
,
180 struct drm_mm_node
*node
,
186 extern void drm_mm_put_block(struct drm_mm_node
*cur
);
187 extern void drm_mm_remove_node(struct drm_mm_node
*node
);
188 extern void drm_mm_replace_node(struct drm_mm_node
*old
, struct drm_mm_node
*new);
189 extern struct drm_mm_node
*drm_mm_search_free_generic(const struct drm_mm
*mm
,
194 extern struct drm_mm_node
*drm_mm_search_free_in_range_generic(
195 const struct drm_mm
*mm
,
202 extern struct drm_mm_node
*drm_mm_search_free(const struct drm_mm
*mm
,
206 extern struct drm_mm_node
*drm_mm_search_free_in_range(
207 const struct drm_mm
*mm
,
213 extern void drm_mm_init(struct drm_mm
*mm
,
216 extern void drm_mm_takedown(struct drm_mm
*mm
);
217 extern int drm_mm_clean(struct drm_mm
*mm
);
218 extern int drm_mm_pre_get(struct drm_mm
*mm
);
219 static inline struct drm_mm
*drm_get_mm(struct drm_mm_node
*block
)
224 void drm_mm_init_scan(struct drm_mm
*mm
,
227 unsigned long color
);
228 void drm_mm_init_scan_with_range(struct drm_mm
*mm
,
234 int drm_mm_scan_add_block(struct drm_mm_node
*node
);
235 int drm_mm_scan_remove_block(struct drm_mm_node
*node
);
237 extern void drm_mm_debug_table(struct drm_mm
*mm
, const char *prefix
);
238 #ifdef CONFIG_DEBUG_FS
239 int drm_mm_dump_table(struct seq_file
*m
, struct drm_mm
*mm
);
242 #endif /* _DRM_MM_H_ */