sllist.h

Go to the documentation of this file.

 
#ifndef LELY_UTIL_SLLIST_H_
#define LELY_UTIL_SLLIST_H_
 
#include <lely/features.h>
 
#include <stddef.h>
 
#ifndef LELY_UTIL_SLLIST_INLINE
#define LELY_UTIL_SLLIST_INLINE static inline
#endif
 
struct slnode {
        struct slnode *next;
};
 
#define SLNODE_INIT \
        { \
                NULL \
        }
 
struct sllist {
        struct slnode *first;
        struct slnode **plast;
};
 
#ifdef __cplusplus
extern "C" {
#endif
 
LELY_UTIL_SLLIST_INLINE void slnode_init(struct slnode *node);
 
#ifdef __COUNTER__
#define slnode_foreach(first, node) slnode_foreach_(__COUNTER__, first, node)
#else
#define slnode_foreach(first, node) slnode_foreach_(__LINE__, first, node)
#endif
#define slnode_foreach_(n, first, node) slnode_foreach__(n, first, node)
// clang-format off
#define slnode_foreach__(n, first, node) \
        for (struct slnode *node = (first), \
                        *_slnode_next_##n = (node) ? (node)->next : NULL; \
                        (node); (node) = _slnode_next_##n, \
                        _slnode_next_##n = (node) ? (node)->next : NULL)
// clang-format on
 
LELY_UTIL_SLLIST_INLINE void sllist_init(struct sllist *list);
 
LELY_UTIL_SLLIST_INLINE int sllist_empty(const struct sllist *list);
 
LELY_UTIL_SLLIST_INLINE size_t sllist_size(const struct sllist *list);
 
LELY_UTIL_SLLIST_INLINE void sllist_push_front(
                struct sllist *list, struct slnode *node);
 
LELY_UTIL_SLLIST_INLINE void sllist_push_back(
                struct sllist *list, struct slnode *node);
 
LELY_UTIL_SLLIST_INLINE struct slnode *sllist_pop_front(struct sllist *list);
 
struct slnode *sllist_pop_back(struct sllist *list);
 
struct slnode *sllist_remove(struct sllist *list, struct slnode *node);
 
LELY_UTIL_SLLIST_INLINE struct sllist *sllist_append(
                struct sllist *dst, struct sllist *src);
 
LELY_UTIL_SLLIST_INLINE struct slnode *sllist_first(const struct sllist *list);
 
struct slnode *sllist_last(const struct sllist *list);
 
#define sllist_foreach(list, node) slnode_foreach (sllist_first(list), node)
 
inline void
slnode_init(struct slnode *node)
{
        node->next = NULL;
}
 
inline void
sllist_init(struct sllist *list)
{
        *(list->plast = &list->first) = NULL;
}
 
inline int
sllist_empty(const struct sllist *list)
{
        return !list->first;
}
 
inline size_t
sllist_size(const struct sllist *list)
{
        size_t size = 0;
        sllist_foreach (list, node)
                size++;
        return size;
}
 
inline void
sllist_push_front(struct sllist *list, struct slnode *node)
{
        if (!(node->next = list->first))
                list->plast = &node->next;
        list->first = node;
}
 
inline void
sllist_push_back(struct sllist *list, struct slnode *node)
{
        *list->plast = node;
        list->plast = &(*list->plast)->next;
        *list->plast = NULL;
}
 
inline struct slnode *
sllist_pop_front(struct sllist *list)
{
        struct slnode *node = list->first;
        if (node) {
                if (!(list->first = node->next))
                        list->plast = &list->first;
                node->next = NULL;
        }
        return node;
}
 
inline struct sllist *
sllist_append(struct sllist *dst, struct sllist *src)
{
        if (src->first) {
                *dst->plast = src->first;
                dst->plast = src->plast;
                sllist_init(src);
        }
        return dst;
}
 
inline struct slnode *
sllist_first(const struct sllist *list)
{
        return list->first;
}
 
#ifdef __cplusplus
}
#endif
 
#endif // !LELY_UTIL_SLLIST_H_