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
|
#include "ref.h"
#include "list.h"
#include "util.h"
#include <stdlib.h>
struct ref *
ref_alloc(void *data)
{
struct ref *ref;
ref = malloc(sizeof(struct ref));
if (!ref) ERROR(SYSTEM, "malloc");
ref->link = LIST_LINK_INIT;
ref->data = data;
return ref;
}
void
ref_free(void *ref)
{
free(ref);
}
void
refs_free(struct list *list)
{
list_free_items(list, ref_free, LIST_OFFSET(struct ref, link));
}
int
refs_index(struct list *list, void *data)
{
struct list_link *iter;
struct ref *ref;
int index;
index = 0;
for (LIST_ITER(list, iter)) {
ref = LIST_UPCAST(iter, struct ref, link);
if (ref->data == data)
return index;
index++;
}
return -1;
}
struct list_link *
refs_find(struct list *list, void *data)
{
struct list_link *iter;
struct ref *ref;
for (LIST_ITER(list, iter)) {
ref = LIST_UPCAST(iter, struct ref, link);
if (ref->data == data)
return iter;
}
return NULL;
}
int
refs_incl(struct list *list, void *data)
{
struct list_link *ref;
ref = refs_find(list, data);
return ref != NULL;
}
void
refs_rm(struct list *list, void *data)
{
struct list_link *ref;
struct ref *dataref;
ref = refs_find(list, data);
if (!ref) return;
dataref = LIST_UPCAST(ref, struct ref, link);
list_link_pop(ref);
free(dataref);
}
|
