Lines Matching refs:node
350 /* List of upper level edges, which link this node to its parents */
352 /* List of lower level edges, which link this node to its children */
355 /* NULL if this node is not tree root */
363 /* 1 if no child node is in the cache */
376 /* 1 if the backref node isn't connected to any other backref node */
395 * node, and list[UPPER] is linked to btrfs_backref_node::lower of
396 * upper level node.
404 struct btrfs_backref_node *node[2];
417 /* List of backref nodes with no child node */
421 /* List of detached backref node. */
461 edge->node[LOWER] = lower;
462 edge->node[UPPER] = upper;
470 struct btrfs_backref_node *node)
472 if (node) {
473 ASSERT(list_empty(&node->list));
474 ASSERT(list_empty(&node->lower));
475 ASSERT(node->eb == NULL);
477 btrfs_put_root(node->root);
478 kfree(node);
492 struct btrfs_backref_node *node)
494 if (node->locked) {
495 btrfs_tree_unlock(node->eb);
496 node->locked = 0;
501 struct btrfs_backref_node *node)
503 if (node->eb) {
504 btrfs_backref_unlock_node_buffer(node);
505 free_extent_buffer(node->eb);
506 node->eb = NULL;
511 * Drop the backref node from cache without cleaning up its children
514 * This can only be called on node without parent edges.
518 struct btrfs_backref_node *node)
520 ASSERT(list_empty(&node->upper));
522 btrfs_backref_drop_node_buffer(node);
523 list_del_init(&node->list);
524 list_del_init(&node->lower);
525 if (!RB_EMPTY_NODE(&node->rb_node))
526 rb_erase(&node->rb_node, &tree->rb_root);
527 btrfs_backref_free_node(tree, node);
531 struct btrfs_backref_node *node);
554 struct btrfs_backref_node *node);