352 	/* List of lower level edges, which link this node to its children */
353 	struct list_head lower;  member
386 #define LOWER	0  macro
390  * Represent an edge connecting upper and lower backref nodes.
394 	 * list[LOWER] is linked to btrfs_backref_node::upper of lower level
395 	 * node, and list[UPPER] is linked to btrfs_backref_node::lower of
456 					   struct btrfs_backref_node *lower,  in btrfs_backref_link_edge()  argument
460 	ASSERT(upper && lower && upper->level == lower->level + 1);  in btrfs_backref_link_edge()
461 	edge->node[LOWER] = lower;  in btrfs_backref_link_edge()
464 		list_add_tail(&edge->list[LOWER], &lower->upper);  in btrfs_backref_link_edge()
466 		list_add_tail(&edge->list[UPPER], &upper->lower);  in btrfs_backref_link_edge()
474 		ASSERT(list_empty(&node->lower));  in btrfs_backref_free_node()
524 	list_del_init(&node->lower);  in btrfs_backref_drop_node()