list.h

Go to the documentation of this file.

/* ---------------------------------------------------------------------------
Copyright 2015 by the Lucciefr team

2015-08-13 [BNO] adapted to Lucciefr (and doxygen comments)
2013-05-01 [BNO] initial version
*/

#ifndef LIST_H
#define LIST_H

#define LIST_ITERATE(element, head) \
    for (element = head; element; element = element->next)

#define LIST_LAST(element, head) \
    do { element = head; \
        while (element) { if (!element->next) break; element = element->next; } \
    } while (0)


#define LIST_ITERATE_REVERSED(element, head) \
    LIST_LAST(element, head); \
    for (; element; element = element->prev)

#define LIST_MATCH(element, head, condition) \
    do { \
        LIST_ITERATE(element, head) { if (condition) break; } \
    } while (0)

#define LIST_FIND(element, head, value) \
    LIST_MATCH(element, head, element == value)

#define LIST_COUNT(counter, head) \
    do { __typeof__ (head) LIST_element; \
        counter = 0; LIST_ITERATE(LIST_element, head) { counter++; } \
    } while (0)

#define LIST_APPEND(element, head) \
    do { __typeof__ (head) LIST_last; \
        LIST_LAST(LIST_last, head); /* find last element */ \
        element->prev = LIST_last; \
        element->next = NULL; \
        if (LIST_last) LIST_last->next = element; \
        else /* should only happen on (head == NULL) */ head = element; \
    } while (0)

#define LIST_DELETE(element, head) \
    do { __typeof__ (head) LIST_prev = element->prev; \
        __typeof__ (head) LIST_next = element->next; \
        if (LIST_next) LIST_next->prev = LIST_prev; \
        if (LIST_prev) LIST_prev->next = LIST_next; \
        else /* should only happen on (element == head) */ head = LIST_next; \
    } while (0)

#endif // LIST_H