Changeset 7856d09 in mainline


Ignore:
Timestamp:
2013-11-12T09:16:04Z (11 years ago)
Author:
Jiri Svoboda <jiri@…>
Branches:
lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export
Children:
2764497, a0ff947
Parents:
34cb6c8
Message:

Reverse list iteration - list_foreach_rev() and link_used().

Files:
2 edited

Legend:

Unmodified
Added
Removed
  • kernel/generic/include/adt/list.h

    r34cb6c8 r7856d09  
    3737#define KERN_LIST_H_
    3838
     39#include <debug.h>
    3940#include <typedefs.h>
    4041#include <trace.h>
     
    7374            _link != &(list).head; _link = _link->next)
    7475
     76#define list_foreach_rev(list, member, itype, iterator) \
     77        for (itype *iterator = NULL; iterator == NULL; iterator = (itype *) 1) \
     78            for (link_t *_link = (list).head.prev; \
     79            iterator = list_get_instance(_link, itype, member), \
     80            _link != &(list).head; _link = _link->prev)
     81
    7582#define assert_link_not_used(link) \
    76         ASSERT(((link)->prev == NULL) && ((link)->next == NULL))
     83        ASSERT(!link_used(link))
    7784
    7885/** Initialize doubly-linked circular list link
     
    319326}
    320327
     328/** Determine if link is used.
     329 *
     330 * @param link Link
     331 * @return @c true if link is used, @c false if not.
     332 */
     333static inline bool link_used(link_t *link)
     334{
     335        if (link->prev == NULL && link->next == NULL)
     336                return false;
     337
     338        ASSERT(link->prev != NULL && link->next != NULL);
     339        return true;
     340}
     341
    321342extern int list_member(const link_t *, const list_t *);
    322343extern void list_concat(list_t *, list_t *);
  • uspace/lib/c/include/adt/list.h

    r34cb6c8 r7856d09  
    3838
    3939#include <assert.h>
     40#include <stdbool.h>
    4041#include <unistd.h>
    4142
     
    7273            iterator = list_get_instance(_link, itype, member), \
    7374            _link != &(list).head; _link = _link->next)
     75
     76#define list_foreach_rev(list, member, itype, iterator) \
     77        for (itype *iterator = NULL; iterator == NULL; iterator = (itype *) 1) \
     78            for (link_t *_link = (list).head.prev; \
     79            iterator = list_get_instance(_link, itype, member), \
     80            _link != &(list).head; _link = _link->prev)
    7481
    7582/** Unlike list_foreach(), allows removing items while traversing a list.
     
    105112
    106113#define assert_link_not_used(link) \
    107         assert(((link)->prev == NULL) && ((link)->next == NULL))
     114        assert(!link_used(link))
    108115
    109116/** Returns true if the link is definitely part of a list. False if not sure. */
     
    357364}
    358365
     366/** Determine if link is used.
     367 *
     368 * @param link Link
     369 * @return @c true if link is used, @c false if not.
     370 */
     371static inline bool link_used(link_t *link)
     372{
     373        if (link->prev == NULL && link->next == NULL)
     374                return false;
     375
     376        assert(link->prev != NULL && link->next != NULL);
     377        return true;
     378}
     379
    359380extern int list_member(const link_t *, const list_t *);
    360381extern void list_concat(list_t *, list_t *);
Note: See TracChangeset for help on using the changeset viewer.