Home
last modified time | relevance | path

Searched refs:trees (Results 1 – 3 of 3) sorted by relevance

/kernel/
Daudit_tree.c26 struct list_head trees; /* with root here */ member
150 INIT_LIST_HEAD(&chunk->trees); in alloc_chunk()
247 list_del_init(&chunk->trees); in untag_chunk()
269 list_replace_init(&chunk->trees, &new->trees); in untag_chunk()
292 list_for_each_entry(owner, &new->trees, same_root) in untag_chunk()
346 list_add(&tree->same_root, &chunk->trees); in create_chunk()
423 list_replace_init(&old->trees, &chunk->trees); in tag_chunk()
438 list_for_each_entry(owner, &chunk->trees, same_root) in tag_chunk()
443 list_add(&tree->same_root, &chunk->trees); in tag_chunk()
922 while (!list_empty(&chunk->trees)) { in evict_chunk()
[all …]
Dauditsc.c213 struct audit_tree_refs *p = ctx->trees; in put_tree_ref()
225 ctx->trees = p; in put_tree_ref()
234 struct audit_tree_refs *p = ctx->trees; in grow_tree_refs()
235 ctx->trees = kzalloc(sizeof(struct audit_tree_refs), GFP_KERNEL); in grow_tree_refs()
236 if (!ctx->trees) { in grow_tree_refs()
237 ctx->trees = p; in grow_tree_refs()
241 p->next = ctx->trees; in grow_tree_refs()
243 ctx->first_trees = ctx->trees; in grow_tree_refs()
264 for (q = p; q != ctx->trees; q = q->next, n = 31) { in unroll_tree_refs()
274 ctx->trees = p; in unroll_tree_refs()
[all …]
Daudit.h151 struct audit_tree_refs *trees, *first_trees; member