xref: /freebsd/sys/compat/linuxkpi/common/include/linux/interval_tree.h (revision af23369a6deaaeb612ab266eb88b8bb8d560c322)
1 /*-
2  * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
3  *
4  * Copyright (c) 2021 Vladimir Kondratyev <wulf@FreeBSD.org>
5  *
6  * Redistribution and use in source and binary forms, with or without
7  * modification, are permitted provided that the following conditions
8  * are met:
9  * 1. Redistributions of source code must retain the above copyright
10  *    notice unmodified, this list of conditions, and the following
11  *    disclaimer.
12  * 2. Redistributions in binary form must reproduce the above copyright
13  *    notice, this list of conditions and the following disclaimer in the
14  *    documentation and/or other materials provided with the distribution.
15  *
16  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
17  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
18  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
19  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
20  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
21  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
22  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
23  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
25  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26  */
27 
28 #ifndef _LINUXKPI_LINUX_INTERVAL_TREE_H
29 #define _LINUXKPI_LINUX_INTERVAL_TREE_H
30 
31 #include <linux/rbtree.h>
32 
33 struct interval_tree_node {
34 	struct rb_node rb;
35 	unsigned long start;
36 	unsigned long last;
37 };
38 
39 #define	interval_tree_iter_first(...)	\
40 	lkpi_interval_tree_iter_first(__VA_ARGS__)
41 #define	interval_tree_iter_next(...)	\
42 	lkpi_interval_tree_iter_next(__VA_ARGS__)
43 #define	interval_tree_insert(...)	lkpi_interval_tree_insert(__VA_ARGS__)
44 #define	interval_tree_remove(...)	lkpi_interval_tree_remove(__VA_ARGS__)
45 
46 struct interval_tree_node *lkpi_interval_tree_iter_first(
47     struct rb_root_cached *, unsigned long, unsigned long);
48 struct interval_tree_node *lkpi_interval_tree_iter_next(
49     struct interval_tree_node *, unsigned long, unsigned long);
50 void lkpi_interval_tree_insert(struct interval_tree_node *,
51     struct rb_root_cached *);
52 void lkpi_interval_tree_remove(struct interval_tree_node *,
53     struct rb_root_cached *);
54 
55 #endif	/* _LINUXKPI_LINUX_INTERVAL_TREE_H */
56