• Home
  • Raw
  • Download

Lines Matching refs:list

15 	struct list_head list;  member
30 struct list_head list; member
81 INIT_LIST_HEAD(&tree->list); in alloc_tree()
128 INIT_LIST_HEAD(&chunk->owners[i].list); in alloc_chunk()
171 struct list_head *list = chunk_hash(chunk->watch.inode); in insert_hash() local
172 list_add_rcu(&chunk->hash, list); in insert_hash()
178 struct list_head *list = chunk_hash(inode); in audit_tree_lookup() local
181 list_for_each_entry_rcu(p, list, hash) { in audit_tree_lookup()
228 list_del_init(&p->list); in untag_chunk()
254 list_del_init(&p->list); in untag_chunk()
282 list_del_init(&p->list); in untag_chunk()
292 list_replace_init(&chunk->owners[i].list, &new->owners[j].list); in untag_chunk()
311 list_del_init(&p->list); in untag_chunk()
345 list_add(&chunk->owners[0].list, &tree->chunks); in create_chunk()
408 list_replace_init(&old->owners[n].list, &p->list); in tag_chunk()
413 list_add(&p->list, &tree->chunks); in tag_chunk()
452 list_del_rcu(&entry->list); in kill_rules()
453 list_del(&entry->rule.list); in kill_rules()
468 p = list_entry(victim->chunks.next, struct node, list); in prune_one()
488 struct node *node = list_entry(p, struct node, list); in trim_marked()
499 node = list_entry(tree->chunks.next, struct node, list); in trim_marked()
512 list_del_init(&tree->list); in trim_marked()
532 list_move(&tree->list, &prune_list); in audit_remove_tree_rule()
556 struct list_head list; in audit_trim_trees() local
559 tree = container_of(cursor.next, struct audit_tree, list); in audit_trim_trees()
562 list_add(&cursor, &tree->list); in audit_trim_trees()
574 list_add_tail(&list, &root_mnt->mnt_list); in audit_trim_trees()
576 list_for_each_entry(node, &tree->chunks, list) { in audit_trim_trees()
581 list_for_each_entry(mnt, &list, mnt_list) { in audit_trim_trees()
591 list_del_init(&list); in audit_trim_trees()
641 struct list_head list; in audit_add_tree_rule() local
644 list_for_each_entry(tree, &tree_list, list) { in audit_add_tree_rule()
653 list_add(&tree->list, &tree_list); in audit_add_tree_rule()
667 list_add_tail(&list, &mnt->mnt_list); in audit_add_tree_rule()
670 list_for_each_entry(p, &list, mnt_list) { in audit_add_tree_rule()
676 list_del(&list); in audit_add_tree_rule()
682 list_for_each_entry(node, &tree->chunks, list) in audit_add_tree_rule()
701 list_del_init(&tree->list); in audit_add_tree_rule()
713 struct list_head list; in audit_tag_tree() local
738 list_add_tail(&list, &tagged->mnt_list); in audit_tag_tree()
748 tree = container_of(cursor.next, struct audit_tree, list); in audit_tag_tree()
751 list_add(&cursor, &tree->list); in audit_tag_tree()
772 list_for_each_entry(p, &list, mnt_list) { in audit_tag_tree()
787 list_del(&tree->list); in audit_tag_tree()
788 list_add(&tree->list, &tree_list); in audit_tag_tree()
797 tree = container_of(barrier.prev, struct audit_tree, list); in audit_tag_tree()
799 list_del(&tree->list); in audit_tag_tree()
800 list_add(&tree->list, &barrier); in audit_tag_tree()
806 list_for_each_entry(node, &tree->chunks, list) in audit_tag_tree()
818 list_del(&list); in audit_tag_tree()
837 victim = list_entry(prune_list.next, struct audit_tree, list); in audit_prune_trees()
838 list_del_init(&victim->list); in audit_prune_trees()
874 list_move(&owner->list, &prune_list); in evict_chunk()
880 list_del_init(&chunk->owners[n].list); in evict_chunk()