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 34 */ 35 36 struct buf; 37 struct loadavg; 38 struct proc; 39 struct vmspace; 40 struct vmtotal; 41 struct mount; 42 struct vnode; 43 44 #ifdef KGDB 45 void chgkprot __P((caddr_t, int, int)); 46 #endif 47 48 /* 49 * Try to get semi-meaningful wait messages into thread_sleep... 50 */ 51 extern void thread_sleep_(int, simple_lock_t, char *); 52 #if __GNUC__ >= 2 53 #define thread_sleep(a,b,c) thread_sleep_((a), (b), __FUNCTION__) 54 #else 55 #define thread_sleep(a,b,c) thread_sleep_((a), (b), "vmslp") 56 #endif 57 58 #ifdef KERNEL 59 #ifdef TYPEDEF_FOR_UAP 60 int getpagesize __P((struct proc *p, void *, int *)); 61 int madvise __P((struct proc *, void *, int *)); 62 int mincore __P((struct proc *, void *, int *)); 63 int mprotect __P((struct proc *, void *, int *)); 64 int msync __P((struct proc *, void *, int *)); 65 int munmap __P((struct proc *, void *, int *)); 66 int obreak __P((struct proc *, void *, int *)); 67 int sbrk __P((struct proc *, void *, int *)); 68 int smmap __P((struct proc *, void *, int *)); 69 int sstk __P((struct proc *, void *, int *)); 70 #endif 71 72 void assert_wait __P((int, boolean_t)); 73 int grow __P((struct proc *, u_int)); 74 void iprintf __P((const char *, ...)); 75 int kernacc __P((caddr_t, int, int)); 76 int kinfo_loadavg __P((int, char *, int *, int, int *)); 77 int kinfo_meter __P((int, caddr_t, int *, int, int *)); 78 vm_offset_t kmem_alloc __P((vm_map_t, vm_size_t)); 79 vm_offset_t kmem_alloc_pageable __P((vm_map_t, vm_size_t)); 80 vm_offset_t kmem_alloc_wait __P((vm_map_t, vm_size_t)); 81 void kmem_free __P((vm_map_t, vm_offset_t, vm_size_t)); 82 void kmem_free_wakeup __P((vm_map_t, vm_offset_t, vm_size_t)); 83 void kmem_init __P((vm_offset_t, vm_offset_t)); 84 vm_offset_t kmem_malloc __P((vm_map_t, vm_size_t, boolean_t)); 85 vm_map_t kmem_suballoc __P((vm_map_t, vm_offset_t *, vm_offset_t *, 86 vm_size_t, boolean_t)); 87 void loadav __P((struct loadavg *)); 88 void munmapfd __P((int)); 89 int pager_cache __P((vm_object_t, boolean_t)); 90 void sched __P((void)); 91 int svm_allocate __P((struct proc *, void *, int *)); 92 int svm_deallocate __P((struct proc *, void *, int *)); 93 int svm_inherit __P((struct proc *, void *, int *)); 94 int svm_protect __P((struct proc *, void *, int *)); 95 void swapinit __P((void)); 96 int swapon __P((struct proc *, void *, int *)); 97 void swapout __P((struct proc *)); 98 void swapout_threads __P((void)); 99 int swfree __P((struct proc *, int)); 100 void swstrategy __P((struct buf *)); 101 void thread_block __P((char *)); 102 void thread_sleep __P((int, simple_lock_t, boolean_t)); 103 void thread_wakeup __P((int)); 104 int useracc __P((caddr_t, int, int)); 105 int vm_allocate __P((vm_map_t, 106 vm_offset_t *, vm_size_t, boolean_t)); 107 int vm_allocate_with_pager __P((vm_map_t, vm_offset_t *, 108 vm_size_t, boolean_t, vm_pager_t, vm_offset_t, boolean_t)); 109 int vm_deallocate __P((vm_map_t, vm_offset_t, vm_size_t)); 110 int vm_fault __P((vm_map_t, vm_offset_t, vm_prot_t, boolean_t)); 111 void vm_fault_copy_entry __P((vm_map_t, 112 vm_map_t, vm_map_entry_t, vm_map_entry_t)); 113 void vm_fault_unwire __P((vm_map_t, vm_offset_t, vm_offset_t)); 114 int vm_fault_wire __P((vm_map_t, vm_offset_t, vm_offset_t)); 115 int vm_fork __P((struct proc *, struct proc *, int)); 116 int vm_inherit __P((vm_map_t, 117 vm_offset_t, vm_size_t, vm_inherit_t)); 118 void vm_init_limits __P((struct proc *)); 119 void vm_mem_init __P((void)); 120 int vm_mmap __P((vm_map_t, vm_offset_t *, vm_size_t, 121 vm_prot_t, vm_prot_t, int, caddr_t, vm_offset_t)); 122 int vm_protect __P((vm_map_t, 123 vm_offset_t, vm_size_t, boolean_t, vm_prot_t)); 124 void vm_set_page_size __P((void)); 125 void vmmeter __P((void)); 126 struct vmspace *vmspace_alloc __P((vm_offset_t, vm_offset_t, int)); 127 struct vmspace *vmspace_fork __P((struct vmspace *)); 128 void vmspace_free __P((struct vmspace *)); 129 void vmtotal __P((struct vmtotal *)); 130 void vnode_pager_setsize __P((struct vnode *, u_long)); 131 void vnode_pager_umount __P((struct mount *)); 132 boolean_t vnode_pager_uncache __P((struct vnode *)); 133 void vslock __P((caddr_t, u_int)); 134 void vsunlock __P((caddr_t, u_int, int)); 135 #endif 136