| /external/selinux/libsepol/cil/src/ |
| D | cil_build_ast.h | 40 int cil_gen_node(struct cil_db *db, struct cil_tree_node *ast_node, struct cil_symtab_datum *datum,…
41 int cil_parse_to_list(struct cil_tree_node *parse_cl_head, struct cil_list *ast_cl, enum cil_flavor…
43 int cil_gen_block(struct cil_db *db, struct cil_tree_node *parse_current, struct cil_tree_node *ast…
45 int cil_gen_blockinherit(struct cil_db *db, struct cil_tree_node *parse_current, struct cil_tree_no…
47 …nt cil_gen_blockabstract(struct cil_db *db, struct cil_tree_node *parse_current, struct cil_tree_n…
49 int cil_gen_in(struct cil_db *db, struct cil_tree_node *parse_current, struct cil_tree_node *ast_no…
51 int cil_gen_class(struct cil_db *db, struct cil_tree_node *parse_current, struct cil_tree_node *ast…
53 int cil_gen_classorder(struct cil_db *db, struct cil_tree_node *parse_current, struct cil_tree_node…
55 int cil_gen_perm(struct cil_db *db, struct cil_tree_node *parse_current, struct cil_tree_node *ast_…
57 int cil_gen_perm_nodes(struct cil_db *db, struct cil_tree_node *current_perm, struct cil_tree_node …
[all …]
|
| D | cil_resolve_ast.h | 38 int cil_resolve_classorder(struct cil_tree_node *current, void *extra_args);
39 int cil_resolve_classperms(struct cil_tree_node *current, struct cil_classperms *cp, void *extra_ar…
40 int cil_resolve_classpermissionset(struct cil_tree_node *current, struct cil_classpermissionset *cp…
41 int cil_resolve_classperms_list(struct cil_tree_node *current, struct cil_list *cp_list, void *extr…
42 int cil_resolve_avrule(struct cil_tree_node *current, void *extra_args);
43 int cil_resolve_type_rule(struct cil_tree_node *current, void *extra_args);
44 int cil_resolve_typeattributeset(struct cil_tree_node *current, void *extra_args);
45 int cil_resolve_typealias(struct cil_tree_node *current, void *extra_args);
46 int cil_resolve_typebounds(struct cil_tree_node *current, void *extra_args);
47 int cil_resolve_typepermissive(struct cil_tree_node *current, void *extra_args);
[all …]
|
| D | cil_tree.h | 39 struct cil_tree_node *root;
42 struct cil_tree_node { struct
43 struct cil_tree_node *parent; argument
44 struct cil_tree_node *cl_head; //Head of child_list argument
45 struct cil_tree_node *cl_tail; //Tail of child_list argument
46 struct cil_tree_node *next; //Each element in the list points to the next element argument
55 void cil_tree_subtree_destroy(struct cil_tree_node *node); argument
56 void cil_tree_children_destroy(struct cil_tree_node *node);
58 void cil_tree_node_init(struct cil_tree_node **node);
59 void cil_tree_node_destroy(struct cil_tree_node **node);
[all …]
|
| D | cil_verify.h | 60 int __cil_verify_syntax(struct cil_tree_node *parse_current, enum cil_syntax s[], int len);
61 int cil_verify_expr_syntax(struct cil_tree_node *current, enum cil_flavor op, enum cil_flavor expr_…
63 int cil_verify_constraint_expr_syntax(struct cil_tree_node *current, enum cil_flavor op);
66 int __cil_verify_ordered_node_helper(struct cil_tree_node *node, uint32_t *finished, void *extra_ar…
67 int __cil_verify_ordered(struct cil_tree_node *current, enum cil_flavor flavor);
70 int __cil_verify_helper(struct cil_tree_node *node, __attribute__((unused)) uint32_t *finished, voi…
71 int __cil_pre_verify_helper(struct cil_tree_node *node, __attribute__((unused)) uint32_t *finished,…
|
| D | cil_build_ast.c | 50 struct cil_tree_node *ast;
52 struct cil_tree_node *macro;
53 struct cil_tree_node *boolif;
54 struct cil_tree_node *tunif;
55 struct cil_tree_node *in;
58 int cil_fill_list(struct cil_tree_node *current, enum cil_flavor flavor, struct cil_list **list) in cil_fill_list()
61 struct cil_tree_node *curr; in cil_fill_list()
85 int cil_gen_node(__attribute__((unused)) struct cil_db *db, struct cil_tree_node *ast_node, struct … in cil_gen_node()
110 struct cil_tree_node *node = datum->nodes->head->data; in cil_gen_node()
143 void cil_clear_node(struct cil_tree_node *ast_node) in cil_clear_node()
[all …]
|
| D | cil_resolve_ast.c | 55 struct cil_tree_node *optstack;
56 struct cil_tree_node *boolif;
57 struct cil_tree_node *macro;
58 struct cil_tree_node *blockstack;
67 … cil_name * __cil_insert_name(struct cil_db *db, hashtab_key_t key, struct cil_tree_node *ast_node) in __cil_insert_name()
72 struct cil_tree_node *parent = ast_node->parent; in __cil_insert_name()
149 int cil_resolve_classperms(struct cil_tree_node *current, struct cil_classperms *cp, void *extra_ar… in cil_resolve_classperms()
180 int cil_resolve_classperms_set(struct cil_tree_node *current, struct cil_classperms_set *cp_set, vo… in cil_resolve_classperms_set()
205 int cil_resolve_classperms_list(struct cil_tree_node *current, struct cil_list *cp_list, void *extr… in cil_resolve_classperms_list()
230 int cil_resolve_classpermissionset(struct cil_tree_node *current, struct cil_classpermissionset *cp… in cil_resolve_classpermissionset()
[all …]
|
| D | cil_verify.c | 81 int __cil_verify_syntax(struct cil_tree_node *parse_current, enum cil_syntax s[], int len) in __cil_verify_syntax()
85 struct cil_tree_node *c = parse_current; in __cil_verify_syntax()
147 int cil_verify_expr_syntax(struct cil_tree_node *current, enum cil_flavor op, enum cil_flavor expr_… in cil_verify_expr_syntax()
269 int cil_verify_constraint_expr_syntax(struct cil_tree_node *current, enum cil_flavor op) in cil_verify_constraint_expr_syntax()
371 int __cil_verify_ordered_node_helper(struct cil_tree_node *node, __attribute__((unused)) uint32_t *… in __cil_verify_ordered_node_helper()
407 int __cil_verify_ordered(struct cil_tree_node *current, enum cil_flavor flavor) in __cil_verify_ordered()
432 struct cil_tree_node *node = sid->datum.nodes->head->data; in __cil_verify_initsids()
589 int __cil_verify_named_levelrange(struct cil_db *db, struct cil_tree_node *node) in __cil_verify_named_levelrange()
605 static int __cil_verify_user_pre_eval(struct cil_tree_node *node) in __cil_verify_user_pre_eval()
645 static int __cil_verify_user_post_eval(struct cil_db *db, struct cil_tree_node *node) in __cil_verify_user_post_eval()
[all …]
|
| D | cil_symtab.h | 46 #define NODE(n) ((struct cil_tree_node *)(DATUM(n)->nodes->head->data))
76 void cil_symtab_datum_remove_node(struct cil_symtab_datum *datum, struct cil_tree_node *node);
77 …t(symtab_t *symtab, hashtab_key_t key, struct cil_symtab_datum *datum, struct cil_tree_node *node);
|
| D | cil_find.c | 47 enum cil_flavor f1 = ((struct cil_tree_node*)d1->nodes->head->data)->flavor; in cil_type_match_any()
48 enum cil_flavor f2 = ((struct cil_tree_node*)d2->nodes->head->data)->flavor; in cil_type_match_any()
80 enum cil_flavor f1 = ((struct cil_tree_node*)d1->nodes->head->data)->flavor; in cil_type_matches()
81 enum cil_flavor f2 = ((struct cil_tree_node*)d2->nodes->head->data)->flavor; in cil_type_matches()
117 struct cil_tree_node *n1 = s1->nodes->head->data; in cil_self_match_any()
290 int cil_find_matching_avrule(struct cil_tree_node *node, struct cil_avrule *avrule, struct cil_avru… in cil_find_matching_avrule()
346 static int __cil_find_matching_avrule_in_ast(struct cil_tree_node *node, uint32_t *finished, void *… in __cil_find_matching_avrule_in_ast()
370 int cil_find_matching_avrule_in_ast(struct cil_tree_node *current, enum cil_flavor flavor, void *ta… in cil_find_matching_avrule_in_ast()
|
| D | cil_tree.c | 44 void cil_tree_print_perms_list(struct cil_tree_node *current_perm);
49 void cil_tree_print_expr_tree(struct cil_tree_node *expr_root);
51 void cil_tree_print_node(struct cil_tree_node *node);
84 void cil_tree_subtree_destroy(struct cil_tree_node *node) in cil_tree_subtree_destroy()
90 void cil_tree_children_destroy(struct cil_tree_node *node) in cil_tree_children_destroy()
92 struct cil_tree_node *start_node = node; in cil_tree_children_destroy()
93 struct cil_tree_node *next = NULL; in cil_tree_children_destroy()
122 void cil_tree_node_init(struct cil_tree_node **node) in cil_tree_node_init()
124 struct cil_tree_node *new_node = cil_malloc(sizeof(*new_node)); in cil_tree_node_init()
137 void cil_tree_node_destroy(struct cil_tree_node **node) in cil_tree_node_destroy()
[all …]
|
| D | cil_parser.c | 49 struct cil_tree_node *node = NULL; in cil_parser()
50 struct cil_tree_node *item = NULL; in cil_parser()
51 struct cil_tree_node *current = NULL; in cil_parser()
|
| D | cil_fqn.c | 42 struct cil_tree_node *node;
77 struct cil_tree_node *node = NODE(datum); in __cil_fqn_qualify_blocks()
130 int cil_fqn_qualify(struct cil_tree_node *root_node) in cil_fqn_qualify()
|
| D | cil_post.c | 68 struct cil_tree_node *n = d->nodes->head->data; in cil_verify_is_list()
327 static int __cil_post_db_count_helper(struct cil_tree_node *node, uint32_t *finished, void *extra_a… in __cil_post_db_count_helper()
429 static int __cil_post_db_array_helper(struct cil_tree_node *node, __attribute__((unused)) uint32_t … in __cil_post_db_array_helper()
626 struct cil_tree_node *node = datum->nodes->head->data; in __cil_type_to_bitmap()
678 struct cil_tree_node *node = datum->nodes->head->data; in __cil_user_to_bitmap()
726 struct cil_tree_node *node = datum->nodes->head->data; in __cil_role_to_bitmap()
884 struct cil_tree_node *node = datum->nodes->head->data; in __cil_cat_to_bitmap()
931 struct cil_tree_node *n1 = d1->nodes->head->data; in __cil_cat_expr_range_to_bitmap_helper()
932 struct cil_tree_node *n2 = d2->nodes->head->data; in __cil_cat_expr_range_to_bitmap_helper()
1189 static int __cil_post_db_attr_helper(struct cil_tree_node *node, __attribute__((unused)) uint32_t *… in __cil_post_db_attr_helper()
[all …]
|
| D | cil_reset_ast.h | 6 int cil_reset_ast(struct cil_tree_node *current);
|
| D | cil_fqn.h | 36 int cil_fqn_qualify(struct cil_tree_node *root_node);
|
| D | cil_find.h | 37 int cil_find_matching_avrule_in_ast(struct cil_tree_node *current, enum cil_flavor flavor, void *ta…
|
| D | cil_policy.h | 44 int cil_name_to_policy(FILE **, struct cil_tree_node *);
|
| D | cil_policy.c | 830 int __cil_booleanif_node_helper(struct cil_tree_node *node, __attribute__((unused)) uint32_t *finis… in __cil_booleanif_node_helper()
868 int __cil_booleanif_last_child_helper(struct cil_tree_node *node, void *extra_args) in __cil_booleanif_last_child_helper()
885 int cil_booleanif_to_policy(FILE **file_arr, uint32_t file_index, struct cil_tree_node *node) in cil_booleanif_to_policy()
891 struct cil_tree_node *true_node = NULL; in cil_booleanif_to_policy()
892 struct cil_tree_node *false_node = NULL; in cil_booleanif_to_policy()
947 int cil_name_to_policy(FILE **file_arr, struct cil_tree_node *current) in cil_name_to_policy()
1104 int __cil_gen_policy_node_helper(struct cil_tree_node *node, uint32_t *finished, void *extra_args) in __cil_gen_policy_node_helper()
1185 struct cil_tree_node *curr = db->ast->root; in cil_gen_policy()
1274 struct cil_tree_node *node = class->datum.nodes->head->data; in cil_gen_policy()
1283 struct cil_tree_node *curr_perm = node->cl_head; in cil_gen_policy()
|
| D | cil_symtab.c | 76 void cil_symtab_datum_remove_node(struct cil_symtab_datum *datum, struct cil_tree_node *node) in cil_symtab_datum_remove_node()
88 …rt(symtab_t *symtab, hashtab_key_t key, struct cil_symtab_datum *datum, struct cil_tree_node *node) in cil_symtab_insert()
|
| /external/selinux/libsepol/cil/test/unit/ |
| D | test_cil_build_ast.c | 40 int __cil_build_ast_node_helper(struct cil_tree_node *, uint32_t *, void *);
41 int __cil_build_ast_last_child_helper(__attribute__((unused)) struct cil_tree_node *parse_current, …
45 struct cil_tree_node *ast;
47 struct cil_tree_node *macro;
48 struct cil_tree_node *tifstack;
51 …s_build *gen_build_args(struct cil_tree_node *node, struct cil_db *db, struct cil_tree_node * macr… in gen_build_args()
69 struct cil_tree_node *test_current; in test_cil_parse_to_list()
100 struct cil_tree_node *test_current; in test_cil_parse_to_list_currnull_neg()
131 struct cil_tree_node *test_current; in test_cil_parse_to_list_listnull_neg()
212 struct cil_tree_node *test_ast_node; in test_cil_gen_block()
[all …]
|
| D | test_cil.c | 63 struct cil_tree_node *test_ast_node; in test_cil_get_symtab_block()
81 struct cil_tree_node *test_ast_node; in test_cil_get_symtab_class()
99 struct cil_tree_node *test_ast_node; in test_cil_get_symtab_root()
117 struct cil_tree_node *test_ast_node; in test_cil_get_symtab_flavor_neg()
135 struct cil_tree_node *test_ast_node; in test_cil_get_symtab_null_neg()
152 struct cil_tree_node *test_ast_node = NULL; in test_cil_get_symtab_node_null_neg()
166 struct cil_tree_node *test_ast_node; in test_cil_get_symtab_parent_null_neg()
|
| D | test_cil_copy_ast.c | 40 int __cil_copy_node_helper(struct cil_tree_node *orig, uint32_t *finished, void *extra_args);
43 struct cil_tree_node *dest;
47 struct cil_args_copy *gen_copy_args(struct cil_tree_node *node, struct cil_db *db) in gen_copy_args()
150 struct cil_tree_node *test_ast_node; in test_cil_copy_block()
161 struct cil_tree_node *test_copy; in test_cil_copy_block()
177 struct cil_tree_node *test_ast_node; in test_cil_copy_perm()
186 struct cil_tree_node *new_tree_node; in test_cil_copy_perm()
194 struct cil_tree_node *test_copy; in test_cil_copy_perm()
218 struct cil_tree_node *test_ast_node; in test_cil_copy_class()
229 struct cil_tree_node *test_copy; in test_cil_copy_class()
[all …]
|
| D | test_cil_list.c | 54 struct cil_tree_node *test_ast_node; in test_cil_list_append_item()
82 struct cil_tree_node *test_ast_node; in test_cil_list_append_item_append()
118 struct cil_tree_node *test_ast_node; in test_cil_list_append_item_append_extra()
160 struct cil_tree_node *test_ast_node; in test_cil_list_append_item_listnull_neg()
187 struct cil_tree_node *test_ast_node; in test_cil_list_append_item_itemnull_neg()
211 struct cil_tree_node *test_ast_node; in test_cil_list_prepend_item()
239 struct cil_tree_node *test_ast_node; in test_cil_list_prepend_item_prepend()
268 struct cil_tree_node *test_ast_node; in test_cil_list_prepend_item_prepend_neg()
302 struct cil_tree_node *test_ast_node; in test_cil_list_prepend_item_listnull_neg()
329 struct cil_tree_node *test_ast_node; in test_cil_list_prepend_item_itemnull_neg()
|
| D | test_cil_symtab.c | 44 struct cil_tree_node *test_ast_node; in test_cil_symtab_insert()
|
| D | test_cil_tree.c | 38 struct cil_tree_node *test_node; in test_cil_tree_node_init()
|