1 1.32 ozaki /* $NetBSD: if_uba.c,v 1.32 2016/06/10 13:27:15 ozaki-r Exp $ */ 2 1.3 cgd 3 1.1 ragge /* 4 1.1 ragge * Copyright (c) 1982, 1986, 1988 Regents of the University of California. 5 1.1 ragge * All rights reserved. 6 1.1 ragge * 7 1.1 ragge * Redistribution and use in source and binary forms, with or without 8 1.1 ragge * modification, are permitted provided that the following conditions 9 1.1 ragge * are met: 10 1.1 ragge * 1. Redistributions of source code must retain the above copyright 11 1.1 ragge * notice, this list of conditions and the following disclaimer. 12 1.1 ragge * 2. Redistributions in binary form must reproduce the above copyright 13 1.1 ragge * notice, this list of conditions and the following disclaimer in the 14 1.1 ragge * documentation and/or other materials provided with the distribution. 15 1.24 agc * 3. Neither the name of the University nor the names of its contributors 16 1.1 ragge * may be used to endorse or promote products derived from this software 17 1.1 ragge * without specific prior written permission. 18 1.1 ragge * 19 1.1 ragge * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 1.1 ragge * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 1.1 ragge * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 1.1 ragge * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 1.1 ragge * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 1.1 ragge * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 1.1 ragge * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 1.1 ragge * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 1.1 ragge * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 1.1 ragge * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 1.1 ragge * SUCH DAMAGE. 30 1.1 ragge * 31 1.1 ragge * @(#)if_uba.c 7.16 (Berkeley) 12/16/90 32 1.1 ragge */ 33 1.1 ragge 34 1.22 lukem #include <sys/cdefs.h> 35 1.32 ozaki __KERNEL_RCSID(0, "$NetBSD: if_uba.c,v 1.32 2016/06/10 13:27:15 ozaki-r Exp $"); 36 1.10 ragge 37 1.8 mycroft #include <sys/param.h> 38 1.8 mycroft #include <sys/systm.h> 39 1.8 mycroft #include <sys/malloc.h> 40 1.8 mycroft #include <sys/mbuf.h> 41 1.8 mycroft #include <sys/socket.h> 42 1.19 ragge #include <sys/device.h> 43 1.1 ragge 44 1.8 mycroft #include <net/if.h> 45 1.1 ragge 46 1.29 ad #include <sys/bus.h> 47 1.19 ragge 48 1.19 ragge #include <dev/qbus/if_uba.h> 49 1.19 ragge #include <dev/qbus/ubareg.h> 50 1.19 ragge #include <dev/qbus/ubavar.h> 51 1.19 ragge 52 1.19 ragge static struct mbuf *getmcl(void); 53 1.1 ragge 54 1.1 ragge /* 55 1.1 ragge * Routines supporting UNIBUS network interfaces. 56 1.1 ragge * 57 1.1 ragge * TODO: 58 1.1 ragge * Support interfaces using only one BDP statically. 59 1.1 ragge */ 60 1.1 ragge 61 1.1 ragge /* 62 1.12 ragge * Init UNIBUS for interface whose headers of size hlen are to 63 1.1 ragge * end on a page boundary. We allocate a UNIBUS map register for the page 64 1.1 ragge * with the header, and nmr more UNIBUS map registers for i/o on the adapter, 65 1.1 ragge * doing this once for each read and once for each write buffer. We also 66 1.1 ragge * allocate page frames in the mbuffer pool for these pages. 67 1.19 ragge * 68 1.19 ragge * Recent changes: 69 1.19 ragge * No special "header pages" anymore. 70 1.19 ragge * Recv packets are always put in clusters. 71 1.19 ragge * "size" is the maximum buffer size, may not be bigger than MCLBYTES. 72 1.1 ragge */ 73 1.10 ragge int 74 1.19 ragge if_ubaminit(struct ifubinfo *ifu, struct uba_softc *uh, int size, 75 1.19 ragge struct ifrw *ifr, int nr, struct ifxmt *ifw, int nw) 76 1.1 ragge { 77 1.19 ragge struct mbuf *m; 78 1.19 ragge int totsz, i, error, rseg, nm = nr; 79 1.19 ragge bus_dma_segment_t seg; 80 1.27 christos void *vaddr; 81 1.19 ragge 82 1.19 ragge #ifdef DIAGNOSTIC 83 1.19 ragge if (size > MCLBYTES) 84 1.19 ragge panic("if_ubaminit: size > MCLBYTES"); 85 1.19 ragge #endif 86 1.19 ragge ifu->iff_softc = uh; 87 1.19 ragge /* 88 1.19 ragge * Get DMA memory for transmit buffers. 89 1.19 ragge * Buffer size are rounded up to a multiple of the uba page size, 90 1.19 ragge * then allocated contiguous. 91 1.19 ragge */ 92 1.19 ragge size = (size + UBA_PGOFSET) & ~UBA_PGOFSET; 93 1.19 ragge totsz = size * nw; 94 1.23 thorpej if ((error = bus_dmamem_alloc(uh->uh_dmat, totsz, PAGE_SIZE, 0, 95 1.19 ragge &seg, 1, &rseg, BUS_DMA_NOWAIT))) 96 1.19 ragge return error; 97 1.19 ragge if ((error = bus_dmamem_map(uh->uh_dmat, &seg, rseg, totsz, &vaddr, 98 1.19 ragge BUS_DMA_NOWAIT|BUS_DMA_COHERENT))) { 99 1.19 ragge bus_dmamem_free(uh->uh_dmat, &seg, rseg); 100 1.19 ragge return error; 101 1.1 ragge } 102 1.19 ragge 103 1.19 ragge /* 104 1.19 ragge * Create receive and transmit maps. 105 1.19 ragge * Alloc all resources now so we won't fail in the future. 106 1.19 ragge */ 107 1.19 ragge 108 1.19 ragge for (i = 0; i < nr; i++) { 109 1.19 ragge if ((error = bus_dmamap_create(uh->uh_dmat, size, 1, 110 1.19 ragge size, 0, BUS_DMA_NOWAIT|BUS_DMA_ALLOCNOW, 111 1.19 ragge &ifr[i].ifrw_map))) { 112 1.1 ragge nr = i; 113 1.19 ragge nm = nw = 0; 114 1.1 ragge goto bad; 115 1.1 ragge } 116 1.19 ragge } 117 1.19 ragge for (i = 0; i < nw; i++) { 118 1.19 ragge if ((error = bus_dmamap_create(uh->uh_dmat, size, 1, 119 1.19 ragge size, 0, BUS_DMA_NOWAIT|BUS_DMA_ALLOCNOW, 120 1.19 ragge &ifw[i].ifw_map))) { 121 1.1 ragge nw = i; 122 1.19 ragge nm = 0; 123 1.1 ragge goto bad; 124 1.1 ragge } 125 1.1 ragge } 126 1.19 ragge /* 127 1.19 ragge * Preload the rx maps with mbuf clusters. 128 1.19 ragge */ 129 1.19 ragge for (i = 0; i < nm; i++) { 130 1.19 ragge if ((m = getmcl()) == NULL) { 131 1.19 ragge nm = i; 132 1.19 ragge goto bad; 133 1.19 ragge } 134 1.19 ragge ifr[i].ifrw_mbuf = m; 135 1.19 ragge bus_dmamap_load(uh->uh_dmat, ifr[i].ifrw_map, 136 1.19 ragge m->m_ext.ext_buf, m->m_ext.ext_size, NULL, BUS_DMA_NOWAIT); 137 1.25 simonb 138 1.19 ragge } 139 1.19 ragge /* 140 1.19 ragge * Load the tx maps with DMA memory (common case). 141 1.19 ragge */ 142 1.19 ragge for (i = 0; i < nw; i++) { 143 1.28 he ifw[i].ifw_vaddr = (char *)vaddr + size * i; 144 1.19 ragge ifw[i].ifw_size = size; 145 1.25 simonb bus_dmamap_load(uh->uh_dmat, ifw[i].ifw_map, 146 1.19 ragge ifw[i].ifw_vaddr, ifw[i].ifw_size, NULL, BUS_DMA_NOWAIT); 147 1.19 ragge } 148 1.19 ragge return 0; 149 1.1 ragge bad: 150 1.19 ragge while (--nm >= 0) { 151 1.19 ragge bus_dmamap_unload(uh->uh_dmat, ifr[nw].ifrw_map); 152 1.19 ragge m_freem(ifr[nm].ifrw_mbuf); 153 1.19 ragge } 154 1.1 ragge while (--nw >= 0) 155 1.19 ragge bus_dmamap_destroy(uh->uh_dmat, ifw[nw].ifw_map); 156 1.1 ragge while (--nr >= 0) 157 1.19 ragge bus_dmamap_destroy(uh->uh_dmat, ifr[nw].ifrw_map); 158 1.1 ragge return (0); 159 1.1 ragge } 160 1.1 ragge 161 1.19 ragge struct mbuf * 162 1.30 matt getmcl(void) 163 1.1 ragge { 164 1.19 ragge struct mbuf *m; 165 1.1 ragge 166 1.19 ragge MGETHDR(m, M_DONTWAIT, MT_DATA); 167 1.19 ragge if (m == NULL) 168 1.19 ragge return 0; 169 1.19 ragge MCLGET(m, M_DONTWAIT); 170 1.19 ragge if ((m->m_flags & M_EXT) == 0) { 171 1.19 ragge m_freem(m); 172 1.19 ragge return 0; 173 1.19 ragge } 174 1.19 ragge return m; 175 1.1 ragge } 176 1.1 ragge 177 1.1 ragge /* 178 1.1 ragge * Pull read data off a interface. 179 1.1 ragge * Totlen is length of data, with local net header stripped. 180 1.6 mycroft * When full cluster sized units are present 181 1.1 ragge * on the interface on cluster boundaries we can get them more 182 1.1 ragge * easily by remapping, and take advantage of this here. 183 1.1 ragge * Save a pointer to the interface structure and the total length, 184 1.1 ragge * so that protocols can determine where incoming packets arrived. 185 1.1 ragge * Note: we may be called to receive from a transmit buffer by some 186 1.1 ragge * devices. In that case, we must force normal mapping of the buffer, 187 1.25 simonb * so that the correct data will appear (only unibus maps are 188 1.1 ragge * changed when remapping the transmit buffers). 189 1.1 ragge */ 190 1.1 ragge struct mbuf * 191 1.19 ragge if_ubaget(struct ifubinfo *ifu, struct ifrw *ifr, struct ifnet *ifp, int len) 192 1.1 ragge { 193 1.19 ragge struct uba_softc *uh = ifu->iff_softc; 194 1.19 ragge struct mbuf *m, *mn; 195 1.1 ragge 196 1.19 ragge if ((mn = getmcl()) == NULL) 197 1.19 ragge return NULL; /* Leave the old */ 198 1.1 ragge 199 1.19 ragge bus_dmamap_unload(uh->uh_dmat, ifr->ifrw_map); 200 1.19 ragge m = ifr->ifrw_mbuf; 201 1.19 ragge ifr->ifrw_mbuf = mn; 202 1.19 ragge if ((bus_dmamap_load(uh->uh_dmat, ifr->ifrw_map, 203 1.19 ragge mn->m_ext.ext_buf, mn->m_ext.ext_size, NULL, BUS_DMA_NOWAIT))) 204 1.19 ragge panic("if_ubaget"); /* Cannot happen */ 205 1.32 ozaki m_set_rcvif(m, ifp); 206 1.19 ragge m->m_len = m->m_pkthdr.len = len; 207 1.19 ragge return m; 208 1.1 ragge } 209 1.1 ragge 210 1.1 ragge /* 211 1.19 ragge * Called after a packet is sent. Releases hold resources. 212 1.1 ragge */ 213 1.19 ragge void 214 1.19 ragge if_ubaend(struct ifubinfo *ifu, struct ifxmt *ifw) 215 1.1 ragge { 216 1.19 ragge struct uba_softc *uh = ifu->iff_softc; 217 1.1 ragge 218 1.19 ragge if (ifw->ifw_flags & IFRW_MBUF) { 219 1.19 ragge bus_dmamap_unload(uh->uh_dmat, ifw->ifw_map); 220 1.19 ragge m_freem(ifw->ifw_mbuf); 221 1.19 ragge ifw->ifw_mbuf = NULL; 222 1.19 ragge } 223 1.1 ragge } 224 1.1 ragge 225 1.1 ragge /* 226 1.1 ragge * Map a chain of mbufs onto a network interface 227 1.1 ragge * in preparation for an i/o operation. 228 1.1 ragge * The argument chain of mbufs includes the local network 229 1.1 ragge * header which is copied to be in the mapped, aligned 230 1.1 ragge * i/o space. 231 1.1 ragge */ 232 1.10 ragge int 233 1.19 ragge if_ubaput(struct ifubinfo *ifu, struct ifxmt *ifw, struct mbuf *m) 234 1.1 ragge { 235 1.19 ragge struct uba_softc *uh = ifu->iff_softc; 236 1.19 ragge int len; 237 1.1 ragge 238 1.19 ragge if (/* m->m_next ==*/ 0) { 239 1.19 ragge /* 240 1.19 ragge * Map the outgoing packet directly. 241 1.19 ragge */ 242 1.19 ragge if ((ifw->ifw_flags & IFRW_MBUF) == 0) { 243 1.19 ragge bus_dmamap_unload(uh->uh_dmat, ifw->ifw_map); 244 1.19 ragge ifw->ifw_flags |= IFRW_MBUF; 245 1.19 ragge } 246 1.19 ragge bus_dmamap_load(uh->uh_dmat, ifw->ifw_map, mtod(m, void *), 247 1.19 ragge m->m_len, NULL, BUS_DMA_NOWAIT); 248 1.19 ragge ifw->ifw_mbuf = m; 249 1.19 ragge len = m->m_len; 250 1.19 ragge } else { 251 1.19 ragge if (ifw->ifw_flags & IFRW_MBUF) { 252 1.19 ragge bus_dmamap_load(uh->uh_dmat, ifw->ifw_map, 253 1.25 simonb ifw->ifw_vaddr, ifw->ifw_size,NULL,BUS_DMA_NOWAIT); 254 1.19 ragge ifw->ifw_flags &= ~IFRW_MBUF; 255 1.19 ragge } 256 1.19 ragge len = m->m_pkthdr.len; 257 1.19 ragge m_copydata(m, 0, m->m_pkthdr.len, ifw->ifw_vaddr); 258 1.19 ragge m_freem(m); 259 1.1 ragge } 260 1.19 ragge return len; 261 1.1 ragge } 262