WebSVN – Kolibri OS – Diff – /drivers/include/drm/drm_mm.h

 #endif
 enum drm_mm_search_flags {
 	DRM_MM_SEARCH_DEFAULT =		0,
+	DRM_MM_SEARCH_BEST =		1 << 0,
-	DRM_MM_SEARCH_BEST =		1 << 0,
+	DRM_MM_SEARCH_BELOW =		1 << 1,
+};
+enum drm_mm_allocator_flags {
+	DRM_MM_CREATE_DEFAULT =		0,
+	DRM_MM_CREATE_TOP =		1 << 0,
+};
+#define DRM_MM_BOTTOMUP DRM_MM_SEARCH_DEFAULT, DRM_MM_CREATE_DEFAULT
-};
+#define DRM_MM_TOPDOWN DRM_MM_SEARCH_BELOW, DRM_MM_CREATE_TOP
 struct drm_mm_node {
 	struct list_head node_list;
 	struct list_head hole_stack;
 	void (*color_adjust)(struct drm_mm_node *node, unsigned long color,
 			     unsigned long *start, unsigned long *end);
+};
+/**
+ * drm_mm_node_allocated - checks whether a node is allocated
+ * @node: drm_mm_node to check
+ *
+ * Drivers should use this helpers for proper encapusulation of drm_mm
+ * internals.
+ *
+ * Returns:
-};
+ * True if the @node is allocated.
  */
 static inline bool drm_mm_node_allocated(struct drm_mm_node *node)
+{
+	return node->allocated;
+}
+/**
+ * drm_mm_initialized - checks whether an allocator is initialized
+ * @mm: drm_mm to check
+ *
+ * Drivers should use this helpers for proper encapusulation of drm_mm
+ * internals.
+ *
-	return node->allocated;
+ * Returns:
  * True if the @mm is initialized.
  */
 static inline bool drm_mm_initialized(struct drm_mm *mm)
+{
 	return mm->hole_stack.next;
+}
+static inline unsigned long __drm_mm_hole_node_start(struct drm_mm_node *hole_node)
+{
+	return hole_node->start + hole_node->size;
+}
+/**
+ * drm_mm_hole_node_start - computes the start of the hole following @node
+ * @hole_node: drm_mm_node which implicitly tracks the following hole
+ *
+ * This is useful for driver-sepific debug dumpers. Otherwise drivers should not
+ * inspect holes themselves. Drivers must check first whether a hole indeed
-static inline unsigned long __drm_mm_hole_node_start(struct drm_mm_node *hole_node)
+ * follows by looking at node->hole_follows.
+ *
-	return hole_node->start + hole_node->size;
+ * Returns:
  * Start of the subsequent hole.
  */
+{
 	return list_entry(hole_node->node_list.next,
 			  struct drm_mm_node, node_list)->start;
+}
+/**
+ * drm_mm_hole_node_end - computes the end of the hole following @node
+ * @hole_node: drm_mm_node which implicitly tracks the following hole
+ *
+ * This is useful for driver-sepific debug dumpers. Otherwise drivers should not
+ * inspect holes themselves. Drivers must check first whether a hole indeed
+ * follows by looking at node->hole_follows.
+ *
+ * Returns:
+ * End of the subsequent hole.
  */
 static inline unsigned long drm_mm_hole_node_end(struct drm_mm_node *hole_node)
+{
 	return __drm_mm_hole_node_end(hole_node);
+}
+/**
+ * drm_mm_for_each_node - iterator to walk over all allocated nodes
+ * @entry: drm_mm_node structure to assign to in each iteration step
+ * @mm: drm_mm allocator to walk
+ *
+ * This iterator walks over all nodes in the range allocator. It is implemented
  * with list_for_each, so not save against removal of elements.
  */
 #define drm_mm_for_each_node(entry, mm) list_for_each_entry(entry, \
+						&(mm)->head_node.node_list, \
+						node_list)
+/**
+ * drm_mm_for_each_hole - iterator to walk over all holes
+ * @entry: drm_mm_node used internally to track progress
+ * @mm: drm_mm allocator to walk
+ * @hole_start: ulong variable to assign the hole start to on each iteration
+ * @hole_end: ulong variable to assign the hole end to on each iteration
+ *
+ * This iterator walks over all holes in the range allocator. It is implemented
+ * with list_for_each, so not save against removal of elements. @entry is used
+ * internally and will not reflect a real drm_mm_node for the very first hole.
-						&(mm)->head_node.node_list, \
+ * Hence users of this iterator may not access it.
-						node_list)
+ *
+ * Implementation Note:
+ * We need to inline list_for_each_entry in order to be able to set hole_start
+ * and hole_end on each iteration while keeping the macro sane.
 /* Note that we need to unroll list_for_each_entry in order to inline
- * setting hole_start and hole_end on each iteration and keep the
+ * The __drm_mm_for_each_hole version is similar, but with added support for
- * macro sane.
+ * going backwards.
  */
 #define drm_mm_for_each_hole(entry, mm, hole_start, hole_end) \
 	for (entry = list_entry((mm)->hole_stack.next, struct drm_mm_node, hole_stack); \
 	     &entry->hole_stack != &(mm)->hole_stack ? \
 	     hole_start = drm_mm_hole_node_start(entry), \
+	     hole_end = drm_mm_hole_node_end(entry), \
+: 0; \
+	     entry = list_entry(entry->hole_stack.next, struct drm_mm_node, hole_stack))
+#define __drm_mm_for_each_hole(entry, mm, hole_start, hole_end, backwards) \
+	for (entry = list_entry((backwards) ? (mm)->hole_stack.prev : (mm)->hole_stack.next, struct drm_mm_node, hole_stack); \
+	     &entry->hole_stack != &(mm)->hole_stack ? \
+	     hole_start = drm_mm_hole_node_start(entry), \
 	     hole_end = drm_mm_hole_node_end(entry), \
 : 0; \
-	     entry = list_entry(entry->hole_stack.next, struct drm_mm_node, hole_stack))
+	     entry = list_entry((backwards) ? entry->hole_stack.prev : entry->hole_stack.next, struct drm_mm_node, hole_stack))
 /*
  * Basic range manager support (drm_mm.c)
  */
