fs/btrfs/backref.c

2608 		upper = edge->node[UPPER];
2610 		list_del(&edge->list[UPPER]);
2720 		list_add_tail(&edge->list[UPPER], &cache->pending_edge);
2725 		INIT_LIST_HEAD(&edge->list[UPPER]);
2869 				list_add_tail(&edge->list[UPPER],
2874 				INIT_LIST_HEAD(&edge->list[UPPER]);
2880 			INIT_LIST_HEAD(&edge->list[UPPER]);
2946 		ASSERT(list_empty(&edge->list[UPPER]));
2947 		exist = edge->node[UPPER];
2953 			list_add_tail(&edge->list[UPPER], &cache->pending_edge);
3061 		list_add_tail(&edge->list[UPPER], &pending_edge);
3068 				struct btrfs_backref_edge, list[UPPER]);
3069 		list_del_init(&edge->list[UPPER]);
3070 		upper = edge->node[UPPER];
3097 			list_add_tail(&edge->list[UPPER], &upper->lower);
3124 		list_add_tail(&edge->list[UPPER], &upper->lower);
3131 			list_add_tail(&edge->list[UPPER], &pending_edge);
3150 				struct btrfs_backref_edge, list[UPPER]);
3151 		list_del(&edge->list[UPPER]);
3154 		upper = edge->node[UPPER];
3170 			list_add_tail(&edge->list[UPPER],