2 * Copyright (c) 2019 Matthew Dillon <dillon@backplane.com>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice unmodified, this list of conditions, and the following
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 #include <linux/init.h>
28 #include <linux/interval_tree.h>
29 #include <linux/module.h>
31 typedef struct interval_tree_node itnode_t;
34 interval_tree_insert(struct interval_tree_node *node, struct rb_root *root)
38 scan = (itnode_t *)root->rb_node;
40 node->next = scan->next;
44 root->rb_node = (void *)node;
51 interval_tree_remove(struct interval_tree_node *node, struct rb_root *root)
55 scan = (itnode_t *)root->rb_node;
56 KKASSERT(scan != NULL);
57 while (scan->next != node) {
60 scan->next = node->next;
63 * Last element is being removed
67 } else if ((itnode_t *)root->rb_node == node) {
69 * Root pointer is the node being removed, move the root
74 root->rb_node = (void *)scan;
78 struct interval_tree_node *
79 interval_tree_iter_first(struct rb_root *root,
80 unsigned long start, unsigned long last)
84 scan = (itnode_t *)root->rb_node;
87 if (start <= scan->last &&
88 last >= scan->start) {
92 } while (scan->atroot == 0);
98 struct interval_tree_node *
99 interval_tree_iter_next(struct interval_tree_node *node,
100 unsigned long start, unsigned long last)
105 while (scan->atroot == 0) {
106 if (start <= scan->last &&
107 last >= scan->start) {