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