Changeset feeac0d in mainline for kernel/generic/include/adt/list.h

Timestamp:

2013-09-10T16:32:35Z (12 years ago)

Author:

Jiri Svoboda <jiri@…>

Branches:

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

Children:

4982d87

Parents:

e8d6ce2

Message:

Simplify use of list_foreach.

File:

• kernel/generic/include/adt/list.h (modified) (4 diffs)

kernel/generic/include/adt/list.h

@@ -67 +67 @@
         ((type *) (((void *)(link)) - list_link_to_void(&(((type *) NULL)->member))))
 
-#define list_foreach(list, iterator) \
-        for (link_t *iterator = (list).head.next; \
-            iterator != &(list).head; iterator = iterator->next)
+#define list_foreach(list, member, itype, iterator) \
+        for (itype *iterator = NULL; iterator == NULL; iterator =(itype *)1) \
+            for (link_t *_link = (list).head.next; \
+            iterator = list_get_instance(_link, itype, member), \
+            _link != &(list).head; _link = _link->next)
 
 #define assert_link_not_used(link) \
@@ -184 +186 @@
  * @return Head item of the list.
  * @return NULL if the list is empty.
- *
  */
 static inline link_t *list_first(const list_t *list)
@@ -197 +198 @@
  * @return Head item of the list.
  * @return NULL if the list is empty.
- *
  */
 static inline link_t *list_last(list_t *list)
 {
         return ((list->head.prev == &list->head) ? NULL : list->head.prev);
+}
+
+/** Get next item in list.
+ *
+ * @param link Current item link
+ * @param list List containing @a link
+ *
+ * @return Next item or NULL if @a link is the last item.
+ */
+static inline link_t *list_next(link_t *link, const list_t *list)
+{
+        return (link->next == &list->head) ? NULL : link->next;
+}
+
+/** Get previous item in list.
+ *
+ * @param link Current item link
+ * @param list List containing @a link
+ *
+ * @return Previous item or NULL if @a link is the first item.
+ */
+static inline link_t *list_prev(link_t *link, const list_t *list)
+{
+        return (link->prev == &list->head) ? NULL : link->prev;
 }
 
@@ -270 +294 @@
 {
         unsigned int cnt = 0;
-        
-        list_foreach(*list, link) {
+        link_t *link;
+        
+        link = list_first(list);
+        while (link != NULL) {
                 if (cnt == n)
                         return link;
                 
                 cnt++;
+                link = list_next(link, list);
         }