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
|
/*
* Copyright (c) 2014 DeNA Co., Ltd.
*
* 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.
*/
#ifndef h2o__linklist_h
#define h2o__linklist_h
#ifdef __cplusplus
extern "C" {
#endif
#include <assert.h>
#include <stddef.h>
/**
* linklist
* The structure is used to represent both nodes and the head of the list.
* Nodes should be zero-filled upon initialization.
* Heads should be initialized by calling h2o_linklist_init_anchor.
*/
typedef struct st_h2o_linklist_t {
struct st_h2o_linklist_t *next;
struct st_h2o_linklist_t *prev;
} h2o_linklist_t;
/**
* initializes the anchor (i.e. head) of a linked list
*/
static void h2o_linklist_init_anchor(h2o_linklist_t *anchor);
/**
* tests if the list is empty
*/
static int h2o_linklist_is_empty(h2o_linklist_t *anchor);
/**
* tests if the node is linked to a list
*/
static int h2o_linklist_is_linked(h2o_linklist_t *node);
/**
* inserts a node to the linked list
* @param pos insert position; the node will be inserted before pos
* @param node the node to be inserted
*/
static void h2o_linklist_insert(h2o_linklist_t *pos, h2o_linklist_t *node);
/**
* inserts all the elements of list before pos (list becomes empty)
*/
static void h2o_linklist_insert_list(h2o_linklist_t *pos, h2o_linklist_t *list);
/**
* unlinks a node from the linked list
*/
static void h2o_linklist_unlink(h2o_linklist_t *node);
/* inline defs */
inline void h2o_linklist_init_anchor(h2o_linklist_t *anchor)
{
anchor->next = anchor->prev = anchor;
}
inline int h2o_linklist_is_linked(h2o_linklist_t *node)
{
return node->next != NULL;
}
inline int h2o_linklist_is_empty(h2o_linklist_t *anchor)
{
return anchor->next == anchor;
}
inline void h2o_linklist_insert(h2o_linklist_t *pos, h2o_linklist_t *node)
{
assert(!h2o_linklist_is_linked(node));
node->prev = pos->prev;
node->next = pos;
node->prev->next = node;
node->next->prev = node;
}
inline void h2o_linklist_insert_list(h2o_linklist_t *pos, h2o_linklist_t *list)
{
if (h2o_linklist_is_empty(list))
return;
list->next->prev = pos->prev;
list->prev->next = pos;
pos->prev->next = list->next;
pos->prev = list->prev;
h2o_linklist_init_anchor(list);
}
inline void h2o_linklist_unlink(h2o_linklist_t *node)
{
node->next->prev = node->prev;
node->prev->next = node->next;
node->next = node->prev = NULL;
}
#ifdef __cplusplus
}
#endif
#endif
|
