| /security/selinux/ss/ |
| D | ebitmap.c | 43 n1 = n1->next; in ebitmap_cmp()
44 n2 = n2->next; in ebitmap_cmp()
68 new->next = NULL; in ebitmap_cpy()
70 prev->next = new; in ebitmap_cpy()
74 n = n->next; in ebitmap_cpy()
142 e_iter = e_iter->next; in ebitmap_netlbl_export()
194 e_prev->next = e_iter; in ebitmap_netlbl_import()
233 n1 = n1->next; in ebitmap_contains()
251 n1 = n1->next; in ebitmap_contains()
252 n2 = n2->next; in ebitmap_contains()
[all …]
|
| D | hashtab.c | 59 newnode->next = *dst; in __hashtab_insert()
75 cur = cur->next; in hashtab_destroy()
99 cur = cur->next; in hashtab_map()
120 cur = cur->next; in hashtab_stat()
151 for (cur = orig->htable[i]; cur; cur = cur->next) { in hashtab_duplicate()
161 tmp->next = NULL; in hashtab_duplicate()
165 tail->next = tmp; in hashtab_duplicate()
176 tmp = cur->next; in hashtab_duplicate()
|
| D | hashtab.h | 29 struct hashtab_node *next; member
83 cur = cur->next; in hashtab_insert()
86 return __hashtab_insert(h, prev ? &prev->next : &h->htable[hvalue], in hashtab_insert()
114 cur = cur->next; in hashtab_search()
|
| D | avtab.c | 93 newnode->next = prev->next; in avtab_insert_node()
94 prev->next = newnode; in avtab_insert_node()
98 newnode->next = *n; in avtab_insert_node()
119 prev = cur, cur = cur->next) { in avtab_insert()
164 prev = cur, cur = cur->next) { in avtab_insert_nonunique()
194 cur = cur->next) { in avtab_search()
230 cur = cur->next) { in avtab_search_node()
259 for (cur = node->next; cur; cur = cur->next) { in avtab_search_node_next()
291 cur = cur->next; in avtab_destroy()
373 cur = cur->next; in avtab_hash_eval()
[all …]
|
| D | ebitmap.h | 35 struct ebitmap_node *next; member
52 for (*n = e->node; *n; *n = (*n)->next) { in ebitmap_start_positive()
75 for (*n = (*n)->next; *n; *n = (*n)->next) { in ebitmap_next_positive()
|
| D | constraint.h | 54 struct constraint_expr *next; /* next expression */ member
60 struct constraint_node *next; /* next constraint */ member
|
| D | policydb.c | 234 e = e->next; in cls_destroy()
238 constraint = constraint->next; in cls_destroy()
247 e = e->next; in cls_destroy()
251 constraint = constraint->next; in cls_destroy()
334 struct filename_trans_datum *next, *d = datum; in filenametr_destroy() local
340 next = d->next; in filenametr_destroy()
342 d = next; in filenametr_destroy()
814 c = c->next; in policydb_destroy()
827 c = c->next; in policydb_destroy()
831 g = g->next; in policydb_destroy()
[all …]
|
| D | policydb.h | 103 struct filename_trans_datum *next; /* record for next otype*/ member
109 struct role_allow *next; member
206 struct ocontext *next; member
212 struct genfs *next; member
|
| D | avtab.h | 80 struct avtab_node *next; member
|
| D | services.c | 286 for (e = cexpr; e; e = e->next) { in constraint_expr_eval()
697 constraint = constraint->next; in context_struct_compute_av()
708 for (ra = policydb->role_allow; ra; ra = ra->next) { in context_struct_compute_av()
834 constraint = constraint->next; in security_compute_validatetrans()
1722 datum = datum->next; in filename_compute_type()
2113 oc = oc->next; in convert_context()
2458 c = c->next; in security_port_sid()
2513 c = c->next; in security_ib_pkey_sid()
2568 c = c->next; in security_ib_endport_sid()
2618 c = c->next; in security_netif_sid()
[all …]
|
| /security/apparmor/ |
| D | match.c | 409 #define match_char(state, def, base, next, check, C) \ argument
419 (state) = (next)[pos]; \
444 u16 *next = NEXT_TABLE(dfa); in aa_dfa_match_len() local
456 match_char(state, def, base, next, check, in aa_dfa_match_len()
461 match_char(state, def, base, next, check, (u8) *str++); in aa_dfa_match_len()
484 u16 *next = NEXT_TABLE(dfa); in aa_dfa_match() local
497 match_char(state, def, base, next, check, in aa_dfa_match()
502 match_char(state, def, base, next, check, (u8) *str++); in aa_dfa_match()
523 u16 *next = NEXT_TABLE(dfa); in aa_dfa_next() local
530 match_char(state, def, base, next, check, equiv[(u8) c]); in aa_dfa_next()
[all …]
|
| D | procattr.c | 127 char *next = hat + strlen(hat) + 1; in aa_setprocattr_changehat() local
131 hat = next; in aa_setprocattr_changehat()
|
| D | label.c | 1053 struct aa_profile *next; in label_merge_insert() local
1066 label_for_each_in_merge(i, a, b, next) { in label_merge_insert()
1067 AA_BUG(!next); in label_merge_insert()
1068 if (profile_is_stale(next)) { in label_merge_insert()
1069 new->vec[k] = aa_get_newest_profile(next); in label_merge_insert()
1072 if (next->label.proxy != new->vec[k]->label.proxy) in label_merge_insert()
1077 new->vec[k++] = aa_get_profile(next); in label_merge_insert()
1316 goto next; in label_compound_match()
1323 next: in label_compound_match()
1376 goto next; in label_components_match()
[all …]
|
| D | apparmorfs.c | 2066 struct aa_ns *parent, *next; in __next_ns() local
2074 next = list_first_entry(&ns->sub_ns, typeof(*ns), base.list); in __next_ns()
2075 mutex_lock_nested(&next->lock, next->level); in __next_ns()
2076 return next; in __next_ns()
2083 next = list_next_entry(ns, base.list); in __next_ns()
2084 if (!list_entry_is_head(next, &parent->sub_ns, base.list)) { in __next_ns()
2085 mutex_lock_nested(&next->lock, next->level); in __next_ns()
2086 return next; in __next_ns()
2168 struct aa_profile *next = __next_profile(profile); in next_profile() local
2169 if (next) in next_profile()
[all …]
|
| D | domain.c | 150 goto next; in label_compound_match()
157 next: in label_compound_match()
212 goto next; in label_components_match()
218 next: in label_components_match()
|
| /security/smack/ |
| D | smackfs.c | 632 .next = load2_seq_next,
800 .next = cipso_seq_next,
996 .next = cipso_seq_next,
1072 .next = net4addr_seq_next,
1109 m = list_entry_rcu(smk_net4addr_list.next, in smk_net4addr_insert()
1123 m_next = list_entry_rcu(m->list.next, in smk_net4addr_insert()
1336 .next = net6addr_seq_next,
1373 m = list_entry_rcu(smk_net6addr_list.next, in smk_net6addr_insert()
1386 m_next = list_entry_rcu(m->list.next, in smk_net6addr_insert()
1900 .next = onlycap_seq_next,
[all …]
|
| /security/safesetid/ |
| D | securityfs.c | 78 hash_for_each_safe(pol->rules, bucket, tmp, rule, next) in __release_ruleset()
91 hash_add(pol->rules, &rule->next, __kuid_val(rule->src_id.uid)); in insert_rule()
93 hash_add(pol->rules, &rule->next, __kgid_val(rule->src_id.gid)); in insert_rule()
104 hash_for_each(pol->rules, bucket, rule, next) { in verify_ruleset()
|
| D | lsm.h | 45 struct hlist_node next; member
|
| D | lsm.c | 39 hash_for_each_possible(policy->rules, rule, next, __kuid_val(src.uid)) { in _setid_policy_lookup()
47 hash_for_each_possible(policy->rules, rule, next, __kgid_val(src.gid)) { in _setid_policy_lookup()
|
| /security/integrity/ima/ |
| D | ima_fs.c | 102 qe = list_entry_rcu(qe->later.next, struct ima_queue_entry, later); in ima_measurements_next()
191 .next = ima_measurements_next,
257 .next = ima_measurements_next,
376 .next = ima_policy_next,
|
| /security/keys/ |
| D | proc.c | 23 .next = proc_keys_next,
35 .next = proc_key_users_next,
|
| D | gc.c | 139 list_entry(keys->next, struct key, graveyard_link); in key_gc_unused_keys()
|
| /security/landlock/ |
| D | ruleset.c | 361 struct landlock_rule *freeme, *next; in free_ruleset() local
364 rbtree_postorder_for_each_entry_safe(freeme, next, &ruleset->root, node) in free_ruleset()
|
| /security/tomoyo/ |
| D | common.c | 753 next: in tomoyo_read_profile()
833 goto next; in tomoyo_read_profile()
2552 if (!ns || (head->r.eof && ns->next != &tomoyo_namespace_list)) { in tomoyo_set_namespace_cursor()
2555 head->r.ns = ns ? ns->next : tomoyo_namespace_list.next; in tomoyo_set_namespace_cursor()
2570 head->r.ns->next != &tomoyo_namespace_list; in tomoyo_has_more_namespace()
|
| /security/selinux/ |
| D | avc.c | 85 struct avc_callback_node *next; member
828 c->next = avc_callbacks; in avc_add_callback()
976 for (c = avc_callbacks; c; c = c->next) { in avc_ss_reset()
|