pmap.h revision 1.52 1 1.52 ragge /* $NetBSD: pmap.h,v 1.52 2002/03/10 22:32:31 ragge Exp $ */
2 1.4 cgd
3 1.1 ragge /*
4 1.1 ragge * Copyright (c) 1987 Carnegie-Mellon University
5 1.1 ragge * Copyright (c) 1991 Regents of the University of California.
6 1.1 ragge * All rights reserved.
7 1.1 ragge *
8 1.1 ragge * Changed for the VAX port. /IC
9 1.1 ragge *
10 1.1 ragge * This code is derived from software contributed to Berkeley by
11 1.1 ragge * the Systems Programming Group of the University of Utah Computer
12 1.1 ragge * Science Department.
13 1.1 ragge *
14 1.1 ragge * Redistribution and use in source and binary forms, with or without
15 1.1 ragge * modification, are permitted provided that the following conditions
16 1.1 ragge * are met:
17 1.1 ragge * 1. Redistributions of source code must retain the above copyright
18 1.1 ragge * notice, this list of conditions and the following disclaimer.
19 1.1 ragge * 2. Redistributions in binary form must reproduce the above copyright
20 1.1 ragge * notice, this list of conditions and the following disclaimer in the
21 1.1 ragge * documentation and/or other materials provided with the distribution.
22 1.1 ragge * 3. All advertising materials mentioning features or use of this software
23 1.1 ragge * must display the following acknowledgement:
24 1.1 ragge * This product includes software developed by the University of
25 1.1 ragge * California, Berkeley and its contributors.
26 1.1 ragge * 4. Neither the name of the University nor the names of its contributors
27 1.1 ragge * may be used to endorse or promote products derived from this software
28 1.1 ragge * without specific prior written permission.
29 1.1 ragge *
30 1.1 ragge * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
31 1.1 ragge * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
32 1.1 ragge * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
33 1.1 ragge * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
34 1.1 ragge * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
35 1.1 ragge * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
36 1.1 ragge * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
37 1.1 ragge * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
38 1.1 ragge * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
39 1.1 ragge * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 1.1 ragge * SUCH DAMAGE.
41 1.1 ragge *
42 1.4 cgd * @(#)pmap.h 7.6 (Berkeley) 5/10/91
43 1.1 ragge */
44 1.1 ragge
45 1.1 ragge
46 1.37 ragge #ifndef PMAP_H
47 1.37 ragge #define PMAP_H
48 1.1 ragge
49 1.37 ragge #include <machine/pte.h>
50 1.12 mycroft #include <machine/mtpr.h>
51 1.37 ragge #include <machine/pcb.h>
52 1.5 ragge
53 1.37 ragge /*
54 1.37 ragge * Some constants to make life easier.
55 1.37 ragge */
56 1.37 ragge #define LTOHPS (PGSHIFT - VAX_PGSHIFT)
57 1.37 ragge #define LTOHPN (1 << LTOHPS)
58 1.52 ragge #define PROCPTSIZE ((MAXTSIZ + MAXDSIZ + MAXSSIZ + MMAPSPACE) / VAX_NBPG)
59 1.52 ragge #define NPTEPGS (PROCPTSIZE / (NBPG / (sizeof(struct pte) * LTOHPN)))
60 1.52 ragge
61 1.52 ragge /*
62 1.52 ragge * Link struct if more than one process share pmap (like vfork).
63 1.52 ragge * This is rarely used.
64 1.52 ragge */
65 1.52 ragge struct pm_share {
66 1.52 ragge struct pm_share *ps_next;
67 1.52 ragge struct pcb *ps_pcb;
68 1.52 ragge };
69 1.22 thorpej
70 1.1 ragge /*
71 1.20 ragge * Pmap structure
72 1.20 ragge * pm_stack holds lowest allocated memory for the process stack.
73 1.1 ragge */
74 1.1 ragge
75 1.1 ragge typedef struct pmap {
76 1.52 ragge struct pte *pm_p1ap; /* Base of alloced p1 pte space */
77 1.52 ragge short pm_count; /* reference count */
78 1.52 ragge short pm_flags;
79 1.52 ragge #define PM_ACTIVE 1 /* Process connected to pmap */
80 1.52 ragge struct pte *pm_p0base; /* Pointer to saved ptes */
81 1.52 ragge struct pm_share *pm_share; /* PCBs using this pmap */
82 1.30 ragge struct pte *pm_p0br; /* page 0 base register */
83 1.30 ragge long pm_p0lr; /* page 0 length register */
84 1.30 ragge struct pte *pm_p1br; /* page 1 base register */
85 1.30 ragge long pm_p1lr; /* page 1 length register */
86 1.52 ragge u_char *pm_pref; /* pte reference count array */
87 1.52 ragge struct pte *pm_p1base; /* Number of pages wired */
88 1.39 ragge struct simplelock pm_lock; /* Lock entry in MP environment */
89 1.30 ragge struct pmap_statistics pm_stats; /* Some statistics */
90 1.1 ragge } *pmap_t;
91 1.1 ragge
92 1.1 ragge /*
93 1.45 chs * For each struct vm_page, there is a list of all currently valid virtual
94 1.1 ragge * mappings of that page. An entry is a pv_entry_t, the list is pv_table.
95 1.1 ragge */
96 1.1 ragge
97 1.30 ragge struct pv_entry {
98 1.37 ragge struct pv_entry *pv_next; /* next pv_entry */
99 1.52 ragge vaddr_t pv_vaddr; /* address for this physical page */
100 1.29 ragge struct pmap *pv_pmap; /* pmap this entry belongs to */
101 1.29 ragge int pv_attr; /* write/modified bits */
102 1.30 ragge };
103 1.11 ragge
104 1.11 ragge /* Mapping macros used when allocating SPT */
105 1.38 matt #define MAPVIRT(ptr, count) \
106 1.38 matt (vaddr_t)ptr = virtual_avail; \
107 1.30 ragge virtual_avail += (count) * VAX_NBPG;
108 1.11 ragge
109 1.38 matt #define MAPPHYS(ptr, count, perm) \
110 1.38 matt (vaddr_t)ptr = avail_start + KERNBASE; \
111 1.30 ragge avail_start += (count) * VAX_NBPG;
112 1.1 ragge
113 1.10 jtc #ifdef _KERNEL
114 1.15 ragge
115 1.15 ragge extern struct pmap kernel_pmap_store;
116 1.1 ragge
117 1.37 ragge #define pmap_kernel() (&kernel_pmap_store)
118 1.1 ragge
119 1.10 jtc #endif /* _KERNEL */
120 1.33 ragge
121 1.33 ragge /*
122 1.33 ragge * Real nice (fast) routines to get the virtual address of a physical page
123 1.33 ragge * (and vice versa).
124 1.33 ragge */
125 1.37 ragge #define PMAP_MAP_POOLPAGE(pa) ((pa) | KERNBASE)
126 1.37 ragge #define PMAP_UNMAP_POOLPAGE(va) ((va) & ~KERNBASE)
127 1.37 ragge
128 1.37 ragge #define PMAP_STEAL_MEMORY
129 1.37 ragge
130 1.37 ragge /*
131 1.37 ragge * This is the by far most used pmap routine. Make it inline.
132 1.37 ragge */
133 1.37 ragge __inline static boolean_t
134 1.37 ragge pmap_extract(pmap_t pmap, vaddr_t va, paddr_t *pap)
135 1.37 ragge {
136 1.37 ragge paddr_t pa = 0;
137 1.37 ragge int *pte, sva;
138 1.37 ragge
139 1.37 ragge if (va & KERNBASE) {
140 1.37 ragge pa = kvtophys(va); /* Is 0 if not mapped */
141 1.37 ragge if (pap)
142 1.37 ragge *pap = pa;
143 1.37 ragge if (pa)
144 1.37 ragge return (TRUE);
145 1.37 ragge return (FALSE);
146 1.37 ragge }
147 1.37 ragge
148 1.37 ragge sva = PG_PFNUM(va);
149 1.37 ragge if (va < 0x40000000) {
150 1.37 ragge if (sva > (pmap->pm_p0lr & ~AST_MASK))
151 1.37 ragge return FALSE;
152 1.37 ragge pte = (int *)pmap->pm_p0br;
153 1.37 ragge } else {
154 1.37 ragge if (sva < pmap->pm_p1lr)
155 1.37 ragge return FALSE;
156 1.37 ragge pte = (int *)pmap->pm_p1br;
157 1.37 ragge }
158 1.37 ragge if (kvtopte(&pte[sva])->pg_pfn) {
159 1.37 ragge if (pap)
160 1.37 ragge *pap = (pte[sva] & PG_FRAME) << VAX_PGSHIFT;
161 1.37 ragge return (TRUE);
162 1.37 ragge }
163 1.37 ragge return (FALSE);
164 1.37 ragge }
165 1.36 ragge
166 1.5 ragge
167 1.5 ragge /* Routines that are best to define as macros */
168 1.37 ragge #define pmap_phys_address(phys) ((u_int)(phys) << PGSHIFT)
169 1.37 ragge #define pmap_copy(a,b,c,d,e) /* Dont do anything */
170 1.48 chris #define pmap_update(pmap) /* nothing (yet) */
171 1.37 ragge #define pmap_collect(pmap) /* No need so far */
172 1.37 ragge #define pmap_remove(pmap, start, slut) pmap_protect(pmap, start, slut, 0)
173 1.37 ragge #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count)
174 1.49 chs #define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count)
175 1.52 ragge #define pmap_reference(pmap) (pmap)->pm_count++
176 1.20 ragge
177 1.20 ragge /* These can be done as efficient inline macros */
178 1.50 matt #define pmap_copy_page(src, dst) \
179 1.50 matt __asm__("addl3 $0x80000000,%0,%%r0;" \
180 1.50 matt "addl3 $0x80000000,%1,%%r1;" \
181 1.50 matt "movc3 $4096,(%%r0),(%%r1)" \
182 1.50 matt :: "r"(src), "r"(dst) \
183 1.50 matt : "r0","r1","r2","r3","r4","r5");
184 1.50 matt
185 1.50 matt #define pmap_zero_page(phys) \
186 1.50 matt __asm__("addl3 $0x80000000,%0,%%r0;" \
187 1.50 matt "movc5 $0,(%%r0),$0,$4096,(%%r0)" \
188 1.50 matt :: "r"(phys) \
189 1.50 matt : "r0","r1","r2","r3","r4","r5");
190 1.1 ragge
191 1.16 ragge /* Prototypes */
192 1.16 ragge void pmap_bootstrap __P((void));
193 1.38 matt vaddr_t pmap_map __P((vaddr_t, vaddr_t, vaddr_t, int));
194 1.22 thorpej
195 1.47 simonb #endif /* PMAP_H */
196