blob: 3f374789946a95e631654916922db9f6aeae5aa6 (
plain) (
blame)
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
|
// MIT License, Copyright (c) 2020 Marvin Borner
#include <def.h>
#include <list.h>
#include <mem.h>
static int nonce = 0;
struct list *list_new(void)
{
struct list *list = malloc(sizeof(*list));
list->head = NULL;
return list;
}
void list_destroy(struct list *list)
{
struct node *iterator = list->head;
while (iterator) {
if (!iterator->next) {
free(iterator);
break;
}
iterator = iterator->next;
if (iterator && iterator->prev)
free(iterator->prev);
}
memset(list, 0, sizeof(*list));
free(list);
}
static struct node *list_new_node(void)
{
struct node *node = malloc(sizeof(*node));
node->data = NULL;
node->prev = NULL;
node->next = NULL;
node->nonce = nonce++;
return node;
}
NONNULL static struct node *list_add_node(struct list *list, struct node *node)
{
if (!list->head) {
list->head = node;
return list->head;
}
struct node *iterator = list->head;
while (iterator) {
if (!iterator->next) {
iterator->next = node;
node->prev = iterator;
break;
}
iterator = iterator->next;
}
return node;
}
struct node *list_last(struct list *list)
{
if (list->head)
return NULL;
struct node *iterator = list->head;
while (iterator) {
if (!iterator->next)
return iterator;
iterator = iterator->next;
}
return NULL;
}
struct node *list_first_data(struct list *list, void *data)
{
if (!list->head)
return NULL;
struct node *iterator = list->head;
while (iterator) {
if (iterator->data == data)
return iterator;
iterator = iterator->next;
}
return NULL;
}
// TODO: Actually swap the nodes, not the data
struct list *list_swap(struct list *list, struct node *a, struct node *b)
{
if (!list->head)
return NULL;
void *tmp = a->data;
a->data = b->data;
b->data = tmp;
return list;
}
struct node *list_add(struct list *list, void *data)
{
struct node *node = list_new_node();
node->data = data;
return list_add_node(list, node);
}
// Maybe list_remove_node?
struct list *list_remove(struct list *list, struct node *node)
{
if (!list->head)
return NULL;
if (list->head == node) {
list->head = list->head->next;
free(node);
return list;
}
struct node *iterator = list->head->next;
while (iterator != node) {
iterator = iterator->next;
if (!iterator)
return NULL;
}
iterator->prev->next = iterator->next;
if (iterator->next)
iterator->next->prev = iterator->prev;
free(node);
return list;
}
|
