/* $NetBSD: sa11x0_io.c,v 1.12 2003/07/15 00:24:51 lukem Exp $ */ /* * Copyright (c) 1997 Mark Brinicombe. * Copyright (c) 1997 Causality Limited. * All rights reserved. * * This code is derived from software contributed to The NetBSD Foundation * by Ichiro FUKUHARA. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by Mark Brinicombe. * 4. The name of the company nor the name of the author may be used to * endorse or promote products derived from this software without specific * prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ /* * bus_space I/O functions for sa11x0 */ #include __KERNEL_RCSID(0, "$NetBSD: sa11x0_io.c,v 1.12 2003/07/15 00:24:51 lukem Exp $"); #include #include #include #include #include #include /* Proto types for all the bus_space structure functions */ bs_protos(sa11x0); bs_protos(bs_notimpl); /* Declare the sa11x0 bus space tag */ struct bus_space sa11x0_bs_tag = { /* cookie */ NULL, /* mapping/unmapping */ sa11x0_bs_map, sa11x0_bs_unmap, sa11x0_bs_subregion, /* allocation/deallocation */ sa11x0_bs_alloc, sa11x0_bs_free, /* get kernel virtual address */ sa11x0_bs_vaddr, /* mmap bus space for userland */ sa11x0_bs_mmap, /* barrier */ sa11x0_bs_barrier, /* read (single) */ sa11x0_bs_r_1, sa11x0_bs_r_2, sa11x0_bs_r_4, bs_notimpl_bs_r_8, /* read multiple */ sa11x0_bs_rm_1, sa11x0_bs_rm_2, sa11x0_bs_rm_4, bs_notimpl_bs_rm_8, /* read region */ bs_notimpl_bs_rr_1, sa11x0_bs_rr_2, bs_notimpl_bs_rr_4, bs_notimpl_bs_rr_8, /* write (single) */ sa11x0_bs_w_1, sa11x0_bs_w_2, sa11x0_bs_w_4, bs_notimpl_bs_w_8, /* write multiple */ sa11x0_bs_wm_1, sa11x0_bs_wm_2, sa11x0_bs_wm_4, bs_notimpl_bs_wm_8, /* write region */ bs_notimpl_bs_wr_1, sa11x0_bs_wr_2, bs_notimpl_bs_wr_4, bs_notimpl_bs_wr_8, /* set multiple */ bs_notimpl_bs_sm_1, bs_notimpl_bs_sm_2, bs_notimpl_bs_sm_4, bs_notimpl_bs_sm_8, /* set region */ bs_notimpl_bs_sr_1, sa11x0_bs_sr_2, bs_notimpl_bs_sr_4, bs_notimpl_bs_sr_8, /* copy */ bs_notimpl_bs_c_1, sa11x0_bs_c_2, bs_notimpl_bs_c_4, bs_notimpl_bs_c_8, }; /* bus space functions */ int sa11x0_bs_map(t, bpa, size, cacheable, bshp) void *t; bus_addr_t bpa; bus_size_t size; int cacheable; bus_space_handle_t *bshp; { u_long startpa, endpa, pa; vaddr_t va; pt_entry_t *pte; #ifdef hpcarm if ((u_long)bpa > (u_long)KERNEL_BASE) { /* XXX This is a temporary hack to aid transition. */ *bshp = bpa; return(0); } #endif startpa = trunc_page(bpa); endpa = round_page(bpa + size); /* XXX use extent manager to check duplicate mapping */ va = uvm_km_valloc(kernel_map, endpa - startpa); if (! va) return(ENOMEM); *bshp = (bus_space_handle_t)(va + (bpa - startpa)); for(pa = startpa; pa < endpa; pa += PAGE_SIZE, va += PAGE_SIZE) { pmap_kenter_pa(va, pa, VM_PROT_READ | VM_PROT_WRITE); pte = vtopte(va); if (cacheable == 0) { *pte &= ~L2_S_CACHE_MASK; PTE_SYNC(pte); } } pmap_update(pmap_kernel()); return(0); } int sa11x0_bs_alloc(t, rstart, rend, size, alignment, boundary, cacheable, bpap, bshp) void *t; bus_addr_t rstart, rend; bus_size_t size, alignment, boundary; int cacheable; bus_addr_t *bpap; bus_space_handle_t *bshp; { panic("sa11x0_alloc(): Help!"); } void sa11x0_bs_unmap(t, bsh, size) void *t; bus_space_handle_t bsh; bus_size_t size; { /* * Temporary implementation */ } void sa11x0_bs_free(t, bsh, size) void *t; bus_space_handle_t bsh; bus_size_t size; { panic("sa11x0_free(): Help!"); /* sa11x0_unmap() does all that we need to do. */ /* sa11x0_unmap(t, bsh, size);*/ } int sa11x0_bs_subregion(t, bsh, offset, size, nbshp) void *t; bus_space_handle_t bsh; bus_size_t offset, size; bus_space_handle_t *nbshp; { *nbshp = bsh + offset; return (0); } paddr_t sa11x0_bs_mmap(t, paddr, offset, prot, flags) void *t; bus_addr_t paddr; off_t offset; int prot; int flags; { /* * mmap from address `paddr+offset' for one page */ return (arm_btop((paddr + offset))); } void * sa11x0_bs_vaddr(t, bsh) void *t; bus_space_handle_t bsh; { return ((void *)bsh); } void sa11x0_bs_barrier(t, bsh, offset, len, flags) void *t; bus_space_handle_t bsh; bus_size_t offset, len; int flags; { /* NULL */ } /* End of sa11x0_io.c */