Home
last modified time | relevance | path

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

/kernel/
Daudit_tree.c29 struct list_head trees; /* with root here */ member
198 INIT_LIST_HEAD(&chunk->trees); in alloc_chunk()
299 list_splice_init(&old->trees, &new->trees); in replace_chunk()
300 list_for_each_entry(owner, &new->trees, same_root) in replace_chunk()
366 list_del_init(&chunk->trees); in untag_chunk()
438 list_add(&tree->same_root, &chunk->trees); in create_chunk()
510 list_add(&tree->same_root, &chunk->trees); in tag_chunk()
1010 while (!list_empty(&chunk->trees)) { in evict_chunk()
1011 owner = list_entry(chunk->trees.next, in evict_chunk()
Dauditsc.c231 struct audit_tree_refs *p = ctx->trees; in put_tree_ref()
244 ctx->trees = p; in put_tree_ref()
253 struct audit_tree_refs *p = ctx->trees; in grow_tree_refs()
255 ctx->trees = kzalloc(sizeof(struct audit_tree_refs), GFP_KERNEL); in grow_tree_refs()
256 if (!ctx->trees) { in grow_tree_refs()
257 ctx->trees = p; in grow_tree_refs()
261 p->next = ctx->trees; in grow_tree_refs()
263 ctx->first_trees = ctx->trees; in grow_tree_refs()
283 for (q = p; q != ctx->trees; q = q->next, n = 31) { in unroll_tree_refs()
293 ctx->trees = p; in unroll_tree_refs()
[all …]
Daudit.h149 struct audit_tree_refs *trees, *first_trees; member