2 * Copyright (c) 2008, 2009, 2010, 2011, 2012, 2013 Nicira, Inc.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at:
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
19 /* Initializes 'list' as an empty list. */
21 list_init(struct list *list)
23 list->next = list->prev = list;
26 /* Initializes 'list' with pointers that will (probably) cause segfaults if
27 * dereferenced and, better yet, show up clearly in a debugger. */
29 list_poison(struct list *list)
31 memset(list, 0xcc, sizeof *list);
34 /* Inserts 'elem' just before 'before'. */
36 list_insert(struct list *before, struct list *elem)
38 elem->prev = before->prev;
40 before->prev->next = elem;
44 /* Removes elements 'first' though 'last' (exclusive) from their current list,
45 then inserts them just before 'before'. */
47 list_splice(struct list *before, struct list *first, struct list *last)
54 /* Cleanly remove 'first'...'last' from its current list. */
55 first->prev->next = last->next;
56 last->next->prev = first->prev;
58 /* Splice 'first'...'last' into new list. */
59 first->prev = before->prev;
61 before->prev->next = first;
65 /* Inserts 'elem' at the beginning of 'list', so that it becomes the front in
68 list_push_front(struct list *list, struct list *elem)
70 list_insert(list->next, elem);
73 /* Inserts 'elem' at the end of 'list', so that it becomes the back in
76 list_push_back(struct list *list, struct list *elem)
78 list_insert(list, elem);
81 /* Puts 'elem' in the position currently occupied by 'position'.
82 * Afterward, 'position' is not part of a list. */
84 list_replace(struct list *element, const struct list *position)
86 element->next = position->next;
87 element->next->prev = element;
88 element->prev = position->prev;
89 element->prev->next = element;
92 /* Adjusts pointers around 'list' to compensate for 'list' having been moved
93 * around in memory (e.g. as a consequence of realloc()).
95 * This always works if 'list' is a member of a list, or if 'list' is the head
96 * of a non-empty list. It fails badly, however, if 'list' is the head of an
97 * empty list; just use list_init() in that case. */
99 list_moved(struct list *list)
101 list->prev->next = list->next->prev = list;
104 /* Initializes 'dst' with the contents of 'src', compensating for moving it
105 * around in memory. The effect is that, if 'src' was the head of a list, now
106 * 'dst' is the head of a list containing the same elements. */
108 list_move(struct list *dst, struct list *src)
110 if (!list_is_empty(src)) {
118 /* Removes 'elem' from its list and returns the element that followed it.
119 Undefined behavior if 'elem' is not in a list. */
121 list_remove(struct list *elem)
123 elem->prev->next = elem->next;
124 elem->next->prev = elem->prev;
128 /* Removes the front element from 'list' and returns it. Undefined behavior if
129 'list' is empty before removal. */
131 list_pop_front(struct list *list)
133 struct list *front = list->next;
138 /* Removes the back element from 'list' and returns it.
139 Undefined behavior if 'list' is empty before removal. */
141 list_pop_back(struct list *list)
143 struct list *back = list->prev;
148 /* Returns the front element in 'list_'.
149 Undefined behavior if 'list_' is empty. */
151 list_front(const struct list *list_)
153 struct list *list = CONST_CAST(struct list *, list_);
155 ovs_assert(!list_is_empty(list));
159 /* Returns the back element in 'list_'.
160 Undefined behavior if 'list_' is empty. */
162 list_back(const struct list *list_)
164 struct list *list = CONST_CAST(struct list *, list_);
166 ovs_assert(!list_is_empty(list));
170 /* Returns the number of elements in 'list'.
171 Runs in O(n) in the number of elements. */
173 list_size(const struct list *list)
175 const struct list *e;
178 for (e = list->next; e != list; e = e->next) {
184 /* Returns true if 'list' is empty, false otherwise. */
186 list_is_empty(const struct list *list)
188 return list->next == list;
191 /* Returns true if 'list' has exactly 1 element, false otherwise. */
193 list_is_singleton(const struct list *list)
195 return list_is_short(list) && !list_is_empty(list);
198 /* Returns true if 'list' has 0 or 1 elements, false otherwise. */
200 list_is_short(const struct list *list)
202 return list->next == list->prev;