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
|
/* radare - LGPL - Copyright 2010-2013 - pancake */
// XXX. this is dupped inside the r_flist.h for optimizations
int r_flist_iterator(void **x) {
return *x!=0;
}
void** r_flist_next(void **x) {
return x;
}
void** r_flist_get(void **x) {
return *(x++);
}
// XXX: forced free?? We need RFlist struct here
#include <r_types.h>
//#include <r_flist.h>
// NOTE: reimplemnetation of r_flist in C (if no R_API defined)
#if 1
#define r_flist_t void**
#define RFList void**
#define r_flist_rewind(it) for (; it!=*it; it--); it++
#define r_flist_next(it) *it!=0
#define r_flist_get(it) *(it++)
#define r_flist_iterator(x) x
#define r_flist_unref(x) x
#endif
R_API void **r_flist_new(int n) {
void **it;
if (!(it = (void **)malloc ((n+2) * sizeof (void*))))
return NULL;
*it = it;
memset (++it, 0, (n+1) * sizeof (void*));
return it;
}
// XXX. this is wrong :?
R_API void **r_flist_resize(void **it, int n) {
r_flist_rewind (it);
it--;
it = realloc (it, ((n+2) * sizeof (void*)));
*it = it;
return it+1;
}
R_API void **r_flist_prev(void **it) {
void **p = it--;
return (it==*it)?p:it;
}
R_API void r_flist_set(void **it, int idx, void *data) {
r_flist_rewind (it);
it[idx] = data;
}
R_API void r_flist_delete(void **it, int idx) {
r_flist_rewind (it);
free (it[idx]);
it[idx] = NULL;
for (it += idx; *it; it++) *it = *(it+1);
}
#define r_flist_foreach(it, pos) \
r_flist_rewind(it); \
while (r_flist_next (it) && (pos = r_flist_get (it)))
R_API void r_flist_free(void **it) {
void *pos;
r_flist_foreach (it, pos)
free (pos);
r_flist_rewind (it);
free (--it);
}
R_API int r_flist_length (void **it) {
void *pos;
int len = 0;
r_flist_foreach (it, pos)
len++;
return len;
}
|
