7ccb76aeee760f0686155c0de34e568fc49fc50b
1 /* Copyright (C) 2002 Free Software Foundation, Inc.
2 This file is part of the GNU C Library.
3 Contributed by Ulrich Drepper <drepper@redhat.com>, 2002.
5 The GNU C Library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Lesser General Public
7 License as published by the Free Software Foundation; either
8 version 2.1 of the License, or (at your option) any later version.
10 The GNU C Library is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public
16 License along with the GNU C Library; if not, write to the Free
17 Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
23 /* The definitions of this file are adopted from those which can be
24 found in the Linux kernel headers to enable people familiar with
25 the latter find their way in these sources as well. */
28 /* Basic type for the double-link list. */
29 typedef struct list_head
31 struct list_head
*next
;
32 struct list_head
*prev
;
36 /* Define a variable with the head and tail of the list. */
37 #define LIST_HEAD(name) \
38 list_t name = { &(name), &(name) }
40 /* Initialize a new list head. */
41 #define INIT_LIST_HEAD(ptr) \
42 (ptr)->next = (ptr)->prev = (ptr)
44 #define LIST_HEAD_INIT(name) { .prev = &(name), .next = &(name) }
46 /* Add new element at the head of the list. */
48 list_add (list_t
*newp
, list_t
*head
)
50 head
->next
->prev
= newp
;
51 newp
->next
= head
->next
;
57 /* Add new element at the tail of the list. */
59 list_add_tail (list_t
*newp
, list_t
*head
)
61 head
->prev
->next
= newp
;
63 newp
->prev
= head
->prev
;
68 /* Remove element from list. */
70 list_del (list_t
*elem
)
72 elem
->next
->prev
= elem
->prev
;
73 elem
->prev
->next
= elem
->next
;
79 list_splice (list_t
*add
, list_t
*head
)
81 /* Do nothing if the list which gets added is empty. */
84 add
->next
->prev
= head
;
85 add
->prev
->next
= head
->next
;
86 head
->next
->prev
= add
->prev
;
87 head
->next
= add
->next
;
92 /* Get typed element from list at a given position. */
93 #define list_entry(ptr, type, member) \
94 ((type *) ((char *) (ptr) - (unsigned long) (&((type *) 0)->member)))
98 /* Iterate forward over the elements of the list. */
99 #define list_for_each(pos, head) \
100 for (pos = (head)->next; pos != (head); pos = pos->next)
103 /* Iterate forward over the elements of the list. */
104 #define list_for_each_prev(pos, head) \
105 for (pos = (head)->prev; pos != (head); pos = pos->prev)
108 /* Iterate backwards over the elements list. The list elements can be
109 removed from the list while doing this. */
110 #define list_for_each_prev_safe(pos, p, head) \
111 for (pos = (head)->prev, p = pos->prev; \
113 pos = p, p = pos->prev)
115 #define list_for_each_entry(pos, head, member) \
116 for (pos = list_entry((head)->next, typeof(*pos), member); \
117 &pos->member != (head); \
118 pos = list_entry(pos->member.next, typeof(*pos), member))
120 #define list_for_each_entry_reverse(pos, head, member) \
121 for (pos = list_entry((head)->prev, typeof(*pos), member); \
122 &pos->member != (head); \
123 pos = list_entry(pos->member.prev, typeof(*pos), member))
125 #define list_for_each_entry_safe(pos, p, head, member) \
126 for (pos = list_entry((head)->next, typeof(*pos), member), \
127 p = list_entry(pos->member.next,typeof(*pos), member); \
128 &pos->member != (head); \
129 pos = p, p = list_entry(pos->member.next, typeof(*pos), member))
131 static inline int list_empty(list_t
*head
)
133 return head
== head
->next
;
136 static inline void list_replace_init(list_t
*old
,
139 list_t
*head
= old
->next
;
141 list_add_tail(new, head
);
This page took 0.03325 seconds and 4 git commands to generate.