summaryrefslogtreecommitdiff
path: root/lib/src/list.c
blob: 61771b2c53b8e37d7d3000ceae0e20d9e672bb6e (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
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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
/* Cesar project {{{
 *
 * Copyright (C) 2007 Spidcom
 *
 * <<<Licence>>>
 *
 * }}} */
/**
 * \file    lib/src/list.c
 * \brief   Double linked list.
 * \ingroup lib
 */
#include "common/std.h"
#include "lib/list.h"

void
list_init (list_t *list)
{
    dbg_assert (list);
    list_init_node (&list->nil);
}

void
list_init_node (list_node_t *node)
{
    dbg_assert (node);
    node->next = node->prev = node;
}

list_node_t *
list_begin (list_t *list)
{
    dbg_assert (list);
    return list->nil.next;
}

list_node_t *
list_end (list_t *list)
{
    dbg_assert (list);
    return &list->nil;
}

list_node_t *
list_rbegin (list_t *list)
{
    dbg_assert (list);
    return list->nil.prev;
}

list_node_t *
list_rend (list_t *list)
{
    dbg_assert (list);
    return &list->nil;
}

list_node_t *
list_next (list_node_t *node)
{
    dbg_assert (node);
    return node->next;
}

list_node_t *
list_prev (list_node_t *node)
{
    dbg_assert (node);
    return node->prev;
}

bool
list_empty (list_t *list)
{
    dbg_assert (list);
    return list->nil.next == &list->nil;
}

void
list_push (list_t *list, list_node_t *node)
{
    dbg_assert (list);
    dbg_assert (node && node->next == node && node->prev == node);
    node->prev = list->nil.prev;
    node->next = &list->nil;
    list->nil.prev->next = node;
    list->nil.prev = node;
}

void
list_unshift (list_t *list, list_node_t *node)
{
    dbg_assert (list);
    dbg_assert (node && node->next == node && node->prev == node);
    node->next = list->nil.next;
    node->prev = &list->nil;
    list->nil.next->prev = node;
    list->nil.next = node;
}

list_node_t *
list_pop (list_t *list)
{
    list_node_t *node;
    dbg_assert (list && !list_empty (list));
    node = list->nil.prev;
    dbg_assert (node && node->prev && node->next == &list->nil);
    list->nil.prev = node->prev;
    node->prev->next = &list->nil;
    node->next = node->prev = node;
    return node;
}

list_node_t *
list_shift (list_t *list)
{
    list_node_t *node;
    dbg_assert (list && !list_empty (list));
    node = list->nil.next;
    dbg_assert (node && node->next && node->prev == &list->nil);
    list->nil.next = node->next;
    node->next->prev = &list->nil;
    node->next = node->prev = node;
    return node;
}

void
list_remove (list_t *list, list_node_t *node)
{
    dbg_assert (list && !list_empty (list));
    dbg_assert (node && node->next && node->next != node
                && node->prev && node->prev != node);
    node->prev->next = node->next;
    node->next->prev = node->prev;
    node->next = node->prev = node;
}

void
list_insert (list_t *list, list_node_t *before, list_node_t *node)
{
    dbg_assert (list);
    dbg_assert (before && before->prev);
    dbg_assert (node && node->next == node && node->prev == node);
    node->next = before;
    node->prev = before->prev;
    before->prev->next = node;
    before->prev = node;
}

void
list_push_range (list_t *to, list_t *from,
                 list_node_t *first, list_node_t *last)
{
    dbg_assert (to);
    list_insert_range (to, from, &to->nil, first, last);
}

void
list_unshift_range (list_t *to, list_t *from,
                    list_node_t *first, list_node_t *last)
{
    dbg_assert (to);
    list_insert_range (to, from, to->nil.next, first, last);
}

void
list_insert_range (list_t *to, list_t *from, list_node_t *before,
                   list_node_t *first, list_node_t *last)
{
    list_node_t *before_last;
    dbg_assert (to && from && !list_empty (from));
    dbg_assert (before && first && last);
    first->prev->next = last;
    before_last = last->prev;
    last->prev = first->prev;
    first->prev = before->prev;
    before_last->next = before;
    before->prev->next = first;
    before->prev = before_last;
}