edlist.h

Go to the documentation of this file.

/*
 Copyright (C) 2009 Sung Ho Park
 Contact: ubinos.org@gmail.com
 
 This file is part of the itf_ubinos component of the Ubinos.
 
 GNU General Public License Usage
 This file may be used under the terms of the GNU
 General Public License version 3.0 as published by the Free Software
 Foundation and appearing in the file license_gpl3.txt included in the
 packaging of this file. Please review the following information to
 ensure the GNU General Public License version 3.0 requirements will be
 met: http://www.gnu.org/copyleft/gpl.html.
 
 GNU Lesser General Public License Usage
 Alternatively, this file may be used under the terms of the GNU Lesser
 General Public License version 2.1 as published by the Free Software
 Foundation and appearing in the file license_lgpl.txt included in the
 packaging of this file. Please review the following information to
 ensure the GNU Lesser General Public License version 2.1 requirements
 will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
 
 Commercial Usage
 Alternatively, licensees holding valid commercial licenses may
 use this file in accordance with the commercial license agreement
 provided with the software or, alternatively, in accordance with the
 terms contained in a written agreement between you and rightful owner.
 */
 
#ifndef UBICLIB_EDLIST_H_
#define UBICLIB_EDLIST_H_
 
#ifdef  __cplusplus
extern "C"
{
#endif
 
#include <ubinos_config.h>
#include <ubinos/type.h>
 
typedef struct _edlist_t
{
    unsigned int count; 
    void * head; 
    void * tail; 
    void * cur; 
    void * data; 
} edlist_t;
 
typedef edlist_t * edlist_pt;
 
typedef struct _edlist_elmt_t
{
    struct
    {
        struct _edlist_elmt_t * prev;
        struct _edlist_elmt_t * next;
        edlist_t * list;
    } link; 
    void * data; 
} edlist_elmt_t;
 
typedef edlist_elmt_t * edlist_elmt_pt;
 
#define edlist_init(edlist)                                                 \
{                                                                           \
    (edlist)->count = 0;                                                    \
    (edlist)->head  = NULL;                                                 \
    (edlist)->tail  = NULL;                                                 \
    (edlist)->cur   = NULL;                                                 \
    (edlist)->data  = NULL;                                                 \
}
 
#define edlist_link_init(link)                                              \
{                                                                           \
    (link)->prev    = NULL;                                                 \
    (link)->next    = NULL;                                                 \
    (link)->list    = NULL;                                                 \
}
 
#define edlist_insertprev(elmttype, linkname, edlist, ref, elmt)            \
{                                                                           \
    (elmt)->linkname.next = ((elmttype) ref);                               \
                                                                            \
    if (NULL == ((elmttype) ref)) {                                         \
        (elmt)->linkname.prev = (edlist)->tail;                             \
        (edlist)->tail = (elmt);                                            \
    }                                                                       \
    else {                                                                  \
        (elmt)->linkname.prev = ((elmttype) ref)->linkname.prev;            \
        ((elmttype) ref)->linkname.prev = (elmt);                           \
    }                                                                       \
                                                                            \
    if (NULL == (elmt)->linkname.prev) {                                    \
        (edlist)->head = (elmt);                                            \
    }                                                                       \
    else {                                                                  \
        (elmt)->linkname.prev->linkname.next = (elmt);                      \
    }                                                                       \
                                                                            \
    (edlist)->count++;                                                      \
                                                                            \
    (elmt)->linkname.list = (edlist);                                       \
}
 
#define edlist_insertnext(elmttype, linkname, edlist, ref, elmt)            \
{                                                                           \
    (elmt)->linkname.prev = ((elmttype) ref);                               \
                                                                            \
    if (NULL == ((elmttype) ref)) {                                         \
        (elmt)->linkname.next = (edlist)->head;                             \
        (edlist)->head = (elmt);                                            \
    }                                                                       \
    else {                                                                  \
        (elmt)->linkname.next = ((elmttype) ref)->linkname.next;            \
        ((elmttype) ref)->linkname.next = (elmt);                           \
    }                                                                       \
                                                                            \
    if (NULL == (elmt)->linkname.next) {                                    \
        (edlist)->tail = (elmt);                                            \
    }                                                                       \
    else {                                                                  \
        (elmt)->linkname.next->linkname.prev = (elmt);                      \
    }                                                                       \
                                                                            \
    (edlist)->count++;                                                      \
                                                                            \
    (elmt)->linkname.list = (edlist);                                       \
}
 
#define edlist_remove(elmttype, linkname, elmt)                             \
{                                                                           \
    if (NULL != ((elmt)->linkname.list)) {                                  \
        if ((elmt) == ((elmt)->linkname.list)->cur) {                       \
            ((elmt)->linkname.list)->cur = (elmt)->linkname.prev;           \
        }                                                                   \
                                                                            \
        if (NULL == (elmt)->linkname.prev) {                                \
            ((elmt)->linkname.list)->head = (elmt)->linkname.next;          \
        }                                                                   \
        else {                                                              \
            (elmt)->linkname.prev->linkname.next = (elmt)->linkname.next;   \
        }                                                                   \
                                                                            \
        if (NULL == (elmt)->linkname.next) {                                \
            ((elmt)->linkname.list)->tail = (elmt)->linkname.prev;          \
        }                                                                   \
        else {                                                              \
            (elmt)->linkname.next->linkname.prev = (elmt)->linkname.prev;   \
        }                                                                   \
                                                                            \
        ((elmt)->linkname.list)->count--;                                   \
                                                                            \
        (elmt)->linkname.prev = NULL;                                       \
        (elmt)->linkname.next = NULL;                                       \
        (elmt)->linkname.list = NULL;                                       \
    }                                                                       \
}
 
void * _edlist_setcur(edlist_pt edlist, void * cur);
 
#define edlist_setcur(elmttype, linkname, edlist, cur)  ((elmttype) _edlist_setcur(edlist, cur))
 
void * _edlist_getcur(edlist_pt edlist);
 
#define edlist_getcur(elmttype, linkname, edlist)       ((elmttype) _edlist_getcur(edlist))
 
#define edlist_getcurnext(elmttype, linkname, edlist)                                       \
    (   (elmttype)                                                                          \
        ((NULL == (edlist)->cur || NULL == ((elmttype) (edlist)->cur)->linkname.next)   ?   \
        _edlist_setcur((edlist), (edlist)->head)                                        :   \
        _edlist_setcur((edlist), ((elmttype) (edlist)->cur)->linkname.next)              ) )
 
#define edlist_head(elmttype, linkname, edlist)     ((elmttype) (edlist)->head)
 
#define edlist_tail(elmttype, linkname, edlist)     ((elmttype) (edlist)->tail)
 
#define edlist_next(elmttype, linkname, elmt)       ((elmt)->linkname.next)
 
#define edlist_prev(elmttype, linkname, elmt)       ((elmt)->linkname.prev)
 
#define edlist_list(elmttype, linkname, elmt)       ((elmt)->linkname.list)
 
#ifdef  __cplusplus
}
#endif
 
#endif /* UBICLIB_EDLIST_H_ */