Searched refs:trees (Results 1 – 2 of 2) sorted by relevance
| /kernel/ |
| D | audit_tree.c | 24 struct list_head trees; /* with root here */ member
124 INIT_LIST_HEAD(&chunk->trees); in alloc_chunk()
251 list_del_init(&chunk->trees); in untag_chunk()
273 list_replace_init(&chunk->trees, &new->trees); in untag_chunk()
296 list_for_each_entry(owner, &new->trees, same_root) in untag_chunk()
348 list_add(&tree->same_root, &chunk->trees); in create_chunk()
400 list_replace_init(&old->trees, &chunk->trees); in tag_chunk()
415 list_for_each_entry(owner, &chunk->trees, same_root) in tag_chunk()
420 list_add(&tree->same_root, &chunk->trees); in tag_chunk()
866 while (!list_empty(&chunk->trees)) { in evict_chunk()
[all …]
|
| D | auditsc.c | 199 struct audit_tree_refs *trees, *first_trees; member
333 struct audit_tree_refs *p = ctx->trees; in put_tree_ref()
345 ctx->trees = p; in put_tree_ref()
354 struct audit_tree_refs *p = ctx->trees; in grow_tree_refs()
355 ctx->trees = kzalloc(sizeof(struct audit_tree_refs), GFP_KERNEL); in grow_tree_refs()
356 if (!ctx->trees) { in grow_tree_refs()
357 ctx->trees = p; in grow_tree_refs()
361 p->next = ctx->trees; in grow_tree_refs()
363 ctx->first_trees = ctx->trees; in grow_tree_refs()
384 for (q = p; q != ctx->trees; q = q->next, n = 31) { in unroll_tree_refs()
[all …]
|