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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
|
//
// Copyright 2016 Garrett D'Amore <garrett@damore.org>
//
// This software is supplied under the terms of the MIT License, a
// copy of which should be located in the distribution where this
// file was obtained (LICENSE.txt). A copy of the license may also be
// found online at https://opensource.org/licenses/MIT.
//
#include <stdlib.h>
#include <string.h>
#include "core/nng_impl.h"
// Linked list implementation. We implement a doubly linked list.
// Using pointer arithmetic, we can operate as a list of "anything".
#define NODE(list, item) \
(nni_list_node *) (void *) (((char *) item) + list->ll_offset)
#define ITEM(list, node) \
(void *) (((char *) node) - list->ll_offset)
void
nni_list_init_offset(nni_list *list, size_t offset)
{
list->ll_offset = offset;
list->ll_head.ln_next = &list->ll_head;
list->ll_head.ln_prev = &list->ll_head;
}
void *
nni_list_first(const nni_list *list)
{
nni_list_node *node = list->ll_head.ln_next;
if (node == &list->ll_head) {
return (NULL);
}
return (ITEM(list, node));
}
void *
nni_list_last(const nni_list *list)
{
nni_list_node *node = list->ll_head.ln_prev;
if (node == &list->ll_head) {
return (NULL);
}
return (ITEM(list, node));
}
void
nni_list_append(nni_list *list, void *item)
{
nni_list_node *node = NODE(list, item);
if ((node->ln_next != NULL) || (node->ln_prev != NULL)) {
nni_panic("appending node already on a list or not inited");
}
node->ln_prev = list->ll_head.ln_prev;
node->ln_next = &list->ll_head;
node->ln_next->ln_prev = node;
node->ln_prev->ln_next = node;
}
void
nni_list_prepend(nni_list *list, void *item)
{
nni_list_node *node = NODE(list, item);
if ((node->ln_next != NULL) || (node->ln_prev != NULL)) {
nni_panic("prepending node already on a list or not inited");
}
node->ln_next = list->ll_head.ln_next;
node->ln_prev = &list->ll_head;
node->ln_next->ln_prev = node;
node->ln_prev->ln_next = node;
}
void
nni_list_insert_before(nni_list *list, void *item, void *before)
{
nni_list_node *node = NODE(list, item);
nni_list_node *where = NODE(list, before);
if ((node->ln_next != NULL) || (node->ln_prev != NULL)) {
nni_panic("prepending node already on a list or not inited");
}
node->ln_next = where;
node->ln_prev = where->ln_prev;
node->ln_next->ln_prev = node;
node->ln_prev->ln_next = node;
}
void
nni_list_insert_after(nni_list *list, void *item, void *after)
{
nni_list_node *node = NODE(list, item);
nni_list_node *where = NODE(list, after);
if ((node->ln_next != NULL) || (node->ln_prev != NULL)) {
nni_panic("prepending node already on a list or not inited");
}
node->ln_prev = where;
node->ln_next = where->ln_next;
node->ln_next->ln_prev = node;
node->ln_prev->ln_next = node;
}
void *
nni_list_next(const nni_list *list, void *item)
{
nni_list_node *node = NODE(list, item);
if ((node = node->ln_next) == &list->ll_head) {
return (NULL);
}
return (ITEM(list, node));
}
void *
nni_list_prev(const nni_list *list, void *item)
{
nni_list_node *node = NODE(list, item);
if ((node = node->ln_prev) == &list->ll_head) {
return (NULL);
}
return (ITEM(list, node));
}
void
nni_list_remove(nni_list *list, void *item)
{
nni_list_node *node = NODE(list, item);
node->ln_prev->ln_next = node->ln_next;
node->ln_next->ln_prev = node->ln_prev;
node->ln_next = NULL;
node->ln_prev = NULL;
}
|
