Whamcloud - gitweb
LU-9578 llite: use security context if it's enabled in the kernel
[fs/lustre-release.git] / lnet / utils / lnetconfig / cyaml.c
1 /*
2  * LGPL HEADER START
3  *
4  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
5  *
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.
10  *
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.
15  *
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/>.
18  *
19  * LGPL HEADER END
20  *
21  * Copyright (c) 2014, 2015, Intel Corporation.
22  *
23  * Author:
24  *   Amir Shehata <amir.shehata@intel.com>
25  */
26
27 /*
28  *  The cYAML tree is constructed as an n-tree.
29  *  root -> cmd 1
30  *          ||
31  *          \/
32  *          cmd 2 -> attr1 -> attr2
33  *                              ||
34  *                              \/
35  *                            attr2.1 -> attr2.1.1 -> attr2.1.2
36  */
37
38 #include <yaml.h>
39 #include <stdio.h>
40 #include <string.h>
41 #include <stdio.h>
42 #include <math.h>
43 #include <stdlib.h>
44 #include <float.h>
45 #include <limits.h>
46 #include <ctype.h>
47 #include "libcfs/util/list.h"
48 #include <cyaml.h>
49
50 #define INDENT          4
51 #define EXTRA_IND       2
52
53 /*
54  * cYAML_print_info
55  *   This structure contains print information
56  *   required when printing the node
57  */
58 struct cYAML_print_info {
59         int level;
60         int array_first_elem;
61         int extra_ind;
62 };
63
64 /*
65  *  cYAML_ll
66  *  Linked list of different trees representing YAML
67  *  documents.
68  */
69 struct cYAML_ll {
70         struct list_head list;
71         struct cYAML *obj;
72         struct cYAML_print_info *print_info;
73 };
74
75 static void print_value(FILE *f, struct list_head *stack);
76
77 enum cYAML_handler_error {
78         CYAML_ERROR_NONE = 0,
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,
84 };
85
86 enum cYAML_tree_state {
87         TREE_STATE_COMPLETE = 0,
88         TREE_STATE_INITED,
89         TREE_STATE_TREE_STARTED,
90         TREE_STATE_BLK_STARTED,
91         TREE_STATE_KEY,
92         TREE_STATE_KEY_FILLED,
93         TREE_STATE_VALUE,
94         TREE_STATE_SEQ_START,
95 };
96
97 struct cYAML_tree_node {
98         struct cYAML *root;
99         /* cur is the current node we're operating on */
100         struct cYAML *cur;
101         enum cYAML_tree_state state;
102         int from_blk_map_start;
103         /* represents the tree depth */
104         struct list_head ll;
105 };
106
107 typedef enum cYAML_handler_error (*yaml_token_handler)(yaml_token_t *token,
108                                                 struct cYAML_tree_node *);
109
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);
136
137 /* dispatch table */
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,
161 };
162
163 /* dispatch table */
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",
187 };
188
189 static char *state_string[] = {
190         [TREE_STATE_COMPLETE] = "COMPLETE",
191         [TREE_STATE_INITED] = "INITED",
192         [TREE_STATE_TREE_STARTED] = "TREE_STARTED",
193         [TREE_STATE_BLK_STARTED] = "BLK_STARTED",
194         [TREE_STATE_KEY] = "KEY",
195         [TREE_STATE_KEY_FILLED] = "KEY_FILLED",
196         [TREE_STATE_VALUE] = "VALUE",
197         [TREE_STATE_SEQ_START] = "SEQ_START",
198 };
199
200 static void cYAML_ll_free(struct list_head *ll)
201 {
202         struct cYAML_ll *node, *tmp;
203
204         list_for_each_entry_safe(node, tmp, ll, list) {
205                 free(node->print_info);
206                 free(node);
207         }
208 }
209
210 static int cYAML_ll_push(struct cYAML *obj,
211                          const struct cYAML_print_info *print_info,
212                          struct list_head *list)
213 {
214         struct cYAML_ll *node = calloc(1, sizeof(*node));
215         if (node == NULL)
216                 return -1;
217
218         INIT_LIST_HEAD(&node->list);
219
220         if (print_info) {
221                 node->print_info = calloc(1, sizeof(*print_info));
222                 if (node->print_info == NULL) {
223                         free(node);
224                         return -1;
225                 }
226                 *node->print_info = *print_info;
227         }
228         node->obj = obj;
229
230         list_add(&node->list, list);
231
232         return 0;
233 }
234
235 static struct cYAML *cYAML_ll_pop(struct list_head *list,
236                                   struct cYAML_print_info **print_info)
237 {
238         struct cYAML_ll *pop;
239         struct cYAML *obj = NULL;
240
241         if (!list_empty(list)) {
242                 pop = list_entry(list->next, struct cYAML_ll, list);
243
244                 obj = pop->obj;
245                 if (print_info != NULL)
246                         *print_info = pop->print_info;
247                 list_del(&pop->list);
248
249                 if (print_info == NULL)
250                         free(pop->print_info);
251
252                 free(pop);
253         }
254         return obj;
255 }
256
257 static int cYAML_ll_count(struct list_head *ll)
258 {
259         int i = 0;
260         struct list_head *node;
261
262         list_for_each(node, ll)
263                 i++;
264
265         return i;
266 }
267
268 static int cYAML_tree_init(struct cYAML_tree_node *tree)
269 {
270         struct cYAML *obj = NULL, *cur = NULL;
271
272         if (tree == NULL)
273                 return -1;
274
275         obj = calloc(1, sizeof(*obj));
276         if (obj == NULL)
277                 return -1;
278
279         if (tree->root) {
280                 /* append the node */
281                 cur = tree->root;
282                 while (cur->cy_next != NULL)
283                         cur = cur->cy_next;
284                 cur->cy_next = obj;
285         } else {
286                 tree->root = obj;
287         }
288
289         obj->cy_type = CYAML_TYPE_OBJECT;
290
291         tree->cur = obj;
292         tree->state = TREE_STATE_COMPLETE;
293
294         /* free it and start anew */
295         if (!list_empty(&tree->ll))
296                 cYAML_ll_free(&tree->ll);
297
298         return 0;
299 }
300
301 static struct cYAML *create_child(struct cYAML *parent)
302 {
303         struct cYAML *obj;
304
305         if (parent == NULL)
306                 return NULL;
307
308         obj = calloc(1, sizeof(*obj));
309         if (obj == NULL)
310                 return NULL;
311
312         /* set the type to OBJECT and let the value change that */
313         obj->cy_type = CYAML_TYPE_OBJECT;
314
315         parent->cy_child = obj;
316
317         return obj;
318 }
319
320 static struct cYAML *create_sibling(struct cYAML *sibling)
321 {
322         struct cYAML *obj;
323
324         if (sibling == NULL)
325                 return NULL;
326
327         obj = calloc(1, sizeof(*obj));
328         if (obj == NULL)
329                 return NULL;
330
331         /* set the type to OBJECT and let the value change that */
332         obj->cy_type = CYAML_TYPE_OBJECT;
333
334         sibling->cy_next = obj;
335         obj->cy_prev = sibling;
336
337         return obj;
338 }
339
340 /* Parse the input text to generate a number,
341  * and populate the result into item. */
342 static bool parse_number(struct cYAML *item, const char *input)
343 {
344         double n = 0, sign = 1, scale = 0;
345         int subscale = 0, signsubscale = 1;
346         const char *num = input;
347
348         if (*num == '-') {
349                 sign = -1;
350                 num++;
351         }
352
353         if (*num == '0')
354                 num++;
355
356         if (*num >= '1' && *num <= '9') {
357                 do {
358                         n = (n * 10.0) + (*num++ - '0');
359                 } while (*num >= '0' && *num <= '9');
360         }
361
362         if (*num == '.' && num[1] >= '0' && num[1] <= '9') {
363                 num++;
364                 do {
365                         n = (n * 10.0) + (*num++ - '0');
366                         scale--;
367                 } while (*num >= '0' && *num <= '9');
368         }
369
370         if (*num == 'e' || *num == 'E') {
371                 num++;
372                 if (*num == '+') {
373                         num++;
374                 } else if (*num == '-') {
375                         signsubscale = -1;
376                         num++;
377                 }
378                 while (*num >= '0' && *num <= '9')
379                         subscale = (subscale * 10) + (*num++ - '0');
380         }
381
382         /* check to see if the entire string is consumed.  If not then
383          * that means this is a string with a number in it */
384         if (num != (input + strlen(input)))
385                 return false;
386
387         /* number = +/- number.fraction * 10^+/- exponent */
388         n = sign * n * pow(10.0, (scale + subscale * signsubscale));
389
390         item->cy_valuedouble = n;
391         item->cy_valueint = (int)n;
392         item->cy_type = CYAML_TYPE_NUMBER;
393
394         return true;
395 }
396
397 static int assign_type_value(struct cYAML *obj, const char *value)
398 {
399         if (value == NULL)
400                 return -1;
401
402         if (strcmp(value, "null") == 0)
403                 obj->cy_type = CYAML_TYPE_NULL;
404         else if (strcmp(value, "false") == 0) {
405                 obj->cy_type = CYAML_TYPE_FALSE;
406                 obj->cy_valueint = 0;
407         } else if (strcmp(value, "true") == 0) {
408                 obj->cy_type = CYAML_TYPE_TRUE;
409                 obj->cy_valueint = 1;
410         } else if (*value == '-' || (*value >= '0' && *value <= '9')) {
411                 if (parse_number(obj, value) == 0) {
412                         obj->cy_valuestring = strdup(value);
413                         obj->cy_type = CYAML_TYPE_STRING;
414                 }
415         } else {
416                 obj->cy_valuestring = strdup(value);
417                 obj->cy_type = CYAML_TYPE_STRING;
418         }
419
420         return 0;
421 }
422
423 /*
424  * yaml_handle_token
425  *  Builds the YAML tree rpresentation as the tokens are passed in
426  *
427  *  if token == STREAM_START && tree_state != COMPLETE
428  *    something wrong. fail.
429  *  else tree_state = INITIED
430  *  if token == DOCUMENT_START && tree_state != COMPLETE || INITED
431  *    something wrong, fail.
432  *  else tree_state = TREE_STARTED
433  *  if token == DOCUMENT_END
434  *    tree_state = INITED if no STREAM START, else tree_state = COMPLETE
435  *    erase everything on ll
436  *  if token == STREAM_END && tree_state != INITED
437  *    something wrong fail.
438  *  else tree_state = COMPLETED
439  *  if token == YAML_KEY_TOKEN && state != TREE_STARTED
440  *    something wrong, fail.
441  *  if token == YAML_SCALAR_TOKEN && state != KEY || VALUE
442  *    fail.
443  *  else if tree_state == KEY
444  *     create a new sibling under the current head of the ll (if ll is
445  *     empty insert the new node there and it becomes the root.)
446  *    add the scalar value in the "string"
447  *    tree_state = KEY_FILLED
448  *  else if tree_state == VALUE
449  *    try and figure out whether this is a double, int or string and store
450  *    it appropriately
451  *    state = TREE_STARTED
452  * else if token == YAML_BLOCK_MAPPING_START_TOKEN && tree_state != VALUE
453  *   fail
454  * else push the current node on the ll && state = TREE_STARTED
455  * if token == YAML_BLOCK_END_TOKEN && state != TREE_STARTED
456  *   fail.
457  * else pop the current token off the ll and make it the cur
458  * if token == YAML_VALUE_TOKEN && state != KEY_FILLED
459  *   fail.
460  * else state = VALUE
461  *
462  */
463 static enum cYAML_handler_error yaml_parse_error(yaml_token_t *token,
464                                                  struct cYAML_tree_node *tree)
465 {
466         return CYAML_ERROR_PARSE;
467 }
468
469 static enum cYAML_handler_error yaml_stream_start(yaml_token_t *token,
470                                                   struct cYAML_tree_node *tree)
471 {
472         enum cYAML_handler_error rc;
473
474         /* with each new stream initialize a new tree */
475         rc = cYAML_tree_init(tree);
476
477         if (rc != CYAML_ERROR_NONE)
478                 return rc;
479
480         tree->state = TREE_STATE_INITED;
481
482         return CYAML_ERROR_NONE;
483 }
484
485 static enum cYAML_handler_error yaml_stream_end(yaml_token_t *token,
486                                                 struct cYAML_tree_node *tree)
487 {
488         if (tree->state != TREE_STATE_TREE_STARTED &&
489             tree->state != TREE_STATE_COMPLETE &&
490             tree->state != TREE_STATE_INITED)
491                 return CYAML_ERROR_UNEXPECTED_STATE;
492
493         tree->state = TREE_STATE_INITED;
494
495         return CYAML_ERROR_NONE;
496 }
497
498 static enum cYAML_handler_error
499 yaml_document_start(yaml_token_t *token, struct cYAML_tree_node *tree)
500 {
501         if (tree->state != TREE_STATE_INITED)
502                 return CYAML_ERROR_UNEXPECTED_STATE;
503
504         /* go to started state since we're expecting more tokens to come */
505         tree->state = TREE_STATE_TREE_STARTED;
506
507         return CYAML_ERROR_NONE;
508 }
509
510 static enum cYAML_handler_error yaml_document_end(yaml_token_t *token,
511                                                   struct cYAML_tree_node *tree)
512 {
513         if (tree->state != TREE_STATE_COMPLETE)
514                 return CYAML_ERROR_UNEXPECTED_STATE;
515
516         tree->state = TREE_STATE_TREE_STARTED;
517
518         return CYAML_ERROR_NONE;
519 }
520
521 static enum cYAML_handler_error yaml_key(yaml_token_t *token,
522                                          struct cYAML_tree_node *tree)
523 {
524         if (tree->state != TREE_STATE_BLK_STARTED &&
525             tree->state != TREE_STATE_VALUE)
526                 return CYAML_ERROR_UNEXPECTED_STATE;
527
528         if (tree->from_blk_map_start == 0 ||
529             tree->state == TREE_STATE_VALUE)
530                 tree->cur = create_sibling(tree->cur);
531
532         tree->from_blk_map_start = 0;
533
534         tree->state = TREE_STATE_KEY;
535
536         return CYAML_ERROR_NONE;
537 }
538
539 static enum cYAML_handler_error yaml_scalar(yaml_token_t *token,
540                                             struct cYAML_tree_node *tree)
541 {
542         if (tree->state == TREE_STATE_KEY) {
543                 /* assign the scalar value to the key that was created */
544                 tree->cur->cy_string =
545                   strdup((const char *)token->data.scalar.value);
546
547                 tree->state = TREE_STATE_KEY_FILLED;
548         } else if (tree->state == TREE_STATE_VALUE) {
549                 if (assign_type_value(tree->cur,
550                                       (char *)token->data.scalar.value))
551                         /* failed to assign a value */
552                         return CYAML_ERROR_BAD_VALUE;
553                 tree->state = TREE_STATE_BLK_STARTED;
554         } else {
555                 return CYAML_ERROR_UNEXPECTED_STATE;
556         }
557
558         return CYAML_ERROR_NONE;
559 }
560
561 static enum cYAML_handler_error yaml_value(yaml_token_t *token,
562                                            struct cYAML_tree_node *tree)
563 {
564         if (tree->state != TREE_STATE_KEY_FILLED)
565                 return CYAML_ERROR_UNEXPECTED_STATE;
566
567         tree->state = TREE_STATE_VALUE;
568
569         return CYAML_ERROR_NONE;
570 }
571
572 static enum cYAML_handler_error yaml_blk_seq_start(yaml_token_t *token,
573                                                    struct cYAML_tree_node *tree)
574 {
575         if (tree->state != TREE_STATE_VALUE)
576                 return CYAML_ERROR_UNEXPECTED_STATE;
577
578         /* Since a sequenc start event determines that this is the start
579          * of an array, then that means the current node we're at is an
580          * array and we need to flag it as such */
581         tree->cur->cy_type = CYAML_TYPE_ARRAY;
582         tree->state = TREE_STATE_SEQ_START;
583
584         return CYAML_ERROR_NONE;
585 }
586
587 static enum cYAML_handler_error yaml_entry_token(yaml_token_t *token,
588                                                  struct cYAML_tree_node *tree)
589 {
590         struct cYAML *obj;
591
592         if (tree->state != TREE_STATE_SEQ_START &&
593             tree->state != TREE_STATE_BLK_STARTED)
594                 return CYAML_ERROR_UNEXPECTED_STATE;
595
596         if (tree->state == TREE_STATE_SEQ_START) {
597                 obj = create_child(tree->cur);
598
599                 if (cYAML_ll_push(tree->cur, NULL, &tree->ll))
600                         return CYAML_ERROR_OUT_OF_MEM;
601
602                 tree->cur = obj;
603         } else {
604                 tree->cur = create_sibling(tree->cur);
605                 tree->state = TREE_STATE_SEQ_START;
606         }
607
608         return CYAML_ERROR_NONE;
609 }
610
611 static enum cYAML_handler_error
612 yaml_blk_mapping_start(yaml_token_t *token,
613                        struct cYAML_tree_node *tree)
614 {
615         struct cYAML *obj;
616
617         if (tree->state != TREE_STATE_VALUE &&
618             tree->state != TREE_STATE_INITED &&
619             tree->state != TREE_STATE_SEQ_START &&
620             tree->state != TREE_STATE_TREE_STARTED)
621                 return CYAML_ERROR_UNEXPECTED_STATE;
622
623         /* block_mapping_start means we're entering another block
624          * indentation, so we need to go one level deeper
625          * create a child of cur */
626         obj = create_child(tree->cur);
627
628         /* push cur on the stack */
629         if (cYAML_ll_push(tree->cur, NULL, &tree->ll))
630                 return CYAML_ERROR_OUT_OF_MEM;
631
632         /* adding the new child to cur */
633         tree->cur = obj;
634
635         tree->state = TREE_STATE_BLK_STARTED;
636
637         tree->from_blk_map_start = 1;
638
639         return CYAML_ERROR_NONE;
640 }
641
642 static enum cYAML_handler_error yaml_block_end(yaml_token_t *token,
643                                                struct cYAML_tree_node *tree)
644 {
645         if (tree->state != TREE_STATE_BLK_STARTED &&
646             tree->state != TREE_STATE_VALUE)
647                 return CYAML_ERROR_UNEXPECTED_STATE;
648
649         tree->cur = cYAML_ll_pop(&tree->ll, NULL);
650
651         /* if you have popped all the way to the top level, then move to
652          * the complete state. */
653         if (cYAML_ll_count(&tree->ll) == 0)
654                 tree->state = TREE_STATE_COMPLETE;
655         else if (tree->state == TREE_STATE_VALUE)
656                 tree->state = TREE_STATE_BLK_STARTED;
657
658         return CYAML_ERROR_NONE;
659 }
660
661 static enum cYAML_handler_error yaml_not_supported(yaml_token_t *token,
662                                                    struct cYAML_tree_node *tree)
663 {
664         return CYAML_ERROR_NOT_SUPPORTED;
665 }
666
667 static bool clean_usr_data(struct cYAML *node, void *usr_data, void **out)
668 {
669         cYAML_user_data_free_cb free_cb = usr_data;
670
671         if (free_cb && node && node->cy_user_data) {
672                 free_cb(node->cy_user_data);
673                 node->cy_user_data = NULL;
674         }
675
676         return true;
677 }
678
679 static bool free_node(struct cYAML *node, void *user_data, void **out)
680 {
681         if (node)
682                 free(node);
683
684         return true;
685 }
686
687 static bool find_obj_iter(struct cYAML *node, void *usr_data, void **out)
688 {
689         char *name = usr_data;
690
691         if (node != NULL && node->cy_string != NULL &&
692             strcmp(node->cy_string, name) == 0) {
693                 *out = node;
694                 return false;
695         }
696
697         return true;
698 }
699
700 struct cYAML *cYAML_get_object_item(struct cYAML *parent, const char *name)
701 {
702         struct cYAML *node = parent, *found = NULL;
703
704         if (!node || !name)
705                 return NULL;
706
707         if (node->cy_string) {
708                 if (strcmp(node->cy_string, name) == 0)
709                         return node;
710         }
711
712         if (node->cy_child)
713                 found = cYAML_get_object_item(node->cy_child, name);
714
715         if (!found && node->cy_next)
716                 found = cYAML_get_object_item(node->cy_next, name);
717
718         return found;
719 }
720
721 struct cYAML *cYAML_get_next_seq_item(struct cYAML *seq, struct cYAML **itm)
722 {
723         if (*itm != NULL && (*itm)->cy_next != NULL) {
724                 *itm = (*itm)->cy_next;
725                 return *itm;
726         }
727
728         if (*itm == NULL && seq->cy_type == CYAML_TYPE_ARRAY) {
729                 *itm = seq->cy_child;
730                 return *itm;
731         }
732
733         return NULL;
734 }
735
736 bool cYAML_is_sequence(struct cYAML *node)
737 {
738         return (node != NULL ? node->cy_type == CYAML_TYPE_ARRAY : 0);
739 }
740
741 void cYAML_tree_recursive_walk(struct cYAML *node, cYAML_walk_cb cb,
742                                       bool cb_first,
743                                       void *usr_data,
744                                       void **out)
745 {
746         if (node == NULL)
747                 return;
748
749         if (cb_first) {
750                 if (!cb(node, usr_data, out))
751                         return;
752         }
753
754         if (node->cy_child)
755                 cYAML_tree_recursive_walk(node->cy_child, cb,
756                                           cb_first, usr_data, out);
757
758         if (node->cy_next)
759                 cYAML_tree_recursive_walk(node->cy_next, cb,
760                                           cb_first, usr_data, out);
761
762         if (!cb_first) {
763                 if (!cb(node, usr_data, out))
764                         return;
765         }
766 }
767
768 struct cYAML *cYAML_find_object(struct cYAML *root, const char *name)
769 {
770         struct cYAML *found = NULL;
771
772         cYAML_tree_recursive_walk(root, find_obj_iter, true,
773                                   (void *)name, (void **)&found);
774
775         return found;
776 }
777
778 void cYAML_clean_usr_data(struct cYAML *node, cYAML_user_data_free_cb free_cb)
779 {
780         cYAML_tree_recursive_walk(node, clean_usr_data, false, free_cb, NULL);
781 }
782
783 void cYAML_free_tree(struct cYAML *node)
784 {
785         cYAML_tree_recursive_walk(node, free_node, false, NULL, NULL);
786 }
787
788 static inline void print_simple(FILE *f, struct cYAML *node,
789                                 struct cYAML_print_info *cpi)
790 {
791         int level = cpi->level;
792         int ind = cpi->extra_ind;
793
794         if (cpi->array_first_elem)
795                 fprintf(f, "%*s- ", INDENT * level, "");
796
797         fprintf(f, "%*s""%s: %d\n", (cpi->array_first_elem) ? 0 :
798                 INDENT * level + ind, "", node->cy_string,
799                 node->cy_valueint);
800 }
801
802 static void print_string(FILE *f, struct cYAML *node,
803                          struct cYAML_print_info *cpi)
804 {
805         char *new_line;
806         int level = cpi->level;
807         int ind = cpi->extra_ind;
808
809         if (cpi->array_first_elem)
810                 fprintf(f, "%*s- ", INDENT * level, "");
811
812         new_line = strchr(node->cy_valuestring, '\n');
813         if (new_line == NULL)
814                 fprintf(f, "%*s""%s: %s\n", (cpi->array_first_elem) ?
815                         0 : INDENT * level + ind, "",
816                         node->cy_string, node->cy_valuestring);
817         else {
818                 int indent = 0;
819                 fprintf(f, "%*s""%s: ", (cpi->array_first_elem) ?
820                         0 : INDENT * level + ind, "",
821                         node->cy_string);
822                 char *l = node->cy_valuestring;
823                 while (new_line) {
824                         *new_line = '\0';
825                         fprintf(f, "%*s""%s\n", indent, "", l);
826                         indent = INDENT * level + ind +
827                                   strlen(node->cy_string) + 2;
828                         *new_line = '\n';
829                         l = new_line+1;
830                         new_line = strchr(l, '\n');
831                 }
832                 fprintf(f, "%*s""%s\n", indent, "", l);
833         }
834 }
835
836 static void print_number(FILE *f, struct cYAML *node,
837                          struct cYAML_print_info *cpi)
838 {
839         double d = node->cy_valuedouble;
840         int level = cpi->level;
841         int ind = cpi->extra_ind;
842
843         if (cpi->array_first_elem)
844                 fprintf(f, "%*s- ", INDENT * level, "");
845
846         if ((fabs(((double)node->cy_valueint) - d) <= DBL_EPSILON) &&
847             (d <= INT_MAX) && (d >= INT_MIN))
848                 fprintf(f, "%*s""%s: %d\n", (cpi->array_first_elem) ? 0 :
849                         INDENT * level + ind, "",
850                         node->cy_string, node->cy_valueint);
851         else {
852                 if ((fabs(floor(d) - d) <= DBL_EPSILON) &&
853                     (fabs(d) < 1.0e60))
854                         fprintf(f, "%*s""%s: %.0f\n",
855                                 (cpi->array_first_elem) ? 0 :
856                                 INDENT * level + ind, "",
857                                 node->cy_string, d);
858                 else if ((fabs(d) < 1.0e-6) || (fabs(d) > 1.0e9))
859                         fprintf(f, "%*s""%s: %e\n",
860                                 (cpi->array_first_elem) ? 0 :
861                                 INDENT * level + ind, "",
862                                 node->cy_string, d);
863                 else
864                         fprintf(f, "%*s""%s: %f\n",
865                                 (cpi->array_first_elem) ? 0 :
866                                 INDENT * level + ind, "",
867                                 node->cy_string, d);
868         }
869 }
870
871 static void print_object(FILE *f, struct cYAML *node,
872                          struct list_head *stack,
873                          struct cYAML_print_info *cpi)
874 {
875         struct cYAML_print_info print_info;
876         struct cYAML *child = node->cy_child;
877
878         if (node->cy_string != NULL)
879                 fprintf(f, "%*s""%s%s:\n", (cpi->array_first_elem) ?
880                         INDENT * cpi->level :
881                         INDENT * cpi->level + cpi->extra_ind,
882                         "", (cpi->array_first_elem) ? "- " : "",
883                         node->cy_string);
884
885         print_info.level = (node->cy_string != NULL) ? cpi->level + 1 :
886           cpi->level;
887         print_info.array_first_elem = (node->cy_string == NULL) ?
888           cpi->array_first_elem : 0;
889         print_info.extra_ind = (cpi->array_first_elem) ? EXTRA_IND :
890           cpi->extra_ind;
891
892         while (child) {
893                 if (cYAML_ll_push(child, &print_info, stack) != 0)
894                         return;
895                 print_value(f, stack);
896                 print_info.array_first_elem = 0;
897                 child = child->cy_next;
898         }
899 }
900
901 static void print_array(FILE *f, struct cYAML *node,
902                         struct list_head *stack,
903                         struct cYAML_print_info *cpi)
904 {
905         struct cYAML_print_info print_info;
906         struct cYAML *child = node->cy_child;
907
908         if (node->cy_string != NULL) {
909                 fprintf(f, "%*s""%s:\n", INDENT * cpi->level + cpi->extra_ind,
910                         "", node->cy_string);
911         }
912
913         print_info.level = (node->cy_string != NULL) ? cpi->level + 1 :
914           cpi->level;
915         print_info.array_first_elem =  1;
916         print_info.extra_ind = EXTRA_IND;
917
918         while (child) {
919                 if (cYAML_ll_push(child, &print_info, stack) != 0)
920                         return;
921                 print_value(f, stack);
922                 child = child->cy_next;
923         }
924 }
925
926 static void print_value(FILE *f, struct list_head *stack)
927 {
928         struct cYAML_print_info *cpi = NULL;
929         struct cYAML *node = cYAML_ll_pop(stack, &cpi);
930
931         if (node == NULL)
932                 return;
933
934         switch (node->cy_type) {
935         case CYAML_TYPE_FALSE:
936         case CYAML_TYPE_TRUE:
937         case CYAML_TYPE_NULL:
938                 print_simple(f, node, cpi);
939                 break;
940         case CYAML_TYPE_STRING:
941                 print_string(f, node, cpi);
942                 break;
943         case CYAML_TYPE_NUMBER:
944                 print_number(f, node, cpi);
945                 break;
946         case CYAML_TYPE_ARRAY:
947                 print_array(f, node, stack, cpi);
948                 break;
949         case CYAML_TYPE_OBJECT:
950                 print_object(f, node, stack, cpi);
951                 break;
952         default:
953         break;
954         }
955
956         if (cpi != NULL)
957                 free(cpi);
958 }
959
960 void cYAML_print_tree(struct cYAML *node)
961 {
962         struct cYAML_print_info print_info;
963         struct list_head list;
964
965         INIT_LIST_HEAD(&list);
966
967         if (node == NULL)
968                 return;
969
970         memset(&print_info, 0, sizeof(struct cYAML_print_info));
971
972         if (cYAML_ll_push(node, &print_info, &list) == 0)
973                 print_value(stdout, &list);
974 }
975
976 void cYAML_print_tree2file(FILE *f, struct cYAML *node)
977 {
978         struct cYAML_print_info print_info;
979         struct list_head list;
980
981         INIT_LIST_HEAD(&list);
982
983         if (node == NULL)
984                 return;
985
986         memset(&print_info, 0, sizeof(struct cYAML_print_info));
987
988         if (cYAML_ll_push(node, &print_info, &list) == 0)
989                 print_value(f, &list);
990 }
991
992 static struct cYAML *insert_item(struct cYAML *parent, char *key,
993                                  enum cYAML_object_type type)
994 {
995         struct cYAML *node = calloc(1, sizeof(*node));
996
997         if (node == NULL)
998                 return NULL;
999
1000         if (key != NULL)
1001                 node->cy_string = strdup(key);
1002
1003         node->cy_type = type;
1004
1005         cYAML_insert_child(parent, node);
1006
1007         return node;
1008 }
1009
1010 struct cYAML *cYAML_create_seq(struct cYAML *parent, char *key)
1011 {
1012         return insert_item(parent, key, CYAML_TYPE_ARRAY);
1013 }
1014
1015 struct cYAML *cYAML_create_seq_item(struct cYAML *seq)
1016 {
1017         return insert_item(seq, NULL, CYAML_TYPE_OBJECT);
1018 }
1019
1020 struct cYAML *cYAML_create_object(struct cYAML *parent, char *key)
1021 {
1022         return insert_item(parent, key, CYAML_TYPE_OBJECT);
1023 }
1024
1025 struct cYAML *cYAML_create_string(struct cYAML *parent, char *key, char *value)
1026 {
1027         struct cYAML *node = calloc(1, sizeof(*node));
1028         if (node == NULL)
1029                 return NULL;
1030
1031         node->cy_string = strdup(key);
1032         node->cy_valuestring = strdup(value);
1033         node->cy_type = CYAML_TYPE_STRING;
1034
1035         cYAML_insert_child(parent, node);
1036
1037         return node;
1038 }
1039
1040 struct cYAML *cYAML_create_number(struct cYAML *parent, char *key, double value)
1041 {
1042         struct cYAML *node = calloc(1, sizeof(*node));
1043         if (node == NULL)
1044                 return NULL;
1045
1046         node->cy_string = strdup(key);
1047         node->cy_valuedouble = value;
1048         node->cy_valueint = (int)value;
1049         node->cy_type = CYAML_TYPE_NUMBER;
1050
1051         cYAML_insert_child(parent, node);
1052
1053         return node;
1054 }
1055
1056 void cYAML_insert_child(struct cYAML *parent, struct cYAML *node)
1057 {
1058         struct cYAML *cur;
1059
1060         if (parent && node) {
1061                 if (parent->cy_child == NULL) {
1062                         parent->cy_child = node;
1063                         return;
1064                 }
1065
1066                 cur = parent->cy_child;
1067
1068                 while (cur->cy_next)
1069                         cur = cur->cy_next;
1070
1071                 cur->cy_next = node;
1072                 node->cy_prev = cur;
1073         }
1074 }
1075
1076 void cYAML_insert_sibling(struct cYAML *root, struct cYAML *sibling)
1077 {
1078         struct cYAML *last = NULL;
1079         if (root == NULL || sibling == NULL)
1080                 return;
1081
1082         last = root;
1083         while (last->cy_next != NULL)
1084                 last = last->cy_next;
1085
1086         last->cy_next = sibling;
1087 }
1088
1089 void cYAML_build_error(int rc, int seq_no, char *cmd,
1090                        char *entity, char *err_str,
1091                        struct cYAML **root)
1092 {
1093         struct cYAML *r = NULL, *err, *s, *itm, *cmd_obj;
1094         if (root == NULL)
1095                 return;
1096
1097         /* add to the tail of the root that's passed in */
1098         if ((*root) == NULL) {
1099                 *root = cYAML_create_object(NULL, NULL);
1100                 if ((*root) == NULL)
1101                         goto failed;
1102         }
1103
1104         r = *root;
1105
1106         /* look for the command */
1107         cmd_obj = cYAML_get_object_item(r, (const char *)cmd);
1108         if (cmd_obj != NULL && cmd_obj->cy_type == CYAML_TYPE_ARRAY)
1109                 itm = cYAML_create_seq_item(cmd_obj);
1110         else if (cmd_obj == NULL) {
1111                 s = cYAML_create_seq(r, cmd);
1112                 itm = cYAML_create_seq_item(s);
1113         } else if (cmd_obj != NULL && cmd_obj->cy_type != CYAML_TYPE_ARRAY)
1114                 goto failed;
1115
1116         err = cYAML_create_object(itm, entity);
1117         if (err == NULL)
1118                 goto failed;
1119
1120         if (seq_no >= 0 &&
1121             cYAML_create_number(err, "seq_no", seq_no) == NULL)
1122                 goto failed;
1123
1124         if (cYAML_create_number(err, "errno", rc) == NULL)
1125                 goto failed;
1126
1127         if (cYAML_create_string(err, "descr", err_str) == NULL)
1128                 goto failed;
1129
1130         return;
1131
1132 failed:
1133         /* Only reason we get here is if we run out of memory */
1134         cYAML_free_tree(r);
1135         r = NULL;
1136         fprintf(stderr, "error:\n\tfatal: out of memory\n");
1137 }
1138
1139 struct cYAML *cYAML_build_tree(char *yaml_file,
1140                                const char *yaml_blk,
1141                                size_t yaml_blk_size,
1142                                struct cYAML **err_rc,
1143                                bool debug)
1144 {
1145         yaml_parser_t parser;
1146         yaml_token_t token;
1147         struct cYAML_tree_node tree;
1148         enum cYAML_handler_error rc;
1149         yaml_token_type_t token_type;
1150         char err_str[256];
1151         FILE *input = NULL;
1152         int done = 0;
1153
1154         memset(&tree, 0, sizeof(struct cYAML_tree_node));
1155
1156         INIT_LIST_HEAD(&tree.ll);
1157
1158         /* Create the Parser object. */
1159         yaml_parser_initialize(&parser);
1160
1161         /* file always takes precedence */
1162         if (yaml_file != NULL) {
1163                 /* Set a file input. */
1164                 input = fopen(yaml_file, "rb");
1165                 if (input == NULL) {
1166                         snprintf(err_str, sizeof(err_str),
1167                                 "Failed to open file: %s", yaml_file);
1168                         cYAML_build_error(-1, -1, "yaml", "builder",
1169                                           err_str,
1170                                           err_rc);
1171                         return NULL;
1172                 }
1173
1174                 yaml_parser_set_input_file(&parser, input);
1175         } else if (yaml_blk != NULL) {
1176                 yaml_parser_set_input_string(&parser,
1177                                              (const unsigned char *) yaml_blk,
1178                                              yaml_blk_size);
1179         } else
1180                 /* assume that we're getting our input froms stdin */
1181                 yaml_parser_set_input_file(&parser, stdin);
1182
1183         /* Read the event sequence. */
1184         while (!done) {
1185                 /*
1186                  * Go through the parser and build a cYAML representation
1187                  * of the passed in YAML text
1188                  */
1189                 yaml_parser_scan(&parser, &token);
1190
1191                 if (debug)
1192                         fprintf(stderr, "tree.state(%p:%d) = %s, token.type ="
1193                                         " %s: %s\n",
1194                                 &tree, tree.state, state_string[tree.state],
1195                                 token_type_string[token.type],
1196                                 (token.type == YAML_SCALAR_TOKEN) ?
1197                                 (char*)token.data.scalar.value : "");
1198                 rc = dispatch_tbl[token.type](&token, &tree);
1199                 if (rc != CYAML_ERROR_NONE) {
1200                         snprintf(err_str, sizeof(err_str),
1201                                 "Failed to handle token:%d "
1202                                 "[state=%d, rc=%d]",
1203                                 token.type, tree.state, rc);
1204                         cYAML_build_error(-1, -1, "yaml", "builder",
1205                                           err_str,
1206                                           err_rc);
1207                 }
1208                 /* Are we finished? */
1209                 done = (rc != CYAML_ERROR_NONE ||
1210                         token.type == YAML_STREAM_END_TOKEN ||
1211                         token.type == YAML_NO_TOKEN);
1212
1213                 token_type = token.type;
1214
1215                 yaml_token_delete(&token);
1216         }
1217
1218         /* Destroy the Parser object. */
1219         yaml_parser_delete(&parser);
1220
1221         if (input != NULL)
1222                 fclose(input);
1223
1224         if (token_type == YAML_STREAM_END_TOKEN &&
1225             rc == CYAML_ERROR_NONE)
1226                 return tree.root;
1227
1228         cYAML_free_tree(tree.root);
1229
1230         return NULL;
1231 }