1 /* Copyright (c) 2008 The Board of Trustees of The Leland Stanford
4 * We are making the OpenFlow specification and associated documentation
5 * (Software) available for public use and benefit with the expectation
6 * that others will use, modify and enhance the Software and contribute
7 * those enhancements back to the community. However, since we would
8 * like to make the Software available for broadest use, with as few
9 * restrictions as possible permission is hereby granted, free of
10 * charge, to any person obtaining a copy of this Software to deal in
11 * the Software under the copyrights without restriction, including
12 * without limitation the rights to use, copy, modify, merge, publish,
13 * distribute, sublicense, and/or sell copies of the Software, and to
14 * permit persons to whom the Software is furnished to do so, subject to
15 * the following conditions:
17 * The above copyright notice and this permission notice shall be
18 * included in all copies or substantial portions of the Software.
20 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
21 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
22 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
23 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
24 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
25 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
26 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
29 * The name and trademarks of copyright holder(s) may NOT be used in
30 * advertising or publicity pertaining to the Software or any
31 * derivatives without specific, written prior permission.
36 /* Doubly linked list. */
42 /* Doubly linked list head or element. */
45 struct list *prev; /* Previous list element. */
46 struct list *next; /* Next list element. */
49 #define LIST_INITIALIZER(LIST) { LIST, LIST }
51 void list_init(struct list *);
54 void list_insert(struct list *, struct list *);
55 void list_splice(struct list *before, struct list *first, struct list *last);
56 void list_push_front(struct list *, struct list *);
57 void list_push_back(struct list *, struct list *);
58 void list_replace(struct list *, const struct list *);
61 struct list *list_remove(struct list *);
62 struct list *list_pop_front(struct list *);
63 struct list *list_pop_back(struct list *);
66 struct list *list_front(struct list *);
67 struct list *list_back(struct list *);
69 /* List properties. */
70 size_t list_size(const struct list *);
71 bool list_is_empty(const struct list *);
73 #define LIST_ELEM__(ELEM, STRUCT, MEMBER, LIST) \
74 (ELEM != LIST ? CONTAINER_OF(ELEM, STRUCT, MEMBER) : NULL)
75 #define LIST_FOR_EACH(ITER, STRUCT, MEMBER, LIST) \
76 for (ITER = LIST_ELEM__((LIST)->next, STRUCT, MEMBER, LIST); \
78 ITER = LIST_ELEM__((ITER)->MEMBER.next, STRUCT, MEMBER, LIST))
79 #define LIST_FOR_EACH_SAFE(ITER, NEXT, STRUCT, MEMBER, LIST) \
80 for (ITER = LIST_ELEM__((LIST)->next, STRUCT, MEMBER, LIST); \
82 ? (NEXT = LIST_ELEM__((ITER)->MEMBER.next, \
83 STRUCT, MEMBER, LIST), 1) \