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
|
/*
* Copyright 2016 Garrett D'Amore <garrett@damore.org>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom
* the Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*/
#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_t *)(void *)(((char *)item) + list->ll_offset)
#define ITEM(list, node) \
(void *)(((char *)node) - list->ll_offset)
void
nni_list_init_offset(nni_list_t *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(nni_list_t *list)
{
nni_list_node_t *node = list->ll_head.ln_next;
if (node == &list->ll_head) {
return (NULL);
}
return (ITEM(list, node));
}
void *
nni_list_last(nni_list_t *list)
{
nni_list_node_t *node = list->ll_head.ln_prev;
if (node == &list->ll_head) {
return (NULL);
}
return (ITEM(list, node));
}
void
nni_list_append(nni_list_t *list, void *item)
{
nni_list_node_t *node = NODE(list, item);
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_t *list, void *item)
{
nni_list_node_t *node = NODE(list, item);
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_next(nni_list_t *list, void *item)
{
nni_list_node_t *node = NODE(list, item);
if ((node = node->ln_next) == &list->ll_head) {
return (NULL);
}
return (ITEM(list, node));
}
void *
nni_list_prev(nni_list_t *list, void *item)
{
nni_list_node_t *node = NODE(list, item);
if ((node = node->ln_prev) == &list->ll_head) {
return (NULL);
}
return (ITEM(list, node));
}
void
nni_list_remove(nni_list_t *list, void *item)
{
nni_list_node_t *node = NODE(list, item);
node->ln_prev->ln_next = node->ln_next;
node->ln_next->ln_prev = node->ln_prev;
}
void
nni_list_node_init(nni_list_t *list, void *item)
{
nni_list_node_t *node = NODE(list, item);
node->ln_prev = node->ln_next = NULL;
}
|
