*/
/*
* This file is part of Lustre, http://www.lustre.org/
- * Lustre is a trademark of Sun Microsystems, Inc.
*
* lustre/ldlm/interval_tree.c
*
return extent_compare(&n1->in_extent, &n2->in_extent);
}
-int node_equal(struct interval_node *n1, struct interval_node *n2)
-{
- return extent_equal(&n1->in_extent, &n2->in_extent);
-}
-
#define interval_for_each(node, root) \
for (node = interval_first(root); node != NULL; \
node = interval_next(node))
p = root;
while (*p) {
parent = *p;
- if (node_equal(parent, node))
- RETURN(parent);
/* max_high field must be updated after each iteration */
if (parent->in_max_high < interval_high(node))