Lines Matching defs:tree
42 /* For interval tree in file/inode */
63 /* Semaphore to protect modifications to the dmap tree */
66 /* Sorted rb tree of struct fuse_dax_mapping elements */
67 struct rb_root_cached tree;
222 interval_tree_insert(&dmap->itn, &fi->dax->tree);
321 node = interval_tree_iter_first(&fi->dax->tree, start_idx,
328 interval_tree_remove(&dmap->itn, &fi->dax->tree);
370 * that fuse inode interval tree. If that lock is taken then lock validator
476 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx);
513 node = interval_tree_iter_first(&fi->dax->tree, idx, idx);
518 * should still be there in tree despite the fact we dropped and
588 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx);
909 /* Remove dax mapping from inode interval tree now */
910 interval_tree_remove(&dmap->itn, &fi->dax->tree);
934 for (node = interval_tree_iter_first(&fi->dax->tree, 0, -1); node;
948 * Find first mapping in the tree and free it and return it. Do not add
989 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx);
1085 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx);
1111 * 2. Take fi->dax->sem to protect interval tree and also to make sure
1324 fi->dax->tree = RB_ROOT_CACHED;