blob: c36d6e1a9f97d68c26b243d7e0147c54d86d45a7 (
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
|
// MIT License, Copyright (c) 2020 Marvin Borner
#include <def.h>
#include <list.h>
#include <mem.h>
static int nonce = 0;
struct list *list_new()
{
struct list *list = malloc(sizeof(*list));
list->head = NULL;
return list;
}
struct node *list_new_node()
{
struct node *node = malloc(sizeof(*node));
node->data = NULL;
node->prev = NULL;
node->next = NULL;
node->nonce = nonce++;
return node;
}
void list_add_node(struct list *list, struct node *node)
{
if (list == NULL)
return;
if (list->head == NULL) {
list->head = node;
return;
}
struct node *iterator = list->head;
while (iterator != NULL) {
if (iterator->next == NULL) {
iterator->next = node;
node->prev = iterator;
break;
}
iterator = iterator->next;
}
}
void list_add(struct list *list, void *data)
{
struct node *node = list_new_node();
node->data = data;
list_add_node(list, node);
}
// Maybe list_remove_node?
void list_remove(struct list *list, struct node *node)
{
if (list == NULL || list->head == NULL)
return;
if (list->head == node) {
list->head = list->head->next;
return;
}
struct node *iterator = list->head->next;
while (iterator != node) {
iterator = iterator->next;
if (iterator == NULL)
return;
}
iterator->prev->next = iterator->next;
iterator->next->prev = iterator->prev;
}
|
