Searched refs:in_tree (Results 1 – 12 of 12) sorted by relevance
| /linux-2.6.39/fs/btrfs/ |
| D | extent_map.c | 56 em->in_tree = 0; in alloc_extent_map()
76 WARN_ON(em->in_tree); in free_extent_map()
92 WARN_ON(!entry->in_tree); in tree_insert()
103 entry->in_tree = 1; in tree_insert()
128 WARN_ON(!entry->in_tree); in __tree_search()
214 merge->in_tree = 0; in unpin_extent_cache()
227 merge->in_tree = 0; in unpin_extent_cache()
277 merge->in_tree = 0; in add_extent_mapping()
289 merge->in_tree = 0; in add_extent_mapping()
418 em->in_tree = 0; in remove_extent_mapping()
|
| D | ref-cache.c | 67 BUG_ON(ref->in_tree); in btrfs_free_leaf_ref()
108 WARN_ON(!entry->in_tree); in tree_search()
137 if (!xchg(&ref->in_tree, 0)) { in btrfs_remove_leaf_refs()
204 ref->in_tree = 1; in btrfs_add_leaf_ref()
219 if (!xchg(&ref->in_tree, 0)) in btrfs_remove_leaf_ref()
|
| D | delayed-ref.h | 54 unsigned int in_tree:1; member
149 WARN_ON(ref->in_tree); in btrfs_put_delayed_ref()
|
| D | delayed-ref.c | 165 WARN_ON(!entry->in_tree); in find_ref_head()
203 if (!head->node.in_tree) { in btrfs_delayed_ref_lock()
346 existing->in_tree = 0; in update_existing_ref()
477 ref->in_tree = 1; in add_delayed_ref_head()
530 ref->in_tree = 1; in add_delayed_tree_ref()
585 ref->in_tree = 1; in add_delayed_data_ref()
|
| D | ref-cache.h | 34 int in_tree; member
|
| D | extent_map.h | 29 unsigned int in_tree:1; member
|
| D | disk-io.c | 2837 ref->in_tree = 0; in btrfs_destroy_delayed_refs()
|
| D | extent-tree.c | 2210 ref->in_tree = 0; in run_clustered_refs()
4720 head->node.in_tree = 0; in check_ref_cleanup()
|
| /linux-2.6.39/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()
798 const struct ubifs_lprops *lprops, int in_tree, in scan_dirty_idx_cb() argument
807 if (!in_tree && valuable(c, lprops)) in scan_dirty_idx_cb()
|
| D | lpt.c | 1769 int in_tree; member
1799 path->in_tree = 1; in scan_get_nnode()
1804 path->in_tree = 0; in scan_get_nnode()
1858 path->in_tree = 1; in scan_get_pnode()
1863 path->in_tree = 0; in scan_get_pnode()
1944 path[0].in_tree = 1; in ubifs_lpt_scan_nolock()
1973 ret = scan_cb(c, lprops, path[h].in_tree, data); in ubifs_lpt_scan_nolock()
1984 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
1995 path[h].in_tree = 1; in ubifs_lpt_scan_nolock()
1998 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
[all …]
|
| D | lprops.c | 1032 const struct ubifs_lprops *lp, int in_tree, in scan_check_cb() argument
1052 if (in_tree) { in scan_check_cb()
1087 if (in_tree && cat > 0 && cat <= LPROPS_HEAP_CNT) { in scan_check_cb()
|
| D | ubifs.h | 645 int in_tree, void *data);
|