Changeset 062d900 in mainline for uspace/lib/c/include/adt/list.h

Timestamp:

2012-10-09T11:49:43Z (13 years ago)

Author:

Jakub Jermar <jakub@…>

Branches:

lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export

Children:

4e00f87

Parents:

87e9392

git-author:

Adam Hraska <adam.hraska+hos@…> (2012-10-09 11:49:43)

git-committer:

Jakub Jermar <jakub@…> (2012-10-09 11:49:43)

Message:

Cherrypick userspace hash table changes from lp:~adam-hraska+lp/helenos/rcu/.

File:

• uspace/lib/c/include/adt/list.h (modified) (1 diff)

uspace/lib/c/include/adt/list.h

@@ -71 +71 @@
             iterator != &(list).head; iterator = iterator->next)
 
+/** Unlike list_foreach(), allows removing items while traversing a list.
+ * 
+ * @code
+ * list_t mylist;
+ * typedef struct item {
+ *     int value;
+ *     link_t item_link;
+ * } item_t;
+ * 
+ * //..
+ * 
+ * // Print each list element's value and remove the element from the list.
+ * list_foreach_safe(mylist, cur_link, next_link) {
+ *     item_t *cur_item = list_get_instance(cur_link, item_t, item_link);
+ *     printf("%d\n", cur_item->value);
+ *     list_remove(cur_link);
+ * }
+ * @endcode
+ * 
+ * @param list List to traverse.
+ * @param iterator Iterator to the current element of the list.
+ *             The item this iterator points may be safely removed
+ *             from the list.
+ * @param next_iter Iterator to the next element of the list.
+ */
+#define list_foreach_safe(list, iterator, next_iter) \
+        for (link_t *iterator = (list).head.next, \
+                *next_iter = iterator->next; \
+                iterator != &(list).head; \
+                iterator = next_iter, next_iter = iterator->next)
+
 #define assert_link_not_used(link) \
         assert(((link)->prev == NULL) && ((link)->next == NULL))
+
+/** Returns true if the link is definitely part of a list. False if not sure. */
+static inline int link_in_use(link_t *link)
+{
+        return link->prev != NULL && link->next != NULL;
+}
 
 /** Initialize doubly-linked circular list link