4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU Lesser General Public License as
8 * published by the Free Software Foundation; either version 2.1 of the
9 * License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful, but
12 * WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library. If not, see <http://www.gnu.org/licenses/>.
21 * Copyright (c) 2014, 2015, Intel Corporation.
24 * Amir Shehata <amir.shehata@intel.com>
28 * The cYAML tree is constructed as an n-tree.
32 * cmd 2 -> attr1 -> attr2
35 * attr2.1 -> attr2.1.1 -> attr2.1.2
47 #include "libcfs/util/list.h"
55 * This structure contains print information
56 * required when printing the node
58 struct cYAML_print_info {
66 * Linked list of different trees representing YAML
70 struct list_head list;
72 struct cYAML_print_info *print_info;
75 static void print_value(FILE *f, struct list_head *stack);
77 enum cYAML_handler_error {
79 CYAML_ERROR_UNEXPECTED_STATE = -1,
80 CYAML_ERROR_NOT_SUPPORTED = -2,
81 CYAML_ERROR_OUT_OF_MEM = -3,
82 CYAML_ERROR_BAD_VALUE = -4,
83 CYAML_ERROR_PARSE = -5,
86 enum cYAML_tree_state {
87 TREE_STATE_COMPLETE = 0,
89 TREE_STATE_TREE_STARTED,
90 TREE_STATE_BLK_STARTED,
92 TREE_STATE_KEY_FILLED,
97 struct cYAML_tree_node {
99 /* cur is the current node we're operating on */
101 enum cYAML_tree_state state;
102 int from_blk_map_start;
103 /* represents the tree depth */
107 typedef enum cYAML_handler_error (*yaml_token_handler)(yaml_token_t *token,
108 struct cYAML_tree_node *);
110 static enum cYAML_handler_error yaml_parse_error(yaml_token_t *token,
111 struct cYAML_tree_node *tree);
112 static enum cYAML_handler_error yaml_stream_start(yaml_token_t *token,
113 struct cYAML_tree_node *tree);
114 static enum cYAML_handler_error yaml_stream_end(yaml_token_t *token,
115 struct cYAML_tree_node *tree);
116 static enum cYAML_handler_error yaml_not_supported(yaml_token_t *token,
117 struct cYAML_tree_node *tree);
118 static enum cYAML_handler_error yaml_document_start(yaml_token_t *token,
119 struct cYAML_tree_node *tree);
120 static enum cYAML_handler_error yaml_document_end(yaml_token_t *token,
121 struct cYAML_tree_node *tree);
122 static enum cYAML_handler_error yaml_blk_seq_start(yaml_token_t *token,
123 struct cYAML_tree_node *tree);
124 static enum cYAML_handler_error yaml_blk_mapping_start(yaml_token_t *token,
125 struct cYAML_tree_node *tree);
126 static enum cYAML_handler_error yaml_block_end(yaml_token_t *token,
127 struct cYAML_tree_node *tree);
128 static enum cYAML_handler_error yaml_key(yaml_token_t *token,
129 struct cYAML_tree_node *tree);
130 static enum cYAML_handler_error yaml_value(yaml_token_t *token,
131 struct cYAML_tree_node *tree);
132 static enum cYAML_handler_error yaml_scalar(yaml_token_t *token,
133 struct cYAML_tree_node *tree);
134 static enum cYAML_handler_error yaml_entry_token(yaml_token_t *token,
135 struct cYAML_tree_node *tree);
138 static yaml_token_handler dispatch_tbl[] = {
139 [YAML_NO_TOKEN] = yaml_parse_error,
140 [YAML_STREAM_START_TOKEN] = yaml_stream_start,
141 [YAML_STREAM_END_TOKEN] = yaml_stream_end,
142 [YAML_VERSION_DIRECTIVE_TOKEN] = yaml_not_supported,
143 [YAML_TAG_DIRECTIVE_TOKEN] = yaml_not_supported,
144 [YAML_DOCUMENT_START_TOKEN] = yaml_document_start,
145 [YAML_DOCUMENT_END_TOKEN] = yaml_document_end,
146 [YAML_BLOCK_SEQUENCE_START_TOKEN] = yaml_blk_seq_start,
147 [YAML_BLOCK_MAPPING_START_TOKEN] = yaml_blk_mapping_start,
148 [YAML_BLOCK_END_TOKEN] = yaml_block_end,
149 [YAML_FLOW_SEQUENCE_START_TOKEN] = yaml_not_supported,
150 [YAML_FLOW_SEQUENCE_END_TOKEN] = yaml_not_supported,
151 [YAML_FLOW_MAPPING_START_TOKEN] = yaml_not_supported,
152 [YAML_FLOW_MAPPING_END_TOKEN] = yaml_not_supported,
153 [YAML_BLOCK_ENTRY_TOKEN] = yaml_entry_token,
154 [YAML_FLOW_ENTRY_TOKEN] = yaml_not_supported,
155 [YAML_KEY_TOKEN] = yaml_key,
156 [YAML_VALUE_TOKEN] = yaml_value,
157 [YAML_ALIAS_TOKEN] = yaml_not_supported,
158 [YAML_ANCHOR_TOKEN] = yaml_not_supported,
159 [YAML_TAG_TOKEN] = yaml_not_supported,
160 [YAML_SCALAR_TOKEN] = yaml_scalar,
164 static char *token_type_string[] = {
165 [YAML_NO_TOKEN] = "YAML_NO_TOKEN",
166 [YAML_STREAM_START_TOKEN] = "YAML_STREAM_START_TOKEN",
167 [YAML_STREAM_END_TOKEN] = "YAML_STREAM_END_TOKEN",
168 [YAML_VERSION_DIRECTIVE_TOKEN] = "YAML_VERSION_DIRECTIVE_TOKEN",
169 [YAML_TAG_DIRECTIVE_TOKEN] = "YAML_TAG_DIRECTIVE_TOKEN",
170 [YAML_DOCUMENT_START_TOKEN] = "YAML_DOCUMENT_START_TOKEN",
171 [YAML_DOCUMENT_END_TOKEN] = "YAML_DOCUMENT_END_TOKEN",
172 [YAML_BLOCK_SEQUENCE_START_TOKEN] = "YAML_BLOCK_SEQUENCE_START_TOKEN",
173 [YAML_BLOCK_MAPPING_START_TOKEN] = "YAML_BLOCK_MAPPING_START_TOKEN",
174 [YAML_BLOCK_END_TOKEN] = "YAML_BLOCK_END_TOKEN",
175 [YAML_FLOW_SEQUENCE_START_TOKEN] = "YAML_FLOW_SEQUENCE_START_TOKEN",
176 [YAML_FLOW_SEQUENCE_END_TOKEN] = "YAML_FLOW_SEQUENCE_END_TOKEN",
177 [YAML_FLOW_MAPPING_START_TOKEN] = "YAML_FLOW_MAPPING_START_TOKEN",
178 [YAML_FLOW_MAPPING_END_TOKEN] = "YAML_FLOW_MAPPING_END_TOKEN",
179 [YAML_BLOCK_ENTRY_TOKEN] = "YAML_BLOCK_ENTRY_TOKEN",
180 [YAML_FLOW_ENTRY_TOKEN] = "YAML_FLOW_ENTRY_TOKEN",
181 [YAML_KEY_TOKEN] = "YAML_KEY_TOKEN",
182 [YAML_VALUE_TOKEN] = "YAML_VALUE_TOKEN",
183 [YAML_ALIAS_TOKEN] = "YAML_ALIAS_TOKEN",
184 [YAML_ANCHOR_TOKEN] = "YAML_ANCHOR_TOKEN",
185 [YAML_TAG_TOKEN] = "YAML_TAG_TOKEN",
186 [YAML_SCALAR_TOKEN] = "YAML_SCALAR_TOKEN",
189 static void cYAML_ll_free(struct list_head *ll)
191 struct cYAML_ll *node, *tmp;
193 list_for_each_entry_safe(node, tmp, ll, list) {
194 free(node->print_info);
199 static int cYAML_ll_push(struct cYAML *obj,
200 const struct cYAML_print_info *print_info,
201 struct list_head *list)
203 struct cYAML_ll *node = calloc(1, sizeof(*node));
207 INIT_LIST_HEAD(&node->list);
210 node->print_info = calloc(1, sizeof(*print_info));
211 if (node->print_info == NULL) {
215 *node->print_info = *print_info;
219 list_add(&node->list, list);
224 static struct cYAML *cYAML_ll_pop(struct list_head *list,
225 struct cYAML_print_info **print_info)
227 struct cYAML_ll *pop;
228 struct cYAML *obj = NULL;
230 if (!list_empty(list)) {
231 pop = list_entry(list->next, struct cYAML_ll, list);
234 if (print_info != NULL)
235 *print_info = pop->print_info;
236 list_del(&pop->list);
238 if (print_info == NULL)
239 free(pop->print_info);
246 static int cYAML_ll_count(struct list_head *ll)
249 struct list_head *node;
251 list_for_each(node, ll)
257 static int cYAML_tree_init(struct cYAML_tree_node *tree)
259 struct cYAML *obj = NULL, *cur = NULL;
264 obj = calloc(1, sizeof(*obj));
269 /* append the node */
271 while (cur->cy_next != NULL)
278 obj->cy_type = CYAML_TYPE_OBJECT;
281 tree->state = TREE_STATE_COMPLETE;
283 /* free it and start anew */
284 if (!list_empty(&tree->ll))
285 cYAML_ll_free(&tree->ll);
290 static struct cYAML *create_child(struct cYAML *parent)
297 obj = calloc(1, sizeof(*obj));
301 /* set the type to OBJECT and let the value change that */
302 obj->cy_type = CYAML_TYPE_OBJECT;
304 parent->cy_child = obj;
309 static struct cYAML *create_sibling(struct cYAML *sibling)
316 obj = calloc(1, sizeof(*obj));
320 /* set the type to OBJECT and let the value change that */
321 obj->cy_type = CYAML_TYPE_OBJECT;
323 sibling->cy_next = obj;
324 obj->cy_prev = sibling;
329 /* Parse the input text to generate a number,
330 * and populate the result into item. */
331 static bool parse_number(struct cYAML *item, const char *input)
333 double n = 0, sign = 1, scale = 0;
334 int subscale = 0, signsubscale = 1;
335 const char *num = input;
345 if (*num >= '1' && *num <= '9') {
347 n = (n * 10.0) + (*num++ - '0');
348 } while (*num >= '0' && *num <= '9');
351 if (*num == '.' && num[1] >= '0' && num[1] <= '9') {
354 n = (n * 10.0) + (*num++ - '0');
356 } while (*num >= '0' && *num <= '9');
359 if (*num == 'e' || *num == 'E') {
363 } else if (*num == '-') {
367 while (*num >= '0' && *num <= '9')
368 subscale = (subscale * 10) + (*num++ - '0');
371 /* check to see if the entire string is consumed. If not then
372 * that means this is a string with a number in it */
373 if (num != (input + strlen(input)))
376 /* number = +/- number.fraction * 10^+/- exponent */
377 n = sign * n * pow(10.0, (scale + subscale * signsubscale));
379 item->cy_valuedouble = n;
380 item->cy_valueint = (int)n;
381 item->cy_type = CYAML_TYPE_NUMBER;
386 static int assign_type_value(struct cYAML *obj, const char *value)
391 if (strcmp(value, "null") == 0)
392 obj->cy_type = CYAML_TYPE_NULL;
393 else if (strcmp(value, "false") == 0) {
394 obj->cy_type = CYAML_TYPE_FALSE;
395 obj->cy_valueint = 0;
396 } else if (strcmp(value, "true") == 0) {
397 obj->cy_type = CYAML_TYPE_TRUE;
398 obj->cy_valueint = 1;
399 } else if (*value == '-' || (*value >= '0' && *value <= '9')) {
400 if (parse_number(obj, value) == 0) {
401 obj->cy_valuestring = strdup(value);
402 obj->cy_type = CYAML_TYPE_STRING;
405 obj->cy_valuestring = strdup(value);
406 obj->cy_type = CYAML_TYPE_STRING;
414 * Builds the YAML tree rpresentation as the tokens are passed in
416 * if token == STREAM_START && tree_state != COMPLETE
417 * something wrong. fail.
418 * else tree_state = INITIED
419 * if token == DOCUMENT_START && tree_state != COMPLETE || INITED
420 * something wrong, fail.
421 * else tree_state = TREE_STARTED
422 * if token == DOCUMENT_END
423 * tree_state = INITED if no STREAM START, else tree_state = COMPLETE
424 * erase everything on ll
425 * if token == STREAM_END && tree_state != INITED
426 * something wrong fail.
427 * else tree_state = COMPLETED
428 * if token == YAML_KEY_TOKEN && state != TREE_STARTED
429 * something wrong, fail.
430 * if token == YAML_SCALAR_TOKEN && state != KEY || VALUE
432 * else if tree_state == KEY
433 * create a new sibling under the current head of the ll (if ll is
434 * empty insert the new node there and it becomes the root.)
435 * add the scalar value in the "string"
436 * tree_state = KEY_FILLED
437 * else if tree_state == VALUE
438 * try and figure out whether this is a double, int or string and store
440 * state = TREE_STARTED
441 * else if token == YAML_BLOCK_MAPPING_START_TOKEN && tree_state != VALUE
443 * else push the current node on the ll && state = TREE_STARTED
444 * if token == YAML_BLOCK_END_TOKEN && state != TREE_STARTED
446 * else pop the current token off the ll and make it the cur
447 * if token == YAML_VALUE_TOKEN && state != KEY_FILLED
452 static enum cYAML_handler_error yaml_parse_error(yaml_token_t *token,
453 struct cYAML_tree_node *tree)
455 return CYAML_ERROR_PARSE;
458 static enum cYAML_handler_error yaml_stream_start(yaml_token_t *token,
459 struct cYAML_tree_node *tree)
461 enum cYAML_handler_error rc;
463 /* with each new stream initialize a new tree */
464 rc = cYAML_tree_init(tree);
466 if (rc != CYAML_ERROR_NONE)
469 tree->state = TREE_STATE_INITED;
471 return CYAML_ERROR_NONE;
474 static enum cYAML_handler_error yaml_stream_end(yaml_token_t *token,
475 struct cYAML_tree_node *tree)
477 if (tree->state != TREE_STATE_TREE_STARTED &&
478 tree->state != TREE_STATE_COMPLETE)
479 return CYAML_ERROR_UNEXPECTED_STATE;
481 tree->state = TREE_STATE_INITED;
483 return CYAML_ERROR_NONE;
486 static enum cYAML_handler_error
487 yaml_document_start(yaml_token_t *token, struct cYAML_tree_node *tree)
489 if (tree->state != TREE_STATE_INITED)
490 return CYAML_ERROR_UNEXPECTED_STATE;
492 /* go to started state since we're expecting more tokens to come */
493 tree->state = TREE_STATE_TREE_STARTED;
495 return CYAML_ERROR_NONE;
498 static enum cYAML_handler_error yaml_document_end(yaml_token_t *token,
499 struct cYAML_tree_node *tree)
501 if (tree->state != TREE_STATE_COMPLETE)
502 return CYAML_ERROR_UNEXPECTED_STATE;
504 tree->state = TREE_STATE_TREE_STARTED;
506 return CYAML_ERROR_NONE;
509 static enum cYAML_handler_error yaml_key(yaml_token_t *token,
510 struct cYAML_tree_node *tree)
512 if (tree->state != TREE_STATE_BLK_STARTED &&
513 tree->state != TREE_STATE_VALUE)
514 return CYAML_ERROR_UNEXPECTED_STATE;
516 if (tree->from_blk_map_start == 0 ||
517 tree->state == TREE_STATE_VALUE)
518 tree->cur = create_sibling(tree->cur);
520 tree->from_blk_map_start = 0;
522 tree->state = TREE_STATE_KEY;
524 return CYAML_ERROR_NONE;
527 static enum cYAML_handler_error yaml_scalar(yaml_token_t *token,
528 struct cYAML_tree_node *tree)
530 if (tree->state == TREE_STATE_KEY) {
531 /* assign the scalar value to the key that was created */
532 tree->cur->cy_string =
533 strdup((const char *)token->data.scalar.value);
535 tree->state = TREE_STATE_KEY_FILLED;
536 } else if (tree->state == TREE_STATE_VALUE) {
537 if (assign_type_value(tree->cur,
538 (char *)token->data.scalar.value))
539 /* failed to assign a value */
540 return CYAML_ERROR_BAD_VALUE;
541 tree->state = TREE_STATE_BLK_STARTED;
543 return CYAML_ERROR_UNEXPECTED_STATE;
546 return CYAML_ERROR_NONE;
549 static enum cYAML_handler_error yaml_value(yaml_token_t *token,
550 struct cYAML_tree_node *tree)
552 if (tree->state != TREE_STATE_KEY_FILLED)
553 return CYAML_ERROR_UNEXPECTED_STATE;
555 tree->state = TREE_STATE_VALUE;
557 return CYAML_ERROR_NONE;
560 static enum cYAML_handler_error yaml_blk_seq_start(yaml_token_t *token,
561 struct cYAML_tree_node *tree)
563 if (tree->state != TREE_STATE_VALUE)
564 return CYAML_ERROR_UNEXPECTED_STATE;
566 /* Since a sequenc start event determines that this is the start
567 * of an array, then that means the current node we're at is an
568 * array and we need to flag it as such */
569 tree->cur->cy_type = CYAML_TYPE_ARRAY;
570 tree->state = TREE_STATE_SEQ_START;
572 return CYAML_ERROR_NONE;
575 static enum cYAML_handler_error yaml_entry_token(yaml_token_t *token,
576 struct cYAML_tree_node *tree)
580 if (tree->state != TREE_STATE_SEQ_START &&
581 tree->state != TREE_STATE_BLK_STARTED)
582 return CYAML_ERROR_UNEXPECTED_STATE;
584 if (tree->state == TREE_STATE_SEQ_START) {
585 obj = create_child(tree->cur);
587 if (cYAML_ll_push(tree->cur, NULL, &tree->ll))
588 return CYAML_ERROR_OUT_OF_MEM;
592 tree->cur = create_sibling(tree->cur);
593 tree->state = TREE_STATE_SEQ_START;
596 return CYAML_ERROR_NONE;
599 static enum cYAML_handler_error
600 yaml_blk_mapping_start(yaml_token_t *token,
601 struct cYAML_tree_node *tree)
605 if (tree->state != TREE_STATE_VALUE &&
606 tree->state != TREE_STATE_INITED &&
607 tree->state != TREE_STATE_SEQ_START &&
608 tree->state != TREE_STATE_TREE_STARTED)
609 return CYAML_ERROR_UNEXPECTED_STATE;
611 /* block_mapping_start means we're entering another block
612 * indentation, so we need to go one level deeper
613 * create a child of cur */
614 obj = create_child(tree->cur);
616 /* push cur on the stack */
617 if (cYAML_ll_push(tree->cur, NULL, &tree->ll))
618 return CYAML_ERROR_OUT_OF_MEM;
620 /* adding the new child to cur */
623 tree->state = TREE_STATE_BLK_STARTED;
625 tree->from_blk_map_start = 1;
627 return CYAML_ERROR_NONE;
630 static enum cYAML_handler_error yaml_block_end(yaml_token_t *token,
631 struct cYAML_tree_node *tree)
633 if (tree->state != TREE_STATE_BLK_STARTED &&
634 tree->state != TREE_STATE_VALUE)
635 return CYAML_ERROR_UNEXPECTED_STATE;
637 tree->cur = cYAML_ll_pop(&tree->ll, NULL);
639 /* if you have popped all the way to the top level, then move to
640 * the complete state. */
641 if (cYAML_ll_count(&tree->ll) == 0)
642 tree->state = TREE_STATE_COMPLETE;
643 else if (tree->state == TREE_STATE_VALUE)
644 tree->state = TREE_STATE_BLK_STARTED;
646 return CYAML_ERROR_NONE;
649 static enum cYAML_handler_error yaml_not_supported(yaml_token_t *token,
650 struct cYAML_tree_node *tree)
652 return CYAML_ERROR_NOT_SUPPORTED;
655 static bool clean_usr_data(struct cYAML *node, void *usr_data, void **out)
657 cYAML_user_data_free_cb free_cb = usr_data;
659 if (free_cb && node && node->cy_user_data) {
660 free_cb(node->cy_user_data);
661 node->cy_user_data = NULL;
667 static bool free_node(struct cYAML *node, void *user_data, void **out)
675 static bool find_obj_iter(struct cYAML *node, void *usr_data, void **out)
677 char *name = usr_data;
679 if (node != NULL && node->cy_string != NULL &&
680 strcmp(node->cy_string, name) == 0) {
688 struct cYAML *cYAML_get_object_item(struct cYAML *parent, const char *name)
692 if (parent == NULL || parent->cy_child == NULL || name == NULL)
695 node = parent->cy_child;
697 while (node != NULL &&
698 strcmp(node->cy_string, name) != 0) {
699 node = node->cy_next;
705 struct cYAML *cYAML_get_next_seq_item(struct cYAML *seq, struct cYAML **itm)
707 if (*itm != NULL && (*itm)->cy_next != NULL) {
708 *itm = (*itm)->cy_next;
712 if (*itm == NULL && seq->cy_type == CYAML_TYPE_ARRAY) {
713 *itm = seq->cy_child;
720 bool cYAML_is_sequence(struct cYAML *node)
722 return (node != NULL ? node->cy_type == CYAML_TYPE_ARRAY : 0);
725 void cYAML_tree_recursive_walk(struct cYAML *node, cYAML_walk_cb cb,
734 if (!cb(node, usr_data, out))
739 cYAML_tree_recursive_walk(node->cy_child, cb,
740 cb_first, usr_data, out);
743 cYAML_tree_recursive_walk(node->cy_next, cb,
744 cb_first, usr_data, out);
747 if (!cb(node, usr_data, out))
752 struct cYAML *cYAML_find_object(struct cYAML *root, const char *name)
754 struct cYAML *found = NULL;
756 cYAML_tree_recursive_walk(root, find_obj_iter, true,
757 (void *)name, (void **)&found);
762 void cYAML_clean_usr_data(struct cYAML *node, cYAML_user_data_free_cb free_cb)
764 cYAML_tree_recursive_walk(node, clean_usr_data, false, free_cb, NULL);
767 void cYAML_free_tree(struct cYAML *node)
769 cYAML_tree_recursive_walk(node, free_node, false, NULL, NULL);
772 static inline void print_simple(FILE *f, struct cYAML *node,
773 struct cYAML_print_info *cpi)
775 int level = cpi->level;
776 int ind = cpi->extra_ind;
778 if (cpi->array_first_elem)
779 fprintf(f, "%*s- ", INDENT * level, "");
781 fprintf(f, "%*s""%s: %d\n", (cpi->array_first_elem) ? 0 :
782 INDENT * level + ind, "", node->cy_string,
786 static void print_string(FILE *f, struct cYAML *node,
787 struct cYAML_print_info *cpi)
790 int level = cpi->level;
791 int ind = cpi->extra_ind;
793 if (cpi->array_first_elem)
794 fprintf(f, "%*s- ", INDENT * level, "");
796 new_line = strchr(node->cy_valuestring, '\n');
797 if (new_line == NULL)
798 fprintf(f, "%*s""%s: %s\n", (cpi->array_first_elem) ?
799 0 : INDENT * level + ind, "",
800 node->cy_string, node->cy_valuestring);
803 fprintf(f, "%*s""%s: ", (cpi->array_first_elem) ?
804 0 : INDENT * level + ind, "",
806 char *l = node->cy_valuestring;
809 fprintf(f, "%*s""%s\n", indent, "", l);
810 indent = INDENT * level + ind +
811 strlen(node->cy_string) + 2;
814 new_line = strchr(l, '\n');
816 fprintf(f, "%*s""%s\n", indent, "", l);
820 static void print_number(FILE *f, struct cYAML *node,
821 struct cYAML_print_info *cpi)
823 double d = node->cy_valuedouble;
824 int level = cpi->level;
825 int ind = cpi->extra_ind;
827 if (cpi->array_first_elem)
828 fprintf(f, "%*s- ", INDENT * level, "");
830 if ((fabs(((double)node->cy_valueint) - d) <= DBL_EPSILON) &&
831 (d <= INT_MAX) && (d >= INT_MIN))
832 fprintf(f, "%*s""%s: %d\n", (cpi->array_first_elem) ? 0 :
833 INDENT * level + ind, "",
834 node->cy_string, node->cy_valueint);
836 if ((fabs(floor(d) - d) <= DBL_EPSILON) &&
838 fprintf(f, "%*s""%s: %.0f\n",
839 (cpi->array_first_elem) ? 0 :
840 INDENT * level + ind, "",
842 else if ((fabs(d) < 1.0e-6) || (fabs(d) > 1.0e9))
843 fprintf(f, "%*s""%s: %e\n",
844 (cpi->array_first_elem) ? 0 :
845 INDENT * level + ind, "",
848 fprintf(f, "%*s""%s: %f\n",
849 (cpi->array_first_elem) ? 0 :
850 INDENT * level + ind, "",
855 static void print_object(FILE *f, struct cYAML *node,
856 struct list_head *stack,
857 struct cYAML_print_info *cpi)
859 struct cYAML_print_info print_info;
860 struct cYAML *child = node->cy_child;
862 if (node->cy_string != NULL)
863 fprintf(f, "%*s""%s%s:\n", (cpi->array_first_elem) ?
864 INDENT * cpi->level :
865 INDENT * cpi->level + cpi->extra_ind,
866 "", (cpi->array_first_elem) ? "- " : "",
869 print_info.level = (node->cy_string != NULL) ? cpi->level + 1 :
871 print_info.array_first_elem = (node->cy_string == NULL) ?
872 cpi->array_first_elem : 0;
873 print_info.extra_ind = (cpi->array_first_elem) ? EXTRA_IND :
877 if (cYAML_ll_push(child, &print_info, stack) != 0)
879 print_value(f, stack);
880 print_info.array_first_elem = 0;
881 child = child->cy_next;
885 static void print_array(FILE *f, struct cYAML *node,
886 struct list_head *stack,
887 struct cYAML_print_info *cpi)
889 struct cYAML_print_info print_info;
890 struct cYAML *child = node->cy_child;
892 if (node->cy_string != NULL) {
893 fprintf(f, "%*s""%s:\n", INDENT * cpi->level + cpi->extra_ind,
894 "", node->cy_string);
897 print_info.level = (node->cy_string != NULL) ? cpi->level + 1 :
899 print_info.array_first_elem = 1;
900 print_info.extra_ind = EXTRA_IND;
903 if (cYAML_ll_push(child, &print_info, stack) != 0)
905 print_value(f, stack);
906 child = child->cy_next;
910 static void print_value(FILE *f, struct list_head *stack)
912 struct cYAML_print_info *cpi = NULL;
913 struct cYAML *node = cYAML_ll_pop(stack, &cpi);
918 switch (node->cy_type) {
919 case CYAML_TYPE_FALSE:
920 case CYAML_TYPE_TRUE:
921 case CYAML_TYPE_NULL:
922 print_simple(f, node, cpi);
924 case CYAML_TYPE_STRING:
925 print_string(f, node, cpi);
927 case CYAML_TYPE_NUMBER:
928 print_number(f, node, cpi);
930 case CYAML_TYPE_ARRAY:
931 print_array(f, node, stack, cpi);
933 case CYAML_TYPE_OBJECT:
934 print_object(f, node, stack, cpi);
944 void cYAML_print_tree(struct cYAML *node)
946 struct cYAML_print_info print_info;
947 struct list_head list;
949 INIT_LIST_HEAD(&list);
954 memset(&print_info, 0, sizeof(struct cYAML_print_info));
956 if (cYAML_ll_push(node, &print_info, &list) == 0)
957 print_value(stdout, &list);
960 void cYAML_print_tree2file(FILE *f, struct cYAML *node)
962 struct cYAML_print_info print_info;
963 struct list_head list;
965 INIT_LIST_HEAD(&list);
970 memset(&print_info, 0, sizeof(struct cYAML_print_info));
972 if (cYAML_ll_push(node, &print_info, &list) == 0)
973 print_value(f, &list);
976 static struct cYAML *insert_item(struct cYAML *parent, char *key,
977 enum cYAML_object_type type)
979 struct cYAML *node = calloc(1, sizeof(*node));
985 node->cy_string = strdup(key);
987 node->cy_type = type;
989 cYAML_insert_child(parent, node);
994 struct cYAML *cYAML_create_seq(struct cYAML *parent, char *key)
996 return insert_item(parent, key, CYAML_TYPE_ARRAY);
999 struct cYAML *cYAML_create_seq_item(struct cYAML *seq)
1001 return insert_item(seq, NULL, CYAML_TYPE_OBJECT);
1004 struct cYAML *cYAML_create_object(struct cYAML *parent, char *key)
1006 return insert_item(parent, key, CYAML_TYPE_OBJECT);
1009 struct cYAML *cYAML_create_string(struct cYAML *parent, char *key, char *value)
1011 struct cYAML *node = calloc(1, sizeof(*node));
1015 node->cy_string = strdup(key);
1016 node->cy_valuestring = strdup(value);
1017 node->cy_type = CYAML_TYPE_STRING;
1019 cYAML_insert_child(parent, node);
1024 struct cYAML *cYAML_create_number(struct cYAML *parent, char *key, double value)
1026 struct cYAML *node = calloc(1, sizeof(*node));
1030 node->cy_string = strdup(key);
1031 node->cy_valuedouble = value;
1032 node->cy_valueint = (int)value;
1033 node->cy_type = CYAML_TYPE_NUMBER;
1035 cYAML_insert_child(parent, node);
1040 void cYAML_insert_child(struct cYAML *parent, struct cYAML *node)
1044 if (parent && node) {
1045 if (parent->cy_child == NULL) {
1046 parent->cy_child = node;
1050 cur = parent->cy_child;
1052 while (cur->cy_next)
1055 cur->cy_next = node;
1056 node->cy_prev = cur;
1060 void cYAML_insert_sibling(struct cYAML *root, struct cYAML *sibling)
1062 struct cYAML *last = NULL;
1063 if (root == NULL || sibling == NULL)
1067 while (last->cy_next != NULL)
1068 last = last->cy_next;
1070 last->cy_next = sibling;
1073 void cYAML_build_error(int rc, int seq_no, char *cmd,
1074 char *entity, char *err_str,
1075 struct cYAML **root)
1077 struct cYAML *r = NULL, *err, *s, *itm, *cmd_obj;
1081 /* add to the tail of the root that's passed in */
1082 if ((*root) == NULL) {
1083 *root = cYAML_create_object(NULL, NULL);
1084 if ((*root) == NULL)
1090 /* look for the command */
1091 cmd_obj = cYAML_get_object_item(r, (const char *)cmd);
1092 if (cmd_obj != NULL && cmd_obj->cy_type == CYAML_TYPE_ARRAY)
1093 itm = cYAML_create_seq_item(cmd_obj);
1094 else if (cmd_obj == NULL) {
1095 s = cYAML_create_seq(r, cmd);
1096 itm = cYAML_create_seq_item(s);
1097 } else if (cmd_obj != NULL && cmd_obj->cy_type != CYAML_TYPE_ARRAY)
1100 err = cYAML_create_object(itm, entity);
1105 cYAML_create_number(err, "seq_no", seq_no) == NULL)
1108 if (cYAML_create_number(err, "errno", rc) == NULL)
1111 if (cYAML_create_string(err, "descr", err_str) == NULL)
1117 /* Only reason we get here is if we run out of memory */
1120 fprintf(stderr, "error:\n\tfatal: out of memory\n");
1123 struct cYAML *cYAML_build_tree(char *yaml_file,
1124 const char *yaml_blk,
1125 size_t yaml_blk_size,
1126 struct cYAML **err_rc,
1129 yaml_parser_t parser;
1131 struct cYAML_tree_node tree;
1132 enum cYAML_handler_error rc;
1133 yaml_token_type_t token_type;
1138 memset(&tree, 0, sizeof(struct cYAML_tree_node));
1140 INIT_LIST_HEAD(&tree.ll);
1142 /* Create the Parser object. */
1143 yaml_parser_initialize(&parser);
1145 /* file always takes precedence */
1146 if (yaml_file != NULL) {
1147 /* Set a file input. */
1148 input = fopen(yaml_file, "rb");
1149 if (input == NULL) {
1150 snprintf(err_str, sizeof(err_str),
1151 "Failed to open file: %s", yaml_file);
1152 cYAML_build_error(-1, -1, "yaml", "builder",
1158 yaml_parser_set_input_file(&parser, input);
1159 } else if (yaml_blk != NULL) {
1160 yaml_parser_set_input_string(&parser,
1161 (const unsigned char *) yaml_blk,
1164 /* assume that we're getting our input froms stdin */
1165 yaml_parser_set_input_file(&parser, stdin);
1167 /* Read the event sequence. */
1170 * Go through the parser and build a cYAML representation
1171 * of the passed in YAML text
1173 yaml_parser_scan(&parser, &token);
1176 fprintf(stderr, "token.type = %s: %s\n",
1177 token_type_string[token.type],
1178 (token.type == YAML_SCALAR_TOKEN) ?
1179 (char*)token.data.scalar.value : "");
1180 rc = dispatch_tbl[token.type](&token, &tree);
1181 if (rc != CYAML_ERROR_NONE) {
1182 snprintf(err_str, sizeof(err_str),
1183 "Failed to handle token:%d "
1184 "[state=%d, rc=%d]",
1185 token.type, tree.state, rc);
1186 cYAML_build_error(-1, -1, "yaml", "builder",
1190 /* Are we finished? */
1191 done = (rc != CYAML_ERROR_NONE ||
1192 token.type == YAML_STREAM_END_TOKEN ||
1193 token.type == YAML_NO_TOKEN);
1195 token_type = token.type;
1197 yaml_token_delete(&token);
1200 /* Destroy the Parser object. */
1201 yaml_parser_delete(&parser);
1206 if (token_type == YAML_STREAM_END_TOKEN &&
1207 rc == CYAML_ERROR_NONE)
1210 cYAML_free_tree(tree.root);