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
|
/*
* Tiny RADIUS Client Library
* Copyright (C) 2021 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.
*/
#define _TESTS_TINYRAD_ARRAY_STACK_C 1
///////////////
// //
// Headers //
// //
///////////////
#pragma mark - Headers
#include "common.h"
#include <stdio.h>
#include <stdarg.h>
#include <stdlib.h>
#include <string.h>
#include <strings.h>
#include <unistd.h>
#include <getopt.h>
#include <assert.h>
#include <inttypes.h>
#include <tinyrad.h>
///////////////////
// //
// Definitions //
// //
///////////////////
#pragma mark - Definitions
#undef PROGRAM_NAME
#define PROGRAM_NAME "tinyrad-array-stack"
#define MY_LIST_LEN 256
//////////////////
// //
// Data Types //
// //
//////////////////
#pragma mark - Data Types
typedef struct _mydata MyData;
struct _mydata
{
char * name;
int value;
int opts;
};
/////////////////
// //
// Variables //
// //
/////////////////
#pragma mark - Variables
static const char * test_strs[] =
{
"cccccccc",
"bbbbbbbb",
"aaaaaaaa",
NULL
};
//////////////////
// //
// Prototypes //
// //
//////////////////
#pragma mark - Prototypes
int
main(
int argc,
char * argv[] );
/////////////////
// //
// Functions //
// //
/////////////////
#pragma mark - Functions
int main( int argc, char * argv[] )
{
int opt;
int c;
int opt_index;
unsigned opts;
size_t pos;
size_t len;
size_t list_len;
size_t x;
size_t y;
MyData data[MY_LIST_LEN];
MyData * src[MY_LIST_LEN];
MyData ** list;
MyData ** objp;
// getopt options
static char short_opt[] = "dhVvq";
static struct option long_opt[] =
{
{"debug", no_argument, NULL, 'd' },
{"help", no_argument, NULL, 'h' },
{"quiet", no_argument, NULL, 'q' },
{"silent", no_argument, NULL, 'q' },
{"version", no_argument, NULL, 'V' },
{"verbose", no_argument, NULL, 'v' },
{ NULL, 0, NULL, 0 }
};
trutils_initialize(PROGRAM_NAME);
opts = 0;
while((c = getopt_long(argc, argv, short_opt, long_opt, &opt_index)) != -1)
{
switch(c)
{
case -1: /* no more arguments */
case 0: /* long options toggles */
break;
case 'd':
opt = TRAD_DEBUG_ANY;
tinyrad_set_option(NULL, TRAD_OPT_DEBUG_LEVEL, &opt);
break;
case 'h':
printf("Usage: %s [OPTIONS]\n", PROGRAM_NAME);
printf("OPTIONS:\n");
printf(" -d, --debug print debug messages\n");
printf(" -h, --help print this help and exit\n");
printf(" -q, --quiet, --silent do not print messages\n");
printf(" -V, --version print version number and exit\n");
printf(" -v, --verbose print verbose messages\n");
printf("\n");
return(0);
case 'q':
opts |= TRUTILS_OPT_QUIET;
opts &= ~TRAD_TEST_VERBOSE;
break;
case 'V':
trutils_version();
return(0);
case 'v':
opts |= TRAD_TEST_VERBOSE;
opts &= ~TRUTILS_OPT_QUIET;
break;
case '?':
fprintf(stderr, "Try `%s --help' for more information.\n", PROGRAM_NAME);
return(1);
default:
fprintf(stderr, "%s: unrecognized option `--%c'\n", PROGRAM_NAME, c);
fprintf(stderr, "Try `%s --help' for more information.\n", PROGRAM_NAME);
return(1);
};
};
if (optind != argc)
{
fprintf(stderr, "%s: unknown argument `--%s'\n", PROGRAM_NAME, argv[optind]);
fprintf(stderr, "Try `%s --help' for more information.\n", PROGRAM_NAME);
return(1);
};
// initialize test data
our_verbose(opts, "initializing test data ...");
memset(data, 0, sizeof(data));
for(len = 0; ((test_strs[len])); len++);
for(pos = 0; (pos < MY_LIST_LEN); pos++)
{
data[pos].value = (int)(~pos);
data[pos].opts = (int)pos;
data[pos].name = (pos < len) ? strdup(test_strs[pos]) : our_random_str(8, 8);
if (!(data[pos].name))
{
for(; (pos > 0); pos--)
free(data[pos-1].name);
return(our_error(opts, NULL, "out of virtual memory"));
};
};
// populate src and test arrays
for(pos = 0; (pos < MY_LIST_LEN); pos++)
src[pos] = &data[pos];
// loop through test data and add to stack
our_verbose(opts, "pushing to stack ...");
list = NULL;
list_len = 0;
for(x = 0; (x < MY_LIST_LEN); x++)
{
// periodically pop data
if ((x % 4) == 3)
{
if ((objp = tinyrad_array_pop(list, &list_len, sizeof(MyData *))) == NULL)
return(our_error(opts, NULL, "unable to pop from stack"));
if ((strcasecmp(src[x-1]->name, (*objp)->name)))
return(our_error(opts, NULL, "str of pop object is incorrect"));
};
// adds objects to stack
if (tinyrad_array_push((void **)&list, &list_len, sizeof(MyData *), &src[x], &realloc) == -1)
return(our_error(opts, NULL, "failed to push object to stack"));
};
// loop through stack and verify data
our_verbose(opts, "verifing stack ...");
if (list_len != ((MY_LIST_LEN / 4) * 3))
return(our_error(opts, NULL, "stack length is incorrect"));
for(x = 0, y = 0; (x < MY_LIST_LEN); x++)
{
if ((x % 4) == 2)
continue;
if ((strcmp(src[x]->name, list[y]->name)))
return(our_error(opts, NULL, "stack data does not match test data"));
y++;
};
// pop data from stack
our_verbose(opts, "popping from stack ...");
while (list_len > 0)
if (tinyrad_array_pop(list, &list_len, sizeof(MyData *)) == NULL)
return(our_error(opts, NULL, "unable to pop from stack"));
return(0);
}
/* end of source */
|