Searched refs:in_tree (Results 1 – 8 of 8) sorted by relevance
| /linux-4.19.296/fs/ubifs/ |
| D | find.c | 96 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()
803 const struct ubifs_lprops *lprops, int in_tree, in scan_dirty_idx_cb() argument
812 if (!in_tree && valuable(c, lprops)) in scan_dirty_idx_cb()
|
| D | lpt.c | 1780 int in_tree; member
1810 path->in_tree = 1; in scan_get_nnode()
1815 path->in_tree = 0; in scan_get_nnode()
1869 path->in_tree = 1; in scan_get_pnode()
1874 path->in_tree = 0; in scan_get_pnode()
1955 path[0].in_tree = 1; in ubifs_lpt_scan_nolock()
1983 ret = scan_cb(c, lprops, path[h].in_tree, data); in ubifs_lpt_scan_nolock()
1994 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
2004 path[h].in_tree = 1; in ubifs_lpt_scan_nolock()
2007 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
[all …]
|
| D | lprops.c | 1028 const struct ubifs_lprops *lp, int in_tree, in scan_check_cb() argument
1047 if (in_tree) { in scan_check_cb()
1082 if (in_tree && cat > 0 && cat <= LPROPS_HEAP_CNT) { in scan_check_cb()
|
| D | ubifs.h | 650 int in_tree, void *data);
|
| /linux-4.19.296/fs/btrfs/ |
| D | delayed-ref.h | 53 unsigned int in_tree:1; member
215 WARN_ON(ref->in_tree); in btrfs_put_delayed_ref()
|
| D | delayed-ref.c | 234 ref->in_tree = 0; in drop_delayed_ref()
697 ref->in_tree = 1; in init_delayed_ref_common()
|
| D | disk-io.c | 4294 ref->in_tree = 0; in btrfs_destroy_delayed_refs()
|
| D | extent-tree.c | 2610 ref->in_tree = 0; in __btrfs_run_delayed_refs()
2709 WARN_ON(!entry->in_tree); in find_middle()
|