Annotation of src/sys/arch/atari/include/pmap.h, Revision 1.15
1.15 ! thorpej 1: /* $NetBSD: pmap.h,v 1.14 1998/01/03 01:13:02 thorpej Exp $ */
1.1 leo 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: /*
1.9 leo 47: * Pmap stuff
1.1 leo 48: */
49: struct pmap {
1.9 leo 50: pt_entry_t *pm_ptab; /* KVA of page table */
51: st_entry_t *pm_stab; /* KVA of segment table */
52: int pm_stchanged; /* ST changed */
53: int pm_stfree; /* 040: free lev2 blocks */
54: u_int *pm_stpa; /* 040: ST phys. address */
55: short pm_sref; /* segment table ref count */
56: short pm_count; /* pmap reference count */
57: long pm_ptpages; /* more stats: PT pages */
1.1 leo 58: simple_lock_data_t pm_lock; /* lock on pmap */
59: struct pmap_statistics pm_stats; /* pmap statistics */
60: };
61:
62: typedef struct pmap *pmap_t;
63:
64: /*
1.9 leo 65: * On the 040 we keep track of which level 2 blocks are already in use
66: * with the pm_stfree mask. Bits are arranged from LSB (block 0) to MSB
67: * (block 31). For convenience, the level 1 table is considered to be
68: * block 0.
69: *
70: * MAX[KU]L2SIZE control how many pages of level 2 descriptors are allowed.
71: * for the kernel and users. 16 implies only the initial "segment table"
72: * page is used. WARNING: don't change MAXUL2SIZE unless you can allocate
73: * physically contiguous pages for the ST in pmap.c!
74: */
75: #define MAXKL2SIZE 32
76: #define MAXUL2SIZE 16
77: #define l2tobm(n) (1 << (n))
78: #define bmtol2(n) (ffs(n) - 1)
79:
80: /*
1.1 leo 81: * Macros for speed
82: */
1.15 ! thorpej 83: #define PMAP_ACTIVATE(pmap, loadhw) \
1.12 thorpej 84: { \
1.15 ! thorpej 85: if ((loadhw)) \
! 86: loadustp(m68k_btop((vm_offset_t)(pmap)->pm_stpa)); \
1.12 thorpej 87: }
1.1 leo 88:
89: /*
1.6 leo 90: * Description of the memory segments. Build in atari_init/start_c().
91: * This gives a better separation between machine dependent stuff and
92: * the pmap-module.
93: */
1.8 leo 94: #define NMEM_SEGS 8
95: struct memseg {
1.6 leo 96: vm_offset_t start; /* PA of first page in segment */
97: vm_offset_t end; /* PA of last page in segment */
98: int first_page; /* relative page# of 'start' */
99: };
100:
101: /*
1.1 leo 102: * For each vm_page_t, there is a list of all currently valid virtual
103: * mappings of that page. An entry is a pv_entry_t, the list is pv_table.
104: */
105: typedef struct pv_entry {
106: struct pv_entry *pv_next; /* next pv_entry */
107: struct pmap *pv_pmap; /* pmap where mapping lies */
108: vm_offset_t pv_va; /* virtual address for mapping */
109: u_int *pv_ptste; /* non-zero if VA maps a PT page */
110: struct pmap *pv_ptpmap; /* if pv_ptste, pmap for PT page */
111: int pv_flags; /* flags */
112: } *pv_entry_t;
113:
114: #define PV_CI 0x01 /* all entries must be cache inhibited */
115: #define PV_PTPAGE 0x02 /* entry maps a page table page */
116:
1.9 leo 117: struct pv_page;
118:
119: struct pv_page_info {
120: TAILQ_ENTRY(pv_page) pgi_list;
121: struct pv_entry *pgi_freelist;
122: int pgi_nfree;
123: };
124:
125: /*
126: * This is basically:
127: * ((NBPG - sizeof(struct pv_page_info)) / sizeof(struct pv_entry))
128: */
129: #define NPVPPG 340
130:
131: struct pv_page {
132: struct pv_page_info pvp_pgi;
133: struct pv_entry pvp_pv[NPVPPG];
134: };
135:
1.2 leo 136: #ifdef _KERNEL
1.8 leo 137: /*
138: * Memory segment descriptors.
139: * - boot_segs
140: * describes the segments obtainted from the bootcode.
141: * - usable_segs
142: * describes the segments available after system requirements are
143: * substracted (reserved pages, etc...).
144: */
145: struct memseg boot_segs[NMEM_SEGS];
146: struct memseg usable_segs[NMEM_SEGS];
147:
1.3 mycroft 148: pv_entry_t pv_table; /* array of entries, one per page */
149: u_int *Sysmap;
150: char *vmmap; /* map for mem, dumps, etc. */
151: struct pmap kernel_pmap_store;
1.1 leo 152:
1.6 leo 153: #ifdef MACHINE_NONCONTIG
154: #define pa_index(pa) pmap_page_index(pa)
155: #else
156: #define pa_index(pa) atop(pa - vm_first_phys)
157: #endif /* MACHINE_NONCONTIG */
1.7 leo 158:
1.6 leo 159: #define pa_to_pvh(pa) (&pv_table[pa_index(pa)])
160: #define pmap_kernel() (&kernel_pmap_store)
1.1 leo 161: #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count)
1.7 leo 162:
1.12 thorpej 163: #define active_user_pmap(pm) \
164: (curproc && \
165: (pm) != pmap_kernel() && (pm) == curproc->p_vmspace->vm_map.pmap)
166:
1.9 leo 167: void pmap_bootstrap __P((vm_offset_t, u_int, u_int));
1.10 leo 168: void pmap_changebit __P((vm_offset_t, int, boolean_t));
1.12 thorpej 169:
1.5 leo 170: #endif /* _KERNEL */
1.1 leo 171:
172: #endif /* !_MACHINE_PMAP_H_ */
CVSweb <webmaster@jp.NetBSD.org>
![[BACK]](/icons/back.gif){kind=icon}
Return to pmap.h CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [cvs.NetBSD.org] / src / sys / arch / atari / include