blob: 34633672610f523224acbef3967186c51ef3e783 (
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
|
/* doubly linked lists */
/* This is free software. No strings attached. No copyright claimed */
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#ifdef __dietlibc__
char *strncpy(char *dest, const char *src, size_t n) __THROW;
#endif
void *xcalloc(size_t num, size_t size);
#include "dlink.h"
void *dl_head()
{
void *h;
h = dl_alloc(0);
dl_next(h) = h;
dl_prev(h) = h;
return h;
}
void dl_free(void *v)
{
struct __dl_head *vv = v;
free(vv-1);
}
void dl_free_all(void *head)
{
/* The list head is linked with the list tail so in order to free
* all the elements properly there is a need to keep starting point.
*/
void *d = dl_next(head), *next;
while (d != head) {
next = dl_next(d);
dl_free(d);
d = next;
}
dl_free(head);
}
void dl_init(void *v)
{
dl_next(v) = v;
dl_prev(v) = v;
}
void dl_insert(void *head, void *val)
{
dl_next(val) = dl_next(head);
dl_prev(val) = head;
dl_next(dl_prev(val)) = val;
dl_prev(dl_next(val)) = val;
}
void dl_add(void *head, void *val)
{
dl_prev(val) = dl_prev(head);
dl_next(val) = head;
dl_next(dl_prev(val)) = val;
dl_prev(dl_next(val)) = val;
}
void dl_del(void *val)
{
if (dl_prev(val) == 0 || dl_next(val) == 0)
return;
dl_prev(dl_next(val)) = dl_prev(val);
dl_next(dl_prev(val)) = dl_next(val);
dl_prev(val) = dl_next(val) = 0;
}
char *dl_strndup(char *s, int l)
{
char *n;
if (s == NULL)
return NULL;
n = dl_newv(char, l+1);
strncpy(n, s, l+1);
n[l] = 0;
return n;
}
char *dl_strdup(char *s)
{
return dl_strndup(s, (int)strlen(s));
}
|
