These changes are the raw update to linux-4.4.6-rt14. Kernel sources

[kvmfornfv.git] / kernel / drivers / staging / lustre / lustre / include / interval_tree.h

diff --git a/kernel/drivers/staging/lustre/lustre/include/interval_tree.h b/kernel/drivers/staging/lustre/lustre/include/interval_tree.h
index bf9027d..f6df3f3 100644 (file)
--- a/kernel/drivers/staging/lustre/lustre/include/interval_tree.h
+++ b/kernel/drivers/staging/lustre/lustre/include/interval_tree.h
@@ -67,11 +67,6 @@ static inline int interval_is_intree(struct interval_node *node)
        return node->in_intree == 1;
 }
 
-static inline __u64 interval_low(struct interval_node *node)
-{
-       return node->in_extent.start;
-}
-
 static inline __u64 interval_high(struct interval_node *node)
 {
        return node->in_extent.end;
@@ -86,39 +81,8 @@ static inline void interval_set(struct interval_node *node,
        node->in_max_high = end;
 }
 
-/* Rules to write an interval callback.
- *  - the callback returns INTERVAL_ITER_STOP when it thinks the iteration
- *    should be stopped. It will then cause the iteration function to return
- *    immediately with return value INTERVAL_ITER_STOP.
- *  - callbacks for interval_iterate and interval_iterate_reverse: Every
- *    nodes in the tree will be set to @node before the callback being called
- *  - callback for interval_search: Only overlapped node will be set to @node
- *    before the callback being called.
- */
-typedef enum interval_iter (*interval_callback_t)(struct interval_node *node,
-                                                 void *args);
-
 struct interval_node *interval_insert(struct interval_node *node,
                                      struct interval_node **root);
 void interval_erase(struct interval_node *node, struct interval_node **root);
 
-/* Search the extents in the tree and call @func for each overlapped
- * extents. */
-enum interval_iter interval_search(struct interval_node *root,
-                                  struct interval_node_extent *ex,
-                                  interval_callback_t func, void *data);
-
-/* Iterate every node in the tree - by reverse order or regular order. */
-enum interval_iter interval_iterate(struct interval_node *root,
-                                   interval_callback_t func, void *data);
-enum interval_iter interval_iterate_reverse(struct interval_node *root,
-                                   interval_callback_t func, void *data);
-
-void interval_expand(struct interval_node *root,
-                    struct interval_node_extent *ext,
-                    struct interval_node_extent *limiter);
-int interval_is_overlapped(struct interval_node *root,
-                          struct interval_node_extent *ex);
-struct interval_node *interval_find(struct interval_node *root,
-                                   struct interval_node_extent *ex);
 #endif