1994-05-24 10:09:53 +00:00
|
|
|
/*-
|
|
|
|
|
* Copyright (c) 1992, 1993
|
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
|
*
|
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
|
* are met:
|
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
|
* without specific prior written permission.
|
|
|
|
|
*
|
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
|
*
|
|
|
|
|
* @(#)vm_extern.h 8.2 (Berkeley) 1/12/94
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
|
|
1994-12-30 08:02:16 +00:00
|
|
|
#ifndef _VM_EXTERN_H_
|
|
|
|
|
#define _VM_EXTERN_H_
|
1994-08-21 07:19:45 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
struct buf;
|
|
|
|
|
struct proc;
|
|
|
|
|
struct vmspace;
|
|
|
|
|
struct vmtotal;
|
|
|
|
|
struct mount;
|
|
|
|
|
struct vnode;
|
|
|
|
|
|
1999-12-29 05:07:58 +00:00
|
|
|
#ifdef _KERNEL
|
1995-03-16 18:17:34 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
#ifdef TYPEDEF_FOR_UAP
|
2002-03-19 22:20:14 +00:00
|
|
|
int getpagesize(struct thread *, void *, int *);
|
|
|
|
|
int madvise(struct thread *, void *, int *);
|
|
|
|
|
int mincore(struct thread *, void *, int *);
|
|
|
|
|
int mprotect(struct thread *, void *, int *);
|
|
|
|
|
int msync(struct thread *, void *, int *);
|
|
|
|
|
int munmap(struct thread *, void *, int *);
|
|
|
|
|
int obreak(struct thread *, void *, int *);
|
|
|
|
|
int sbrk(struct thread *, void *, int *);
|
|
|
|
|
int sstk(struct thread *, void *, int *);
|
|
|
|
|
int swapon(struct thread *, void *, int *);
|
2002-03-10 21:52:48 +00:00
|
|
|
#endif /* TYPEDEF_FOR_UAP */
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2002-03-19 22:20:14 +00:00
|
|
|
int kernacc(caddr_t, int, int);
|
|
|
|
|
vm_offset_t kmem_alloc(vm_map_t, vm_size_t);
|
|
|
|
|
vm_offset_t kmem_alloc_nofault(vm_map_t, vm_size_t);
|
|
|
|
|
vm_offset_t kmem_alloc_pageable(vm_map_t, vm_size_t);
|
|
|
|
|
vm_offset_t kmem_alloc_wait(vm_map_t, vm_size_t);
|
|
|
|
|
void kmem_free(vm_map_t, vm_offset_t, vm_size_t);
|
|
|
|
|
void kmem_free_wakeup(vm_map_t, vm_offset_t, vm_size_t);
|
|
|
|
|
void kmem_init(vm_offset_t, vm_offset_t);
|
|
|
|
|
vm_offset_t kmem_malloc(vm_map_t, vm_size_t, boolean_t);
|
|
|
|
|
vm_map_t kmem_suballoc(vm_map_t, vm_offset_t *, vm_offset_t *, vm_size_t);
|
|
|
|
|
void munmapfd(struct thread *, int);
|
|
|
|
|
int swaponvp(struct thread *, struct vnode *, dev_t , u_long);
|
|
|
|
|
void swapout_procs(int);
|
|
|
|
|
int useracc(caddr_t, int, int);
|
|
|
|
|
int vm_fault(vm_map_t, vm_offset_t, vm_prot_t, int);
|
|
|
|
|
void vm_fault_copy_entry(vm_map_t, vm_map_t, vm_map_entry_t, vm_map_entry_t);
|
|
|
|
|
void vm_fault_unwire(vm_map_t, vm_offset_t, vm_offset_t);
|
|
|
|
|
int vm_fault_wire(vm_map_t, vm_offset_t, vm_offset_t);
|
|
|
|
|
int vm_fault_user_wire(vm_map_t, vm_offset_t, vm_offset_t);
|
|
|
|
|
void vm_forkproc(struct thread *, struct proc *, struct thread *, int);
|
|
|
|
|
void vm_waitproc(struct proc *);
|
|
|
|
|
int vm_mmap(vm_map_t, vm_offset_t *, vm_size_t, vm_prot_t, vm_prot_t, int, void *, vm_ooffset_t);
|
|
|
|
|
vm_offset_t vm_page_alloc_contig(vm_offset_t, vm_offset_t, vm_offset_t, vm_offset_t);
|
|
|
|
|
void vm_set_page_size(void);
|
|
|
|
|
struct vmspace *vmspace_alloc(vm_offset_t, vm_offset_t);
|
|
|
|
|
struct vmspace *vmspace_fork(struct vmspace *);
|
|
|
|
|
void vmspace_exec(struct proc *);
|
|
|
|
|
void vmspace_unshare(struct proc *);
|
|
|
|
|
void vmspace_free(struct vmspace *);
|
|
|
|
|
void vmspace_exitfree(struct proc *);
|
|
|
|
|
void vnode_pager_setsize(struct vnode *, vm_ooffset_t);
|
|
|
|
|
void vslock(caddr_t, u_int);
|
|
|
|
|
void vsunlock(caddr_t, u_int);
|
|
|
|
|
void vm_object_print(/* db_expr_t */ long, boolean_t, /* db_expr_t */ long,
|
|
|
|
|
char *);
|
|
|
|
|
int vm_fault_quick(caddr_t v, int prot);
|
1999-12-29 05:07:58 +00:00
|
|
|
#endif /* _KERNEL */
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
#endif /* !_VM_EXTERN_H_ */
|
