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