Lines Matching defs:node
96 node_to_dmap(struct interval_tree_node *node)
98 if (!node)
101 return container_of(node, struct fuse_dax_mapping, itn);
318 struct interval_tree_node *node;
321 node = interval_tree_iter_first(&fi->dax->tree, start_idx,
323 if (!node)
325 dmap = node_to_dmap(node);
441 struct interval_tree_node *node;
476 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx);
477 if (node) {
478 dmap = node_to_dmap(node);
506 struct interval_tree_node *node;
513 node = interval_tree_iter_first(&fi->dax->tree, idx, idx);
522 if (WARN_ON(!node))
525 dmap = node_to_dmap(node);
569 struct interval_tree_node *node;
588 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx);
589 if (node) {
590 dmap = node_to_dmap(node);
932 struct interval_tree_node *node;
934 for (node = interval_tree_iter_first(&fi->dax->tree, 0, -1); node;
935 node = interval_tree_iter_next(node, 0, -1)) {
936 dmap = node_to_dmap(node);
960 struct interval_tree_node *node;
989 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx);
991 if (!node) {
997 dmap = node_to_dmap(node);
1051 * if there is no range assigned to this node. Otherwise
1082 struct interval_tree_node *node;
1085 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx);
1088 if (!node)
1090 dmap = node_to_dmap(node);