/security/apparmor/include/ |
H A D | policy_unpack.h | 18 #include <linux/list.h> 21 struct list_head list; member in struct:aa_load_ent
|
/security/selinux/ |
H A D | netnode.c | 33 #include <linux/list.h> 51 struct list_head list; member in struct:sel_netnode_bkt 57 struct list_head list; member in struct:sel_netnode 131 list_for_each_entry_rcu(node, &sel_netnode_hash[idx].list, list) 174 list_add_rcu(&node->list, &sel_netnode_hash[idx].list); 178 rcu_dereference_protected(sel_netnode_hash[idx].list.prev, 180 struct sel_netnode, list); 181 list_del_rcu(&tail->list); [all...] |
H A D | netport.c | 32 #include <linux/list.h> 50 struct list_head list; member in struct:sel_netport_bkt 56 struct list_head list; member in struct:sel_netport 100 list_for_each_entry_rcu(port, &sel_netport_hash[idx].list, list) 122 list_add_rcu(&port->list, &sel_netport_hash[idx].list); 127 sel_netport_hash[idx].list.prev, 129 struct sel_netport, list); 130 list_del_rcu(&tail->list); [all...] |
H A D | netif.c | 22 #include <linux/list.h> 36 struct list_head list; member in struct:sel_netif 77 list_for_each_entry_rcu(netif, &sel_netif_hash[idx], list) 102 list_add_rcu(&netif->list, &sel_netif_hash[idx]); 118 list_del_rcu(&netif->list); 256 list_for_each_entry(netif, &sel_netif_hash[idx], list)
|
H A D | avc.c | 25 #include <linux/list.h> 57 struct hlist_node list; /* anchored in avc_cache->slots[i] */ member in struct:avc_node 62 struct hlist_head slots[AVC_CACHE_SLOTS]; /* head for avc_node->list */ 76 struct list_head od_head; /* list of operation_decision_node */ 218 hlist_for_each_entry_rcu(node, head, list) 234 * using a linked list for operation_decision lookup because the list is 504 hlist_del_rcu(&node->list); 519 hlist_replace_rcu(&old->list, &new->list); [all...] |
/security/tomoyo/ |
H A D | gc.c | 26 /* The list for "struct tomoyo_io_buffer". */ 32 * tomoyo_struct_used_by_io_buffer - Check whether the list element is used by /sys/kernel/security/tomoyo/ users or not. 45 list_for_each_entry(head, &tomoyo_io_buffer_list, list) { 50 head->r.acl == element || &head->w.domain->list == element) 77 list_for_each_entry(head, &tomoyo_io_buffer_list, list) { 109 container_of(element, typeof(*ptr), head.list); 124 container_of(element, typeof(*ptr), head.list); 139 container_of(element, typeof(*ptr), head.list); 153 container_of(element, typeof(*acl), list); 246 container_of(element, typeof(*domain), list); 493 tomoyo_collect_acl(struct list_head *list) argument 546 struct list_head *list = &ns->group_list[i]; local 573 struct list_head *list = &tomoyo_name_list[i]; local [all...] |
H A D | memory.c | 97 struct list_head *list; local 107 list = ¶m->ns->group_list[idx]; 108 list_for_each_entry(group, list, head.list) { 121 list_add_tail_rcu(&entry->head.list, list); 161 list_for_each_entry(ptr, head, head.list) { 174 list_add_tail(&ptr->head.list, head); 200 list_add_tail_rcu(&tomoyo_kernel_domain.list, &tomoyo_domain_list);
|
H A D | domain.c | 37 struct list_head *list = param->list; local 41 list_for_each_entry_rcu(entry, list, list) { 53 list_add_tail_rcu(&entry->list, list); 101 struct list_head * const list = param->list; local 119 list_for_each_entry_rcu(entry, list, list) { 163 const struct list_head *list = &domain->acl_info_list; local 287 tomoyo_scan_transition(const struct list_head *list, const struct tomoyo_path_info *domainname, const struct tomoyo_path_info *program, const char *last_name, const enum tomoyo_transition_type type) argument 339 const struct list_head * const list = local 710 struct list_head *list = local [all...] |
H A D | group.c | 64 * tomoyo_write_group - Write "struct tomoyo_path_group"/"struct tomoyo_number_group"/"struct tomoyo_address_group" list. 77 param->list = &group->member_list; 129 list_for_each_entry_rcu(member, &group->member_list, head.list) { 156 list_for_each_entry_rcu(member, &group->member_list, head.list) { 186 list_for_each_entry_rcu(member, &group->member_list, head.list) {
|
H A D | common.c | 849 .list = &tomoyo_kernel_namespace. 899 list_entry(head->r.acl, typeof(*ptr), head.list); 936 policy_list[TOMOYO_ID_MANAGER], head.list) { 1004 head->r.domain = &domain->list; 1030 * tomoyo_write_task - Update task related list. 1074 list_for_each_entry_rcu(domain, &tomoyo_domain_list, list) { 1092 * @list: Pointer to "struct list_head". 1101 struct list_head *list, char *data, 1106 .list = list, 1100 tomoyo_write_domain2(struct tomoyo_policy_namespace *ns, struct list_head *list, char *data, const bool is_delete) argument 1558 tomoyo_read_domain2(struct tomoyo_io_buffer *head, struct list_head *list) argument 1746 struct list_head *list = &ns->group_list[idx]; local 1802 struct list_head *list = &ns->policy_list[idx]; local 1890 struct list_head list; member in struct:tomoyo_query [all...] |
H A D | audit.c | 297 struct list_head list; member in struct:tomoyo_log 302 /* The list for "struct tomoyo_log". */ 389 list_add_tail(&entry->list, &tomoyo_log); 439 ptr = list_entry(tomoyo_log.next, typeof(*ptr), list); 440 list_del(&ptr->list);
|
H A D | common.h | 21 #include <linux/list.h> 403 struct list_head list; member in struct:tomoyo_acl_head 409 struct list_head list; member in struct:tomoyo_shared_acl_head 669 struct list_head list; member in struct:tomoyo_acl_info 677 struct list_head list; member in struct:tomoyo_domain_info 777 struct list_head *list; member in struct:tomoyo_acl_param 837 struct list_head list; member in struct:tomoyo_io_buffer 906 /* List for connecting to tomoyo_namespace_list list. */ 1321 * list_for_each_cookie - iterate over a list with cookie. 1323 * @head: the head for your list [all...] |
/security/selinux/ss/ |
H A D | conditional.c | 87 * list appropriately. If the result of the expression is undefined 133 static void cond_av_list_destroy(struct cond_av_list *list) argument 136 for (cur = list; cur; cur = next) { 156 static void cond_list_destroy(struct cond_node *list) argument 160 if (list == NULL) 163 for (cur = list; cur; cur = next) { 275 struct cond_av_list *other = data->other, *list, *cur; local 291 * If we are reading the false list other will be a pointer to 292 * the true list. We can have duplicate entries if there is only 293 * 1 other entry and it is in our true list 525 cond_write_av_list(struct policydb *p, struct cond_av_list *list, struct policy_file *fp) argument 593 cond_write_list(struct policydb *p, struct cond_node *list, void *fp) argument [all...] |
H A D | conditional.h | 21 * A conditional expression is a list of operators and operands 39 * Each cond_node contains a list of rules to be enabled/disabled 41 * struct is for that list. 52 * expression (the true list corresponds to if and the false list corresponds 74 int cond_write_list(struct policydb *p, struct cond_node *list, void *fp);
|
/security/smack/ |
H A D | smackfs.c | 123 * This master list is just for reading /smack/load and /smack/load2. 126 struct list_head list; member in struct:smack_master_list 201 * smk_set_access - add a rule to the rule list or replace an old rule 203 * @rule_list: the list of rules 204 * @rule_lock: the rule list lock 207 * Looks through the current subject/object/access list for 230 list_for_each_entry_rcu(sp, rule_list, list) { 251 list_add_rcu(&sp->list, rule_list); 260 list_add_rcu(&smlp->list, &smack_rule_list); 448 * @rule_list: the list o 557 struct list_head *list; local 580 struct list_head *list = v; local 650 struct list_head *list = v; local 798 struct list_head *list = v; local 987 struct list_head *list = v; local 1071 struct list_head *list = v; local 1805 struct list_head *list = v; local 1934 struct list_head *list = v; local 2011 struct list_head *list = v; local [all...] |
H A D | smack.h | 21 #include <linux/list.h> 37 * is imported (e.g. xattrset on a file) the list is checked 55 struct list_head list; member in struct:smack_known 113 struct list_head list; member in struct:smack_rule 123 struct list_head list; member in struct:smk_netlbladdr 133 struct list_head list; member in struct:smk_port_label
|
H A D | smack_access.c | 67 * @rule_list: the list of rules to search 70 * access rule list and returns the access mode. If no 76 * were not on the label list. This was done to allow for 82 * label list. Checking to see if the address of two labels 96 list_for_each_entry_rcu(srp, rule_list, list) { 120 * access rule list and returns 0 if the access is permitted, 213 * in the access rule list and returns 0 if the access is permitted, 225 * Check the global rule list 230 * If there is an entry in the task's rule list 265 * in the access rule list an [all...] |
H A D | smack_lsm.c | 207 * Returns a pointer to the master list entry for the Smack label 293 list_for_each_entry_rcu(orp, ohead, list) { 300 list_add_rcu(&nrp->list, nhead); 498 * options list. 1117 * in the master label list. 1286 * smack_inode_listsecurity - list the Smack attributes 1344 * label list, so no allocation is done. 1361 * label list, so no memory is freed. 1505 list_for_each_entry_rcu(srp, &skp->smk_rules, list) { 1531 * Fetch the global list entr [all...] |
/security/apparmor/ |
H A D | policy.c | 143 INIT_LIST_HEAD(&policy->list); 162 if (on_list_rcu(&policy->list)) { 163 AA_ERROR("%s: internal error, policy '%s' still on list\n", 173 * __policy_find - find a policy by @name on a policy list 174 * @head: list to search (NOT NULL) 185 list_for_each_entry_rcu(policy, head, list) { 194 * @head: list to search (NOT NULL) 210 list_for_each_entry_rcu(policy, head, list) { 333 * __aa_find_namespace - find a namespace on a list by @name 334 * @head: list t 425 __list_add_profile(struct list_head *list, struct aa_profile *profile) argument [all...] |
H A D | apparmorfs.c | 360 list_for_each_entry(child, &profile->base.profiles, base.list) 460 list_for_each_entry(child, &profile->base.profiles, base.list) { 486 list_for_each_entry(child, &ns->base.profiles, base.list) 489 list_for_each_entry(sub, &ns->sub_ns, base.list) { 527 list_for_each_entry(child, &ns->base.profiles, base.list) { 533 list_for_each_entry(sub, &ns->sub_ns, base.list) { 558 * __next_namespace - find the next namespace to list 576 next = list_first_entry(&ns->sub_ns, typeof(*ns), base.list); 585 next = list_entry_next(ns, base.list); 586 if (!list_entry_is_head(next, &parent->sub_ns, base.list)) { [all...] |
H A D | policy_unpack.c | 732 INIT_LIST_HEAD(&ent->list); 740 * @lh: list to place unpacked profiles in a aa_repl_ws 744 * @lh in order of discovery, with the list chain stored in base.list 790 list_add_tail(&ent->list, lh); 799 list_for_each_entry_safe(ent, tmp, lh, list) { 800 list_del_init(&ent->list);
|
H A D | domain.c | 128 * @head - profile list to walk (NOT NULL) 130 * Do a linear search on the profiles in the list. There is a matching 145 list_for_each_entry_rcu(profile, head, base.list) { 168 * @list: list to search (NOT NULL) 174 struct list_head *list, const char *name) 179 profile = aa_get_profile(__attach_match(name, list)); 173 find_attach(struct aa_namespace *ns, struct list_head *list, const char *name) argument
|
/security/ |
H A D | device_cgroup.c | 10 #include <linux/list.h> 35 * exception list locking rules: 44 struct list_head list; member in struct:dev_exception_item 73 list_for_each_entry(ex, orig, list) { 77 list_add_tail(&new->list, dest); 83 list_for_each_entry_safe(ex, tmp, dest, list) { 84 list_del(&ex->list); 104 list_for_each_entry(walk, &dev_cgroup->exceptions, list) { 118 list_add_tail_rcu(&excopy->list, &dev_cgroup->exceptions); 132 list_for_each_entry_safe(walk, tmp, &dev_cgroup->exceptions, list) { [all...] |
/security/selinux/include/ |
H A D | objsec.h | 21 #include <linux/list.h> 43 struct list_head list; /* list of inode_security_struct */ member in union:inode_security_struct::__anon22
|
/security/integrity/ima/ |
H A D | ima_policy.c | 14 #include <linux/list.h> 46 struct list_head list; member in struct:ima_rule_entry 143 list_for_each_entry_safe(entry, tmp, &ima_policy_rules, list) { 264 * (There is no need for locking when walking the policy list, 265 * as elements in the list are never deleted, nor does the list 274 list_for_each_entry(entry, ima_rules, list) { 311 list_for_each_entry(entry, ima_rules, list) { 337 list_add_tail(&default_rules[i].list, 342 list_add_tail(&default_appraise_rules[j].list, [all...] |