1995-05-30 08:16:23 +00:00
|
|
|
/*
|
1993-06-12 14:58:17 +00:00
|
|
|
* Copyright (c) 1991 Regents of the University of California.
|
|
|
|
|
* All rights reserved.
|
|
|
|
|
*
|
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
|
* the Systems Programming Group of the University of Utah Computer
|
|
|
|
|
* Science Department and William Jolitz of UUNET Technologies Inc.
|
|
|
|
|
*
|
|
|
|
|
* 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.
|
|
|
|
|
*
|
|
|
|
|
* Derived from hp300 version by Mike Hibler, this version by William
|
|
|
|
|
* Jolitz uses a recursive map [a pde points to the page directory] to
|
|
|
|
|
* map the page tables using the pagetables themselves. This is done to
|
|
|
|
|
* reduce the impact on kernel virtual memory for lots of sparse address
|
|
|
|
|
* space, and to reduce the cost of memory to each process.
|
|
|
|
|
*
|
1993-10-15 10:07:45 +00:00
|
|
|
* from: hp300: @(#)pmap.h 7.2 (Berkeley) 12/16/90
|
|
|
|
|
* from: @(#)pmap.h 7.4 (Berkeley) 5/12/91
|
NOTE: libkvm, w, ps, 'top', and any other utility which depends on struct
proc or any VM system structure will have to be rebuilt!!!
Much needed overhaul of the VM system. Included in this first round of
changes:
1) Improved pager interfaces: init, alloc, dealloc, getpages, putpages,
haspage, and sync operations are supported. The haspage interface now
provides information about clusterability. All pager routines now take
struct vm_object's instead of "pagers".
2) Improved data structures. In the previous paradigm, there is constant
confusion caused by pagers being both a data structure ("allocate a
pager") and a collection of routines. The idea of a pager structure has
escentially been eliminated. Objects now have types, and this type is
used to index the appropriate pager. In most cases, items in the pager
structure were duplicated in the object data structure and thus were
unnecessary. In the few cases that remained, a un_pager structure union
was created in the object to contain these items.
3) Because of the cleanup of #1 & #2, a lot of unnecessary layering can now
be removed. For instance, vm_object_enter(), vm_object_lookup(),
vm_object_remove(), and the associated object hash list were some of the
things that were removed.
4) simple_lock's removed. Discussion with several people reveals that the
SMP locking primitives used in the VM system aren't likely the mechanism
that we'll be adopting. Even if it were, the locking that was in the code
was very inadequate and would have to be mostly re-done anyway. The
locking in a uni-processor kernel was a no-op but went a long way toward
making the code difficult to read and debug.
5) Places that attempted to kludge-up the fact that we don't have kernel
thread support have been fixed to reflect the reality that we are really
dealing with processes, not threads. The VM system didn't have complete
thread support, so the comments and mis-named routines were just wrong.
We now use tsleep and wakeup directly in the lock routines, for instance.
6) Where appropriate, the pagers have been improved, especially in the
pager_alloc routines. Most of the pager_allocs have been rewritten and
are now faster and easier to maintain.
7) The pagedaemon pageout clustering algorithm has been rewritten and
now tries harder to output an even number of pages before and after
the requested page. This is sort of the reverse of the ideal pagein
algorithm and should provide better overall performance.
8) Unnecessary (incorrect) casts to caddr_t in calls to tsleep & wakeup
have been removed. Some other unnecessary casts have also been removed.
9) Some almost useless debugging code removed.
10) Terminology of shadow objects vs. backing objects straightened out.
The fact that the vm_object data structure escentially had this
backwards really confused things. The use of "shadow" and "backing
object" throughout the code is now internally consistent and correct
in the Mach terminology.
11) Several minor bug fixes, including one in the vm daemon that caused
0 RSS objects to not get purged as intended.
12) A "default pager" has now been created which cleans up the transition
of objects to the "swap" type. The previous checks throughout the code
for swp->pg_data != NULL were really ugly. This change also provides
the rudiments for future backing of "anonymous" memory by something
other than the swap pager (via the vnode pager, for example), and it
allows the decision about which of these pagers to use to be made
dynamically (although will need some additional decision code to do
this, of course).
13) (dyson) MAP_COPY has been deprecated and the corresponding "copy
object" code has been removed. MAP_COPY was undocumented and non-
standard. It was furthermore broken in several ways which caused its
behavior to degrade to MAP_PRIVATE. Binaries that use MAP_COPY will
continue to work correctly, but via the slightly different semantics
of MAP_PRIVATE.
14) (dyson) Sharing maps have been removed. It's marginal usefulness in a
threads design can be worked around in other ways. Both #12 and #13
were done to simplify the code and improve readability and maintain-
ability. (As were most all of these changes)
TODO:
1) Rewrite most of the vnode pager to use VOP_GETPAGES/PUTPAGES. Doing
this will reduce the vnode pager to a mere fraction of its current size.
2) Rewrite vm_fault and the swap/vnode pagers to use the clustering
information provided by the new haspage pager interface. This will
substantially reduce the overhead by eliminating a large number of
VOP_BMAP() calls. The VOP_BMAP() filesystem interface should be
improved to provide both a "behind" and "ahead" indication of
contiguousness.
3) Implement the extended features of pager_haspage in swap_pager_haspage().
It currently just says 0 pages ahead/behind.
4) Re-implement the swap device (swstrategy) in a more elegant way, perhaps
via a much more general mechanism that could also be used for disk
striping of regular filesystems.
5) Do something to improve the architecture of vm_object_collapse(). The
fact that it makes calls into the swap pager and knows too much about
how the swap pager operates really bothers me. It also doesn't allow
for collapsing of non-swap pager objects ("unnamed" objects backed by
other pagers).
1995-07-13 08:48:48 +00:00
|
|
|
* $Id: pmap.h,v 1.26 1995/05/30 08:00:48 rgrimes Exp $
|
1993-06-12 14:58:17 +00:00
|
|
|
*/
|
|
|
|
|
|
1994-11-14 14:12:24 +00:00
|
|
|
#ifndef _MACHINE_PMAP_H_
|
|
|
|
|
#define _MACHINE_PMAP_H_
|
1993-06-12 14:58:17 +00:00
|
|
|
|
1994-05-25 09:21:21 +00:00
|
|
|
#include <machine/pte.h>
|
1993-06-12 14:58:17 +00:00
|
|
|
|
1994-03-07 11:38:49 +00:00
|
|
|
typedef unsigned int *pd_entry_t;
|
|
|
|
|
typedef unsigned int *pt_entry_t;
|
1993-06-12 14:58:17 +00:00
|
|
|
|
|
|
|
|
/*
|
First steps in rewriting locore.s, and making info useful
when the machine panics.
i386/i386/locore.s:
1) got rid of most .set directives that were being used like
#define's, and replaced them with appropriate #define's in
the appropriate header files (accessed via genassym).
2) added comments to header inclusions and global definitions,
and global variables
3) replaced some hardcoded constants with cpp defines (such as
PDESIZE and others)
4) aligned all comments to the same column to make them easier to
read
5) moved macro definitions for ENTRY, ALIGN, NOP, etc. to
/sys/i386/include/asmacros.h
6) added #ifdef BDE_DEBUGGER around all of Bruce's debugger code
7) added new global '_KERNend' to store last location+1 of kernel
8) cleaned up zeroing of bss so that only bss is zeroed
9) fix zeroing of page tables so that it really does zero them all
- not just if they follow the bss.
10) rewrote page table initialization code so that 1) works correctly
and 2) write protects the kernel text by default
11) properly initialize the kernel page directory, upages, p0stack PT,
and page tables. The previous scheme was more than a bit
screwy.
12) change allocation of virtual area of IO hole so that it is
fixed at KERNBASE + 0xa0000. The previous scheme put it
right after the kernel page tables and then later expected
it to be at KERNBASE +0xa0000
13) change multiple bogus settings of user read/write of various
areas of kernel VM - including the IO hole; we should never
be accessing the IO hole in user mode through the kernel
page tables
14) split kernel support routines such as bcopy, bzero, copyin,
copyout, etc. into a seperate file 'support.s'
15) split swtch and related routines into a seperate 'swtch.s'
16) split routines related to traps, syscalls, and interrupts
into a seperate file 'exception.s'
17) remove some unused global variables from locore that got
inserted by Garrett when he pulled them out of some .h
files.
i386/isa/icu.s:
1) clean up global variable declarations
2) move in declaration of astpending and netisr
i386/i386/pmap.c:
1) fix calculation of virtual_avail. It previously was calculated
to be right in the middle of the kernel page tables - not
a good place to start allocating kernel VM.
2) properly allocate kernel page dir/tables etc out of kernel map
- previously only took out 2 pages.
i386/i386/machdep.c:
1) modify boot() to print a warning that the system will reboot in
PANIC_REBOOT_WAIT_TIME amount of seconds, and let the user
abort with a key on the console. The machine will wait for
ever if a key is typed before the reboot. The default is
15 seconds, but can be set to 0 to mean don't wait at all,
-1 to mean wait forever, or any positive value to wait for
that many seconds.
2) print "Rebooting..." just before doing it.
kern/subr_prf.c:
1) remove PANICWAIT as it is deprecated by the change to machdep.c
i386/i386/trap.c:
1) add table of trap type strings and use it to print a real trap/
panic message rather than just a number. Lot's of work to
be done here, but this is the first step. Symbolic traceback
is in the TODO.
i386/i386/Makefile.i386:
1) add support in to build support.s, exception.s and swtch.s
...and various changes to various header files to make all of the
above happen.
1993-11-13 02:25:21 +00:00
|
|
|
* NKPDE controls the virtual space of the kernel, what ever is left, minus
|
|
|
|
|
* the alternate page table area is given to the user (NUPDE)
|
1993-06-12 14:58:17 +00:00
|
|
|
*/
|
1994-01-14 16:25:31 +00:00
|
|
|
/*
|
|
|
|
|
* NKPDE controls the virtual space of the kernel, what ever is left is
|
|
|
|
|
* given to the user (NUPDE)
|
|
|
|
|
*/
|
|
|
|
|
#ifndef NKPT
|
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
|
|
|
#if 0
|
1994-12-18 03:11:46 +00:00
|
|
|
#define NKPT 26 /* actual number of kernel page tables */
|
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
|
|
|
#else
|
|
|
|
|
#define NKPT 9 /* actual number of kernel page tables */
|
|
|
|
|
#endif
|
1994-01-14 16:25:31 +00:00
|
|
|
#endif
|
|
|
|
|
#ifndef NKPDE
|
1994-08-23 16:27:15 +00:00
|
|
|
#define NKPDE 63 /* addressable number of page tables/pde's */
|
1994-01-14 16:25:31 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#define NUPDE (NPTEPG-NKPDE) /* number of user pde's */
|
|
|
|
|
|
1993-10-12 13:58:01 +00:00
|
|
|
/*
|
|
|
|
|
* The *PTDI values control the layout of virtual memory
|
|
|
|
|
*
|
|
|
|
|
* XXX This works for now, but I am not real happy with it, I'll fix it
|
|
|
|
|
* right after I fix locore.s and the magic 28K hole
|
|
|
|
|
*/
|
1993-10-15 10:07:45 +00:00
|
|
|
#define APTDPTDI (NPTEPG-1) /* alt ptd entry that points to APTD */
|
|
|
|
|
#define KPTDI (APTDPTDI-NKPDE)/* start of kernel virtual pde's */
|
1993-10-12 15:09:37 +00:00
|
|
|
#define PTDPTDI (KPTDI-1) /* ptd entry that points to ptd! */
|
First steps in rewriting locore.s, and making info useful
when the machine panics.
i386/i386/locore.s:
1) got rid of most .set directives that were being used like
#define's, and replaced them with appropriate #define's in
the appropriate header files (accessed via genassym).
2) added comments to header inclusions and global definitions,
and global variables
3) replaced some hardcoded constants with cpp defines (such as
PDESIZE and others)
4) aligned all comments to the same column to make them easier to
read
5) moved macro definitions for ENTRY, ALIGN, NOP, etc. to
/sys/i386/include/asmacros.h
6) added #ifdef BDE_DEBUGGER around all of Bruce's debugger code
7) added new global '_KERNend' to store last location+1 of kernel
8) cleaned up zeroing of bss so that only bss is zeroed
9) fix zeroing of page tables so that it really does zero them all
- not just if they follow the bss.
10) rewrote page table initialization code so that 1) works correctly
and 2) write protects the kernel text by default
11) properly initialize the kernel page directory, upages, p0stack PT,
and page tables. The previous scheme was more than a bit
screwy.
12) change allocation of virtual area of IO hole so that it is
fixed at KERNBASE + 0xa0000. The previous scheme put it
right after the kernel page tables and then later expected
it to be at KERNBASE +0xa0000
13) change multiple bogus settings of user read/write of various
areas of kernel VM - including the IO hole; we should never
be accessing the IO hole in user mode through the kernel
page tables
14) split kernel support routines such as bcopy, bzero, copyin,
copyout, etc. into a seperate file 'support.s'
15) split swtch and related routines into a seperate 'swtch.s'
16) split routines related to traps, syscalls, and interrupts
into a seperate file 'exception.s'
17) remove some unused global variables from locore that got
inserted by Garrett when he pulled them out of some .h
files.
i386/isa/icu.s:
1) clean up global variable declarations
2) move in declaration of astpending and netisr
i386/i386/pmap.c:
1) fix calculation of virtual_avail. It previously was calculated
to be right in the middle of the kernel page tables - not
a good place to start allocating kernel VM.
2) properly allocate kernel page dir/tables etc out of kernel map
- previously only took out 2 pages.
i386/i386/machdep.c:
1) modify boot() to print a warning that the system will reboot in
PANIC_REBOOT_WAIT_TIME amount of seconds, and let the user
abort with a key on the console. The machine will wait for
ever if a key is typed before the reboot. The default is
15 seconds, but can be set to 0 to mean don't wait at all,
-1 to mean wait forever, or any positive value to wait for
that many seconds.
2) print "Rebooting..." just before doing it.
kern/subr_prf.c:
1) remove PANICWAIT as it is deprecated by the change to machdep.c
i386/i386/trap.c:
1) add table of trap type strings and use it to print a real trap/
panic message rather than just a number. Lot's of work to
be done here, but this is the first step. Symbolic traceback
is in the TODO.
i386/i386/Makefile.i386:
1) add support in to build support.s, exception.s and swtch.s
...and various changes to various header files to make all of the
above happen.
1993-11-13 02:25:21 +00:00
|
|
|
#define KSTKPTDI (PTDPTDI-1) /* ptd entry for u./kernel&user stack */
|
1994-03-07 11:38:49 +00:00
|
|
|
#define KSTKPTEOFF (NBPG/sizeof(pd_entry_t)-UPAGES) /* pte entry for kernel stack */
|
First steps in rewriting locore.s, and making info useful
when the machine panics.
i386/i386/locore.s:
1) got rid of most .set directives that were being used like
#define's, and replaced them with appropriate #define's in
the appropriate header files (accessed via genassym).
2) added comments to header inclusions and global definitions,
and global variables
3) replaced some hardcoded constants with cpp defines (such as
PDESIZE and others)
4) aligned all comments to the same column to make them easier to
read
5) moved macro definitions for ENTRY, ALIGN, NOP, etc. to
/sys/i386/include/asmacros.h
6) added #ifdef BDE_DEBUGGER around all of Bruce's debugger code
7) added new global '_KERNend' to store last location+1 of kernel
8) cleaned up zeroing of bss so that only bss is zeroed
9) fix zeroing of page tables so that it really does zero them all
- not just if they follow the bss.
10) rewrote page table initialization code so that 1) works correctly
and 2) write protects the kernel text by default
11) properly initialize the kernel page directory, upages, p0stack PT,
and page tables. The previous scheme was more than a bit
screwy.
12) change allocation of virtual area of IO hole so that it is
fixed at KERNBASE + 0xa0000. The previous scheme put it
right after the kernel page tables and then later expected
it to be at KERNBASE +0xa0000
13) change multiple bogus settings of user read/write of various
areas of kernel VM - including the IO hole; we should never
be accessing the IO hole in user mode through the kernel
page tables
14) split kernel support routines such as bcopy, bzero, copyin,
copyout, etc. into a seperate file 'support.s'
15) split swtch and related routines into a seperate 'swtch.s'
16) split routines related to traps, syscalls, and interrupts
into a seperate file 'exception.s'
17) remove some unused global variables from locore that got
inserted by Garrett when he pulled them out of some .h
files.
i386/isa/icu.s:
1) clean up global variable declarations
2) move in declaration of astpending and netisr
i386/i386/pmap.c:
1) fix calculation of virtual_avail. It previously was calculated
to be right in the middle of the kernel page tables - not
a good place to start allocating kernel VM.
2) properly allocate kernel page dir/tables etc out of kernel map
- previously only took out 2 pages.
i386/i386/machdep.c:
1) modify boot() to print a warning that the system will reboot in
PANIC_REBOOT_WAIT_TIME amount of seconds, and let the user
abort with a key on the console. The machine will wait for
ever if a key is typed before the reboot. The default is
15 seconds, but can be set to 0 to mean don't wait at all,
-1 to mean wait forever, or any positive value to wait for
that many seconds.
2) print "Rebooting..." just before doing it.
kern/subr_prf.c:
1) remove PANICWAIT as it is deprecated by the change to machdep.c
i386/i386/trap.c:
1) add table of trap type strings and use it to print a real trap/
panic message rather than just a number. Lot's of work to
be done here, but this is the first step. Symbolic traceback
is in the TODO.
i386/i386/Makefile.i386:
1) add support in to build support.s, exception.s and swtch.s
...and various changes to various header files to make all of the
above happen.
1993-11-13 02:25:21 +00:00
|
|
|
|
1994-03-07 11:38:49 +00:00
|
|
|
#define PDESIZE sizeof(pd_entry_t) /* for assembly files */
|
|
|
|
|
#define PTESIZE sizeof(pt_entry_t) /* for assembly files */
|
1993-06-12 14:58:17 +00:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Address of current and alternate address space page table maps
|
|
|
|
|
* and directories.
|
|
|
|
|
*/
|
|
|
|
|
#ifdef KERNEL
|
1994-03-07 11:38:49 +00:00
|
|
|
extern pt_entry_t PTmap[], APTmap[], Upte;
|
|
|
|
|
extern pd_entry_t PTD[], APTD[], PTDpde, APTDpde, Upde;
|
1993-06-12 14:58:17 +00:00
|
|
|
|
|
|
|
|
extern int IdlePTD; /* physical address of "Idle" state directory */
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* virtual address to page table entry and
|
|
|
|
|
* to physical address. Likewise for alternate address space.
|
|
|
|
|
* Note: these work recursively, thus vtopte of a pte will give
|
|
|
|
|
* the corresponding pde that in turn maps it.
|
|
|
|
|
*/
|
|
|
|
|
#define vtopte(va) (PTmap + i386_btop(va))
|
|
|
|
|
#define kvtopte(va) vtopte(va)
|
1995-05-30 08:16:23 +00:00
|
|
|
#define ptetov(pt) (i386_ptob(pt - PTmap))
|
1994-03-07 11:38:49 +00:00
|
|
|
#define vtophys(va) (((int) (*vtopte(va))&PG_FRAME) | ((int)(va) & PGOFSET))
|
1993-10-12 13:58:01 +00:00
|
|
|
#define ispt(va) ((va) >= UPT_MIN_ADDRESS && (va) <= KPT_MAX_ADDRESS)
|
1993-06-12 14:58:17 +00:00
|
|
|
|
|
|
|
|
#define avtopte(va) (APTmap + i386_btop(va))
|
1995-05-30 08:16:23 +00:00
|
|
|
#define ptetoav(pt) (i386_ptob(pt - APTmap))
|
1994-03-07 11:38:49 +00:00
|
|
|
#define avtophys(va) (((int) (*avtopte(va))&PG_FRAME) | ((int)(va) & PGOFSET))
|
1993-06-12 14:58:17 +00:00
|
|
|
|
1994-03-25 22:08:59 +00:00
|
|
|
#ifdef KERNEL
|
1994-03-24 23:12:48 +00:00
|
|
|
/*
|
|
|
|
|
* Routine: pmap_kextract
|
|
|
|
|
* Function:
|
|
|
|
|
* Extract the physical page address associated
|
|
|
|
|
* kernel virtual address.
|
|
|
|
|
*/
|
1994-11-14 14:12:24 +00:00
|
|
|
static __inline vm_offset_t
|
|
|
|
|
pmap_kextract(vm_offset_t va)
|
1994-03-24 23:12:48 +00:00
|
|
|
{
|
|
|
|
|
vm_offset_t pa = *(int *)vtopte(va);
|
|
|
|
|
pa = (pa & PG_FRAME) | (va & ~PG_FRAME);
|
|
|
|
|
return pa;
|
|
|
|
|
}
|
1994-03-25 22:08:59 +00:00
|
|
|
#endif
|
1994-03-24 23:12:48 +00:00
|
|
|
|
1993-06-12 14:58:17 +00:00
|
|
|
/*
|
|
|
|
|
* macros to generate page directory/table indicies
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#define pdei(va) (((va)&PD_MASK)>>PD_SHIFT)
|
|
|
|
|
#define ptei(va) (((va)&PT_MASK)>>PG_SHIFT)
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Pmap stuff
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
struct pmap {
|
|
|
|
|
pd_entry_t *pm_pdir; /* KVA of page directory */
|
|
|
|
|
boolean_t pm_pdchanged; /* pdir changed */
|
|
|
|
|
short pm_dref; /* page directory ref count */
|
|
|
|
|
short pm_count; /* pmap reference count */
|
|
|
|
|
struct pmap_statistics pm_stats; /* pmap statistics */
|
|
|
|
|
long pm_ptpages; /* more stats: PT pages */
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
typedef struct pmap *pmap_t;
|
|
|
|
|
|
|
|
|
|
#ifdef KERNEL
|
|
|
|
|
extern pmap_t kernel_pmap;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Macros for speed
|
|
|
|
|
*/
|
1993-10-12 13:58:01 +00:00
|
|
|
#define PMAP_ACTIVATE(pmapp, pcbp) \
|
1993-06-12 14:58:17 +00:00
|
|
|
if ((pmapp) != NULL /*&& (pmapp)->pm_pdchanged */) { \
|
|
|
|
|
(pcbp)->pcb_cr3 = \
|
1993-12-19 00:55:01 +00:00
|
|
|
pmap_extract(kernel_pmap, (vm_offset_t)(pmapp)->pm_pdir); \
|
1993-06-12 14:58:17 +00:00
|
|
|
if ((pmapp) == &curproc->p_vmspace->vm_pmap) \
|
|
|
|
|
load_cr3((pcbp)->pcb_cr3); \
|
|
|
|
|
(pmapp)->pm_pdchanged = FALSE; \
|
|
|
|
|
}
|
|
|
|
|
|
1993-10-12 13:58:01 +00:00
|
|
|
#define PMAP_DEACTIVATE(pmapp, pcbp)
|
1993-06-12 14:58:17 +00:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* For each vm_page_t, there is a list of all currently valid virtual
|
|
|
|
|
* mappings of that page. An entry is a pv_entry_t, the list is pv_table.
|
|
|
|
|
*/
|
|
|
|
|
typedef struct pv_entry {
|
|
|
|
|
struct pv_entry *pv_next; /* next pv_entry */
|
|
|
|
|
pmap_t pv_pmap; /* pmap where mapping lies */
|
|
|
|
|
vm_offset_t pv_va; /* virtual address for mapping */
|
|
|
|
|
} *pv_entry_t;
|
|
|
|
|
|
|
|
|
|
#define PV_ENTRY_NULL ((pv_entry_t) 0)
|
|
|
|
|
|
|
|
|
|
#define PV_CI 0x01 /* all entries must be cache inhibited */
|
1993-10-12 13:58:01 +00:00
|
|
|
#define PV_PTPAGE 0x02 /* entry maps a page table page */
|
1993-06-12 14:58:17 +00:00
|
|
|
|
|
|
|
|
#ifdef KERNEL
|
|
|
|
|
|
1995-03-16 18:17:34 +00:00
|
|
|
extern caddr_t CADDR1;
|
|
|
|
|
extern pt_entry_t *CMAP1;
|
|
|
|
|
extern vm_offset_t avail_end;
|
|
|
|
|
extern vm_offset_t avail_start;
|
|
|
|
|
extern vm_offset_t phys_avail[6];
|
|
|
|
|
extern pv_entry_t pv_table; /* array of entries, one per page */
|
|
|
|
|
extern vm_offset_t virtual_avail;
|
|
|
|
|
extern vm_offset_t virtual_end;
|
1993-06-12 14:58:17 +00:00
|
|
|
|
1993-10-12 13:58:01 +00:00
|
|
|
#define pa_index(pa) atop(pa - vm_first_phys)
|
|
|
|
|
#define pa_to_pvh(pa) (&pv_table[pa_index(pa)])
|
1993-06-12 14:58:17 +00:00
|
|
|
|
|
|
|
|
#define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count)
|
|
|
|
|
|
1994-11-14 14:12:24 +00:00
|
|
|
struct pcb;
|
|
|
|
|
|
|
|
|
|
void pmap_activate __P((pmap_t, struct pcb *));
|
|
|
|
|
pmap_t pmap_kernel __P((void));
|
|
|
|
|
boolean_t pmap_page_exists __P((pmap_t, vm_offset_t));
|
1995-02-14 06:55:42 +00:00
|
|
|
pt_entry_t *pmap_pte __P((pmap_t, vm_offset_t));
|
1994-11-14 14:12:24 +00:00
|
|
|
vm_page_t pmap_pte_vm_page __P((pmap_t, vm_offset_t));
|
1995-02-14 06:55:42 +00:00
|
|
|
void *pmap_mapdev __P((vm_offset_t, vm_size_t));
|
|
|
|
|
void pmap_growkernel __P((vm_offset_t));
|
|
|
|
|
void pmap_bootstrap __P(( vm_offset_t, vm_offset_t));
|
|
|
|
|
void pmap_use_pt __P((pmap_t, vm_offset_t));
|
|
|
|
|
void pmap_unuse_pt __P((pmap_t, vm_offset_t));
|
1993-12-19 00:55:01 +00:00
|
|
|
|
1993-11-07 17:43:17 +00:00
|
|
|
#endif /* KERNEL */
|
1993-06-12 14:58:17 +00:00
|
|
|
|
1994-11-14 14:12:24 +00:00
|
|
|
#endif /* !_MACHINE_PMAP_H_ */
|
