sa11x0_io.c revision 1.2
1 /* $NetBSD: sa11x0_io.c,v 1.2 2001/07/28 18:12:44 chris 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 #include <machine/pte.h> 52 53 /* Proto types for all the bus_space structure functions */ 54 55 bs_protos(sa11x0); 56 bs_protos(bs_notimpl); 57 58 /* Declare the sa11x0 bus space tag */ 59 60 struct bus_space sa11x0_bs_tag = { 61 /* cookie */ 62 NULL, 63 64 /* mapping/unmapping */ 65 sa11x0_bs_map, 66 sa11x0_bs_unmap, 67 sa11x0_bs_subregion, 68 69 /* allocation/deallocation */ 70 sa11x0_bs_alloc, 71 sa11x0_bs_free, 72 73 /* get kernel virtual address */ 74 sa11x0_bs_vaddr, 75 76 /* barrier */ 77 sa11x0_bs_barrier, 78 79 /* read (single) */ 80 sa11x0_bs_r_1, 81 sa11x0_bs_r_2, 82 sa11x0_bs_r_4, 83 bs_notimpl_bs_r_8, 84 85 /* read multiple */ 86 sa11x0_bs_rm_1, 87 sa11x0_bs_rm_2, 88 sa11x0_bs_rm_4, 89 bs_notimpl_bs_rm_8, 90 91 /* read region */ 92 bs_notimpl_bs_rr_1, 93 sa11x0_bs_rr_2, 94 bs_notimpl_bs_rr_4, 95 bs_notimpl_bs_rr_8, 96 97 /* write (single) */ 98 sa11x0_bs_w_1, 99 sa11x0_bs_w_2, 100 sa11x0_bs_w_4, 101 bs_notimpl_bs_w_8, 102 103 /* write multiple */ 104 sa11x0_bs_wm_1, 105 sa11x0_bs_wm_2, 106 sa11x0_bs_wm_4, 107 bs_notimpl_bs_wm_8, 108 109 /* write region */ 110 bs_notimpl_bs_wr_1, 111 sa11x0_bs_wr_2, 112 bs_notimpl_bs_wr_4, 113 bs_notimpl_bs_wr_8, 114 115 /* set multiple */ 116 bs_notimpl_bs_sm_1, 117 bs_notimpl_bs_sm_2, 118 bs_notimpl_bs_sm_4, 119 bs_notimpl_bs_sm_8, 120 121 /* set region */ 122 bs_notimpl_bs_sr_1, 123 sa11x0_bs_sr_2, 124 bs_notimpl_bs_sr_4, 125 bs_notimpl_bs_sr_8, 126 127 /* copy */ 128 bs_notimpl_bs_c_1, 129 sa11x0_bs_c_2, 130 bs_notimpl_bs_c_4, 131 bs_notimpl_bs_c_8, 132 }; 133 134 /* bus space functions */ 135 136 int 137 sa11x0_bs_map(t, bpa, size, cacheable, bshp) 138 void *t; 139 bus_addr_t bpa; 140 bus_size_t size; 141 int cacheable; 142 bus_space_handle_t *bshp; 143 { 144 u_long startpa, endpa, pa; 145 vaddr_t va; 146 pt_entry_t *pte; 147 148 if ((u_long)bpa > (u_long)KERNEL_SPACE_START) { 149 /* XXX This is a temporary hack to aid transition. */ 150 *bshp = bpa; 151 return(0); 152 } 153 154 startpa = trunc_page(bpa); 155 endpa = round_page(bpa + size); 156 157 /* XXX use extent manager to check duplicate mapping */ 158 159 va = uvm_km_valloc(kernel_map, endpa - startpa); 160 if (! va) 161 return(ENOMEM); 162 163 *bshp = (bus_space_handle_t)(va + (bpa - startpa)); 164 165 for(pa = startpa; pa < endpa; pa += PAGE_SIZE, va += PAGE_SIZE) { 166 pmap_kenter_pa(va, pa, VM_PROT_READ | VM_PROT_WRITE); 167 pte = pmap_pte(pmap_kernel(), va); 168 if (cacheable) 169 *pte |= PT_CACHEABLE; 170 else 171 *pte &= ~PT_CACHEABLE; 172 } 173 pmap_update(); 174 175 return(0); 176 } 177 178 int 179 sa11x0_bs_alloc(t, rstart, rend, size, alignment, boundary, cacheable, 180 bpap, bshp) 181 void *t; 182 bus_addr_t rstart, rend; 183 bus_size_t size, alignment, boundary; 184 int cacheable; 185 bus_addr_t *bpap; 186 bus_space_handle_t *bshp; 187 { 188 panic("sa11x0_alloc(): Help!\n"); 189 } 190 191 192 void 193 sa11x0_bs_unmap(t, bsh, size) 194 void *t; 195 bus_space_handle_t bsh; 196 bus_size_t size; 197 { 198 /* 199 * Temporary implementation 200 */ 201 } 202 203 void 204 sa11x0_bs_free(t, bsh, size) 205 void *t; 206 bus_space_handle_t bsh; 207 bus_size_t size; 208 { 209 210 panic("sa11x0_free(): Help!\n"); 211 /* sa11x0_unmap() does all that we need to do. */ 212 /* sa11x0_unmap(t, bsh, size);*/ 213 } 214 215 int 216 sa11x0_bs_subregion(t, bsh, offset, size, nbshp) 217 void *t; 218 bus_space_handle_t bsh; 219 bus_size_t offset, size; 220 bus_space_handle_t *nbshp; 221 { 222 223 *nbshp = bsh + offset; 224 return (0); 225 } 226 227 void * 228 sa11x0_bs_vaddr(t, bsh) 229 void *t; 230 bus_space_handle_t bsh; 231 { 232 return ((void *)bsh); 233 } 234 235 void 236 sa11x0_bs_barrier(t, bsh, offset, len, flags) 237 void *t; 238 bus_space_handle_t bsh; 239 bus_size_t offset, len; 240 int flags; 241 { 242 /* NULL */ 243 } 244 245 /* End of sa11x0_io.c */ 246
Indexes created Wed Oct 01 19:09:53 GMT 2025