Lines Matching refs:node
76 * steep cliff not a real concern. Removing a node again is O(1).
107 struct drm_mm_node *node,
118 BUG_ON(node->allocated);
144 node->start = adj_start;
145 node->size = size;
146 node->mm = mm;
147 node->color = color;
148 node->allocated = 1;
150 INIT_LIST_HEAD(&node->hole_stack);
151 list_add(&node->node_list, &hole_node->node_list);
153 BUG_ON(node->start + node->size > adj_end);
155 node->hole_follows = 0;
156 if (__drm_mm_hole_node_start(node) < hole_end) {
157 list_add(&node->hole_stack, &mm->hole_stack);
158 node->hole_follows = 1;
163 * drm_mm_reserve_node - insert an pre-initialized node
164 * @mm: drm_mm allocator to insert @node into
165 * @node: drm_mm_node to insert
174 * 0 on success, -ENOSPC if there's no hole where @node is.
176 int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node)
179 unsigned long end = node->start + node->size;
183 BUG_ON(node == NULL);
185 /* Find the relevant hole to add our node to */
187 if (hole_start > node->start || hole_end < end)
190 node->mm = mm;
191 node->allocated = 1;
193 INIT_LIST_HEAD(&node->hole_stack);
194 list_add(&node->node_list, &hole->node_list);
196 if (node->start == hole_start) {
201 node->hole_follows = 0;
203 list_add(&node->hole_stack, &mm->hole_stack);
204 node->hole_follows = 1;
215 * drm_mm_insert_node_generic - search for space and insert @node
217 * @node: preallocate node to insert
220 * @color: opaque tag value to use for this node
224 * The preallocated node must be cleared to 0.
229 int drm_mm_insert_node_generic(struct drm_mm *mm, struct drm_mm_node *node,
242 drm_mm_insert_helper(hole_node, node, size, alignment, color, aflags);
248 struct drm_mm_node *node,
260 BUG_ON(!hole_node->hole_follows || node->allocated);
288 node->start = adj_start;
289 node->size = size;
290 node->mm = mm;
291 node->color = color;
292 node->allocated = 1;
294 INIT_LIST_HEAD(&node->hole_stack);
295 list_add(&node->node_list, &hole_node->node_list);
297 BUG_ON(node->start < start);
298 BUG_ON(node->start < adj_start);
299 BUG_ON(node->start + node->size > adj_end);
300 BUG_ON(node->start + node->size > end);
302 node->hole_follows = 0;
303 if (__drm_mm_hole_node_start(node) < hole_end) {
304 list_add(&node->hole_stack, &mm->hole_stack);
305 node->hole_follows = 1;
310 * drm_mm_insert_node_in_range_generic - ranged search for space and insert @node
312 * @node: preallocate node to insert
315 * @color: opaque tag value to use for this node
316 * @start: start of the allowed range for this node
317 * @end: end of the allowed range for this node
321 * The preallocated node must be cleared to 0.
326 int drm_mm_insert_node_in_range_generic(struct drm_mm *mm, struct drm_mm_node *node,
341 drm_mm_insert_helper_range(hole_node, node,
349 * drm_mm_remove_node - Remove a memory node from the allocator.
350 * @node: drm_mm_node to remove
352 * This just removes a node from its drm_mm allocator. The node does not need to
354 * allocator. It is a bug to call this function on a un-allocated node.
356 void drm_mm_remove_node(struct drm_mm_node *node)
358 struct drm_mm *mm = node->mm;
361 if (WARN_ON(!node->allocated))
364 BUG_ON(node->scanned_block || node->scanned_prev_free
365 || node->scanned_next_free);
368 list_entry(node->node_list.prev, struct drm_mm_node, node_list);
370 if (node->hole_follows) {
371 BUG_ON(__drm_mm_hole_node_start(node) ==
372 __drm_mm_hole_node_end(node));
373 list_del(&node->hole_stack);
375 BUG_ON(__drm_mm_hole_node_start(node) !=
376 __drm_mm_hole_node_end(node));
385 list_del(&node->node_list);
386 node->allocated = 0;
542 * removing an object is O(1), and since freeing a node is also O(1) the overall
557 * change the place a node is allocated from within a suitable hole.
590 * change the place a node is allocated from within a suitable hole.
617 * drm_mm_scan_add_block - add a node to the scan list
618 * @node: drm_mm_node to add
620 * Add a node to the scan list that might be freed to make space for the desired
626 bool drm_mm_scan_add_block(struct drm_mm_node *node)
628 struct drm_mm *mm = node->mm;
635 BUG_ON(node->scanned_block);
636 node->scanned_block = 1;
638 prev_node = list_entry(node->node_list.prev, struct drm_mm_node,
641 node->scanned_preceeds_hole = prev_node->hole_follows;
643 list_del(&node->node_list);
644 node->node_list.prev = &prev_node->node_list;
645 node->node_list.next = &mm->prev_scanned_node->node_list;
646 mm->prev_scanned_node = node;
674 * drm_mm_scan_remove_block - remove a node from the scan list
675 * @node: drm_mm_node to remove
689 bool drm_mm_scan_remove_block(struct drm_mm_node *node)
691 struct drm_mm *mm = node->mm;
696 BUG_ON(!node->scanned_block);
697 node->scanned_block = 0;
699 prev_node = list_entry(node->node_list.prev, struct drm_mm_node,
702 prev_node->hole_follows = node->scanned_preceeds_hole;
703 list_add(&node->node_list, &prev_node->node_list);
705 return (drm_mm_hole_node_end(node) > mm->scan_hit_start &&
706 node->start < mm->scan_hit_end);
715 * True if the allocator is completely free, false if there's still a node