1 /*
2 * Copyright (c) 1991 Regents of the University of California.
3 * All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * the Systems Programming Group of the University of Utah Computer
7 * Science Department and William Jolitz of UUNET Technologies Inc.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * SUCH DAMAGE.
36 *
37 * Derived from hp300 version by Mike Hibler, this version by William
38 * Jolitz uses a recursive map [a pde points to the page directory] to
39 * map the page tables using the pagetables themselves. This is done to
40 * reduce the impact on kernel virtual memory for lots of sparse address
41 * space, and to reduce the cost of memory to each process.
42 *
43 * from: hp300: @(#)pmap.h 7.2 (Berkeley) 12/16/90
44 * from: @(#)pmap.h 7.4 (Berkeley) 5/12/91
45 * $FreeBSD: src/sys/i386/include/pmap.h,v 1.46.2.1 1999/09/05 08:11:58 peter Exp $
46 */
47
48 #ifndef _MACHINE_PMAP_H_
49 #define _MACHINE_PMAP_H_
50
51 /*
52 * Page-directory and page-table entires follow this format, with a few
53 * of the fields not present here and there, depending on a lot of things.
54 */
55 /* ---- Intel Nomenclature ---- */
56 #define PG_V 0x001 /* P Valid */
57 #define PG_RW 0x002 /* R/W Read/Write */
58 #define PG_U 0x004 /* U/S User/Supervisor */
59 #define PG_NC_PWT 0x008 /* PWT Write through */
60 #define PG_NC_PCD 0x010 /* PCD Cache disable */
61 #define PG_A 0x020 /* A Accessed */
62 #define PG_M 0x040 /* D Dirty */
63 #define PG_PS 0x080 /* PS Page size (0=4k,1=4M) */
64 #define PG_G 0x100 /* G Global */
65 #define PG_AVAIL1 0x200 /* / Available for system */
66 #define PG_AVAIL2 0x400 /* < programmers use */
67 #define PG_AVAIL3 0x800 /* \ */
68
69
70 /* Our various interpretations of the above */
71 #define PG_W PG_AVAIL1 /* "Wired" pseudoflag */
72 #define PG_MANAGED PG_AVAIL2
73 #define PG_FRAME (~PAGE_MASK)
74 #define PG_PROT (PG_RW|PG_U) /* all protection bits . */
75 #define PG_N (PG_NC_PWT|PG_NC_PCD) /* Non-cacheable */
76
77 /*
78 * Page Protection Exception bits
79 */
80
81 #define PGEX_P 0x01 /* Protection violation vs. not present */
82 #define PGEX_W 0x02 /* during a Write cycle */
83 #define PGEX_U 0x04 /* access from User mode (UPL) */
84
85 /*
86 * Pte related macros
87 */
88 #define VADDR(pdi, pti) ((vm_offset_t)(((pdi)<<PDRSHIFT)|((pti)<<PAGE_SHIFT)))
89
90 #ifndef NKPT
91 #define NKPT 9 /* actual number of kernel page tables */
92 #endif
93 #ifndef NKPDE
94 #define NKPDE 63 /* addressable number of page tables/pde's */
95 #endif
96
97 /*
98 * The *PTDI values control the layout of virtual memory
99 *
100 * XXX This works for now, but I am not real happy with it, I'll fix it
101 * right after I fix locore.s and the magic 28K hole
102 */
103 #define APTDPTDI (NPDEPG-1) /* alt ptd entry that points to APTD */
104 #define KPTDI (APTDPTDI-NKPDE)/* start of kernel virtual pde's */
105 #define PTDPTDI (KPTDI-1) /* ptd entry that points to ptd! */
106 #define KSTKPTDI (PTDPTDI-1) /* ptd entry for u./kernel&user stack */
107 #define KSTKPTEOFF (NPTEPG-UPAGES) /* pte entry for kernel stack */
108
109 /*
110 * XXX doesn't really belong here I guess...
111 */
112 #define ISA_HOLE_START 0xa0000
113 #define ISA_HOLE_LENGTH (0x100000-ISA_HOLE_START)
114
115 #ifndef LOCORE
116
117 #include <sys/queue.h>
118
119 typedef unsigned int *pd_entry_t;
120 typedef unsigned int *pt_entry_t;
121
122 #define PDESIZE sizeof(pd_entry_t) /* for assembly files */
123 #define PTESIZE sizeof(pt_entry_t) /* for assembly files */
124
125 /*
126 * Address of current and alternate address space page table maps
127 * and directories.
128 */
129 #ifdef KERNEL
130 extern pt_entry_t PTmap[], APTmap[], Upte;
131 extern pd_entry_t PTD[], APTD[], PTDpde, APTDpde, Upde;
132
133 extern int IdlePTD; /* physical address of "Idle" state directory */
134 #endif
135
136 /*
137 * virtual address to page table entry and
138 * to physical address. Likewise for alternate address space.
139 * Note: these work recursively, thus vtopte of a pte will give
140 * the corresponding pde that in turn maps it.
141 */
142 #define vtopte(va) (PTmap + i386_btop(va))
143 #define vtophys(va) (((int) (*vtopte(va))&PG_FRAME) | ((int)(va) & PAGE_MASK))
144
145 #define avtopte(va) (APTmap + i386_btop(va))
146 #define avtophys(va) (((int) (*avtopte(va))&PG_FRAME) | ((int)(va) & PAGE_MASK))
147
148 #ifdef KERNEL
149 /*
150 * Routine: pmap_kextract
151 * Function:
152 * Extract the physical page address associated
153 * kernel virtual address.
154 */
155 static __inline vm_offset_t
156 pmap_kextract(vm_offset_t va)
157 {
158 vm_offset_t pa = *(int *)vtopte(va);
159 pa = (pa & PG_FRAME) | (va & PAGE_MASK);
160 return pa;
161 }
162 #endif
163
164 /*
165 * Pmap stuff
166 */
167 struct pv_entry;
168 typedef struct {
169 int pv_list_count;
170 struct vm_page *pv_vm_page;
171 TAILQ_HEAD(,pv_entry) pv_list;
172 } pv_table_t;
173
174 struct pmap {
175 pd_entry_t *pm_pdir; /* KVA of page directory */
176 vm_object_t pm_pteobj; /* Container for pte's */
177 TAILQ_HEAD(,pv_entry) pm_pvlist; /* list of mappings in pmap */
178 int pm_count; /* reference count */
179 int pm_flags; /* pmap flags */
180 struct pmap_statistics pm_stats; /* pmap statistics */
181 struct vm_page *pm_ptphint; /* pmap ptp hint */
182 };
183
184 #define pmap_resident_count(pmap) (pmap)->pm_stats.resident_count
185
186 #define PM_FLAG_LOCKED 0x1
187 #define PM_FLAG_WANTED 0x2
188
189 typedef struct pmap *pmap_t;
190
191 #ifdef KERNEL
192 extern pmap_t kernel_pmap;
193 #endif
194
195 /*
196 * For each vm_page_t, there is a list of all currently valid virtual
197 * mappings of that page. An entry is a pv_entry_t, the list is pv_table.
198 */
199 typedef struct pv_entry {
200 pmap_t pv_pmap; /* pmap where mapping lies */
201 vm_offset_t pv_va; /* virtual address for mapping */
202 TAILQ_ENTRY(pv_entry) pv_list;
203 #if PMAP_PVLIST
204 TAILQ_ENTRY(pv_entry) pv_plist;
205 #endif
206 vm_page_t pv_ptem; /* VM page for pte */
207 } *pv_entry_t;
208
209 #define PV_ENTRY_NULL ((pv_entry_t) 0)
210
211 #define PV_CI 0x01 /* all entries must be cache inhibited */
212 #define PV_PTPAGE 0x02 /* entry maps a page table page */
213
214 #ifdef KERNEL
215
216 extern caddr_t CADDR1;
217 extern pt_entry_t *CMAP1;
218 extern vm_offset_t avail_end;
219 extern vm_offset_t avail_start;
220 extern vm_offset_t phys_avail[];
221 extern vm_offset_t virtual_avail;
222 extern vm_offset_t virtual_end;
223
224 void pmap_bootstrap __P(( vm_offset_t, vm_offset_t));
225 pmap_t pmap_kernel __P((void));
226 void *pmap_mapdev __P((vm_offset_t, vm_size_t));
227 unsigned *pmap_pte __P((pmap_t, vm_offset_t)) __pure2;
228 vm_page_t pmap_use_pt __P((pmap_t, vm_offset_t));
229
230 #endif /* KERNEL */
231
232 #endif /* !LOCORE */
233
234 #endif /* !_MACHINE_PMAP_H_ */
Cache object: ced0354cea7ef0772d9d6e0fe37b92f3
|