dlist.h

/* Dlist - dynamic list
 * Copyright (C) 2016-2024 Frediano Ziglio
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library General Public
 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 *
 * This library 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
 * Library General Public License for more details.
 *
 * You should have received a copy of the GNU Library General Public
 * License along with this library; if not, write to the
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 * Boston, MA 02111-1307, USA.
 */
 
#ifndef _tdsguard_aej6DXYKBycQe7Wyg2gHaQ_
#define _tdsguard_aej6DXYKBycQe7Wyg2gHaQ_
 
typedef struct dlist_ring {
    struct dlist_ring *next;
    struct dlist_ring *prev;
} dlist_ring;
 
#if ENABLE_EXTRA_CHECKS
void dlist_ring_check(dlist_ring *ring);
#endif
 
#define DLIST_FIELDS(name) \
    dlist_ring name
 
#define DLIST_INITIALIZER(var) \
    { { &(var).ring, &(var).ring } }
 
#define DLIST_FOREACH(prefix, list, p) \
    for (p = prefix ## _ ## first(list); p != NULL; p = prefix ## _ ## next(list, p))
 
static inline void dlist_insert_after(dlist_ring *ring_pos, dlist_ring *ring_item)
{
    assert(!ring_item->next && !ring_item->prev);
    ring_pos->next->prev = ring_item;
    ring_item->prev = ring_pos;
    ring_item->next = ring_pos->next;
    ring_pos->next = ring_item;
    assert(ring_item->next && ring_item->prev);
}
 
#endif /* _tdsguard_aej6DXYKBycQe7Wyg2gHaQ_ */