Home | History | Annotate | Line # | Download | only in xscale
pxa2x0_space.c revision 1.2
      1 /*	$NetBSD: pxa2x0_space.c,v 1.2 2003/03/24 04:15:49 bsh Exp $ */
      2 
      3 /*
      4  * Copyright (c) 2001, 2002 Wasabi Systems, Inc.
      5  * All rights reserved.
      6  *
      7  * Written by Jason R. Thorpe for Wasabi Systems, Inc.
      8  *
      9  * Redistribution and use in source and binary forms, with or without
     10  * modification, are permitted provided that the following conditions
     11  * are met:
     12  * 1. Redistributions of source code must retain the above copyright
     13  *    notice, this list of conditions and the following disclaimer.
     14  * 2. Redistributions in binary form must reproduce the above copyright
     15  *    notice, this list of conditions and the following disclaimer in the
     16  *    documentation and/or other materials provided with the distribution.
     17  * 3. All advertising materials mentioning features or use of this software
     18  *    must display the following acknowledgement:
     19  *	This product includes software developed for the NetBSD Project by
     20  *	Wasabi Systems, Inc.
     21  * 4. The name of Wasabi Systems, Inc. may not be used to endorse
     22  *    or promote products derived from this software without specific prior
     23  *    written permission.
     24  *
     25  * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND
     26  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     27  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     28  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL WASABI SYSTEMS, INC
     29  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     30  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     31  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     32  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     33  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     34  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     35  * POSSIBILITY OF SUCH DAMAGE.
     36  */
     37 /*
     38  * Copyright (c) 1997 Mark Brinicombe.
     39  * Copyright (c) 1997 Causality Limited.
     40  * All rights reserved.
     41  *
     42  * This code is derived from software contributed to The NetBSD Foundation
     43  * by Ichiro FUKUHARA.
     44  *
     45  * Redistribution and use in source and binary forms, with or without
     46  * modification, are permitted provided that the following conditions
     47  * are met:
     48  * 1. Redistributions of source code must retain the above copyright
     49  *    notice, this list of conditions and the following disclaimer.
     50  * 2. Redistributions in binary form must reproduce the above copyright
     51  *    notice, this list of conditions and the following disclaimer in the
     52  *    documentation and/or other materials provided with the distribution.
     53  * 3. All advertising materials mentioning features or use of this software
     54  *    must display the following acknowledgement:
     55  *	This product includes software developed by Mark Brinicombe.
     56  * 4. The name of the company nor the name of the author may be used to
     57  *    endorse or promote products derived from this software without specific
     58  *    prior written permission.
     59  *
     60  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
     61  * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
     62  * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     63  * IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
     64  * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
     65  * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
     66  * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     67  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     68  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     69  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     70  * SUCH DAMAGE.
     71  */
     72 
     73 /*
     74  * bus_space functions for Intel PXA2[51]0 application processor.
     75  * Derived from i80321_space.c.
     76  */
     77 
     78 #include <sys/param.h>
     79 #include <sys/systm.h>
     80 
     81 #include <uvm/uvm_extern.h>
     82 
     83 #include <machine/bus.h>
     84 
     85 /* Prototypes for all the bus_space structure functions */
     86 bs_protos(pxa2x0);
     87 bs_protos(generic);
     88 bs_protos(generic_armv4);
     89 bs_protos(bs_notimpl);
     90 
     91 struct bus_space pxa2x0_bs_tag = {
     92 	/* cookie */
     93 	(void *) 0,
     94 
     95 	/* mapping/unmapping */
     96 	pxa2x0_bs_map,
     97 	pxa2x0_bs_unmap,
     98 	pxa2x0_bs_subregion,
     99 
    100 	/* allocation/deallocation */
    101 	pxa2x0_bs_alloc,	/* not implemented */
    102 	pxa2x0_bs_free,		/* not implemented */
    103 
    104 	/* get kernel virtual address */
    105 	pxa2x0_bs_vaddr,
    106 
    107 	/* mmap */
    108 	bs_notimpl_bs_mmap,
    109 
    110 	/* barrier */
    111 	pxa2x0_bs_barrier,
    112 
    113 	/* read (single) */
    114 	generic_bs_r_1,
    115 	generic_armv4_bs_r_2,
    116 	generic_bs_r_4,
    117 	bs_notimpl_bs_r_8,
    118 
    119 	/* read multiple */
    120 	generic_bs_rm_1,
    121 	generic_armv4_bs_rm_2,
    122 	generic_bs_rm_4,
    123 	bs_notimpl_bs_rm_8,
    124 
    125 	/* read region */
    126 	bs_notimpl_bs_rr_1,
    127 	generic_armv4_bs_rr_2,
    128 	generic_bs_rr_4,
    129 	bs_notimpl_bs_rr_8,
    130 
    131 	/* write (single) */
    132 	generic_bs_w_1,
    133 	generic_armv4_bs_w_2,
    134 	generic_bs_w_4,
    135 	bs_notimpl_bs_w_8,
    136 
    137 	/* write multiple */
    138 	generic_bs_wm_1,
    139 	generic_armv4_bs_wm_2,
    140 	generic_bs_wm_4,
    141 	bs_notimpl_bs_wm_8,
    142 
    143 	/* write region */
    144 	bs_notimpl_bs_wr_1,
    145 	generic_armv4_bs_wr_2,
    146 	generic_bs_wr_4,
    147 	bs_notimpl_bs_wr_8,
    148 
    149 	/* set multiple */
    150 	bs_notimpl_bs_sm_1,
    151 	bs_notimpl_bs_sm_2,
    152 	bs_notimpl_bs_sm_4,
    153 	bs_notimpl_bs_sm_8,
    154 
    155 	/* set region */
    156 	bs_notimpl_bs_sr_1,
    157 	generic_armv4_bs_sr_2,
    158 	bs_notimpl_bs_sr_4,
    159 	bs_notimpl_bs_sr_8,
    160 
    161 	/* copy */
    162 	bs_notimpl_bs_c_1,
    163 	generic_armv4_bs_c_2,
    164 	bs_notimpl_bs_c_4,
    165 	bs_notimpl_bs_c_8,
    166 };
    167 
    168 int
    169 pxa2x0_bs_map(void *t, bus_addr_t bpa, bus_size_t size,
    170 	      int flag, bus_space_handle_t *bshp)
    171 {
    172 	u_long startpa, endpa, pa;
    173 	vaddr_t va;
    174 	pt_entry_t *pte;
    175 
    176 	if ((u_long)bpa > (u_long)KERNEL_BASE) {
    177 		/* Some IO registers (ex. UART ports for console)
    178 		   are mapped to fixed address by board specific
    179 		   routine. */
    180 		*bshp = bpa;
    181 		return(0);
    182 	}
    183 
    184 	startpa = trunc_page(bpa);
    185 	endpa = round_page(bpa + size);
    186 
    187 	/* XXX use extent manager to check duplicate mapping */
    188 
    189 	va = uvm_km_valloc(kernel_map, endpa - startpa);
    190 	if (! va)
    191 		return(ENOMEM);
    192 
    193 	*bshp = (bus_space_handle_t)(va + (bpa - startpa));
    194 
    195 	for (pa = startpa; pa < endpa; pa += PAGE_SIZE, va += PAGE_SIZE) {
    196 		pmap_kenter_pa(va, pa, VM_PROT_READ | VM_PROT_WRITE);
    197 		if ((flag & BUS_SPACE_MAP_CACHEABLE) == 0) {
    198 			pte = vtopte(va);
    199 			*pte &= ~L2_S_CACHE_MASK;
    200 			PTE_SYNC(pte);
    201 			/* XXX: pmap_kenter_pa() also does PTE_SYNC(). a bit of
    202 			 *      waste.
    203 			 */
    204 		}
    205 	}
    206 	pmap_update(pmap_kernel());
    207 
    208 	return(0);
    209 }
    210 
    211 void
    212 pxa2x0_bs_unmap(void *t, bus_space_handle_t bsh, bus_size_t size)
    213 {
    214 
    215 	/* Nothing to do. */
    216 }
    217 
    218 
    219 int
    220 pxa2x0_bs_subregion(void *t, bus_space_handle_t bsh, bus_size_t offset,
    221     bus_size_t size, bus_space_handle_t *nbshp)
    222 {
    223 
    224 	*nbshp = bsh + offset;
    225 	return (0);
    226 }
    227 
    228 void
    229 pxa2x0_bs_barrier(void *t, bus_space_handle_t bsh, bus_size_t offset,
    230     bus_size_t len, int flags)
    231 {
    232 
    233 	/* Nothing to do. */
    234 }
    235 
    236 void *
    237 pxa2x0_bs_vaddr(void *t, bus_space_handle_t bsh)
    238 {
    239 
    240 	return ((void *)bsh);
    241 }
    242 
    243 
    244 int
    245 pxa2x0_bs_alloc(void *t, bus_addr_t rstart, bus_addr_t rend,
    246     bus_size_t size, bus_size_t alignment, bus_size_t boundary, int flags,
    247     bus_addr_t *bpap, bus_space_handle_t *bshp)
    248 {
    249 
    250 	panic("pxa2x0_io_bs_alloc(): not implemented\n");
    251 }
    252 
    253 void
    254 pxa2x0_bs_free(void *t, bus_space_handle_t bsh, bus_size_t size)
    255 {
    256 
    257 	panic("pxa2x0_io_bs_free(): not implemented\n");
    258 }
    259 
    260