Home | History | Annotate | Line # | Download | only in podulebus
      1 /*	$NetBSD: podulebus_io.c,v 1.9 2018/03/16 17:56:31 ryo Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1997 Mark Brinicombe.
      5  * All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. All advertising materials mentioning features or use of this software
     16  *    must display the following acknowledgement:
     17  *	This product includes software developed by Mark Brinicombe.
     18  * 4. The name of the company nor the name of the author may be used to
     19  *    endorse or promote products derived from this software without specific
     20  *    prior written permission.
     21  *
     22  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
     23  * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
     24  * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     25  * IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
     26  * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
     27  * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
     28  * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     32  * SUCH DAMAGE.
     33  */
     34 
     35 /*
     36  * bus_space I/O functions for podulebus
     37  */
     38 
     39 #include <sys/cdefs.h>
     40 __KERNEL_RCSID(0, "$NetBSD: podulebus_io.c,v 1.9 2018/03/16 17:56:31 ryo Exp $");
     41 
     42 #include <sys/param.h>
     43 #include <sys/systm.h>
     44 #include <sys/bus.h>
     45 
     46 /* Proto types for all the bus_space structure functions */
     47 
     48 bs_protos(podulebus);
     49 bs_protos(bs_notimpl);
     50 
     51 /* Declare the podulebus bus space tag */
     52 
     53 struct bus_space podulebus_bs_tag = {
     54 	/* cookie */
     55 	.bs_cookie = (void *) 2,	/* Shift to apply to registers */
     56 
     57 	/* mapping/unmapping */
     58 	.bs_map = podulebus_bs_map,
     59 	.bs_unmap = podulebus_bs_unmap,
     60 	.bs_subregion = podulebus_bs_subregion,
     61 
     62 	/* allocation/deallocation */
     63 	.bs_alloc = podulebus_bs_alloc,
     64 	.bs_free = podulebus_bs_free,
     65 
     66 	/* get kernel virtual address */
     67 	.bs_vaddr = 0, /* there is no linear mapping */
     68 
     69 	/* mmap bus space for userland */
     70 	.bs_mmap = bs_notimpl_bs_mmap, /* there is no bus mapping ... well maybe EASI space? */
     71 
     72 	/* barrier */
     73 	.bs_barrier = podulebus_bs_barrier,
     74 
     75 	/* read (single) */
     76 	.bs_r_1 = podulebus_bs_r_1,
     77 	.bs_r_2 = podulebus_bs_r_2,
     78 	.bs_r_4 = podulebus_bs_r_4,
     79 	.bs_r_8 = bs_notimpl_bs_r_8,
     80 
     81 	/* read multiple */
     82 	.bs_rm_1 = podulebus_bs_rm_1,
     83 	.bs_rm_2 = podulebus_bs_rm_2,
     84 	.bs_rm_4 = bs_notimpl_bs_rm_4,
     85 	.bs_rm_8 = bs_notimpl_bs_rm_8,
     86 
     87 	/* read region */
     88 	.bs_rr_1 = podulebus_bs_rr_1,
     89 	.bs_rr_2 = podulebus_bs_rr_2,
     90 	.bs_rr_4 = bs_notimpl_bs_rr_4,
     91 	.bs_rr_8 = bs_notimpl_bs_rr_8,
     92 
     93 	/* write (single) */
     94 	.bs_w_1 = podulebus_bs_w_1,
     95 	.bs_w_2 = podulebus_bs_w_2,
     96 	.bs_w_4 = podulebus_bs_w_4,
     97 	.bs_w_8 = bs_notimpl_bs_w_8,
     98 
     99 	/* write multiple */
    100 	.bs_wm_1 = podulebus_bs_wm_1,
    101 	.bs_wm_2 = podulebus_bs_wm_2,
    102 	.bs_wm_4 = bs_notimpl_bs_wm_4,
    103 	.bs_wm_8 = bs_notimpl_bs_wm_8,
    104 
    105 	/* write region */
    106 	.bs_wr_1 = podulebus_bs_wr_1,
    107 	.bs_wr_2 = podulebus_bs_wr_2,
    108 	.bs_wr_4 = bs_notimpl_bs_wr_4,
    109 	.bs_wr_8 = bs_notimpl_bs_wr_8,
    110 
    111 	/* set multiple */
    112 	.bs_sm_1 = bs_notimpl_bs_sm_1,
    113 	.bs_sm_2 = bs_notimpl_bs_sm_2,
    114 	.bs_sm_4 = bs_notimpl_bs_sm_4,
    115 	.bs_sm_8 = bs_notimpl_bs_sm_8,
    116 
    117 	/* set region */
    118 	.bs_sr_1 = podulebus_bs_sr_1,
    119 	.bs_sr_2 = podulebus_bs_sr_2,
    120 	.bs_sr_4 = bs_notimpl_bs_sr_4,
    121 	.bs_sr_8 = bs_notimpl_bs_sr_8,
    122 
    123 	/* copy */
    124 	.bs_c_1 = bs_notimpl_bs_c_1,
    125 	.bs_c_2 = bs_notimpl_bs_c_2,
    126 	.bs_c_4 = bs_notimpl_bs_c_4,
    127 	.bs_c_8 = bs_notimpl_bs_c_8,
    128 };
    129 
    130 /* bus space functions */
    131 
    132 int
    133 podulebus_bs_map(void *t, bus_addr_t bpa, bus_size_t size, int cacheable, bus_space_handle_t *bshp)
    134 {
    135 	/*
    136 	 * Temporary implementation as all I/O is already mapped etc.
    137 	 *
    138 	 * Eventually this function will do the mapping check for multiple maps
    139 	 */
    140 	*bshp = bpa;
    141 	return(0);
    142 	}
    143 
    144 int
    145 podulebus_bs_alloc(void *t, bus_addr_t rstart, bus_addr_t rend,
    146     bus_size_t size, bus_size_t alignment, bus_size_t boundary,
    147     int cacheable, bus_addr_t *bpap, bus_space_handle_t *bshp)
    148 {
    149 	panic("podulebus_bs_alloc(): Help!");
    150 }
    151 
    152 
    153 void
    154 podulebus_bs_unmap(void *t, bus_space_handle_t bsh, bus_size_t size)
    155 {
    156 	/*
    157 	 * Temporary implementation
    158 	 */
    159 }
    160 
    161 void
    162 podulebus_bs_free(void *t, bus_space_handle_t bsh, bus_size_t size)
    163 {
    164 
    165 	panic("podulebus_bs_free(): Help!");
    166 	/* podulebus_bs_unmap() does all that we need to do. */
    167 /*	podulebus_bs_unmap(t, bsh, size);*/
    168 }
    169 
    170 int
    171 podulebus_bs_subregion(void *t, bus_space_handle_t bsh, bus_size_t offset, bus_size_t size, bus_space_handle_t *nbshp)
    172 {
    173 
    174 	*nbshp = bsh + (offset << ((int)t));
    175 	return (0);
    176 }
    177 
    178 void
    179 podulebus_bs_barrier(void *t, bus_space_handle_t bsh, bus_size_t offset, bus_size_t len, int flags)
    180 {
    181 }
    182 
    183 /* Rough-and-ready implementations from arm26 */
    184 
    185 void
    186 podulebus_bs_rr_1(void *cookie, bus_space_handle_t bsh,
    187 			bus_size_t offset, uint8_t *datap, bus_size_t count)
    188 {
    189 	int i;
    190 
    191 	for (i = 0; i < count; i++)
    192 		datap[i] = podulebus_bs_r_1(cookie, bsh, offset + i);
    193 }
    194 
    195 void
    196 podulebus_bs_rr_2(void *cookie, bus_space_handle_t bsh,
    197 			bus_size_t offset, uint16_t *datap, bus_size_t count)
    198 {
    199 	int i;
    200 
    201 	for (i = 0; i < count; i++)
    202 		datap[i] = podulebus_bs_r_2(cookie, bsh, offset + i);
    203 }
    204 
    205 void
    206 podulebus_bs_wr_1(void *cookie, bus_space_handle_t bsh,
    207 			 bus_size_t offset, uint8_t const *datap,
    208 			 bus_size_t count)
    209 {
    210 	int i;
    211 
    212 	for (i = 0; i < count; i++)
    213 		podulebus_bs_w_1(cookie, bsh, offset + i, datap[i]);
    214 }
    215 
    216 void
    217 podulebus_bs_wr_2(void *cookie, bus_space_handle_t bsh,
    218 			 bus_size_t offset, uint16_t const *datap,
    219 			 bus_size_t count)
    220 {
    221 	int i;
    222 
    223 	for (i = 0; i < count; i++)
    224 		podulebus_bs_w_2(cookie, bsh, offset + i, datap[i]);
    225 }
    226 
    227 void
    228 podulebus_bs_sr_1(void *cookie, bus_space_handle_t bsh,
    229 		       bus_size_t offset, uint8_t value, bus_size_t count)
    230 {
    231 	int i;
    232 
    233 	for (i = 0; i < count; i++)
    234 		podulebus_bs_w_1(cookie, bsh, offset + i, value);
    235 }
    236 
    237 void
    238 podulebus_bs_sr_2(void *cookie, bus_space_handle_t bsh,
    239 		       bus_size_t offset, uint16_t value, bus_size_t count)
    240 {
    241 	int i;
    242 
    243 	for (i = 0; i < count; i++)
    244 		podulebus_bs_w_2(cookie, bsh, offset + i, value);
    245 }
    246