| /security/selinux/ |
| D | netnode.c | 107 struct sel_netnode *node; in sel_netnode_find() local
121 list_for_each_entry_rcu(node, &sel_netnode_hash[idx].list, list) in sel_netnode_find()
122 if (node->nsec.family == family) in sel_netnode_find()
125 if (node->nsec.addr.ipv4 == *(__be32 *)addr) in sel_netnode_find()
126 return node; in sel_netnode_find()
129 if (ipv6_addr_equal(&node->nsec.addr.ipv6, in sel_netnode_find()
131 return node; in sel_netnode_find()
146 static void sel_netnode_insert(struct sel_netnode *node) in sel_netnode_insert() argument
150 switch (node->nsec.family) { in sel_netnode_insert()
152 idx = sel_netnode_hashfn_ipv4(node->nsec.addr.ipv4); in sel_netnode_insert()
[all …]
|
| D | avc.c | 159 struct avc_node *node; in avc_get_hash_stats() local
171 hlist_for_each_entry_rcu(node, head, list) in avc_get_hash_stats()
333 static int avc_add_xperms_decision(struct avc_node *node, in avc_add_xperms_decision() argument
338 node->ae.xp_node->xp.len++; in avc_add_xperms_decision()
343 list_add(&dest_xpd->xpd_list, &node->ae.xp_node->xpd_head); in avc_add_xperms_decision()
358 static int avc_xperms_populate(struct avc_node *node, in avc_xperms_populate() argument
382 node->ae.xp_node = dest; in avc_xperms_populate()
439 struct avc_node *node = container_of(rhead, struct avc_node, rhead); in avc_node_free() local
440 avc_xperms_free(node->ae.xp_node); in avc_node_free()
441 kmem_cache_free(avc_node_cachep, node); in avc_node_free()
[all …]
|
| D | Kconfig | 32 This option enables writing to a selinuxfs node 'disable', which
|
| /security/selinux/ss/ |
| D | conditional.c | 34 struct cond_expr_node *node = &expr->nodes[i]; in cond_evaluate_expr() local
36 switch (node->expr_type) { in cond_evaluate_expr()
41 s[sp] = p->bool_val_to_struct[node->bool - 1]->state; in cond_evaluate_expr()
92 static void evaluate_cond_node(struct policydb *p, struct cond_node *node) in evaluate_cond_node() argument
98 new_state = cond_evaluate_expr(p, &node->expr); in evaluate_cond_node()
99 if (new_state != node->cur_state) { in evaluate_cond_node()
100 node->cur_state = new_state; in evaluate_cond_node()
104 for (i = 0; i < node->true_list.len; i++) { in evaluate_cond_node()
105 avnode = node->true_list.nodes[i]; in evaluate_cond_node()
112 for (i = 0; i < node->false_list.len; i++) { in evaluate_cond_node()
[all …]
|
| D | ebitmap.c | 38 n1 = e1->node; in ebitmap_cmp()
39 n2 = e2->node; in ebitmap_cmp()
58 n = src->node; in ebitmap_cpy()
72 dst->node = new; in ebitmap_cpy()
113 struct ebitmap_node *e_iter = ebmap->node; in ebitmap_netlbl_export()
192 ebmap->node = e_iter; in ebitmap_netlbl_import()
228 n1 = e1->node; in ebitmap_contains()
229 n2 = e2->node; in ebitmap_contains()
268 n = e->node; in ebitmap_get_bit()
283 n = e->node; in ebitmap_set_bit()
[all …]
|
| D | ebitmap.h | 41 struct ebitmap_node *node; /* first node in the bitmap */ member
52 for (*n = e->node; *n; *n = (*n)->next) { in ebitmap_start_positive()
83 #define EBITMAP_NODE_INDEX(node, bit) \ argument
84 (((bit) - (node)->startbit) / EBITMAP_UNIT_SIZE)
85 #define EBITMAP_NODE_OFFSET(node, bit) \ argument
86 (((bit) - (node)->startbit) % EBITMAP_UNIT_SIZE)
|
| D | services.c | 598 struct avtab_node *node) in services_compute_xperms_drivers() argument
602 if (node->datum.u.xperms->specified == AVTAB_XPERMS_IOCTLDRIVER) { in services_compute_xperms_drivers()
605 xperms->drivers.p[i] |= node->datum.u.xperms->perms.p[i]; in services_compute_xperms_drivers()
606 } else if (node->datum.u.xperms->specified == AVTAB_XPERMS_IOCTLFUNCTION) { in services_compute_xperms_drivers()
609 node->datum.u.xperms->driver); in services_compute_xperms_drivers()
613 if (node->key.specified & AVTAB_XPERMS_ALLOWED) in services_compute_xperms_drivers()
631 struct avtab_node *node; in context_struct_compute_av() local
665 for (node = avtab_search_node(&policydb->te_avtab, in context_struct_compute_av()
667 node; in context_struct_compute_av()
668 node = avtab_search_node_next(node, avkey.specified)) { in context_struct_compute_av()
[all …]
|
| D | services.h | 33 struct avtab_node *node);
36 struct avtab_node *node);
|
| D | avtab.c | 249 avtab_search_node_next(struct avtab_node *node, int specified) in avtab_search_node_next() argument
253 if (!node) in avtab_search_node_next()
257 for (cur = node->next; cur; cur = cur->next) { in avtab_search_node_next()
258 if (node->key.source_type == cur->key.source_type && in avtab_search_node_next()
259 node->key.target_type == cur->key.target_type && in avtab_search_node_next()
260 node->key.target_class == cur->key.target_class && in avtab_search_node_next()
264 if (node->key.source_type < cur->key.source_type) in avtab_search_node_next()
266 if (node->key.source_type == cur->key.source_type && in avtab_search_node_next()
267 node->key.target_type < cur->key.target_type) in avtab_search_node_next()
269 if (node->key.source_type == cur->key.source_type && in avtab_search_node_next()
[all …]
|
| D | sidtab.c | 511 struct sidtab_node_inner *node = entry.ptr_inner; in sidtab_destroy_tree() local
513 if (!node) in sidtab_destroy_tree()
517 sidtab_destroy_tree(node->entries[i], level - 1); in sidtab_destroy_tree()
518 kfree(node); in sidtab_destroy_tree()
520 struct sidtab_node_leaf *node = entry.ptr_leaf; in sidtab_destroy_tree() local
522 if (!node) in sidtab_destroy_tree()
526 sidtab_destroy_entry(&node->entries[i]); in sidtab_destroy_tree()
527 kfree(node); in sidtab_destroy_tree()
|
| D | mls.c | 41 struct ebitmap_node *node; in mls_compute_context_len() local
55 ebitmap_for_each_positive_bit(e, node, i) { in mls_compute_context_len()
96 struct ebitmap_node *node; in mls_sid_to_context() local
115 ebitmap_for_each_positive_bit(e, node, i) { in mls_sid_to_context()
454 struct ebitmap_node *node; in mls_convert_context() local
471 node, i) { in mls_convert_context()
|
| D | avtab.h | 112 struct avtab_node *avtab_search_node_next(struct avtab_node *node, int specified);
|
| D | policydb.c | 1664 struct ebitmap_node *node; in user_bounds_sanity_check() local
1675 ebitmap_for_each_positive_bit(&user->roles, node, bit) { in user_bounds_sanity_check()
1700 struct ebitmap_node *node; in role_bounds_sanity_check() local
1711 ebitmap_for_each_positive_bit(&role->types, node, bit) { in role_bounds_sanity_check()
2288 c->u.node.addr = nodebuf[0]; /* network order */ in ocontext_read()
2289 c->u.node.mask = nodebuf[1]; /* network order */ in ocontext_read()
3002 static int write_cons_helper(struct policydb *p, struct constraint_node *node, in write_cons_helper() argument
3011 for (c = node; c; c = c->next) { in write_cons_helper()
3325 nodebuf[0] = c->u.node.addr; /* network order */ in ocontext_write()
3326 nodebuf[1] = c->u.node.mask; /* network order */ in ocontext_write()
[all …]
|
| D | policydb.h | 185 } node; /* node information */ member
|
| /security/integrity/platform_certs/ |
| D | load_powerpc.c | 56 struct device_node *node; in load_powerpc_certs() local
62 node = of_find_compatible_node(NULL, NULL, "ibm,edk2-compat-v1"); in load_powerpc_certs()
63 if (!node) in load_powerpc_certs()
92 of_node_put(node); in load_powerpc_certs()
|
| /security/yama/ |
| D | yama_lsm.c | 34 struct list_head node; member
121 list_for_each_entry_rcu(relation, &ptracer_relations, node) { in yama_relation_cleanup()
123 list_del_rcu(&relation->node); in yama_relation_cleanup()
156 list_for_each_entry_rcu(relation, &ptracer_relations, node) { in yama_ptracer_add()
160 list_replace_rcu(&relation->node, &added->node); in yama_ptracer_add()
166 list_add_rcu(&added->node, &ptracer_relations); in yama_ptracer_add()
186 list_for_each_entry_rcu(relation, &ptracer_relations, node) { in yama_ptracer_del()
328 list_for_each_entry_rcu(relation, &ptracer_relations, node) { in ptracer_exception_found()
|
| /security/apparmor/ |
| D | label.c | 407 RB_CLEAR_NODE(&label->node); in aa_label_init()
606 rb_erase(&label->node, &ls->root); in __label_remove()
641 rb_replace_node(&old->node, &new->node, &ls->root); in __label_replace()
677 struct aa_label *this = rb_entry(*new, struct aa_label, node); in __label_insert()
701 rb_link_node(&label->node, parent, new); in __label_insert()
702 rb_insert_color(&label->node, &ls->root); in __label_insert()
722 struct rb_node *node; in __vec_find() local
728 node = vec_labelset(vec, n)->root.rb_node; in __vec_find()
729 while (node) { in __vec_find()
730 struct aa_label *this = rb_entry(node, struct aa_label, node); in __vec_find()
[all …]
|
| /security/integrity/ |
| D | iint.c | 127 struct rb_node *node, *parent = NULL; in integrity_inode_get() local
167 node = &iint->rb_node; in integrity_inode_get()
169 rb_link_node(node, parent, p); in integrity_inode_get()
170 rb_insert_color(node, &integrity_iint_tree); in integrity_inode_get()
|
| /security/keys/ |
| D | keyring.c | 668 struct assoc_array_node *node; in search_nested_keyrings() member
673 struct assoc_array_node *node; in search_nested_keyrings() local
746 node = assoc_array_ptr_to_node(ptr); in search_nested_keyrings()
750 node = assoc_array_ptr_to_node(ptr); in search_nested_keyrings()
751 ptr = node->slots[0]; in search_nested_keyrings()
765 node = assoc_array_ptr_to_node(ptr); in search_nested_keyrings()
773 ptr = READ_ONCE(node->slots[slot]); in search_nested_keyrings()
775 if (assoc_array_ptr_is_meta(ptr) && node->back_pointer) in search_nested_keyrings()
799 stack[sp].node = node; in search_nested_keyrings()
811 ptr = READ_ONCE(node->back_pointer); in search_nested_keyrings()
[all …]
|
| D | key.c | 64 user = rb_entry(parent, struct key_user, node); in key_user_lookup()
102 rb_link_node(&candidate->node, parent, p); in key_user_lookup()
103 rb_insert_color(&candidate->node, &key_user_tree); in key_user_lookup()
123 rb_erase(&user->node, &key_user_tree); in key_user_put()
1207 rb_link_node(&root_key_user.node, in key_init()
1211 rb_insert_color(&root_key_user.node, in key_init()
|
| D | proc.c | 255 struct key_user *user = rb_entry(n, struct key_user, node); in __key_user_next()
306 struct key_user *user = rb_entry(_p, struct key_user, node); in proc_key_users_show()
|
| D | internal.h | 55 struct rb_node node; member
|
| /security/apparmor/include/ |
| D | label.h | 127 struct rb_node node; member
|