Debian Codegraph @

xpp/xtalk/xlist.c

raw
1 #include <assert.h>
2 #include <stdlib.h>
3 #include <string.h>
4 #include <xtalk/xlist.h>
5 #include <autoconfig.h>
6
7 struct xlist_node *xlist_new(void *data)
8 {
9 struct xlist_node *list;
10
11 list = malloc(sizeof(*list));
12 if (!list)
13 return NULL;
14 list->next = list;
15 list->prev = list;
16 list->data = data;
17 return list;
18 }
19
20 void xlist_destroy(struct xlist_node *list, xlist_destructor_t destructor)
21 {
22 struct xlist_node *curr;
23 struct xlist_node *next;
24
25 if (!list)
26 return;
27 curr = list->next;
28 while (curr != list) {
29 next = curr->next;
30 if (destructor)
31 destructor(curr->data);
32 memset(curr, 0, sizeof(*curr));
33 free(curr);
34 curr = next;
35 }
36 memset(list, 0, sizeof(*list));
37 free(list);
38 }
39
40 void xlist_append_list(struct xlist_node *list1, struct xlist_node *list2)
41 {
42 struct xlist_node *curr;
43
44 assert(list1);
45 assert(list2);
46
47 while ((curr = xlist_shift(list2)) != NULL)
48 xlist_append_item(list1, curr);
49 }
50
51 void xlist_append_item(struct xlist_node *list, struct xlist_node *item)
52 {
53 assert(list);
54 assert(xlist_empty(item));
55 item->next = list;
56 item->prev = list->prev;
57 list->prev->next = item;
58 list->prev = item;
59 }
60
61 void xlist_prepend_item(struct xlist_node *list, struct xlist_node *item)
62 {
63 assert(list);
64 assert(xlist_empty(item));
65 item->prev = list;
66 item->next = list->next;
67 list->next->prev = item;
68 list->next = item;
69 }
70
71 void xlist_remove_item(struct xlist_node *item)
72 {
73 assert(item);
74 item->prev->next = item->next;
75 item->next->prev = item->prev;
76 item->next = item->prev = item;
77 }
78
79 struct xlist_node *xlist_shift(struct xlist_node *list)
80 {
81 struct xlist_node *item;
82
83 if (!list)
84 return NULL;
85 if (xlist_empty(list))
86 return NULL;
87 item = list->next;
88 xlist_remove_item(item);
89 return item;
90 }
91
92 int xlist_empty(const struct xlist_node *list)
93 {
94 assert(list);
95 return list->next == list && list->prev == list;
96 }
97
98 size_t xlist_length(const struct xlist_node *list)
99 {
100 struct xlist_node *curr;
101 size_t count = 0;
102
103 for (curr = list->next; curr != list; curr = curr->next)
104 count++;
105 return count;
106 }