xref: /freebsd/sys/vm/vm_radix.h (revision 396c556d77189a5c474d35cec6f44a762e310b7d)
1 /*
2  * Copyright (c) 2013 EMC Corp.
3  * Copyright (c) 2011 Jeffrey Roberson <jeff@freebsd.org>
4  * Copyright (c) 2008 Mayur Shardul <mayur.shardul@gmail.com>
5  * All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  * 1. Redistributions of source code must retain the above copyright
11  *    notice, this list of conditions and the following 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 AND CONTRIBUTORS ``AS IS'' AND
17  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26  * SUCH DAMAGE.
27  *
28  * $FreeBSD$
29  */
30 
31 #ifndef _VM_RADIX_H_
32 #define _VM_RADIX_H_
33 
34 #include <vm/_vm_radix.h>
35 
36 #ifdef _KERNEL
37 
38 int		vm_radix_insert(struct vm_radix *rtree, vm_page_t page);
39 void		vm_radix_wait(void);
40 boolean_t	vm_radix_is_singleton(struct vm_radix *rtree);
41 vm_page_t	vm_radix_lookup(struct vm_radix *rtree, vm_pindex_t index);
42 vm_page_t	vm_radix_lookup_ge(struct vm_radix *rtree, vm_pindex_t index);
43 vm_page_t	vm_radix_lookup_le(struct vm_radix *rtree, vm_pindex_t index);
44 void		vm_radix_reclaim_allnodes(struct vm_radix *rtree);
45 vm_page_t	vm_radix_remove(struct vm_radix *rtree, vm_pindex_t index);
46 vm_page_t	vm_radix_replace(struct vm_radix *rtree, vm_page_t newpage);
47 void		vm_radix_zinit(void);
48 
49 static __inline void
50 vm_radix_init(struct vm_radix *rtree)
51 {
52 
53 	rtree->rt_root = 0;
54 }
55 
56 static __inline boolean_t
57 vm_radix_is_empty(struct vm_radix *rtree)
58 {
59 
60 	return (rtree->rt_root == 0);
61 }
62 
63 #endif /* _KERNEL */
64 #endif /* !_VM_RADIX_H_ */
65