Searched refs:in_tree (Results 1 – 5 of 5) sorted by relevance
| /linux/fs/ubifs/ |
| H A D | find.c | 84 const struct ubifs_lprops *lprops, int in_tree, in scan_for_dirty_cb() argument
94 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
361 if (!in_tree && valuable(c, lprops)) in scan_for_free_cb()
592 const struct ubifs_lprops *lprops, int in_tree, in scan_for_idx_cb() argument
602 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
794 if (!in_tree && valuable(c, lprops)) in scan_dirty_idx_cb()
|
| H A D | lpt.c | 1933 int in_tree; member
1963 path->in_tree = 1; in scan_get_nnode()
1968 path->in_tree = 0; in scan_get_nnode()
2022 path->in_tree = 1; in scan_get_pnode()
2027 path->in_tree = 0; in scan_get_pnode()
2108 path[0].in_tree = 1; in ubifs_lpt_scan_nolock()
2136 ret = scan_cb(c, lprops, path[h].in_tree, data); in ubifs_lpt_scan_nolock()
2147 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
2157 path[h].in_tree = 1; in ubifs_lpt_scan_nolock()
2160 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
[all …]
|
| H A D | lprops.c | 1016 const struct ubifs_lprops *lp, int in_tree, in scan_check_cb() argument
1036 if (in_tree) { in scan_check_cb()
1071 if (in_tree && cat > 0 && cat <= LPROPS_HEAP_CNT) { in scan_check_cb()
|
| H A D | ubifs.h | 652 int in_tree, void *data);
|
| /linux/fs/btrfs/ |
| H A D | extent-tree.c | 2141 WARN_ON(!entry->in_tree); in find_middle()
|