1 /* Copyright (c) 2013, Vsevolod Stakhov
2 * Copyright (c) 2015 Allan Jude <allanjude@freebsd.org>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are met:
7 * * Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * * Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 *
13 * THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
15 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
16 * DISCLAIMED. IN NO EVENT SHALL AUTHOR BE LIABLE FOR ANY
17 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
18 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
19 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
20 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
21 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
22 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
23 */
24
25 #include "ucl.h"
26 #include "ucl_internal.h"
27 #include "ucl_chartable.h"
28 #include "kvec.h"
29 #include <limits.h>
30 #include <stdarg.h>
31 #include <stdio.h> /* for snprintf */
32
33 #ifndef _WIN32
34 #include <glob.h>
35 #include <sys/param.h>
36 #else
37 #ifndef NBBY
38 #define NBBY 8
39 #endif
40 #endif
41
42 #ifdef HAVE_LIBGEN_H
43 #ifndef _WIN32
44 #include <libgen.h> /* For dirname */
45 #endif
46 #endif
47
48 typedef kvec_t(ucl_object_t *) ucl_array_t;
49
50 #define UCL_ARRAY_GET(ar, obj) ucl_array_t *ar = \
51 (ucl_array_t *) ((obj) != NULL ? (obj)->value.av : NULL)
52
53 #ifdef HAVE_OPENSSL
54 #include <openssl/err.h>
55 #include <openssl/sha.h>
56 #include <openssl/rsa.h>
57 #include <openssl/ssl.h>
58 #include <openssl/evp.h>
59 #endif
60
61 #ifdef CURL_FOUND
62 /* Seems to be broken */
63 #define CURL_DISABLE_TYPECHECK 1
64 #include <curl/curl.h>
65 #endif
66 #ifdef HAVE_FETCH_H
67 #include <fetch.h>
68 #endif
69
70 #if defined(_WIN32)
71 #include <windows.h>
72 #include <io.h>
73 #include <direct.h>
74
75 #ifndef PROT_READ
76 #define PROT_READ 1
77 #endif
78 #ifndef PROT_WRITE
79 #define PROT_WRITE 2
80 #endif
81 #ifndef PROT_READWRITE
82 #define PROT_READWRITE 3
83 #endif
84 #ifndef MAP_SHARED
85 #define MAP_SHARED 1
86 #endif
87 #ifndef MAP_PRIVATE
88 #define MAP_PRIVATE 2
89 #endif
90 #ifndef MAP_FAILED
91 #define MAP_FAILED ((void *) -1)
92 #endif
93
94 #define getcwd _getcwd
95 #define open _open
96 #define close _close
97
ucl_mmap(char * addr,size_t length,int prot,int access,int fd,off_t offset)98 static void *ucl_mmap(char *addr, size_t length, int prot, int access, int fd, off_t offset)
99 {
100 void *map = NULL;
101 HANDLE handle = INVALID_HANDLE_VALUE;
102
103 switch (prot) {
104 default:
105 case PROT_READ: {
106 handle = CreateFileMapping((HANDLE) _get_osfhandle(fd), 0, PAGE_READONLY, 0, length, 0);
107 if (!handle) break;
108 map = (void *) MapViewOfFile(handle, FILE_MAP_READ, 0, 0, length);
109 CloseHandle(handle);
110 break;
111 }
112 case PROT_WRITE: {
113 handle = CreateFileMapping((HANDLE) _get_osfhandle(fd), 0, PAGE_READWRITE, 0, length, 0);
114 if (!handle) break;
115 map = (void *) MapViewOfFile(handle, FILE_MAP_WRITE, 0, 0, length);
116 CloseHandle(handle);
117 break;
118 }
119 case PROT_READWRITE: {
120 handle = CreateFileMapping((HANDLE) _get_osfhandle(fd), 0, PAGE_READWRITE, 0, length, 0);
121 if (!handle) break;
122 map = (void *) MapViewOfFile(handle, FILE_MAP_ALL_ACCESS, 0, 0, length);
123 CloseHandle(handle);
124 break;
125 }
126 }
127 if (map == (void *) NULL) {
128 return (void *) MAP_FAILED;
129 }
130 return (void *) ((char *) map + offset);
131 }
132
ucl_munmap(void * map,size_t length)133 static int ucl_munmap(void *map, size_t length)
134 {
135 if (!UnmapViewOfFile(map)) {
136 return (-1);
137 }
138 return (0);
139 }
140
ucl_realpath(const char * path,char * resolved_path)141 static char *ucl_realpath(const char *path, char *resolved_path)
142 {
143 char *p;
144 char tmp[MAX_PATH + 1];
145 strncpy(tmp, path, sizeof(tmp) - 1);
146 p = tmp;
147 while (*p) {
148 if (*p == '/') *p = '\\';
149 p++;
150 }
151 return _fullpath(resolved_path, tmp, MAX_PATH);
152 }
153
154
dirname(char * path)155 char *dirname(char *path)
156 {
157 static char path_buffer[_MAX_PATH];
158 char drive[_MAX_DRIVE];
159 char dir[_MAX_DIR];
160 char fname[_MAX_FNAME];
161 char ext[_MAX_EXT];
162
163 _splitpath(path, drive, dir, fname, ext);
164 _makepath(path_buffer, drive, dir, NULL, NULL);
165
166 return path_buffer;
167 }
168
basename(char * path)169 char *basename(char *path)
170 {
171 static char path_buffer[_MAX_PATH];
172 char drive[_MAX_DRIVE];
173 char dir[_MAX_DIR];
174 char fname[_MAX_FNAME];
175 char ext[_MAX_EXT];
176
177 _splitpath(path, drive, dir, fname, ext);
178 _makepath(path_buffer, NULL, NULL, fname, ext);
179
180 return path_buffer;
181 }
182 #else
183 #define ucl_mmap mmap
184 #define ucl_munmap munmap
185 #define ucl_realpath realpath
186 #endif
187
188 typedef void (*ucl_object_dtor)(ucl_object_t *obj);
189 static void ucl_object_free_internal(ucl_object_t *obj, bool allow_rec,
190 ucl_object_dtor dtor);
191 static void ucl_object_dtor_unref(ucl_object_t *obj);
192
193 static void
ucl_object_dtor_free(ucl_object_t * obj)194 ucl_object_dtor_free(ucl_object_t *obj)
195 {
196 if (obj->trash_stack[UCL_TRASH_KEY] != NULL) {
197 UCL_FREE(obj->hh.keylen, obj->trash_stack[UCL_TRASH_KEY]);
198 }
199 if (obj->trash_stack[UCL_TRASH_VALUE] != NULL) {
200 UCL_FREE(obj->len, obj->trash_stack[UCL_TRASH_VALUE]);
201 }
202 /* Do not free ephemeral objects */
203 if ((obj->flags & UCL_OBJECT_EPHEMERAL) == 0) {
204 if (obj->type != UCL_USERDATA) {
205 UCL_FREE(sizeof(ucl_object_t), obj);
206 }
207 else {
208 struct ucl_object_userdata *ud = (struct ucl_object_userdata *) obj;
209 if (ud->dtor) {
210 ud->dtor(obj->value.ud);
211 }
212 UCL_FREE(sizeof(*ud), obj);
213 }
214 }
215 }
216
217 /*
218 * This is a helper function that performs exactly the same as
219 * `ucl_object_unref` but it doesn't iterate over elements allowing
220 * to use it for individual elements of arrays and multiple values
221 */
222 static void
ucl_object_dtor_unref_single(ucl_object_t * obj)223 ucl_object_dtor_unref_single(ucl_object_t *obj)
224 {
225 if (obj != NULL) {
226 #ifdef HAVE_ATOMIC_BUILTINS
227 unsigned int rc = __sync_sub_and_fetch(&obj->ref, 1);
228 if (rc == 0) {
229 #else
230 if (--obj->ref == 0) {
231 #endif
232 ucl_object_free_internal(obj, false, ucl_object_dtor_unref);
233 }
234 }
235 }
236
237 static void
238 ucl_object_dtor_unref(ucl_object_t *obj)
239 {
240 if (obj->ref == 0) {
241 ucl_object_dtor_free(obj);
242 }
243 else {
244 /* This may cause dtor unref being called one more time */
245 ucl_object_dtor_unref_single(obj);
246 }
247 }
248
249 static void
250 ucl_object_free_internal(ucl_object_t *obj, bool allow_rec, ucl_object_dtor dtor)
251 {
252 ucl_object_t *tmp, *sub;
253
254 while (obj != NULL) {
255 if (obj->type == UCL_ARRAY) {
256 UCL_ARRAY_GET(vec, obj);
257 unsigned int i;
258
259 if (vec != NULL) {
260 for (i = 0; i < vec->n; i++) {
261 sub = kv_A(*vec, i);
262 if (sub != NULL) {
263 tmp = sub;
264 while (sub) {
265 tmp = sub->next;
266 dtor(sub);
267 sub = tmp;
268 }
269 }
270 }
271 kv_destroy(*vec);
272 UCL_FREE(sizeof(*vec), vec);
273 }
274 obj->value.av = NULL;
275 }
276 else if (obj->type == UCL_OBJECT) {
277 if (obj->value.ov != NULL) {
278 ucl_hash_destroy(obj->value.ov, (ucl_hash_free_func) dtor);
279 }
280 obj->value.ov = NULL;
281 }
282 tmp = obj->next;
283 dtor(obj);
284 obj = tmp;
285
286 if (!allow_rec) {
287 break;
288 }
289 }
290 }
291
292 void ucl_object_free(ucl_object_t *obj)
293 {
294 ucl_object_free_internal(obj, true, ucl_object_dtor_free);
295 }
296
297 size_t
298 ucl_unescape_json_string(char *str, size_t len)
299 {
300 char *t = str, *h = str;
301 int i, uval;
302
303 if (len <= 1) {
304 return len;
305 }
306 /* t is target (tortoise), h is source (hare) */
307
308 while (len) {
309 if (*h == '\\') {
310 h++;
311
312 if (len == 1) {
313 /*
314 * If \ is last, then do not try to go further
315 * Issue: #74
316 */
317 len--;
318 *t++ = '\\';
319 continue;
320 }
321
322 switch (*h) {
323 case 'n':
324 *t++ = '\n';
325 break;
326 case 'r':
327 *t++ = '\r';
328 break;
329 case 'b':
330 *t++ = '\b';
331 break;
332 case 't':
333 *t++ = '\t';
334 break;
335 case 'f':
336 *t++ = '\f';
337 break;
338 case '\\':
339 *t++ = '\\';
340 break;
341 case '"':
342 *t++ = '"';
343 break;
344 case 'u':
345 /* Unicode escape */
346 uval = 0;
347 h++; /* u character */
348 len--;
349
350 if (len > 3) {
351 for (i = 0; i < 4; i++) {
352 uval <<= 4;
353 if (isdigit(h[i])) {
354 uval += h[i] - '0';
355 }
356 else if (h[i] >= 'a' && h[i] <= 'f') {
357 uval += h[i] - 'a' + 10;
358 }
359 else if (h[i] >= 'A' && h[i] <= 'F') {
360 uval += h[i] - 'A' + 10;
361 }
362 else {
363 break;
364 }
365 }
366
367 /* Encode */
368 if (uval < 0x80) {
369 t[0] = (char) uval;
370 t++;
371 }
372 else if (uval < 0x800) {
373 t[0] = 0xC0 + ((uval & 0x7C0) >> 6);
374 t[1] = 0x80 + ((uval & 0x03F));
375 t += 2;
376 }
377 else if (uval < 0x10000) {
378 t[0] = 0xE0 + ((uval & 0xF000) >> 12);
379 t[1] = 0x80 + ((uval & 0x0FC0) >> 6);
380 t[2] = 0x80 + ((uval & 0x003F));
381 t += 3;
382 }
383 #if 0
384 /* It's not actually supported now */
385 else if(uval <= 0x10FFFF) {
386 t[0] = 0xF0 + ((uval & 0x1C0000) >> 18);
387 t[1] = 0x80 + ((uval & 0x03F000) >> 12);
388 t[2] = 0x80 + ((uval & 0x000FC0) >> 6);
389 t[3] = 0x80 + ((uval & 0x00003F));
390 t += 4;
391 }
392 #endif
393 else {
394 *t++ = '?';
395 }
396
397 /* Consume 4 characters of source */
398 h += 4;
399 len -= 4;
400
401 if (len > 0) {
402 len--; /* for '\' character */
403 }
404 continue;
405 }
406 else {
407 *t++ = 'u';
408 }
409 break;
410 default:
411 *t++ = *h;
412 break;
413 }
414 h++;
415 len--;
416 }
417 else {
418 *t++ = *h++;
419 }
420
421 if (len > 0) {
422 len--;
423 }
424 }
425 *t = '\0';
426
427 return (t - str);
428 }
429
430 size_t
431 ucl_unescape_squoted_string(char *str, size_t len)
432 {
433 char *t = str, *h = str;
434
435 if (len <= 1) {
436 return len;
437 }
438
439 /* t is target (tortoise), h is source (hare) */
440
441 while (len) {
442 if (*h == '\\') {
443 h++;
444
445 if (len == 1) {
446 /*
447 * If \ is last, then do not try to go further
448 * Issue: #74
449 */
450 len--;
451 *t++ = '\\';
452 continue;
453 }
454
455 switch (*h) {
456 case '\'':
457 *t++ = '\'';
458 break;
459 case '\n':
460 /* Ignore \<newline> style stuff */
461 break;
462 case '\r':
463 /* Ignore \r and the following \n if needed */
464 if (len > 1 && h[1] == '\n') {
465 h++;
466 len--;
467 }
468 break;
469 default:
470 /* Ignore \ */
471 *t++ = '\\';
472 *t++ = *h;
473 break;
474 }
475
476 h++;
477 len--;
478 }
479 else {
480 *t++ = *h++;
481 }
482
483 if (len > 0) {
484 len--;
485 }
486 }
487
488 *t = '\0';
489
490 return (t - str);
491 }
492
493 char *
494 ucl_copy_key_trash(const ucl_object_t *obj)
495 {
496 ucl_object_t *deconst;
497
498 if (obj == NULL) {
499 return NULL;
500 }
501 if (obj->trash_stack[UCL_TRASH_KEY] == NULL && obj->key != NULL) {
502 deconst = __DECONST(ucl_object_t *, obj);
503 deconst->trash_stack[UCL_TRASH_KEY] = malloc(obj->keylen + 1);
504 if (deconst->trash_stack[UCL_TRASH_KEY] != NULL) {
505 memcpy(deconst->trash_stack[UCL_TRASH_KEY], obj->key, obj->keylen);
506 deconst->trash_stack[UCL_TRASH_KEY][obj->keylen] = '\0';
507 }
508 deconst->key = obj->trash_stack[UCL_TRASH_KEY];
509 deconst->flags |= UCL_OBJECT_ALLOCATED_KEY;
510 }
511
512 return obj->trash_stack[UCL_TRASH_KEY];
513 }
514
515 void ucl_chunk_free(struct ucl_chunk *chunk)
516 {
517 if (chunk) {
518 struct ucl_parser_special_handler_chain *chain, *tmp;
519
520 LL_FOREACH_SAFE(chunk->special_handlers, chain, tmp)
521 {
522 if (chain->special_handler->free_function) {
523 chain->special_handler->free_function(
524 chain->begin,
525 chain->len,
526 chain->special_handler->user_data);
527 }
528 else {
529 UCL_FREE(chain->len, chain->begin);
530 }
531
532 UCL_FREE(sizeof(*chain), chain);
533 }
534
535 chunk->special_handlers = NULL;
536
537 if (chunk->fname) {
538 free(chunk->fname);
539 }
540
541 UCL_FREE(sizeof(*chunk), chunk);
542 }
543 }
544
545 char *
546 ucl_copy_value_trash(const ucl_object_t *obj)
547 {
548 ucl_object_t *deconst;
549
550 if (obj == NULL) {
551 return NULL;
552 }
553 if (obj->trash_stack[UCL_TRASH_VALUE] == NULL) {
554 deconst = __DECONST(ucl_object_t *, obj);
555 if (obj->type == UCL_STRING) {
556
557 /* Special case for strings */
558 if (obj->flags & UCL_OBJECT_BINARY) {
559 deconst->trash_stack[UCL_TRASH_VALUE] = malloc(obj->len);
560 if (deconst->trash_stack[UCL_TRASH_VALUE] != NULL) {
561 memcpy(deconst->trash_stack[UCL_TRASH_VALUE],
562 obj->value.sv,
563 obj->len);
564 deconst->value.sv = obj->trash_stack[UCL_TRASH_VALUE];
565 }
566 }
567 else {
568 deconst->trash_stack[UCL_TRASH_VALUE] = malloc(obj->len + 1);
569 if (deconst->trash_stack[UCL_TRASH_VALUE] != NULL) {
570 memcpy(deconst->trash_stack[UCL_TRASH_VALUE],
571 obj->value.sv,
572 obj->len);
573 deconst->trash_stack[UCL_TRASH_VALUE][obj->len] = '\0';
574 deconst->value.sv = obj->trash_stack[UCL_TRASH_VALUE];
575 }
576 }
577 }
578 else {
579 /* Just emit value in json notation */
580 deconst->trash_stack[UCL_TRASH_VALUE] = ucl_object_emit_single_json(obj);
581 deconst->len = strlen(obj->trash_stack[UCL_TRASH_VALUE]);
582 }
583 deconst->flags |= UCL_OBJECT_ALLOCATED_VALUE;
584 }
585
586 return obj->trash_stack[UCL_TRASH_VALUE];
587 }
588
589 ucl_object_t *
590 ucl_parser_get_object(struct ucl_parser *parser)
591 {
592 if (parser->state != UCL_STATE_ERROR && parser->top_obj != NULL) {
593 return ucl_object_ref(parser->top_obj);
594 }
595
596 return NULL;
597 }
598
599 void ucl_parser_free(struct ucl_parser *parser)
600 {
601 struct ucl_stack *stack, *stmp;
602 struct ucl_macro *macro, *mtmp;
603 struct ucl_chunk *chunk, *ctmp;
604 struct ucl_pubkey *key, *ktmp;
605 struct ucl_variable *var, *vtmp;
606 ucl_object_t *tr, *trtmp;
607
608 if (parser == NULL) {
609 return;
610 }
611
612 if (parser->top_obj != NULL) {
613 ucl_object_unref(parser->top_obj);
614 }
615
616 if (parser->includepaths != NULL) {
617 ucl_object_unref(parser->includepaths);
618 }
619
620 LL_FOREACH_SAFE(parser->stack, stack, stmp)
621 {
622 free(stack);
623 }
624 HASH_ITER(hh, parser->macroes, macro, mtmp)
625 {
626 free(macro->name);
627 HASH_DEL(parser->macroes, macro);
628 UCL_FREE(sizeof(struct ucl_macro), macro);
629 }
630 LL_FOREACH_SAFE(parser->chunks, chunk, ctmp)
631 {
632 ucl_chunk_free(chunk);
633 }
634 LL_FOREACH_SAFE(parser->keys, key, ktmp)
635 {
636 UCL_FREE(sizeof(struct ucl_pubkey), key);
637 }
638 LL_FOREACH_SAFE(parser->variables, var, vtmp)
639 {
640 free(var->value);
641 free(var->var);
642 UCL_FREE(sizeof(struct ucl_variable), var);
643 }
644 LL_FOREACH_SAFE(parser->trash_objs, tr, trtmp)
645 {
646 ucl_object_free_internal(tr, false, ucl_object_dtor_free);
647 }
648
649 if (parser->err != NULL) {
650 utstring_free(parser->err);
651 }
652
653 if (parser->cur_file) {
654 UCL_FREE(strlen(parser->cur_file) + 1, parser->cur_file);
655 }
656
657 if (parser->comments) {
658 ucl_object_unref(parser->comments);
659 }
660
661 UCL_FREE(sizeof(struct ucl_parser), parser);
662 }
663
664 const char *
665 ucl_parser_get_error(struct ucl_parser *parser)
666 {
667 if (parser == NULL) {
668 return NULL;
669 }
670
671 if (parser->err == NULL) {
672 return NULL;
673 }
674
675 return utstring_body(parser->err);
676 }
677
678 int ucl_parser_get_error_code(struct ucl_parser *parser)
679 {
680 if (parser == NULL) {
681 return 0;
682 }
683
684 return parser->err_code;
685 }
686
687 unsigned
688 ucl_parser_get_column(struct ucl_parser *parser)
689 {
690 if (parser == NULL || parser->chunks == NULL) {
691 return 0;
692 }
693
694 return parser->chunks->column;
695 }
696
697 unsigned
698 ucl_parser_get_linenum(struct ucl_parser *parser)
699 {
700 if (parser == NULL || parser->chunks == NULL) {
701 return 0;
702 }
703
704 return parser->chunks->line;
705 }
706
707 void ucl_parser_clear_error(struct ucl_parser *parser)
708 {
709 if (parser != NULL && parser->err != NULL) {
710 utstring_free(parser->err);
711 parser->err = NULL;
712 parser->err_code = 0;
713 }
714 }
715
716 bool ucl_pubkey_add(struct ucl_parser *parser, const unsigned char *key, size_t len)
717 {
718 #ifndef HAVE_OPENSSL
719 ucl_create_err(&parser->err, "cannot check signatures without openssl");
720 return false;
721 #else
722 #if (OPENSSL_VERSION_NUMBER < 0x10000000L)
723 ucl_create_err(&parser->err, "cannot check signatures, openssl version is unsupported");
724 return EXIT_FAILURE;
725 #else
726 struct ucl_pubkey *nkey;
727 BIO *mem;
728
729 mem = BIO_new_mem_buf((void *) key, len);
730 nkey = UCL_ALLOC(sizeof(struct ucl_pubkey));
731 if (nkey == NULL) {
732 ucl_create_err(&parser->err, "cannot allocate memory for key");
733 return false;
734 }
735 nkey->key = PEM_read_bio_PUBKEY(mem, &nkey->key, NULL, NULL);
736 BIO_free(mem);
737 if (nkey->key == NULL) {
738 UCL_FREE(sizeof(struct ucl_pubkey), nkey);
739 ucl_create_err(&parser->err, "%s",
740 ERR_error_string(ERR_get_error(), NULL));
741 return false;
742 }
743 LL_PREPEND(parser->keys, nkey);
744 #endif
745 #endif
746 return true;
747 }
748
749 void ucl_parser_add_special_handler(struct ucl_parser *parser,
750 struct ucl_parser_special_handler *handler)
751 {
752 LL_APPEND(parser->special_handlers, handler);
753 }
754
755 #ifdef CURL_FOUND
756 struct ucl_curl_cbdata {
757 unsigned char *buf;
758 size_t buflen;
759 };
760
761 static size_t
762 ucl_curl_write_callback(void *contents, size_t size, size_t nmemb, void *ud)
763 {
764 struct ucl_curl_cbdata *cbdata = ud;
765 size_t realsize = size * nmemb;
766
767 cbdata->buf = realloc(cbdata->buf, cbdata->buflen + realsize + 1);
768 if (cbdata->buf == NULL) {
769 return 0;
770 }
771
772 memcpy(&(cbdata->buf[cbdata->buflen]), contents, realsize);
773 cbdata->buflen += realsize;
774 cbdata->buf[cbdata->buflen] = 0;
775
776 return realsize;
777 }
778 #endif
779
780 /**
781 * Fetch a url and save results to the memory buffer
782 * @param url url to fetch
783 * @param len length of url
784 * @param buf target buffer
785 * @param buflen target length
786 * @return
787 */
788 bool ucl_fetch_url(const unsigned char *url, unsigned char **buf, size_t *buflen,
789 UT_string **err, bool must_exist)
790 {
791
792 #ifdef HAVE_FETCH_H
793 struct url *fetch_url;
794 struct url_stat us;
795 FILE *in;
796
797 fetch_url = fetchParseURL(url);
798 if (fetch_url == NULL) {
799 ucl_create_err(err, "invalid URL %s: %s",
800 url, strerror(errno));
801 return false;
802 }
803 if ((in = fetchXGet(fetch_url, &us, "")) == NULL) {
804 if (!must_exist) {
805 ucl_create_err(err, "cannot fetch URL %s: %s",
806 url, strerror(errno));
807 }
808 fetchFreeURL(fetch_url);
809 return false;
810 }
811
812 *buflen = us.size;
813 *buf = malloc(*buflen);
814 if (*buf == NULL) {
815 ucl_create_err(err, "cannot allocate buffer for URL %s: %s",
816 url, strerror(errno));
817 fclose(in);
818 fetchFreeURL(fetch_url);
819 return false;
820 }
821
822 if (fread(*buf, *buflen, 1, in) != 1) {
823 ucl_create_err(err, "cannot read URL %s: %s",
824 url, strerror(errno));
825 fclose(in);
826 fetchFreeURL(fetch_url);
827 return false;
828 }
829
830 fetchFreeURL(fetch_url);
831 return true;
832 #elif defined(CURL_FOUND)
833 CURL *curl;
834 int r;
835 struct ucl_curl_cbdata cbdata;
836
837 curl = curl_easy_init();
838 if (curl == NULL) {
839 ucl_create_err(err, "CURL interface is broken");
840 return false;
841 }
842 if ((r = curl_easy_setopt(curl, CURLOPT_URL, url)) != CURLE_OK) {
843 ucl_create_err(err, "invalid URL %s: %s",
844 url, curl_easy_strerror(r));
845 curl_easy_cleanup(curl);
846 return false;
847 }
848 curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, ucl_curl_write_callback);
849 cbdata.buf = NULL;
850 cbdata.buflen = 0;
851 curl_easy_setopt(curl, CURLOPT_WRITEDATA, &cbdata);
852
853 if ((r = curl_easy_perform(curl)) != CURLE_OK) {
854 if (!must_exist) {
855 ucl_create_err(err, "error fetching URL %s: %s",
856 url, curl_easy_strerror(r));
857 }
858 curl_easy_cleanup(curl);
859 if (cbdata.buf) {
860 free(cbdata.buf);
861 }
862 return false;
863 }
864 *buf = cbdata.buf;
865 *buflen = cbdata.buflen;
866
867 curl_easy_cleanup(curl);
868
869 return true;
870 #else
871 ucl_create_err(err, "URL support is disabled");
872 return false;
873 #endif
874 }
875
876 /**
877 * Fetch a file and save results to the memory buffer
878 * @param filename filename to fetch
879 * @param len length of filename
880 * @param buf target buffer
881 * @param buflen target length
882 * @return
883 */
884 bool ucl_fetch_file(const unsigned char *filename, unsigned char **buf, size_t *buflen,
885 UT_string **err, bool must_exist)
886 {
887 int fd;
888 struct stat st;
889 if ((fd = open(filename, O_RDONLY)) == -1) {
890 ucl_create_err(err, "cannot open file %s: %s",
891 filename, strerror(errno));
892 return false;
893 }
894
895 if (fstat(fd, &st) == -1) {
896 if (must_exist || errno == EPERM) {
897 ucl_create_err(err, "cannot stat file %s: %s",
898 filename, strerror(errno));
899 }
900 close(fd);
901
902 return false;
903 }
904 if (!S_ISREG(st.st_mode)) {
905 if (must_exist) {
906 ucl_create_err(err, "file %s is not a regular file", filename);
907 }
908 close(fd);
909
910 return false;
911 }
912
913 if (st.st_size == 0) {
914 /* Do not map empty files */
915 *buf = NULL;
916 *buflen = 0;
917 }
918 else {
919 if ((*buf = ucl_mmap(NULL, st.st_size, PROT_READ, MAP_SHARED, fd, 0)) == MAP_FAILED) {
920 close(fd);
921 ucl_create_err(err, "cannot mmap file %s: %s",
922 filename, strerror(errno));
923 *buf = NULL;
924
925 return false;
926 }
927 *buflen = st.st_size;
928 }
929
930 close(fd);
931
932 return true;
933 }
934
935
936 #if (defined(HAVE_OPENSSL) && OPENSSL_VERSION_NUMBER >= 0x10000000L)
937 static inline bool
938 ucl_sig_check(const unsigned char *data, size_t datalen,
939 const unsigned char *sig, size_t siglen, struct ucl_parser *parser)
940 {
941 struct ucl_pubkey *key;
942 char dig[EVP_MAX_MD_SIZE];
943 unsigned int diglen;
944 EVP_PKEY_CTX *key_ctx;
945 EVP_MD_CTX *sign_ctx = NULL;
946
947 sign_ctx = EVP_MD_CTX_create();
948
949 LL_FOREACH(parser->keys, key)
950 {
951 key_ctx = EVP_PKEY_CTX_new(key->key, NULL);
952 if (key_ctx != NULL) {
953 if (EVP_PKEY_verify_init(key_ctx) <= 0) {
954 EVP_PKEY_CTX_free(key_ctx);
955 continue;
956 }
957 if (EVP_PKEY_CTX_set_rsa_padding(key_ctx, RSA_PKCS1_PADDING) <= 0) {
958 EVP_PKEY_CTX_free(key_ctx);
959 continue;
960 }
961 if (EVP_PKEY_CTX_set_signature_md(key_ctx, EVP_sha256()) <= 0) {
962 EVP_PKEY_CTX_free(key_ctx);
963 continue;
964 }
965 EVP_DigestInit(sign_ctx, EVP_sha256());
966 EVP_DigestUpdate(sign_ctx, data, datalen);
967 EVP_DigestFinal(sign_ctx, dig, &diglen);
968
969 if (EVP_PKEY_verify(key_ctx, sig, siglen, dig, diglen) == 1) {
970 EVP_MD_CTX_destroy(sign_ctx);
971 EVP_PKEY_CTX_free(key_ctx);
972 return true;
973 }
974
975 EVP_PKEY_CTX_free(key_ctx);
976 }
977 }
978
979 EVP_MD_CTX_destroy(sign_ctx);
980
981 return false;
982 }
983 #endif
984
985 struct ucl_include_params {
986 bool check_signature;
987 bool must_exist;
988 bool use_glob;
989 bool use_prefix;
990 bool soft_fail;
991 bool allow_glob;
992 unsigned priority;
993 enum ucl_duplicate_strategy strat;
994 enum ucl_parse_type parse_type;
995 const char *prefix;
996 const char *target;
997 };
998
999 /**
1000 * Include an url to configuration
1001 * @param data
1002 * @param len
1003 * @param parser
1004 * @param err
1005 * @return
1006 */
1007 static bool
1008 ucl_include_url(const unsigned char *data, size_t len,
1009 struct ucl_parser *parser,
1010 struct ucl_include_params *params)
1011 {
1012
1013 bool res;
1014 unsigned char *buf = NULL;
1015 size_t buflen = 0;
1016 struct ucl_chunk *chunk;
1017 char urlbuf[PATH_MAX];
1018 int prev_state;
1019
1020 snprintf(urlbuf, sizeof(urlbuf), "%.*s", (int) len, data);
1021
1022 if (!ucl_fetch_url(urlbuf, &buf, &buflen, &parser->err, params->must_exist)) {
1023 if (!params->must_exist) {
1024 ucl_parser_clear_error(parser);
1025 }
1026 return !params->must_exist;
1027 }
1028
1029 if (params->check_signature) {
1030 #if (defined(HAVE_OPENSSL) && OPENSSL_VERSION_NUMBER >= 0x10000000L)
1031 unsigned char *sigbuf = NULL;
1032 size_t siglen = 0;
1033 /* We need to check signature first */
1034 snprintf(urlbuf, sizeof(urlbuf), "%.*s.sig", (int) len, data);
1035 if (!ucl_fetch_url(urlbuf, &sigbuf, &siglen, &parser->err, true)) {
1036 return false;
1037 }
1038 if (!ucl_sig_check(buf, buflen, sigbuf, siglen, parser)) {
1039 ucl_create_err(&parser->err, "cannot verify url %s: %s",
1040 urlbuf,
1041 ERR_error_string(ERR_get_error(), NULL));
1042 if (siglen > 0) {
1043 free(sigbuf);
1044 }
1045 return false;
1046 }
1047 if (siglen > 0) {
1048 free(sigbuf);
1049 }
1050 #endif
1051 }
1052
1053 prev_state = parser->state;
1054 parser->state = UCL_STATE_INIT;
1055
1056 res = ucl_parser_add_chunk_full(parser, buf, buflen, params->priority,
1057 params->strat, params->parse_type);
1058 if (res == true) {
1059 /* Remove chunk from the stack */
1060 chunk = parser->chunks;
1061 if (chunk != NULL) {
1062 parser->chunks = chunk->next;
1063 ucl_chunk_free(chunk);
1064 }
1065 }
1066
1067 parser->state = prev_state;
1068 free(buf);
1069
1070 return res;
1071 }
1072
1073 /**
1074 * Include a single file to the parser
1075 * @param data
1076 * @param len
1077 * @param parser
1078 * @param check_signature
1079 * @param must_exist
1080 * @param allow_glob
1081 * @param priority
1082 * @return
1083 */
1084 static bool
1085 ucl_include_file_single(const unsigned char *data, size_t len,
1086 struct ucl_parser *parser, struct ucl_include_params *params)
1087 {
1088 bool res;
1089 struct ucl_chunk *chunk;
1090 unsigned char *buf = NULL;
1091 char *old_curfile, *ext;
1092 size_t buflen = 0;
1093 char filebuf[PATH_MAX], realbuf[PATH_MAX];
1094 int prev_state;
1095 struct ucl_variable *cur_var, *tmp_var, *old_curdir = NULL,
1096 *old_filename = NULL;
1097 ucl_object_t *nest_obj = NULL, *old_obj = NULL, *new_obj = NULL;
1098 ucl_hash_t *container = NULL;
1099 struct ucl_stack *st = NULL;
1100
1101 if (parser->state == UCL_STATE_ERROR) {
1102 /* Return immediately if we are in the error state... */
1103 return false;
1104 }
1105
1106 snprintf(filebuf, sizeof(filebuf), "%.*s", (int) len, data);
1107 if (ucl_realpath(filebuf, realbuf) == NULL) {
1108 if (params->soft_fail) {
1109 return false;
1110 }
1111 if (!params->must_exist && errno != EPERM) {
1112 return true;
1113 }
1114
1115 ucl_create_err(&parser->err, "cannot open file %s: %s",
1116 filebuf,
1117 strerror(errno));
1118 return false;
1119 }
1120
1121 if (parser->cur_file && strcmp(realbuf, parser->cur_file) == 0) {
1122 /* We are likely including the file itself */
1123 if (params->soft_fail) {
1124 return false;
1125 }
1126
1127 ucl_create_err(&parser->err, "trying to include the file %s from itself",
1128 realbuf);
1129 return false;
1130 }
1131
1132 if (!ucl_fetch_file(realbuf, &buf, &buflen, &parser->err, params->must_exist)) {
1133 if (params->soft_fail) {
1134 return false;
1135 }
1136
1137 if (params->must_exist || parser->err != NULL) {
1138 /* The case of fatal errors */
1139 return false;
1140 }
1141
1142 ucl_parser_clear_error(parser);
1143
1144 return true;
1145 }
1146
1147 if (params->check_signature) {
1148 #if (defined(HAVE_OPENSSL) && OPENSSL_VERSION_NUMBER >= 0x10000000L)
1149 unsigned char *sigbuf = NULL;
1150 size_t siglen = 0;
1151 /* We need to check signature first */
1152 snprintf(filebuf, sizeof(filebuf), "%s.sig", realbuf);
1153 if (!ucl_fetch_file(filebuf, &sigbuf, &siglen, &parser->err, true)) {
1154 if (buf) {
1155 ucl_munmap(buf, buflen);
1156 }
1157
1158 return false;
1159 }
1160 if (!ucl_sig_check(buf, buflen, sigbuf, siglen, parser)) {
1161 ucl_create_err(&parser->err, "cannot verify file %s: %s",
1162 filebuf,
1163 ERR_error_string(ERR_get_error(), NULL));
1164 if (sigbuf) {
1165 ucl_munmap(sigbuf, siglen);
1166 }
1167 if (buf) {
1168 ucl_munmap(buf, buflen);
1169 }
1170
1171 return false;
1172 }
1173
1174 if (sigbuf) {
1175 ucl_munmap(sigbuf, siglen);
1176 }
1177 #endif
1178 }
1179
1180 old_curfile = parser->cur_file;
1181 parser->cur_file = NULL;
1182
1183 /* Store old file vars */
1184 DL_FOREACH_SAFE(parser->variables, cur_var, tmp_var)
1185 {
1186 if (strcmp(cur_var->var, "CURDIR") == 0) {
1187 old_curdir = cur_var;
1188 DL_DELETE(parser->variables, cur_var);
1189 }
1190 else if (strcmp(cur_var->var, "FILENAME") == 0) {
1191 old_filename = cur_var;
1192 DL_DELETE(parser->variables, cur_var);
1193 }
1194 }
1195
1196 ucl_parser_set_filevars(parser, realbuf, false);
1197
1198 prev_state = parser->state;
1199 parser->state = UCL_STATE_INIT;
1200
1201 if (params->use_prefix && params->prefix == NULL) {
1202 /* Auto generate a key name based on the included filename */
1203 params->prefix = basename(realbuf);
1204 ext = strrchr(params->prefix, '.');
1205 if (ext != NULL && (strcmp(ext, ".conf") == 0 || strcmp(ext, ".ucl") == 0)) {
1206 /* Strip off .conf or .ucl */
1207 *ext = '\0';
1208 }
1209 }
1210 if (params->prefix != NULL) {
1211 /* This is a prefixed include */
1212 container = parser->stack->obj->value.ov;
1213
1214 old_obj = __DECONST(ucl_object_t *, ucl_hash_search(container,
1215 params->prefix, strlen(params->prefix)));
1216
1217 if (strcasecmp(params->target, "array") == 0) {
1218 if (old_obj == NULL) {
1219 /* Create an array with key: prefix */
1220 old_obj = ucl_object_new_full(UCL_ARRAY, params->priority);
1221 old_obj->key = params->prefix;
1222 old_obj->keylen = strlen(params->prefix);
1223 ucl_copy_key_trash(old_obj);
1224 old_obj->prev = old_obj;
1225 old_obj->next = NULL;
1226
1227 container = ucl_hash_insert_object(container, old_obj,
1228 parser->flags & UCL_PARSER_KEY_LOWERCASE);
1229 parser->stack->obj->len++;
1230
1231 nest_obj = ucl_object_new_full(UCL_OBJECT, params->priority);
1232 nest_obj->prev = nest_obj;
1233 nest_obj->next = NULL;
1234
1235 ucl_array_append(old_obj, nest_obj);
1236 }
1237 else {
1238 if (ucl_object_type(old_obj) == UCL_ARRAY) {
1239 /* Append to the existing array */
1240 nest_obj = ucl_object_new_full(UCL_OBJECT,
1241 params->priority);
1242 if (nest_obj == NULL) {
1243 ucl_create_err(&parser->err,
1244 "cannot allocate memory for an object");
1245 if (buf) {
1246 ucl_munmap(buf, buflen);
1247 }
1248
1249 return false;
1250 }
1251 nest_obj->prev = nest_obj;
1252 nest_obj->next = NULL;
1253
1254 ucl_array_append(old_obj, nest_obj);
1255 }
1256 else {
1257 /* Convert the object to an array */
1258 new_obj = ucl_object_typed_new(UCL_ARRAY);
1259 if (new_obj == NULL) {
1260 ucl_create_err(&parser->err,
1261 "cannot allocate memory for an object");
1262 if (buf) {
1263 ucl_munmap(buf, buflen);
1264 }
1265
1266 return false;
1267 }
1268 new_obj->key = old_obj->key;
1269 new_obj->keylen = old_obj->keylen;
1270 new_obj->flags |= UCL_OBJECT_MULTIVALUE;
1271 new_obj->prev = new_obj;
1272 new_obj->next = NULL;
1273
1274 nest_obj = ucl_object_new_full(UCL_OBJECT,
1275 params->priority);
1276 if (nest_obj == NULL) {
1277 ucl_create_err(&parser->err,
1278 "cannot allocate memory for an object");
1279 if (buf) {
1280 ucl_munmap(buf, buflen);
1281 }
1282
1283 ucl_object_unref(new_obj);
1284
1285 return false;
1286 }
1287 nest_obj->prev = nest_obj;
1288 nest_obj->next = NULL;
1289
1290 ucl_array_append(new_obj, old_obj);
1291 ucl_array_append(new_obj, nest_obj);
1292 ucl_hash_replace(container, old_obj, new_obj);
1293 }
1294 }
1295 }
1296 else {
1297 /* Case of object */
1298 if (old_obj == NULL) {
1299 /* Create an object with key: prefix */
1300 nest_obj = ucl_object_new_full(UCL_OBJECT, params->priority);
1301
1302 if (nest_obj == NULL) {
1303 ucl_create_err(&parser->err, "cannot allocate memory for an object");
1304 if (buf) {
1305 ucl_munmap(buf, buflen);
1306 }
1307
1308 return false;
1309 }
1310
1311 nest_obj->key = params->prefix;
1312 nest_obj->keylen = strlen(params->prefix);
1313 ucl_copy_key_trash(nest_obj);
1314 nest_obj->prev = nest_obj;
1315 nest_obj->next = NULL;
1316
1317 container = ucl_hash_insert_object(container, nest_obj,
1318 parser->flags & UCL_PARSER_KEY_LOWERCASE);
1319 parser->stack->obj->len++;
1320 }
1321 else {
1322 if (ucl_object_type(old_obj) == UCL_OBJECT) {
1323 /* Append to existing Object*/
1324 nest_obj = old_obj;
1325 }
1326 else {
1327 /* The key is not an object */
1328 ucl_create_err(&parser->err,
1329 "Conflicting type for key: %s, asked %s, has %s",
1330 params->prefix, params->target,
1331 ucl_object_type_to_string(ucl_object_type(old_obj)));
1332 if (buf) {
1333 ucl_munmap(buf, buflen);
1334 }
1335
1336 return false;
1337 }
1338 }
1339 }
1340
1341
1342 /* Put all of the content of the include inside that object */
1343 parser->stack->obj->value.ov = container;
1344
1345 st = UCL_ALLOC(sizeof(struct ucl_stack));
1346 if (st == NULL) {
1347 ucl_create_err(&parser->err, "cannot allocate memory for an object");
1348 ucl_object_unref(nest_obj);
1349
1350 if (buf) {
1351 ucl_munmap(buf, buflen);
1352 }
1353
1354 return false;
1355 }
1356 st->obj = nest_obj;
1357 st->e.params.level = parser->stack->e.params.level;
1358 st->e.params.flags = parser->stack->e.params.flags;
1359 st->e.params.line = parser->stack->e.params.line;
1360 st->chunk = parser->chunks;
1361 LL_PREPEND(parser->stack, st);
1362 parser->cur_obj = nest_obj;
1363 }
1364
1365 res = ucl_parser_add_chunk_full(parser, buf, buflen, params->priority,
1366 params->strat, params->parse_type);
1367
1368 if (res) {
1369 /* Stop nesting the include, take 1 level off the stack */
1370 if (params->prefix != NULL && nest_obj != NULL) {
1371 parser->stack = st->next;
1372 UCL_FREE(sizeof(struct ucl_stack), st);
1373 }
1374
1375 /* Remove chunk from the stack */
1376 chunk = parser->chunks;
1377 if (chunk != NULL) {
1378 parser->chunks = chunk->next;
1379 ucl_chunk_free(chunk);
1380 parser->recursion--;
1381 }
1382
1383 /* Restore old file vars */
1384 if (parser->cur_file) {
1385 UCL_FREE(strlen(parser->cur_file) + 1, parser->cur_file);
1386 }
1387
1388 parser->cur_file = old_curfile;
1389 DL_FOREACH_SAFE(parser->variables, cur_var, tmp_var)
1390 {
1391 if (strcmp(cur_var->var, "CURDIR") == 0 && old_curdir) {
1392 DL_DELETE(parser->variables, cur_var);
1393 free(cur_var->var);
1394 free(cur_var->value);
1395 UCL_FREE(sizeof(struct ucl_variable), cur_var);
1396 }
1397 else if (strcmp(cur_var->var, "FILENAME") == 0 && old_filename) {
1398 DL_DELETE(parser->variables, cur_var);
1399 free(cur_var->var);
1400 free(cur_var->value);
1401 UCL_FREE(sizeof(struct ucl_variable), cur_var);
1402 }
1403 }
1404 if (old_filename) {
1405 DL_APPEND(parser->variables, old_filename);
1406 }
1407 if (old_curdir) {
1408 DL_APPEND(parser->variables, old_curdir);
1409 }
1410
1411 parser->state = prev_state;
1412 }
1413
1414 if (buflen > 0) {
1415 ucl_munmap(buf, buflen);
1416 }
1417
1418 return res;
1419 }
1420
1421 /**
1422 * Include a file to configuration
1423 * @param data
1424 * @param len
1425 * @param parser
1426 * @param err
1427 * @return
1428 */
1429 static bool
1430 ucl_include_file(const unsigned char *data, size_t len,
1431 struct ucl_parser *parser,
1432 struct ucl_include_params *params,
1433 const ucl_object_t *args)
1434 {
1435 const unsigned char *p = data, *end = data + len;
1436 bool need_glob = false;
1437 int cnt = 0;
1438 char glob_pattern[PATH_MAX];
1439 size_t i;
1440
1441 #ifndef _WIN32
1442 if (!params->allow_glob) {
1443 return ucl_include_file_single(data, len, parser, params);
1444 }
1445 else {
1446 /* Check for special symbols in a filename */
1447 while (p != end) {
1448 if (*p == '*' || *p == '?') {
1449 need_glob = true;
1450 break;
1451 }
1452 p++;
1453 }
1454 if (need_glob) {
1455 glob_t globbuf;
1456 memset(&globbuf, 0, sizeof(globbuf));
1457 ucl_strlcpy(glob_pattern, (const char *) data,
1458 (len + 1 < sizeof(glob_pattern) ? len + 1 : sizeof(glob_pattern)));
1459 if (glob(glob_pattern, 0, NULL, &globbuf) != 0) {
1460 return (!params->must_exist || false);
1461 }
1462 for (i = 0; i < globbuf.gl_pathc; i++) {
1463
1464 if (parser->include_trace_func) {
1465 const ucl_object_t *parent = NULL;
1466
1467 if (parser->stack) {
1468 parent = parser->stack->obj;
1469 }
1470
1471 parser->include_trace_func(parser, parent, NULL,
1472 globbuf.gl_pathv[i],
1473 strlen(globbuf.gl_pathv[i]),
1474 parser->include_trace_ud);
1475 }
1476
1477 if (!ucl_include_file_single((unsigned char *) globbuf.gl_pathv[i],
1478 strlen(globbuf.gl_pathv[i]), parser, params)) {
1479 if (params->soft_fail) {
1480 continue;
1481 }
1482 globfree(&globbuf);
1483 return false;
1484 }
1485 cnt++;
1486 }
1487 globfree(&globbuf);
1488
1489 if (cnt == 0 && params->must_exist) {
1490 ucl_create_err(&parser->err, "cannot match any files for pattern %s",
1491 glob_pattern);
1492 return false;
1493 }
1494 }
1495 else {
1496 return ucl_include_file_single(data, len, parser, params);
1497 }
1498 }
1499 #else
1500 /* Win32 compilers do not support globbing. Therefore, for Win32,
1501 treat allow_glob/need_glob as a NOOP and just return */
1502 return ucl_include_file_single(data, len, parser, params);
1503 #endif
1504
1505 return true;
1506 }
1507
1508 /**
1509 * Common function to handle .*include* macros
1510 * @param data
1511 * @param len
1512 * @param args
1513 * @param parser
1514 * @param default_try
1515 * @param default_sign
1516 * @return
1517 */
1518 static bool
1519 ucl_include_common(const unsigned char *data, size_t len,
1520 const ucl_object_t *args, struct ucl_parser *parser,
1521 bool default_try,
1522 bool default_sign)
1523 {
1524 bool allow_url = false, search = false;
1525 const char *duplicate;
1526 const ucl_object_t *param;
1527 ucl_object_iter_t it = NULL, ip = NULL;
1528 char ipath[PATH_MAX];
1529 struct ucl_include_params params;
1530
1531 /* Default values */
1532 params.soft_fail = default_try;
1533 params.allow_glob = false;
1534 params.check_signature = default_sign;
1535 params.use_prefix = false;
1536 params.target = "object";
1537 params.prefix = NULL;
1538 params.priority = 0;
1539 params.parse_type = UCL_PARSE_UCL;
1540 params.strat = UCL_DUPLICATE_APPEND;
1541 params.must_exist = !default_try;
1542
1543 if (parser->include_trace_func) {
1544 const ucl_object_t *parent = NULL;
1545
1546 if (parser->stack) {
1547 parent = parser->stack->obj;
1548 }
1549
1550 parser->include_trace_func(parser, parent, args,
1551 data, len, parser->include_trace_ud);
1552 }
1553
1554 /* Process arguments */
1555 if (args != NULL && args->type == UCL_OBJECT) {
1556 while ((param = ucl_object_iterate(args, &it, true)) != NULL) {
1557 if (param->type == UCL_BOOLEAN) {
1558 if (strncmp(param->key, "try", param->keylen) == 0) {
1559 params.must_exist = !ucl_object_toboolean(param);
1560 }
1561 else if (strncmp(param->key, "sign", param->keylen) == 0) {
1562 params.check_signature = ucl_object_toboolean(param);
1563 }
1564 else if (strncmp(param->key, "glob", param->keylen) == 0) {
1565 params.allow_glob = ucl_object_toboolean(param);
1566 }
1567 else if (strncmp(param->key, "url", param->keylen) == 0) {
1568 allow_url = ucl_object_toboolean(param);
1569 }
1570 else if (strncmp(param->key, "prefix", param->keylen) == 0) {
1571 params.use_prefix = ucl_object_toboolean(param);
1572 }
1573 }
1574 else if (param->type == UCL_STRING) {
1575 if (strncmp(param->key, "key", param->keylen) == 0) {
1576 params.prefix = ucl_object_tostring(param);
1577 }
1578 else if (strncmp(param->key, "target", param->keylen) == 0) {
1579 params.target = ucl_object_tostring(param);
1580 }
1581 else if (strncmp(param->key, "duplicate", param->keylen) == 0) {
1582 duplicate = ucl_object_tostring(param);
1583
1584 if (strcmp(duplicate, "append") == 0) {
1585 params.strat = UCL_DUPLICATE_APPEND;
1586 }
1587 else if (strcmp(duplicate, "merge") == 0) {
1588 params.strat = UCL_DUPLICATE_MERGE;
1589 }
1590 else if (strcmp(duplicate, "rewrite") == 0) {
1591 params.strat = UCL_DUPLICATE_REWRITE;
1592 }
1593 else if (strcmp(duplicate, "error") == 0) {
1594 params.strat = UCL_DUPLICATE_ERROR;
1595 }
1596 }
1597 }
1598 else if (param->type == UCL_ARRAY) {
1599 if (strncmp(param->key, "path", param->keylen) == 0) {
1600 ucl_set_include_path(parser, __DECONST(ucl_object_t *, param));
1601 }
1602 }
1603 else if (param->type == UCL_INT) {
1604 if (strncmp(param->key, "priority", param->keylen) == 0) {
1605 params.priority = ucl_object_toint(param);
1606 }
1607 }
1608 }
1609 }
1610
1611 if (parser->includepaths == NULL) {
1612 if (allow_url && ucl_strnstr(data, "://", len) != NULL) {
1613 /* Globbing is not used for URL's */
1614 return ucl_include_url(data, len, parser, ¶ms);
1615 }
1616 else if (data != NULL) {
1617 /* Try to load a file */
1618 return ucl_include_file(data, len, parser, ¶ms, args);
1619 }
1620 }
1621 else {
1622 if (allow_url && ucl_strnstr(data, "://", len) != NULL) {
1623 /* Globbing is not used for URL's */
1624 return ucl_include_url(data, len, parser, ¶ms);
1625 }
1626
1627 ip = ucl_object_iterate_new(parser->includepaths);
1628 while ((param = ucl_object_iterate_safe(ip, true)) != NULL) {
1629 if (ucl_object_type(param) == UCL_STRING) {
1630 snprintf(ipath, sizeof(ipath), "%s/%.*s", ucl_object_tostring(param),
1631 (int) len, data);
1632 if ((search = ucl_include_file(ipath, strlen(ipath),
1633 parser, ¶ms, args))) {
1634 if (!params.allow_glob) {
1635 break;
1636 }
1637 }
1638 }
1639 }
1640 ucl_object_iterate_free(ip);
1641 if (search == true) {
1642 return true;
1643 }
1644 else {
1645 ucl_create_err(&parser->err,
1646 "cannot find file: %.*s in search path",
1647 (int) len, data);
1648 return false;
1649 }
1650 }
1651
1652 return false;
1653 }
1654
1655 /**
1656 * Handle include macro
1657 * @param data include data
1658 * @param len length of data
1659 * @param args UCL object representing arguments to the macro
1660 * @param ud user data
1661 * @return
1662 */
1663 bool ucl_include_handler(const unsigned char *data, size_t len,
1664 const ucl_object_t *args, void *ud)
1665 {
1666 struct ucl_parser *parser = ud;
1667
1668 return ucl_include_common(data, len, args, parser, false, false);
1669 }
1670
1671 /**
1672 * Handle includes macro
1673 * @param data include data
1674 * @param len length of data
1675 * @param args UCL object representing arguments to the macro
1676 * @param ud user data
1677 * @return
1678 */
1679 bool ucl_includes_handler(const unsigned char *data, size_t len,
1680 const ucl_object_t *args, void *ud)
1681 {
1682 struct ucl_parser *parser = ud;
1683
1684 return ucl_include_common(data, len, args, parser, false, true);
1685 }
1686
1687 /**
1688 * Handle tryinclude macro
1689 * @param data include data
1690 * @param len length of data
1691 * @param args UCL object representing arguments to the macro
1692 * @param ud user data
1693 * @return
1694 */
1695 bool ucl_try_include_handler(const unsigned char *data, size_t len,
1696 const ucl_object_t *args, void *ud)
1697 {
1698 struct ucl_parser *parser = ud;
1699
1700 return ucl_include_common(data, len, args, parser, true, false);
1701 }
1702
1703 /**
1704 * Handle priority macro
1705 * @param data include data
1706 * @param len length of data
1707 * @param args UCL object representing arguments to the macro
1708 * @param ud user data
1709 * @return
1710 */
1711 bool ucl_priority_handler(const unsigned char *data, size_t len,
1712 const ucl_object_t *args, void *ud)
1713 {
1714 struct ucl_parser *parser = ud;
1715 unsigned priority = 255;
1716 const ucl_object_t *param;
1717 bool found = false;
1718 char *value = NULL, *leftover = NULL;
1719 ucl_object_iter_t it = NULL;
1720
1721 if (parser == NULL) {
1722 return false;
1723 }
1724
1725 /* Process arguments */
1726 if (args != NULL && args->type == UCL_OBJECT) {
1727 while ((param = ucl_object_iterate(args, &it, true)) != NULL) {
1728 if (param->type == UCL_INT) {
1729 if (strncmp(param->key, "priority", param->keylen) == 0) {
1730 priority = ucl_object_toint(param);
1731 found = true;
1732 }
1733 }
1734 }
1735 }
1736
1737 if (len > 0) {
1738 value = malloc(len + 1);
1739 ucl_strlcpy(value, (const char *) data, len + 1);
1740 priority = strtol(value, &leftover, 10);
1741 if (*leftover != '\0') {
1742 ucl_create_err(&parser->err, "Invalid priority value in macro: %s",
1743 value);
1744 free(value);
1745 return false;
1746 }
1747 free(value);
1748 found = true;
1749 }
1750
1751 if (found == true) {
1752 parser->chunks->priority = priority;
1753 return true;
1754 }
1755
1756 ucl_create_err(&parser->err, "Unable to parse priority macro");
1757 return false;
1758 }
1759
1760 /**
1761 * Handle load macro
1762 * @param data include data
1763 * @param len length of data
1764 * @param args UCL object representing arguments to the macro
1765 * @param ud user data
1766 * @return
1767 */
1768 bool ucl_load_handler(const unsigned char *data, size_t len,
1769 const ucl_object_t *args, void *ud)
1770 {
1771 struct ucl_parser *parser = ud;
1772 const ucl_object_t *param;
1773 ucl_object_t *obj, *old_obj;
1774 ucl_object_iter_t it = NULL;
1775 bool try_load, multiline, test;
1776 const char *target, *prefix;
1777 char *load_file, *tmp;
1778 unsigned char *buf;
1779 size_t buflen;
1780 unsigned priority;
1781 int64_t iv;
1782 ucl_object_t *container = NULL;
1783 enum ucl_string_flags flags;
1784
1785 /* Default values */
1786 try_load = false;
1787 multiline = false;
1788 test = false;
1789 target = "string";
1790 prefix = NULL;
1791 load_file = NULL;
1792 buf = NULL;
1793 buflen = 0;
1794 priority = 0;
1795 obj = NULL;
1796 old_obj = NULL;
1797 flags = 0;
1798
1799 if (parser == NULL) {
1800 return false;
1801 }
1802
1803 /* Process arguments */
1804 if (args != NULL && args->type == UCL_OBJECT) {
1805 while ((param = ucl_object_iterate(args, &it, true)) != NULL) {
1806 if (param->type == UCL_BOOLEAN) {
1807 if (strncmp(param->key, "try", param->keylen) == 0) {
1808 try_load = ucl_object_toboolean(param);
1809 }
1810 else if (strncmp(param->key, "multiline", param->keylen) == 0) {
1811 multiline = ucl_object_toboolean(param);
1812 }
1813 else if (strncmp(param->key, "escape", param->keylen) == 0) {
1814 test = ucl_object_toboolean(param);
1815 if (test) {
1816 flags |= UCL_STRING_ESCAPE;
1817 }
1818 }
1819 else if (strncmp(param->key, "trim", param->keylen) == 0) {
1820 test = ucl_object_toboolean(param);
1821 if (test) {
1822 flags |= UCL_STRING_TRIM;
1823 }
1824 }
1825 }
1826 else if (param->type == UCL_STRING) {
1827 if (strncmp(param->key, "key", param->keylen) == 0) {
1828 prefix = ucl_object_tostring(param);
1829 }
1830 else if (strncmp(param->key, "target", param->keylen) == 0) {
1831 target = ucl_object_tostring(param);
1832 }
1833 }
1834 else if (param->type == UCL_INT) {
1835 if (strncmp(param->key, "priority", param->keylen) == 0) {
1836 priority = ucl_object_toint(param);
1837 }
1838 }
1839 }
1840 }
1841
1842 if (prefix == NULL || strlen(prefix) == 0) {
1843 ucl_create_err(&parser->err, "No Key specified in load macro");
1844 return false;
1845 }
1846
1847 if (len > 0) {
1848 load_file = malloc(len + 1);
1849 if (!load_file) {
1850 ucl_create_err(&parser->err, "cannot allocate memory for suffix");
1851
1852 return false;
1853 }
1854
1855 snprintf(load_file, len + 1, "%.*s", (int) len, data);
1856
1857 if (!ucl_fetch_file(load_file, &buf, &buflen, &parser->err,
1858 !try_load)) {
1859 free(load_file);
1860
1861 if (try_load) {
1862 ucl_parser_clear_error(parser);
1863 }
1864
1865 return (try_load || false);
1866 }
1867
1868 free(load_file);
1869 container = parser->stack->obj;
1870 old_obj = __DECONST(ucl_object_t *, ucl_object_lookup(container,
1871 prefix));
1872
1873 if (old_obj != NULL) {
1874 ucl_create_err(&parser->err, "Key %s already exists", prefix);
1875 if (buf) {
1876 ucl_munmap(buf, buflen);
1877 }
1878
1879 return false;
1880 }
1881
1882 if (strcasecmp(target, "string") == 0) {
1883 obj = ucl_object_fromstring_common(buf, buflen, flags);
1884 ucl_copy_value_trash(obj);
1885 if (multiline) {
1886 obj->flags |= UCL_OBJECT_MULTILINE;
1887 }
1888 }
1889 else if (strcasecmp(target, "int") == 0) {
1890 tmp = malloc(buflen + 1);
1891
1892 if (tmp == NULL) {
1893 ucl_create_err(&parser->err, "Memory allocation failed");
1894 if (buf) {
1895 ucl_munmap(buf, buflen);
1896 }
1897
1898 return false;
1899 }
1900
1901 snprintf(tmp, buflen + 1, "%.*s", (int) buflen, buf);
1902 iv = strtoll(tmp, NULL, 10);
1903 obj = ucl_object_fromint(iv);
1904 free(tmp);
1905 }
1906
1907 if (buf) {
1908 ucl_munmap(buf, buflen);
1909 }
1910
1911 if (obj != NULL) {
1912 obj->key = prefix;
1913 obj->keylen = strlen(prefix);
1914 ucl_copy_key_trash(obj);
1915 obj->prev = obj;
1916 obj->next = NULL;
1917 ucl_object_set_priority(obj, priority);
1918 ucl_object_insert_key(container, obj, obj->key, obj->keylen, false);
1919 }
1920
1921 return true;
1922 }
1923
1924 ucl_create_err(&parser->err, "Unable to parse load macro");
1925 return false;
1926 }
1927
1928 bool ucl_inherit_handler(const unsigned char *data, size_t len,
1929 const ucl_object_t *args, const ucl_object_t *ctx, void *ud)
1930 {
1931 const ucl_object_t *parent, *cur;
1932 ucl_object_t *target, *copy;
1933 ucl_object_iter_t it = NULL;
1934 bool replace = false;
1935 struct ucl_parser *parser = ud;
1936
1937 parent = ucl_object_lookup_len(ctx, data, len);
1938
1939 /* Some sanity checks */
1940 if (parent == NULL || ucl_object_type(parent) != UCL_OBJECT) {
1941 ucl_create_err(&parser->err, "Unable to find inherited object %.*s",
1942 (int) len, data);
1943 return false;
1944 }
1945
1946 if (parser->stack == NULL || parser->stack->obj == NULL ||
1947 ucl_object_type(parser->stack->obj) != UCL_OBJECT) {
1948 ucl_create_err(&parser->err, "Invalid inherit context");
1949 return false;
1950 }
1951
1952 target = parser->stack->obj;
1953
1954 if (args && (cur = ucl_object_lookup(args, "replace")) != NULL) {
1955 replace = ucl_object_toboolean(cur);
1956 }
1957
1958 while ((cur = ucl_object_iterate(parent, &it, true))) {
1959 /* We do not replace existing keys */
1960 if (!replace && ucl_object_lookup_len(target, cur->key, cur->keylen)) {
1961 continue;
1962 }
1963
1964 copy = ucl_object_copy(cur);
1965
1966 if (!replace) {
1967 copy->flags |= UCL_OBJECT_INHERITED;
1968 }
1969
1970 ucl_object_insert_key(target, copy, copy->key,
1971 copy->keylen, false);
1972 }
1973
1974 return true;
1975 }
1976
1977 bool ucl_parser_set_filevars(struct ucl_parser *parser, const char *filename, bool need_expand)
1978 {
1979 char realbuf[PATH_MAX], *curdir;
1980
1981 if (filename != NULL) {
1982 if (need_expand) {
1983 if (ucl_realpath(filename, realbuf) == NULL) {
1984 return false;
1985 }
1986 }
1987 else {
1988 ucl_strlcpy(realbuf, filename, sizeof(realbuf));
1989 }
1990
1991 if (parser->cur_file) {
1992 UCL_FREE(strlen(parser->cur_file) + 1, parser->cur_file);
1993 }
1994
1995 parser->cur_file = UCL_STRDUP(realbuf);
1996
1997 /* Define variables */
1998 ucl_parser_register_variable(parser, "FILENAME", realbuf);
1999 curdir = dirname(realbuf);
2000 ucl_parser_register_variable(parser, "CURDIR", curdir);
2001 }
2002 else {
2003 /* Set everything from the current dir */
2004 curdir = getcwd(realbuf, sizeof(realbuf));
2005 ucl_parser_register_variable(parser, "FILENAME", "undef");
2006 ucl_parser_register_variable(parser, "CURDIR", curdir);
2007 }
2008
2009 return true;
2010 }
2011
2012 bool ucl_parser_add_file_full(struct ucl_parser *parser, const char *filename,
2013 unsigned priority, enum ucl_duplicate_strategy strat,
2014 enum ucl_parse_type parse_type)
2015 {
2016 unsigned char *buf;
2017 size_t len;
2018 bool ret;
2019 char realbuf[PATH_MAX];
2020
2021 if (ucl_realpath(filename, realbuf) == NULL) {
2022 ucl_create_err(&parser->err, "cannot open file %s: %s",
2023 filename,
2024 strerror(errno));
2025 return false;
2026 }
2027
2028 if (!ucl_fetch_file(realbuf, &buf, &len, &parser->err, true)) {
2029 return false;
2030 }
2031
2032 ucl_parser_set_filevars(parser, realbuf, false);
2033 ret = ucl_parser_add_chunk_full(parser, buf, len, priority, strat,
2034 parse_type);
2035
2036 if (len > 0) {
2037 ucl_munmap(buf, len);
2038 }
2039
2040 return ret;
2041 }
2042
2043 bool ucl_parser_add_file_priority(struct ucl_parser *parser, const char *filename,
2044 unsigned priority)
2045 {
2046 if (parser == NULL) {
2047 return false;
2048 }
2049
2050 return ucl_parser_add_file_full(parser, filename, priority,
2051 UCL_DUPLICATE_APPEND, UCL_PARSE_UCL);
2052 }
2053
2054 bool ucl_parser_add_file(struct ucl_parser *parser, const char *filename)
2055 {
2056 if (parser == NULL) {
2057 return false;
2058 }
2059
2060 return ucl_parser_add_file_full(parser, filename,
2061 parser->default_priority, UCL_DUPLICATE_APPEND,
2062 UCL_PARSE_UCL);
2063 }
2064
2065
2066 bool ucl_parser_add_fd_full(struct ucl_parser *parser, int fd,
2067 unsigned priority, enum ucl_duplicate_strategy strat,
2068 enum ucl_parse_type parse_type)
2069 {
2070 unsigned char *buf;
2071 size_t len;
2072 bool ret;
2073 struct stat st;
2074
2075 if (fstat(fd, &st) == -1) {
2076 ucl_create_err(&parser->err, "cannot stat fd %d: %s",
2077 fd, strerror(errno));
2078 return false;
2079 }
2080 if (st.st_size == 0) {
2081 return true;
2082 }
2083 if ((buf = ucl_mmap(NULL, st.st_size, PROT_READ, MAP_SHARED, fd, 0)) == MAP_FAILED) {
2084 ucl_create_err(&parser->err, "cannot mmap fd %d: %s",
2085 fd, strerror(errno));
2086 return false;
2087 }
2088
2089 if (parser->cur_file) {
2090 UCL_FREE(strlen(parser->cur_file) + 1, parser->cur_file);
2091 }
2092 parser->cur_file = NULL;
2093 len = st.st_size;
2094 ret = ucl_parser_add_chunk_full(parser, buf, len, priority, strat,
2095 parse_type);
2096
2097 if (len > 0) {
2098 ucl_munmap(buf, len);
2099 }
2100
2101 return ret;
2102 }
2103
2104 bool ucl_parser_add_fd_priority(struct ucl_parser *parser, int fd,
2105 unsigned priority)
2106 {
2107 if (parser == NULL) {
2108 return false;
2109 }
2110
2111 return ucl_parser_add_fd_full(parser, fd, parser->default_priority,
2112 UCL_DUPLICATE_APPEND, UCL_PARSE_UCL);
2113 }
2114
2115 bool ucl_parser_add_fd(struct ucl_parser *parser, int fd)
2116 {
2117 if (parser == NULL) {
2118 return false;
2119 }
2120
2121 return ucl_parser_add_fd_priority(parser, fd, parser->default_priority);
2122 }
2123
2124 size_t
2125 ucl_strlcpy(char *dst, const char *src, size_t siz)
2126 {
2127 char *d = dst;
2128 const char *s = src;
2129 size_t n = siz;
2130
2131 /* Copy as many bytes as will fit */
2132 if (n != 0) {
2133 while (--n != 0) {
2134 if ((*d++ = *s++) == '\0') {
2135 break;
2136 }
2137 }
2138 }
2139
2140 if (n == 0 && siz != 0) {
2141 *d = '\0';
2142 }
2143
2144 return (s - src - 1); /* count does not include NUL */
2145 }
2146
2147 size_t
2148 ucl_strlcpy_unsafe(char *dst, const char *src, size_t siz)
2149 {
2150 memcpy(dst, src, siz - 1);
2151 dst[siz - 1] = '\0';
2152
2153 return siz - 1;
2154 }
2155
2156 size_t
2157 ucl_strlcpy_tolower(char *dst, const char *src, size_t siz)
2158 {
2159 char *d = dst;
2160 const char *s = src;
2161 size_t n = siz;
2162
2163 /* Copy as many bytes as will fit */
2164 if (n != 0) {
2165 while (--n != 0) {
2166 if ((*d++ = tolower(*s++)) == '\0') {
2167 break;
2168 }
2169 }
2170 }
2171
2172 if (n == 0 && siz != 0) {
2173 *d = '\0';
2174 }
2175
2176 return (s - src); /* count does not include NUL */
2177 }
2178
2179 /*
2180 * Find the first occurrence of find in s
2181 */
2182 char *
2183 ucl_strnstr(const char *s, const char *find, int len)
2184 {
2185 char c, sc;
2186 int mlen;
2187
2188 if ((c = *find++) != 0) {
2189 mlen = strlen(find);
2190 do {
2191 do {
2192 if ((sc = *s++) == 0 || len-- < mlen)
2193 return (NULL);
2194 } while (sc != c);
2195 } while (strncmp(s, find, mlen) != 0);
2196 s--;
2197 }
2198 return ((char *) s);
2199 }
2200
2201 /*
2202 * Find the first occurrence of find in s, ignore case.
2203 */
2204 char *
2205 ucl_strncasestr(const char *s, const char *find, int len)
2206 {
2207 char c, sc;
2208 int mlen;
2209
2210 if ((c = *find++) != 0) {
2211 c = tolower(c);
2212 mlen = strlen(find);
2213 do {
2214 do {
2215 if ((sc = *s++) == 0 || len-- == 0)
2216 return (NULL);
2217 } while (tolower(sc) != c);
2218 } while (strncasecmp(s, find, mlen) != 0);
2219 s--;
2220 }
2221 return ((char *) s);
2222 }
2223
2224 ucl_object_t *
2225 ucl_object_fromstring_common(const char *str, size_t len, enum ucl_string_flags flags)
2226 {
2227 ucl_object_t *obj;
2228 const char *start, *end, *p, *pos;
2229 char *dst, *d;
2230 size_t escaped_len;
2231
2232 if (str == NULL) {
2233 return NULL;
2234 }
2235
2236 obj = ucl_object_new();
2237 if (obj) {
2238 if (len == 0) {
2239 len = strlen(str);
2240 }
2241 if (flags & UCL_STRING_TRIM) {
2242 /* Skip leading spaces */
2243 for (start = str; (size_t) (start - str) < len; start++) {
2244 if (!ucl_test_character(*start, UCL_CHARACTER_WHITESPACE_UNSAFE)) {
2245 break;
2246 }
2247 }
2248 /* Skip trailing spaces */
2249 for (end = str + len - 1; end > start; end--) {
2250 if (!ucl_test_character(*end, UCL_CHARACTER_WHITESPACE_UNSAFE)) {
2251 break;
2252 }
2253 }
2254 end++;
2255 }
2256 else {
2257 start = str;
2258 end = str + len;
2259 }
2260
2261 obj->type = UCL_STRING;
2262 if (flags & UCL_STRING_ESCAPE) {
2263 for (p = start, escaped_len = 0; p < end; p++, escaped_len++) {
2264 if (ucl_test_character(*p, UCL_CHARACTER_JSON_UNSAFE | UCL_CHARACTER_WHITESPACE_UNSAFE)) {
2265 switch (*p) {
2266 case '\v':
2267 case '\0':
2268 escaped_len += 5;
2269 break;
2270 case ' ':
2271 break;
2272 default:
2273 escaped_len++;
2274 break;
2275 }
2276 }
2277 }
2278 dst = malloc(escaped_len + 1);
2279 if (dst != NULL) {
2280 for (p = start, d = dst; p < end; p++, d++) {
2281 if (ucl_test_character(*p, UCL_CHARACTER_JSON_UNSAFE | UCL_CHARACTER_WHITESPACE_UNSAFE)) {
2282 switch (*p) {
2283 case '\n':
2284 *d++ = '\\';
2285 *d = 'n';
2286 break;
2287 case '\r':
2288 *d++ = '\\';
2289 *d = 'r';
2290 break;
2291 case '\b':
2292 *d++ = '\\';
2293 *d = 'b';
2294 break;
2295 case '\t':
2296 *d++ = '\\';
2297 *d = 't';
2298 break;
2299 case '\f':
2300 *d++ = '\\';
2301 *d = 'f';
2302 break;
2303 case '\0':
2304 *d++ = '\\';
2305 *d++ = 'u';
2306 *d++ = '0';
2307 *d++ = '0';
2308 *d++ = '0';
2309 *d = '0';
2310 break;
2311 case '\v':
2312 *d++ = '\\';
2313 *d++ = 'u';
2314 *d++ = '0';
2315 *d++ = '0';
2316 *d++ = '0';
2317 *d = 'B';
2318 break;
2319 case '\\':
2320 *d++ = '\\';
2321 *d = '\\';
2322 break;
2323 case ' ':
2324 *d = ' ';
2325 break;
2326 case '"':
2327 *d++ = '\\';
2328 *d = '"';
2329 break;
2330 }
2331 }
2332 else {
2333 *d = *p;
2334 }
2335 }
2336 *d = '\0';
2337 obj->value.sv = dst;
2338 obj->trash_stack[UCL_TRASH_VALUE] = dst;
2339 obj->len = escaped_len;
2340 }
2341 }
2342 else {
2343 dst = malloc(end - start + 1);
2344 if (dst != NULL) {
2345 ucl_strlcpy_unsafe(dst, start, end - start + 1);
2346 obj->value.sv = dst;
2347 obj->trash_stack[UCL_TRASH_VALUE] = dst;
2348 obj->len = end - start;
2349 }
2350 }
2351 if ((flags & UCL_STRING_PARSE) && dst != NULL) {
2352 /* Parse what we have */
2353 if (flags & UCL_STRING_PARSE_BOOLEAN) {
2354 if (!ucl_maybe_parse_boolean(obj, dst, obj->len) && (flags & UCL_STRING_PARSE_NUMBER)) {
2355 ucl_maybe_parse_number(obj, dst, dst + obj->len, &pos,
2356 flags & UCL_STRING_PARSE_DOUBLE,
2357 flags & UCL_STRING_PARSE_BYTES,
2358 flags & UCL_STRING_PARSE_TIME);
2359 }
2360 }
2361 else {
2362 ucl_maybe_parse_number(obj, dst, dst + obj->len, &pos,
2363 flags & UCL_STRING_PARSE_DOUBLE,
2364 flags & UCL_STRING_PARSE_BYTES,
2365 flags & UCL_STRING_PARSE_TIME);
2366 }
2367 }
2368 }
2369
2370 return obj;
2371 }
2372
2373 static bool
2374 ucl_object_insert_key_common(ucl_object_t *top, ucl_object_t *elt,
2375 const char *key, size_t keylen, bool copy_key, bool merge, bool replace)
2376 {
2377 ucl_object_t *found, *tmp;
2378 const ucl_object_t *cur;
2379 ucl_object_iter_t it = NULL;
2380 const char *p;
2381 int ret = true;
2382
2383 if (elt == NULL || key == NULL) {
2384 return false;
2385 }
2386
2387 if (top == NULL) {
2388 return false;
2389 }
2390
2391 if (top->type != UCL_OBJECT) {
2392 /* It is possible to convert NULL type to an object */
2393 if (top->type == UCL_NULL) {
2394 top->type = UCL_OBJECT;
2395 }
2396 else {
2397 /* Refuse converting of other object types */
2398 return false;
2399 }
2400 }
2401
2402 if (top->value.ov == NULL) {
2403 top->value.ov = ucl_hash_create(false);
2404 }
2405
2406 if (keylen == 0) {
2407 keylen = strlen(key);
2408 }
2409
2410 for (p = key; p < key + keylen; p++) {
2411 if (ucl_test_character(*p, UCL_CHARACTER_UCL_UNSAFE)) {
2412 elt->flags |= UCL_OBJECT_NEED_KEY_ESCAPE;
2413 break;
2414 }
2415 }
2416
2417 /* workaround for some use cases */
2418 if (elt->trash_stack[UCL_TRASH_KEY] != NULL &&
2419 key != (const char *) elt->trash_stack[UCL_TRASH_KEY]) {
2420 /* Remove copied key */
2421 free(elt->trash_stack[UCL_TRASH_KEY]);
2422 elt->trash_stack[UCL_TRASH_KEY] = NULL;
2423 elt->flags &= ~UCL_OBJECT_ALLOCATED_KEY;
2424 }
2425
2426 elt->key = key;
2427 elt->keylen = keylen;
2428
2429 if (copy_key) {
2430 ucl_copy_key_trash(elt);
2431 }
2432
2433 found = __DECONST(ucl_object_t *, ucl_hash_search_obj(top->value.ov, elt));
2434
2435 if (found == NULL) {
2436 top->value.ov = ucl_hash_insert_object(top->value.ov, elt, false);
2437 top->len++;
2438 if (replace) {
2439 ret = false;
2440 }
2441 }
2442 else {
2443 if (replace) {
2444 ucl_hash_replace(top->value.ov, found, elt);
2445 ucl_object_unref(found);
2446 }
2447 else if (merge) {
2448 if (found->type != UCL_OBJECT && elt->type == UCL_OBJECT) {
2449 /* Insert old elt to new one */
2450 ucl_object_insert_key_common(elt, found, found->key,
2451 found->keylen, copy_key, false, false);
2452 ucl_hash_delete(top->value.ov, found);
2453 top->value.ov = ucl_hash_insert_object(top->value.ov, elt, false);
2454 }
2455 else if (found->type == UCL_OBJECT && elt->type != UCL_OBJECT) {
2456 /* Insert new to old */
2457 ucl_object_insert_key_common(found, elt, elt->key,
2458 elt->keylen, copy_key, false, false);
2459 }
2460 else if (found->type == UCL_OBJECT && elt->type == UCL_OBJECT) {
2461 /* Mix two hashes */
2462 while ((cur = ucl_object_iterate(elt, &it, true)) != NULL) {
2463 tmp = ucl_object_ref(cur);
2464 ucl_object_insert_key_common(found, tmp, cur->key,
2465 cur->keylen, copy_key, true, false);
2466 }
2467 ucl_object_unref(elt);
2468 }
2469 else {
2470 /* Just make a list of scalars */
2471 DL_CONCAT(found, elt);
2472 }
2473 }
2474 else {
2475 DL_CONCAT(found, elt);
2476 }
2477 }
2478
2479 return ret;
2480 }
2481
2482 bool ucl_object_delete_keyl(ucl_object_t *top, const char *key, size_t keylen)
2483 {
2484 ucl_object_t *found;
2485
2486 if (top == NULL || key == NULL) {
2487 return false;
2488 }
2489
2490 found = __DECONST(ucl_object_t *, ucl_object_lookup_len(top, key, keylen));
2491
2492 if (found == NULL) {
2493 return false;
2494 }
2495
2496 ucl_hash_delete(top->value.ov, found);
2497 ucl_object_unref(found);
2498 top->len--;
2499
2500 return true;
2501 }
2502
2503 bool ucl_object_delete_key(ucl_object_t *top, const char *key)
2504 {
2505 return ucl_object_delete_keyl(top, key, strlen(key));
2506 }
2507
2508 ucl_object_t *
2509 ucl_object_pop_keyl(ucl_object_t *top, const char *key, size_t keylen)
2510 {
2511 const ucl_object_t *found;
2512
2513 if (top == NULL || key == NULL) {
2514 return false;
2515 }
2516 found = ucl_object_lookup_len(top, key, keylen);
2517
2518 if (found == NULL) {
2519 return NULL;
2520 }
2521 ucl_hash_delete(top->value.ov, found);
2522 top->len--;
2523
2524 return __DECONST(ucl_object_t *, found);
2525 }
2526
2527 ucl_object_t *
2528 ucl_object_pop_key(ucl_object_t *top, const char *key)
2529 {
2530 return ucl_object_pop_keyl(top, key, strlen(key));
2531 }
2532
2533 bool ucl_object_insert_key(ucl_object_t *top, ucl_object_t *elt,
2534 const char *key, size_t keylen, bool copy_key)
2535 {
2536 return ucl_object_insert_key_common(top, elt, key, keylen, copy_key, false, false);
2537 }
2538
2539 bool ucl_object_insert_key_merged(ucl_object_t *top, ucl_object_t *elt,
2540 const char *key, size_t keylen, bool copy_key)
2541 {
2542 return ucl_object_insert_key_common(top, elt, key, keylen, copy_key, true, false);
2543 }
2544
2545 bool ucl_object_replace_key(ucl_object_t *top, ucl_object_t *elt,
2546 const char *key, size_t keylen, bool copy_key)
2547 {
2548 return ucl_object_insert_key_common(top, elt, key, keylen, copy_key, false, true);
2549 }
2550
2551 bool ucl_object_merge(ucl_object_t *top, ucl_object_t *elt, bool copy)
2552 {
2553 ucl_object_t *cur = NULL, *cp = NULL, *found = NULL;
2554 ucl_object_iter_t iter = NULL;
2555
2556 if (top == NULL || elt == NULL) {
2557 return false;
2558 }
2559
2560 if (top->type == UCL_ARRAY) {
2561 if (elt->type == UCL_ARRAY) {
2562 /* Merge two arrays */
2563 return ucl_array_merge(top, elt, copy);
2564 }
2565 else {
2566 if (copy) {
2567 ucl_array_append(top, ucl_object_copy(elt));
2568
2569 return true;
2570 }
2571 else {
2572 ucl_array_append(top, ucl_object_ref(elt));
2573
2574 return true;
2575 }
2576 }
2577 }
2578 else if (top->type == UCL_OBJECT) {
2579 if (elt->type == UCL_OBJECT) {
2580 /* Mix two hashes */
2581 while ((cur = (ucl_object_t *) ucl_hash_iterate(elt->value.ov,
2582 &iter))) {
2583
2584 if (copy) {
2585 cp = ucl_object_copy(cur);
2586 }
2587 else {
2588 cp = ucl_object_ref(cur);
2589 }
2590
2591 found = __DECONST(ucl_object_t *,
2592 ucl_hash_search(top->value.ov, cp->key, cp->keylen));
2593
2594 if (found == NULL) {
2595 /* The key does not exist */
2596 top->value.ov = ucl_hash_insert_object(top->value.ov, cp,
2597 false);
2598 top->len++;
2599 }
2600 else {
2601 /* The key already exists, merge it recursively */
2602 if (found->type == UCL_OBJECT || found->type == UCL_ARRAY) {
2603 if (!ucl_object_merge(found, cp, copy)) {
2604 return false;
2605 }
2606 ucl_object_unref(cp);
2607 }
2608 else {
2609 ucl_hash_replace(top->value.ov, found, cp);
2610 ucl_object_unref(found);
2611 }
2612 }
2613 }
2614 }
2615 else {
2616 if (copy) {
2617 cp = ucl_object_copy(elt);
2618 }
2619 else {
2620 cp = ucl_object_ref(elt);
2621 }
2622
2623 found = __DECONST(ucl_object_t *,
2624 ucl_hash_search(top->value.ov, cp->key, cp->keylen));
2625
2626 if (found == NULL) {
2627 /* The key does not exist */
2628 top->value.ov = ucl_hash_insert_object(top->value.ov, cp,
2629 false);
2630 top->len++;
2631 }
2632 else {
2633 /* The key already exists, merge it recursively */
2634 if (found->type == UCL_OBJECT || found->type == UCL_ARRAY) {
2635 if (!ucl_object_merge(found, cp, copy)) {
2636 return false;
2637 }
2638 ucl_object_unref(cp);
2639 }
2640 else {
2641 ucl_hash_replace(top->value.ov, found, cp);
2642 ucl_object_unref(found);
2643 }
2644 }
2645 }
2646 }
2647 else {
2648 /* Cannot merge trivial objects */
2649 return false;
2650 }
2651
2652 return true;
2653 }
2654
2655 const ucl_object_t *
2656 ucl_object_lookup_len(const ucl_object_t *obj, const char *key, size_t klen)
2657 {
2658 const ucl_object_t *ret;
2659 ucl_object_t srch;
2660
2661 if (obj == NULL || obj->type != UCL_OBJECT || key == NULL) {
2662 return NULL;
2663 }
2664
2665 srch.key = key;
2666 srch.keylen = klen;
2667 ret = ucl_hash_search_obj(obj->value.ov, &srch);
2668
2669 return ret;
2670 }
2671
2672 const ucl_object_t *
2673 ucl_object_lookup(const ucl_object_t *obj, const char *key)
2674 {
2675 if (key == NULL) {
2676 return NULL;
2677 }
2678
2679 return ucl_object_lookup_len(obj, key, strlen(key));
2680 }
2681
2682 const ucl_object_t *
2683 ucl_object_lookup_any(const ucl_object_t *obj,
2684 const char *key, ...)
2685 {
2686 va_list ap;
2687 const ucl_object_t *ret = NULL;
2688 const char *nk = NULL;
2689
2690 if (obj == NULL || key == NULL) {
2691 return NULL;
2692 }
2693
2694 ret = ucl_object_lookup_len(obj, key, strlen(key));
2695
2696 if (ret == NULL) {
2697 va_start(ap, key);
2698
2699 while (ret == NULL) {
2700 nk = va_arg(ap, const char *);
2701
2702 if (nk == NULL) {
2703 break;
2704 }
2705 else {
2706 ret = ucl_object_lookup_len(obj, nk, strlen(nk));
2707 }
2708 }
2709
2710 va_end(ap);
2711 }
2712
2713 return ret;
2714 }
2715
2716 const ucl_object_t *
2717 ucl_object_iterate_with_error(const ucl_object_t *obj, ucl_object_iter_t *iter, bool expand_values,
2718 int *ep)
2719 {
2720 const ucl_object_t *elt = NULL;
2721
2722 if (obj == NULL || iter == NULL) {
2723 return NULL;
2724 }
2725
2726 if (expand_values) {
2727 switch (obj->type) {
2728 case UCL_OBJECT:
2729 return (const ucl_object_t *) ucl_hash_iterate2(obj->value.ov, iter, ep);
2730 break;
2731 case UCL_ARRAY: {
2732 unsigned int idx;
2733 UCL_ARRAY_GET(vec, obj);
2734 idx = (unsigned int) (uintptr_t) (*iter);
2735
2736 if (vec != NULL) {
2737 while (idx < kv_size(*vec)) {
2738 if ((elt = kv_A(*vec, idx)) != NULL) {
2739 idx++;
2740 break;
2741 }
2742 idx++;
2743 }
2744 *iter = (void *) (uintptr_t) idx;
2745 }
2746
2747 return elt;
2748 break;
2749 }
2750 default:
2751 /* Go to linear iteration */
2752 break;
2753 }
2754 }
2755 /* Treat everything as a linear list */
2756 elt = *iter;
2757 if (elt == NULL) {
2758 elt = obj;
2759 }
2760 else if (elt == obj) {
2761 return NULL;
2762 }
2763 *iter = __DECONST(void *, elt->next ? elt->next : obj);
2764 return elt;
2765
2766 /* Not reached */
2767 return NULL;
2768 }
2769
2770 enum ucl_safe_iter_flags {
2771 UCL_ITERATE_FLAG_UNDEFINED = 0,
2772 UCL_ITERATE_FLAG_INSIDE_ARRAY,
2773 UCL_ITERATE_FLAG_INSIDE_OBJECT,
2774 UCL_ITERATE_FLAG_IMPLICIT,
2775 UCL_ITERATE_FLAG_EXCEPTION
2776 };
2777
2778 static const char safe_iter_magic[4] = {'u', 'i', 't', 'e'};
2779 struct ucl_object_safe_iter {
2780 char magic[4]; /* safety check */
2781 uint32_t flags;
2782 const ucl_object_t *impl_it; /* implicit object iteration */
2783 ucl_object_iter_t expl_it; /* explicit iteration */
2784 };
2785
2786 #define UCL_SAFE_ITER(ptr) (struct ucl_object_safe_iter *) (ptr)
2787 #define UCL_SAFE_ITER_CHECK(it) \
2788 do { \
2789 assert(it != NULL); \
2790 assert(memcmp(it->magic, safe_iter_magic, sizeof(it->magic)) == 0); \
2791 } while (0)
2792
2793 ucl_object_iter_t
2794 ucl_object_iterate_new(const ucl_object_t *obj)
2795 {
2796 struct ucl_object_safe_iter *it;
2797
2798 it = UCL_ALLOC(sizeof(*it));
2799 if (it != NULL) {
2800 memcpy(it->magic, safe_iter_magic, sizeof(it->magic));
2801 it->flags = UCL_ITERATE_FLAG_UNDEFINED;
2802 it->expl_it = NULL;
2803 it->impl_it = obj;
2804 }
2805
2806 return (ucl_object_iter_t) it;
2807 }
2808
2809 bool ucl_object_iter_chk_excpn(ucl_object_iter_t *it)
2810 {
2811 struct ucl_object_safe_iter *rit = UCL_SAFE_ITER(it);
2812
2813 UCL_SAFE_ITER_CHECK(rit);
2814
2815 return (rit->flags == UCL_ITERATE_FLAG_EXCEPTION);
2816 }
2817
2818 ucl_object_iter_t
2819 ucl_object_iterate_reset(ucl_object_iter_t it, const ucl_object_t *obj)
2820 {
2821 struct ucl_object_safe_iter *rit = UCL_SAFE_ITER(it);
2822
2823 UCL_SAFE_ITER_CHECK(rit);
2824
2825 if (rit->expl_it != NULL) {
2826 if (rit->flags == UCL_ITERATE_FLAG_INSIDE_OBJECT) {
2827 UCL_FREE(sizeof(*rit->expl_it), rit->expl_it);
2828 }
2829 }
2830
2831 rit->impl_it = obj;
2832 rit->expl_it = NULL;
2833 rit->flags = UCL_ITERATE_FLAG_UNDEFINED;
2834
2835 return it;
2836 }
2837
2838 const ucl_object_t *
2839 ucl_object_iterate_safe(ucl_object_iter_t it, bool expand_values)
2840 {
2841 return ucl_object_iterate_full(it, expand_values ? UCL_ITERATE_BOTH : UCL_ITERATE_IMPLICIT);
2842 }
2843
2844 const ucl_object_t *
2845 ucl_object_iterate_full(ucl_object_iter_t it, enum ucl_iterate_type type)
2846 {
2847 struct ucl_object_safe_iter *rit = UCL_SAFE_ITER(it);
2848 const ucl_object_t *ret = NULL;
2849 int ern;
2850
2851 UCL_SAFE_ITER_CHECK(rit);
2852
2853 if (rit->impl_it == NULL) {
2854 return NULL;
2855 }
2856
2857 if (rit->impl_it->type == UCL_OBJECT) {
2858 rit->flags = UCL_ITERATE_FLAG_INSIDE_OBJECT;
2859 ret = ucl_object_iterate_with_error(rit->impl_it, &rit->expl_it, true, &ern);
2860
2861 if (ret == NULL && ern != 0) {
2862 rit->flags = UCL_ITERATE_FLAG_EXCEPTION;
2863 return NULL;
2864 }
2865
2866 if (ret == NULL && (type & UCL_ITERATE_IMPLICIT)) {
2867 /* Need to switch to another implicit object in chain */
2868 rit->impl_it = rit->impl_it->next;
2869 rit->expl_it = NULL;
2870
2871 return ucl_object_iterate_safe(it, type);
2872 }
2873 }
2874 else if (rit->impl_it->type == UCL_ARRAY) {
2875 rit->flags = UCL_ITERATE_FLAG_INSIDE_ARRAY;
2876 ret = ucl_object_iterate(rit->impl_it, &rit->expl_it, true);
2877
2878 if (ret == NULL && (type & UCL_ITERATE_IMPLICIT)) {
2879 /* Need to switch to another implicit object in chain */
2880 rit->impl_it = rit->impl_it->next;
2881 rit->expl_it = NULL;
2882
2883 return ucl_object_iterate_safe(it, type);
2884 }
2885 }
2886 else {
2887 /* Just iterate over the implicit array */
2888 rit->flags = UCL_ITERATE_FLAG_IMPLICIT;
2889 ret = rit->impl_it;
2890 rit->impl_it = rit->impl_it->next;
2891
2892 if (type & UCL_ITERATE_EXPLICIT) {
2893 /* We flatten objects if need to expand values */
2894 if (ret->type == UCL_OBJECT || ret->type == UCL_ARRAY) {
2895 return ucl_object_iterate_safe(it, type);
2896 }
2897 }
2898 }
2899
2900 return ret;
2901 }
2902
2903 void ucl_object_iterate_free(ucl_object_iter_t it)
2904 {
2905 struct ucl_object_safe_iter *rit = UCL_SAFE_ITER(it);
2906
2907 UCL_SAFE_ITER_CHECK(rit);
2908
2909 if (rit->expl_it != NULL) {
2910 if (rit->flags == UCL_ITERATE_FLAG_INSIDE_OBJECT) {
2911 UCL_FREE(sizeof(*rit->expl_it), rit->expl_it);
2912 }
2913 }
2914
2915 UCL_FREE(sizeof(*rit), it);
2916 }
2917
2918 const ucl_object_t *
2919 ucl_object_lookup_path(const ucl_object_t *top, const char *path_in)
2920 {
2921 return ucl_object_lookup_path_char(top, path_in, '.');
2922 }
2923
2924
2925 const ucl_object_t *
2926 ucl_object_lookup_path_char(const ucl_object_t *top, const char *path_in, const char sep)
2927 {
2928 const ucl_object_t *o = NULL, *found;
2929 const char *p, *c;
2930 char *err_str;
2931 unsigned index;
2932
2933 if (path_in == NULL || top == NULL) {
2934 return NULL;
2935 }
2936
2937 found = NULL;
2938 p = path_in;
2939
2940 /* Skip leading dots */
2941 while (*p == sep) {
2942 p++;
2943 }
2944
2945 c = p;
2946 while (*p != '\0') {
2947 p++;
2948 if (*p == sep || *p == '\0') {
2949 if (p > c) {
2950 switch (top->type) {
2951 case UCL_ARRAY:
2952 /* Key should be an int */
2953 index = strtoul(c, &err_str, 10);
2954 if (err_str != NULL && (*err_str != sep && *err_str != '\0')) {
2955 return NULL;
2956 }
2957 o = ucl_array_find_index(top, index);
2958 break;
2959 default:
2960 o = ucl_object_lookup_len(top, c, p - c);
2961 break;
2962 }
2963 if (o == NULL) {
2964 return NULL;
2965 }
2966 top = o;
2967 }
2968 if (*p != '\0') {
2969 c = p + 1;
2970 }
2971 }
2972 }
2973 found = o;
2974
2975 return found;
2976 }
2977
2978
2979 ucl_object_t *
2980 ucl_object_new(void)
2981 {
2982 return ucl_object_typed_new(UCL_NULL);
2983 }
2984
2985 ucl_object_t *
2986 ucl_object_typed_new(ucl_type_t type)
2987 {
2988 return ucl_object_new_full(type, 0);
2989 }
2990
2991 ucl_object_t *
2992 ucl_object_new_full(ucl_type_t type, unsigned priority)
2993 {
2994 ucl_object_t *new;
2995
2996 if (type != UCL_USERDATA) {
2997 new = UCL_ALLOC(sizeof(ucl_object_t));
2998 if (new != NULL) {
2999 memset(new, 0, sizeof(ucl_object_t));
3000 new->ref = 1;
3001 new->type = (type <= UCL_NULL ? type : UCL_NULL);
3002 new->next = NULL;
3003 new->prev = new;
3004 ucl_object_set_priority(new, priority);
3005
3006 if (type == UCL_ARRAY) {
3007 new->value.av = UCL_ALLOC(sizeof(ucl_array_t));
3008 if (new->value.av) {
3009 memset(new->value.av, 0, sizeof(ucl_array_t));
3010 UCL_ARRAY_GET(vec, new);
3011
3012 /* Preallocate some space for arrays */
3013 kv_resize_safe(ucl_object_t *, *vec, 8, enomem);
3014 }
3015 }
3016 }
3017 }
3018 else {
3019 new = ucl_object_new_userdata(NULL, NULL, NULL);
3020 ucl_object_set_priority(new, priority);
3021 }
3022 enomem:
3023 return new;
3024 }
3025
3026 bool ucl_object_reserve(ucl_object_t *obj, size_t reserved)
3027 {
3028 if (obj->type == UCL_ARRAY) {
3029 UCL_ARRAY_GET(vec, obj);
3030
3031 if (vec->m < reserved) {
3032 /* Preallocate some space for arrays */
3033 kv_resize_safe(ucl_object_t *, *vec, reserved, e0);
3034 }
3035 }
3036 else if (obj->type == UCL_OBJECT) {
3037 ucl_hash_reserve(obj->value.ov, reserved);
3038 }
3039 return true;
3040 e0:
3041 return false;
3042 }
3043
3044 ucl_object_t *
3045 ucl_object_new_userdata(ucl_userdata_dtor dtor,
3046 ucl_userdata_emitter emitter,
3047 void *ptr)
3048 {
3049 struct ucl_object_userdata *new;
3050 size_t nsize = sizeof(*new);
3051
3052 new = UCL_ALLOC(nsize);
3053 if (new != NULL) {
3054 memset(new, 0, nsize);
3055 new->obj.ref = 1;
3056 new->obj.type = UCL_USERDATA;
3057 new->obj.next = NULL;
3058 new->obj.prev = (ucl_object_t *) new;
3059 new->dtor = dtor;
3060 new->emitter = emitter;
3061 new->obj.value.ud = ptr;
3062 }
3063
3064 return (ucl_object_t *) new;
3065 }
3066
3067 ucl_type_t
3068 ucl_object_type(const ucl_object_t *obj)
3069 {
3070 if (obj == NULL) {
3071 return UCL_NULL;
3072 }
3073
3074 return obj->type;
3075 }
3076
3077 ucl_object_t *
3078 ucl_object_fromstring(const char *str)
3079 {
3080 return ucl_object_fromstring_common(str, 0, UCL_STRING_RAW);
3081 }
3082
3083 ucl_object_t *
3084 ucl_object_fromlstring(const char *str, size_t len)
3085 {
3086 return ucl_object_fromstring_common(str, len, UCL_STRING_RAW);
3087 }
3088
3089 ucl_object_t *
3090 ucl_object_fromint(int64_t iv)
3091 {
3092 ucl_object_t *obj;
3093
3094 obj = ucl_object_new();
3095 if (obj != NULL) {
3096 obj->type = UCL_INT;
3097 obj->value.iv = iv;
3098 }
3099
3100 return obj;
3101 }
3102
3103 ucl_object_t *
3104 ucl_object_fromdouble(double dv)
3105 {
3106 ucl_object_t *obj;
3107
3108 obj = ucl_object_new();
3109 if (obj != NULL) {
3110 obj->type = UCL_FLOAT;
3111 obj->value.dv = dv;
3112 }
3113
3114 return obj;
3115 }
3116
3117 ucl_object_t *
3118 ucl_object_frombool(bool bv)
3119 {
3120 ucl_object_t *obj;
3121
3122 obj = ucl_object_new();
3123 if (obj != NULL) {
3124 obj->type = UCL_BOOLEAN;
3125 obj->value.iv = bv;
3126 }
3127
3128 return obj;
3129 }
3130
3131 bool ucl_array_append(ucl_object_t *top, ucl_object_t *elt)
3132 {
3133 if (top->type != UCL_ARRAY) {
3134 return false;
3135 }
3136
3137 UCL_ARRAY_GET(vec, top);
3138
3139 if (elt == NULL || top == NULL) {
3140 return false;
3141 }
3142
3143 if (vec == NULL) {
3144 vec = UCL_ALLOC(sizeof(*vec));
3145
3146 if (vec == NULL) {
3147 return false;
3148 }
3149
3150 kv_init(*vec);
3151 top->value.av = (void *) vec;
3152 }
3153
3154 kv_push_safe(ucl_object_t *, *vec, elt, e0);
3155
3156 top->len++;
3157
3158 return true;
3159 e0:
3160 return false;
3161 }
3162
3163 bool ucl_array_prepend(ucl_object_t *top, ucl_object_t *elt)
3164 {
3165 if (top->type != UCL_ARRAY) {
3166 return false;
3167 }
3168
3169 UCL_ARRAY_GET(vec, top);
3170
3171 if (elt == NULL || top == NULL) {
3172 return false;
3173 }
3174
3175 if (vec == NULL) {
3176 vec = UCL_ALLOC(sizeof(*vec));
3177 kv_init(*vec);
3178 top->value.av = (void *) vec;
3179 kv_push_safe(ucl_object_t *, *vec, elt, e0);
3180 }
3181 else {
3182 /* Slow O(n) algorithm */
3183 kv_prepend_safe(ucl_object_t *, *vec, elt, e0);
3184 }
3185
3186 top->len++;
3187
3188 return true;
3189 e0:
3190 return false;
3191 }
3192
3193 bool ucl_array_merge(ucl_object_t *top, ucl_object_t *elt, bool copy)
3194 {
3195 unsigned i;
3196 ucl_object_t *cp = NULL;
3197 ucl_object_t **obj;
3198
3199 if (elt == NULL || top == NULL || top->type != UCL_ARRAY || elt->type != UCL_ARRAY) {
3200 return false;
3201 }
3202
3203 if (copy) {
3204 cp = ucl_object_copy(elt);
3205 }
3206 else {
3207 cp = ucl_object_ref(elt);
3208 }
3209
3210 UCL_ARRAY_GET(v1, top);
3211 UCL_ARRAY_GET(v2, cp);
3212
3213 if (v1 && v2) {
3214 kv_concat_safe(ucl_object_t *, *v1, *v2, e0);
3215
3216 for (i = v2->n; i < v1->n; i++) {
3217 obj = &kv_A(*v1, i);
3218 if (*obj == NULL) {
3219 continue;
3220 }
3221 top->len++;
3222 }
3223 }
3224
3225 return true;
3226 e0:
3227 return false;
3228 }
3229
3230 ucl_object_t *
3231 ucl_array_delete(ucl_object_t *top, ucl_object_t *elt)
3232 {
3233 if (top->type != UCL_ARRAY) {
3234 return NULL;
3235 }
3236
3237 UCL_ARRAY_GET(vec, top);
3238 ucl_object_t *ret = NULL;
3239 unsigned i;
3240
3241 if (vec == NULL) {
3242 return NULL;
3243 }
3244
3245 for (i = 0; i < vec->n; i++) {
3246 if (kv_A(*vec, i) == elt) {
3247 kv_del(ucl_object_t *, *vec, i);
3248 ret = elt;
3249 top->len--;
3250 break;
3251 }
3252 }
3253
3254 return ret;
3255 }
3256
3257 const ucl_object_t *
3258 ucl_array_head(const ucl_object_t *top)
3259 {
3260 UCL_ARRAY_GET(vec, top);
3261
3262 if (vec == NULL || top == NULL || top->type != UCL_ARRAY ||
3263 top->value.av == NULL) {
3264 return NULL;
3265 }
3266
3267 return (vec->n > 0 ? vec->a[0] : NULL);
3268 }
3269
3270 const ucl_object_t *
3271 ucl_array_tail(const ucl_object_t *top)
3272 {
3273 UCL_ARRAY_GET(vec, top);
3274
3275 if (top == NULL || top->type != UCL_ARRAY || top->value.av == NULL) {
3276 return NULL;
3277 }
3278
3279 return (vec->n > 0 ? vec->a[vec->n - 1] : NULL);
3280 }
3281
3282 ucl_object_t *
3283 ucl_array_pop_last(ucl_object_t *top)
3284 {
3285 if (top->type != UCL_ARRAY) {
3286 return NULL;
3287 }
3288
3289 UCL_ARRAY_GET(vec, top);
3290 ucl_object_t **obj, *ret = NULL;
3291
3292 if (vec != NULL && vec->n > 0) {
3293 obj = &kv_A(*vec, vec->n - 1);
3294 ret = *obj;
3295 kv_del(ucl_object_t *, *vec, vec->n - 1);
3296 top->len--;
3297 }
3298
3299 return ret;
3300 }
3301
3302 ucl_object_t *
3303 ucl_array_pop_first(ucl_object_t *top)
3304 {
3305 if (top->type != UCL_ARRAY) {
3306 return NULL;
3307 }
3308
3309 UCL_ARRAY_GET(vec, top);
3310 ucl_object_t **obj, *ret = NULL;
3311
3312 if (vec != NULL && vec->n > 0) {
3313 obj = &kv_A(*vec, 0);
3314 ret = *obj;
3315 kv_del(ucl_object_t *, *vec, 0);
3316 top->len--;
3317 }
3318
3319 return ret;
3320 }
3321
3322 unsigned int
3323 ucl_array_size(const ucl_object_t *top)
3324 {
3325 if (top == NULL || top->type != UCL_ARRAY) {
3326 return 0;
3327 }
3328
3329 UCL_ARRAY_GET(vec, top);
3330
3331 if (vec != NULL) {
3332 return kv_size(*vec);
3333 }
3334
3335 return 0;
3336 }
3337
3338 const ucl_object_t *
3339 ucl_array_find_index(const ucl_object_t *top, unsigned int index)
3340 {
3341 if (top->type != UCL_ARRAY) {
3342 return NULL;
3343 }
3344
3345 UCL_ARRAY_GET(vec, top);
3346
3347 if (vec != NULL && vec->n > 0 && index < vec->n) {
3348 return kv_A(*vec, index);
3349 }
3350
3351 return NULL;
3352 }
3353
3354 unsigned int
3355 ucl_array_index_of(ucl_object_t *top, ucl_object_t *elt)
3356 {
3357 if (top->type != UCL_ARRAY) {
3358 return (unsigned int) (-1);
3359 }
3360
3361 UCL_ARRAY_GET(vec, top);
3362 unsigned i;
3363
3364 if (vec == NULL) {
3365 return (unsigned int) (-1);
3366 }
3367
3368 for (i = 0; i < vec->n; i++) {
3369 if (kv_A(*vec, i) == elt) {
3370 return i;
3371 }
3372 }
3373
3374 return (unsigned int) (-1);
3375 }
3376
3377 ucl_object_t *
3378 ucl_array_replace_index(ucl_object_t *top, ucl_object_t *elt,
3379 unsigned int index)
3380 {
3381 if (top->type != UCL_ARRAY) {
3382 return NULL;
3383 }
3384
3385 UCL_ARRAY_GET(vec, top);
3386 ucl_object_t *ret = NULL;
3387
3388 if (vec != NULL && vec->n > 0 && index < vec->n) {
3389 ret = kv_A(*vec, index);
3390 kv_A(*vec, index) = elt;
3391 }
3392
3393 return ret;
3394 }
3395
3396 ucl_object_t *
3397 ucl_elt_append(ucl_object_t *head, ucl_object_t *elt)
3398 {
3399
3400 if (head == NULL) {
3401 elt->next = NULL;
3402 elt->prev = elt;
3403 head = elt;
3404 }
3405 else {
3406 if (head->type == UCL_USERDATA) {
3407 /* Userdata objects are VERY special! */
3408 struct ucl_object_userdata *ud = (struct ucl_object_userdata *) head;
3409 elt->prev = ud->obj.prev;
3410 ud->obj.prev->next = elt;
3411 ud->obj.prev = elt;
3412 elt->next = NULL;
3413 }
3414 else {
3415 elt->prev = head->prev;
3416 head->prev->next = elt;
3417 head->prev = elt;
3418 elt->next = NULL;
3419 }
3420 }
3421
3422 return head;
3423 }
3424
3425 bool ucl_object_todouble_safe(const ucl_object_t *obj, double *target)
3426 {
3427 if (obj == NULL || target == NULL) {
3428 return false;
3429 }
3430 switch (obj->type) {
3431 case UCL_INT:
3432 *target = obj->value.iv; /* Probably could cause overflow */
3433 break;
3434 case UCL_FLOAT:
3435 case UCL_TIME:
3436 *target = obj->value.dv;
3437 break;
3438 default:
3439 return false;
3440 }
3441
3442 return true;
3443 }
3444
3445 double
3446 ucl_object_todouble(const ucl_object_t *obj)
3447 {
3448 double result = 0.;
3449
3450 ucl_object_todouble_safe(obj, &result);
3451 return result;
3452 }
3453
3454 bool ucl_object_toint_safe(const ucl_object_t *obj, int64_t *target)
3455 {
3456 if (obj == NULL || target == NULL) {
3457 return false;
3458 }
3459 switch (obj->type) {
3460 case UCL_INT:
3461 *target = obj->value.iv;
3462 break;
3463 case UCL_FLOAT:
3464 case UCL_TIME:
3465 *target = obj->value.dv; /* Losing of decimal points */
3466 break;
3467 default:
3468 return false;
3469 }
3470
3471 return true;
3472 }
3473
3474 int64_t
3475 ucl_object_toint(const ucl_object_t *obj)
3476 {
3477 int64_t result = 0;
3478
3479 ucl_object_toint_safe(obj, &result);
3480 return result;
3481 }
3482
3483 bool ucl_object_toboolean_safe(const ucl_object_t *obj, bool *target)
3484 {
3485 if (obj == NULL || target == NULL) {
3486 return false;
3487 }
3488 switch (obj->type) {
3489 case UCL_BOOLEAN:
3490 *target = (obj->value.iv == true);
3491 break;
3492 default:
3493 return false;
3494 }
3495
3496 return true;
3497 }
3498
3499 bool ucl_object_toboolean(const ucl_object_t *obj)
3500 {
3501 bool result = false;
3502
3503 ucl_object_toboolean_safe(obj, &result);
3504 return result;
3505 }
3506
3507 bool ucl_object_tostring_safe(const ucl_object_t *obj, const char **target)
3508 {
3509 if (obj == NULL || target == NULL) {
3510 return false;
3511 }
3512
3513 switch (obj->type) {
3514 case UCL_STRING:
3515 if (!(obj->flags & UCL_OBJECT_BINARY)) {
3516 *target = ucl_copy_value_trash(obj);
3517 }
3518 break;
3519 default:
3520 return false;
3521 }
3522
3523 return true;
3524 }
3525
3526 const char *
3527 ucl_object_tostring(const ucl_object_t *obj)
3528 {
3529 const char *result = NULL;
3530
3531 ucl_object_tostring_safe(obj, &result);
3532 return result;
3533 }
3534
3535 const char *
3536 ucl_object_tostring_forced(const ucl_object_t *obj)
3537 {
3538 /* TODO: For binary strings we might encode string here */
3539 if (!(obj->flags & UCL_OBJECT_BINARY)) {
3540 return ucl_copy_value_trash(obj);
3541 }
3542
3543 return NULL;
3544 }
3545
3546 bool ucl_object_tolstring_safe(const ucl_object_t *obj, const char **target, size_t *tlen)
3547 {
3548 if (obj == NULL || target == NULL) {
3549 return false;
3550 }
3551 switch (obj->type) {
3552 case UCL_STRING:
3553 *target = obj->value.sv;
3554 if (tlen != NULL) {
3555 *tlen = obj->len;
3556 }
3557 break;
3558 default:
3559 return false;
3560 }
3561
3562 return true;
3563 }
3564
3565 const char *
3566 ucl_object_tolstring(const ucl_object_t *obj, size_t *tlen)
3567 {
3568 const char *result = NULL;
3569
3570 ucl_object_tolstring_safe(obj, &result, tlen);
3571 return result;
3572 }
3573
3574 const char *
3575 ucl_object_key(const ucl_object_t *obj)
3576 {
3577 return ucl_copy_key_trash(obj);
3578 }
3579
3580 const char *
3581 ucl_object_keyl(const ucl_object_t *obj, size_t *len)
3582 {
3583 if (len == NULL || obj == NULL) {
3584 return NULL;
3585 }
3586 *len = obj->keylen;
3587 return obj->key;
3588 }
3589
3590 ucl_object_t *
3591 ucl_object_ref(const ucl_object_t *obj)
3592 {
3593 ucl_object_t *res = NULL;
3594
3595 if (obj != NULL) {
3596 if (obj->flags & UCL_OBJECT_EPHEMERAL) {
3597 /*
3598 * Use deep copy for ephemeral objects, note that its refcount
3599 * is NOT increased, since ephemeral objects does not need refcount
3600 * at all
3601 */
3602 res = ucl_object_copy(obj);
3603 }
3604 else {
3605 res = __DECONST(ucl_object_t *, obj);
3606 #ifdef HAVE_ATOMIC_BUILTINS
3607 (void) __sync_add_and_fetch(&res->ref, 1);
3608 #else
3609 res->ref++;
3610 #endif
3611 }
3612 }
3613 return res;
3614 }
3615
3616 static ucl_object_t *
3617 ucl_object_copy_internal(const ucl_object_t *other, bool allow_array)
3618 {
3619
3620 ucl_object_t *new;
3621 ucl_object_iter_t it = NULL;
3622 const ucl_object_t *cur;
3623 size_t sz = sizeof(*new);
3624
3625 if (other->type == UCL_USERDATA) {
3626 sz = sizeof(struct ucl_object_userdata);
3627 }
3628 new = UCL_ALLOC(sz);
3629
3630 if (new != NULL) {
3631 memcpy(new, other, sz);
3632 if (other->flags & UCL_OBJECT_EPHEMERAL) {
3633 /* Copied object is always non ephemeral */
3634 new->flags &= ~UCL_OBJECT_EPHEMERAL;
3635 }
3636 new->ref = 1;
3637 /* Unlink from others */
3638 new->next = NULL;
3639 new->prev = new;
3640
3641 /* deep copy of values stored */
3642 if (other->trash_stack[UCL_TRASH_KEY] != NULL) {
3643 new->trash_stack[UCL_TRASH_KEY] = NULL;
3644 if (other->key == (const char *) other->trash_stack[UCL_TRASH_KEY]) {
3645 new->trash_stack[UCL_TRASH_KEY] = UCL_ALLOC(other->keylen + 1);
3646 memcpy(new->trash_stack[UCL_TRASH_KEY], other->trash_stack[UCL_TRASH_KEY], other->keylen);
3647 new->trash_stack[UCL_TRASH_KEY][other->keylen] = '\0';
3648 new->key = new->trash_stack[UCL_TRASH_KEY];
3649 }
3650 }
3651 if (other->trash_stack[UCL_TRASH_VALUE] != NULL) {
3652 new->trash_stack[UCL_TRASH_VALUE] =
3653 UCL_STRDUP(other->trash_stack[UCL_TRASH_VALUE]);
3654 if (new->type == UCL_STRING) {
3655 new->value.sv = new->trash_stack[UCL_TRASH_VALUE];
3656 }
3657 }
3658
3659 if (other->type == UCL_ARRAY || other->type == UCL_OBJECT) {
3660 /* reset old value */
3661 memset(&new->value, 0, sizeof(new->value));
3662
3663 while ((cur = ucl_object_iterate(other, &it, true)) != NULL) {
3664 if (other->type == UCL_ARRAY) {
3665 ucl_array_append(new, ucl_object_copy_internal(cur, false));
3666 }
3667 else {
3668 ucl_object_t *cp = ucl_object_copy_internal(cur, true);
3669 if (cp != NULL) {
3670 ucl_object_insert_key(new, cp, cp->key, cp->keylen,
3671 false);
3672 }
3673 }
3674 }
3675 }
3676 else if (allow_array && other->next != NULL) {
3677 LL_FOREACH(other->next, cur)
3678 {
3679 ucl_object_t *cp = ucl_object_copy_internal(cur, false);
3680 if (cp != NULL) {
3681 DL_APPEND(new, cp);
3682 }
3683 }
3684 }
3685 }
3686
3687 return new;
3688 }
3689
3690 ucl_object_t *
3691 ucl_object_copy(const ucl_object_t *other)
3692 {
3693 return ucl_object_copy_internal(other, true);
3694 }
3695
3696 void ucl_object_unref(ucl_object_t *obj)
3697 {
3698 if (obj != NULL) {
3699 #ifdef HAVE_ATOMIC_BUILTINS
3700 unsigned int rc = __sync_sub_and_fetch(&obj->ref, 1);
3701 if (rc == 0) {
3702 #else
3703 if (--obj->ref == 0) {
3704 #endif
3705 ucl_object_free_internal(obj, true, ucl_object_dtor_unref);
3706 }
3707 }
3708 }
3709
3710 int ucl_object_compare(const ucl_object_t *o1, const ucl_object_t *o2)
3711 {
3712 const ucl_object_t *it1, *it2;
3713 ucl_object_iter_t iter = NULL;
3714 int ret = 0;
3715
3716 if (o1->type != o2->type) {
3717 return (o1->type) - (o2->type);
3718 }
3719
3720 switch (o1->type) {
3721 case UCL_STRING:
3722 if (o1->len == o2->len && o1->len > 0) {
3723 ret = strcmp(ucl_object_tostring(o1), ucl_object_tostring(o2));
3724 }
3725 else {
3726 ret = o1->len - o2->len;
3727 }
3728 break;
3729 case UCL_FLOAT:
3730 case UCL_INT:
3731 case UCL_TIME:
3732 ret = ucl_object_todouble(o1) - ucl_object_todouble(o2);
3733 break;
3734 case UCL_BOOLEAN:
3735 ret = ucl_object_toboolean(o1) - ucl_object_toboolean(o2);
3736 break;
3737 case UCL_ARRAY:
3738 if (o1->len == o2->len && o1->len > 0) {
3739 UCL_ARRAY_GET(vec1, o1);
3740 UCL_ARRAY_GET(vec2, o2);
3741 unsigned i;
3742
3743 /* Compare all elements in both arrays */
3744 for (i = 0; i < vec1->n; i++) {
3745 it1 = kv_A(*vec1, i);
3746 it2 = kv_A(*vec2, i);
3747
3748 if (it1 == NULL && it2 != NULL) {
3749 return -1;
3750 }
3751 else if (it2 == NULL && it1 != NULL) {
3752 return 1;
3753 }
3754 else if (it1 != NULL && it2 != NULL) {
3755 ret = ucl_object_compare(it1, it2);
3756 if (ret != 0) {
3757 break;
3758 }
3759 }
3760 }
3761 }
3762 else {
3763 ret = o1->len - o2->len;
3764 }
3765 break;
3766 case UCL_OBJECT:
3767 if (o1->len == o2->len && o1->len > 0) {
3768 while ((it1 = ucl_object_iterate(o1, &iter, true)) != NULL) {
3769 it2 = ucl_object_lookup(o2, ucl_object_key(it1));
3770 if (it2 == NULL) {
3771 ret = 1;
3772 break;
3773 }
3774 ret = ucl_object_compare(it1, it2);
3775 if (ret != 0) {
3776 break;
3777 }
3778 }
3779 }
3780 else {
3781 ret = o1->len - o2->len;
3782 }
3783 break;
3784 default:
3785 ret = 0;
3786 break;
3787 }
3788
3789 return ret;
3790 }
3791
3792 int ucl_object_compare_qsort(const ucl_object_t **o1,
3793 const ucl_object_t **o2)
3794 {
3795 return ucl_object_compare(*o1, *o2);
3796 }
3797
3798 void ucl_object_array_sort(ucl_object_t *ar,
3799 int (*cmp)(const ucl_object_t **o1, const ucl_object_t **o2))
3800 {
3801 UCL_ARRAY_GET(vec, ar);
3802
3803 if (cmp == NULL || ar == NULL || ar->type != UCL_ARRAY) {
3804 return;
3805 }
3806
3807 qsort(vec->a, vec->n, sizeof(ucl_object_t *),
3808 (int (*)(const void *, const void *)) cmp);
3809 }
3810
3811 void ucl_object_sort_keys(ucl_object_t *obj,
3812 enum ucl_object_keys_sort_flags how)
3813 {
3814 if (obj != NULL && obj->type == UCL_OBJECT) {
3815 ucl_hash_sort(obj->value.ov, how);
3816 }
3817 }
3818
3819 #define PRIOBITS 4
3820
3821 unsigned int
3822 ucl_object_get_priority(const ucl_object_t *obj)
3823 {
3824 if (obj == NULL) {
3825 return 0;
3826 }
3827
3828 return (obj->flags >> ((sizeof(obj->flags) * NBBY) - PRIOBITS));
3829 }
3830
3831 void ucl_object_set_priority(ucl_object_t *obj,
3832 unsigned int priority)
3833 {
3834 if (obj != NULL) {
3835 priority &= (0x1 << PRIOBITS) - 1;
3836 priority <<= ((sizeof(obj->flags) * NBBY) - PRIOBITS);
3837 priority |= obj->flags & ((1 << ((sizeof(obj->flags) * NBBY) -
3838 PRIOBITS)) -
3839 1);
3840 obj->flags = priority;
3841 }
3842 }
3843
3844 bool ucl_object_string_to_type(const char *input, ucl_type_t *res)
3845 {
3846 if (strcasecmp(input, "object") == 0) {
3847 *res = UCL_OBJECT;
3848 }
3849 else if (strcasecmp(input, "array") == 0) {
3850 *res = UCL_ARRAY;
3851 }
3852 else if (strcasecmp(input, "integer") == 0) {
3853 *res = UCL_INT;
3854 }
3855 else if (strcasecmp(input, "number") == 0) {
3856 *res = UCL_FLOAT;
3857 }
3858 else if (strcasecmp(input, "string") == 0) {
3859 *res = UCL_STRING;
3860 }
3861 else if (strcasecmp(input, "boolean") == 0) {
3862 *res = UCL_BOOLEAN;
3863 }
3864 else if (strcasecmp(input, "null") == 0) {
3865 *res = UCL_NULL;
3866 }
3867 else if (strcasecmp(input, "userdata") == 0) {
3868 *res = UCL_USERDATA;
3869 }
3870 else {
3871 return false;
3872 }
3873
3874 return true;
3875 }
3876
3877 const char *
3878 ucl_object_type_to_string(ucl_type_t type)
3879 {
3880 const char *res = "unknown";
3881
3882 switch (type) {
3883 case UCL_OBJECT:
3884 res = "object";
3885 break;
3886 case UCL_ARRAY:
3887 res = "array";
3888 break;
3889 case UCL_INT:
3890 res = "integer";
3891 break;
3892 case UCL_FLOAT:
3893 case UCL_TIME:
3894 res = "number";
3895 break;
3896 case UCL_STRING:
3897 res = "string";
3898 break;
3899 case UCL_BOOLEAN:
3900 res = "boolean";
3901 break;
3902 case UCL_USERDATA:
3903 res = "userdata";
3904 break;
3905 case UCL_NULL:
3906 res = "null";
3907 break;
3908 }
3909
3910 return res;
3911 }
3912
3913 const ucl_object_t *
3914 ucl_parser_get_comments(struct ucl_parser *parser)
3915 {
3916 if (parser && parser->comments) {
3917 return parser->comments;
3918 }
3919
3920 return NULL;
3921 }
3922
3923 const ucl_object_t *
3924 ucl_comments_find(const ucl_object_t *comments,
3925 const ucl_object_t *srch)
3926 {
3927 if (comments && srch) {
3928 return ucl_object_lookup_len(comments, (const char *) &srch,
3929 sizeof(void *));
3930 }
3931
3932 return NULL;
3933 }
3934
3935 bool ucl_comments_move(ucl_object_t *comments,
3936 const ucl_object_t *from, const ucl_object_t *to)
3937 {
3938 const ucl_object_t *found;
3939 ucl_object_t *obj;
3940
3941 if (comments && from && to) {
3942 found = ucl_object_lookup_len(comments,
3943 (const char *) &from, sizeof(void *));
3944
3945 if (found) {
3946 /* Replace key */
3947 obj = ucl_object_ref(found);
3948 ucl_object_delete_keyl(comments, (const char *) &from,
3949 sizeof(void *));
3950 ucl_object_insert_key(comments, obj, (const char *) &to,
3951 sizeof(void *), true);
3952
3953 return true;
3954 }
3955 }
3956
3957 return false;
3958 }
3959
3960 void ucl_comments_add(ucl_object_t *comments, const ucl_object_t *obj,
3961 const char *comment)
3962 {
3963 if (comments && obj && comment) {
3964 ucl_object_insert_key(comments, ucl_object_fromstring(comment),
3965 (const char *) &obj, sizeof(void *), true);
3966 }
3967 }
3968
3969 void ucl_parser_set_include_tracer(struct ucl_parser *parser,
3970 ucl_include_trace_func_t func,
3971 void *user_data)
3972 {
3973 parser->include_trace_func = func;
3974 parser->include_trace_ud = user_data;
3975 }
3976
3977 const char *
3978 ucl_parser_get_cur_file(struct ucl_parser *parser)
3979 {
3980 return parser->cur_file;
3981 }
3982