root / Whitix / branches / hybrid / include / llist.h

/*  This file is part of Whitix.
 *
 *  Whitix is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  Whitix is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with Whitix; if not, write to the Free Software
 *  Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 *
 */

#ifndef LLIST_H
#define LLIST_H

#include <typedefs.h>

/* Most of this logic is adapted from Linux. It's great and flexible, kudos to them */

struct ListHead
{
        struct ListHead* prev,*next;
};

#define LIST_HEAD_INIT(name) { &(name), &(name) }
#define INIT_LIST_HEAD(ptr) do { (ptr)->next=(ptr); (ptr)->prev=(ptr); } while(0)
#define LIST_HEAD(name) struct ListHead name=LIST_HEAD_INIT(name)

#define offsetof(type,member) (unsigned int)(&(((type*)0)->member))

static inline void DoListAdd(struct ListHead* new,struct ListHead* prev,struct ListHead* next)
{
        next->prev=new;
        new->next=next;
        new->prev=prev;
        prev->next=new;
}

static inline void ListAdd(struct ListHead* new,struct ListHead* head)
{
        DoListAdd(new,head,head->next);
}

/* Adds ListHead to the prev of head, which is the end of the list */

static inline void ListAddTail(struct ListHead* new,struct ListHead* head)
{
        DoListAdd(new,head->prev,head);
}

static inline void DoListRemove(struct ListHead* prev,struct ListHead* next)
{
        next->prev=prev;
        prev->next=next;
}

static inline void ListRemove(struct ListHead* entry)
{
        DoListRemove(entry->prev,entry->next);
}

static inline void ListRemoveInit(struct ListHead* entry)
{
        DoListRemove(entry->prev,entry->next);
        INIT_LIST_HEAD(entry);
}

static inline int ListEmpty(struct ListHead* head)
{
        return (head->next == head);
}

/* Minus the address of the list_struct within the struct by the start of the struct */
#define ListEntry(ptr,type,member) \
        ((type*)(((char*)ptr)-offsetof(type,member)))

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

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

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

#endif