dvma.c revision 1.3 1 1.3 pk /* $NetBSD: dvma.c,v 1.3 1999/02/15 18:59:36 pk Exp $ */
2 1.1 mrg /*
3 1.1 mrg * Copyright (c) 1995 Gordon W. Ross
4 1.1 mrg * All rights reserved.
5 1.1 mrg *
6 1.1 mrg * Redistribution and use in source and binary forms, with or without
7 1.1 mrg * modification, are permitted provided that the following conditions
8 1.1 mrg * are met:
9 1.1 mrg * 1. Redistributions of source code must retain the above copyright
10 1.1 mrg * notice, this list of conditions and the following disclaimer.
11 1.1 mrg * 2. Redistributions in binary form must reproduce the above copyright
12 1.1 mrg * notice, this list of conditions and the following disclaimer in the
13 1.1 mrg * documentation and/or other materials provided with the distribution.
14 1.1 mrg * 3. The name of the author may not be used to endorse or promote products
15 1.1 mrg * derived from this software without specific prior written permission.
16 1.1 mrg * 4. All advertising materials mentioning features or use of this software
17 1.1 mrg * must display the following acknowledgement:
18 1.1 mrg * This product includes software developed by Gordon Ross
19 1.1 mrg *
20 1.1 mrg * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
21 1.1 mrg * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
22 1.1 mrg * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
23 1.1 mrg * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
24 1.1 mrg * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 1.1 mrg * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 1.1 mrg * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 1.1 mrg * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 1.1 mrg * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
29 1.1 mrg * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 1.1 mrg */
31 1.1 mrg
32 1.1 mrg /*
33 1.1 mrg * The easiest way to deal with the need for DVMA mappings is
34 1.1 mrg * to just map the entire third megabyte of RAM into DVMA space.
35 1.1 mrg * That way, dvma_mapin can just compute the DVMA alias address,
36 1.1 mrg * and dvma_mapout does nothing. Note that this assumes all
37 1.1 mrg * standalone programs stay in the range SA_MIN_VA .. SA_MAX_VA
38 1.1 mrg */
39 1.1 mrg
40 1.1 mrg #include <sys/param.h>
41 1.2 pk #include <sparc/sparc/asm.h>
42 1.1 mrg #include <machine/pte.h>
43 1.1 mrg #include <machine/ctlreg.h>
44 1.1 mrg
45 1.3 pk #include <lib/libsa/stand.h>
46 1.1 mrg #include <sparc/stand/common/promdev.h>
47 1.1 mrg
48 1.1 mrg #define DVMA_BASE 0xFFF00000
49 1.1 mrg #define DVMA_MAPLEN 0xE0000 /* 1 MB - 128K (save MONSHORTSEG) */
50 1.1 mrg
51 1.1 mrg #define SA_MIN_VA (RELOC - 0x40000) /* XXX - magic constant */
52 1.1 mrg #define SA_MAX_VA (SA_MIN_VA + DVMA_MAPLEN)
53 1.1 mrg
54 1.3 pk #if 0
55 1.2 pk #define getsegmap(va) (CPU_ISSUN4C \
56 1.2 pk ? lduba(va, ASI_SEGMAP) \
57 1.2 pk : (lduha(va, ASI_SEGMAP)))
58 1.2 pk #define setsegmap(va, pmeg) (CPU_ISSUN4C \
59 1.2 pk ? stba(va, ASI_SEGMAP, pmeg) \
60 1.2 pk : stha(va, ASI_SEGMAP, pmeg))
61 1.3 pk #else
62 1.3 pk /*
63 1.3 pk * This module is only used on sun4, so:
64 1.3 pk */
65 1.3 pk #define getsegmap(va) (lduha(va, ASI_SEGMAP))
66 1.3 pk #define setsegmap(va, pmeg) do stha(va, ASI_SEGMAP, pmeg); while(0)
67 1.3 pk #endif
68 1.3 pk
69 1.1 mrg void
70 1.1 mrg dvma_init()
71 1.1 mrg {
72 1.3 pk int segva, dmava;
73 1.1 mrg
74 1.1 mrg dmava = DVMA_BASE;
75 1.1 mrg for (segva = SA_MIN_VA; segva < SA_MAX_VA; segva += NBPSG) {
76 1.1 mrg setsegmap(dmava, getsegmap(segva));
77 1.1 mrg dmava += NBPSG;
78 1.1 mrg }
79 1.1 mrg }
80 1.1 mrg
81 1.1 mrg /*
82 1.1 mrg * Convert a local address to a DVMA address.
83 1.1 mrg */
84 1.1 mrg char *
85 1.3 pk dvma_mapin(addr, len)
86 1.3 pk char *addr;
87 1.3 pk size_t len;
88 1.1 mrg {
89 1.3 pk int va = (int)addr;
90 1.1 mrg
91 1.1 mrg /* Make sure the address is in the DVMA map. */
92 1.1 mrg if ((va < SA_MIN_VA) || (va >= SA_MAX_VA))
93 1.1 mrg panic("dvma_mapin");
94 1.1 mrg
95 1.1 mrg va += DVMA_BASE - SA_MIN_VA;
96 1.1 mrg
97 1.1 mrg return ((char *)va);
98 1.1 mrg }
99 1.1 mrg
100 1.1 mrg /*
101 1.1 mrg * Convert a DVMA address to a local address.
102 1.1 mrg */
103 1.1 mrg char *
104 1.3 pk dvma_mapout(addr, len)
105 1.3 pk char *addr;
106 1.3 pk size_t len;
107 1.1 mrg {
108 1.1 mrg int va = (int)addr;
109 1.1 mrg
110 1.1 mrg /* Make sure the address is in the DVMA map. */
111 1.1 mrg if ((va < DVMA_BASE) || (va >= (DVMA_BASE + DVMA_MAPLEN)))
112 1.1 mrg panic("dvma_mapout");
113 1.1 mrg
114 1.1 mrg va -= DVMA_BASE - SA_MIN_VA;
115 1.1 mrg
116 1.1 mrg return ((char *)va);
117 1.1 mrg }
118 1.1 mrg
119 1.1 mrg char *
120 1.3 pk dvma_alloc(len)
121 1.3 pk int len;
122 1.1 mrg {
123 1.1 mrg char *mem;
124 1.1 mrg
125 1.1 mrg mem = alloc(len);
126 1.3 pk if (mem == NULL)
127 1.1 mrg return (mem);
128 1.1 mrg return (dvma_mapin(mem, len));
129 1.1 mrg }
130 1.1 mrg
131 1.1 mrg void
132 1.3 pk dvma_free(dvma, len)
133 1.3 pk char *dvma;
134 1.3 pk int len;
135 1.1 mrg {
136 1.1 mrg char *mem;
137 1.1 mrg
138 1.1 mrg mem = dvma_mapout(dvma, len);
139 1.3 pk if (mem != NULL)
140 1.1 mrg free(mem, len);
141 1.1 mrg }
142