pmap.h revision 1.8 1 /* $NetBSD: pmap.h,v 1.8 1996/07/12 13:16:39 leo Exp $ */
2
3 /*
4 * Copyright (c) 1987 Carnegie-Mellon University
5 * Copyright (c) 1991 Regents of the University of California.
6 * All rights reserved.
7 *
8 * This code is derived from software contributed to Berkeley by
9 * the Systems Programming Group of the University of Utah Computer
10 * Science Department.
11 *
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
14 * are met:
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. All advertising materials mentioning features or use of this software
21 * must display the following acknowledgement:
22 * This product includes software developed by the University of
23 * California, Berkeley and its contributors.
24 * 4. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
27 *
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * SUCH DAMAGE.
39 *
40 * @(#)pmap.h 7.6 (Berkeley) 5/10/91
41 */
42
43 #ifndef _MACHINE_PMAP_H_
44 #define _MACHINE_PMAP_H_
45
46 /*
47 * Pmap stuff (in anticipation of '40 support)
48 */
49 struct pmap {
50 u_int *pm_ptab; /* KVA of page table */
51 u_int *pm_stab; /* KVA of segment table */
52 u_int *pm_rtab; /* KVA of 68040 root table */
53 int pm_stchanged; /* ST changed */
54 short pm_sref; /* segment table ref count */
55 short pm_count; /* pmap reference count */
56 long pm_ptpages; /* more stats: PT pages */
57 simple_lock_data_t pm_lock; /* lock on pmap */
58 struct pmap_statistics pm_stats; /* pmap statistics */
59 };
60
61 typedef struct pmap *pmap_t;
62
63 /*
64 * Macros for speed
65 */
66 #define PMAP_ACTIVATE(pmapp, pcbp, iscurproc) \
67 if ((pmapp) != NULL && (pmapp)->pm_stchanged) { \
68 (pcbp)->pcb_ustp = \
69 atari_btop(pmap_extract(pmap_kernel(), \
70 cpu040 ? (vm_offset_t)(pmapp)->pm_rtab : \
71 (vm_offset_t)(pmapp)->pm_stab)); \
72 if (iscurproc) \
73 loadustp((pcbp)->pcb_ustp); \
74 (pmapp)->pm_stchanged = FALSE; \
75 }
76 #define PMAP_DEACTIVATE(pmapp, pcbp)
77
78 /*
79 * Description of the memory segments. Build in atari_init/start_c().
80 * This gives a better separation between machine dependent stuff and
81 * the pmap-module.
82 */
83 #define NMEM_SEGS 8
84 struct memseg {
85 vm_offset_t start; /* PA of first page in segment */
86 vm_offset_t end; /* PA of last page in segment */
87 int first_page; /* relative page# of 'start' */
88 };
89
90 /*
91 * For each vm_page_t, there is a list of all currently valid virtual
92 * mappings of that page. An entry is a pv_entry_t, the list is pv_table.
93 */
94 typedef struct pv_entry {
95 struct pv_entry *pv_next; /* next pv_entry */
96 struct pmap *pv_pmap; /* pmap where mapping lies */
97 vm_offset_t pv_va; /* virtual address for mapping */
98 u_int *pv_ptste; /* non-zero if VA maps a PT page */
99 struct pmap *pv_ptpmap; /* if pv_ptste, pmap for PT page */
100 int pv_flags; /* flags */
101 } *pv_entry_t;
102
103 #define PV_CI 0x01 /* all entries must be cache inhibited */
104 #define PV_PTPAGE 0x02 /* entry maps a page table page */
105
106 #ifdef _KERNEL
107 /*
108 * Memory segment descriptors.
109 * - boot_segs
110 * describes the segments obtainted from the bootcode.
111 * - usable_segs
112 * describes the segments available after system requirements are
113 * substracted (reserved pages, etc...).
114 */
115 struct memseg boot_segs[NMEM_SEGS];
116 struct memseg usable_segs[NMEM_SEGS];
117
118 pv_entry_t pv_table; /* array of entries, one per page */
119 u_int *Sysmap;
120 char *vmmap; /* map for mem, dumps, etc. */
121 struct pmap kernel_pmap_store;
122
123 #ifdef MACHINE_NONCONTIG
124 #define pa_index(pa) pmap_page_index(pa)
125 #else
126 #define pa_index(pa) atop(pa - vm_first_phys)
127 #endif /* MACHINE_NONCONTIG */
128
129 #define pa_to_pvh(pa) (&pv_table[pa_index(pa)])
130 #define pmap_kernel() (&kernel_pmap_store)
131 #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count)
132
133 void pmap_bootstrap __P((vm_offset_t));
134 #endif /* _KERNEL */
135
136 #endif /* !_MACHINE_PMAP_H_ */
137