Lines Matching refs:owners
35 } owners[];
53 * tree.chunks anchors chunk.owners[].list hash_lock
119 if (chunk->owners[i].owner)
120 put_tree(chunk->owners[i].owner);
149 size = offsetof(struct audit_chunk, owners) + count * sizeof(struct node);
159 INIT_LIST_HEAD(&chunk->owners[i].list);
160 chunk->owners[i].index = i;
208 if (chunk->owners[n].owner == tree)
219 return container_of(p, struct audit_chunk, owners[0]);
277 if (&chunk->owners[j] == p) {
282 s = chunk->owners[j].owner;
283 new->owners[i].owner = s;
284 new->owners[i].index = chunk->owners[j].index - j + i;
288 list_replace_init(&chunk->owners[j].list, &new->owners[i].list);
340 chunk->owners[0].index = (1U << 31);
341 chunk->owners[0].owner = tree;
343 list_add(&chunk->owners[0].list, &tree->chunks);
372 if (old->owners[n].owner == tree) {
423 for (n = 0, p = chunk->owners; n < old->count; n++, p++) {
424 struct audit_tree *s = old->owners[n].owner;
426 p->index = old->owners[n].index;
430 list_replace_init(&old->owners[n].list, &p->list);
899 list_del_init(&chunk->owners[n].list);