14 	refcount_t count;  member
30 	int count;  member
99 		refcount_set(&tree->count, 1);  in alloc_tree()
113 	refcount_inc(&tree->count);  in get_tree()
118 	if (refcount_dec_and_test(&tree->count))  in put_tree()
132 	for (i = 0; i < chunk->count; i++) {  in free_chunk()
188 static struct audit_chunk *alloc_chunk(int count)  in alloc_chunk()  argument
194 	size = offsetof(struct audit_chunk, owners) + count * sizeof(struct node);  in alloc_chunk()
201 	chunk->count = count;  in alloc_chunk()
203 	for (i = 0; i < count; i++) {  in alloc_chunk()
266 	for (n = 0; n < chunk->count; n++)  in audit_tree_match()
304 	for (i = j = 0; j < old->count; i++, j++) {  in replace_chunk()
345 	for (i = 0; i < chunk->count; i++)  in chunk_count_trees()
480 	for (n = 0; n < old->count; n++) {  in tag_chunk()
490 	chunk = alloc_chunk(old->count + 1);  in tag_chunk()
505 	p = &chunk->owners[chunk->count - 1];  in tag_chunk()
506 	p->index = (chunk->count - 1) | (1U<<31);  in tag_chunk()
1032 	for (n = 0; n < chunk->count; n++)  in evict_chunk()