1 /*
2  * Copyright 2011 Tresys Technology, LLC. All rights reserved.
3  *
4  * Redistribution and use in source and binary forms, with or without
5  * modification, are permitted provided that the following conditions are met:
6  *
7  *    1. Redistributions of source code must retain the above copyright notice,
8  *       this list of conditions and the following disclaimer.
9  *
10  *    2. Redistributions in binary form must reproduce the above copyright notice,
11  *       this list of conditions and the following disclaimer in the documentation
12  *       and/or other materials provided with the distribution.
13  *
14  * THIS SOFTWARE IS PROVIDED BY TRESYS TECHNOLOGY, LLC ``AS IS'' AND ANY EXPRESS
15  * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
16  * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
17  * EVENT SHALL TRESYS TECHNOLOGY, LLC OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
18  * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
19  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
20  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
21  * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
22  * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
23  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
24  *
25  * The views and conclusions contained in the software and documentation are those
26  * of the authors and should not be interpreted as representing official policies,
27  * either expressed or implied, of Tresys Technology, LLC.
28  */
29 
30 #ifndef CIL_TREE_H_
31 #define CIL_TREE_H_
32 
33 #include <stdint.h>
34 
35 #include "cil_flavor.h"
36 #include "cil_list.h"
37 
38 struct cil_tree {
39 	struct cil_tree_node *root;
40 };
41 
42 struct cil_tree_node {
43 	struct cil_tree_node *parent;
44 	struct cil_tree_node *cl_head;		//Head of child_list
45 	struct cil_tree_node *cl_tail;		//Tail of child_list
46 	struct cil_tree_node *next;		//Each element in the list points to the next element
47 	enum cil_flavor flavor;
48 	uint32_t line;
49 	char *path;
50 	void *data;
51 };
52 
53 int cil_tree_init(struct cil_tree **tree);
54 void cil_tree_destroy(struct cil_tree **tree);
55 void cil_tree_subtree_destroy(struct cil_tree_node *node);
56 void cil_tree_children_destroy(struct cil_tree_node *node);
57 
58 void cil_tree_node_init(struct cil_tree_node **node);
59 void cil_tree_node_destroy(struct cil_tree_node **node);
60 
61 void cil_tree_print(struct cil_tree_node *tree, uint32_t depth);
62 
63 //finished values
64 #define CIL_TREE_SKIP_NOTHING	0
65 #define CIL_TREE_SKIP_NEXT	1
66 #define CIL_TREE_SKIP_HEAD	2
67 #define CIL_TREE_SKIP_ALL	(CIL_TREE_SKIP_NOTHING | CIL_TREE_SKIP_NEXT | CIL_TREE_SKIP_HEAD)
68 int cil_tree_walk(struct cil_tree_node *start_node, int (*process_node)(struct cil_tree_node *node, uint32_t *finished, void *extra_args), int (*first_child)(struct cil_tree_node *node, void *extra_args), int (*last_child)(struct cil_tree_node *node, void *extra_args), void *extra_args);
69 
70 #endif /* CIL_TREE_H_ */
71 
72