-extern int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node);
+int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node);
-extern int drm_mm_insert_node_generic(struct drm_mm *mm,
+int drm_mm_insert_node_generic(struct drm_mm *mm,
+				      struct drm_mm_node *node,
+						    unsigned long size,
+						    unsigned alignment,
+						    unsigned long color,
+			       enum drm_mm_search_flags sflags,
+			       enum drm_mm_allocator_flags aflags);
+/**
+ * drm_mm_insert_node - search for space and insert @node
+ * @mm: drm_mm to allocate from
+ * @node: preallocate node to insert
+ * @size: size of the allocation
+ * @alignment: alignment of the allocation
+ * @flags: flags to fine-tune the allocation
+ *
+ * This is a simplified version of drm_mm_insert_node_generic() with @color set
+ * to 0.
+ *
-				      struct drm_mm_node *node,
+ * The preallocated node must be cleared to 0.
 						    unsigned long size,
-						    unsigned alignment,
+ * Returns:
-						    unsigned long color,
+ * 0 on success, -ENOSPC if there's no suitable hole.
-				      enum drm_mm_search_flags flags);
+ */
 static inline int drm_mm_insert_node(struct drm_mm *mm,
 						struct drm_mm_node *node,
+						unsigned long size,
-						unsigned long size,
+						unsigned alignment,
-						unsigned alignment,
+				     enum drm_mm_search_flags flags)
 				     enum drm_mm_search_flags flags)
 	return drm_mm_insert_node_generic(mm, node, size, alignment, 0, flags,
-	return drm_mm_insert_node_generic(mm, node, size, alignment, 0, flags);
+					  DRM_MM_CREATE_DEFAULT);
+}
-extern int drm_mm_insert_node_in_range_generic(struct drm_mm *mm,
+int drm_mm_insert_node_in_range_generic(struct drm_mm *mm,
 				       struct drm_mm_node *node,
+				       unsigned long size,
+				       unsigned alignment,
+				       unsigned long color,
+				       unsigned long start,
+						unsigned long end,
+					enum drm_mm_search_flags sflags,
+					enum drm_mm_allocator_flags aflags);
+/**
+ * drm_mm_insert_node_in_range - ranged search for space and insert @node
+ * @mm: drm_mm to allocate from
+ * @node: preallocate node to insert
+ * @size: size of the allocation
+ * @alignment: alignment of the allocation
+ * @start: start of the allowed range for this node
+ * @end: end of the allowed range for this node
+ * @flags: flags to fine-tune the allocation
+ *
+ * This is a simplified version of drm_mm_insert_node_in_range_generic() with
+ * @color set to 0.
 				       unsigned long size,
-				       unsigned alignment,
+ * The preallocated node must be cleared to 0.
 				       unsigned long color,
-				       unsigned long start,
+ * Returns:
-						unsigned long end,
+ * 0 on success, -ENOSPC if there's no suitable hole.
-				       enum drm_mm_search_flags flags);
+ */
 static inline int drm_mm_insert_node_in_range(struct drm_mm *mm,
 					      struct drm_mm_node *node,
 						unsigned long size,
 						unsigned alignment,
+						unsigned long start,
-						unsigned long start,
+						unsigned long end,
-						unsigned long end,
+					      enum drm_mm_search_flags flags)
-					      enum drm_mm_search_flags flags)
+{
-{
+	return drm_mm_insert_node_in_range_generic(mm, node, size, alignment,
-	return drm_mm_insert_node_in_range_generic(mm, node, size, alignment,
+, start, end, flags,
-, start, end, flags);
+						   DRM_MM_CREATE_DEFAULT);
 }
-extern void drm_mm_remove_node(struct drm_mm_node *node);
+void drm_mm_remove_node(struct drm_mm_node *node);
-extern void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new);
+void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new);
-extern void drm_mm_init(struct drm_mm *mm,
+void drm_mm_init(struct drm_mm *mm,
 		       unsigned long start,
 				 unsigned long size,
 				 unsigned alignment,
 				 unsigned long color,
 				 unsigned long start,
 				 unsigned long end);
-int drm_mm_scan_add_block(struct drm_mm_node *node);
+bool drm_mm_scan_add_block(struct drm_mm_node *node);
-int drm_mm_scan_remove_block(struct drm_mm_node *node);
+bool drm_mm_scan_remove_block(struct drm_mm_node *node);
-extern void drm_mm_debug_table(struct drm_mm *mm, const char *prefix);
+void drm_mm_debug_table(struct drm_mm *mm, const char *prefix);
 #ifdef CONFIG_DEBUG_FS
 int drm_mm_dump_table(struct seq_file *m, struct drm_mm *mm);
 #endif

Subversion Repositories Kolibri OS

(root)/drivers/include/drm/drm_mm.h – Rev 4110 → 5056