Lines Matching refs:owners
37 } owners[]; member
133 if (chunk->owners[i].owner) in free_chunk()
134 put_tree(chunk->owners[i].owner); in free_chunk()
194 size = offsetof(struct audit_chunk, owners) + count * sizeof(struct node); in alloc_chunk()
204 INIT_LIST_HEAD(&chunk->owners[i].list); in alloc_chunk()
205 chunk->owners[i].index = i; in alloc_chunk()
267 if (chunk->owners[n].owner == tree) in audit_tree_match()
278 return container_of(p, struct audit_chunk, owners[0]); in find_chunk()
305 if (!old->owners[j].owner) { in replace_chunk()
309 owner = old->owners[j].owner; in replace_chunk()
310 new->owners[i].owner = owner; in replace_chunk()
311 new->owners[i].index = old->owners[j].index - j + i; in replace_chunk()
315 list_replace_init(&old->owners[j].list, &new->owners[i].list); in replace_chunk()
346 if (chunk->owners[i].owner) in chunk_count_trees()
434 chunk->owners[0].index = (1U << 31); in create_chunk()
435 chunk->owners[0].owner = tree; in create_chunk()
437 list_add(&chunk->owners[0].list, &tree->chunks); in create_chunk()
481 if (old->owners[n].owner == tree) { in tag_chunk()
505 p = &chunk->owners[chunk->count - 1]; in tag_chunk()
1033 list_del_init(&chunk->owners[n].list); in evict_chunk()