fs/btrfs/backref.c

1002

int *info_level, struct preftrees *preftrees,

fs/btrfs/backref.c

1066

ret = add_direct_ref(ctx->fs_info, preftrees,

fs/btrfs/backref.c

1077

ret = add_direct_ref(ctx->fs_info, preftrees, 0, offset,

fs/btrfs/backref.c

1082

ret = add_indirect_ref(ctx->fs_info, preftrees, offset,

fs/btrfs/backref.c

1109

ret = add_indirect_ref(ctx->fs_info, preftrees,

fs/btrfs/backref.c

1136

int info_level, struct preftrees *preftrees,

fs/btrfs/backref.c

1168

ret = add_direct_ref(fs_info, preftrees,

fs/btrfs/backref.c

1180

ret = add_direct_ref(fs_info, preftrees, 0,

fs/btrfs/backref.c

1187

ret = add_indirect_ref(fs_info, preftrees, key.offset,

fs/btrfs/backref.c

1216

ret = add_indirect_ref(fs_info, preftrees, root,

fs/btrfs/backref.c

1385

struct preftrees preftrees = {

fs/btrfs/backref.c

1465

&preftrees, sc);

fs/btrfs/backref.c

1486

&preftrees, sc);

fs/btrfs/backref.c

1490

&preftrees, sc);

fs/btrfs/backref.c

1565

ret = add_missing_keys(ctx->fs_info, &preftrees, !path->skip_locking);

fs/btrfs/backref.c

1569

WARN_ON(!RB_EMPTY_ROOT(&preftrees.indirect_missing_keys.root.rb_root));

fs/btrfs/backref.c

1571

ret = resolve_indirect_refs(ctx, path, &preftrees, sc);

fs/btrfs/backref.c

1575

WARN_ON(!RB_EMPTY_ROOT(&preftrees.indirect.root.rb_root));

fs/btrfs/backref.c

1584

node = rb_first_cached(&preftrees.direct.root);

fs/btrfs/backref.c

1675

prelim_release(&preftrees.direct);

fs/btrfs/backref.c

1676

prelim_release(&preftrees.indirect);

fs/btrfs/backref.c

1677

prelim_release(&preftrees.indirect_missing_keys);

fs/btrfs/backref.c

419

struct preftrees *preftrees, int level, u64 parent,

fs/btrfs/backref.c

423

return add_prelim_ref(fs_info, &preftrees->direct, 0, NULL, level,

fs/btrfs/backref.c

429

struct preftrees *preftrees, u64 root_id,

fs/btrfs/backref.c

434

struct preftree *tree = &preftrees->indirect;

fs/btrfs/backref.c

437

tree = &preftrees->indirect_missing_keys;

fs/btrfs/backref.c

442

static int is_shared_data_backref(struct preftrees *preftrees, u64 bytenr)

fs/btrfs/backref.c

444

struct rb_node **p = &preftrees->direct.root.rb_root.rb_node;

fs/btrfs/backref.c

470

struct preftrees *preftrees, struct prelim_ref *ref,

fs/btrfs/backref.c

506

is_shared_data_backref(preftrees, eb->start) ||

fs/btrfs/backref.c

530

(is_shared_data_backref(preftrees, eb->start) ||

fs/btrfs/backref.c

592

struct preftrees *preftrees,

fs/btrfs/backref.c

685

ret = add_all_parents(ctx, root, path, parents, preftrees, ref, level);

fs/btrfs/backref.c

732

struct preftrees *preftrees,

fs/btrfs/backref.c

751

while ((rnode = rb_first_cached(&preftrees->indirect.root))) {

fs/btrfs/backref.c

762

rb_erase_cached(&ref->rbnode, &preftrees->indirect.root);

fs/btrfs/backref.c

763

preftrees->indirect.count--;

fs/btrfs/backref.c

775

ret2 = resolve_indirect_ref(ctx, path, preftrees, ref, parents);

fs/btrfs/backref.c

781

prelim_ref_insert(ctx->fs_info, &preftrees->direct, ref,

fs/btrfs/backref.c

810

prelim_ref_insert(ctx->fs_info, &preftrees->direct,

fs/btrfs/backref.c

818

prelim_ref_insert(ctx->fs_info, &preftrees->direct, ref, NULL);

fs/btrfs/backref.c

836

struct preftrees *preftrees, bool lock)

fs/btrfs/backref.c

840

struct preftree *tree = &preftrees->indirect_missing_keys;

fs/btrfs/backref.c

871

prelim_ref_insert(fs_info, &preftrees->indirect, ref, NULL);

fs/btrfs/backref.c

883

struct preftrees *preftrees, struct share_check *sc)

fs/btrfs/backref.c

924

ret = add_indirect_ref(fs_info, preftrees, node->ref_root,

fs/btrfs/backref.c

937

ret = add_direct_ref(fs_info, preftrees, level + 1,

fs/btrfs/backref.c

966

ret = add_indirect_ref(fs_info, preftrees, node->ref_root,

fs/btrfs/backref.c

973

ret = add_direct_ref(fs_info, preftrees, 0, node->parent,