-
Notifications
You must be signed in to change notification settings - Fork 7
/
cfgmap.c
1322 lines (1074 loc) · 33.6 KB
/
cfgmap.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
/***************************************************************************
* Copyright (C) 2019 by John D. Robertson *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 3 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
***************************************************************************/
#include <limits.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <syslog.h>
#include <libgen.h>
#include <assert.h>
#include "cfgmap.h"
#include "ptrvec.h"
#include "util.h"
/* Internal classes */
typedef struct _VALUE {
char *str;
unsigned serial_no;
} VALUE;
/* Forward declarations */
static CFGMAP_ENTRY* CFGMAP_ENTRY_constructor(CFGMAP_ENTRY * self,
const char *symbol,
unsigned symLen);
static int _CFGMAP_fh_read(CFGMAP * self, FILE * fh, const char *fname);
static int cmp_symbol(const void *v1, const void *v2);
static int count_tuples(void *item_ptr, void *data);
static int str_extract_string(char **rtnVal, const char **pStr);
static int unused_load_arr(void *item_ptr, void *data);
static VALUE* CFGMAP_ENTRY_append_value(CFGMAP_ENTRY * self,
const char *val_str,
unsigned serial_no);
static VALUE* VALUE_constructor(VALUE * self, const char *str, unsigned serial_no);
static void* CFGMAP_ENTRY_destructor(CFGMAP_ENTRY * self);
static void* VALUE_destructor(VALUE * self);
/* Internal macros */
#define VALUE_create(p, str, serial_no) \
((p)= (VALUE_constructor((p)=malloc(sizeof(VALUE)), str, serial_no) ? (p) : ( p ? realloc(VALUE_destructor(p),0) : 0 )))
#define VALUE_destroy(s) \
{if(VALUE_destructor(s)) {free(s); s=NULL;}}
#define CFGMAP_ENTRY_create(p, sym, symLen) \
(CFGMAP_ENTRY_constructor((p)=malloc(sizeof(CFGMAP_ENTRY)), sym, symLen) ? (p) : ( p ? realloc(CFGMAP_ENTRY_destructor(p),0) : 0 ))
#define CFGMAP_ENTRY_destroy(s) \
if(CFGMAP_ENTRY_destructor(s)) {free(s);}
/*===========================================================================================*/
/*================================== CFGMAP ===============================================*/
/*===========================================================================================*/
const CFGMAP_ENTRY*
CFGMAP_find(CFGMAP * self, const char *symbol)
/************************************************************************
* Find entry for the given null terminated symbol.
*/
{
CFGMAP_ENTRY *rtn =
MAP_findItem(&self->entry_map, symbol, strlen(symbol));
if (rtn)
++rtn->nLookups;
return rtn;
}
const char*
CFGMAP_find_single_value(CFGMAP * self, const char *symbol)
/************************************************************************
* Find exactly one value for a symbol, or return NULL.
*/
{
const CFGMAP_ENTRY *pEntry;
unsigned numVals;
if (!(pEntry = CFGMAP_find(self, symbol)))
return NULL;
if ((numVals = CFGMAP_ENTRY_numValues(pEntry)) != 1) {
eprintf("ERROR: \"%s\" has %u values instead of 1.", symbol, numVals);
return NULL;
}
return CFGMAP_ENTRY_value(pEntry, 0);
}
const char*
CFGMAP_find_last_value(CFGMAP * self, const char *symbol)
/************************************************************************
* Find the last value for a symbol, or return NULL.
*/
{
const CFGMAP_ENTRY *pEntry;
unsigned numVals;
if (!(pEntry = CFGMAP_find(self, symbol)))
return NULL;
numVals = CFGMAP_ENTRY_numValues(pEntry);
return CFGMAP_ENTRY_value(pEntry, numVals - 1);
}
int
CFGMAP_append(CFGMAP * self, const char *symbol, unsigned int symLen,
const char *value)
/**************************************************************************
* Append a value to a config entry, creating a new entry if necessary.
*/
{
CFGMAP_ENTRY *pEntry;
VALUE *v;
/* Create a new CFGMAP_ENTRY if no match is found. */
if (!(pEntry = MAP_findItem(&self->entry_map, symbol, symLen))) {
if (!CFGMAP_ENTRY_create(pEntry, symbol, symLen))
return 1;
if (MAP_addKey
(&self->entry_map, pEntry->symbol, pEntry->symLen, pEntry))
assert(0);
}
/* Return now if there is no value to remember. */
if (!strlen(value))
return 0;
/* Must recount tuples */
self->flags &= ~CFGMAP_NTUPLES_KNOWN_FLG;
/* Otherwise, add the value to the list */
if (!CFGMAP_ENTRY_append_value(pEntry, value, ++self->serial_no_seq))
assert(0);
return 0;
}
CFGMAP*
CFGMAP_file_constructor(CFGMAP * self, const char *fname)
/******************************************************************
* Create a map populated from the supplied file.
*/
{
if (!(CFGMAP_constructor(self)))
return NULL;
if (CFGMAP_file_read(self, fname))
return NULL;
return self;
}
CFGMAP*
CFGMAP_constructor(CFGMAP * self)
/******************************************************************
* Create an empty map.
*/
{
if (!self)
return NULL;
memset(self, 0, sizeof(*self));
/* Initialize data structures */
if (!MAP_constructor(&self->entry_map, 30, 100) ||
!PTRVEC_constructor(&self->curlyBlock_lst, 10))
return NULL;
return self;
}
void*
CFGMAP_destructor(CFGMAP * self)
/******************************************************************
* Free resources associated with map.
*/
{
/* Remove configuration map entries */
MAP_clearAndDestroy(&self->entry_map,
(void *(*)(void *))CFGMAP_ENTRY_destructor);
MAP_destructor(&self->entry_map);
{ /* Remove curly brace block symbols list */
char *str;
while ((str = PTRVEC_remHead(&self->curlyBlock_lst))) {
free(str);
}
}
PTRVEC_destructor(&self->curlyBlock_lst);
return self;
}
static int
_CFGMAP_fh_read(CFGMAP * self, FILE * fh, const char *fname)
/**************************************************************************
* Read a file to populate the map.
*/
{
int rtn = 1;
unsigned lineNo;
char cwd[PATH_MAX];
/* Note the change in recursion level */
++self->recurs_lvl;
{ /* get a copy of the current directory */
char tmp_fname[PATH_MAX];
strncpy(tmp_fname, fname, sizeof(tmp_fname) - 1);
tmp_fname[sizeof(tmp_fname) - 1] = '\0';
strncpy(cwd, dirname(tmp_fname), sizeof(cwd) - 1);
cwd[sizeof(cwd) - 1] = '\0';
}
#ifdef DDEBUG
eprintf("INFO: %s(\"%s\")", __FUNCTION__, fname);
#endif
{ /* Parse the file, build a map */
char lineBuf[1024];
unsigned int charNo, currLen;
enum {
COMMENT_STATE = 1 << 0,
STRING_STATE = 1 << 1,
CURLY_BEGIN_STATE = 1 << 2,
REPLACE_STATE = 1 << 3,
NDX_STATE = 1 << 4,
ESCAPED_STATE = 1 << 5
} stateFlags;
for (lineNo = 1, charNo = 1, currLen = 0, stateFlags = 0;; ++charNo) {
char *str;
int c;
/* Check for buffer overflow */
if (currLen + 1 == sizeof(lineBuf)) {
eprintf("ERROR: line buffer overflow at line %u.", lineNo);
goto abort;
}
/* Grab the next character from the file */
c = getc(fh);
/* End of current line? */
if (c == '\n' || c == EOF) {
char substBuf[sizeof(lineBuf)];
// TODO: here is where a continuation backslash could be checked for
if (stateFlags & STRING_STATE) {
eprintf("ERROR: Unterminated string in \"%s\" at line %u.",
fname, lineNo);
goto abort;
}
/* Null terminate buffer */
lineBuf[currLen] = '\0';
/* Skip leading whitespace */
/* Get rid of trailing whitespace */
str= trim(lineBuf);
{ /*--- Perform substitutions ---*/
unsigned nCopied;
/* Null terminate substituted string. */
substBuf[sizeof(substBuf) - 1] = '\0';
/* Perform substitutions */
for (nCopied = 0; *str && nCopied + 1 < sizeof(substBuf);) {
if (!strncmp(str, "$CWD", 4)) {
strncpy(substBuf + nCopied, cwd,
sizeof(substBuf) - nCopied - 1);
str += 4;
nCopied += strlen(substBuf + nCopied);
} else {
substBuf[nCopied] = *str;
++str;
++nCopied;
}
}
/* Make sure the substBuf is null terminated */
substBuf[nCopied] = '\0';
/* Further work done with contents of substitution buffer */
currLen = nCopied;
str = substBuf;
}
/* Process lines with non-zero length */
if (*str) {
assert(currLen);
/* Last character issues */
switch (str[currLen - 1]) {
case '{':
stateFlags |= CURLY_BEGIN_STATE;
/* Get rid of trailing whitespace */
str[--currLen] = '\0';
trimend(str);
break;
case '}':
{
char *entry = PTRVEC_remTail(&self->curlyBlock_lst);
if (!entry) {
eprintf
("ERROR: Unmatched '}' found in \"%s\" at line %u.",
fname, lineNo);
goto abort;
}
free(entry);
}
if (currLen == 1)
goto doneProcessing;
break;
}
if (!strncmp(str, ".include", 8)) {
char *fname;
str += 8;
#pragma GCC diagnostic ignored "-Wcast-qual"
if (str_extract_string(&fname, (const char **)(&str)))
assert(0);
/* Call our self to continue */
if (CFGMAP_file_read(self, fname)) {
eprintf("ERROR: failed at line %u.", lineNo);
goto abort;
}
free(fname);
goto doneProcessing;
} else if (!strncmp(str, ".shell", 6)) {
char *cmd;
FILE *pofh = NULL;
cmd = skipspace(str + 6);
if (!(pofh = popen(cmd, "r")) ||
_CFGMAP_fh_read(self, pofh, fname)) {
eprintf("ERROR: \".shell %s\" failed at line %u.", cmd,
lineNo);
goto abort;
}
if (pofh)
pclose(pofh);
goto doneProcessing;
} else if (*str == '@') {
/* Skip leading whitespace */
for (++str, --currLen; *str && isspace(*str); ++str, --currLen) ;
stateFlags |= REPLACE_STATE;
} else if (*str == '}') { /* Ending of curly brace block */
char *entry = PTRVEC_remTail(&self->curlyBlock_lst);
if (!entry) {
eprintf("ERROR: Unmatched '}' found in \"%s\" at line %u.",
fname, lineNo);
goto abort;
}
free(entry);
goto doneProcessing;
}
{ /* At this point we hope we have a symbol+value pair */
size_t symLen;
unsigned ndx;
char *valStr, *ndxStr, symBuf[sizeof(lineBuf) * 2];
/* Find the length of the symbol */
symLen = strcspn(str, " \t=[");
/* Default to end of symbol */
valStr = str + symLen;
/* If we have a value, find the beginning */
if (*valStr) {
/* Skip whitespace */
valStr= skipspace(valStr);
if (*valStr == '[') {
int n;
if (sscanf(valStr, "[ %u ]%n", &ndx, &n) < 1) {
eprintf
("ERROR: array notation in .replace without a value in \"%s\" at line %u.",
fname, lineNo);
goto abort;
}
valStr += n;
stateFlags |= NDX_STATE;
/* Skip whitespace */
valStr= skipspace(valStr);
}
if (*valStr == '=')
++valStr;
/* Skip remaining whitespace */
valStr= skipspace(valStr);
}
/* Generate symbol prefix, if necessary */
if (PTRVEC_numItems(&self->curlyBlock_lst)) {
size_t len;
symBuf[0] = '\0';
{ /* Prefix segments from ancestor curly brace blocks */
unsigned i;
const char *pfix;
PTRVEC_loopFwd(&self->curlyBlock_lst, i, pfix) {
strncat(symBuf, "\\", sizeof(symBuf) - 1);
strncat(symBuf, pfix, sizeof(symBuf) - 1);
}
}
/* Leading period before current symbol */
strncat(symBuf, "\\", sizeof(symBuf) - 1);
/* Tag on the current symbol */
len = strlen(symBuf);
if (len + symLen >= sizeof(symBuf)) {
eprintf
("ERROR: symbol buffer overrun in \"%s\" at line %u.",
fname, lineNo);
goto abort;
}
strncat(symBuf + len, str, symLen);
symLen += len;
} else {
assert(symLen + 1 < sizeof(symBuf));
/* Copy into symBuf. */
symBuf[0] = '\\';
memcpy(symBuf + 1, str, symLen);
++symLen;
}
/* Null terminate symBuf */
symBuf[symLen] = '\0';
if (stateFlags & REPLACE_STATE) { /* Need to replace an existing entry */
unsigned nVals;
/* We have to skip over the default leading '\' in symBuf, because it was supplied in the config file. */
CFGMAP_ENTRY *pEntry =
MAP_findItem(&self->entry_map, symBuf + 1,
symLen - 1);
if (!pEntry) {
eprintf
("ERROR: No symbol \"%s\" to replace in \"%s\" at line %u.",
symBuf + 1, fname, lineNo);
goto abort;
}
nVals = CFGMAP_ENTRY_numValues(pEntry);
if (stateFlags & NDX_STATE) { /* Entry is indexed */
unsigned i;
VALUE *val, *valArr[nVals];
if (ndx >= nVals) {
eprintf
("ERROR: .replace ndx= %u out of range in \"%s\" at line %u.",
ndx, fname, lineNo);
goto abort;
}
/* Load value VALUES into temporary array */
PTRVEC_loopFwd(&pEntry->value_lst, i, val) {
if (ndx == i) { /* Replace this value */
/* Preserve the serial number */
unsigned sn = val->serial_no;
VALUE_destroy(val);
VALUE_create(valArr[i], valStr, sn);
assert(valArr[i]);
} else { /* Copy existing value */
valArr[i] = val;
}
}
/* Put temporary array back into PTRVEC */
PTRVEC_reset(&pEntry->value_lst);
for (i = 0; i < nVals; ++i) {
PTRVEC_addTail(&pEntry->value_lst, valArr[i]);
}
} else { /* Must be only one entry */
if (nVals != 1) {
eprintf
("ERROR: Non-indexed .replace with ambiguous %u value target in \"%s\" at line %u.",
nVals, fname, lineNo);
goto abort;
}
free(PTRVEC_remHead(&pEntry->value_lst));
PTRVEC_addTail(&pEntry->value_lst, strdup(valStr));
}
} else {
assert(!(stateFlags & NDX_STATE));
/* Add the symbol+value pair to the memory based map */
if (CFGMAP_append(self, symBuf, symLen, valStr)) {
assert(0);
}
/* Handle the case where a curly brace block begins */
if (stateFlags & CURLY_BEGIN_STATE) {
PTRVEC_addTail(&self->curlyBlock_lst, strdup(valStr));
}
}
} /* symbol + value pair */
doneProcessing:
;
}
/* Non-empty string */
/* All done? */
if (c == EOF)
break;
/* Get ready for the next line */
++lineNo;
currLen = 0;
charNo = 0;
stateFlags = 0;
}
/* EOL or EOF */
/* Ignore other non-printing characters */
if (!isprint(c)) {
continue;
}
/* Handle escaped characters */
if (c == '\\' &&
!(stateFlags & COMMENT_STATE) && !(stateFlags & ESCAPED_STATE)) {
stateFlags |= ESCAPED_STATE;
continue;
}
/* Handle the different states of the "state machine" */
if (stateFlags & COMMENT_STATE) { /* In the middle of a comment */
/* Ignore character */
continue;
} else if (stateFlags & STRING_STATE) { /* In the middle of a quoted string */
switch (c) {
case '"':
if (!(stateFlags & ESCAPED_STATE)) {
stateFlags &= ~STRING_STATE;
}
break;
}
/* valid character */
lineBuf[currLen] = c;
++currLen;
} else { /* Currently no special state */
switch (c) {
case '#': /* Ignore rest of line */
if (!(stateFlags & ESCAPED_STATE)) {
stateFlags |= COMMENT_STATE;
continue;
}
break;
case '"': /* This is a string which may contain a # character */
if (!(stateFlags & ESCAPED_STATE)) {
stateFlags |= STRING_STATE;
}
break;
default:
if (stateFlags & ESCAPED_STATE) {
lineBuf[currLen] = '\\';
++currLen;
}
}
/* This is a valid character */
lineBuf[currLen] = c;
++currLen;
} /* Currently no special state */
stateFlags &= ~ESCAPED_STATE;
} /* character by character for loop */
} /* Parse file scope */
/* Note the change in recursion level */
--self->recurs_lvl;
/* Check for unmatched curly braces in the outermost file */
if (!self->recurs_lvl && PTRVEC_numItems(&self->curlyBlock_lst)) {
eprintf("ERROR: Unterminated curly brace in \"%s\" at line %u.", fname,
lineNo);
goto abort;
}
rtn = 0;
abort:
return rtn;
}
int
CFGMAP_file_read(CFGMAP * self, const char *fname)
/**************************************************************************
* Read a file to populate the map.
*/
{
int rtn = 1;
FILE *fh = NULL;
#ifdef DDEBUG
eprintf("INFO: %s(\"%s\")", __FUNCTION__, fname);
#endif
/* Open the supplied file for reading */
if (!(fh = fopen(fname, "r"))) {
eprintf("ERROR: cannot open \"%s\"", fname);
goto abort;
}
if (_CFGMAP_fh_read(self, fh, fname))
goto abort;
rtn = 0;
abort:
if (fh)
fclose(fh);
return rtn;
}
int
CFGMAP_query_uint(CFGMAP * self, unsigned int *pRtn, unsigned int dfltVal, const char *symbol)
/**********************************************************************************
* Convenience query function.
*/
{
const char *valStr;
/* Initialize with default value */
*pRtn = dfltVal;
if (!(valStr = CFGMAP_find_single_value(self, symbol)))
return 0;
if (sscanf(valStr, "%u", pRtn) != 1) {
eprintf("ERROR: \"%s = %s\" is not a valid unsigned integer specifier.",
symbol, valStr);
return 1;
}
return 0;
}
int
CFGMAP_query_last_flags(
CFGMAP * self,
int *pRtn,
int dfltVal,
const char *symbol,
const struct bitTuple bt_arr[]
)
/**********************************************************************************
* Convenience query function for possibly OR'd flags. bt_arr[] is terminated with a NULL value
* in enumStr.
*/
{
const char *valStr, *str;
size_t flagLen;
// TODO: implement all bit operators (e.g. '|', '~', '<<', '>>')
/* Initialize with default value */
*pRtn = dfltVal;
/* See if any corresponding entries exist in the map */
if (!(valStr = CFGMAP_find_last_value(self, symbol)))
return 0;
int64_t rtnBuf;
if(-1 == str2bits(&rtnBuf, valStr, bt_arr)) {
eprintf("ERROR: \"%s\" is not a valid flag.", symbol, valStr);
return 1;
}
*pRtn= rtnBuf;
return 0;
}
int
CFGMAP_query_last_enum(
CFGMAP * self,
int *pRtn,
int dfltVal,
const char *symbol,
const struct enumTuple et_arr[]
)
/**********************************************************************************
* Convenience query function for enums. et_arr[] is terminated with a NULL value
* in enumStr.
*/
{
const char *valStr;
unsigned i;
/* Initialize with default value */
*pRtn = dfltVal;
/* See if any corresponding entries exist in the map */
if (!(valStr = CFGMAP_find_last_value(self, symbol)))
return 0;
const struct enumTuple *et= str2enum(valStr, et_arr);
/* Assign enum value, if found */
if(et) {
*pRtn= et->enumVal;
return 0;
}
return 0;
}
int
CFGMAP_query_last_bool(CFGMAP * self,
int *pRtn, int dfltVal, const char *symbol)
/**********************************************************************************
* Convenience function.
*/
{
const char *val;
*pRtn = dfltVal;
if (!(val = CFGMAP_find_last_value(self, symbol)))
return 0;
if (!strcmp(val, "yes") || !strcmp(val, "true") || !strcmp(val, "1")) {
*pRtn = 1;
return 0;
}
if (!strcmp(val, "no") || !strcmp(val, "false") || !strcmp(val, "0")) {
*pRtn = 0;
return 0;
}
eprintf("ERROR: \"%s = %s\" is not a valid boolean specifier.", symbol, val);
return 1;
}
int
CFGMAP_query_last_int(CFGMAP * self, int *pRtn, int dfltVal,
const char *symbol)
/**********************************************************************************
* Convenience function.
*/
{
const char *val;
*pRtn = dfltVal;
if (!(val = CFGMAP_find_last_value(self, symbol)))
return 0;
if (sscanf(val, "%d", pRtn) != 1) {
eprintf("ERROR: \"%s = %s\" is not a valid integer specification.",
symbol, val);
return 1;
}
return 0;
}
int
CFGMAP_query_last_uint(CFGMAP * self, unsigned *pRtn, unsigned dfltVal,
const char *symbol)
/**********************************************************************************
* Convenience function.
*/
{
const char *val;
*pRtn = dfltVal;
if (!(val = CFGMAP_find_last_value(self, symbol)))
return 0;
if (sscanf(val, "%u", pRtn) != 1) {
eprintf
("ERROR: \"%s = %s\" is not a valid unsigned integer specification.",
symbol, val);
return 1;
}
return 0;
}
int
CFGMAP_query_last_dbl(CFGMAP * self, double *pRtn, double dfltVal,
const char *symbol)
/**********************************************************************************
* Convenience function.
*/
{
const char *val;
*pRtn = dfltVal;
if (!(val = CFGMAP_find_last_value(self, symbol)))
return 0;
if (sscanf(val, "%lf", pRtn) != 1) {
eprintf("ERROR: \"%s = %s\" is not a valid floating point specification.",
symbol, val);
return 1;
}
return 0;
}
int
CFGMAP_query_last_string(CFGMAP * self, char **pRtn, const char *dfltVal,
const char *symbol)
/**********************************************************************************
* Convenience function.
* Note: string assigned to *pRtn was allocated by strdup().
*/
{
const char *val;
if (!(val = CFGMAP_find_last_value(self, symbol))) {
if (dfltVal) {
*pRtn = strdup(dfltVal);
assert(*pRtn);
} else {
/* NULL is a valid dfltVal */
*pRtn = NULL;
}
return 0;
}
return str_extract_string(pRtn, &val);
}
int
CFGMAP_query_last_time_of_day(CFGMAP * self, int *pRtn, int dfltVal,
const char *symbol)
/**********************************************************************************
* Convenience function to convert hh:mm to a number of seconds.
*/
{
const char *val;
int hr, min;
*pRtn = dfltVal;
if (!(val = CFGMAP_find_last_value(self, symbol)))
return 0;
if (sscanf(val, "%u:%u", &hr, &min) != 2) {
eprintf("ERROR: \"%s = %s\" is not a valid time of day specification.",
symbol, val);
return 1;
}
/* Convert hours and minutes into seconds */
*pRtn = 3600 * hr + 60 * min;
return 0;
}
static int
cmp_symbol(const void *v1, const void *v2)
/******************************************************************
* lambda function for qsort() puts entries in case insensitive,
* alphabetical order.
*/
{
const CFGMAP_ENTRY *const *ppE1 = (const CFGMAP_ENTRY * const *)v1,
*const *ppE2 = (const CFGMAP_ENTRY * const *)v2;
return strcasecmp((*ppE1)->symbol, (*ppE2)->symbol);
}
void
CFGMAP_print(CFGMAP * self, FILE * fh)
/******************************************************************
* Print to stream for debugging purposes
*/
{
size_t i, count = MAP_numItems(&self->entry_map);
CFGMAP_ENTRY *entryPtr_arr[count];
/* Load entry pointers into an array */
MAP_fetchAllItems(&self->entry_map, (void **)entryPtr_arr);
/* Sort the pointer array */
qsort(entryPtr_arr, count, sizeof(CFGMAP_ENTRY *), cmp_symbol);
/* Print the entries in sorted order */
for (i = 0; i < count; ++i) {
CFGMAP_ENTRY_print(entryPtr_arr[i], fh);
}
}
static int
unused_load_arr(void *item_ptr, void *data)
/******************************************************************
* lambda function to load unused CFGMAP_ENTRY's into an array.
*/
{
CFGMAP_ENTRY *e = (CFGMAP_ENTRY *) item_ptr;
/* If it was not ever looked up, it was unused */
if (!e->nLookups) {
void ***ppp = (void ***)data;
**ppp = item_ptr;
++(*ppp);
}
return 0;
}
size_t
CFGMAP_numUnused_symbols(CFGMAP * self)
/******************************************************************
* Print unused symbol count.
*/
{
size_t count = MAP_numItems(&self->entry_map);
CFGMAP_ENTRY *entryPtr_arr[count + 1], **ppEntry;
/* Zero out the array so we can find the end */
memset(entryPtr_arr, 0, (count + 1) * sizeof(CFGMAP_ENTRY *));
/* Load entry pointers into an array */
ppEntry = entryPtr_arr;
MAP_visitAllEntries(&self->entry_map, unused_load_arr, &ppEntry);
/* Find out how many entrys are unreferenced */
for (count = 0; entryPtr_arr[count]; ++count) ;
return count;
}
void
CFGMAP_print_unused_symbols(CFGMAP * self, FILE * fh)
/******************************************************************
* Print unused symbols for troubleshooting
*/
{
size_t count = MAP_numItems(&self->entry_map);
CFGMAP_ENTRY *entryPtr_arr[count + 1], **ppEntry;
/* Zero out the array so we can find the end */
memset(entryPtr_arr, 0, (count + 1) * sizeof(CFGMAP_ENTRY *));
/* Load entry pointers into an array */
ppEntry = entryPtr_arr;
MAP_visitAllEntries(&self->entry_map, unused_load_arr, &ppEntry);