Lines Matching refs:parent

248 	if (ref1->parent < ref2->parent)
250 if (ref1->parent > ref2->parent)
285 struct rb_node *parent = NULL;
294 parent = *p;
295 ref = rb_entry(parent, struct prelim_ref, rbnode);
331 rb_link_node(&newref->rbnode, parent, p);
355 * - obtaining the parent is the goal
357 * - if you cannot add the parent or a correct key, then we will look into the
365 * parent logical | y | - | - | -
370 * - column 1: we've the parent -> done
371 * - column 2, 3, 4: we use the key to find the parent
378 * parent logical | y | - | y | -
383 * - column 1, 3: we've the parent -> done
384 * - column 2: we take the first key from the block to find the parent
386 * - column 4: we use the key to find the parent
388 * additional information that's available but not required to find the parent
393 const struct btrfs_key *key, int level, u64 parent,
415 ref->parent = parent;
423 struct preftrees *preftrees, int level, u64 parent,
428 parent, wanted_disk_byte, count, sc, gfp_mask);
431 /* indirect refs use parent == 0 */
449 struct rb_node *parent = NULL;
454 target.parent = bytenr;
457 parent = *p;
458 ref = rb_entry(parent, struct prelim_ref, rbnode);
731 * New backrefs (i.e., for parent nodes) are added to the appropriate
761 if (WARN(ref->parent,
795 /* we put the first parent into the ref at hand */
798 ref->parent = node ? node->val : 0;
801 /* Add a prelim_ref(s) for any other parent(s). */
813 new_ref->parent = node->val;
854 BUG_ON(ref->parent); /* should not be a direct ref */
947 ref->parent, node->bytenr, count,
989 ret = add_direct_ref(fs_info, preftrees, 0, ref->parent,
1376 * indirect refs to their parent bytenr.
1509 * its parent node, in case we are dealing with a metadata extent, or
1603 if (ctx->roots && ref->count && ref->root_id && ref->parent == 0) {
1604 /* no parent == root of tree */
1609 if (ref->count && ref->parent) {
1617 eb = read_tree_block(ctx->fs_info, ref->parent,
1646 ret = ulist_add_merge_ptr(ctx->refs, ref->parent,
1653 * We've recorded that parent, so we must extend
2133 struct extent_buffer *eb_in, u64 parent,
2157 ret = btrfs_find_item(fs_root, path, parent, 0,
2167 if (parent == next_inum)
2183 parent = next_inum;
2588 u64 parent = 0;
2598 parent ? parent + 1 : 0, BTRFS_INODE_REF_KEY,
2609 parent = found_key.offset;
2627 ret = inode_to_path(parent, name_len,
2647 u64 parent;
2684 parent = btrfs_inode_extref_parent(eb, extref);
2686 ret = inode_to_path(parent, name_len,
3123 * Direct tree backref means, the backref item shows its parent bytenr
3239 * completely relying on direct backref (key->offset is parent
3253 /* Search the tree to find parent blocks referring to the block */
3463 /* SHARED_BLOCK_REF means key.offset is the parent bytenr */
3472 * the tree to get its parent bytenr.
3567 /* Sanity check, COW-only node has non-COW-only parent */
3587 * Also queue all the parent edges of this uncached node