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