Source of list.h - busybox

Raw file
Source viewDiff to previous
 * list_for_each_safe - iterate over elements in a list, but don't dereference
 
#if !defined(_BLKID_LIST_H) && !defined(LIST_HEAD)
#define _BLKID_LIST_H
​
#ifdef __cplusplus
extern "C" {
#endif
​
#ifdef __GNUC__
#define _INLINE_ static __inline__
#else                         /* For Watcom C */
#define _INLINE_ static inline
#endif
​
/*
 * Simple doubly linked list implementation.
 *
 * Some of the internal functions ("__xxx") are useful when
 * manipulating whole lists rather than single entries, as
 * sometimes we already know the next/prev entries and we can
 * generate better code by using them directly rather than
 * using the generic single-entry routines.
 */
​
struct list_head {
    struct list_head *next, *prev;
};
​
#define LIST_HEAD_INIT(name) { &(name), &(name) }
​
#define LIST_HEAD(name) \
    struct list_head name = LIST_HEAD_INIT(name)
​
#define INIT_LIST_HEAD(ptr) do { \
    (ptr)->next = (ptr); (ptr)->prev = (ptr); \
} while (0)
​
/*
 * Insert a new entry between two known consecutive entries.
 *
 * This is only for internal list manipulation where we know
 * the prev/next entries already!
 */
_INLINE_ void __list_add(struct list_head * add,
    struct list_head * prev,
    struct list_head * next)
{
    next->prev = add;
    add->next = next;
    add->prev = prev;
    prev->next = add;
}
​
/**
 * list_add - add a new entry
 * @add:    new entry to be added
 * @head:   list head to add it after
 *
 * Insert a new entry after the specified head.
 * This is good for implementing stacks.
 */
_INLINE_ void list_add(struct list_head *add, struct list_head *head)
{
    __list_add(add, head, head->next);