1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
/*
* Ouroboros - Copyright (C) 2016 - 2017
*
* Simple doubly linked list implementation.
*
* Dimitri Staessens <dimitri.staessens@ugent.be>
* Sander Vrijders <sander.vrijders@ugent.be>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public License
* version 2.1 as published by the Free Software Foundation.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
* 02110-1301 USA
*/
#ifndef OUROBOROS_LIB_LIST_H
#define OUROBOROS_LIB_LIST_H
#include <stdbool.h>
#include <stdint.h>
#include <stddef.h>
#include <sys/types.h>
struct list_head {
struct list_head * nxt;
struct list_head * prv;
};
#define list_entry(ptr, type, mbr) \
((type *)((uint8_t *)(ptr) - offsetof(type, mbr)))
#define list_first_entry(ptr, type, mbr) \
list_entry((ptr)->nxt, type, mbr)
#define list_last_entry(ptr, type, mbr) \
list_entry((ptr)->prv, type, mbr)
#define list_for_each(p, h) \
for (p = (h)->nxt; p != (h); p = p->nxt)
#define list_for_each_safe(p, t, h) \
for (p = (h)->nxt, t = p->nxt; p != (h); p = t, t = p->nxt)
void list_head_init(struct list_head * h);
void list_add(struct list_head * e,
struct list_head * h);
void list_add_tail(struct list_head * e,
struct list_head * h);
void list_del(struct list_head * e);
void list_move(struct list_head * dst,
struct list_head * src);
bool list_is_empty(struct list_head * h);
#endif /* OUROBOROS_LIB_LIST_H */
|