Lines Matching refs:owners
35 } owners[]; member
114 if (chunk->owners[i].owner) in free_chunk()
115 put_tree(chunk->owners[i].owner); in free_chunk()
144 size = offsetof(struct audit_chunk, owners) + count * sizeof(struct node); in alloc_chunk()
154 INIT_LIST_HEAD(&chunk->owners[i].list); in alloc_chunk()
155 chunk->owners[i].index = i; in alloc_chunk()
204 if (chunk->owners[n].owner == tree) in audit_tree_match()
215 return container_of(p, struct audit_chunk, owners[0]); in find_chunk()
277 if (&chunk->owners[j] == p) { in untag_chunk()
282 s = chunk->owners[j].owner; in untag_chunk()
283 new->owners[i].owner = s; in untag_chunk()
284 new->owners[i].index = chunk->owners[j].index - j + i; in untag_chunk()
288 list_replace_init(&chunk->owners[j].list, &new->owners[i].list); in untag_chunk()
340 chunk->owners[0].index = (1U << 31); in create_chunk()
341 chunk->owners[0].owner = tree; in create_chunk()
343 list_add(&chunk->owners[0].list, &tree->chunks); in create_chunk()
373 if (old->owners[n].owner == tree) { in tag_chunk()
424 for (n = 0, p = chunk->owners; n < old->count; n++, p++) { in tag_chunk()
425 struct audit_tree *s = old->owners[n].owner; in tag_chunk()
427 p->index = old->owners[n].index; in tag_chunk()
431 list_replace_init(&old->owners[n].list, &p->list); in tag_chunk()
942 list_del_init(&chunk->owners[n].list); in evict_chunk()