blob: 71a0aa924b42cebc6761ffe918e8619fada0b08c (
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
|
/* libmisc/linkedlist.c - Singly- and doubly- linked lists
*
* Copyright (C) 2024-2025 Luke T. Shumaker <lukeshu@lukeshu.com>
* SPDX-License-Identifier: AGPL-3.0-or-later
*/
#include <stddef.h> /* for NULL */
#include <libmisc/assert.h>
#include <libmisc/linkedlist.h>
/* singly linked list *********************************************************/
void _slist_push_to_rear(struct _slist_root *root, struct _slist_node *node) {
assert(root);
node->rear = NULL;
if (root->rear)
root->rear->rear = node;
else
root->front = node;
root->rear = node;
}
void _slist_pop_from_front(struct _slist_root *root) {
assert(root);
assert(root->front);
root->front = root->front->rear;
if (!root->front)
root->rear = NULL;
}
/* doubly linked list *********************************************************/
void _dlist_push_to_rear(struct _dlist_root *root, struct _dlist_node *node) {
assert(root);
assert(node);
node->front = root->rear;
node->rear = NULL;
if (root->rear)
root->rear->rear = node;
else
root->front = node;
root->rear = node;
}
void _dlist_remove(struct _dlist_root *root, struct _dlist_node *node) {
assert(root);
assert(node);
if (node->front)
node->front->rear = node->rear;
else
root->front = node->rear;
if (node->rear)
node->rear->front = node->front;
else
root->rear = node->front;
}
void _dlist_pop_from_front(struct _dlist_root *root) {
assert(root);
assert(root->front);
_dlist_remove(root, root->front);
}
|
