Lines Matching refs:node
75 * the desired node.
77 * Allocates the node from the bottom of the found hole.
85 * range) that fits the desired node.
87 * Allocates the node from the bottom of the found hole.
95 * search range) that fits the desired node.
97 * Allocates the node from the *top* of the found hole. The specified
98 * alignment for the node is applied to the base of the node
107 * that fits the desired node. This is appropriate for use immediately
111 * Allocates the node from the bottom of the found hole.
129 * insert the node at the top of the hole or report -ENOSPC if
140 * insert the node at the bottom of the hole or report -ENOSPC if
195 * node argument points at the node containing the hole from which the
200 void (*color_adjust)(const struct drm_mm_node *node,
208 * according to the (increasing) start address of the memory node. */
246 * drm_mm_node_allocated - checks whether a node is allocated
247 * @node: drm_mm_node to check
249 * Drivers are required to clear a node prior to using it with the
256 * True if the @node is allocated.
258 static inline bool drm_mm_node_allocated(const struct drm_mm_node *node)
260 return test_bit(DRM_MM_NODE_ALLOCATED_BIT, &node->flags);
282 * drm_mm_hole_follows - checks whether a hole follows this node
283 * @node: drm_mm_node to check
286 * If you wish to know whether a hole follows this particular node,
291 * True if a hole follows the @node.
293 static inline bool drm_mm_hole_follows(const struct drm_mm_node *node)
295 return node->hole_size;
304 * drm_mm_hole_node_start - computes the start of the hole following @node
326 * drm_mm_hole_node_end - computes the end of the hole following @node
351 * The node list, may be empty.
406 int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node);
408 struct drm_mm_node *node,
417 * drm_mm_insert_node_generic - search for space and insert @node
419 * @node: preallocate node to insert
422 * @color: opaque tag value to use for this node
428 * The preallocated node must be cleared to 0.
434 drm_mm_insert_node_generic(struct drm_mm *mm, struct drm_mm_node *node,
439 return drm_mm_insert_node_in_range(mm, node,
445 * drm_mm_insert_node - search for space and insert @node
447 * @node: preallocate node to insert
453 * The preallocated node must be cleared to 0.
459 struct drm_mm_node *node,
462 return drm_mm_insert_node_generic(mm, node, size, 0, 0, 0);
465 void drm_mm_remove_node(struct drm_mm_node *node);
475 * True if the allocator is completely free, false if there's still a node
491 * @start__: starting offset, the first node will overlap this
492 * @end__: ending offset, the last node will start before this (but may overlap)
497 * starting node, and so not safe against removal of elements. It assumes
546 struct drm_mm_node *node);
548 struct drm_mm_node *node);