1 /* $NetBSD: bus_funcs.h,v 1.4 2011/07/25 21:12:23 dyoung Exp $ */ 2 3 /*- 4 * Copyright (c) 1996, 1997 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility, 9 * NASA Ames Research Center. 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 * 20 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 21 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 22 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 23 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 24 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 25 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 26 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 27 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 29 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 30 * POSSIBILITY OF SUCH DAMAGE. 31 */ 32 33 /* 34 * Copyright (c) 1996 Charles M. Hannum. All rights reserved. 35 * Copyright (c) 1996 Christopher G. Demetriou. All rights reserved. 36 * 37 * Redistribution and use in source and binary forms, with or without 38 * modification, are permitted provided that the following conditions 39 * are met: 40 * 1. Redistributions of source code must retain the above copyright 41 * notice, this list of conditions and the following disclaimer. 42 * 2. Redistributions in binary form must reproduce the above copyright 43 * notice, this list of conditions and the following disclaimer in the 44 * documentation and/or other materials provided with the distribution. 45 * 3. All advertising materials mentioning features or use of this software 46 * must display the following acknowledgement: 47 * This product includes software developed by Christopher G. Demetriou 48 * for the NetBSD Project. 49 * 4. The name of the author may not be used to endorse or promote products 50 * derived from this software without specific prior written permission 51 * 52 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 53 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 54 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 55 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 56 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 57 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 58 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 59 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 60 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 61 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 62 */ 63 64 #ifndef _SH3_BUS_FUNCS_H_ 65 #define _SH3_BUS_FUNCS_H_ 66 67 #ifdef SH4_PCMCIA 68 int shpcmcia_memio_map(bus_space_tag_t, bus_addr_t, bus_size_t size, 69 int, bus_space_handle_t *); 70 71 int shpcmcia_mem_add_mapping(bus_addr_t, bus_size_t, int, 72 bus_space_handle_t *); 73 void shpcmcia_memio_unmap(bus_space_tag_t, bus_space_handle_t, 74 bus_size_t); 75 void shpcmcia_memio_free(bus_space_tag_t, bus_space_handle_t, 76 bus_size_t); 77 int shpcmcia_memio_subregion(bus_space_tag_t, bus_space_handle_t, 78 bus_size_t, bus_size_t, bus_space_handle_t *); 79 #endif 80 81 int sh_memio_alloc(bus_space_tag_t, bus_addr_t, bus_addr_t, bus_size_t, 82 bus_size_t, bus_size_t, int, bus_addr_t *, bus_space_handle_t *); 83 void sh_memio_free(bus_space_tag_t, bus_space_handle_t, bus_size_t); 84 void sh_memio_unmap(bus_space_tag_t, bus_space_handle_t, bus_size_t); 85 int sh_memio_subregion(bus_space_tag_t, bus_space_handle_t, 86 bus_size_t, bus_size_t, bus_space_handle_t *); 87 88 /* 89 * int bus_space_alloc(bus_space_tag_t t, bus_addr_t rstart, 90 * bus_addr_t rend, bus_size_t size, bus_size_t align, 91 * bus_size_t boundary, int flags, bus_addr_t *addrp, 92 * bus_space_handle_t *bshp); 93 * 94 * Allocate a region of bus space. 95 */ 96 97 #define bus_space_alloc(t, rs, re, s, a, b, f, ap, hp) \ 98 sh_memio_alloc((t), (rs), (re), (s), (a), (b), (f), (ap), (hp)) 99 100 /* 101 * int bus_space_free(bus_space_tag_t t, 102 * bus_space_handle_t bsh, bus_size_t size); 103 * 104 * Free a region of bus space. 105 */ 106 107 #define bus_space_free(t, h, s) \ 108 sh_memio_free((t), (h), (s)) 109 110 /* 111 * int bus_space_unmap(bus_space_tag_t t, 112 * bus_space_handle_t bsh, bus_size_t size); 113 * 114 * Unmap a region of bus space. 115 */ 116 117 #define bus_space_unmap(t, h, s) \ 118 sh_memio_unmap((t), (h), (s)) 119 120 /* 121 * int bus_space_subregion(bus_space_tag_t t, 122 * bus_space_handle_t bsh, bus_size_t offset, bus_size_t size, 123 * bus_space_handle_t *nbshp); 124 * 125 * Get a new handle for a subregion of an already-mapped area of bus space. 126 */ 127 128 #define bus_space_subregion(t, h, o, s, nhp) \ 129 sh_memio_subregion((t), (h), (o), (s), (nhp)) 130 131 /* 132 * Bus read/write barrier methods. 133 * 134 * void bus_space_barrier(bus_space_tag_t tag, 135 * bus_space_handle_t bsh, bus_size_t offset, 136 * bus_size_t len, int flags); 137 * 138 * Note: the sh3 does not currently require barriers, but we must 139 * provide the flags to MI code. 140 */ 141 #define bus_space_barrier(t, h, o, l, f) \ 142 ((void)((void)(t), (void)(h), (void)(o), (void)(l), (void)(f))) 143 144 #endif /* _SH3_BUS_FUNCS_H_ */ 145
Indexes created Sat Sep 20 22:09:52 GMT 2025