| /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 | 55 cur = cur->next; in hashtab_insert()
67 newnode->next = prev->next; in hashtab_insert()
68 prev->next = newnode; in hashtab_insert()
70 newnode->next = h->htable[hvalue]; in hashtab_insert()
89 cur = cur->next; in hashtab_search()
109 cur = cur->next; in hashtab_destroy()
138 cur = cur->next; in hashtab_map()
159 cur = cur->next; in hashtab_stat()
|
| D | conditional.c | 33 for (cur = expr; cur; cur = cur->next) { in cond_evaluate_expr()
101 for (cur = node->true_list; cur; cur = cur->next) { in evaluate_cond_node()
108 for (cur = node->false_list; cur; cur = cur->next) { in evaluate_cond_node()
135 struct cond_av_list *cur, *next; in cond_av_list_destroy() local
136 for (cur = list; cur; cur = next) { in cond_av_list_destroy()
137 next = cur->next; in cond_av_list_destroy()
148 next_expr = cur_expr->next; in cond_node_destroy()
158 struct cond_node *next, *cur; in cond_list_destroy() local
163 for (cur = list; cur; cur = next) { in cond_list_destroy()
164 next = cur->next; in cond_list_destroy()
[all …]
|
| D | sidtab.c | 47 cur = cur->next; in sidtab_insert()
64 newnode->next = prev->next; in sidtab_insert()
66 prev->next = newnode; in sidtab_insert()
68 newnode->next = s->htable[hvalue]; in sidtab_insert()
90 cur = cur->next; in sidtab_search_core()
101 cur = cur->next; in sidtab_search_core()
137 cur = cur->next; in sidtab_map()
168 cur = cur->next; in sidtab_search_context()
248 cur = cur->next; in sidtab_hash_eval()
273 cur = cur->next; in sidtab_destroy()
|
| D | conditional.h | 35 struct cond_expr *next; member
45 struct cond_av_list *next; member
60 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()
96 newnode->next = flex_array_get_ptr(h->htable, hvalue); in avtab_insert_node()
120 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()
362 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 | 92 struct role_trans *next; member
109 struct role_allow *next; member
206 struct ocontext *next; member
212 struct genfs *next; member
|
| D | policydb.c | 667 e = e->next; in cls_destroy()
671 constraint = constraint->next; in cls_destroy()
680 e = e->next; in cls_destroy()
684 constraint = constraint->next; in cls_destroy()
833 c = c->next; in policydb_destroy()
846 c = c->next; in policydb_destroy()
850 g = g->next; in policydb_destroy()
857 for (tr = p->role_tr; tr; tr = tr->next) { in policydb_destroy()
864 for (ra = p->role_allow; ra; ra = ra->next) { in policydb_destroy()
910 for (c = head; c; c = c->next) { in policydb_load_isids()
[all …]
|
| D | hashtab.h | 19 struct hashtab_node *next; member
|
| D | services.c | 299 for (e = cexpr; e; e = e->next) { in constraint_expr_eval()
712 constraint = constraint->next; in context_struct_compute_av()
723 for (ra = policydb.role_allow; ra; ra = ra->next) { in context_struct_compute_av()
833 constraint = constraint->next; in security_compute_validatetrans()
1713 for (roletr = policydb.role_tr; roletr; roletr = roletr->next) { in security_compute_sid()
1960 oc = oc->next; in convert_context()
2228 c = c->next; in security_port_sid()
2269 c = c->next; in security_ib_pkey_sid()
2310 c = c->next; in security_ib_endport_sid()
2346 c = c->next; in security_netif_sid()
[all …]
|
| D | sidtab.h | 16 struct sidtab_node *next; member
|
| D | avtab.h | 83 struct avtab_node *next; member
|
| /security/apparmor/ |
| D | match.c | 336 u16 *next = NEXT_TABLE(dfa); in aa_dfa_match_len() local
351 state = next[pos]; in aa_dfa_match_len()
360 state = next[pos]; in aa_dfa_match_len()
386 u16 *next = NEXT_TABLE(dfa); in aa_dfa_match() local
401 state = next[pos]; in aa_dfa_match()
410 state = next[pos]; in aa_dfa_match()
434 u16 *next = NEXT_TABLE(dfa); in aa_dfa_next() local
446 state = next[pos]; in aa_dfa_next()
453 state = next[pos]; in aa_dfa_next()
|
| D | procattr.c | 131 char *next = hat + strlen(hat) + 1; in aa_setprocattr_changehat() local
135 hat = next; in aa_setprocattr_changehat()
|
| D | label.c | 1030 struct aa_profile *next; in label_merge_insert() local
1043 label_for_each_in_merge(i, a, b, next) { in label_merge_insert()
1044 AA_BUG(!next); in label_merge_insert()
1045 if (profile_is_stale(next)) { in label_merge_insert()
1046 new->vec[k] = aa_get_newest_profile(next); in label_merge_insert()
1049 if (next->label.proxy != new->vec[k]->label.proxy) in label_merge_insert()
1054 new->vec[k++] = aa_get_profile(next); in label_merge_insert()
1293 goto next; in label_compound_match()
1300 next: in label_compound_match()
1353 goto next; in label_components_match()
[all …]
|
| D | apparmorfs.c | 1919 struct aa_ns *parent, *next; in __next_ns() local
1927 next = list_first_entry(&ns->sub_ns, typeof(*ns), base.list); in __next_ns()
1928 mutex_lock(&next->lock); in __next_ns()
1929 return next; in __next_ns()
1936 next = list_next_entry(ns, base.list); in __next_ns()
1937 if (!list_entry_is_head(next, &parent->sub_ns, base.list)) { in __next_ns()
1938 mutex_lock(&next->lock); in __next_ns()
1939 return next; in __next_ns()
2021 struct aa_profile *next = __next_profile(profile); in next_profile() local
2022 if (next) in next_profile()
[all …]
|
| D | domain.c | 151 goto next; in label_compound_match()
158 next: in label_compound_match()
213 goto next; in label_components_match()
219 next: in label_components_match()
|
| /security/smack/ |
| D | smackfs.c | 660 .next = load2_seq_next,
830 .next = cipso_seq_next,
1003 .next = cipso_seq_next,
1079 .next = net4addr_seq_next,
1116 m = list_entry_rcu(smk_net4addr_list.next, in smk_net4addr_insert()
1130 m_next = list_entry_rcu(m->list.next, in smk_net4addr_insert()
1343 .next = net6addr_seq_next,
1380 m = list_entry_rcu(smk_net6addr_list.next, in smk_net6addr_insert()
1393 m_next = list_entry_rcu(m->list.next, in smk_net6addr_insert()
1903 .next = onlycap_seq_next,
[all …]
|
| /security/integrity/ima/ |
| D | ima_fs.c | 104 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,
374 .next = ima_policy_next,
|
| /security/keys/ |
| D | proc.c | 29 .next = proc_keys_next,
49 .next = proc_key_users_next,
|
| D | gc.c | 131 list_entry(keys->next, struct key, graveyard_link); in key_gc_unused_keys()
|
| D | keyring.c | 118 if (!keyring_name_hash[bucket].next) in keyring_publish_name()
390 if (keyring->name_link.next != NULL && in keyring_destroy()
1119 if (keyring_name_hash[bucket].next) { in find_keyring_by_name()
|
| /security/tomoyo/ |
| D | common.c | 737 next: in tomoyo_read_profile()
815 goto next; in tomoyo_read_profile()
2482 if (!ns || (head->r.eof && ns->next != &tomoyo_namespace_list)) { in tomoyo_set_namespace_cursor()
2485 head->r.ns = ns ? ns->next : tomoyo_namespace_list.next; in tomoyo_set_namespace_cursor()
2500 head->r.ns->next != &tomoyo_namespace_list; in tomoyo_has_more_namespace()
|