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