| /security/selinux/ss/ |
| A D | ebitmap.c | 39 n1 = n1->next; in ebitmap_equal()
40 n2 = n2->next; in ebitmap_equal()
65 new->next = NULL; in ebitmap_cpy()
71 n = n->next; in ebitmap_cpy()
250 n1 = n1->next; in ebitmap_contains()
251 n2 = n2->next; in ebitmap_contains()
271 n = n->next; in ebitmap_get_bit()
309 prev->next = n->next; in ebitmap_set_bit()
317 n = n->next; in ebitmap_set_bit()
335 new->next = prev->next; in ebitmap_set_bit()
[all …]
|
| A D | hashtab.c | 62 newnode->next = *dst; in __hashtab_insert()
78 cur = cur->next; in hashtab_destroy()
101 cur = cur->next; in hashtab_map()
124 cur = cur->next; in hashtab_stat()
161 orig_cur = orig_cur->next) { in hashtab_duplicate()
171 tmp->next = NULL; in hashtab_duplicate()
175 tail->next = tmp; in hashtab_duplicate()
186 tmp = cur->next; in hashtab_duplicate()
|
| A D | hashtab.h | 29 struct hashtab_node *next; member
84 cur = cur->next; in hashtab_insert()
87 return __hashtab_insert(h, prev ? &prev->next : &h->htable[hvalue], key, in hashtab_insert()
115 cur = cur->next; in hashtab_search()
|
| A D | avtab.c | 91 newnode->next = *dst; in avtab_insert_node()
132 prev = cur, cur = cur->next) { in avtab_insert()
141 newnode = avtab_insert_node(h, prev ? &prev->next : &h->htable[hvalue], in avtab_insert()
165 prev = cur, cur = cur->next) { in avtab_insert_nonunique()
170 return avtab_insert_node(h, prev ? &prev->next : &h->htable[hvalue], in avtab_insert_nonunique()
188 for (cur = h->htable[hvalue]; cur; cur = cur->next) { in avtab_search_node()
209 for (cur = node->next; cur; cur = cur->next) { in avtab_search_node_next()
231 cur = cur->next; in avtab_destroy()
308 cur = cur->next; in avtab_hash_eval()
602 for (cur = a->htable[i]; cur; cur = cur->next) { in avtab_write()
|
| A D | ebitmap.h | 37 struct ebitmap_node *next; member
54 for (*n = e->node; *n; *n = (*n)->next) { in ebitmap_start_positive()
76 for (*n = (*n)->next; *n; *n = (*n)->next) { in ebitmap_next_positive()
|
| A D | constraint.h | 55 struct constraint_expr *next; /* next expression */ member
61 struct constraint_node *next; /* next constraint */ member
|
| A D | policydb.c | 239 e = e->next; in cls_destroy()
252 e = e->next; in cls_destroy()
344 next = d->next; in filenametr_destroy()
346 d = next; in filenametr_destroy()
812 c = c->next; in policydb_destroy()
825 c = c->next; in policydb_destroy()
829 g = g->next; in policydb_destroy()
1245 lc->next = c; in read_cons_helper()
1262 le->next = e; in read_cons_helper()
2230 newc->next = c; in genfs_read()
[all …]
|
| A D | policydb.h | 101 struct filename_trans_datum *next; /* record for next otype*/ member
107 struct role_allow *next; member
203 struct ocontext *next; member
209 struct genfs *next; member
|
| A D | avtab.h | 81 struct avtab_node *next; member
|
| /security/apparmor/ |
| A D | match.c | 430 (state) = (next)[pos]; \
455 u32 *next = NEXT_TABLE(dfa); in aa_dfa_match_len() local
494 u32 *next = NEXT_TABLE(dfa); in aa_dfa_match() local
532 u32 *next = NEXT_TABLE(dfa); in aa_dfa_next() local
550 u32 *next = NEXT_TABLE(dfa); in aa_dfa_outofband_transition() local
597 state = next[pos]; in aa_dfa_match_until()
608 state = next[pos]; in aa_dfa_match_until()
659 state = next[pos]; in aa_dfa_matchn_until()
670 state = next[pos]; in aa_dfa_matchn_until()
743 state = next[pos]; in leftmatch_fb()
[all …]
|
| A D | lib.c | 66 const char *next; in aa_parse_debug_params() local
72 next = str + n; in aa_parse_debug_params()
73 ent = val_table_find_ent(debug_values_table, str, next - str); in aa_parse_debug_params()
78 (int)(next - str), str); in aa_parse_debug_params()
79 str = next + 1; in aa_parse_debug_params()
80 } while (*next != 0); in aa_parse_debug_params()
|
| A D | procattr.c | 126 char *next = hat + strlen(hat) + 1; in aa_setprocattr_changehat() local
131 hat = next; in aa_setprocattr_changehat()
|
| A D | domain.c | 145 goto next; in label_compound_match()
152 next: in label_compound_match()
209 goto next; in label_components_match()
215 next: in label_components_match()
524 const char *next; in x_table_lookup() local
532 for (next = rules->file->trans.table[index]; next; in x_table_lookup()
533 next = next_name(xtype, next)) { in x_table_lookup()
534 const char *lookup = (*next == '&') ? next + 1 : next; in x_table_lookup()
535 *name = next; in x_table_lookup()
|
| A D | label.c | 1046 struct aa_profile *next; in label_merge_insert() local
1059 label_for_each_in_merge(i, a, b, next) { in label_merge_insert()
1060 AA_BUG(!next); in label_merge_insert()
1061 if (profile_is_stale(next)) { in label_merge_insert()
1062 new->vec[k] = aa_get_newest_profile(next); in label_merge_insert()
1065 if (next->label.proxy != new->vec[k]->label.proxy) in label_merge_insert()
1070 new->vec[k++] = aa_get_profile(next); in label_merge_insert()
1303 goto next; in label_compound_match()
1310 next: in label_compound_match()
1365 goto next; in label_components_match()
[all …]
|
| A D | apparmorfs.c | 2096 struct aa_ns *parent, *next; in __next_ns() local
2105 mutex_lock_nested(&next->lock, next->level); in __next_ns()
2106 return next; in __next_ns()
2113 next = list_next_entry(ns, base.list); in __next_ns()
2114 if (!list_entry_is_head(next, &parent->sub_ns, base.list)) { in __next_ns()
2115 mutex_lock_nested(&next->lock, next->level); in __next_ns()
2116 return next; in __next_ns()
2198 struct aa_profile *next = __next_profile(profile); in next_profile() local
2199 if (next) in next_profile()
2200 return next; in next_profile()
[all …]
|
| /security/ipe/ |
| A D | policy_parser.c | 223 list_for_each_entry_safe(p, t, &r->props, next) { in free_rule()
224 list_del(&p->next); in free_rule()
342 list_add_tail(&p->next, &r->props); in parse_property()
380 INIT_LIST_HEAD(&r->next); in parse_rule()
435 list_add_tail(&r->next, &p->rules[op].rules); in parse_rule()
458 list_for_each_entry_safe(pp, t, &p->rules[i].rules, next) { in ipe_free_parsed_policy()
459 list_del(&pp->next); in ipe_free_parsed_policy()
|
| A D | policy.h | 48 struct list_head next; member
57 struct list_head next; member
|
| A D | eval.c | 347 list_for_each_entry(rule, &rules->rules, next) { in ipe_evaluate_event()
350 list_for_each_entry(prop, &rule->props, next) { in ipe_evaluate_event()
|
| /security/smack/ |
| A D | smackfs.c | 617 .next = load2_seq_next,
785 .next = cipso_seq_next,
985 .next = cipso_seq_next,
1061 .next = net4addr_seq_next,
1323 .next = net6addr_seq_next,
1886 .next = onlycap_seq_next,
1914 first = public->next; in smk_list_swap_rcu()
1920 rcu_assign_pointer(public->next, private->next); in smk_list_swap_rcu()
1927 private->next = first; in smk_list_swap_rcu()
1930 last->next = private; in smk_list_swap_rcu()
[all …]
|
| /security/safesetid/ |
| A 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()
|
| A D | lsm.h | 45 struct hlist_node next; member
|
| A D | lsm.c | 40 hash_for_each_possible(policy->rules, rule, next, __kuid_val(src.uid)) { in _setid_policy_lookup()
48 hash_for_each_possible(policy->rules, rule, next, __kgid_val(src.gid)) { in _setid_policy_lookup()
|
| /security/integrity/ima/ |
| A D | ima_fs.c | 102 qe = list_entry_rcu(qe->later.next, struct ima_queue_entry, later); in ima_measurements_next()
200 .next = ima_measurements_next,
275 .next = ima_measurements_next,
389 .next = ima_policy_next,
|
| /security/keys/ |
| A D | proc.c | 23 .next = proc_keys_next,
35 .next = proc_key_users_next,
|
| /security/landlock/ |
| A D | ruleset.c | 477 struct landlock_rule *freeme, *next; in free_ruleset() local
480 rbtree_postorder_for_each_entry_safe(freeme, next, &ruleset->root_inode, in free_ruleset()
485 rbtree_postorder_for_each_entry_safe(freeme, next, in free_ruleset()
|