| /security/selinux/ss/ |
| D | ebitmap.c | 42 n1 = n1->next; in ebitmap_cmp()
43 n2 = n2->next; in ebitmap_cmp()
67 new->next = NULL; in ebitmap_cpy()
69 prev->next = new; in ebitmap_cpy()
73 n = n->next; in ebitmap_cpy()
123 e_iter = e_iter->next; in ebitmap_netlbl_export()
175 e_prev->next = e_iter; in ebitmap_netlbl_import()
214 n1 = n1->next; in ebitmap_contains()
232 n1 = n1->next; in ebitmap_contains()
233 n2 = n2->next; in ebitmap_contains()
[all …]
|
| D | hashtab.c | 57 cur = cur->next; in hashtab_insert()
69 newnode->next = prev->next; in hashtab_insert()
70 prev->next = newnode; in hashtab_insert()
72 newnode->next = h->htable[hvalue]; in hashtab_insert()
91 cur = cur->next; in hashtab_search()
111 cur = cur->next; in hashtab_destroy()
140 cur = cur->next; in hashtab_map()
161 cur = cur->next; in hashtab_stat()
|
| D | conditional.c | 31 for (cur = expr; cur; cur = cur->next) { in cond_evaluate_expr()
99 for (cur = node->true_list; cur; cur = cur->next) { in evaluate_cond_node()
106 for (cur = node->false_list; cur; cur = cur->next) { in evaluate_cond_node()
133 struct cond_av_list *cur, *next; in cond_av_list_destroy() local
134 for (cur = list; cur; cur = next) { in cond_av_list_destroy()
135 next = cur->next; in cond_av_list_destroy()
146 next_expr = cur_expr->next; in cond_node_destroy()
156 struct cond_node *next, *cur; in cond_list_destroy() local
161 for (cur = list; cur; cur = next) { in cond_list_destroy()
162 next = cur->next; in cond_list_destroy()
[all …]
|
| D | conditional.h | 33 struct cond_expr *next; member
43 struct cond_av_list *next; member
58 struct cond_node *next; member
|
| 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 | 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()
118 prev = cur, cur = cur->next) { in avtab_insert()
162 prev = cur, cur = cur->next) { in avtab_insert_nonunique()
192 cur = cur->next) { in avtab_search()
228 cur = cur->next) { in avtab_search_node()
257 for (cur = node->next; cur; cur = cur->next) { in avtab_search_node_next()
289 cur = cur->next; in avtab_destroy()
360 cur = cur->next; in avtab_hash_eval()
[all …]
|
| D | constraint.h | 54 struct constraint_expr *next; /* next expression */ member
60 struct constraint_node *next; /* next constraint */ member
|
| D | policydb.h | 88 struct role_trans *next; member
105 struct role_allow *next; member
202 struct ocontext *next; member
208 struct genfs *next; member
|
| D | policydb.c | 235 e = e->next; in cls_destroy()
239 constraint = constraint->next; in cls_destroy()
248 e = e->next; in cls_destroy()
252 constraint = constraint->next; in cls_destroy()
791 c = c->next; in policydb_destroy()
804 c = c->next; in policydb_destroy()
808 g = g->next; in policydb_destroy()
815 for (tr = p->role_tr; tr; tr = tr->next) { in policydb_destroy()
822 for (ra = p->role_allow; ra; ra = ra->next) { in policydb_destroy()
862 for (c = head; c; c = c->next) { in policydb_load_isids()
[all …]
|
| D | hashtab.h | 19 struct hashtab_node *next; member
|
| D | services.c | 276 for (e = cexpr; e; e = e->next) { in constraint_expr_eval()
689 constraint = constraint->next; in context_struct_compute_av()
700 for (ra = policydb->role_allow; ra; ra = ra->next) { in context_struct_compute_av()
820 constraint = constraint->next; in security_compute_validatetrans()
1827 roletr = roletr->next) { in security_compute_sid()
2065 oc = oc->next; in convert_context()
2334 c = c->next; in security_port_sid()
2378 c = c->next; in security_ib_pkey_sid()
2425 c = c->next; in security_ib_endport_sid()
2466 c = c->next; in security_netif_sid()
[all …]
|
| D | avtab.h | 80 struct avtab_node *next; member
|
| /security/apparmor/ |
| D | match.c | 370 #define match_char(state, def, base, next, check, C) \ argument
380 (state) = (next)[pos]; \
405 u16 *next = NEXT_TABLE(dfa); in aa_dfa_match_len() local
417 match_char(state, def, base, next, check, in aa_dfa_match_len()
422 match_char(state, def, base, next, check, (u8) *str++); in aa_dfa_match_len()
445 u16 *next = NEXT_TABLE(dfa); in aa_dfa_match() local
458 match_char(state, def, base, next, check, in aa_dfa_match()
463 match_char(state, def, base, next, check, (u8) *str++); in aa_dfa_match()
484 u16 *next = NEXT_TABLE(dfa); in aa_dfa_next() local
491 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 | apparmorfs.c | 1979 struct aa_ns *parent, *next; in __next_ns() local
1987 next = list_first_entry(&ns->sub_ns, typeof(*ns), base.list); in __next_ns()
1988 mutex_lock_nested(&next->lock, next->level); in __next_ns()
1989 return next; in __next_ns()
1996 next = list_next_entry(ns, base.list); in __next_ns()
1997 if (!list_entry_is_head(next, &parent->sub_ns, base.list)) { in __next_ns()
1998 mutex_lock_nested(&next->lock, next->level); in __next_ns()
1999 return next; in __next_ns()
2081 struct aa_profile *next = __next_profile(profile); in next_profile() local
2082 if (next) in next_profile()
[all …]
|
| D | label.c | 1025 struct aa_profile *next; in label_merge_insert() local
1038 label_for_each_in_merge(i, a, b, next) { in label_merge_insert()
1039 AA_BUG(!next); in label_merge_insert()
1040 if (profile_is_stale(next)) { in label_merge_insert()
1041 new->vec[k] = aa_get_newest_profile(next); in label_merge_insert()
1044 if (next->label.proxy != new->vec[k]->label.proxy) in label_merge_insert()
1049 new->vec[k++] = aa_get_profile(next); in label_merge_insert()
1288 goto next; in label_compound_match()
1295 next: in label_compound_match()
1348 goto next; in label_components_match()
[all …]
|
| D | domain.c | 148 goto next; in label_compound_match()
155 next: in label_compound_match()
210 goto next; in label_components_match()
216 next: in label_components_match()
|
| /security/smack/ |
| D | smackfs.c | 632 .next = load2_seq_next,
802 .next = cipso_seq_next,
975 .next = cipso_seq_next,
1051 .next = net4addr_seq_next,
1088 m = list_entry_rcu(smk_net4addr_list.next, in smk_net4addr_insert()
1102 m_next = list_entry_rcu(m->list.next, in smk_net4addr_insert()
1315 .next = net6addr_seq_next,
1352 m = list_entry_rcu(smk_net6addr_list.next, in smk_net6addr_insert()
1365 m_next = list_entry_rcu(m->list.next, in smk_net6addr_insert()
1875 .next = onlycap_seq_next,
[all …]
|
| /security/safesetid/ |
| D | securityfs.c | 68 hash_for_each_safe(pol->rules, bucket, tmp, rule, next) in __release_ruleset()
81 hash_add(pol->rules, &rule->next, __kuid_val(rule->src_uid)); in insert_rule()
90 hash_for_each(pol->rules, bucket, rule, next) { in verify_ruleset()
|
| D | lsm.h | 35 struct hlist_node next; member
|
| D | lsm.c | 36 hash_for_each_possible(policy->rules, rule, next, __kuid_val(src)) { in _setuid_policy_lookup()
|
| /security/integrity/ima/ |
| D | ima_fs.c | 103 qe = list_entry_rcu(qe->later.next, struct ima_queue_entry, later); in ima_measurements_next()
192 .next = ima_measurements_next,
258 .next = ima_measurements_next,
375 .next = ima_policy_next,
|
| /security/keys/ |
| D | proc.c | 23 .next = proc_keys_next,
35 .next = proc_key_users_next,
|
| D | gc.c | 126 list_entry(keys->next, struct key, graveyard_link); in key_gc_unused_keys()
|
| /security/tomoyo/ |
| D | common.c | 753 next: in tomoyo_read_profile()
833 goto next; in tomoyo_read_profile()
2555 if (!ns || (head->r.eof && ns->next != &tomoyo_namespace_list)) { in tomoyo_set_namespace_cursor()
2558 head->r.ns = ns ? ns->next : tomoyo_namespace_list.next; in tomoyo_set_namespace_cursor()
2573 head->r.ns->next != &tomoyo_namespace_list; in tomoyo_has_more_namespace()
|