Lines Matching refs:node
73 * the desired node.
75 * Allocates the node from the bottom of the found hole.
83 * range) that fits the desired node.
85 * Allocates the node from the bottom of the found hole.
93 * search range) that fits the desired node.
95 * Allocates the node from the *top* of the found hole. The specified
96 * alignment for the node is applied to the base of the node
105 * that fits the desired node. This is appropriate for use immediately
109 * Allocates the node from the bottom of the found hole.
127 * insert the node at the top of the hole or report -ENOSPC if
138 * insert the node at the bottom of the hole or report -ENOSPC if
193 * node argument points at the node containing the hole from which the
198 void (*color_adjust)(const struct drm_mm_node *node,
206 * according to the (increasing) start address of the memory node. */
244 * drm_mm_node_allocated - checks whether a node is allocated
245 * @node: drm_mm_node to check
247 * Drivers are required to clear a node prior to using it with the
254 * True if the @node is allocated.
256 static inline bool drm_mm_node_allocated(const struct drm_mm_node *node)
258 return test_bit(DRM_MM_NODE_ALLOCATED_BIT, &node->flags);
280 * drm_mm_hole_follows - checks whether a hole follows this node
281 * @node: drm_mm_node to check
284 * If you wish to know whether a hole follows this particular node,
289 * True if a hole follows the @node.
291 static inline bool drm_mm_hole_follows(const struct drm_mm_node *node)
293 return node->hole_size;
302 * drm_mm_hole_node_start - computes the start of the hole following @node
324 * drm_mm_hole_node_end - computes the end of the hole following @node
349 * The node list, may be empty.
404 int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node);
406 struct drm_mm_node *node,
415 * drm_mm_insert_node_generic - search for space and insert @node
417 * @node: preallocate node to insert
420 * @color: opaque tag value to use for this node
426 * The preallocated node must be cleared to 0.
432 drm_mm_insert_node_generic(struct drm_mm *mm, struct drm_mm_node *node,
437 return drm_mm_insert_node_in_range(mm, node,
443 * drm_mm_insert_node - search for space and insert @node
445 * @node: preallocate node to insert
451 * The preallocated node must be cleared to 0.
457 struct drm_mm_node *node,
460 return drm_mm_insert_node_generic(mm, node, size, 0, 0, 0);
463 void drm_mm_remove_node(struct drm_mm_node *node);
473 * True if the allocator is completely free, false if there's still a node
489 * @start__: starting offset, the first node will overlap this
490 * @end__: ending offset, the last node will start before this (but may overlap)
495 * starting node, and so not safe against removal of elements. It assumes
544 struct drm_mm_node *node);
546 struct drm_mm_node *node);