Searched refs:in_tree (Results 1 – 10 of 10) sorted by relevance
| /fs/btrfs/ |
| D | extent_map.c | 54 em->in_tree = 0; in alloc_extent_map()
76 WARN_ON(em->in_tree); in free_extent_map()
93 WARN_ON(!entry->in_tree); in tree_insert()
104 entry->in_tree = 1; in tree_insert()
129 WARN_ON(!entry->in_tree); in __tree_search()
216 merge->in_tree = 0; in try_merge_map()
233 merge->in_tree = 0; in try_merge_map()
295 if (em->in_tree) in clear_em_logging()
427 em->in_tree = 0; in remove_extent_mapping()
|
| D | delayed-ref.c | 184 WARN_ON(!entry->in_tree); in find_ref_head()
235 if (!head->node.in_tree) { in btrfs_delayed_ref_lock()
249 ref->in_tree = 0; in drop_delayed_ref()
593 ref->in_tree = 1; in add_delayed_ref_head()
649 ref->in_tree = 1; in add_delayed_tree_ref()
708 ref->in_tree = 1; in add_delayed_data_ref()
|
| D | delayed-ref.h | 57 unsigned int in_tree:1; member
179 WARN_ON(ref->in_tree); in btrfs_put_delayed_ref()
|
| D | extent_map.h | 36 unsigned int in_tree; member
|
| D | extent-tree.c | 2386 ref->in_tree = 0; in run_clustered_refs()
2468 WARN_ON(!entry->in_tree); in find_middle()
5682 head->node.in_tree = 0; in check_ref_cleanup()
|
| D | disk-io.c | 3739 ref->in_tree = 0; in btrfs_destroy_delayed_refs()
|
| /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()
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()
|
| D | lpt.c | 1776 int in_tree; member
1806 path->in_tree = 1; in scan_get_nnode()
1811 path->in_tree = 0; in scan_get_nnode()
1865 path->in_tree = 1; in scan_get_pnode()
1870 path->in_tree = 0; in scan_get_pnode()
1951 path[0].in_tree = 1; in ubifs_lpt_scan_nolock()
1980 ret = scan_cb(c, lprops, path[h].in_tree, data); in ubifs_lpt_scan_nolock()
1991 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
2001 path[h].in_tree = 1; in ubifs_lpt_scan_nolock()
2004 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
[all …]
|
| D | lprops.c | 1030 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()
|
| D | ubifs.h | 641 int in_tree, void *data);
|