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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
|
/*
* JSON based configuration format class.
*/
/*************************************************************************
Copyright 2008 Graeme W. Gill
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*************************************************************************/
#define LOCK_RETRIES 5
/* We convert JSON arrays to numerical sub paths on reading, */
/* but they get converted back to maps on writing. */
/* Paths are grouped under common paths on writing, */
/* but aren't sorted. */
#include <fcntl.h>
#include <sys/types.h>
#include <sys/stat.h>
#ifndef NT
#include <sys/file.h>
#endif
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <unistd.h>
#include <time.h>
#include "yajl/yajl_common.h"
#include "yajl/yajl_gen.h"
#include "yajl/yajl_parse.h"
#include "jcnf.h"
#define BUF_SIZE 2048
/* - - - - - - - - - - - - - - - - */
/* Utilities */
/* Construct a string that represents the current key path */
/* Return NULL on error (malloc fail) */
/* Free the returned string when done */
static char *cur_keypath(jcnf *p) {
char *ckey = NULL;
int i, len;
if (p->nrecd <= 0) {
return strdup("");
}
for (len = i = 0; i < p->nrecd; i++) {
if (p->recds[i].aix > -2) {
len += 3 + (int)log10((double)p->recds[p->nrecd-1].aix);
} else {
len += strlen(p->recds[i].key) + 1;
}
}
if ((ckey = malloc(len)) == NULL)
return NULL;
for (len = i = 0; i < p->nrecd; i++) {
int sl;
if (p->recds[i].aix > -2) {
char num[13];
sprintf(num, "%d",p->recds[i].aix);
sl = strlen(num);
memmove(ckey + len, num, sl);
} else {
sl = strlen(p->recds[i].key);
memmove(ckey + len, p->recds[i].key, sl);
}
len += sl;
if ((i+1) >= p->nrecd)
ckey[len] = '\000';
else
ckey[len] = '/';
len++;
}
return ckey;
}
/* Diagnostic - Print the value of a key */
static jc_error jcnf_print_key(jcnf *p, int ix, FILE *fp) {
jc_key *kp;
if (ix < 0 || ix >= p->nkeys)
return jc_ix_oorange;
kp = p->keys[ix];
fprintf(fp,"Key '%s' has value",kp->key);
switch(kp->type) {
case jc_null: {
fprintf(fp," null");
break;
}
case jc_boolean: {
fprintf(fp," %s",*((int *)kp->data) ? "true" : "false");
break;
}
case jc_real: {
fprintf(fp," %lf",*((double *)kp->data));
break;
}
case jc_integer: {
fprintf(fp," %ld",*((long *)kp->data));
break;
}
case jc_string: {
fprintf(fp," '%s'",kp->data);
break;
}
default: {
fprintf(fp," unknown type %d",kp->type);
break;
}
}
if (kp->c_comment != NULL) {
fprintf(fp," C comment = '%s'",kp->c_comment);
}
if (kp->cpp_comment != NULL) {
fprintf(fp," C++ comment = '%s'",kp->cpp_comment);
}
fprintf(fp,"\n");
return jc_ok;
}
/* - - - - - - - - - - - - - - - - */
/* Free keys contents */
static void free_key_contents(jc_key *p) {
if (p->key != NULL) {
free(p->key);
p->key = NULL;
}
if (p->c_comment != NULL) {
free(p->c_comment);
p->c_comment = NULL;
}
if (p->cpp_comment != NULL) {
free(p->cpp_comment);
p->cpp_comment = NULL;
}
if (p->data != NULL) {
free(p->data);
p->data = NULL;
}
p->type = -1;
}
/* Free key and its contents */
static void free_key(jc_key *p) {
free_key_contents(p);
free(p);
}
/* Set a keyvalues (internal) */
/* All parameters are copied */
/* return NZ on error */
static jc_error jcnf_set_key_internal(
jcnf *p,
jc_key *kp, /* Pointer to key */
char *key, /* Key path name */
jc_type type,
void *data,
size_t dataSize, /* Data size (including string nul) */
char *comment /* C++ style comment */
) {
free_key_contents(kp);
if ((kp->key = strdup(key)) == NULL)
return jc_malloc;
kp->type = type;
if (type != jc_null) {
if (type == jc_string && ((char *)data)[dataSize-1] != '\000')
return jc_string_not_terminated;
if ((kp->data = malloc(dataSize)) == NULL)
return jc_malloc;
kp->dataSize = dataSize;
memmove(kp->data, data, dataSize);
}
if (comment != NULL) {
if ((kp->cpp_comment = strdup(comment)) == NULL)
return jc_malloc;
}
return jc_ok;
}
/* Add a key value to the jcnf (internal) */
/* All parameters are copied */
/* return NZ on error */
static jc_error jcnf_add_key_internal(
jcnf *p,
char *key, /* Key path name */
jc_type type,
void *data,
size_t dataSize, /* Data size (including string nul) */
char *comment
) {
jc_error ev;
jc_key *kp;
if (key == NULL || (type != jc_null && (data == NULL || dataSize == 0)))
return jc_bad_addkey_params;
if (p->nkeys >= p->akeys) { /* Need more pointer space */
p->akeys = p->akeys ? 2 * p->akeys : 10;
if ((p->keys = realloc(p->keys, p->akeys * sizeof(jc_key*))) == NULL) {
return jc_malloc;
}
}
if ((kp = p->keys[p->nkeys] = calloc(1, sizeof(jc_key))) == NULL) {
return jc_malloc;
}
p->nkeys++;
if ((ev = jcnf_set_key_internal(p, kp, key, type, data, dataSize, comment)) != jc_ok)
return ev;
p->lk = kp;
return jc_ok;
}
/* Locate the index of the next key matching the key name, starting */
/* at the given index. Update the index to the matching key. */
/* Look for an exact match if exact != 0, or leading match if exact = 0 */
/* Search backwards if bwd != 0 or forwards if bwd = 0 */
/* Set *ix = -1 to begin search from the start/end for fwd/bwd. */
/* Return jc_ix_oorange if no more match. */
static jc_error jcnf_locate_key(
jcnf *p,
int *pix,
char *key,
int exact,
int bwd
) {
int ix = *pix;
int sl;
if (ix == -1) {
if (bwd)
ix = p->nkeys-1;
else
ix = 0;
}
if (ix < 0 || ix >= p->nkeys)
return jc_ix_oorange;
if (key == NULL)
return jc_no_keyname;
sl = strlen(key);
/* We're doing a simple linear search */
for (; ix >= 0 && ix < p->nkeys; ix += bwd ? -1 : 1) {
if (exact) {
if (strcmp(key, p->keys[ix]->key) == 0)
break;
} else {
if (strncmp(key, p->keys[ix]->key, sl) == 0)
break;
}
}
if (ix < 0 || ix >= p->nkeys)
return jc_ix_oorange;
*pix = ix;
return jc_ok;
}
/* Retrieve a keys information. Return pointers may be NULL. */
/* If ix >= 0, return the key of the given index. */
/* If ix == -1, return the first from the beginning exactly matching key name. */
/* jc_ix_oorange is returned when past end. */
/* (Do not modify anything returned) */
static jc_error jcnf_get_key(
jcnf *p,
int ix,
char **key,
jc_type *type,
unsigned char **data,
size_t *dataSize, /* Data size (including string nul) */
char **comment
) {
jc_error ev;
if (ix == -1) {
if (key == NULL || *key == NULL)
return jc_no_keyname;
if ((ev = jcnf_locate_key(p, &ix, *key, 1, 0)) != jc_ok)
return ev;
} else if (ix < 0 || ix >= p->nkeys)
return jc_ix_oorange;
if (key != NULL)
*key = p->keys[ix]->key;
if (type != NULL)
*type = p->keys[ix]->type;
if (data != NULL)
*data = p->keys[ix]->data;
if (dataSize != NULL)
*dataSize = p->keys[ix]->dataSize;
if (comment != NULL)
*comment = p->keys[ix]->cpp_comment;
return jc_ok;
}
/* Set a keys information. */
/* If ix >= 0, set the key of the given index. */
/* jc_ix_oorange is returned when past end. */
/* If ix == -1, overwrite an existing key with the same name, */
/* or add a new key with that name at the end if there is no existing key. */
static jc_error jcnf_set_key(
jcnf *p,
int ix,
char *key,
jc_type type,
unsigned char *data,
size_t dataSize, /* Data size (including string nul) */
char *comment
) {
jc_error ev;
if (ix == -1) {
if (key == NULL)
return jc_no_keyname;
if ((ev = jcnf_locate_key(p, &ix, key, 1, 0)) != jc_ok) {
if (ev != jc_ix_oorange)
return ev;
if (p->modify == 0)
return jc_update_nomod;
p->modified = 1;
return jcnf_add_key_internal(p, key, type, data, dataSize, comment);
}
} else if (ix < 0 || ix >= p->nkeys)
return jc_ix_oorange;
if (p->modify == 0)
return jc_update_nomod;
p->modified = 1;
return jcnf_set_key_internal(p, p->keys[ix], key, type, data, dataSize, comment);
}
/* Add a key value to the jcnf at the end, irrespective of whether there is */
/* an existing key with that name. */
static jc_error jcnf_add_key(
jcnf *p,
char *key,
jc_type type,
unsigned char *data,
size_t dataSize, /* Data size (including string nul) */
char *comment
) {
jc_error ev;
if (p->modify == 0)
return jc_update_nomod;
if ((ev = jcnf_add_key_internal(p,key,type,data,dataSize,comment)) == jc_ok) {
p->modified = 1;
}
return ev;
}
/* Delete a key. */
/* If ix >= 0, delete the key of the given index. */
/* jc_ix_oorange is returned when past end. */
/* If ix == -1, delete the key with the given name. */
static jc_error jcnf_delete_key(
jcnf *p,
int ix,
char *key
) {
jc_error ev;
if (ix == -1) {
if (key == NULL)
return jc_no_keyname;
if ((ev = jcnf_locate_key(p, &ix, key, 1, 0)) != jc_ok)
return ev;
} else if (ix < 0 || ix >= p->nkeys)
return jc_ix_oorange;
if (p->modify == 0)
return jc_update_nomod;
free_key_contents(p->keys[ix]);
if ((ix+1) < p->nkeys) {
memmove(p->keys+ix, p->keys+ix+1,sizeof(jc_key *) * p->nkeys-ix-1);
}
p->nkeys--;
p->modified = 1;
return jc_ok;
}
/* - - - - - - - - - - - - - - - - */
/* yajl parser callbacks */
static int jcnf_yajl_null(void *ctx) {
jcnf *p = (jcnf *)ctx;
char *t1;
// printf("null\n");
/* If current level is an array, bump the index */
if (p->nrecd > 0 && p->recds[p->nrecd-1].aix > -2)
p->recds[p->nrecd-1].aix++;
if ((t1 = cur_keypath(p)) == NULL)
return 0;
if (jcnf_add_key_internal(p, t1, jc_null, NULL, 0, NULL) != jc_ok) {
free(t1);
return 0;
}
free(t1);
return 1;
}
static int jcnf_yajl_boolean(void * ctx, int boolVal) {
jcnf *p = (jcnf *)ctx;
char *t1;
// printf("bool: %s\n", boolVal ? "true" : "false");
/* If current level is an array, bump the index */
if (p->nrecd > 0 && p->recds[p->nrecd-1].aix > -2)
p->recds[p->nrecd-1].aix++;
if ((t1 = cur_keypath(p)) == NULL)
return 0;
if (jcnf_add_key_internal(p, t1, jc_boolean, (void *)&boolVal, sizeof(int), NULL) != jc_ok) {
free(t1);
return 0;
}
free(t1);
return 1;
}
static int jcnf_yajl_integer(void *ctx, long integerVal) {
jcnf *p = (jcnf *)ctx;
char *t1;
// printf("integer: %lld\n", integerVal);
/* If current level is an array, bump the index */
if (p->nrecd > 0 && p->recds[p->nrecd-1].aix > -2)
p->recds[p->nrecd-1].aix++;
if ((t1 = cur_keypath(p)) == NULL)
return 0;
if (jcnf_add_key_internal(p, t1, jc_integer, (void *)&integerVal, sizeof(long), NULL) != jc_ok) {
free(t1);
return 0;
}
free(t1);
return 1;
}
static int jcnf_yajl_double(void *ctx, double doubleVal) {
jcnf *p = (jcnf *)ctx;
char *t1;
// printf("double: %lf\n", doubleVal);
/* If current level is an array, bump the index */
if (p->nrecd > 0 && p->recds[p->nrecd-1].aix > -2)
p->recds[p->nrecd-1].aix++;
if ((t1 = cur_keypath(p)) == NULL)
return 0;
if (jcnf_add_key_internal(p, t1, jc_real, (void *)&doubleVal, sizeof(double), NULL) != jc_ok) {
free(t1);
return 0;
}
free(t1);
return 1;
}
static int jcnf_yajl_string(void *ctx, const unsigned char *stringVal,
unsigned int stringLen) {
jcnf *p = (jcnf *)ctx;
char *t1, *t2;
// printf("string: '");
// fwrite(stringVal, 1, stringLen, stdout);
// printf("'\n");
/* If current level is an array, bump the index */
if (p->nrecd > 0 && p->recds[p->nrecd-1].aix > -2)
p->recds[p->nrecd-1].aix++;
if ((t1 = cur_keypath(p)) == NULL)
return 0;
if ((t2 = malloc(stringLen + 1)) == NULL) /* Room to add implicit nul */
return 0;
memmove(t2, stringVal, stringLen);
t2[stringLen] = 0;
if (jcnf_add_key_internal(p, t1, jc_string, (void *)t2, stringLen+1, NULL) != jc_ok) {
free(t2);
free(t1);
return 0;
}
free(t2);
free(t1);
return 1;
}
static int jcnf_yajl_c_comment(void *ctx, const unsigned char * stringVal,
unsigned int stringLen) {
jcnf *p = (jcnf *)ctx;
// printf("c_comment: '");
// fwrite(stringVal, 1, stringLen, stdout);
// printf("'\n");
if (p->lk != NULL && p->lk->c_comment == NULL) {
char *t1;
if ((t1 = malloc(stringLen + 1)) == NULL)
return 0;
memmove(t1, stringVal, stringLen);
t1[stringLen] = 0;
p->lk->c_comment = t1;
}
return 1;
}
static int jcnf_yajl_cpp_comment(void *ctx, const unsigned char * stringVal,
unsigned int stringLen) {
jcnf *p = (jcnf *)ctx;
// printf("cpp_comment: '");
// fwrite(stringVal, 1, stringLen, stdout);
// printf("'\n");
if (p->lk != NULL && p->lk->cpp_comment == NULL) {
char *t1;
if ((t1 = malloc(stringLen + 1)) == NULL)
return 0;
memmove(t1, stringVal, stringLen);
t1[stringLen] = 0;
p->lk->cpp_comment = t1;
}
return 1;
}
static int jcnf_yajl_start_map(void *ctx) {
jcnf *p = (jcnf *)ctx;
/* Start another recursion level */
if (p->nrecd >= p->arecd) {
p->arecd *= 2;
if ((p->recds = (jc_recd *)realloc(p->recds, p->arecd * sizeof(jc_recd))) == NULL) {
/* realloc failed */
return 0;
}
}
/* If current level is an array, bump the index */
if (p->nrecd > 0 && p->recds[p->nrecd-1].aix > -2)
p->recds[p->nrecd-1].aix++;
/* Move to new level */
p->recds[p->nrecd].key = NULL;
p->recds[p->nrecd].aix = -2;
p->nrecd++;
#ifdef NEVER
printf("map open '{'\n");
#endif
return 1;
}
static int jcnf_yajl_map_key(void *ctx, const unsigned char * stringVal,
unsigned int stringLen) {
jcnf *p = (jcnf *)ctx;
int i;
if (stringLen == 0) {
/* Zero length key */
return 0;
}
if (p->recds[p->nrecd-1].key != NULL) {
free(p->recds[p->nrecd-1].key);
p->recds[p->nrecd-1].key = NULL;
p->recds[p->nrecd-1].aix = -2;
}
if ((p->recds[p->nrecd-1].key = malloc(stringLen + 1)) == NULL)
return 0;
p->recds[p->nrecd-1].key[stringLen] = 0;
memmove(p->recds[p->nrecd-1].key, stringVal, stringLen);
#ifdef NEVER
{
char *tt;
printf("Added path = '%s'\n", p->recds[p->nrecd-1].key);
if ((tt = cur_keypath(p)) != NULL) {
printf("Current path = '%s'\n",tt);
free(tt);
}
}
#endif
return 1;
}
static int jcnf_yajl_end_map(void *ctx) {
jcnf *p = (jcnf *)ctx;
if (p->nrecd == 0) {
/* End of map without start of map */
return 0;
}
p->nrecd--;
#ifdef NEVER
{
char *tt;
printf("map close '}'\n");
if ((tt = cur_keypath(p)) != NULL)
printf("Current path = '%s'\n",tt);
free(tt);
}
#endif
return 1;
}
static int jcnf_yajl_start_array(void *ctx) {
jcnf *p = (jcnf *)ctx;
#ifdef NEVER
printf("array open '['\n");
#endif
/* Start another recursion level */
if (p->nrecd >= p->arecd) {
p->arecd *= 2;
if ((p->recds = (jc_recd *)realloc(p->recds, p->arecd * sizeof(jc_recd))) == NULL) {
/* realloc failed */
return 0;
}
}
/* If current level is an array, bump the index */
if (p->nrecd > 0 && p->recds[p->nrecd-1].aix > -2)
p->recds[p->nrecd-1].aix++;
/* Move to new level */
p->recds[p->nrecd].key = NULL;
p->recds[p->nrecd].aix = -1;
p->nrecd++;
return 1;
}
static int jcnf_yajl_end_array(void *ctx) {
jcnf *p = (jcnf *)ctx;
#ifdef NEVER
printf("array close ']'\n");
#endif
if (p->nrecd == 0) {
/* End of map without start of map */
return 0;
}
p->nrecd--;
return 1;
}
static yajl_callbacks callbacks = {
jcnf_yajl_null,
jcnf_yajl_boolean,
jcnf_yajl_integer,
jcnf_yajl_double,
NULL, /* number */
jcnf_yajl_string,
jcnf_yajl_c_comment,
jcnf_yajl_cpp_comment,
jcnf_yajl_start_map,
jcnf_yajl_map_key,
jcnf_yajl_end_map,
jcnf_yajl_start_array,
jcnf_yajl_end_array
};
/* - - - - - - - - - - - - - - - - */
/* Lock the open fp */
static jc_error jcnf_lock_file(jcnf *p) {
#ifndef NT
int i, fh;
int lop;
fh = fileno(p->fp);
if (p->modify) {
lop = LOCK_EX | LOCK_NB;
} else {
lop = LOCK_SH | LOCK_NB;
}
for (i = 0; i < LOCK_RETRIES; i++) {
if (flock(fh, lop) == 0)
break;
sleep(1);
}
if (i >= LOCK_RETRIES)
return jc_locked;
#endif
p->locked = 1;
return jc_ok;
}
/* Read a file into the object. */
/* (Doesn't do locking) */
/* Return NZ on error */
static jc_error jcnf_read(
jcnf *p
) {
jc_error ev;
yajl_handle hand;
yajl_parser_config cfg = { 0, 1 }; /* Validate UTF8 strings ? */
unsigned char buf[BUF_SIZE];
struct stat sbuf;
cfg.allowComments = 1;
if ((p->fp = fopen(p->fname, p->modify ? "r+" : "r")) == NULL) {
if (!p->modify)
return jc_noexisting;
if ((p->fp = fopen(p->fname, "w")) == NULL)
return jc_write_open;
if ((ev = jcnf_lock_file(p)) != jc_ok)
return ev;
return jc_ok;
}
if ((ev = jcnf_lock_file(p)) != jc_ok)
return ev;
hand = yajl_alloc(&callbacks, &cfg, NULL, (void *)p);
/* Parse the file */
for(;;) {
size_t rd;
rd = fread(buf, 1, BUF_SIZE, p->fp);
if (rd == 0) {
if (!feof(p->fp)) {
fprintf(stderr, "error reading from '%s'\n", p->fname);
return jc_read_fail;
}
break;
} else {
yajl_status stat;
/* read file data, pass to parser */
stat = yajl_parse(hand, buf, rd);
if (stat != yajl_status_insufficient_data &&
stat != yajl_status_ok)
{
unsigned char * str = yajl_get_error(hand, 1, buf, rd);
fflush(stdout);
fprintf(stderr, "%s", (char *) str);
yajl_free_error(hand, str);
return jc_parse_fail;
}
}
}
/* Record some things about the file so that we can */
/* recognized if it's been modified */
if (stat(p->fname, &sbuf) != 0) {
return jc_stat;
}
p->rsize = sbuf.st_size;
p->rtime = time(NULL);
yajl_free(hand);
/* We're not modifying it, so close it */
if (!p->modify) {
fclose(p->fp);
p->fp = NULL;
p->locked = 0;
}
return jc_ok;
}
/* Write an object into a file */
/* Unlock it & close it afterwards. */
/* Return NZ on error */
static jc_error jcnf_write(
jcnf *p
) {
FILE *fp; /* For temporary file */
char *tname = NULL;
yajl_gen_config conf = { 1, " " };
yajl_gen g;
yajl_status stat;
const unsigned char * buf;
unsigned int len;
int clevel = 0; /* Current level */
char *pkey = ""; /* Previous key */
char *ckey; /* Current key */
int i;
if (!p->locked && p->fp != NULL) {
return jc_update_nomod;
}
#ifndef NT
{
int fh;
if ((tname = malloc(strlen(p->fname) + 8)) == NULL)
return jc_malloc;
/* Create temporary file, open it and lock it LOCK_EX */
strcpy(tname, p->fname);
strcat(tname,"-XXXXXX");
if ((fh = mkstemp(tname)) == -1) {
free(tname);
return jc_write_open;
}
if (fchmod(fh, 0644) != 0) {
free(tname);
return jc_write_open;
}
if ((fp = fdopen(fh, "w")) == NULL) {
free(tname);
return jc_write_open;
}
}
#else
/* Open a temporary file in the same directory to write to */
if ((tname = malloc(strlen(p->fname) + 8)) == NULL)
return jc_malloc;
if (tmpnam(tname) == NULL) {
free(tname);
return jc_write_open;
}
if ((fp = fopen(tname, "w")) == NULL) {
free(tname);
return jc_write_open;
}
#endif
g = yajl_gen_alloc(&conf, NULL);
/* Generate the file */
for (i = 0; i < p->nkeys; i++, pkey = ckey) {
char *pc, *cc, *dc;
int nplev; /* Number of previous different levels */
int ndlev; /* Number of new different levels */
int same;
ckey = p->keys[i]->key;
/* See how many keys are not in common */
nplev = ndlev = 0;
same = 1;
for(pc = pkey, dc = cc = ckey; *pc != '\000' || *cc != '\000';) {
//printf("~1 pc = '%c', cc = '%c', same = %d\n",*pc,*cc,same);
if (same == 0 || *pc != *cc) {
same = 0;
if (*cc == '/') {
ndlev++;
//printf("~1 ndlev now %d\n",ndlev);
}
if (*pc == '/') {
nplev++;
//printf("~1 ndlev now %d\n",ndlev);
}
} else {
if (*cc == '/') {
dc = cc+1;
}
}
if (*pc != '\000') {
pc++;
if (same == 0 && *pc == '\000') {
nplev++;
//printf("~1 nplev now %d\n",nplev);
}
}
if (*cc != '\000') {
cc++;
if (same == 0 && *cc == '\000') {
ndlev++;
//printf("~1 ndlev now %d\n",ndlev);
}
}
}
//printf("~1 Prev = '%s'\n",pkey);
//printf("~1 Curr = '%s'\n",ckey);
//printf("~1 New = '%s'\n",dc);
//printf("~1 Old different = %d, new different = %d\n\n",nplev,ndlev);
while(nplev > 0) {
if (nplev > 1)
yajl_gen_map_close(g);
nplev--;
clevel--;
}
while(ndlev > 0) {
yajl_gen_map_open(g);
for (cc = dc; *cc != '\000' && *cc != '/'; cc++)
;
yajl_gen_string(g, dc, cc-dc);
if (*cc != '\000')
dc = cc + 1;
ndlev--;
clevel++;
}
switch(p->keys[i]->type) {
//printf("~1 key %d = type %d\n",i,p->keys[i]->type);
case jc_null:
yajl_gen_null(g);
break;
case jc_boolean:
yajl_gen_bool(g, *((int *)p->keys[i]->data));
break;
case jc_real:
yajl_gen_double(g, *((double *)p->keys[i]->data));
break;
case jc_integer:
yajl_gen_integer(g, *((long *)p->keys[i]->data));
break;
case jc_string:
yajl_gen_string(g, (char *)p->keys[i]->data, p->keys[i]->dataSize-1);
break;
default: {
free(tname);
return jc_unknown_key_type;
}
}
if (p->keys[i]->cpp_comment != NULL) {
yajl_gen_cpp_comment(g, p->keys[i]->cpp_comment, strlen(p->keys[i]->cpp_comment));
}
if (p->keys[i]->c_comment != NULL) {
yajl_gen_c_comment(g, p->keys[i]->c_comment, strlen(p->keys[i]->c_comment), 1);
}
#ifdef NEVER
yajl_gen_map_open(g);
yajl_gen_string(g, "test", strlen("test"));
yajl_gen_string(g, "test value", strlen("test value"));
yajl_gen_c_comment(g, " A comment ", strlen(" A comment "));
yajl_gen_map_close(g);
#endif
/* Do some writing */
yajl_gen_get_buf(g, &buf, &len);
if (len >= BUF_SIZE) {
if (fwrite(buf, 1, len, fp) != len)
return jc_write_fail;
yajl_gen_clear(g);
}
}
while(clevel > 0) {
yajl_gen_map_close(g);
clevel--;
}
yajl_gen_get_buf(g, &buf, &len);
if (len > 0) {
if (fwrite(buf, 1, len, fp) != len)
return jc_write_fail;
yajl_gen_clear(g);
}
yajl_gen_free(g);
if (fflush(fp) != 0) {
free(tname);
return jc_write_close;
}
#ifdef NT
/* MSWindows rename won't replace existing or open files. */
/* Lucky this is just for testing, as this leaves a window */
if (fp != NULL) {
fclose(fp);
fp = NULL;
}
if (p->fp != NULL) {
fclose(p->fp);
p->fp = NULL;
}
unlink(p->fname);
#endif
//printf("~1 about to rename '%s' to '%s'\n",tname,p->fname);
/* Now atomicaly rename the file to replace the file we read */
if (rename(tname, p->fname) != 0) {
free(tname);
return jc_write_close;
}
//printf("~1 closing files\n");
/* Close our files and release the locks */
if (fp != NULL && fclose(fp) != 0) {
free(tname);
return jc_write_close;
}
if (p->fp != NULL && fclose(p->fp) != 0) {
free(tname);
return jc_write_close;
}
p->fp = NULL;
p->locked = 0;
p->modify = 0;
free(tname);
return jc_ok;
}
/* Switch from read only to update of the config. */
static jc_error jcnf_enable_modify(jcnf *p) {
jc_error ev;
struct stat sbuf;
if (p->modify)
return jc_ok; /* Nothing to do */
/* We need to re-open the file and lock it for modification */
if ((p->fp = fopen(p->fname, "r+")) == NULL) {
return jc_changed;
}
p->modify = 1;
if ((ev = jcnf_lock_file(p)) != jc_ok) {
p->modify = 0;
fclose(p->fp);
p->fp = NULL;
return ev;
}
/* Check that it hasn't been modified since it was first read */
if (stat(p->fname, &sbuf) != 0) {
p->modify = 0;
fclose(p->fp);
p->fp = NULL;
return jc_stat;
}
if (sbuf.st_size != p->rsize
|| sbuf.st_mtime > p->rtime) {
p->modify = 0;
fclose(p->fp);
p->fp = NULL;
return jc_changed;
}
return jc_ok;
}
/* Update the file that was opened for modification, and unlock it. */
static jc_error jcnf_update(jcnf *p) {
jc_error ev;
struct stat sbuf;
if (p->modified) {
if (p->modify == 0 || p->locked == 0) {
return jc_update_nomod; /* File wasn't opened for modification */
}
if ((ev = jcnf_write(p)) != jc_ok) {
return ev;
}
p->modified = 0;
}
p->modify = 0;
return jc_ok;
}
/* free the object */
static void jcnf_del(jcnf *p) {
if (p->fp)
fclose(p->fp);
if (p->keys != NULL) {
int i;
for (i = 0; i < p->nkeys; i++) {
free_key(p->keys[i]);
}
free(p->keys);
}
if (p->recds != NULL) {
int i;
for (i = 0; i < p->nrecd; i++) {
free(p->recds[i].key);
}
free(p->recds);
}
if (p->fname)
free(p->fname);
free(p);
}
/* Create a new jconf. */
/* Return NULL on error */
jcnf *new_jcnf(
jc_error *pev, /* return error code on error */
char *fname, /* Corresponding filename */
jc_mod modify, /* Flag, nz to open for modification */
jc_crte create /* Flag, nz to create if it doesn't exist (modify must be set) */
) {
jcnf *p;
jc_error ev;
if ((p = (jcnf *) calloc(1, sizeof(jcnf))) == NULL) {
if (pev != NULL) *pev = jc_malloc;
return NULL;
}
p->arecd = 10;
if ((p->recds = (jc_recd *) calloc(p->arecd, sizeof(jc_recd))) == NULL) {
if (pev != NULL) *pev = jc_malloc;
p->del(p);
return NULL;
}
if ((p->fname = strdup(fname)) == NULL) {
if (pev != NULL) *pev = jc_malloc;
p->del(p);
return NULL;
}
p->modify = modify == jc_modify ? 1 : 0;
p->create = create == jc_create ? 1 : 0;
p->locate_key = jcnf_locate_key;
p->get_key = jcnf_get_key;
p->set_key = jcnf_set_key;
p->add_key = jcnf_add_key;
p->delete_key = jcnf_delete_key;
p->print_key = jcnf_print_key;
p->enable_modify = jcnf_enable_modify;
p->update = jcnf_update;
p->del = jcnf_del;
if ((ev = jcnf_read(p)) != jc_ok) {
if (ev != jc_noexisting) {
if (pev != NULL) *pev = ev;
p->del(p);
return NULL;
}
}
if (pev != NULL) *pev = jc_ok;
return p;
}
/* ------------------------------- */
/* Return a pointer to the nth element of the key name. */
/* Return null if it is out of range or malloc failed. */
/* Free the returned value when done. */
char *jc_get_nth_elem(char *path, int n) {
int i;
char *p1, *p2, *rv;
if (path == NULL)
return NULL;
p1 = path;
if (*p1 == '/')
p1++;
for (i = 0; *p1 != '\000'; p1 = p2 + 1, i++) {
if ((p2 = strchr(p1, '/')) == NULL)
p2 = p1 + strlen(p1);
if (i >= n) {
if ((rv = malloc(p2 - p1 + 1)) == NULL)
return NULL;
strncpy(rv, p1, p2 - p1);
rv[p2-p1] = '\000';
return rv;
}
if (*p2 == '\000')
break;
}
return NULL;
}
|