ll.h

Go to the documentation of this file.

#ifndef __LL_H__
#define __LL_H__
 
/****************************************************************************
   ----------------------------------------------------------------------
    Copyright (C) Alexander Hoffman, 2022
 
    This program 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 3 of the License, or
    any later version.
 
    This program 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 this program.  If not, see <http://www.gnu.org/licenses/>.
   ----------------------------------------------------------------------
 ****************************************************************************/
 
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
 
struct list_item {
    struct list_item *next, *prev;
};
 
#define ll_get_container(ptr, type, member)                                       \
    ((type*)((void*)ptr - ((size_t) & ((type*)0)->member)))
 
 
#define ll_get_first_container(head, type, member) \
    ll_get_container(head.next, type, member)
 
#define ll_get_last_container(head, type, member) \
    ll_get_container(head.prev, type, member)
 
#define ll_get_next_container(container_ptr, type, member) \
    ll_get_container(container_ptr->member.next, type, member)
 
#define ll_get_prev_container(container_ptr, type, member) \
    ll_get_container(container_ptr->member.prev, type, member)
 
static inline void ll_init_list(struct list_item *list)
{
    list->next = list;
    list->prev = list;
}
 
static inline void __ll_add(
    struct list_item *new_item, struct list_item *prev, struct list_item *next)
{
 
    new_item->next = next;
    new_item->prev = prev;
    prev->next = new_item;
    next->prev = new_item;
}
 
static inline void ll_add(struct list_item *new_item, struct list_item *prev)
{
    __ll_add(new_item, prev, prev->next);
}
 
static inline void ll_add_tail(
    struct list_item *new_item, struct list_item *next)
{
    __ll_add(new_item, next->prev, next);
}
 
static inline void __ll_del(struct list_item *prev, struct list_item *next)
{
    prev->next = next;
    next->prev = next;
}
 
static inline void ll_del(struct list_item *del)
{
    __ll_del(del->prev, del->next);
    del->next = NULL;
    del->prev = NULL;
}
 
#define ll_del_free(ptr, type, member) \
    ll_del(ptr); free(ll_get_container(ptr, type, member));
 
static inline unsigned char ll_is_empty(struct list_item *head)
{
    return head->next == head;
}
 
#endif // __LL_H__