Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • uspace/lib/c/include/adt/list.h

    r639db552 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. */
    110 static inline int link_in_use(const link_t *link)
     117static inline int link_in_use(link_t *link)
    111118{
    112119        return link->prev != NULL && link->next != NULL;
     
    238245 *
    239246 */
    240 static inline link_t *list_last(const list_t *list)
     247static inline link_t *list_last(list_t *list)
    241248{
    242249        return (list->head.prev == &list->head) ? NULL : list->head.prev;
     
    251258 *
    252259 */
    253 static inline link_t *list_next(const link_t *link, const list_t *list)
     260static inline link_t *list_next(link_t *link, const list_t *list)
    254261{
    255262        return (link->next == &list->head) ? NULL : link->next;
     
    264271 *
    265272 */
    266 static inline link_t *list_prev(const link_t *link, const list_t *list)
     273static inline link_t *list_prev(link_t *link, const list_t *list)
    267274{
    268275        return (link->prev == &list->head) ? NULL : link->prev;
     
    332339 *
    333340 */
    334 static inline link_t *list_nth(const list_t *list, unsigned int n)
     341static inline link_t *list_nth(list_t *list, unsigned int n)
    335342{
    336343        unsigned int cnt = 0;
     
    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.