blob: 18195e8223c7bf4bd4fa414c8a66829981608e91 (
plain)
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
|
/*
* Copyright (C) 2020 Paul Cercueil <paul@crapouillou.net>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* 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.
*/
#ifndef __LIGHTREC_SLIST_H__
#define __LIGHTREC_SLIST_H__
#define container_of(ptr, type, member) \
((type *)((void *)(ptr) - offsetof(type, member)))
struct slist_elm {
struct slist_elm *next;
};
static inline void slist_init(struct slist_elm *head)
{
head->next = NULL;
}
static inline struct slist_elm * slist_first(struct slist_elm *head)
{
return head->next;
}
static inline _Bool slist_empty(const struct slist_elm *head)
{
return head->next == NULL;
}
static inline void slist_remove_next(struct slist_elm *elm)
{
if (elm->next)
elm->next = elm->next->next;
}
static inline void slist_remove(struct slist_elm *head, struct slist_elm *elm)
{
struct slist_elm *prev;
if (head->next == elm) {
head->next = elm->next;
} else {
for (prev = head->next; prev && prev->next != elm; )
prev = prev->next;
if (prev)
slist_remove_next(prev);
}
}
static inline void slist_append(struct slist_elm *head, struct slist_elm *elm)
{
elm->next = head->next;
head->next = elm;
}
#endif /* __LIGHTREC_SLIST_H__ */
|
