blob: c1bc1d5480c53b4948c8b7e2826890c4ff42cb60 (
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
|
/*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
*/
/**
* $Id$
*
* @file dlist.h
* @brief doubly linked lists
*
* @copyright 2023 Network RADIUS SAS (legal@networkradius.com)
*/
#ifndef RADIUS_DLIST_H
#define RADIUS_DLIST_H
RCSIDH(dlist_h, "$Id$")
/*
* We have an internal cache, keyed by (mac + ssid).
*
* It returns the PMK and PSK for the user.
*/
typedef struct fr_dlist_s fr_dlist_t;
struct fr_dlist_s {
fr_dlist_t *prev;
fr_dlist_t *next;
};
static inline void fr_dlist_entry_init(fr_dlist_t *entry)
{
entry->prev = entry->next = entry;
}
static inline CC_HINT(nonnull) void fr_dlist_entry_unlink(fr_dlist_t *entry)
{
entry->prev->next = entry->next;
entry->next->prev = entry->prev;
entry->prev = entry->next = entry;
}
static inline CC_HINT(nonnull) void fr_dlist_insert_tail(fr_dlist_t *head, fr_dlist_t *entry)
{
entry->next = head;
entry->prev = head->prev;
head->prev->next = entry;
head->prev = entry;
}
#endif /* RADIUS_DLIST_H */
|
