Lines Matching defs:tree
43 /* For interval tree in file/inode */
64 /* Semaphore to protect modifications to the dmap tree */
67 /* Sorted rb tree of struct fuse_dax_mapping elements */
68 struct rb_root_cached tree;
223 interval_tree_insert(&dmap->itn, &fi->dax->tree);
322 node = interval_tree_iter_first(&fi->dax->tree, start_idx,
329 interval_tree_remove(&dmap->itn, &fi->dax->tree);
371 * that fuse inode interval tree. If that lock is taken then lock validator
477 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx);
514 node = interval_tree_iter_first(&fi->dax->tree, idx, idx);
519 * should still be there in tree despite the fact we dropped and
589 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx);
903 /* Remove dax mapping from inode interval tree now */
904 interval_tree_remove(&dmap->itn, &fi->dax->tree);
928 for (node = interval_tree_iter_first(&fi->dax->tree, 0, -1); node;
942 * Find first mapping in the tree and free it and return it. Do not add
983 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx);
1079 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx);
1105 * 2. Take fi->dax->sem to protect interval tree and also to make sure
1319 fi->dax->tree = RB_ROOT_CACHED;