ifpga_io.c revision 1.1 1 1.1 rearnsha /* $NetBSD: ifpga_io.c,v 1.1 2001/10/27 16:19:08 rearnsha Exp $ */
2 1.1 rearnsha
3 1.1 rearnsha /*
4 1.1 rearnsha * Copyright (c) 1997 Causality Limited
5 1.1 rearnsha * Copyright (c) 1997 Mark Brinicombe.
6 1.1 rearnsha * All rights reserved.
7 1.1 rearnsha *
8 1.1 rearnsha * Redistribution and use in source and binary forms, with or without
9 1.1 rearnsha * modification, are permitted provided that the following conditions
10 1.1 rearnsha * are met:
11 1.1 rearnsha * 1. Redistributions of source code must retain the above copyright
12 1.1 rearnsha * notice, this list of conditions and the following disclaimer.
13 1.1 rearnsha * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 rearnsha * notice, this list of conditions and the following disclaimer in the
15 1.1 rearnsha * documentation and/or other materials provided with the distribution.
16 1.1 rearnsha * 3. All advertising materials mentioning features or use of this software
17 1.1 rearnsha * must display the following acknowledgement:
18 1.1 rearnsha * This product includes software developed by Mark Brinicombe
19 1.1 rearnsha * for the NetBSD Project.
20 1.1 rearnsha * 4. The name of the company nor the name of the author may be used to
21 1.1 rearnsha * endorse or promote products derived from this software without specific
22 1.1 rearnsha * prior written permission.
23 1.1 rearnsha *
24 1.1 rearnsha * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
25 1.1 rearnsha * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
26 1.1 rearnsha * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
27 1.1 rearnsha * IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
28 1.1 rearnsha * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
29 1.1 rearnsha * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
30 1.1 rearnsha * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 rearnsha * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 rearnsha * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 rearnsha * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 rearnsha * SUCH DAMAGE.
35 1.1 rearnsha *
36 1.1 rearnsha * From arm/footbridge/footbridge_io.c
37 1.1 rearnsha */
38 1.1 rearnsha
39 1.1 rearnsha /*
40 1.1 rearnsha * bus_space I/O functions for IFPGA
41 1.1 rearnsha */
42 1.1 rearnsha
43 1.1 rearnsha #include <sys/param.h>
44 1.1 rearnsha #include <sys/systm.h>
45 1.1 rearnsha #include <machine/bus.h>
46 1.1 rearnsha #include <uvm/uvm_extern.h>
47 1.1 rearnsha
48 1.1 rearnsha /* Proto types for all the bus_space structure functions */
49 1.1 rearnsha
50 1.1 rearnsha bs_protos(ifpga);
51 1.1 rearnsha bs_protos(bs_notimpl);
52 1.1 rearnsha bs_map_proto(ifpga_mem);
53 1.1 rearnsha bs_unmap_proto(ifpga_mem);
54 1.1 rearnsha
55 1.1 rearnsha /* Declare the ifpga bus space tag */
56 1.1 rearnsha
57 1.1 rearnsha struct bus_space ifpga_bs_tag = {
58 1.1 rearnsha /* cookie */
59 1.1 rearnsha (void *) 0, /* Physical base address */
60 1.1 rearnsha
61 1.1 rearnsha /* mapping/unmapping */
62 1.1 rearnsha ifpga_bs_map,
63 1.1 rearnsha ifpga_bs_unmap,
64 1.1 rearnsha ifpga_bs_subregion,
65 1.1 rearnsha
66 1.1 rearnsha /* allocation/deallocation */
67 1.1 rearnsha ifpga_bs_alloc,
68 1.1 rearnsha ifpga_bs_free,
69 1.1 rearnsha
70 1.1 rearnsha /* get kernel virtual address */
71 1.1 rearnsha ifpga_bs_vaddr,
72 1.1 rearnsha
73 1.1 rearnsha /* mmap */
74 1.1 rearnsha bs_notimpl_bs_mmap,
75 1.1 rearnsha
76 1.1 rearnsha /* barrier */
77 1.1 rearnsha ifpga_bs_barrier,
78 1.1 rearnsha
79 1.1 rearnsha /* read (single) */
80 1.1 rearnsha ifpga_bs_r_1,
81 1.1 rearnsha ifpga_bs_r_2,
82 1.1 rearnsha ifpga_bs_r_4,
83 1.1 rearnsha bs_notimpl_bs_r_8,
84 1.1 rearnsha
85 1.1 rearnsha /* read multiple */
86 1.1 rearnsha ifpga_bs_rm_1,
87 1.1 rearnsha ifpga_bs_rm_2,
88 1.1 rearnsha ifpga_bs_rm_4,
89 1.1 rearnsha bs_notimpl_bs_rm_8,
90 1.1 rearnsha
91 1.1 rearnsha /* read region */
92 1.1 rearnsha bs_notimpl_bs_rr_1,
93 1.1 rearnsha ifpga_bs_rr_2,
94 1.1 rearnsha ifpga_bs_rr_4,
95 1.1 rearnsha bs_notimpl_bs_rr_8,
96 1.1 rearnsha
97 1.1 rearnsha /* write (single) */
98 1.1 rearnsha ifpga_bs_w_1,
99 1.1 rearnsha ifpga_bs_w_2,
100 1.1 rearnsha ifpga_bs_w_4,
101 1.1 rearnsha bs_notimpl_bs_w_8,
102 1.1 rearnsha
103 1.1 rearnsha /* write multiple */
104 1.1 rearnsha ifpga_bs_wm_1,
105 1.1 rearnsha ifpga_bs_wm_2,
106 1.1 rearnsha ifpga_bs_wm_4,
107 1.1 rearnsha bs_notimpl_bs_wm_8,
108 1.1 rearnsha
109 1.1 rearnsha /* write region */
110 1.1 rearnsha bs_notimpl_bs_wr_1,
111 1.1 rearnsha ifpga_bs_wr_2,
112 1.1 rearnsha ifpga_bs_wr_4,
113 1.1 rearnsha bs_notimpl_bs_wr_8,
114 1.1 rearnsha
115 1.1 rearnsha /* set multiple */
116 1.1 rearnsha bs_notimpl_bs_sm_1,
117 1.1 rearnsha bs_notimpl_bs_sm_2,
118 1.1 rearnsha bs_notimpl_bs_sm_4,
119 1.1 rearnsha bs_notimpl_bs_sm_8,
120 1.1 rearnsha
121 1.1 rearnsha /* set region */
122 1.1 rearnsha bs_notimpl_bs_sr_1,
123 1.1 rearnsha ifpga_bs_sr_2,
124 1.1 rearnsha bs_notimpl_bs_sr_4,
125 1.1 rearnsha bs_notimpl_bs_sr_8,
126 1.1 rearnsha
127 1.1 rearnsha /* copy */
128 1.1 rearnsha bs_notimpl_bs_c_1,
129 1.1 rearnsha ifpga_bs_c_2,
130 1.1 rearnsha bs_notimpl_bs_c_4,
131 1.1 rearnsha bs_notimpl_bs_c_8,
132 1.1 rearnsha };
133 1.1 rearnsha
134 1.1 rearnsha void ifpga_create_io_bs_tag(t, cookie)
135 1.1 rearnsha struct bus_space *t;
136 1.1 rearnsha void *cookie;
137 1.1 rearnsha {
138 1.1 rearnsha *t = ifpga_bs_tag;
139 1.1 rearnsha t->bs_cookie = cookie;
140 1.1 rearnsha }
141 1.1 rearnsha
142 1.1 rearnsha void ifpga_create_mem_bs_tag(t, cookie)
143 1.1 rearnsha struct bus_space *t;
144 1.1 rearnsha void *cookie;
145 1.1 rearnsha {
146 1.1 rearnsha *t = ifpga_bs_tag;
147 1.1 rearnsha t->bs_map = ifpga_mem_bs_map;
148 1.1 rearnsha t->bs_unmap = ifpga_mem_bs_unmap;
149 1.1 rearnsha t->bs_cookie = cookie;
150 1.1 rearnsha }
151 1.1 rearnsha
152 1.1 rearnsha /* bus space functions */
153 1.1 rearnsha
154 1.1 rearnsha int
155 1.1 rearnsha ifpga_bs_map(t, bpa, size, cacheable, bshp)
156 1.1 rearnsha void *t;
157 1.1 rearnsha bus_addr_t bpa;
158 1.1 rearnsha bus_size_t size;
159 1.1 rearnsha int cacheable;
160 1.1 rearnsha bus_space_handle_t *bshp;
161 1.1 rearnsha {
162 1.1 rearnsha /* The cookie is the base address for the I/O area */
163 1.1 rearnsha *bshp = bpa + (bus_addr_t)t;
164 1.1 rearnsha return 0;
165 1.1 rearnsha }
166 1.1 rearnsha
167 1.1 rearnsha int
168 1.1 rearnsha ifpga_mem_bs_map(t, bpa, size, cacheable, bshp)
169 1.1 rearnsha void *t;
170 1.1 rearnsha bus_addr_t bpa;
171 1.1 rearnsha bus_size_t size;
172 1.1 rearnsha int cacheable;
173 1.1 rearnsha bus_space_handle_t *bshp;
174 1.1 rearnsha {
175 1.1 rearnsha bus_addr_t startpa, endpa;
176 1.1 rearnsha vaddr_t va;
177 1.1 rearnsha
178 1.1 rearnsha /* Round the allocation to page boundries */
179 1.1 rearnsha startpa = trunc_page(bpa);
180 1.1 rearnsha endpa = round_page(bpa + size);
181 1.1 rearnsha
182 1.1 rearnsha /* Get some VM. */
183 1.1 rearnsha va = uvm_km_valloc(kernel_map, endpa - startpa);
184 1.1 rearnsha if (va == 0)
185 1.1 rearnsha return ENOMEM;
186 1.1 rearnsha
187 1.1 rearnsha /* Store the bus space handle */
188 1.1 rearnsha *bshp = va + (bpa & PGOFSET);
189 1.1 rearnsha
190 1.1 rearnsha /* Now map the pages */
191 1.1 rearnsha /* The cookie is the physical base address for the I/O area */
192 1.1 rearnsha while (startpa < endpa) {
193 1.1 rearnsha /* XXX pmap_kenter_pa maps pages cacheable -- not what
194 1.1 rearnsha we want. */
195 1.1 rearnsha pmap_enter(pmap_kernel(), va, (bus_addr_t)t + startpa,
196 1.1 rearnsha VM_PROT_READ | VM_PROT_WRITE, 0);
197 1.1 rearnsha va += NBPG;
198 1.1 rearnsha startpa += NBPG;
199 1.1 rearnsha }
200 1.1 rearnsha pmap_update(pmap_kernel());
201 1.1 rearnsha
202 1.1 rearnsha return 0;
203 1.1 rearnsha }
204 1.1 rearnsha
205 1.1 rearnsha int
206 1.1 rearnsha ifpga_bs_alloc(t, rstart, rend, size, alignment, boundary, cacheable,
207 1.1 rearnsha bpap, bshp)
208 1.1 rearnsha void *t;
209 1.1 rearnsha bus_addr_t rstart, rend;
210 1.1 rearnsha bus_size_t size, alignment, boundary;
211 1.1 rearnsha int cacheable;
212 1.1 rearnsha bus_addr_t *bpap;
213 1.1 rearnsha bus_space_handle_t *bshp;
214 1.1 rearnsha {
215 1.1 rearnsha panic("ifpga_alloc(): Help!\n");
216 1.1 rearnsha }
217 1.1 rearnsha
218 1.1 rearnsha
219 1.1 rearnsha void
220 1.1 rearnsha ifpga_bs_unmap(t, bsh, size)
221 1.1 rearnsha void *t;
222 1.1 rearnsha bus_space_handle_t bsh;
223 1.1 rearnsha bus_size_t size;
224 1.1 rearnsha {
225 1.1 rearnsha /* Nothing to do for an io map. */
226 1.1 rearnsha }
227 1.1 rearnsha
228 1.1 rearnsha void
229 1.1 rearnsha ifpga_mem_bs_unmap(t, bsh, size)
230 1.1 rearnsha void *t;
231 1.1 rearnsha bus_space_handle_t bsh;
232 1.1 rearnsha bus_size_t size;
233 1.1 rearnsha {
234 1.1 rearnsha vaddr_t startva, endva;
235 1.1 rearnsha
236 1.1 rearnsha startva = trunc_page(bsh);
237 1.1 rearnsha endva = round_page(bsh + size);
238 1.1 rearnsha
239 1.1 rearnsha uvm_km_free(kernel_map, startva, endva - startva);
240 1.1 rearnsha }
241 1.1 rearnsha
242 1.1 rearnsha void
243 1.1 rearnsha ifpga_bs_free(t, bsh, size)
244 1.1 rearnsha void *t;
245 1.1 rearnsha bus_space_handle_t bsh;
246 1.1 rearnsha bus_size_t size;
247 1.1 rearnsha {
248 1.1 rearnsha
249 1.1 rearnsha panic("ifpga_free(): Help!\n");
250 1.1 rearnsha /* ifpga_bs_unmap() does all that we need to do. */
251 1.1 rearnsha /* ifpga_bs_unmap(t, bsh, size);*/
252 1.1 rearnsha }
253 1.1 rearnsha
254 1.1 rearnsha int
255 1.1 rearnsha ifpga_bs_subregion(t, bsh, offset, size, nbshp)
256 1.1 rearnsha void *t;
257 1.1 rearnsha bus_space_handle_t bsh;
258 1.1 rearnsha bus_size_t offset, size;
259 1.1 rearnsha bus_space_handle_t *nbshp;
260 1.1 rearnsha {
261 1.1 rearnsha
262 1.1 rearnsha *nbshp = bsh + (offset << ((int)t));
263 1.1 rearnsha return (0);
264 1.1 rearnsha }
265 1.1 rearnsha
266 1.1 rearnsha void *
267 1.1 rearnsha ifpga_bs_vaddr(t, bsh)
268 1.1 rearnsha void *t;
269 1.1 rearnsha bus_space_handle_t bsh;
270 1.1 rearnsha {
271 1.1 rearnsha
272 1.1 rearnsha return ((void *)bsh);
273 1.1 rearnsha }
274 1.1 rearnsha
275 1.1 rearnsha void
276 1.1 rearnsha ifpga_bs_barrier(t, bsh, offset, len, flags)
277 1.1 rearnsha void *t;
278 1.1 rearnsha bus_space_handle_t bsh;
279 1.1 rearnsha bus_size_t offset, len;
280 1.1 rearnsha int flags;
281 1.1 rearnsha {
282 1.1 rearnsha }
283