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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
|
/*
* Copyright (c) 2017-2019 Cisco and/or its affiliates.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef UTIL_SET_H
#define UTIL_SET_H
#include <search.h>
#include <string.h>
//#if !defined(__ANDROID__) && !defined(__APPLE__)
//#include <threads.h>
//#else
#define thread_local _Thread_local
//#endif /* ! __ANDROID__ */
#include "util/log.h"
#define ERR_SET_EXISTS -2
#define ERR_SET_NOT_FOUND -3
/* FIXME: buffer overflow when this is too small... investigate */
#define BUFSIZE 1024
static inline
int
int_cmp(const int x, const int y)
{
return x - y;
}
static inline
int
int_snprintf(char * buf, size_t size, int value) {
return snprintf(buf, size, "%d", value);
}
static inline
int
string_snprintf(char * buf, size_t size, const char * s) {
return snprintf(buf, size, "%s", s);
}
static inline
int
generic_snprintf(char * buf, size_t size, const void * value) {
return snprintf(buf, BUFSIZE, "%p", value);
}
typedef int(*cmp_t)(const void * x, const void * y);
#define TYPEDEF_SET_H(NAME, T) \
\
typedef struct { \
size_t size; \
void * root; \
} NAME ## _t; \
\
int NAME ## _initialize(NAME ## _t * set); \
\
int NAME ## _finalize(NAME ## _t * set); \
\
NAME ## _t * NAME ## _create(); \
\
void NAME ## _free(NAME ## _t * set); \
\
int NAME ## _add(NAME ## _t * set, const T element); \
\
int NAME ## _remove(NAME ## _t * set, const T search, T * element); \
\
int NAME ## _get(const NAME ## _t * set, const T search, T * element); \
\
int NAME ## _get_array(const NAME ## _t * set, T ** element); \
\
void NAME ## _dump(NAME ## _t * set);
#define TYPEDEF_SET(NAME, T, CMP, SNPRINTF) \
int \
NAME ## _initialize(NAME ## _t * set) \
{ \
set->root = NULL; \
set->size = 0; \
return 0; \
} \
\
int \
NAME ## _finalize(NAME ## _t * set) { return 0; } \
\
NAME ## _t * \
NAME ## _create() \
{ \
NAME ## _t * set = malloc(sizeof(NAME ## _t)); \
if (!set) \
goto ERR_MALLOC; \
\
if (NAME ## _initialize(set) < 0) \
goto ERR_INITIALIZE; \
\
return set; \
\
ERR_INITIALIZE: \
free(set); \
ERR_MALLOC: \
return NULL; \
} \
\
void \
NAME ## _free(NAME ## _t * set) \
{ \
NAME ## _finalize(set); \
free(set); \
} \
\
int \
NAME ## _add(NAME ## _t * set, const T element) \
{ \
void * ptr = tsearch(element, &set->root, (cmp_t)CMP); \
if (!ptr) \
return -1; \
set->size++; \
return 0; \
} \
\
int \
NAME ## _remove(NAME ## _t * set, const T search, T * element) \
{ \
T * found = tfind(search, &set->root, (cmp_t)CMP); \
if (!found) \
return ERR_SET_NOT_FOUND; \
if (element) \
*element = *found; \
tdelete(search, &set->root, (cmp_t)CMP); \
set->size--; \
return 0; \
} \
\
int \
NAME ## _get(const NAME ## _t * set, const T search, T * element) \
{ \
T * found = tfind(search, &set->root, (cmp_t)CMP); \
if (element) \
*element = found ? *found : NULL; \
return 0; \
} \
\
static void \
NAME ## _dump_node(const void *nodep, const VISIT which, \
const int depth) \
{ \
char buf[BUFSIZE]; \
switch (which) { \
case preorder: \
case endorder: \
break; \
case postorder: \
case leaf: \
SNPRINTF(buf, BUFSIZE, *(T*)nodep); \
INFO("%s", buf); \
break; \
} \
} \
\
void \
NAME ## _dump(NAME ## _t * set) { \
twalk(set->root, NAME ## _dump_node); \
} \
\
thread_local \
T * NAME ## _array_pos = NULL; \
\
static void \
NAME ## _add_node_to_array(const void *nodep, const VISIT which, \
const int depth) \
{ \
if (!NAME ## _array_pos) \
return; \
switch (which) { \
case preorder: \
case endorder: \
break; \
case postorder: \
case leaf: \
*NAME ## _array_pos = *(T*)nodep; \
NAME ## _array_pos++; \
break; \
} \
} \
\
int \
NAME ## _get_array(const NAME ## _t * set, T ** element) \
{ \
*element = malloc(set->size * sizeof(T)); \
if (!*element) \
return -1; \
NAME ## _array_pos = *element; \
twalk(set->root, NAME ## _add_node_to_array); \
NAME ## _array_pos = NULL; \
return set->size; \
}
#endif /* UTIL_SET_H */
|