1135446Strhodes/* 2193149Sdougb * Copyright (C) 2004-2007 Internet Systems Consortium, Inc. ("ISC") 3135446Strhodes * Copyright (C) 1997-2001 Internet Software Consortium. 4135446Strhodes * 5193149Sdougb * Permission to use, copy, modify, and/or distribute this software for any 6135446Strhodes * purpose with or without fee is hereby granted, provided that the above 7135446Strhodes * copyright notice and this permission notice appear in all copies. 8135446Strhodes * 9135446Strhodes * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH 10135446Strhodes * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY 11135446Strhodes * AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT, 12135446Strhodes * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM 13135446Strhodes * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE 14135446Strhodes * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR 15135446Strhodes * PERFORMANCE OF THIS SOFTWARE. 16135446Strhodes */ 17135446Strhodes 18234010Sdougb/* $Id: list.h,v 1.14 2007/06/19 23:47:23 tbox Exp $ */ 19135446Strhodes 20135446Strhodes#ifndef LWRES_LIST_H 21135446Strhodes#define LWRES_LIST_H 1 22135446Strhodes 23193149Sdougb/*! \file lwres/list.h */ 24170222Sdougb 25135446Strhodes#define LWRES_LIST(type) struct { type *head, *tail; } 26135446Strhodes#define LWRES_LIST_INIT(list) \ 27135446Strhodes do { (list).head = NULL; (list).tail = NULL; } while (0) 28135446Strhodes 29135446Strhodes#define LWRES_LINK(type) struct { type *prev, *next; } 30135446Strhodes#define LWRES_LINK_INIT(elt, link) \ 31135446Strhodes do { \ 32135446Strhodes (elt)->link.prev = (void *)(-1); \ 33135446Strhodes (elt)->link.next = (void *)(-1); \ 34135446Strhodes } while (0) 35135446Strhodes#define LWRES_LINK_LINKED(elt, link) \ 36135446Strhodes ((void *)((elt)->link.prev) != (void *)(-1)) 37135446Strhodes 38135446Strhodes#define LWRES_LIST_HEAD(list) ((list).head) 39135446Strhodes#define LWRES_LIST_TAIL(list) ((list).tail) 40135446Strhodes#define LWRES_LIST_EMPTY(list) LWRES_TF((list).head == NULL) 41135446Strhodes 42135446Strhodes#define LWRES_LIST_PREPEND(list, elt, link) \ 43135446Strhodes do { \ 44135446Strhodes if ((list).head != NULL) \ 45135446Strhodes (list).head->link.prev = (elt); \ 46135446Strhodes else \ 47135446Strhodes (list).tail = (elt); \ 48135446Strhodes (elt)->link.prev = NULL; \ 49135446Strhodes (elt)->link.next = (list).head; \ 50135446Strhodes (list).head = (elt); \ 51135446Strhodes } while (0) 52135446Strhodes 53135446Strhodes#define LWRES_LIST_APPEND(list, elt, link) \ 54135446Strhodes do { \ 55135446Strhodes if ((list).tail != NULL) \ 56135446Strhodes (list).tail->link.next = (elt); \ 57135446Strhodes else \ 58135446Strhodes (list).head = (elt); \ 59135446Strhodes (elt)->link.prev = (list).tail; \ 60135446Strhodes (elt)->link.next = NULL; \ 61135446Strhodes (list).tail = (elt); \ 62135446Strhodes } while (0) 63135446Strhodes 64135446Strhodes#define LWRES_LIST_UNLINK(list, elt, link) \ 65135446Strhodes do { \ 66135446Strhodes if ((elt)->link.next != NULL) \ 67135446Strhodes (elt)->link.next->link.prev = (elt)->link.prev; \ 68135446Strhodes else \ 69135446Strhodes (list).tail = (elt)->link.prev; \ 70135446Strhodes if ((elt)->link.prev != NULL) \ 71135446Strhodes (elt)->link.prev->link.next = (elt)->link.next; \ 72135446Strhodes else \ 73135446Strhodes (list).head = (elt)->link.next; \ 74135446Strhodes (elt)->link.prev = (void *)(-1); \ 75135446Strhodes (elt)->link.next = (void *)(-1); \ 76135446Strhodes } while (0) 77135446Strhodes 78135446Strhodes#define LWRES_LIST_PREV(elt, link) ((elt)->link.prev) 79135446Strhodes#define LWRES_LIST_NEXT(elt, link) ((elt)->link.next) 80135446Strhodes 81135446Strhodes#define LWRES_LIST_INSERTBEFORE(list, before, elt, link) \ 82135446Strhodes do { \ 83135446Strhodes if ((before)->link.prev == NULL) \ 84135446Strhodes LWRES_LIST_PREPEND(list, elt, link); \ 85135446Strhodes else { \ 86135446Strhodes (elt)->link.prev = (before)->link.prev; \ 87135446Strhodes (before)->link.prev = (elt); \ 88135446Strhodes (elt)->link.prev->link.next = (elt); \ 89135446Strhodes (elt)->link.next = (before); \ 90135446Strhodes } \ 91135446Strhodes } while (0) 92135446Strhodes 93135446Strhodes#define LWRES_LIST_INSERTAFTER(list, after, elt, link) \ 94135446Strhodes do { \ 95135446Strhodes if ((after)->link.next == NULL) \ 96135446Strhodes LWRES_LIST_APPEND(list, elt, link); \ 97135446Strhodes else { \ 98135446Strhodes (elt)->link.next = (after)->link.next; \ 99135446Strhodes (after)->link.next = (elt); \ 100135446Strhodes (elt)->link.next->link.prev = (elt); \ 101135446Strhodes (elt)->link.prev = (after); \ 102135446Strhodes } \ 103135446Strhodes } while (0) 104135446Strhodes 105135446Strhodes#define LWRES_LIST_APPENDLIST(list1, list2, link) \ 106135446Strhodes do { \ 107135446Strhodes if (LWRES_LIST_EMPTY(list1)) \ 108135446Strhodes (list1) = (list2); \ 109135446Strhodes else if (!LWRES_LIST_EMPTY(list2)) { \ 110135446Strhodes (list1).tail->link.next = (list2).head; \ 111135446Strhodes (list2).head->link.prev = (list1).tail; \ 112135446Strhodes (list1).tail = (list2).tail; \ 113135446Strhodes } \ 114135446Strhodes (list2).head = NULL; \ 115135446Strhodes (list2).tail = NULL; \ 116135446Strhodes } while (0) 117135446Strhodes 118135446Strhodes#define LWRES_LIST_ENQUEUE(list, elt, link) LWRES_LIST_APPEND(list, elt, link) 119135446Strhodes#define LWRES_LIST_DEQUEUE(list, elt, link) LWRES_LIST_UNLINK(list, elt, link) 120135446Strhodes 121135446Strhodes#endif /* LWRES_LIST_H */ 122