xt_list.h

浏览该文件的文档.

 
#ifndef __XT_LIST_H__
#define __XT_LIST_H__
 
#include <stddef.h>
#include <stdint.h>
 
#ifdef __cplusplus
extern "C" {
#endif


struct xt_list_node {
    struct xt_list_node *next;                          
    struct xt_list_node *prev;                          
};

struct xt_slist_node {
    struct xt_slist_node *next;                         
};

#define xt_container_of(ptr, type, member) \
    ((type *)((char *)(ptr) - (uintptr_t)(&((type *)0)->member)))

#define XT_LIST_OBJECT_INIT(object) { &(object), &(object) }

static inline void xt_list_init(struct xt_list_node *l)
{
    l->next = l->prev = l;
}

static inline void xt_list_insert_after(struct xt_list_node *l, struct xt_list_node *n)
{
    l->next->prev = n;
    n->next = l->next;
 
    l->next = n;
    n->prev = l;
}

static inline void xt_list_insert_before(struct xt_list_node *l, struct xt_list_node *n)
{
    l->prev->next = n;
    n->prev = l->prev;
 
    l->prev = n;
    n->next = l;
}

static inline void xt_list_remove(struct xt_list_node *n)
{
    n->next->prev = n->prev;
    n->prev->next = n->next;
 
    n->next = n->prev = n;
}

static inline int xt_list_isempty(const struct xt_list_node *l)
{
    return l->next == l;
}

static inline unsigned int xt_list_len(const struct xt_list_node *l)
{
    unsigned int len = 0;
    const struct xt_list_node *p = l;
    while (p->next != l) {
        p = p->next;
        len ++;
    }
 
    return len;
}

#define xt_list_entry(node, type, member) \
    xt_container_of(node, type, member)

#define xt_list_for_each(pos, head) \
    for (pos = (head)->next; pos != (head); pos = pos->next)

#define xt_list_for_each_safe(pos, n, head) \
    for (pos = (head)->next, n = pos->next; pos != (head); \
        pos = n, n = pos->next)

#define xt_list_for_each_entry(pos, head, member) \
    for (pos = xt_list_entry((head)->next, typeof(*pos), member); \
         &pos->member != (head); \
         pos = xt_list_entry(pos->member.next, typeof(*pos), member))

#define xt_list_for_each_entry_safe(pos, n, head, member) \
    for (pos = xt_list_entry((head)->next, typeof(*pos), member), \
         n = xt_list_entry(pos->member.next, typeof(*pos), member); \
         &pos->member != (head); \
         pos = n, n = xt_list_entry(n->member.next, typeof(*n), member))

#define xt_list_first_entry(ptr, type, member) \
    xt_list_entry((ptr)->next, type, member)
 
#define XT_SLIST_OBJECT_INIT(object) { NULL }

static inline void xt_slist_init(struct xt_slist_node *l)
{
    l->next = NULL;
}
 
static inline void xt_slist_append(struct xt_slist_node *l, struct xt_slist_node *n)
{
    struct xt_slist_node *node;
 
    node = l;
    while (node->next) {
        node = node->next;
    }
 
    /* append the node to the tail */
    node->next = n;
    n->next = NULL;
}
 
static inline void xt_slist_insert(struct xt_slist_node *l, struct xt_slist_node *n)
{
    n->next = l->next;
    l->next = n;
}
 
static inline unsigned int xt_slist_len(const struct xt_slist_node *l)
{
    unsigned int len = 0;
    const struct xt_slist_node *list = l->next;
    while (list != NULL) {
        list = list->next;
        len ++;
    }
 
    return len;
}
 
static inline struct xt_slist_node *xt_slist_remove(struct xt_slist_node *l, struct xt_slist_node *n)
{
    /* remove slist head */
    struct xt_slist_node *node = l;
    while (node->next && node->next != n) {
        node = node->next;
    }
 
    /* remove node */
    if (node->next != (struct xt_slist_node *)0) {
        node->next = node->next->next;
    }
 
    return l;
}
 
static inline struct xt_slist_node *xt_slist_first(struct xt_slist_node *l)
{
    return l->next;
}
 
static inline struct xt_slist_node *xt_slist_tail(struct xt_slist_node *l)
{
    while (l->next) {
        l = l->next;
    }
 
    return l;
}
 
static inline struct xt_slist_node *xt_slist_next(struct xt_slist_node *n)
{
    return n->next;
}
 
static inline int xt_slist_isempty(struct xt_slist_node *l)
{
    return l->next == NULL;
}

#define xt_slist_entry(node, type, member) \
    xt_container_of(node, type, member)

#define xt_slist_for_each(pos, head) \
    for (pos = (head)->next; pos != NULL; pos = pos->next)

#define xt_slist_for_each_entry(pos, head, member) \
    for (pos = xt_slist_entry((head)->next, typeof(*pos), member); \
         &pos->member != (NULL); \
         pos = xt_slist_entry(pos->member.next, typeof(*pos), member))

#define xt_slist_first_entry(ptr, type, member) \
    xt_slist_entry((ptr)->next, type, member)

#define xt_slist_tail_entry(ptr, type, member) \
    xt_slist_entry(xt_slist_tail(ptr), type, member)
  /* xt_list */
 
#ifdef __cplusplus
} /* extern "C" */
#endif
 
#endif /* __XT_LIST_H__ */