/third_party/selinux/libsepol/cil/src/ |
D | cil_build_ast.h | 40 …, symtab_t *symtab, hashtab_key_t key, struct cil_symtab_datum *datum, struct cil_tree_node *node); 42 int cil_gen_node(struct cil_db *db, struct cil_tree_node *ast_node, struct cil_symtab_datum *datum,… 43 int cil_parse_to_list(struct cil_tree_node *parse_cl_head, struct cil_list *ast_cl, enum cil_flavor… 45 int cil_gen_block(struct cil_db *db, struct cil_tree_node *parse_current, struct cil_tree_node *ast… 47 int cil_gen_blockinherit(struct cil_db *db, struct cil_tree_node *parse_current, struct cil_tree_no… 49 …nt cil_gen_blockabstract(struct cil_db *db, struct cil_tree_node *parse_current, struct cil_tree_n… 51 int cil_gen_in(struct cil_db *db, struct cil_tree_node *parse_current, struct cil_tree_node *ast_no… 53 int cil_gen_class(struct cil_db *db, struct cil_tree_node *parse_current, struct cil_tree_node *ast… 55 int cil_gen_classorder(struct cil_db *db, struct cil_tree_node *parse_current, struct cil_tree_node… 57 int cil_gen_perm(struct cil_db *db, struct cil_tree_node *parse_current, struct cil_tree_node *ast_… [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 53 struct cil_tree_node *cil_tree_get_next_path(struct cil_tree_node *node, char **info_kind, uint32_t… argument 54 char *cil_tree_get_cil_path(struct cil_tree_node *node); 55 __attribute__((format (printf, 3, 4))) void cil_tree_log(struct cil_tree_node *node, enum cil_log_l… 57 int cil_tree_subtree_has_decl(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[], size_t 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); 64 int cil_verify_conditional_blocks(struct cil_tree_node *current); 65 int cil_verify_decl_does_not_shadow_macro_parameter(struct cil_macro *macro, struct cil_tree_node *… 67 int __cil_verify_ordered_node_helper(struct cil_tree_node *node, uint32_t *finished, void *extra_ar… 68 int __cil_verify_ordered(struct cil_tree_node *current, enum cil_flavor flavor); 71 int __cil_verify_helper(struct cil_tree_node *node, __attribute__((unused)) uint32_t *finished, voi… 72 int __cil_pre_verify_helper(struct cil_tree_node *node, __attribute__((unused)) uint32_t *finished,…
|
D | cil_tree.c | 53 struct cil_tree_node *cil_tree_get_next_path(struct cil_tree_node *node, char **info_kind, uint32_t… in cil_tree_get_next_path() 106 char *cil_tree_get_cil_path(struct cil_tree_node *node) in cil_tree_get_cil_path() 122 __attribute__((format (printf, 3, 4))) void cil_tree_log(struct cil_tree_node *node, enum cil_log_l… in cil_tree_log() 161 int cil_tree_subtree_has_decl(struct cil_tree_node *node) in cil_tree_subtree_has_decl() 199 void cil_tree_subtree_destroy(struct cil_tree_node *node) in cil_tree_subtree_destroy() 205 void cil_tree_children_destroy(struct cil_tree_node *node) in cil_tree_children_destroy() 207 struct cil_tree_node *curr, *next; in cil_tree_children_destroy() 224 void cil_tree_node_init(struct cil_tree_node **node) in cil_tree_node_init() 226 struct cil_tree_node *new_node = cil_malloc(sizeof(*new_node)); in cil_tree_node_init() 239 void cil_tree_node_destroy(struct cil_tree_node **node) in cil_tree_node_destroy() [all …]
|
D | cil_build_ast.c | 50 struct cil_tree_node *ast; 52 struct cil_tree_node *tunif; 53 struct cil_tree_node *in; 54 struct cil_tree_node *macro; 55 struct cil_tree_node *optional; 56 struct cil_tree_node *boolif; 59 int cil_fill_list(struct cil_tree_node *current, enum cil_flavor flavor, struct cil_list **list) in cil_fill_list() 62 struct cil_tree_node *curr; in cil_fill_list() 109 …b, symtab_t *symtab, hashtab_key_t key, struct cil_symtab_datum *datum, struct cil_tree_node *node) in cil_add_decl_to_symtab() 127 struct cil_tree_node *n = NODE(prev); in cil_add_decl_to_symtab() [all …]
|
D | cil_resolve_ast.c | 56 struct cil_tree_node *block; 57 struct cil_tree_node *macro; 58 struct cil_tree_node *optional; 59 struct cil_tree_node *disabled_optional; 60 struct cil_tree_node *boolif; 70 … cil_name * __cil_insert_name(struct cil_db *db, hashtab_key_t key, struct cil_tree_node *ast_node) in __cil_insert_name() 75 struct cil_tree_node *parent = ast_node->parent; in __cil_insert_name() 158 int cil_resolve_classperms(struct cil_tree_node *current, struct cil_classperms *cp, void *extra_ar… in cil_resolve_classperms() 193 int cil_resolve_classperms_set(struct cil_tree_node *current, struct cil_classperms_set *cp_set, vo… in cil_resolve_classperms_set() 218 int cil_resolve_classperms_list(struct cil_tree_node *current, struct cil_list *cp_list, void *extr… in cil_resolve_classperms_list() [all …]
|
D | cil_verify.c | 147 int __cil_verify_syntax(struct cil_tree_node *parse_current, enum cil_syntax s[], size_t len) in __cil_verify_syntax() 149 struct cil_tree_node *c = parse_current; in __cil_verify_syntax() 188 int cil_verify_expr_syntax(struct cil_tree_node *current, enum cil_flavor op, enum cil_flavor expr_… in cil_verify_expr_syntax() 316 int cil_verify_constraint_expr_syntax(struct cil_tree_node *current, enum cil_flavor op) in cil_verify_constraint_expr_syntax() 365 int cil_verify_conditional_blocks(struct cil_tree_node *current) in cil_verify_conditional_blocks() 400 int cil_verify_decl_does_not_shadow_macro_parameter(struct cil_macro *macro, struct cil_tree_node *… in cil_verify_decl_does_not_shadow_macro_parameter() 525 int __cil_verify_ordered_node_helper(struct cil_tree_node *node, __attribute__((unused)) uint32_t *… in __cil_verify_ordered_node_helper() 561 int __cil_verify_ordered(struct cil_tree_node *current, enum cil_flavor flavor) in __cil_verify_ordered() 586 struct cil_tree_node *node = sid->datum.nodes->head->data; in __cil_verify_initsids() 742 int __cil_verify_named_levelrange(struct cil_db *db, struct cil_tree_node *node) in __cil_verify_named_levelrange() [all …]
|
D | cil_parser.c | 76 static void create_node(struct cil_tree_node **node, struct cil_tree_node *current, uint32_t line, … in create_node() 86 static void insert_node(struct cil_tree_node *node, struct cil_tree_node *current) in insert_node() 96 static int add_hll_linemark(struct cil_tree_node **current, uint32_t *hll_offset, uint32_t *hll_exp… in add_hll_linemark() 99 struct cil_tree_node *node; in add_hll_linemark() 193 static void add_cil_path(struct cil_tree_node **current, char *path) in add_cil_path() 195 struct cil_tree_node *node; in add_cil_path() 220 struct cil_tree_node *node = NULL; in cil_parser() 221 struct cil_tree_node *current = NULL; in cil_parser()
|
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_write_ast.h | 43 void cil_write_ast_node(FILE *out, struct cil_tree_node *node); 44 int cil_write_ast(FILE *out, enum cil_write_ast_phase phase, struct cil_tree_node *node);
|
D | cil_fqn.c | 43 struct cil_tree_node *node; 78 struct cil_tree_node *node = NODE(datum); in __cil_fqn_qualify_blocks() 132 int cil_fqn_qualify(struct cil_tree_node *root_node) in cil_fqn_qualify()
|
D | cil_write_ast.c | 186 static void write_node_list(FILE *out, struct cil_tree_node *current) in write_node_list() 477 static void write_call_args_tree(FILE *out, struct cil_tree_node *arg_node) in write_call_args_tree() 549 void cil_write_src_info_node(FILE *out, struct cil_tree_node *node) in cil_write_src_info_node() 561 void cil_write_ast_node(FILE *out, struct cil_tree_node *node) in cil_write_ast_node() 1459 static int __write_parse_ast_node_helper(struct cil_tree_node *node, __attribute__((unused)) uint32… in __write_parse_ast_node_helper() 1487 static int __write_parse_ast_first_child_helper(struct cil_tree_node *node, void *extra_args) in __write_parse_ast_first_child_helper() 1490 struct cil_tree_node *parent = node->parent; in __write_parse_ast_first_child_helper() 1499 static int __write_parse_ast_last_child_helper(struct cil_tree_node *node, void *extra_args) in __write_parse_ast_last_child_helper() 1502 struct cil_tree_node *parent = node->parent; in __write_parse_ast_last_child_helper() 1519 static int __write_cil_ast_node_helper(struct cil_tree_node *node, uint32_t *finished, void *extra_… in __write_cil_ast_node_helper() [all …]
|
D | cil_post.c | 155 struct cil_tree_node *n = d->nodes->head->data; in cil_verify_is_list() 565 static int __cil_post_db_count_helper(struct cil_tree_node *node, uint32_t *finished, void *extra_a… in __cil_post_db_count_helper() 673 static int __cil_post_db_array_helper(struct cil_tree_node *node, uint32_t *finished, void *extra_a… in __cil_post_db_array_helper() 892 struct cil_tree_node *node = datum->nodes->head->data; in __cil_type_to_bitmap() 944 struct cil_tree_node *node = datum->nodes->head->data; in __cil_user_to_bitmap() 992 struct cil_tree_node *node = datum->nodes->head->data; in __cil_role_to_bitmap() 1143 struct cil_tree_node *node = datum->nodes->head->data; in __cil_cat_to_bitmap() 1190 struct cil_tree_node *n1 = d1->nodes->head->data; in __cil_cat_expr_range_to_bitmap_helper() 1191 struct cil_tree_node *n2 = d2->nodes->head->data; in __cil_cat_expr_range_to_bitmap_helper() 1517 static int __cil_post_db_neverallow_attr_helper(struct cil_tree_node *node, uint32_t *finished, __a… in __cil_post_db_neverallow_attr_helper() [all …]
|
D | cil_policy.c | 75 static int __cil_gather_statements_helper(struct cil_tree_node *node, uint32_t *finished, void *ext… in __cil_gather_statements_helper() 182 static void cil_gather_statements(struct cil_tree_node *start, struct cil_list *lists[]) in cil_gather_statements() 363 struct cil_tree_node *node = NODE(operand->data); in __cil_cons_leaf_operand_len() 373 struct cil_tree_node *node = NODE(operand->data); in __cil_cons_leaf_operand_len() 523 struct cil_tree_node *node = NODE(operand->data); in __cil_cons_leaf_operand_to_string() 538 struct cil_tree_node *node = NODE(operand->data); in __cil_cons_leaf_operand_to_string() 731 struct cil_tree_node *node; in cil_commons_to_policy() 732 struct cil_tree_node *perm; in cil_commons_to_policy() 752 struct cil_tree_node *node; in cil_classes_to_policy() 763 struct cil_tree_node *perm = node->cl_head; in cil_classes_to_policy() [all …]
|
D | cil_find.c | 122 struct cil_tree_node *n1 = NODE(s1); in cil_self_match_any() 295 int cil_find_matching_avrule(struct cil_tree_node *node, struct cil_avrule *avrule, struct cil_avru… in cil_find_matching_avrule() 351 static int __cil_find_matching_avrule_in_ast(struct cil_tree_node *node, uint32_t *finished, void *… in __cil_find_matching_avrule_in_ast() 375 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_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…
|
/third_party/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()
|