| /security/selinux/ |
| A D | netnode.c | 106 struct sel_netnode *node; in sel_netnode_find() local
125 return node; in sel_netnode_find()
130 return node; in sel_netnode_find()
149 switch (node->nsec.family) { in sel_netnode_insert()
193 struct sel_netnode *node; in sel_netnode_sid_slow() local
198 if (node != NULL) { in sel_netnode_sid_slow()
199 *sid = node->nsec.sid; in sel_netnode_sid_slow()
255 struct sel_netnode *node; in sel_netnode_sid() local
259 if (likely(node != NULL)) { in sel_netnode_sid()
260 *sid = node->nsec.sid; in sel_netnode_sid()
[all …]
|
| A D | avc.c | 146 struct avc_node *node; in avc_get_hash_stats() local
499 if (!node) in avc_alloc_node()
510 return node; in avc_alloc_node()
515 node->ae.ssid = ssid; in avc_node_populate()
516 node->ae.tsid = tsid; in avc_node_populate()
518 memcpy(&node->ae.avd, avd, sizeof(node->ae.avd)); in avc_node_populate()
533 ret = node; in avc_search_node()
560 if (node) in avc_lookup()
561 return node; in avc_lookup()
619 if (!node) in avc_insert()
[all …]
|
| /security/selinux/ss/ |
| A D | conditional.c | 35 switch (node->expr_type) { in cond_evaluate_expr()
141 kfree(node->expr.nodes); in cond_node_destroy()
386 node->expr.nodes = kcalloc(len, sizeof(*node->expr.nodes), GFP_KERNEL); in cond_read_node()
387 if (!node->expr.nodes) in cond_read_node()
390 node->expr.len = len; in cond_read_node()
409 return cond_read_av_list(p, fp, &node->false_list, &node->true_list); in cond_read_node()
556 struct avtab_node *node; in cond_compute_xperms() local
561 for (node = avtab_search_node(ctab, key); node; in cond_compute_xperms()
562 node = avtab_search_node_next(node, key->specified)) { in cond_compute_xperms()
578 for (node = avtab_search_node(ctab, key); node; in cond_compute_av()
[all …]
|
| A D | ebitmap.c | 35 n1 = e1->node; in ebitmap_equal()
36 n2 = e2->node; in ebitmap_equal()
55 n = src->node; in ebitmap_cpy()
227 n1 = e1->node; in ebitmap_contains()
228 n2 = e2->node; in ebitmap_contains()
267 n = e->node; in ebitmap_get_bit()
282 n = e->node; in ebitmap_set_bit()
339 e->node = new; in ebitmap_set_bit()
352 n = e->node; in ebitmap_destroy()
566 for (node = e->node; node; node = node->next) { in ebitmap_hash()
[all …]
|
| A D | ebitmap.h | 43 struct ebitmap_node *node; /* first node in the bitmap */ member
54 for (*n = e->node; *n; *n = (*n)->next) { in ebitmap_start_positive()
84 #define EBITMAP_NODE_INDEX(node, bit) \ argument
85 (((bit) - (node)->startbit) / EBITMAP_UNIT_SIZE)
86 #define EBITMAP_NODE_OFFSET(node, bit) \ argument
87 (((bit) - (node)->startbit) % EBITMAP_UNIT_SIZE)
|
| A D | services.c | 590 struct avtab_node *node) in services_compute_xperms_drivers() argument
632 struct avtab_node *node; in context_struct_compute_av() local
666 node; in context_struct_compute_av()
667 node = avtab_search_node_next(node, avkey.specified)) { in context_struct_compute_av()
1039 struct avtab_node *node; in security_compute_xperms_decision() local
1096 node; in security_compute_xperms_decision()
1097 node = avtab_search_node_next(node, avkey.specified)) in security_compute_xperms_decision()
1868 for (; node; node = avtab_search_node_next(node, specified)) { in security_compute_sid()
1870 avnode = node; in security_compute_sid()
2174 struct ebitmap_node *node; in security_load_policycaps() local
[all …]
|
| A D | services.h | 39 struct avtab_node *node);
41 struct avtab_node *node);
|
| A D | sidtab.c | 521 struct sidtab_node_inner *node = entry.ptr_inner; in sidtab_destroy_tree() local
523 if (!node) in sidtab_destroy_tree()
527 sidtab_destroy_tree(node->entries[i], level - 1); in sidtab_destroy_tree()
528 kfree(node); in sidtab_destroy_tree()
530 struct sidtab_node_leaf *node = entry.ptr_leaf; in sidtab_destroy_tree() local
532 if (!node) in sidtab_destroy_tree()
536 sidtab_destroy_entry(&node->entries[i]); in sidtab_destroy_tree()
537 kfree(node); in sidtab_destroy_tree()
|
| A D | mls.c | 37 struct ebitmap_node *node; in mls_compute_context_len() local
51 ebitmap_for_each_positive_bit(e, node, i) in mls_compute_context_len()
92 struct ebitmap_node *node; in mls_sid_to_context() local
111 ebitmap_for_each_positive_bit(e, node, i) in mls_sid_to_context()
444 struct ebitmap_node *node; in mls_convert_context() local
461 ebitmap_for_each_positive_bit(&oldc->range.level[l].cat, node, in mls_convert_context()
|
| A D | avtab.c | 198 struct avtab_node *avtab_search_node_next(struct avtab_node *node, in avtab_search_node_next() argument
205 if (!node) in avtab_search_node_next()
207 tmp_key = node->key; in avtab_search_node_next()
209 for (cur = node->next; cur; cur = cur->next) { in avtab_search_node_next()
|
| A D | avtab.h | 125 struct avtab_node *avtab_search_node_next(struct avtab_node *node,
|
| A D | policydb.c | 1694 struct ebitmap_node *node; in user_bounds_sanity_check() local
1705 ebitmap_for_each_positive_bit(&user->roles, node, bit) in user_bounds_sanity_check()
1731 struct ebitmap_node *node; in role_bounds_sanity_check() local
1742 ebitmap_for_each_positive_bit(&role->types, node, bit) in role_bounds_sanity_check()
2330 c->u.node.addr = nodebuf[0]; /* network order */ in ocontext_read()
2331 c->u.node.mask = nodebuf[1]; /* network order */ in ocontext_read()
3051 for (c = node; c; c = c->next) { in write_cons_helper()
3367 nodebuf[0] = c->u.node.addr; /* network order */ in ocontext_write()
3368 nodebuf[1] = c->u.node.mask; /* network order */ in ocontext_write()
3552 struct ebitmap_node *node; in filename_write_helper_compat() local
[all …]
|
| A D | policydb.h | 182 } node; /* node information */ member
|
| /security/landlock/ |
| A D | ruleset.c | 127 RB_CLEAR_NODE(&new_rule->node); in create_rule()
268 rb_replace_node(&this->node, &new_rule->node, root); in insert_rule()
330 node) { in merge_tree()
415 parent_root, node) { in inherit_tree()
481 node) in free_ruleset()
587 const struct rb_node *node; in landlock_find_rule() local
592 node = root->rb_node; in landlock_find_rule()
594 while (node) { in landlock_find_rule()
596 rb_entry(node, struct landlock_rule, node); in landlock_find_rule()
601 node = node->rb_right; in landlock_find_rule()
[all …]
|
| A D | ruleset.h | 93 struct rb_node node; member
|
| /security/yama/ |
| A D | yama_lsm.c | 35 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()
323 list_for_each_entry_rcu(relation, &ptracer_relations, node) { in ptracer_exception_found()
|
| /security/apparmor/ |
| A D | label.c | 649 rb_replace_node(&old->node, &new->node, &ls->root); in __label_replace()
739 while (node) { in __vec_find()
740 struct aa_label *this = rb_entry(node, struct aa_label, node); in __vec_find()
744 node = node->rb_left; in __vec_find()
746 node = node->rb_right; in __vec_find()
1145 while (node) { in __label_find_merge()
1147 node); in __label_find_merge()
1151 node = node->rb_left; in __label_find_merge()
1153 node = node->rb_right; in __label_find_merge()
1963 for (node = rb_first(&ls->root); node; node = rb_first(&ls->root)) { in aa_labelset_destroy()
[all …]
|
| /security/keys/ |
| A 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
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()
776 if (node->back_pointer || in search_nested_keyrings()
802 stack[sp].node = node; in search_nested_keyrings()
815 slot = node->parent_slot; in search_nested_keyrings()
831 if (node->back_pointer) { in search_nested_keyrings()
[all …]
|
| A D | key.c | 63 user = rb_entry(parent, struct key_user, node); in key_user_lookup()
101 rb_link_node(&candidate->node, parent, p); in key_user_lookup()
102 rb_insert_color(&candidate->node, &key_user_tree); in key_user_lookup()
122 rb_erase(&user->node, &key_user_tree); in key_user_put()
1287 rb_link_node(&root_key_user.node, in key_init()
1291 rb_insert_color(&root_key_user.node, in key_init()
|
| A 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()
|
| A D | internal.h | 55 struct rb_node node; member
|
| /security/loadpin/ |
| A D | loadpin.c | 352 list_add_tail(&trd->node, &dm_verity_loadpin_trusted_root_digests); in read_trusted_verity_root_digests()
371 list_for_each_entry_safe(trd, tmp, &dm_verity_loadpin_trusted_root_digests, node) { in read_trusted_verity_root_digests()
372 list_del(&trd->node); in read_trusted_verity_root_digests()
|
| /security/apparmor/include/ |
| A D | label.h | 129 struct rb_node node; member
|