1/*-
2 * Copyright (c) 1992, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 *
33 * @(#)vm_extern.h 8.2 (Berkeley) 1/12/94
| 1/*-
2 * Copyright (c) 1992, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 *
33 * @(#)vm_extern.h 8.2 (Berkeley) 1/12/94
|
37struct buf;
38struct loadavg;
39struct proc;
40struct vmspace;
41struct vmtotal;
42struct mount;
43struct vnode;
44
45#ifdef KGDB
46void chgkprot __P((caddr_t, int, int));
47#endif
48
49/*
50 * Try to get semi-meaningful wait messages into thread_sleep...
51 */
52extern void thread_sleep_(int, simple_lock_t, char *);
53#if __GNUC__ >= 2
54#define thread_sleep(a,b,c) thread_sleep_((a), (b), __FUNCTION__)
55#else
56#define thread_sleep(a,b,c) thread_sleep_((a), (b), "vmslp")
57#endif
58
59#ifdef KERNEL
60#ifdef TYPEDEF_FOR_UAP
61int getpagesize __P((struct proc *p, void *, int *));
62int madvise __P((struct proc *, void *, int *));
63int mincore __P((struct proc *, void *, int *));
64int mprotect __P((struct proc *, void *, int *));
65int msync __P((struct proc *, void *, int *));
66int munmap __P((struct proc *, void *, int *));
67int obreak __P((struct proc *, void *, int *));
68int sbrk __P((struct proc *, void *, int *));
69int smmap __P((struct proc *, void *, int *));
70int sstk __P((struct proc *, void *, int *));
71#endif
72
73void assert_wait __P((int, boolean_t));
74int grow __P((struct proc *, u_int));
75void iprintf __P((const char *, ...));
76int kernacc __P((caddr_t, int, int));
77int kinfo_loadavg __P((int, char *, int *, int, int *));
78int kinfo_meter __P((int, caddr_t, int *, int, int *));
79vm_offset_t kmem_alloc __P((vm_map_t, vm_size_t));
80vm_offset_t kmem_alloc_pageable __P((vm_map_t, vm_size_t));
81vm_offset_t kmem_alloc_wait __P((vm_map_t, vm_size_t));
82void kmem_free __P((vm_map_t, vm_offset_t, vm_size_t));
83void kmem_free_wakeup __P((vm_map_t, vm_offset_t, vm_size_t));
84void kmem_init __P((vm_offset_t, vm_offset_t));
85vm_offset_t kmem_malloc __P((vm_map_t, vm_size_t, boolean_t));
86vm_map_t kmem_suballoc __P((vm_map_t, vm_offset_t *, vm_offset_t *,
87 vm_size_t, boolean_t));
88void loadav __P((struct loadavg *));
89void munmapfd __P((int));
90int pager_cache __P((vm_object_t, boolean_t));
91void sched __P((void));
92int svm_allocate __P((struct proc *, void *, int *));
93int svm_deallocate __P((struct proc *, void *, int *));
94int svm_inherit __P((struct proc *, void *, int *));
95int svm_protect __P((struct proc *, void *, int *));
96void swapinit __P((void));
97int swapon __P((struct proc *, void *, int *));
98void swapout __P((struct proc *));
99void swapout_threads __P((void));
100int swfree __P((struct proc *, int));
101void swstrategy __P((struct buf *));
102void thread_block __P((char *));
103void thread_sleep __P((int, simple_lock_t, boolean_t));
104void thread_wakeup __P((int));
105int useracc __P((caddr_t, int, int));
106int vm_allocate __P((vm_map_t,
107 vm_offset_t *, vm_size_t, boolean_t));
108int vm_allocate_with_pager __P((vm_map_t, vm_offset_t *,
109 vm_size_t, boolean_t, vm_pager_t, vm_offset_t, boolean_t));
110int vm_deallocate __P((vm_map_t, vm_offset_t, vm_size_t));
111int vm_fault __P((vm_map_t, vm_offset_t, vm_prot_t, boolean_t));
112void vm_fault_copy_entry __P((vm_map_t,
113 vm_map_t, vm_map_entry_t, vm_map_entry_t));
114void vm_fault_unwire __P((vm_map_t, vm_offset_t, vm_offset_t));
115int vm_fault_wire __P((vm_map_t, vm_offset_t, vm_offset_t));
116int vm_fork __P((struct proc *, struct proc *, int));
117int vm_inherit __P((vm_map_t,
118 vm_offset_t, vm_size_t, vm_inherit_t));
119void vm_init_limits __P((struct proc *));
120void vm_mem_init __P((void));
121int vm_mmap __P((vm_map_t, vm_offset_t *, vm_size_t,
122 vm_prot_t, vm_prot_t, int, caddr_t, vm_offset_t));
123int vm_protect __P((vm_map_t,
124 vm_offset_t, vm_size_t, boolean_t, vm_prot_t));
125void vm_set_page_size __P((void));
126void vmmeter __P((void));
127struct vmspace *vmspace_alloc __P((vm_offset_t, vm_offset_t, int));
128struct vmspace *vmspace_fork __P((struct vmspace *));
129void vmspace_free __P((struct vmspace *));
130void vmtotal __P((struct vmtotal *));
131void vnode_pager_setsize __P((struct vnode *, u_long));
132void vnode_pager_umount __P((struct mount *));
133boolean_t vnode_pager_uncache __P((struct vnode *));
134void vslock __P((caddr_t, u_int));
135void vsunlock __P((caddr_t, u_int, int));
136#endif
| 40struct buf;
41struct loadavg;
42struct proc;
43struct vmspace;
44struct vmtotal;
45struct mount;
46struct vnode;
47
48#ifdef KGDB
49void chgkprot __P((caddr_t, int, int));
50#endif
51
52/*
53 * Try to get semi-meaningful wait messages into thread_sleep...
54 */
55extern void thread_sleep_(int, simple_lock_t, char *);
56#if __GNUC__ >= 2
57#define thread_sleep(a,b,c) thread_sleep_((a), (b), __FUNCTION__)
58#else
59#define thread_sleep(a,b,c) thread_sleep_((a), (b), "vmslp")
60#endif
61
62#ifdef KERNEL
63#ifdef TYPEDEF_FOR_UAP
64int getpagesize __P((struct proc *p, void *, int *));
65int madvise __P((struct proc *, void *, int *));
66int mincore __P((struct proc *, void *, int *));
67int mprotect __P((struct proc *, void *, int *));
68int msync __P((struct proc *, void *, int *));
69int munmap __P((struct proc *, void *, int *));
70int obreak __P((struct proc *, void *, int *));
71int sbrk __P((struct proc *, void *, int *));
72int smmap __P((struct proc *, void *, int *));
73int sstk __P((struct proc *, void *, int *));
74#endif
75
76void assert_wait __P((int, boolean_t));
77int grow __P((struct proc *, u_int));
78void iprintf __P((const char *, ...));
79int kernacc __P((caddr_t, int, int));
80int kinfo_loadavg __P((int, char *, int *, int, int *));
81int kinfo_meter __P((int, caddr_t, int *, int, int *));
82vm_offset_t kmem_alloc __P((vm_map_t, vm_size_t));
83vm_offset_t kmem_alloc_pageable __P((vm_map_t, vm_size_t));
84vm_offset_t kmem_alloc_wait __P((vm_map_t, vm_size_t));
85void kmem_free __P((vm_map_t, vm_offset_t, vm_size_t));
86void kmem_free_wakeup __P((vm_map_t, vm_offset_t, vm_size_t));
87void kmem_init __P((vm_offset_t, vm_offset_t));
88vm_offset_t kmem_malloc __P((vm_map_t, vm_size_t, boolean_t));
89vm_map_t kmem_suballoc __P((vm_map_t, vm_offset_t *, vm_offset_t *,
90 vm_size_t, boolean_t));
91void loadav __P((struct loadavg *));
92void munmapfd __P((int));
93int pager_cache __P((vm_object_t, boolean_t));
94void sched __P((void));
95int svm_allocate __P((struct proc *, void *, int *));
96int svm_deallocate __P((struct proc *, void *, int *));
97int svm_inherit __P((struct proc *, void *, int *));
98int svm_protect __P((struct proc *, void *, int *));
99void swapinit __P((void));
100int swapon __P((struct proc *, void *, int *));
101void swapout __P((struct proc *));
102void swapout_threads __P((void));
103int swfree __P((struct proc *, int));
104void swstrategy __P((struct buf *));
105void thread_block __P((char *));
106void thread_sleep __P((int, simple_lock_t, boolean_t));
107void thread_wakeup __P((int));
108int useracc __P((caddr_t, int, int));
109int vm_allocate __P((vm_map_t,
110 vm_offset_t *, vm_size_t, boolean_t));
111int vm_allocate_with_pager __P((vm_map_t, vm_offset_t *,
112 vm_size_t, boolean_t, vm_pager_t, vm_offset_t, boolean_t));
113int vm_deallocate __P((vm_map_t, vm_offset_t, vm_size_t));
114int vm_fault __P((vm_map_t, vm_offset_t, vm_prot_t, boolean_t));
115void vm_fault_copy_entry __P((vm_map_t,
116 vm_map_t, vm_map_entry_t, vm_map_entry_t));
117void vm_fault_unwire __P((vm_map_t, vm_offset_t, vm_offset_t));
118int vm_fault_wire __P((vm_map_t, vm_offset_t, vm_offset_t));
119int vm_fork __P((struct proc *, struct proc *, int));
120int vm_inherit __P((vm_map_t,
121 vm_offset_t, vm_size_t, vm_inherit_t));
122void vm_init_limits __P((struct proc *));
123void vm_mem_init __P((void));
124int vm_mmap __P((vm_map_t, vm_offset_t *, vm_size_t,
125 vm_prot_t, vm_prot_t, int, caddr_t, vm_offset_t));
126int vm_protect __P((vm_map_t,
127 vm_offset_t, vm_size_t, boolean_t, vm_prot_t));
128void vm_set_page_size __P((void));
129void vmmeter __P((void));
130struct vmspace *vmspace_alloc __P((vm_offset_t, vm_offset_t, int));
131struct vmspace *vmspace_fork __P((struct vmspace *));
132void vmspace_free __P((struct vmspace *));
133void vmtotal __P((struct vmtotal *));
134void vnode_pager_setsize __P((struct vnode *, u_long));
135void vnode_pager_umount __P((struct mount *));
136boolean_t vnode_pager_uncache __P((struct vnode *));
137void vslock __P((caddr_t, u_int));
138void vsunlock __P((caddr_t, u_int, int));
139#endif
|