Lines Matching refs:list
45 struct list_head list; member
82 struct list_head list[2]; member
218 struct backref_node, list); in backref_cache_cleanup()
245 INIT_LIST_HEAD(&node->list); in alloc_backref_node()
349 struct backref_edge, list[LOWER]); in walk_up_backref()
371 if (list_is_last(&edge->list[LOWER], &lower->upper)) { in walk_down_backref()
375 edge = list_entry(edge->list[LOWER].next, in walk_down_backref()
376 struct backref_edge, list[LOWER]); in walk_down_backref()
408 list_del(&node->list); in drop_backref_node()
430 list[LOWER]); in remove_backref_node()
432 list_del(&edge->list[LOWER]); in remove_backref_node()
433 list_del(&edge->list[UPPER]); in remove_backref_node()
491 struct backref_node, list); in update_backref_cache()
497 struct backref_node, list); in update_backref_cache()
498 list_del_init(&node->list); in update_backref_cache()
508 list_for_each_entry(node, &cache->pending[level], list) { in update_backref_cache()
701 LIST_HEAD(list); /* Pending edge list, upper node needs to be checked */ in build_backref_tree()
755 list[LOWER]); in build_backref_tree()
756 ASSERT(list_empty(&edge->list[UPPER])); in build_backref_tree()
763 list_add_tail(&edge->list[UPPER], &list); in build_backref_tree()
862 list_add_tail(&edge->list[UPPER], &list); in build_backref_tree()
867 INIT_LIST_HEAD(&edge->list[UPPER]); in build_backref_tree()
869 list_add_tail(&edge->list[LOWER], &cur->upper); in build_backref_tree()
903 list_add(&cur->list, &useless); in build_backref_tree()
945 list_add(&lower->list, &useless); in build_backref_tree()
990 list_add_tail(&edge->list[UPPER], in build_backref_tree()
991 &list); in build_backref_tree()
995 INIT_LIST_HEAD(&edge->list[UPPER]); in build_backref_tree()
1001 INIT_LIST_HEAD(&edge->list[UPPER]); in build_backref_tree()
1005 list_add_tail(&edge->list[LOWER], &lower->upper); in build_backref_tree()
1033 if (!list_empty(&list)) { in build_backref_tree()
1034 edge = list_entry(list.next, struct backref_edge, list[UPPER]); in build_backref_tree()
1035 list_del_init(&edge->list[UPPER]); in build_backref_tree()
1054 list_for_each_entry(edge, &node->upper, list[LOWER]) in build_backref_tree()
1055 list_add_tail(&edge->list[UPPER], &list); in build_backref_tree()
1057 while (!list_empty(&list)) { in build_backref_tree()
1058 edge = list_entry(list.next, struct backref_edge, list[UPPER]); in build_backref_tree()
1059 list_del_init(&edge->list[UPPER]); in build_backref_tree()
1062 list_del(&edge->list[LOWER]); in build_backref_tree()
1066 list_add(&lower->list, &useless); in build_backref_tree()
1076 list_add_tail(&edge->list[UPPER], &upper->lower); in build_backref_tree()
1103 list_add_tail(&edge->list[UPPER], &upper->lower); in build_backref_tree()
1105 list_for_each_entry(edge, &upper->upper, list[LOWER]) in build_backref_tree()
1106 list_add_tail(&edge->list[UPPER], &list); in build_backref_tree()
1115 upper = list_entry(useless.next, struct backref_node, list); in build_backref_tree()
1116 list_del_init(&upper->list); in build_backref_tree()
1126 struct backref_edge, list[UPPER]); in build_backref_tree()
1127 list_del(&edge->list[UPPER]); in build_backref_tree()
1128 list_del(&edge->list[LOWER]); in build_backref_tree()
1133 list_add(&lower->list, &useless); in build_backref_tree()
1137 list_add(&upper->list, &cache->detached); in build_backref_tree()
1150 struct backref_node, list); in build_backref_tree()
1151 list_del_init(&lower->list); in build_backref_tree()
1153 while (!list_empty(&list)) { in build_backref_tree()
1154 edge = list_first_entry(&list, struct backref_edge, in build_backref_tree()
1155 list[UPPER]); in build_backref_tree()
1156 list_del(&edge->list[UPPER]); in build_backref_tree()
1157 list_del(&edge->list[LOWER]); in build_backref_tree()
1168 list_add(&lower->list, &useless); in build_backref_tree()
1174 list_for_each_entry(edge, &upper->upper, list[LOWER]) in build_backref_tree()
1175 list_add_tail(&edge->list[UPPER], &list); in build_backref_tree()
1177 list_add(&upper->list, &useless); in build_backref_tree()
1182 struct backref_node, list); in build_backref_tree()
1183 list_del_init(&lower->list); in build_backref_tree()
1250 list_for_each_entry(edge, &node->lower, list[UPPER]) { in clone_backref_node()
1257 list_add_tail(&new_edge->list[UPPER], in clone_backref_node()
1270 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { in clone_backref_node()
1271 list_add_tail(&new_edge->list[LOWER], in clone_backref_node()
1279 struct backref_edge, list[UPPER]); in clone_backref_node()
1280 list_del(&new_edge->list[UPPER]); in clone_backref_node()
2484 void free_reloc_roots(struct list_head *list) in free_reloc_roots() argument
2488 while (!list_empty(list)) { in free_reloc_roots()
2489 reloc_root = list_entry(list->next, struct btrfs_root, in free_reloc_roots()
2623 BUG_ON(!list_empty(&next->list)); in select_reloc_root()
2626 list_add_tail(&next->list, in select_reloc_root()
2719 struct backref_edge, list[LOWER]); in calcu_metadata_size()
2799 list_for_each_entry(edge, &node->upper, list[LOWER]) { in do_relocation()
2930 list_move_tail(&node->list, &rc->backref_cache.changed); in do_relocation()
2954 LIST_HEAD(list); in finish_pending_nodes()
2963 struct backref_node, list); in finish_pending_nodes()
2964 list_move_tail(&node->list, &list); in finish_pending_nodes()
2973 list_splice_init(&list, &cache->pending[level]); in finish_pending_nodes()
3021 struct backref_edge, list[LOWER]); in update_processed_blocks()
3093 BUG_ON(!list_empty(&node->list)); in relocate_tree_block()
3098 list_add_tail(&node->list, &rc->backref_cache.changed); in relocate_tree_block()
4659 LIST_HEAD(list); in btrfs_reloc_clone_csums()
4666 disk_bytenr + len - 1, &list, 0); in btrfs_reloc_clone_csums()
4670 while (!list_empty(&list)) { in btrfs_reloc_clone_csums()
4671 sums = list_entry(list.next, struct btrfs_ordered_sum, list); in btrfs_reloc_clone_csums()
4672 list_del_init(&sums->list); in btrfs_reloc_clone_csums()
4738 list_move_tail(&node->list, in btrfs_reloc_cow_block()