Ulrich Drepper | b08d5a8 | 2005-07-26 05:00:05 +0000 | [diff] [blame] | 1 | /* Copyright (C) 2001, 2002, 2003 Red Hat, Inc. |
Ulrich Drepper | 361df7d | 2006-04-04 21:38:57 +0000 | [diff] [blame] | 2 | This file is part of Red Hat elfutils. |
Ulrich Drepper | b08d5a8 | 2005-07-26 05:00:05 +0000 | [diff] [blame] | 3 | Written by Ulrich Drepper <drepper@redhat.com>, 2001. |
| 4 | |
Ulrich Drepper | 361df7d | 2006-04-04 21:38:57 +0000 | [diff] [blame] | 5 | Red Hat elfutils is free software; you can redistribute it and/or modify |
| 6 | it under the terms of the GNU General Public License as published by the |
| 7 | Free Software Foundation; version 2 of the License. |
Ulrich Drepper | b08d5a8 | 2005-07-26 05:00:05 +0000 | [diff] [blame] | 8 | |
Ulrich Drepper | 361df7d | 2006-04-04 21:38:57 +0000 | [diff] [blame] | 9 | Red Hat elfutils is distributed in the hope that it will be useful, but |
| 10 | WITHOUT ANY WARRANTY; without even the implied warranty of |
| 11 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 12 | General Public License for more details. |
| 13 | |
| 14 | You should have received a copy of the GNU General Public License along |
| 15 | with Red Hat elfutils; if not, write to the Free Software Foundation, |
Ulrich Drepper | 1e9ef50 | 2006-04-04 22:29:06 +0000 | [diff] [blame] | 16 | Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301 USA. |
Ulrich Drepper | 361df7d | 2006-04-04 21:38:57 +0000 | [diff] [blame] | 17 | |
| 18 | In addition, as a special exception, Red Hat, Inc. gives You the |
| 19 | additional right to link the code of Red Hat elfutils with code licensed |
| 20 | under any Open Source Initiative certified open source license |
| 21 | (http://www.opensource.org/licenses/index.php) which requires the |
| 22 | distribution of source code with any binary distribution and to |
| 23 | distribute linked combinations of the two. Non-GPL Code permitted under |
| 24 | this exception must only link to the code of Red Hat elfutils through |
| 25 | those well defined interfaces identified in the file named EXCEPTION |
| 26 | found in the source code files (the "Approved Interfaces"). The files |
| 27 | of Non-GPL Code may instantiate templates or use macros or inline |
| 28 | functions from the Approved Interfaces without causing the resulting |
| 29 | work to be covered by the GNU General Public License. Only Red Hat, |
| 30 | Inc. may make changes or additions to the list of Approved Interfaces. |
| 31 | Red Hat's grant of this exception is conditioned upon your not adding |
| 32 | any new exceptions. If you wish to add a new Approved Interface or |
| 33 | exception, please contact Red Hat. You must obey the GNU General Public |
| 34 | License in all respects for all of the Red Hat elfutils code and other |
| 35 | code used in conjunction with Red Hat elfutils except the Non-GPL Code |
| 36 | covered by this exception. If you modify this file, you may extend this |
| 37 | exception to your version of the file, but you are not obligated to do |
| 38 | so. If you do not wish to provide this exception without modification, |
| 39 | you must delete this exception statement from your version and license |
| 40 | this file solely under the GPL without exception. |
| 41 | |
| 42 | Red Hat elfutils is an included package of the Open Invention Network. |
| 43 | An included package of the Open Invention Network is a package for which |
| 44 | Open Invention Network licensees cross-license their patents. No patent |
| 45 | license is granted, either expressly or impliedly, by designation as an |
| 46 | included package. Should you wish to participate in the Open Invention |
| 47 | Network licensing program, please visit www.openinventionnetwork.com |
| 48 | <http://www.openinventionnetwork.com>. */ |
Ulrich Drepper | b08d5a8 | 2005-07-26 05:00:05 +0000 | [diff] [blame] | 49 | |
| 50 | #ifndef LIST_H |
| 51 | #define LIST_H 1 |
| 52 | |
| 53 | /* Add element to the end of a circular, double-linked list. */ |
| 54 | #define CDBL_LIST_ADD_REAR(first, newp) \ |
| 55 | do { \ |
| 56 | __typeof (newp) _newp = (newp); \ |
| 57 | assert (_newp->next == NULL); \ |
| 58 | assert (_newp->previous == NULL); \ |
| 59 | if (unlikely ((first) == NULL)) \ |
| 60 | (first) = _newp->next = _newp->previous = _newp; \ |
| 61 | else \ |
| 62 | { \ |
| 63 | _newp->next = (first); \ |
| 64 | _newp->previous = (first)->previous; \ |
| 65 | _newp->previous->next = _newp->next->previous = _newp; \ |
| 66 | } \ |
| 67 | } while (0) |
| 68 | |
| 69 | /* Remove element from circular, double-linked list. */ |
| 70 | #define CDBL_LIST_DEL(first, elem) \ |
| 71 | do { \ |
| 72 | __typeof (elem) _elem = (elem); \ |
| 73 | /* Check whether the element is indeed on the list. */ \ |
| 74 | assert (first != NULL && _elem != NULL \ |
| 75 | && (first != elem \ |
| 76 | || ({ __typeof (elem) _runp = first->next; \ |
| 77 | while (_runp != first) \ |
| 78 | if (_runp == _elem) \ |
| 79 | break; \ |
| 80 | else \ |
| 81 | _runp = _runp->next; \ |
| 82 | _runp == _elem; }))); \ |
| 83 | if (unlikely (_elem->next == _elem)) \ |
| 84 | first = NULL; \ |
| 85 | else \ |
| 86 | { \ |
| 87 | _elem->next->previous = _elem->previous; \ |
| 88 | _elem->previous->next = _elem->next; \ |
| 89 | if (unlikely (first == _elem)) \ |
| 90 | first = _elem->next; \ |
| 91 | } \ |
| 92 | assert ((_elem->next = _elem->previous = NULL, 1)); \ |
| 93 | } while (0) |
| 94 | |
| 95 | |
| 96 | /* Add element to the front of a single-linked list. */ |
| 97 | #define SNGL_LIST_PUSH(first, newp) \ |
| 98 | do { \ |
| 99 | __typeof (newp) _newp = (newp); \ |
| 100 | assert (_newp->next == NULL); \ |
| 101 | _newp->next = first; \ |
| 102 | first = _newp; \ |
| 103 | } while (0) |
| 104 | |
| 105 | |
| 106 | /* Add element to the rear of a circular single-linked list. */ |
| 107 | #define CSNGL_LIST_ADD_REAR(first, newp) \ |
| 108 | do { \ |
| 109 | __typeof (newp) _newp = (newp); \ |
| 110 | assert (_newp->next == NULL); \ |
| 111 | if (unlikely ((first) == NULL)) \ |
| 112 | (first) = _newp->next = _newp; \ |
| 113 | else \ |
| 114 | { \ |
| 115 | _newp->next = (first)->next; \ |
| 116 | (first) = (first)->next = _newp; \ |
| 117 | } \ |
| 118 | } while (0) |
| 119 | |
| 120 | |
| 121 | #endif /* list.h */ |