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
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
|
/*
* Tiny RADIUS Client Library
* Copyright (C) 2022 David M. Syzdek <david@syzdek.net>.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of David M. Syzdek nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL DAVID M. SYZDEK BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifndef __TINYRAD_INTERNAL_H
#define __TINYRAD_INTERNAL_H 1
///////////////
// //
// Headers //
// //
///////////////
#pragma mark - Headers
#include <stddef.h>
#include <inttypes.h>
#include <sys/types.h>
#include <tinyrad.h>
//////////////
// //
// Macros //
// //
//////////////
#pragma mark - Macros
///////////////////
// //
// Definitions //
// //
///////////////////
#pragma mark - Definitions
#define TRAD_LINE_MAX_LEN 256
// array function options
#define TINYRAD_ARRAY_INSERT 0x0001 ///< add type: insert unique object to sorted array
#define TINYRAD_ARRAY_REPLACE 0x0002 ///< add type: replace deplucate object in sorted array, or insert if unique
#define TINYRAD_ARRAY_MERGE 0x0004 ///< add type: add object to sorted array regardless if unique or duplicate
#define TINYRAD_ARRAY_LASTDUP 0x0010 ///< dup handling: add/return/remove last duplicate object in series of matching objects
#define TINYRAD_ARRAY_FIRSTDUP 0x0020 ///< dup handling: add/return/remove first duplicate object in series of matching objects
#define TINYRAD_ARRAY_ANYDUP 0x0040 ///< dup handling: add/return/remove any one duplicate object in series of matching objects
#define TINYRAD_ARRAY_DEFAULT ( TINYRAD_ARRAY_INSERT | TINYRAD_ARRAY_ANYDUP ) ///< default sorted array options
#define TINYRAD_ARRAY_MASK_ADD ( TINYRAD_ARRAY_INSERT | TINYRAD_ARRAY_MERGE | TINYRAD_ARRAY_REPLACE ) ///< mask for add type
#define TINYRAD_ARRAY_MASK_DUPS ( TINYRAD_ARRAY_ANYDUP | TINYRAD_ARRAY_LASTDUP | TINYRAD_ARRAY_FIRSTDUP ) ///< mask for duplicate handling in sorted array
#define TINYRAD_ARRAY_MASK ( TINYRAD_ARRAY_MASK_ACTION | TINYRAD_ARRAY_MASK_DUPS ) ///< mask of all sorted array options
/////////////////
// //
// Variables //
// //
/////////////////
#pragma mark - Variables
extern const TinyRadDictVendorDef tinyrad_dict_default_vendors[];
extern const TinyRadDictAttrDef tinyrad_dict_default_attrs[];
extern const TinyRadDictValueDef tinyrad_dict_default_values[];
//////////////////
// //
// Prototypes //
// //
//////////////////
#pragma mark - Prototypes
//------------------//
// array prototypes //
//------------------//
#pragma mark array prototypes
_TINYRAD_F ssize_t
tinyrad_array_add(
void ** basep,
size_t * nelp,
size_t width,
void * obj,
unsigned opts,
int (*compar)(const void *, const void *),
void (*freeobj)(void *),
void * (*reallocbase)(void *, size_t) );
_TINYRAD_F void *
tinyrad_array_dequeue(
void * base,
size_t * nelp,
size_t width );
_TINYRAD_F ssize_t
tinyrad_array_enqueue(
void ** basep,
size_t * nelp,
size_t width,
void * obj,
void * (*reallocbase)(void *, size_t) );
_TINYRAD_F void *
tinyrad_array_get(
void * base,
size_t nel,
size_t width,
const void * key,
unsigned opts,
int (*compar)(const void *, const void *) );
_TINYRAD_F void *
tinyrad_array_peek(
void * base,
size_t nel,
size_t width );
_TINYRAD_F void *
tinyrad_array_pop(
void * base,
size_t * nelp,
size_t width );
_TINYRAD_F ssize_t
tinyrad_array_push(
void ** basep,
size_t * nelp,
size_t width,
void * obj,
void * (*reallocbase)(void *, size_t) );
_TINYRAD_F ssize_t
tinyrad_array_remove(
void * base,
size_t * nelp,
size_t width,
const void * key,
unsigned opts,
int (*compar)(const void *, const void *),
void (*freeobj)(void *) );
_TINYRAD_F ssize_t
tinyrad_array_search(
const void * base,
size_t nel,
size_t width,
const void * key,
unsigned opts,
size_t * wouldbep,
int (*compar)(const void *, const void *) );
//------------------//
// debug prototypes //
//------------------//
#pragma mark debug prototypes
_TINYRAD_F void *
tinyrad_assertions( void );
//-----------------//
// file prototypes //
//-----------------//
#pragma mark file prototypes
_TINYRAD_F int
tinyrad_readline(
int fd,
char * str,
size_t size,
size_t * bytes_read );
//--------------------//
// strings prototypes //
//--------------------//
#pragma mark strings prototypes
_TINYRAD_F char *
tinyrad_strdup(
const char * s1 );
_TINYRAD_F char *
tinyrad_strexpand(
char * dst,
const char * restrict src,
size_t len,
int force_expansion );
_TINYRAD_F size_t
tinyrad_strlcat(
char * restrict dst,
const char * restrict src,
size_t dstsize );
_TINYRAD_F size_t
tinyrad_strlcpy(
char * restrict dst,
const char * restrict src,
size_t dstsize );
_TINYRAD_F char *
tinyrad_strndup(
const char * s1,
size_t n );
_TINYRAD_F int
tinyrad_strsadd(
char *** strsp,
const char * str );
_TINYRAD_F size_t
tinyrad_strscount(
char * const * strs );
_TINYRAD_F int
tinyrad_strsdup(
char *** dstp,
char * const * src );
_TINYRAD_F int
tinyrad_strsplit(
const char * str,
int delim,
char *** argvp,
int * argcp );
_TINYRAD_F int
tinyrad_strtoargs(
char * str,
char *** argvp,
int * argcp );
_TINYRAD_F int
tinyrad_strtobool(
const char * str );
_TINYRAD_F char *
tinyrad_strtrim(
char * str );
#endif /* end of header */
|
