17 	struct list_head list;  member
32 		struct list_head list;  member
84 		INIT_LIST_HEAD(&tree->list);  in alloc_tree()
154 		INIT_LIST_HEAD(&chunk->owners[i].list);  in alloc_chunk()
176 	struct list_head *list;  in insert_hash()  local
180 	list = chunk_hash(entry->inode);  in insert_hash()
181 	list_add_rcu(&chunk->hash, list);  in insert_hash()
187 	struct list_head *list = chunk_hash(inode);  in audit_tree_lookup()  local
190 	list_for_each_entry_rcu(p, list, hash) {  in audit_tree_lookup()
250 		list_del_init(&p->list);  in untag_chunk()
278 			list_del_init(&p->list);  in untag_chunk()
288 		list_replace_init(&chunk->owners[j].list, &new->owners[i].list);  in untag_chunk()
307 	list_del_init(&p->list);  in untag_chunk()
343 	list_add(&chunk->owners[0].list, &tree->chunks);  in create_chunk()
431 		list_replace_init(&old->owners[n].list, &p->list);  in tag_chunk()
436 	list_add(&p->list, &tree->chunks);  in tag_chunk()
483 			list_del_rcu(&entry->list);  in kill_rules()
484 			list_del(&entry->rule.list);  in kill_rules()
499 		p = list_entry(victim->chunks.next, struct node, list);  in prune_one()
519 		struct node *node = list_entry(p, struct node, list);  in trim_marked()
530 		node = list_entry(tree->chunks.next, struct node, list);  in trim_marked()
543 		list_del_init(&tree->list);  in trim_marked()
565 			list_move(&tree->list, &prune_list);  in audit_remove_tree_rule()
596 		tree = container_of(cursor.next, struct audit_tree, list);  in audit_trim_trees()
599 		list_add(&cursor, &tree->list);  in audit_trim_trees()
612 		list_for_each_entry(node, &tree->chunks, list) {  in audit_trim_trees()
674 					struct audit_tree, list);  in prune_tree_thread()
675 			list_del_init(&victim->list);  in prune_tree_thread()
715 	list_for_each_entry(tree, &tree_list, list) {  in audit_add_tree_rule()
724 	list_add(&tree->list, &tree_list);  in audit_add_tree_rule()
752 		list_for_each_entry(node, &tree->chunks, list)  in audit_add_tree_rule()
771 	list_del_init(&tree->list);  in audit_add_tree_rule()
807 		tree = container_of(cursor.next, struct audit_tree, list);  in audit_tag_tree()
810 		list_add(&cursor, &tree->list);  in audit_tag_tree()
835 			list_del(&tree->list);  in audit_tag_tree()
836 			list_add(&tree->list, &tree_list);  in audit_tag_tree()
845 		tree = container_of(barrier.prev, struct audit_tree, list);  in audit_tag_tree()
847 		list_del(&tree->list);  in audit_tag_tree()
848 		list_add(&tree->list, &barrier);  in audit_tag_tree()
854 			list_for_each_entry(node, &tree->chunks, list)  in audit_tag_tree()
882 void audit_kill_trees(struct list_head *list)  in audit_kill_trees()  argument
887 	while (!list_empty(list)) {  in audit_kill_trees()
890 		victim = list_entry(list->next, struct audit_tree, list);  in audit_kill_trees()
892 		list_del_init(&victim->list);  in audit_kill_trees()
931 			list_move(&owner->list, &prune_list);  in evict_chunk()
934 			list_move(&owner->list, postponed);  in evict_chunk()
940 		list_del_init(&chunk->owners[n].list);  in evict_chunk()