-
Notifications
You must be signed in to change notification settings - Fork 64
/
conf.c
872 lines (758 loc) · 18.6 KB
/
conf.c
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
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
/* $OpenBSD: conf.c,v 1.24 2000/10/27 19:22:36 niklas Exp $ */
/* $EOM: conf.c,v 1.46 2000/10/26 16:17:19 ho Exp $ */
/*
* Copyright (c) 1998, 1999, 2000 Niklas Hallqvist. All rights reserved.
* Copyright (c) 2000 Håkan Olsson. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Ericsson Radio Systems.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 THE AUTHOR 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.
*/
/*
* This code was written under funding by Ericsson Radio Systems.
*/
#include <sys/types.h>
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif /* HAVE_CONFIG_H */
#ifndef WIN32
#include <sys/param.h>
#include <sys/mman.h>
#endif /* WIN32 */
#include <sys/stat.h>
#include <sys/queue.h>
#include <ctype.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <errno.h>
#ifdef HAVE_ERR
#include <err.h>
#endif /* HAVE_ERR */
#include "conf.h"
struct conf_trans {
TAILQ_ENTRY (conf_trans) link;
int trans;
enum conf_op { CONF_SET, CONF_REMOVE, CONF_REMOVE_SECTION } op;
char *section;
char *tag;
char *value;
int override;
int is_default;
};
TAILQ_HEAD (conf_trans_head, conf_trans) conf_trans_queue;
/*
* Radix-64 Encoding.
*/
const u_int8_t bin2asc[]
= "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
const u_int8_t asc2bin[] =
{
255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 62, 255, 255, 255, 63,
52, 53, 54, 55, 56, 57, 58, 59,
60, 61, 255, 255, 255, 255, 255, 255,
255, 0, 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, 255, 255, 255, 255, 255,
255, 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, 255, 255, 255, 255, 255
};
struct conf_binding {
LIST_ENTRY (conf_binding) link;
char *section;
char *tag;
char *value;
int is_default;
};
extern char *conf_path;
LIST_HEAD (conf_bindings, conf_binding) conf_bindings[256];
static char *conf_addr;
static __inline__ u_int8_t
conf_hash(char *s)
{
u_int8_t hash = 0;
while (*s) {
hash = ((hash << 1) | (hash >> 7)) ^ tolower (*s);
s++;
}
return (hash);
}
/*
* Insert a tag-value combination from LINE (the equal sign is at POS)
*/
static int
conf_remove_now(char *section, char *tag)
{
struct conf_binding *cb, *next;
for (cb = LIST_FIRST (&conf_bindings[conf_hash (section)]); cb;
cb = next) {
next = LIST_NEXT (cb, link);
if (strcasecmp (cb->section, section) == 0
&& strcasecmp (cb->tag, tag) == 0) {
LIST_REMOVE (cb, link);
free (cb->section);
free (cb->tag);
free (cb->value);
free (cb);
return (0);
}
}
return (1);
}
static int
conf_remove_section_now (char *section)
{
struct conf_binding *cb, *next;
int unseen = 1;
for (cb = LIST_FIRST (&conf_bindings[conf_hash (section)]); cb;
cb = next) {
next = LIST_NEXT (cb, link);
if (strcasecmp (cb->section, section) == 0) {
unseen = 0;
LIST_REMOVE (cb, link);
free (cb->section);
free (cb->tag);
free (cb->value);
free (cb);
}
}
return (unseen);
}
/*
* Insert a tag-value combination from LINE (the equal sign is at POS)
* into SECTION of our configuration database.
*/
static int
conf_set_now (char *section, char *tag, char *value, int override,
int is_default)
{
struct conf_binding *node = 0;
if (override)
conf_remove_now (section, tag);
else if (conf_get_str (section, tag)) {
if (!is_default)
warnx("conf_set: duplicate tag [%s]:%s, ignoring...\n",
section, tag);
return (1);
}
node = calloc (1, sizeof *node);
if (!node) {
warn("conf_set: calloc (1, %d) failed", sizeof *node);
return (1);
}
node->section = strdup (section);
node->tag = strdup (tag);
node->value = strdup (value);
node->is_default = is_default;
LIST_INSERT_HEAD (&conf_bindings[conf_hash (section)], node, link);
return (0);
}
/*
* Parse the line LINE of SZ bytes. Skip Comments, recognize section
* headers and feed tag-value pairs into our configuration database.
*/
static void
conf_parse_line (int trans, char *line, size_t sz)
{
char *cp = line;
int i;
static char *section = 0;
static int ln = 0;
ln++;
/* Lines starting with '#' or ';' are comments. */
if (*line == '#' || *line == ';')
return;
/* '[section]' parsing... */
if (*line == '[') {
for (i = 1; i < sz; i++)
if (line[i] == ']')
break;
if (i == sz) {
warnx("conf_parse_line: %d:"
"non-matched ']', ignoring until next section",
ln);
section = 0;
return;
}
if (section)
free (section);
section = malloc (i);
strncpy (section, line + 1, i - 1);
section[i - 1] = '\0';
return;
}
/* Deal with assignments. */
for (i = 0; i < sz; i++)
if (cp[i] == '=') {
/* If no section, we are ignoring the lines. */
if (!section) {
warnx("conf_parse_line: %d: ignoring line due to no section",
ln);
return;
}
line[strcspn (line, " \t=")] = '\0';
/* XXX Perhaps should we not ignore errors? */
conf_set (trans, section, line,
line + i + 1 + strspn (line + i + 1, " \t"), 0, 0);
return;
}
/* Other non-empty lines are wierd. */
i = strspn (line, " \t");
if (line[i])
warnx("conf_parse_line: %d: syntax error", ln);
return;
}
/* Parse the mapped configuration file. */
static void
conf_parse (int trans, char *buf, size_t sz)
{
char *cp = buf;
char *bufend = buf + sz;
char *line;
line = cp;
while (cp < bufend) {
if (*cp == '\n') {
/* Check for escaped newlines. */
if (cp > buf && *(cp - 1) == '\\')
*(cp - 1) = *cp = ' ';
else {
*cp = '\0';
conf_parse_line (trans, line, cp - line);
line = cp + 1;
}
}
cp++;
}
if (cp != line)
warnx("conf_parse: last line non-terminated, ignored.");
}
void
conf_load_defaults (int tr)
{
/* No defaults so far *
conf_set (tr, "General", "Port", "80", 0, 1);
conf_set (tr, "General", "IP-Address", "0.0.0.0", 0, 1);
*/
return;
}
void
conf_init (void)
{
int i;
for (i = 0; i < sizeof conf_bindings / sizeof conf_bindings[0]; i++)
LIST_INIT (&conf_bindings[i]);
TAILQ_INIT (&conf_trans_queue);
conf_reinit ();
}
/* Open the config file and map it into our address space, then parse it. */
void
conf_reinit (void)
{
struct conf_binding *cb = 0;
int fd, i, trans;
off_t sz;
char *new_conf_addr = 0;
struct stat sb;
if ((stat (conf_path, &sb) == 0) || (errno != ENOENT)) {
sz = sb.st_size;
fd = open (conf_path, O_RDONLY);
if (fd == -1) {
warn("conf_reinit: open (\"%s\", O_RDONLY) failed",
conf_path);
return;
}
new_conf_addr = malloc (sz);
if (!new_conf_addr) {
warn("conf_reinit: malloc (%d) failed", (int)sz);
goto fail;
}
/* XXX I assume short reads won't happen here. */
if (read(fd, new_conf_addr, sz) != sz) {
warn("conf_reinit: read (%d, %p, %d) failed",
fd, new_conf_addr, (int)sz);
goto fail;
}
close (fd);
trans = conf_begin ();
/* XXX Should we not care about errors and rollback? */
conf_parse (trans, new_conf_addr, sz);
}
else
trans = conf_begin ();
/* Load default configuration values. */
conf_load_defaults (trans);
/* Free potential existing configuration. */
if (conf_addr) {
for (i = 0;
i < sizeof conf_bindings / sizeof conf_bindings[0]; i++)
for (cb = LIST_FIRST (&conf_bindings[i]); cb;
cb = LIST_FIRST (&conf_bindings[i]))
conf_remove_now (cb->section, cb->tag);
free (conf_addr);
}
conf_end (trans, 1);
conf_addr = new_conf_addr;
return;
fail:
if (new_conf_addr)
free (new_conf_addr);
close (fd);
}
/*
* Return the numeric value denoted by TAG in section SECTION or DEF
* if that tag does not exist.
*/
int
conf_get_num (char *section, char *tag, int def)
{
char *value = conf_get_str (section, tag);
if (value)
return (atoi (value));
return (def);
}
double
conf_get_fnum (char *section, char *tag, double def)
{
char *value = conf_get_str (section, tag);
if (value)
return (strtod(value, (char **)NULL));
return (def);
}
/* Validate X according to the range denoted by TAG in section SECTION. */
int
conf_match_num (char *section, char *tag, int x)
{
char *value = conf_get_str (section, tag);
int val, min, max, n;
if (!value)
return (0);
n = sscanf (value, "%d,%d:%d", &val, &min, &max);
switch (n) {
case 1:
return (x == val);
case 3:
return (min <= x && max >= x);
default:
warn("conf_match_num: section %s tag %s: "
"invalid number spec %s", section, tag, value);
}
return (0);
}
/* Return the string value denoted by TAG in section SECTION. */
char *
conf_get_str (char *section, char *tag)
{
struct conf_binding *cb;
for (cb = LIST_FIRST (&conf_bindings[conf_hash (section)]); cb;
cb = LIST_NEXT (cb, link))
if (strcasecmp (section, cb->section) == 0
&& strcasecmp (tag, cb->tag) == 0)
return (cb->value);
return (0);
}
/*
* Build a list of string values out of the comma separated value denoted by
* TAG in SECTION.
*/
struct conf_list *
conf_get_list (char *section, char *tag)
{
char *liststr = 0, *p, *field;
struct conf_list *list = 0;
struct conf_list_node *node;
list = malloc (sizeof *list);
if (!list)
goto cleanup;
TAILQ_INIT (&list->fields);
list->cnt = 0;
liststr = conf_get_str (section, tag);
if (!liststr)
goto cleanup;
liststr = strdup (liststr);
if (!liststr)
goto cleanup;
p = liststr;
while ((field = (char*)strsep (&p, ", \t")) != NULL) {
if (*field == '\0') {
warnx("conf_get_list: empty field, ignoring...");
continue;
}
list->cnt++;
node = calloc (1, sizeof *node);
if (!node)
goto cleanup;
node->field = strdup (field);
if (!node->field)
goto cleanup;
TAILQ_INSERT_TAIL (&list->fields, node, link);
}
free (liststr);
return (list);
cleanup:
if (list)
conf_free_list (list);
if (liststr)
free (liststr);
return (0);
}
struct conf_list *
conf_get_tag_list (char *section)
{
struct conf_list *list = 0;
struct conf_list_node *node;
struct conf_binding *cb;
list = malloc (sizeof *list);
if (!list)
goto cleanup;
TAILQ_INIT (&list->fields);
list->cnt = 0;
for (cb = LIST_FIRST (&conf_bindings[conf_hash (section)]); cb;
cb = LIST_NEXT (cb, link))
if (strcasecmp (section, cb->section) == 0) {
list->cnt++;
node = calloc (1, sizeof *node);
if (!node)
goto cleanup;
node->field = strdup (cb->tag);
if (!node->field)
goto cleanup;
TAILQ_INSERT_TAIL (&list->fields, node, link);
}
return (list);
cleanup:
if (list)
conf_free_list (list);
return (0);
}
/* Decode a PEM encoded buffer. */
int
conf_decode_base64 (u_int8_t *out, u_int32_t *len, u_char *buf)
{
u_int32_t c = 0;
u_int8_t c1, c2, c3, c4;
while (*buf) {
if (*buf > 127 || (c1 = asc2bin[*buf]) == 255)
return (0);
buf++;
if (*buf > 127 || (c2 = asc2bin[*buf]) == 255)
return (0);
buf++;
if (*buf == '=') {
c3 = c4 = 0;
c++;
/* Check last four bit */
if (c2 & 0xF)
return (0);
if (!strcmp (buf, "=="))
buf++;
else
return (0);
}
else if (*buf > 127 || (c3 = asc2bin[*buf]) == 255)
return (0);
else {
if (*++buf == '=') {
c4 = 0;
c += 2;
/* Check last two bit */
if (c3 & 3)
return (0);
if (strcmp (buf, "="))
return (0);
}
else if (*buf > 127 || (c4 = asc2bin[*buf]) == 255)
return (0);
else
c += 3;
}
buf++;
*out++ = (c1 << 2) | (c2 >> 4);
*out++ = (c2 << 4) | (c3 >> 2);
*out++ = (c3 << 6) | c4;
}
*len = c;
return (1);
}
/* Read a line from a stream to the buffer. */
int
conf_get_line (FILE *stream, char *buf, u_int32_t len)
{
int c;
while (len-- > 1) {
c = fgetc (stream);
if (c == '\n') {
*buf = 0;
return (1);
}
else if (c == EOF)
break;
*buf++ = c;
}
*buf = 0;
return (0);
}
void
conf_free_list (struct conf_list *list)
{
struct conf_list_node *node = TAILQ_FIRST (&list->fields);
while (node) {
TAILQ_REMOVE (&list->fields, node, link);
if (node->field)
free (node->field);
free (node);
node = TAILQ_FIRST (&list->fields);
}
free (list);
}
int
conf_begin (void)
{
static int seq = 0;
return (++seq);
}
static struct conf_trans *
conf_trans_node (int transaction, enum conf_op op)
{
struct conf_trans *node;
node = calloc (1, sizeof *node);
if (!node) {
warn("conf_trans_node: calloc (1, %d) failed", sizeof *node);
return (0);
}
node->trans = transaction;
node->op = op;
TAILQ_INSERT_TAIL (&conf_trans_queue, node, link);
return (node);
}
/* Queue a set operation. */
int
conf_set (int transaction, char *section, char *tag, char *value, int override,
int is_default)
{
struct conf_trans *node;
node = conf_trans_node (transaction, CONF_SET);
if (!node)
return (1);
node->section = strdup (section);
if (!node->section) {
warn("conf_set: strdup (\"%s\") failed", section);
goto fail;
}
node->tag = strdup (tag);
if (!node->tag) {
warn("conf_set: strdup (\"%s\") failed", tag);
goto fail;
}
node->value = strdup (value);
if (!node->value) {
warn("conf_set: strdup (\"%s\") failed", value);
goto fail;
}
node->override = override;
node->is_default = is_default;
return (0);
fail:
if (node->tag)
free (node->tag);
if (node->section)
free (node->section);
if (node)
free (node);
return (1);
}
/* Queue a remove operation. */
int
conf_remove (int transaction, char *section, char *tag)
{
struct conf_trans *node;
node = conf_trans_node (transaction, CONF_REMOVE);
if (!node)
goto fail;
node->section = strdup (section);
if (!node->section) {
warn("conf_remove: strdup (\"%s\") failed", section);
goto fail;
}
node->tag = strdup (tag);
if (!node->tag) {
warn("conf_remove: strdup (\"%s\") failed", tag);
goto fail;
}
return (0);
fail:
if (node->section)
free (node->section);
if (node)
free (node);
return (1);
}
/* Queue a remove section operation. */
int
conf_remove_section (int transaction, char *section)
{
struct conf_trans *node;
node = conf_trans_node (transaction, CONF_REMOVE_SECTION);
if (!node)
goto fail;
node->section = strdup (section);
if (!node->section) {
warn("conf_remove_section: strdup (\"%s\") failed", section);
goto fail;
}
return (0);
fail:
if (node)
free (node);
return (1);
}
/* Execute all queued operations for this transaction. Cleanup. */
int
conf_end (int transaction, int commit)
{
struct conf_trans *node, *next;
for (node = TAILQ_FIRST (&conf_trans_queue); node; node = next) {
next = TAILQ_NEXT (node, link);
if (node->trans == transaction) {
if (commit)
switch (node->op) {
case CONF_SET:
conf_set_now (node->section, node->tag, node->value,
node->override, node->is_default);
break;
case CONF_REMOVE:
conf_remove_now (node->section, node->tag);
break;
case CONF_REMOVE_SECTION:
conf_remove_section_now (node->section);
break;
default:
warnx("conf_end: unknown operation: %d", node->op);
}
TAILQ_REMOVE (&conf_trans_queue, node, link);
if (node->section)
free (node->section);
if (node->tag)
free (node->tag);
if (node->value)
free (node->value);
free (node);
}
}
return (0);
}
/* Dump running configuration upon SIGUSR1. */
/* XXX Configuration is "stored in reverse order", so reverse it. */
struct dumper {
char *s, *v;
struct dumper *next;
};
static void
conf_report_dump (struct dumper *node)
{
/* Recursive, cleanup when we're done. */
if (node->next)
conf_report_dump (node->next);
if (node->v)
fprintf(stderr, "%s=\t%s", node->s, node->v);
else if (node->s) {
fprintf(stderr, "%s", node->s);
if (strlen (node->s) > 0)
free (node->s);
}
free (node);
}
void
conf_report (void)
{
struct conf_binding *cb, *last = NULL;
int i;
char *current_section = (char *)0;
struct dumper *dumper, *dnode;
dumper = dnode = (struct dumper *)calloc (1, sizeof *dumper);
if (!dumper)
goto mem_fail;
fprintf(stderr, "conf_report: dumping running configuration");
for (i = 0; i < sizeof conf_bindings / sizeof conf_bindings[0]; i++)
for (cb = LIST_FIRST (&conf_bindings[i]); cb;
cb = LIST_NEXT (cb, link)) {
if (!cb->is_default) {
/* Dump this entry */
if (!current_section ||
strcmp (cb->section, current_section)) {
if (current_section) {
dnode->s = malloc (strlen (current_section) + 3);
if (!dnode->s)
goto mem_fail;
sprintf (dnode->s, "[%s]", current_section);
dnode->next
= (struct dumper *)calloc (1, sizeof (struct dumper));
dnode = dnode->next;
if (!dnode)
goto mem_fail;
dnode->s = "";
dnode->next
= (struct dumper *)calloc (1, sizeof (struct dumper));
dnode = dnode->next;
if (!dnode)
goto mem_fail;
}
current_section = cb->section;
}
dnode->s = cb->tag;
dnode->v = cb->value;
dnode->next = (struct dumper *)calloc (1, sizeof (struct dumper));
dnode = dnode->next;
if (!dnode)
goto mem_fail;
last = cb;
}
}
if (last) {
dnode->s = malloc (strlen (last->section) + 3);
if (!dnode->s)
goto mem_fail;
sprintf (dnode->s, "[%s]", last->section);
}
conf_report_dump (dumper);
return;
mem_fail:
warn("conf_report: memory allocation failure.");
while ((dnode = dumper) != NULL) {
dumper = dumper->next;
if (dnode->s)
free (dnode->s);
free (dnode);
}
return;
}