sa11x0_io.c revision 1.7 1 1.7 thorpej /* $NetBSD: sa11x0_io.c,v 1.7 2002/03/24 18:12:55 thorpej Exp $ */
2 1.1 rjs
3 1.1 rjs /*
4 1.1 rjs * Copyright (c) 1997 Mark Brinicombe.
5 1.1 rjs * Copyright (c) 1997 Causality Limited.
6 1.1 rjs * All rights reserved.
7 1.1 rjs *
8 1.1 rjs * This code is derived from software contributed to The NetBSD Foundation
9 1.1 rjs * by Ichiro FUKUHARA.
10 1.1 rjs *
11 1.1 rjs * Redistribution and use in source and binary forms, with or without
12 1.1 rjs * modification, are permitted provided that the following conditions
13 1.1 rjs * are met:
14 1.1 rjs * 1. Redistributions of source code must retain the above copyright
15 1.1 rjs * notice, this list of conditions and the following disclaimer.
16 1.1 rjs * 2. Redistributions in binary form must reproduce the above copyright
17 1.1 rjs * notice, this list of conditions and the following disclaimer in the
18 1.1 rjs * documentation and/or other materials provided with the distribution.
19 1.1 rjs * 3. All advertising materials mentioning features or use of this software
20 1.1 rjs * must display the following acknowledgement:
21 1.1 rjs * This product includes software developed by Mark Brinicombe.
22 1.1 rjs * 4. The name of the company nor the name of the author may be used to
23 1.1 rjs * endorse or promote products derived from this software without specific
24 1.1 rjs * prior written permission.
25 1.1 rjs *
26 1.1 rjs * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
27 1.1 rjs * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
28 1.1 rjs * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
29 1.1 rjs * IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
30 1.1 rjs * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
31 1.1 rjs * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
32 1.1 rjs * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 rjs * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 rjs * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 rjs * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 rjs * SUCH DAMAGE.
37 1.1 rjs */
38 1.1 rjs
39 1.1 rjs /*
40 1.1 rjs * bus_space I/O functions for sa11x0
41 1.1 rjs */
42 1.1 rjs
43 1.1 rjs #include <sys/param.h>
44 1.1 rjs #include <sys/systm.h>
45 1.1 rjs #include <sys/queue.h>
46 1.1 rjs
47 1.1 rjs #include <uvm/uvm.h>
48 1.1 rjs
49 1.1 rjs #include <machine/bus.h>
50 1.1 rjs #include <machine/pmap.h>
51 1.1 rjs
52 1.1 rjs /* Proto types for all the bus_space structure functions */
53 1.1 rjs
54 1.1 rjs bs_protos(sa11x0);
55 1.1 rjs bs_protos(bs_notimpl);
56 1.1 rjs
57 1.1 rjs /* Declare the sa11x0 bus space tag */
58 1.1 rjs
59 1.1 rjs struct bus_space sa11x0_bs_tag = {
60 1.1 rjs /* cookie */
61 1.1 rjs NULL,
62 1.1 rjs
63 1.1 rjs /* mapping/unmapping */
64 1.1 rjs sa11x0_bs_map,
65 1.1 rjs sa11x0_bs_unmap,
66 1.1 rjs sa11x0_bs_subregion,
67 1.1 rjs
68 1.1 rjs /* allocation/deallocation */
69 1.1 rjs sa11x0_bs_alloc,
70 1.1 rjs sa11x0_bs_free,
71 1.1 rjs
72 1.1 rjs /* get kernel virtual address */
73 1.1 rjs sa11x0_bs_vaddr,
74 1.4 rjs
75 1.4 rjs /* mmap bus space for userland */
76 1.4 rjs bs_notimpl_bs_mmap,
77 1.1 rjs
78 1.1 rjs /* barrier */
79 1.1 rjs sa11x0_bs_barrier,
80 1.1 rjs
81 1.1 rjs /* read (single) */
82 1.1 rjs sa11x0_bs_r_1,
83 1.1 rjs sa11x0_bs_r_2,
84 1.1 rjs sa11x0_bs_r_4,
85 1.1 rjs bs_notimpl_bs_r_8,
86 1.1 rjs
87 1.1 rjs /* read multiple */
88 1.1 rjs sa11x0_bs_rm_1,
89 1.1 rjs sa11x0_bs_rm_2,
90 1.1 rjs sa11x0_bs_rm_4,
91 1.1 rjs bs_notimpl_bs_rm_8,
92 1.1 rjs
93 1.1 rjs /* read region */
94 1.1 rjs bs_notimpl_bs_rr_1,
95 1.1 rjs sa11x0_bs_rr_2,
96 1.1 rjs bs_notimpl_bs_rr_4,
97 1.1 rjs bs_notimpl_bs_rr_8,
98 1.1 rjs
99 1.1 rjs /* write (single) */
100 1.1 rjs sa11x0_bs_w_1,
101 1.1 rjs sa11x0_bs_w_2,
102 1.1 rjs sa11x0_bs_w_4,
103 1.1 rjs bs_notimpl_bs_w_8,
104 1.1 rjs
105 1.1 rjs /* write multiple */
106 1.1 rjs sa11x0_bs_wm_1,
107 1.1 rjs sa11x0_bs_wm_2,
108 1.1 rjs sa11x0_bs_wm_4,
109 1.1 rjs bs_notimpl_bs_wm_8,
110 1.1 rjs
111 1.1 rjs /* write region */
112 1.1 rjs bs_notimpl_bs_wr_1,
113 1.1 rjs sa11x0_bs_wr_2,
114 1.1 rjs bs_notimpl_bs_wr_4,
115 1.1 rjs bs_notimpl_bs_wr_8,
116 1.1 rjs
117 1.1 rjs /* set multiple */
118 1.1 rjs bs_notimpl_bs_sm_1,
119 1.1 rjs bs_notimpl_bs_sm_2,
120 1.1 rjs bs_notimpl_bs_sm_4,
121 1.1 rjs bs_notimpl_bs_sm_8,
122 1.1 rjs
123 1.1 rjs /* set region */
124 1.1 rjs bs_notimpl_bs_sr_1,
125 1.1 rjs sa11x0_bs_sr_2,
126 1.1 rjs bs_notimpl_bs_sr_4,
127 1.1 rjs bs_notimpl_bs_sr_8,
128 1.1 rjs
129 1.1 rjs /* copy */
130 1.1 rjs bs_notimpl_bs_c_1,
131 1.1 rjs sa11x0_bs_c_2,
132 1.1 rjs bs_notimpl_bs_c_4,
133 1.1 rjs bs_notimpl_bs_c_8,
134 1.1 rjs };
135 1.1 rjs
136 1.1 rjs /* bus space functions */
137 1.1 rjs
138 1.1 rjs int
139 1.1 rjs sa11x0_bs_map(t, bpa, size, cacheable, bshp)
140 1.1 rjs void *t;
141 1.1 rjs bus_addr_t bpa;
142 1.1 rjs bus_size_t size;
143 1.1 rjs int cacheable;
144 1.1 rjs bus_space_handle_t *bshp;
145 1.1 rjs {
146 1.1 rjs u_long startpa, endpa, pa;
147 1.1 rjs vaddr_t va;
148 1.1 rjs pt_entry_t *pte;
149 1.1 rjs
150 1.6 thorpej if ((u_long)bpa > (u_long)KERNEL_BASE) {
151 1.1 rjs /* XXX This is a temporary hack to aid transition. */
152 1.1 rjs *bshp = bpa;
153 1.1 rjs return(0);
154 1.1 rjs }
155 1.1 rjs
156 1.1 rjs startpa = trunc_page(bpa);
157 1.1 rjs endpa = round_page(bpa + size);
158 1.1 rjs
159 1.1 rjs /* XXX use extent manager to check duplicate mapping */
160 1.1 rjs
161 1.1 rjs va = uvm_km_valloc(kernel_map, endpa - startpa);
162 1.1 rjs if (! va)
163 1.1 rjs return(ENOMEM);
164 1.1 rjs
165 1.1 rjs *bshp = (bus_space_handle_t)(va + (bpa - startpa));
166 1.1 rjs
167 1.1 rjs for(pa = startpa; pa < endpa; pa += PAGE_SIZE, va += PAGE_SIZE) {
168 1.1 rjs pmap_kenter_pa(va, pa, VM_PROT_READ | VM_PROT_WRITE);
169 1.7 thorpej pte = vtopte(va);
170 1.1 rjs if (cacheable)
171 1.1 rjs *pte |= PT_CACHEABLE;
172 1.1 rjs else
173 1.1 rjs *pte &= ~PT_CACHEABLE;
174 1.1 rjs }
175 1.3 chris pmap_update(pmap_kernel());
176 1.1 rjs
177 1.1 rjs return(0);
178 1.1 rjs }
179 1.1 rjs
180 1.1 rjs int
181 1.1 rjs sa11x0_bs_alloc(t, rstart, rend, size, alignment, boundary, cacheable,
182 1.1 rjs bpap, bshp)
183 1.1 rjs void *t;
184 1.1 rjs bus_addr_t rstart, rend;
185 1.1 rjs bus_size_t size, alignment, boundary;
186 1.1 rjs int cacheable;
187 1.1 rjs bus_addr_t *bpap;
188 1.1 rjs bus_space_handle_t *bshp;
189 1.1 rjs {
190 1.1 rjs panic("sa11x0_alloc(): Help!\n");
191 1.1 rjs }
192 1.1 rjs
193 1.1 rjs
194 1.1 rjs void
195 1.1 rjs sa11x0_bs_unmap(t, bsh, size)
196 1.1 rjs void *t;
197 1.1 rjs bus_space_handle_t bsh;
198 1.1 rjs bus_size_t size;
199 1.1 rjs {
200 1.1 rjs /*
201 1.1 rjs * Temporary implementation
202 1.1 rjs */
203 1.1 rjs }
204 1.1 rjs
205 1.1 rjs void
206 1.1 rjs sa11x0_bs_free(t, bsh, size)
207 1.1 rjs void *t;
208 1.1 rjs bus_space_handle_t bsh;
209 1.1 rjs bus_size_t size;
210 1.1 rjs {
211 1.1 rjs
212 1.1 rjs panic("sa11x0_free(): Help!\n");
213 1.1 rjs /* sa11x0_unmap() does all that we need to do. */
214 1.1 rjs /* sa11x0_unmap(t, bsh, size);*/
215 1.1 rjs }
216 1.1 rjs
217 1.1 rjs int
218 1.1 rjs sa11x0_bs_subregion(t, bsh, offset, size, nbshp)
219 1.1 rjs void *t;
220 1.1 rjs bus_space_handle_t bsh;
221 1.1 rjs bus_size_t offset, size;
222 1.1 rjs bus_space_handle_t *nbshp;
223 1.1 rjs {
224 1.1 rjs
225 1.1 rjs *nbshp = bsh + offset;
226 1.1 rjs return (0);
227 1.1 rjs }
228 1.1 rjs
229 1.1 rjs void *
230 1.1 rjs sa11x0_bs_vaddr(t, bsh)
231 1.1 rjs void *t;
232 1.1 rjs bus_space_handle_t bsh;
233 1.1 rjs {
234 1.1 rjs return ((void *)bsh);
235 1.1 rjs }
236 1.1 rjs
237 1.1 rjs void
238 1.1 rjs sa11x0_bs_barrier(t, bsh, offset, len, flags)
239 1.1 rjs void *t;
240 1.1 rjs bus_space_handle_t bsh;
241 1.1 rjs bus_size_t offset, len;
242 1.1 rjs int flags;
243 1.1 rjs {
244 1.1 rjs /* NULL */
245 1.1 rjs }
246 1.1 rjs
247 1.1 rjs /* End of sa11x0_io.c */
248