56 	struct list_head list;  member
93 	struct list_head list[2];  member
227 				  struct backref_node, list);  in backref_cache_cleanup()
254 		INIT_LIST_HEAD(&node->list);  in alloc_backref_node()
358 				  struct backref_edge, list[LOWER]);  in walk_up_backref()
380 		if (list_is_last(&edge->list[LOWER], &lower->upper)) {  in walk_down_backref()
384 		edge = list_entry(edge->list[LOWER].next,  in walk_down_backref()
385 				  struct backref_edge, list[LOWER]);  in walk_down_backref()
417 	list_del(&node->list);  in drop_backref_node()
439 				  list[LOWER]);  in remove_backref_node()
441 		list_del(&edge->list[LOWER]);  in remove_backref_node()
442 		list_del(&edge->list[UPPER]);  in remove_backref_node()
500 				  struct backref_node, list);  in update_backref_cache()
506 				  struct backref_node, list);  in update_backref_cache()
507 		list_del_init(&node->list);  in update_backref_cache()
517 		list_for_each_entry(node, &cache->pending[level], list) {  in update_backref_cache()
702 	LIST_HEAD(list);
756 				  list[LOWER]);
757 		ASSERT(list_empty(&edge->list[UPPER]));
764 			list_add_tail(&edge->list[UPPER], &list);
839 						list_add(&cur->list, &useless);
880 				list_add_tail(&edge->list[UPPER], &list);
885 				INIT_LIST_HEAD(&edge->list[UPPER]);
887 			list_add_tail(&edge->list[LOWER], &cur->upper);
911 				list_add(&cur->list, &useless);
953 					list_add(&lower->list, &useless);
998 					list_add_tail(&edge->list[UPPER],
999 						      &list);
1003 					INIT_LIST_HEAD(&edge->list[UPPER]);
1009 				INIT_LIST_HEAD(&edge->list[UPPER]);
1013 			list_add_tail(&edge->list[LOWER], &lower->upper);
1041 	if (!list_empty(&list)) {
1042 		edge = list_entry(list.next, struct backref_edge, list[UPPER]);
1043 		list_del_init(&edge->list[UPPER]);
1062 	list_for_each_entry(edge, &node->upper, list[LOWER])
1063 		list_add_tail(&edge->list[UPPER], &list);
1065 	while (!list_empty(&list)) {
1066 		edge = list_entry(list.next, struct backref_edge, list[UPPER]);
1067 		list_del_init(&edge->list[UPPER]);
1070 			list_del(&edge->list[LOWER]);
1074 				list_add(&lower->list, &useless);
1084 			list_add_tail(&edge->list[UPPER], &upper->lower);
1111 		list_add_tail(&edge->list[UPPER], &upper->lower);
1113 		list_for_each_entry(edge, &upper->upper, list[LOWER])
1114 			list_add_tail(&edge->list[UPPER], &list);
1123 		upper = list_entry(useless.next, struct backref_node, list);
1124 		list_del_init(&upper->list);
1134 					  struct backref_edge, list[UPPER]);
1135 			list_del(&edge->list[UPPER]);
1136 			list_del(&edge->list[LOWER]);
1141 				list_add(&lower->list, &useless);
1145 			list_add(&upper->list, &cache->detached);
1158 					   struct backref_node, list);
1159 			list_del_init(&lower->list);
1161 		while (!list_empty(&list)) {
1162 			edge = list_first_entry(&list, struct backref_edge,
1163 						list[UPPER]);
1164 			list_del(&edge->list[UPPER]);
1165 			list_del(&edge->list[LOWER]);
1176 				list_add(&lower->list, &useless);
1182 			list_for_each_entry(edge, &upper->upper, list[LOWER])
1183 				list_add_tail(&edge->list[UPPER], &list);
1185 				list_add(&upper->list, &useless);
1190 					   struct backref_node, list);
1191 			list_del_init(&lower->list);
1258 		list_for_each_entry(edge, &node->lower, list[UPPER]) {
1265 			list_add_tail(&new_edge->list[UPPER],
1278 		list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {
1279 			list_add_tail(&new_edge->list[LOWER],
1287 				      struct backref_edge, list[UPPER]);
1288 		list_del(&new_edge->list[UPPER]);
2397 void free_reloc_roots(struct list_head *list)  argument
2401 	while (!list_empty(list)) {
2402 		reloc_root = list_entry(list->next, struct btrfs_root,
2541 			BUG_ON(!list_empty(&next->list));
2544 			list_add_tail(&next->list,
2637 					  struct backref_edge, list[LOWER]);
2717 	list_for_each_entry(edge, &node->upper, list[LOWER]) {
2833 		list_move_tail(&node->list, &rc->backref_cache.changed);
2857 	LIST_HEAD(list);
2866 					  struct backref_node, list);
2867 			list_move_tail(&node->list, &list);
2876 		list_splice_init(&list, &cache->pending[level]);
2924 					  struct backref_edge, list[LOWER]);
2996 			BUG_ON(!list_empty(&node->list));
3001 			list_add_tail(&node->list, &rc->backref_cache.changed);
4646 	LIST_HEAD(list);
4653 				       disk_bytenr + len - 1, &list, 0);
4657 	while (!list_empty(&list)) {
4658 		sums = list_entry(list.next, struct btrfs_ordered_sum, list);
4659 		list_del_init(&sums->list);
4725 			list_move_tail(&node->list,