WebSVN – Kolibri OS – Diff – /contrib/other/kpm/list.h

     return head->next == head;
+}
-#define container_of(ptr, type, member) ({                   \
+#define container_of(ptr, type, member) ({                      \
-     const typeof( ((type *)0)->member ) *__mptr = (ptr);    \
+        const typeof( ((type *)0)->member ) *__mptr = (ptr);    \
+        (type *)( (char *)__mptr - offsetof(type,member) );})
      (type *)( (char *)__mptr - __builtin_offsetof(type,member) );})
 /**
  * list_entry - get the struct for this entry
  * @ptr:    the &struct list_head pointer.
  * @type:   the type of the struct this is embedded in.
- * @member: the name of the list_struct within the struct.
+ * @member:	the name of the list_head within the struct.
  */
 #define list_entry(ptr, type, member) \
     container_of(ptr, type, member)
 /**
  * list_first_entry - get the first element from a list
  * @ptr:    the list head to take the element from.
  * @type:   the type of the struct this is embedded in.
- * @member: the name of the list_struct within the struct.
+ * @member:	the name of the list_head within the struct.
+ *
  * Note, that list is expected to be not empty.
+ */
+#define list_first_entry(ptr, type, member) \
+    list_entry((ptr)->next, type, member)
+/**
+ * list_last_entry - get the last element from a list
+ * @ptr:	the list head to take the element from.
+ * @type:	the type of the struct this is embedded in.
+ * @member:	the name of the list_head within the struct.
+ *
+ * Note, that list is expected to be not empty.
+ */
+#define list_last_entry(ptr, type, member) \
+	list_entry((ptr)->prev, type, member)
+/**
+ * list_first_entry_or_null - get the first element from a list
+ * @ptr:	the list head to take the element from.
+ * @type:	the type of the struct this is embedded in.
+ * @member:	the name of the list_head within the struct.
+ *
+ * Note that if the list is empty, it returns NULL.
+ */
+#define list_first_entry_or_null(ptr, type, member) \
+	(!list_empty(ptr) ? list_first_entry(ptr, type, member) : NULL)
+/**
+ * list_next_entry - get the next element in list
+ * @pos:	the type * to cursor
+ * @member:	the name of the list_head within the struct.
+ */
+#define list_next_entry(pos, member) \
+	list_entry((pos)->member.next, typeof(*(pos)), member)
+/**
+ * list_prev_entry - get the prev element in list
+ * @pos:	the type * to cursor
+ * @member:	the name of the list_head within the struct.
  */
-#define list_first_entry(ptr, type, member) \
+#define list_prev_entry(pos, member) \
-    list_entry((ptr)->next, type, member)
+	list_entry((pos)->member.prev, typeof(*(pos)), member)
 /**
  * list_for_each    -   iterate over a list
- * @pos:    the &struct list_head to use as a loop cursor.
- * @head:   the head for your list.
+ * @pos:    the &struct list_head to use as a loop cursor.
- */
+ * @head:   the head for your list.
-#define list_for_each(pos, head) \
+ */
-    for (pos = (head)->next; pos != (head); pos = pos->next)
+#define list_for_each(pos, head) \
     for (pos = (head)->next; pos != (head); pos = pos->next)
 /**
  * list_for_each_entry  -   iterate over list of given type
  * @pos:    the type * to use as a loop cursor.
  * @head:   the head for your list.
- * @member: the name of the list_struct within the struct.
+ * @member:	the name of the list_head within the struct.
  */
 #define list_for_each_entry(pos, head, member)              \
-    for (pos = list_entry((head)->next, typeof(*pos), member);  \
+	for (pos = list_first_entry(head, typeof(*pos), member);	\
          &pos->member != (head);    \
-         pos = list_entry(pos->member.next, typeof(*pos), member))
+	     pos = list_next_entry(pos, member))
 /**
  * list_for_each_entry_reverse - iterate backwards over list of given type.
  * @pos:    the type * to use as a loop cursor.
  * @head:   the head for your list.
- * @member: the name of the list_struct within the struct.
+ * @member:	the name of the list_head within the struct.
  */
 #define list_for_each_entry_reverse(pos, head, member)          \
-    for (pos = list_entry((head)->prev, typeof(*pos), member);  \
+	for (pos = list_last_entry(head, typeof(*pos), member);		\
+         &pos->member != (head);    \
+	     pos = list_prev_entry(pos, member))
+/**
+ * list_prepare_entry - prepare a pos entry for use in list_for_each_entry_continue()
+ * @pos:	the type * to use as a start point
+ * @head:	the head of the list
+ * @member:	the name of the list_head within the struct.
+ *
+ * Prepares a pos entry for use as a start point in list_for_each_entry_continue().
+ */
+#define list_prepare_entry(pos, head, member) \
+	((pos) ? : list_entry(head, typeof(*pos), member))
+/**
+ * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry
+ * @pos:    the type * to use as a loop cursor.
+ * @n:      another type * to use as temporary storage
+ * @head:   the head for your list.
+ * @member: the name of the list_head within the struct.
+ */
+#define list_for_each_entry_safe(pos, n, head, member)          \
+    for (pos = list_first_entry(head, typeof(*pos), member),    \
-         &pos->member != (head);    \
+        n = list_next_entry(pos, member);                       \

Subversion Repositories Kolibri OS

(root)/contrib/other/kpm/list.h – Rev 5725 → 5728