1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
|
/* $OpenBSD: pmap.h,v 1.10 1999/11/16 16:42:29 mickey Exp $ */
/*
* Copyright (c) 1998,1999 Michael Shalayeff
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Michael Shalayeff.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*
* Copyright 1996 1995 by Open Software Foundation, Inc.
* All Rights Reserved
*
* Permission to use, copy, modify, and distribute this software and
* its documentation for any purpose and without fee is hereby granted,
* provided that the above copyright notice appears in all copies and
* that both the copyright notice and this permission notice appear in
* supporting documentation.
*
* OSF DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE.
*
* IN NO EVENT SHALL OSF BE LIABLE FOR ANY SPECIAL, INDIRECT, OR
* CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
* LOSS OF USE, DATA OR PROFITS, WHETHER IN ACTION OF CONTRACT,
* NEGLIGENCE, OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
* WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
/*
* Copyright (c) 1990,1993,1994 The University of Utah and
* the Computer Systems Laboratory at the University of Utah (CSL).
* All rights reserved.
*
* Permission to use, copy, modify and distribute this software is hereby
* granted provided that (1) source code retains these copyright, permission,
* and disclaimer notices, and (2) redistributions including binaries
* reproduce the notices in supporting documentation, and (3) all advertising
* materials mentioning features or use of this software display the following
* acknowledgement: ``This product includes software developed by the
* Computer Systems Laboratory at the University of Utah.''
*
* THE UNIVERSITY OF UTAH AND CSL ALLOW FREE USE OF THIS SOFTWARE IN ITS "AS
* IS" CONDITION. THE UNIVERSITY OF UTAH AND CSL DISCLAIM ANY LIABILITY OF
* ANY KIND FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
*
* CSL requests users of this software to return to csl-dist@cs.utah.edu any
* improvements that they make and grant CSL redistribution rights.
*
* Utah $Hdr: pmap.h 1.24 94/12/14$
* Author: Mike Hibler, Bob Wheeler, University of Utah CSL, 9/90
*/
/*
* Pmap header for hppa.
*/
#ifndef _MACHINE_PMAP_H_
#define _MACHINE_PMAP_H_
#include <machine/pte.h>
typedef
struct pmap {
TAILQ_ENTRY(pmap) pmap_list; /* pmap free list */
struct simplelock pmap_lock; /* lock on map */
int pmap_refcnt; /* reference count */
pa_space_t pmap_space; /* space for this pmap */
u_int pmap_pid; /* protection id for pmap */
struct pmap_statistics pmap_stats; /* statistics */
} *pmap_t;
extern pmap_t kernel_pmap; /* The kernel's map */
/*
* If HPT is defined, we cache the last miss for each bucket using a
* structure defined for the 7100 hardware TLB walker. On non-7100s, this
* acts as a software cache that cuts down on the number of times we have
* to search the hash chain. (thereby reducing the number of instructions
* and cache misses incurred during the TLB miss).
*
* The pv_entry pointer is the address of the associated hash bucket
* list for fast tlbmiss search.
*/
struct hpt_entry {
u_int hpt_valid:1, /* Valid bit */
hpt_vpn:15, /* Virtual Page Number */
hpt_space:16; /* Space ID */
u_int hpt_tlbprot; /* prot/access rights (for TLB load) */
u_int hpt_tlbpage; /* physical page (<<5 for TLB load) */
void *hpt_entry; /* Pointer to associated hash list */
};
#ifdef _KERNEL
extern struct hpt_entry *hpt_table;
#endif /* _KERNEL */
/*
* keep it at 32 bytes for the cache overall satisfaction
* also, align commonly used pairs on double-word boundary
*/
struct pv_entry {
struct pv_entry *pv_next; /* list of mappings of a given PA */
pmap_t pv_pmap; /* back link to pmap */
u_int pv_va; /* virtual page number */
u_int pv_space; /* copy of space id from pmap */
u_int pv_tlbpage; /* physical page (for TLB load) */
u_int pv_tlbprot; /* TLB format protection */
struct pv_entry *pv_hash; /* VTOP hash bucket list */
u_int pv_pad; /* pad to 32 bytes */
};
#define NPVPPG (NBPG/32-1)
struct pv_page {
TAILQ_ENTRY(pv_page) pvp_list; /* Chain of pages */
u_int pvp_nfree;
struct pv_entry *pvp_freelist;
u_int pvp_flag; /* is it direct mapped (unused) */
u_int pvp_pad[3]; /* align to 32 */
struct pv_entry pvp_pv[NPVPPG];
};
struct pmap_physseg {
struct pv_entry *pvent;
};
#define HPPA_MAX_PID 0xfffa
#define HPPA_SID_KERNEL 0
#define HPPA_PID_KERNEL 2
#define KERNEL_ACCESS_ID 1
#define KERNEL_TEXT_PROT (TLB_AR_KRX | (KERNEL_ACCESS_ID << 1))
#define KERNEL_DATA_PROT (TLB_AR_KRW | (KERNEL_ACCESS_ID << 1))
#ifdef _KERNEL
#define cache_align(x) (((x) + dcache_line_mask) & ~(dcache_line_mask))
extern int dcache_line_mask;
extern void gateway_page __P((void));
#define PMAP_STEAL_MEMORY /* we have some memory to steal */
#define pmap_kernel_va(VA) \
(((VA) >= VM_MIN_KERNEL_ADDRESS) && ((VA) <= VM_MAX_KERNEL_ADDRESS))
#define pmap_kernel() (kernel_pmap)
#define pmap_resident_count(pmap) ((pmap)->pmap_stats.resident_count)
#define pmap_reference(pmap) \
do { if (pmap) { \
simple_lock(&pmap->pmap_lock); \
pmap->pmap_refcnt++; \
simple_unlock(&pmap->pmap_lock); \
} } while (0)
#define pmap_collect(pmap)
#define pmap_release(pmap)
#define pmap_pageable(pmap, start, end, pageable)
#define pmap_copy(dpmap,spmap,da,len,sa)
#define pmap_update()
#define pmap_activate(p)
#define pmap_deactivate(p)
#define pmap_phys_address(x) ((x) << PGSHIFT)
#define pmap_phys_to_frame(x) ((x) >> PGSHIFT)
static __inline int
pmap_prot(struct pmap *pmap, int prot)
{
extern u_int kern_prot[], user_prot[];
return (pmap == kernel_pmap? kern_prot: user_prot)[prot];
}
void pmap_bootstrap __P((vaddr_t *, vaddr_t *));
void pmap_changebit __P((vaddr_t, u_int, u_int));
#endif /* _KERNEL */
#endif /* _MACHINE_PMAP_H_ */
|
