Searched refs:in_tree (Results 1 – 5 of 5) sorted by relevance
/fs/ubifs/ |
D | find.c | 84 const struct ubifs_lprops *lprops, int in_tree, in scan_for_dirty_cb() argument 93 if (!in_tree && valuable(c, lprops)) in scan_for_dirty_cb() 351 const struct ubifs_lprops *lprops, int in_tree, in scan_for_free_cb() argument 360 if (!in_tree && valuable(c, lprops)) in scan_for_free_cb() 591 const struct ubifs_lprops *lprops, int in_tree, in scan_for_idx_cb() argument 600 if (!in_tree && valuable(c, lprops)) in scan_for_idx_cb() 784 const struct ubifs_lprops *lprops, int in_tree, in scan_dirty_idx_cb() argument 793 if (!in_tree && valuable(c, lprops)) in scan_dirty_idx_cb()
|
D | lpt.c | 1932 int in_tree; member 1962 path->in_tree = 1; in scan_get_nnode() 1967 path->in_tree = 0; in scan_get_nnode() 2021 path->in_tree = 1; in scan_get_pnode() 2026 path->in_tree = 0; in scan_get_pnode() 2107 path[0].in_tree = 1; in ubifs_lpt_scan_nolock() 2135 ret = scan_cb(c, lprops, path[h].in_tree, data); in ubifs_lpt_scan_nolock() 2146 if (path[h].in_tree) in ubifs_lpt_scan_nolock() 2156 path[h].in_tree = 1; in ubifs_lpt_scan_nolock() 2159 if (path[h].in_tree) in ubifs_lpt_scan_nolock() [all …]
|
D | lprops.c | 1016 const struct ubifs_lprops *lp, int in_tree, in scan_check_cb() argument 1035 if (in_tree) { in scan_check_cb() 1070 if (in_tree && cat > 0 && cat <= LPROPS_HEAP_CNT) { in scan_check_cb()
|
D | ubifs.h | 659 int in_tree, void *data);
|
/fs/btrfs/ |
D | extent-tree.c | 2116 WARN_ON(!entry->in_tree); in find_middle()
|