Home
last modified time | relevance | path

Searched refs:in_tree (Results 1 – 8 of 8) sorted by relevance

/fs/ubifs/
Dfind.c96 const struct ubifs_lprops *lprops, int in_tree, in scan_for_dirty_cb() argument
105 if (!in_tree && valuable(c, lprops)) in scan_for_dirty_cb()
363 const struct ubifs_lprops *lprops, int in_tree, in scan_for_free_cb() argument
372 if (!in_tree && valuable(c, lprops)) in scan_for_free_cb()
603 const struct ubifs_lprops *lprops, int in_tree, in scan_for_idx_cb() argument
612 if (!in_tree && valuable(c, lprops)) in scan_for_idx_cb()
806 const struct ubifs_lprops *lprops, int in_tree, in scan_dirty_idx_cb() argument
815 if (!in_tree && valuable(c, lprops)) in scan_dirty_idx_cb()
Dlpt.c1773 int in_tree; member
1803 path->in_tree = 1; in scan_get_nnode()
1808 path->in_tree = 0; in scan_get_nnode()
1862 path->in_tree = 1; in scan_get_pnode()
1867 path->in_tree = 0; in scan_get_pnode()
1948 path[0].in_tree = 1; in ubifs_lpt_scan_nolock()
1976 ret = scan_cb(c, lprops, path[h].in_tree, data); in ubifs_lpt_scan_nolock()
1987 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
1997 path[h].in_tree = 1; in ubifs_lpt_scan_nolock()
2000 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
[all …]
Dlprops.c1030 const struct ubifs_lprops *lp, int in_tree, in scan_check_cb() argument
1049 if (in_tree) { in scan_check_cb()
1084 if (in_tree && cat > 0 && cat <= LPROPS_HEAP_CNT) { in scan_check_cb()
Dubifs.h631 int in_tree, void *data);
/fs/btrfs/
Ddelayed-ref.h73 unsigned int in_tree:1; member
223 WARN_ON(ref->in_tree); in btrfs_put_delayed_ref()
Ddelayed-ref.c172 if (!head->node.in_tree) { in btrfs_delayed_ref_lock()
193 ref->in_tree = 0; in drop_delayed_ref()
586 ref->in_tree = 1; in add_delayed_ref_head()
672 ref->in_tree = 1; in add_delayed_tree_ref()
727 ref->in_tree = 1; in add_delayed_data_ref()
Ddisk-io.c4370 ref->in_tree = 0; in btrfs_destroy_delayed_refs()
4382 head->node.in_tree = 0; in btrfs_destroy_delayed_refs()
Dextent-tree.c2617 ref->in_tree = 0; in __btrfs_run_delayed_refs()
2624 ref->in_tree = 0; in __btrfs_run_delayed_refs()
2734 WARN_ON(!entry->in_tree); in find_middle()
7136 head->node.in_tree = 0; in check_ref_cleanup()