blob: 58510ac50e7a2dcbb3211cb737d479234d1ba383 (
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
|
#include "list.h"
#include <stdlib.h>
#include <string.h>
void list_init(struct list *list)
{
memset(list, 0, sizeof(*list));
}
struct list *list_new(void *data)
{
struct list *list = calloc(1, sizeof(*list));
list->data = data;
return list;
}
struct list *list_append(struct list *list, void *data)
{
if (list == NULL)
{
return list_new(data);
}
struct list *last = list_get_last(list);
list = list_new(data);
last->next = list;
return list;
}
struct list *list_get_last(struct list *list)
{
while (list && list->next)
list = list->next;
return list;
}
struct list *list_pop_front(struct list **list)
{
struct list *popped = *list;
if (!popped)
return NULL;
*list = popped->next;
popped->next = NULL;
return popped;
}
void list_free(struct list *list, list_free_cb free_cb, void *userdata)
{
struct list *popped;
while ((popped = list_pop_front(&list)) != NULL)
{
if (free_cb)
free_cb(popped->data, userdata);
free(popped);
}
}
#ifdef BUILD_TEST
#include "test_util.h"
TEST(list_init)
{
}
TEST(list_new)
{
}
TEST(list_append)
{
}
TEST(list_get_last)
{
}
TEST(list_pop_front)
{
}
TEST(list_free)
{
}
#endif
|
