forked from pbatard/libwdi
-
Notifications
You must be signed in to change notification settings - Fork 1
/
profile.c
1580 lines (1417 loc) · 35.5 KB
/
profile.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
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* profile.c -- A simple configuration file parsing "library in a file"
*
* The profile library was originally written by Theodore Ts'o in 1995
* for use in the MIT Kerberos v5 library. It has been
* modified/enhanced/bug-fixed over time by other members of the MIT
* Kerberos team. This version was originally taken from the Kerberos
* v5 distribution, version 1.4.2, and radically simplified for use in
* e2fsprogs. (Support for locking for multi-threaded operations,
* being able to modify and update the configuration file
* programmatically, and Mac/Windows portability have been removed.
* It has been folded into a single C source file to make it easier to
* fold into an application program.)
*
* Copyright (C) 2005, 2006 by Theodore Ts'o.
*
* %Begin-Header%
* This file may be redistributed under the terms of the GNU Public
* License.
* %End-Header%
*
* Copyright (C) 1985-2005 by the Massachusetts Institute of Technology.
*
* All rights reserved.
*
* Export of this software from the United States of America may require
* a specific license from the United States Government. It is the
* responsibility of any person or organization contemplating export to
* obtain such a license before exporting.
*
* WITHIN THAT CONSTRAINT, permission to use, copy, modify, and
* distribute this software and its documentation for any purpose and
* without fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright notice and
* this permission notice appear in supporting documentation, and that
* the name of M.I.T. not be used in advertising or publicity pertaining
* to distribution of the software without specific, written prior
* permission. Furthermore if you modify this software you must label
* your software as modified software and not distribute it in such a
* fashion that it might be confused with the original MIT software.
* M.I.T. makes no representations about the suitability of this software
* for any purpose. It is provided "as is" without express or implied
* warranty.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
* WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
#include <errno.h>
#include <ctype.h>
#include <limits.h>
#include "profile.h"
#if defined(_MSC_VER)
#define strcasecmp _stricmp
#endif
/*
* prof_int.h
*/
typedef long prf_magic_t;
/*
* This is the structure which stores the profile information for a
* particular configuration file.
*/
struct _prf_file_t {
prf_magic_t magic;
char *filespec;
#ifdef STAT_ONCE_PER_SECOND
time_t last_stat;
#endif
time_t timestamp; /* time tree was last updated from file */
int flags; /* r/w, dirty */
int upd_serial; /* incremented when data changes */
struct profile_node *root;
struct _prf_file_t *next;
};
typedef struct _prf_file_t *prf_file_t;
/*
* The profile flags
*/
#define PROFILE_FILE_RW 0x0001
#define PROFILE_FILE_DIRTY 0x0002
#define PROFILE_FILE_NO_RELOAD 0x0004
/*
* This structure defines the high-level, user visible profile_t
* object, which is used as a handle by users who need to query some
* configuration file(s)
*/
struct _profile_t {
prf_magic_t magic;
prf_file_t first_file;
};
/*
* Used by the profile iterator in prof_get.c
*/
#define PROFILE_ITER_LIST_SECTION 0x0001
#define PROFILE_ITER_SECTIONS_ONLY 0x0002
#define PROFILE_ITER_RELATIONS_ONLY 0x0004
#define PROFILE_ITER_FINAL_SEEN 0x0100
/*
* Check if a filespec is last in a list (NULL on UNIX, invalid FSSpec on MacOS
*/
#define PROFILE_LAST_FILESPEC(x) (((x) == NULL) || ((x)[0] == '\0'))
#define CHECK_MAGIC(node) \
if ((node)->magic != PROF_MAGIC_NODE) \
return PROF_MAGIC_NODE;
/* profile parser declarations */
struct parse_state {
int state;
int group_level;
int line_num;
struct profile_node *root_section;
struct profile_node *current_section;
};
static const char *default_filename = "<default>";
static profile_syntax_err_cb_t syntax_err_cb;
static long parse_line(char *line, struct parse_state *state);
#ifdef PROFILE_DEBUG
static long profile_write_tree_file
(struct profile_node *root, FILE *dstfile);
#endif
static void profile_free_node
(struct profile_node *relation);
static long profile_create_node
(const char *name, const char *value,
struct profile_node **ret_node);
#ifdef PROFILE_DEBUG
static long profile_verify_node
(struct profile_node *node);
#endif
static long profile_add_node
(struct profile_node *section,
const char *name, const char *value,
struct profile_node **ret_node);
static long profile_find_node
(struct profile_node *section,
const char *name, const char *value,
int section_flag, void **state,
struct profile_node **node);
static long profile_node_iterator
(void **iter_p, struct profile_node **ret_node,
char **ret_name, char **ret_value);
static long profile_open_file
(const char * file, prf_file_t *ret_prof);
static long profile_update_file
(prf_file_t prf);
static void profile_free_file
(prf_file_t profile);
static long profile_get_value(profile_t profile, const char *name,
const char *subname, const char *subsubname,
const char **ret_value);
long
profile_open(const char* filename, profile_t *ret_profile)
{
profile_t profile;
long retval = 0;
profile = malloc(sizeof(struct _profile_t));
if (!profile)
return ENOMEM;
memset(profile, 0, sizeof(struct _profile_t));
profile->magic = PROF_MAGIC_PROFILE;
retval = profile_open_file(filename, &profile->first_file);
if (retval) {
profile_close(profile);
return retval;
}
*ret_profile = profile;
return 0;
}
void
profile_close(profile_t profile)
{
prf_file_t p, next;
if (!profile || profile->magic != PROF_MAGIC_PROFILE)
return;
for (p = profile->first_file; p; p = next) {
next = p->next;
profile_free_file(p);
}
profile->magic = 0;
free(profile);
}
/*
* prof_file.c ---- routines that manipulate an individual profile file.
*/
long profile_open_file(const char * filespec,
prf_file_t *ret_prof)
{
prf_file_t prf;
long retval;
char *home_env = 0;
unsigned int len;
char *expanded_filename;
prf = malloc(sizeof(struct _prf_file_t));
if (!prf)
return ENOMEM;
memset(prf, 0, sizeof(struct _prf_file_t));
prf->magic = PROF_MAGIC_FILE;
len = (unsigned int)strlen(filespec)+1;
if (filespec[0] == '~' && filespec[1] == '/') {
home_env = getenv("HOME");
if (home_env)
len += (unsigned int)strlen(home_env);
}
expanded_filename = malloc(len);
if (expanded_filename == 0) {
profile_free_file(prf);
return errno;
}
if (home_env) {
strcpy(expanded_filename, home_env);
strcat(expanded_filename, filespec+1);
} else
memcpy(expanded_filename, filespec, len);
prf->filespec = expanded_filename;
if (strcmp(prf->filespec, default_filename) != 0) {
retval = profile_update_file(prf);
if (retval) {
profile_free_file(prf);
return retval;
}
}
*ret_prof = prf;
return 0;
}
long profile_update_file(prf_file_t prf)
{
long retval;
FILE *f;
char buf[2048];
struct parse_state state;
if (prf->flags & PROFILE_FILE_NO_RELOAD)
return 0;
if (prf->root) {
return 0;
}
memset(&state, 0, sizeof(struct parse_state));
retval = profile_create_node("(root)", 0, &state.root_section);
if (retval)
return retval;
errno = 0;
f = fopen(prf->filespec, "r");
if (f == NULL) {
retval = errno;
if (retval == 0)
retval = ENOENT;
return retval;
}
prf->upd_serial++;
while (!feof(f)) {
if (fgets(buf, sizeof(buf), f) == NULL)
break;
retval = parse_line(buf, &state);
if (retval) {
if (syntax_err_cb)
(syntax_err_cb)(prf->filespec, retval,
state.line_num);
fclose(f);
return retval;
}
}
prf->root = state.root_section;
fclose(f);
return 0;
}
void profile_free_file(prf_file_t prf)
{
if (prf->root)
profile_free_node(prf->root);
free(prf->filespec);
free(prf);
}
/* Begin the profile parser */
profile_syntax_err_cb_t profile_set_syntax_err_cb(profile_syntax_err_cb_t hook)
{
profile_syntax_err_cb_t old;
old = syntax_err_cb;
syntax_err_cb = hook;
return(old);
}
#define STATE_INIT_COMMENT 0
#define STATE_STD_LINE 1
#define STATE_GET_OBRACE 2
static char *skip_over_blanks(char *cp)
{
while (*cp && isspace((int) (*cp)))
cp++;
return cp;
}
static int end_or_comment(char ch)
{
return (ch == 0 || ch == '#' || ch == ';');
}
static char *skip_over_nonblanks(char *cp)
{
while (!end_or_comment(*cp) && !isspace(*cp))
cp++;
return cp;
}
static void strip_line(char *line)
{
char *p = line + strlen(line);
while (p > line && (p[-1] == '\n' || p[-1] == '\r'))
*p-- = 0;
}
static void parse_quoted_string(char *str)
{
char *to, *from;
for (to = from = str; *from && *from != '"'; to++, from++) {
if (*from == '\\') {
from++;
switch (*from) {
case 'n':
*to = '\n';
break;
case 't':
*to = '\t';
break;
case 'b':
*to = '\b';
break;
default:
*to = *from;
}
continue;
}
*to = *from;
}
*to = '\0';
}
static long parse_line(char *line, struct parse_state *state)
{
char *cp, ch, *tag, *value;
char *p;
long retval;
struct profile_node *node;
int do_subsection = 0;
void *iter = 0;
state->line_num++;
if (state->state == STATE_GET_OBRACE) {
cp = skip_over_blanks(line);
if (*cp != '{')
return PROF_MISSING_OBRACE;
state->state = STATE_STD_LINE;
return 0;
}
if (state->state == STATE_INIT_COMMENT) {
if (line[0] != '[')
return 0;
state->state = STATE_STD_LINE;
}
if (*line == 0)
return 0;
strip_line(line);
cp = skip_over_blanks(line);
ch = *cp;
if (end_or_comment(ch))
return 0;
if (ch == '[') {
if (state->group_level > 0)
return PROF_SECTION_NOTOP;
cp++;
cp = skip_over_blanks(cp);
p = strchr(cp, ']');
if (p == NULL)
return PROF_SECTION_SYNTAX;
if (*cp == '"') {
cp++;
parse_quoted_string(cp);
} else {
*p-- = '\0';
while (isspace(*p) && (p > cp))
*p-- = '\0';
if (*cp == 0)
return PROF_SECTION_SYNTAX;
}
retval = profile_find_node(state->root_section, cp, 0, 1,
&iter, &state->current_section);
if (retval == PROF_NO_SECTION) {
retval = profile_add_node(state->root_section,
cp, 0,
&state->current_section);
if (retval)
return retval;
} else if (retval)
return retval;
/*
* Finish off the rest of the line.
*/
cp = p+1;
if (*cp == '*') {
state->current_section->final = 1;
cp++;
}
/*
* Spaces or comments after ']' should not be fatal
*/
cp = skip_over_blanks(cp);
if (!end_or_comment(*cp))
return PROF_SECTION_SYNTAX;
return 0;
}
if (ch == '}') {
if (state->group_level == 0)
return PROF_EXTRA_CBRACE;
if (*(cp+1) == '*')
state->current_section->final = 1;
state->current_section = state->current_section->parent;
state->group_level--;
return 0;
}
/*
* Parse the relations
*/
tag = cp;
cp = strchr(cp, '=');
if (!cp)
return PROF_RELATION_SYNTAX;
if (cp == tag)
return PROF_RELATION_SYNTAX;
*cp = '\0';
if (*tag == '"') {
tag++;
parse_quoted_string(tag);
} else {
/* Look for whitespace on left-hand side. */
p = skip_over_nonblanks(tag);
if (*p)
*p++ = 0;
p = skip_over_blanks(p);
/* If we have more non-whitespace, it's an error. */
if (*p)
return PROF_RELATION_SYNTAX;
}
cp = skip_over_blanks(cp+1);
value = cp;
ch = value[0];
if (ch == '"') {
value++;
parse_quoted_string(value);
} else if (end_or_comment(ch)) {
do_subsection++;
state->state = STATE_GET_OBRACE;
} else if (value[0] == '{') {
cp = skip_over_blanks(value+1);
ch = *cp;
if (end_or_comment(ch))
do_subsection++;
else
return PROF_RELATION_SYNTAX;
} else {
cp = skip_over_nonblanks(value);
p = skip_over_blanks(cp);
ch = *p;
*cp = 0;
if (!end_or_comment(ch))
return PROF_RELATION_SYNTAX;
}
if (do_subsection) {
p = strchr(tag, '*');
if (p)
*p = '\0';
retval = profile_add_node(state->current_section,
tag, 0, &state->current_section);
if (retval)
return retval;
if (p)
state->current_section->final = 1;
state->group_level++;
return 0;
}
p = strchr(tag, '*');
if (p)
*p = '\0';
profile_add_node(state->current_section, tag, value, &node);
if (p)
node->final = 1;
return 0;
}
#ifdef PROFILE_DEBUG
/*
* Return TRUE if the string begins or ends with whitespace
*/
static int need_double_quotes(char *str)
{
if (!str || !*str)
return 0;
if (isspace((int) (*str)) ||isspace((int) (*(str + strlen(str) - 1))))
return 1;
if (strchr(str, '\n') || strchr(str, '\t') || strchr(str, '\b') ||
strchr(str, ' ') || strchr(str, '#') || strchr(str, ';'))
return 1;
return 0;
}
/*
* Output a string with double quotes, doing appropriate backquoting
* of characters as necessary.
*/
static void output_quoted_string(char *str, void (*cb)(const char *,void *),
void *data)
{
char ch;
char buf[2];
cb("\"", data);
if (!str) {
cb("\"", data);
return;
}
buf[1] = 0;
while ((ch = *str++)) {
switch (ch) {
case '\\':
cb("\\\\", data);
break;
case '\n':
cb("\\n", data);
break;
case '\t':
cb("\\t", data);
break;
case '\b':
cb("\\b", data);
break;
default:
/* This would be a lot faster if we scanned
forward for the next "interesting"
character. */
buf[0] = ch;
cb(buf, data);
break;
}
}
cb("\"", data);
}
#ifndef EOL
#define EOL "\n"
#endif
/* Errors should be returned, not ignored! */
static void dump_profile(struct profile_node *root, int level,
void (*cb)(const char *, void *), void *data)
{
int i;
struct profile_node *p;
void *iter;
long retval;
iter = 0;
do {
retval = profile_find_node(root, 0, 0, 0, &iter, &p);
if (retval)
break;
for (i=0; i < level; i++)
cb("\t", data);
if (need_double_quotes(p->name))
output_quoted_string(p->name, cb, data);
else
cb(p->name, data);
cb(" = ", data);
if (need_double_quotes(p->value))
output_quoted_string(p->value, cb, data);
else
cb(p->value, data);
cb(EOL, data);
} while (iter != 0);
iter = 0;
do {
retval = profile_find_node(root, 0, 0, 1, &iter, &p);
if (retval)
break;
if (level == 0) { /* [xxx] */
cb("[", data);
if (need_double_quotes(p->name))
output_quoted_string(p->name, cb, data);
else
cb(p->name, data);
cb("]", data);
cb(p->final ? "*" : "", data);
cb(EOL, data);
dump_profile(p, level+1, cb, data);
cb(EOL, data);
} else { /* xxx = { ... } */
for (i=0; i < level; i++)
cb("\t", data);
if (need_double_quotes(p->name))
output_quoted_string(p->name, cb, data);
else
cb(p->name, data);
cb(" = {", data);
cb(EOL, data);
dump_profile(p, level+1, cb, data);
for (i=0; i < level; i++)
cb("\t", data);
cb("}", data);
cb(p->final ? "*" : "", data);
cb(EOL, data);
}
} while (iter != 0);
}
static void dump_profile_to_file_cb(const char *str, void *data)
{
fputs(str, data);
}
long profile_write_tree_file(struct profile_node *root, FILE *dstfile)
{
dump_profile(root, 0, dump_profile_to_file_cb, dstfile);
return 0;
}
#endif
/*
* prof_tree.c --- these routines maintain the parse tree of the
* config file.
*
* All of the details of how the tree is stored is abstracted away in
* this file; all of the other profile routines build, access, and
* modify the tree via the accessor functions found in this file.
*
* Each node may represent either a relation or a section header.
*
* A section header must have its value field set to 0, and may a one
* or more child nodes, pointed to by first_child.
*
* A relation has as its value a pointer to allocated memory
* containing a string. Its first_child pointer must be null.
*
*/
/*
* Free a node, and any children
*/
void profile_free_node(struct profile_node *node)
{
struct profile_node *child, *next;
if (node->magic != PROF_MAGIC_NODE)
return;
free(node->name);
free(node->value);
for (child=node->first_child; child; child = next) {
next = child->next;
profile_free_node(child);
}
node->magic = 0;
free(node);
}
#undef strdup
#define strdup MYstrdup
static char *MYstrdup (const char *s)
{
size_t sz = strlen(s) + 1;
char *p = malloc(sz);
if (p != 0)
memcpy(p, s, sz);
return p;
}
/*
* Create a node
*/
long profile_create_node(const char *name, const char *value,
struct profile_node **ret_node)
{
struct profile_node *new;
new = malloc(sizeof(struct profile_node));
if (!new)
return ENOMEM;
memset(new, 0, sizeof(struct profile_node));
new->name = strdup(name);
if (new->name == 0) {
free(new);
return ENOMEM;
}
if (value) {
new->value = strdup(value);
if (new->value == 0) {
profile_free_node(new);
return ENOMEM;
}
}
new->magic = PROF_MAGIC_NODE;
*ret_node = new;
return 0;
}
/*
* This function verifies that all of the representation invarients of
* the profile are true. If not, we have a programming bug somewhere,
* probably in this file.
*/
#ifdef PROFILE_DEBUG
long profile_verify_node(struct profile_node *node)
{
struct profile_node *p, *last;
long retval;
CHECK_MAGIC(node);
if (node->value && node->first_child)
return PROF_SECTION_WITH_VALUE;
last = 0;
for (p = node->first_child; p; last = p, p = p->next) {
if (p->prev != last)
return PROF_BAD_LINK_LIST;
if (last && (last->next != p))
return PROF_BAD_LINK_LIST;
if (node->group_level+1 != p->group_level)
return PROF_BAD_GROUP_LVL;
if (p->parent != node)
return PROF_BAD_PARENT_PTR;
retval = profile_verify_node(p);
if (retval)
return retval;
}
return 0;
}
#endif
/*
* Add a node to a particular section
*/
long profile_add_node(struct profile_node *section, const char *name,
const char *value, struct profile_node **ret_node)
{
long retval;
struct profile_node *p, *last, *new;
CHECK_MAGIC(section);
if (section->value)
return PROF_ADD_NOT_SECTION;
/*
* Find the place to insert the new node. We look for the
* place *after* the last match of the node name, since
* order matters.
*/
for (p=section->first_child, last = 0; p; last = p, p = p->next) {
int cmp;
cmp = strcmp(p->name, name);
if (cmp > 0)
break;
}
retval = profile_create_node(name, value, &new);
if (retval)
return retval;
new->group_level = section->group_level+1;
new->deleted = 0;
new->parent = section;
new->prev = last;
new->next = p;
if (p)
p->prev = new;
if (last)
last->next = new;
else
section->first_child = new;
if (ret_node)
*ret_node = new;
return 0;
}
/*
* Iterate through the section, returning the nodes which match
* the given name. If name is NULL, then interate through all the
* nodes in the section. If section_flag is non-zero, only return the
* section which matches the name; don't return relations. If value
* is non-NULL, then only return relations which match the requested
* value. (The value argument is ignored if section_flag is non-zero.)
*
* The first time this routine is called, the state pointer must be
* null. When this profile_find_node_relation() returns, if the state
* pointer is non-NULL, then this routine should be called again.
* (This won't happen if section_flag is non-zero, obviously.)
*
*/
long profile_find_node(struct profile_node *section, const char *name,
const char *value, int section_flag, void **state,
struct profile_node **node)
{
struct profile_node *p;
CHECK_MAGIC(section);
p = *state;
if (p) {
CHECK_MAGIC(p);
} else
p = section->first_child;
for (; p; p = p->next) {
if (name && (strcmp(p->name, name)))
continue;
if (section_flag) {
if (p->value)
continue;
} else {
if (!p->value)
continue;
if (value && (strcmp(p->value, value)))
continue;
}
if (p->deleted)
continue;
/* A match! */
if (node)
*node = p;
break;
}
if (p == 0) {
*state = 0;
return section_flag ? PROF_NO_SECTION : PROF_NO_RELATION;
}
/*
* OK, we've found one match; now let's try to find another
* one. This way, if we return a non-zero state pointer,
* there's guaranteed to be another match that's returned.
*/
for (p = p->next; p; p = p->next) {
if (name && (strcmp(p->name, name)))
continue;
if (section_flag) {
if (p->value)
continue;
} else {
if (!p->value)
continue;
if (value && (strcmp(p->value, value)))
continue;
}
/* A match! */
break;
}
*state = p;
return 0;
}
/*
* This is a general-purpose iterator for returning all nodes that
* match the specified name array.
*/
struct profile_iterator {
prf_magic_t magic;
profile_t profile;
int flags;
const char *const *names;
const char *name;
prf_file_t file;
int file_serial;
int done_idx;
struct profile_node *node;
int num;
};
long
profile_iterator_create(profile_t profile, const char *const *names, int flags,
void **ret_iter)
{
struct profile_iterator *iter;
int done_idx = 0;
if (profile == 0)
return PROF_NO_PROFILE;
if (profile->magic != PROF_MAGIC_PROFILE)
return PROF_MAGIC_PROFILE;
if (!names)
return PROF_BAD_NAMESET;
if (!(flags & PROFILE_ITER_LIST_SECTION)) {
if (!names[0])
return PROF_BAD_NAMESET;
done_idx = 1;
}
if ((iter = malloc(sizeof(struct profile_iterator))) == NULL)
return ENOMEM;
iter->magic = PROF_MAGIC_ITERATOR;
iter->profile = profile;
iter->names = names;
iter->flags = flags;
iter->file = profile->first_file;
iter->done_idx = done_idx;
iter->node = 0;
iter->num = 0;
*ret_iter = iter;
return 0;
}
void profile_iterator_free(void **iter_p)
{
struct profile_iterator *iter;
if (!iter_p)
return;
iter = *iter_p;
if (!iter || iter->magic != PROF_MAGIC_ITERATOR)
return;
free(iter);
*iter_p = 0;
}
/*
* Note: the returned character strings in ret_name and ret_value
* points to the stored character string in the parse string. Before
* this string value is returned to a calling application
* (profile_node_iterator is not an exported interface), it should be
* strdup()'ed.
*/
long profile_node_iterator(void **iter_p, struct profile_node **ret_node,
char **ret_name, char **ret_value)
{
struct profile_iterator *iter = *iter_p;
struct profile_node *section, *p;
const char *const *cpp;
long retval;
int skip_num = 0;