|
|
1.1 root 1: /*
2: * Copyright (c) 1987 Carnegie-Mellon University
3: * Copyright (c) 1991 Regents of the University of California.
4: * All rights reserved.
5: *
6: * This code is derived from software contributed to Berkeley by
7: * the Systems Programming Group of the University of Utah Computer
8: * Science Department.
9: *
10: * Redistribution and use in source and binary forms, with or without
11: * modification, are permitted provided that the following conditions
12: * are met:
13: * 1. Redistributions of source code must retain the above copyright
14: * notice, this list of conditions and the following disclaimer.
15: * 2. Redistributions in binary form must reproduce the above copyright
16: * notice, this list of conditions and the following disclaimer in the
17: * documentation and/or other materials provided with the distribution.
18: * 3. All advertising materials mentioning features or use of this software
19: * must display the following acknowledgement:
20: * This product includes software developed by the University of
21: * California, Berkeley and its contributors.
22: * 4. Neither the name of the University nor the names of its contributors
23: * may be used to endorse or promote products derived from this software
24: * without specific prior written permission.
25: *
26: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36: * SUCH DAMAGE.
37: *
1.1.1.2 ! root 38: * from: @(#)pmap.h 7.6 (Berkeley) 5/10/91
! 39: * pmap.h,v 1.2 1993/05/22 07:58:28 cgd Exp
1.1 root 40: */
41:
42: #ifndef _PMAP_MACHINE_
43: #define _PMAP_MACHINE_
44:
45: #define HP_PAGE_SIZE NBPG
46: #define HP_SEG_SIZE NBSEG
47:
48: /*
49: * Pmap stuff
50: */
51: struct pmap {
52: struct pte *pm_ptab; /* KVA of page table */
53: struct ste *pm_stab; /* KVA of segment table */
54: int pm_stchanged; /* ST changed */
55: short pm_sref; /* segment table ref count */
56: short pm_count; /* pmap reference count */
57: simple_lock_data_t pm_lock; /* lock on pmap */
58: struct pmap_statistics pm_stats; /* pmap statistics */
59: long pm_ptpages; /* more stats: PT pages */
60: };
61:
62: typedef struct pmap *pmap_t;
63:
64: extern pmap_t kernel_pmap;
65:
66: /*
67: * Macros for speed
68: */
69: #define PMAP_ACTIVATE(pmapp, pcbp, iscurproc) \
70: if ((pmapp) != NULL && (pmapp)->pm_stchanged) { \
71: (pcbp)->pcb_ustp = \
72: hp300_btop(pmap_extract(kernel_pmap, (pmapp)->pm_stab)); \
73: if (iscurproc) \
74: loadustp((pcbp)->pcb_ustp); \
75: (pmapp)->pm_stchanged = FALSE; \
76: }
77: #define PMAP_DEACTIVATE(pmapp, pcbp)
78:
79: /*
80: * For each vm_page_t, there is a list of all currently valid virtual
81: * mappings of that page. An entry is a pv_entry_t, the list is pv_table.
82: */
83: typedef struct pv_entry {
84: struct pv_entry *pv_next; /* next pv_entry */
85: struct pmap *pv_pmap; /* pmap where mapping lies */
86: vm_offset_t pv_va; /* virtual address for mapping */
87: struct ste *pv_ptste; /* non-zero if VA maps a PT page */
88: struct pmap *pv_ptpmap; /* if pv_ptste, pmap for PT page */
89: int pv_flags; /* flags */
90: } *pv_entry_t;
91:
92: #define PV_CI 0x01 /* all entries must be cache inhibited */
93: #define PV_PTPAGE 0x02 /* entry maps a page table page */
94:
95: #ifdef KERNEL
96: pv_entry_t pv_table; /* array of entries, one per page */
97:
98: #define pa_index(pa) atop(pa - vm_first_phys)
99: #define pa_to_pvh(pa) (&pv_table[pa_index(pa)])
100:
101: #define pmap_kernel() (kernel_pmap)
102: #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count)
103:
104: extern struct pte *Sysmap;
105: extern char *vmmap; /* map for mem, dumps, etc. */
106: #endif KERNEL
107:
108: #endif _PMAP_MACHINE_
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.