in_tree 425 fs/btrfs/delayed-ref.c ref->in_tree = 0; in_tree 899 fs/btrfs/delayed-ref.c ref->in_tree = 1; in_tree 53 fs/btrfs/delayed-ref.h unsigned int in_tree:1; in_tree 313 fs/btrfs/delayed-ref.h WARN_ON(ref->in_tree); in_tree 4296 fs/btrfs/disk-io.c ref->in_tree = 0; in_tree 1922 fs/btrfs/extent-tree.c ref->in_tree = 0; in_tree 2101 fs/btrfs/extent-tree.c WARN_ON(!entry->in_tree); in_tree 84 fs/ubifs/find.c const struct ubifs_lprops *lprops, int in_tree, in_tree 93 fs/ubifs/find.c if (!in_tree && valuable(c, lprops)) in_tree 351 fs/ubifs/find.c const struct ubifs_lprops *lprops, int in_tree, in_tree 360 fs/ubifs/find.c if (!in_tree && valuable(c, lprops)) in_tree 591 fs/ubifs/find.c const struct ubifs_lprops *lprops, int in_tree, in_tree 600 fs/ubifs/find.c if (!in_tree && valuable(c, lprops)) in_tree 784 fs/ubifs/find.c const struct ubifs_lprops *lprops, int in_tree, in_tree 793 fs/ubifs/find.c if (!in_tree && valuable(c, lprops)) in_tree 1016 fs/ubifs/lprops.c const struct ubifs_lprops *lp, int in_tree, in_tree 1035 fs/ubifs/lprops.c if (in_tree) { in_tree 1070 fs/ubifs/lprops.c if (in_tree && cat > 0 && cat <= LPROPS_HEAP_CNT) { in_tree 1932 fs/ubifs/lpt.c int in_tree; in_tree 1962 fs/ubifs/lpt.c path->in_tree = 1; in_tree 1967 fs/ubifs/lpt.c path->in_tree = 0; in_tree 2021 fs/ubifs/lpt.c path->in_tree = 1; in_tree 2026 fs/ubifs/lpt.c path->in_tree = 0; in_tree 2107 fs/ubifs/lpt.c path[0].in_tree = 1; in_tree 2135 fs/ubifs/lpt.c ret = scan_cb(c, lprops, path[h].in_tree, data); in_tree 2146 fs/ubifs/lpt.c if (path[h].in_tree) in_tree 2156 fs/ubifs/lpt.c path[h].in_tree = 1; in_tree 2159 fs/ubifs/lpt.c if (path[h].in_tree) in_tree 2173 fs/ubifs/lpt.c path[h].in_tree = 1; in_tree 648 fs/ubifs/ubifs.h int in_tree, void *data);