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