229 	struct btrfs_backref_node *node[2];  member
286 	edge->node[LOWER] = lower;  in btrfs_backref_link_edge()
287 	edge->node[UPPER] = upper;  in btrfs_backref_link_edge()
295 					   struct btrfs_backref_node *node)  in btrfs_backref_free_node()  argument
297 	if (node) {  in btrfs_backref_free_node()
298 		ASSERT(list_empty(&node->list));  in btrfs_backref_free_node()
299 		ASSERT(list_empty(&node->lower));  in btrfs_backref_free_node()
300 		ASSERT(node->eb == NULL);  in btrfs_backref_free_node()
302 		btrfs_put_root(node->root);  in btrfs_backref_free_node()
303 		kfree(node);  in btrfs_backref_free_node()
317 		struct btrfs_backref_node *node)  in btrfs_backref_unlock_node_buffer()  argument
319 	if (node->locked) {  in btrfs_backref_unlock_node_buffer()
320 		btrfs_tree_unlock(node->eb);  in btrfs_backref_unlock_node_buffer()
321 		node->locked = 0;  in btrfs_backref_unlock_node_buffer()
326 		struct btrfs_backref_node *node)  in btrfs_backref_drop_node_buffer()  argument
328 	if (node->eb) {  in btrfs_backref_drop_node_buffer()
329 		btrfs_backref_unlock_node_buffer(node);  in btrfs_backref_drop_node_buffer()
330 		free_extent_buffer(node->eb);  in btrfs_backref_drop_node_buffer()
331 		node->eb = NULL;  in btrfs_backref_drop_node_buffer()
343 					   struct btrfs_backref_node *node)  in btrfs_backref_drop_node()  argument
345 	ASSERT(list_empty(&node->upper));  in btrfs_backref_drop_node()
347 	btrfs_backref_drop_node_buffer(node);  in btrfs_backref_drop_node()
348 	list_del_init(&node->list);  in btrfs_backref_drop_node()
349 	list_del_init(&node->lower);  in btrfs_backref_drop_node()
350 	if (!RB_EMPTY_NODE(&node->rb_node))  in btrfs_backref_drop_node()
351 		rb_erase(&node->rb_node, &tree->rb_root);  in btrfs_backref_drop_node()
352 	btrfs_backref_free_node(tree, node);  in btrfs_backref_drop_node()
356 				struct btrfs_backref_node *node);
378 				 struct btrfs_backref_node *node);