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