pmap.h revision 1.20 1 1.20 ragge /* $NetBSD: pmap.h,v 1.20 1997/11/02 14:25:20 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.1 ragge #ifndef PMAP_H
47 1.1 ragge #define PMAP_H
48 1.1 ragge
49 1.12 mycroft #include <machine/mtpr.h>
50 1.5 ragge
51 1.1 ragge /*
52 1.20 ragge * Pmap structure
53 1.20 ragge * pm_stack holds lowest allocated memory for the process stack.
54 1.20 ragge * pm_pcb is a pointer to the corresponding pcb.
55 1.1 ragge */
56 1.1 ragge
57 1.1 ragge typedef struct pmap {
58 1.5 ragge vm_offset_t pm_stack; /* Base of alloced p1 pte space */
59 1.5 ragge struct pcb *pm_pcb; /* Pointer to PCB for this pmap */
60 1.5 ragge int ref_count; /* reference count */
61 1.1 ragge } *pmap_t;
62 1.1 ragge
63 1.1 ragge /*
64 1.1 ragge * For each vm_page_t, there is a list of all currently valid virtual
65 1.1 ragge * mappings of that page. An entry is a pv_entry_t, the list is pv_table.
66 1.1 ragge */
67 1.1 ragge
68 1.1 ragge typedef struct pv_entry {
69 1.9 ragge struct pv_entry *pv_next; /* next pv_entry */
70 1.20 ragge struct pte *pv_pte; /* pte for this physical page */
71 1.1 ragge } *pv_entry_t;
72 1.1 ragge
73 1.11 ragge /* ROUND_PAGE used before vm system is initialized */
74 1.11 ragge #define ROUND_PAGE(x) (((uint)(x) + PAGE_SIZE-1)& ~(PAGE_SIZE - 1))
75 1.17 ragge #define TRUNC_PAGE(x) ((uint)(x) & ~(PAGE_SIZE - 1))
76 1.11 ragge
77 1.11 ragge /* Mapping macros used when allocating SPT */
78 1.11 ragge #define MAPVIRT(ptr, count) \
79 1.11 ragge (vm_offset_t)ptr = virtual_avail; \
80 1.11 ragge virtual_avail += (count) * NBPG;
81 1.11 ragge
82 1.11 ragge #define MAPPHYS(ptr, count, perm) \
83 1.20 ragge (vm_offset_t)ptr = avail_start + KERNBASE; \
84 1.11 ragge avail_start += (count) * NBPG;
85 1.1 ragge
86 1.10 jtc #ifdef _KERNEL
87 1.15 ragge
88 1.15 ragge extern struct pmap kernel_pmap_store;
89 1.1 ragge
90 1.7 mycroft #define pmap_kernel() (&kernel_pmap_store)
91 1.1 ragge
92 1.10 jtc #endif /* _KERNEL */
93 1.5 ragge
94 1.5 ragge /* Routines that are best to define as macros */
95 1.5 ragge #define pmap_copy(a,b,c,d,e) /* Dont do anything */
96 1.5 ragge #define pmap_update() mtpr(0,PR_TBIA) /* Update buffes */
97 1.5 ragge #define pmap_pageable(a,b,c,d) /* Dont do anything */
98 1.9 ragge #define pmap_collect(pmap) /* No need so far */
99 1.5 ragge #define pmap_reference(pmap) if(pmap) (pmap)->ref_count++
100 1.5 ragge #define pmap_pinit(pmap) (pmap)->ref_count=1;
101 1.13 ragge #define pmap_phys_address(phys) ((u_int)(phys)<<PAGE_SHIFT)
102 1.20 ragge #define pmap_is_referenced(phys) (FALSE)
103 1.20 ragge #define pmap_clear_reference(pa) pmap_page_protect(pa, VM_PROT_NONE)
104 1.20 ragge #define pmap_change_wiring(pmap, v, w) /* no need */
105 1.20 ragge #define pmap_remove(pmap, start, slut) pmap_protect(pmap, start, slut, 0)
106 1.20 ragge
107 1.20 ragge /* These can be done as efficient inline macros */
108 1.20 ragge #define pmap_copy_page(src, dst) \
109 1.20 ragge asm("addl3 $0x80000000,%0,r0;addl3 $0x80000000,%1,r1; \
110 1.20 ragge movc3 $1024,(r0),(r1)" \
111 1.20 ragge :: "r"(src),"r"(dst):"r0","r1","r2","r3","r4","r5");
112 1.20 ragge
113 1.20 ragge #define pmap_zero_page(phys) \
114 1.20 ragge asm("addl3 $0x80000000,%0,r0;movc5 $0,(r0),$0,$1024,(r0)" \
115 1.20 ragge :: "r"(phys): "r0","r1","r2","r3","r4","r5");
116 1.1 ragge
117 1.16 ragge /* Prototypes */
118 1.16 ragge void pmap_bootstrap __P((void));
119 1.1 ragge #endif PMAP_H
120