Lines Matching refs:parent
200 if (ref1->parent < ref2->parent)
202 if (ref1->parent > ref2->parent)
232 struct rb_node *parent = NULL;
241 parent = *p;
242 ref = rb_entry(parent, struct prelim_ref, rbnode);
278 rb_link_node(&newref->rbnode, parent, p);
302 * - obtaining the parent is the goal
304 * - if you cannot add the parent or a correct key, then we will look into the
312 * parent logical | y | - | - | -
317 * - column 1: we've the parent -> done
318 * - column 2, 3, 4: we use the key to find the parent
325 * parent logical | y | - | y | -
330 * - column 1, 3: we've the parent -> done
331 * - column 2: we take the first key from the block to find the parent
333 * - column 4: we use the key to find the parent
335 * additional information that's available but not required to find the parent
340 const struct btrfs_key *key, int level, u64 parent,
362 ref->parent = parent;
370 struct preftrees *preftrees, int level, u64 parent,
375 parent, wanted_disk_byte, count, sc, gfp_mask);
378 /* indirect refs use parent == 0 */
396 struct rb_node *parent = NULL;
401 target.parent = bytenr;
404 parent = *p;
405 ref = rb_entry(parent, struct prelim_ref, rbnode);
680 * New backrefs (i.e., for parent nodes) are added to the appropriate
711 if (WARN(ref->parent,
748 /* we put the first parent into the ref at hand */
751 ref->parent = node ? node->val : 0;
754 /* Add a prelim_ref(s) for any other parent(s). */
766 new_ref->parent = node->val;
805 BUG_ON(ref->parent); /* should not be a direct ref */
894 ref->parent, node->bytenr, count,
936 ret = add_direct_ref(fs_info, preftrees, 0, ref->parent,
1183 * indirect refs to their parent bytenr.
1357 if (roots && ref->count && ref->root_id && ref->parent == 0) {
1364 /* no parent == root of tree */
1369 if (ref->count && ref->parent) {
1374 eb = read_tree_block(fs_info, ref->parent, 0,
1404 ret = ulist_add_merge_ptr(refs, ref->parent,
1411 * We've recorded that parent, so we must extend
1712 struct extent_buffer *eb_in, u64 parent,
1738 ret = btrfs_find_item(fs_root, path, parent, 0,
1748 if (parent == next_inum)
1766 parent = next_inum;
2112 typedef int (iterate_irefs_t)(u64 parent, u32 name_len, unsigned long name_off,
2124 u64 parent = 0;
2133 parent ? parent + 1 : 0, BTRFS_INODE_REF_KEY,
2144 parent = found_key.offset;
2163 ret = iterate(parent, name_len,
2185 u64 parent;
2220 parent = btrfs_inode_extref_parent(eb, extref);
2222 ret = iterate(parent, name_len,
2666 * Direct tree backref means, the backref item shows its parent bytenr
2780 * completely relying on direct backref (key->offset is parent
2794 /* Search the tree to find parent blocks referring to the block */
3003 /* SHARED_BLOCK_REF means key.offset is the parent bytenr */
3021 * its parent bytenr.
3111 /* Sanity check, COW-only node has non-COW-only parent */
3131 * Also queue all the parent edges of this uncached node