13d5b3b0aSRuslan Bukin /*-
2101869a8SRuslan Bukin * Copyright (c) 2017-2019 Ruslan Bukin <br@bsdpad.com>
33d5b3b0aSRuslan Bukin * All rights reserved.
43d5b3b0aSRuslan Bukin *
53d5b3b0aSRuslan Bukin * This software was developed by SRI International and the University of
63d5b3b0aSRuslan Bukin * Cambridge Computer Laboratory under DARPA/AFRL contract FA8750-10-C-0237
73d5b3b0aSRuslan Bukin * ("CTSRD"), as part of the DARPA CRASH research programme.
83d5b3b0aSRuslan Bukin *
93d5b3b0aSRuslan Bukin * Redistribution and use in source and binary forms, with or without
103d5b3b0aSRuslan Bukin * modification, are permitted provided that the following conditions
113d5b3b0aSRuslan Bukin * are met:
123d5b3b0aSRuslan Bukin * 1. Redistributions of source code must retain the above copyright
133d5b3b0aSRuslan Bukin * notice, this list of conditions and the following disclaimer.
143d5b3b0aSRuslan Bukin * 2. Redistributions in binary form must reproduce the above copyright
153d5b3b0aSRuslan Bukin * notice, this list of conditions and the following disclaimer in the
163d5b3b0aSRuslan Bukin * documentation and/or other materials provided with the distribution.
173d5b3b0aSRuslan Bukin *
183d5b3b0aSRuslan Bukin * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
193d5b3b0aSRuslan Bukin * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
203d5b3b0aSRuslan Bukin * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
213d5b3b0aSRuslan Bukin * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
223d5b3b0aSRuslan Bukin * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
233d5b3b0aSRuslan Bukin * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
243d5b3b0aSRuslan Bukin * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
253d5b3b0aSRuslan Bukin * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
263d5b3b0aSRuslan Bukin * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
273d5b3b0aSRuslan Bukin * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
283d5b3b0aSRuslan Bukin * SUCH DAMAGE.
293d5b3b0aSRuslan Bukin */
303d5b3b0aSRuslan Bukin
313d5b3b0aSRuslan Bukin #include <sys/cdefs.h>
323d5b3b0aSRuslan Bukin #include "opt_platform.h"
333d5b3b0aSRuslan Bukin #include <sys/param.h>
343d5b3b0aSRuslan Bukin #include <sys/conf.h>
353d5b3b0aSRuslan Bukin #include <sys/bus.h>
363d5b3b0aSRuslan Bukin #include <sys/kernel.h>
37*e2e050c8SConrad Meyer #include <sys/lock.h>
383d5b3b0aSRuslan Bukin #include <sys/mbuf.h>
39*e2e050c8SConrad Meyer #include <sys/mutex.h>
403d5b3b0aSRuslan Bukin
413d5b3b0aSRuslan Bukin #include <machine/bus.h>
423d5b3b0aSRuslan Bukin
433d5b3b0aSRuslan Bukin #ifdef FDT
443d5b3b0aSRuslan Bukin #include <dev/fdt/fdt_common.h>
453d5b3b0aSRuslan Bukin #include <dev/ofw/ofw_bus.h>
463d5b3b0aSRuslan Bukin #include <dev/ofw/ofw_bus_subr.h>
473d5b3b0aSRuslan Bukin #endif
483d5b3b0aSRuslan Bukin
493d5b3b0aSRuslan Bukin #include <dev/xdma/xdma.h>
503d5b3b0aSRuslan Bukin
513d5b3b0aSRuslan Bukin int
xdma_dequeue_mbuf(xdma_channel_t * xchan,struct mbuf ** mp,xdma_transfer_status_t * status)523d5b3b0aSRuslan Bukin xdma_dequeue_mbuf(xdma_channel_t *xchan, struct mbuf **mp,
533d5b3b0aSRuslan Bukin xdma_transfer_status_t *status)
543d5b3b0aSRuslan Bukin {
553d5b3b0aSRuslan Bukin struct xdma_request *xr;
563d5b3b0aSRuslan Bukin struct xdma_request *xr_tmp;
573d5b3b0aSRuslan Bukin
583d5b3b0aSRuslan Bukin QUEUE_OUT_LOCK(xchan);
593d5b3b0aSRuslan Bukin TAILQ_FOREACH_SAFE(xr, &xchan->queue_out, xr_next, xr_tmp) {
603d5b3b0aSRuslan Bukin TAILQ_REMOVE(&xchan->queue_out, xr, xr_next);
613d5b3b0aSRuslan Bukin break;
623d5b3b0aSRuslan Bukin }
633d5b3b0aSRuslan Bukin QUEUE_OUT_UNLOCK(xchan);
643d5b3b0aSRuslan Bukin
653d5b3b0aSRuslan Bukin if (xr == NULL)
663d5b3b0aSRuslan Bukin return (-1);
673d5b3b0aSRuslan Bukin
683d5b3b0aSRuslan Bukin *mp = xr->m;
693d5b3b0aSRuslan Bukin status->error = xr->status.error;
703d5b3b0aSRuslan Bukin status->transferred = xr->status.transferred;
713d5b3b0aSRuslan Bukin
723d5b3b0aSRuslan Bukin xchan_bank_put(xchan, xr);
733d5b3b0aSRuslan Bukin
743d5b3b0aSRuslan Bukin return (0);
753d5b3b0aSRuslan Bukin }
763d5b3b0aSRuslan Bukin
773d5b3b0aSRuslan Bukin int
xdma_enqueue_mbuf(xdma_channel_t * xchan,struct mbuf ** mp,uintptr_t addr,uint8_t src_width,uint8_t dst_width,enum xdma_direction dir)783d5b3b0aSRuslan Bukin xdma_enqueue_mbuf(xdma_channel_t *xchan, struct mbuf **mp,
793d5b3b0aSRuslan Bukin uintptr_t addr, uint8_t src_width, uint8_t dst_width,
803d5b3b0aSRuslan Bukin enum xdma_direction dir)
813d5b3b0aSRuslan Bukin {
823d5b3b0aSRuslan Bukin struct xdma_request *xr;
833d5b3b0aSRuslan Bukin
843d5b3b0aSRuslan Bukin xr = xchan_bank_get(xchan);
853d5b3b0aSRuslan Bukin if (xr == NULL)
863d5b3b0aSRuslan Bukin return (-1); /* No space is available yet. */
873d5b3b0aSRuslan Bukin
883d5b3b0aSRuslan Bukin xr->direction = dir;
893d5b3b0aSRuslan Bukin xr->m = *mp;
903d5b3b0aSRuslan Bukin xr->req_type = XR_TYPE_MBUF;
913d5b3b0aSRuslan Bukin if (dir == XDMA_MEM_TO_DEV) {
923d5b3b0aSRuslan Bukin xr->dst_addr = addr;
933d5b3b0aSRuslan Bukin xr->src_addr = 0;
943d5b3b0aSRuslan Bukin } else {
953d5b3b0aSRuslan Bukin xr->src_addr = addr;
963d5b3b0aSRuslan Bukin xr->dst_addr = 0;
973d5b3b0aSRuslan Bukin }
983d5b3b0aSRuslan Bukin xr->src_width = src_width;
993d5b3b0aSRuslan Bukin xr->dst_width = dst_width;
1003d5b3b0aSRuslan Bukin
1013d5b3b0aSRuslan Bukin QUEUE_IN_LOCK(xchan);
1023d5b3b0aSRuslan Bukin TAILQ_INSERT_TAIL(&xchan->queue_in, xr, xr_next);
1033d5b3b0aSRuslan Bukin QUEUE_IN_UNLOCK(xchan);
1043d5b3b0aSRuslan Bukin
1053d5b3b0aSRuslan Bukin return (0);
1063d5b3b0aSRuslan Bukin }
1073d5b3b0aSRuslan Bukin
1083d5b3b0aSRuslan Bukin uint32_t
xdma_mbuf_chain_count(struct mbuf * m0)1093d5b3b0aSRuslan Bukin xdma_mbuf_chain_count(struct mbuf *m0)
1103d5b3b0aSRuslan Bukin {
1113d5b3b0aSRuslan Bukin struct mbuf *m;
1123d5b3b0aSRuslan Bukin uint32_t c;
1133d5b3b0aSRuslan Bukin
1143d5b3b0aSRuslan Bukin c = 0;
1153d5b3b0aSRuslan Bukin
1163d5b3b0aSRuslan Bukin for (m = m0; m != NULL; m = m->m_next)
1173d5b3b0aSRuslan Bukin c++;
1183d5b3b0aSRuslan Bukin
1193d5b3b0aSRuslan Bukin return (c);
1203d5b3b0aSRuslan Bukin }
1213d5b3b0aSRuslan Bukin
1223d5b3b0aSRuslan Bukin uint32_t
xdma_mbuf_defrag(xdma_channel_t * xchan,struct xdma_request * xr)1233d5b3b0aSRuslan Bukin xdma_mbuf_defrag(xdma_channel_t *xchan, struct xdma_request *xr)
1243d5b3b0aSRuslan Bukin {
1253d5b3b0aSRuslan Bukin xdma_controller_t *xdma;
1263d5b3b0aSRuslan Bukin struct mbuf *m;
1273d5b3b0aSRuslan Bukin uint32_t c;
1283d5b3b0aSRuslan Bukin
1293d5b3b0aSRuslan Bukin xdma = xchan->xdma;
1303d5b3b0aSRuslan Bukin
1313d5b3b0aSRuslan Bukin c = xdma_mbuf_chain_count(xr->m);
1323d5b3b0aSRuslan Bukin if (c == 1)
1333d5b3b0aSRuslan Bukin return (c); /* Nothing to do. */
1343d5b3b0aSRuslan Bukin
1353d5b3b0aSRuslan Bukin if ((m = m_defrag(xr->m, M_NOWAIT)) == NULL) {
1363d5b3b0aSRuslan Bukin device_printf(xdma->dma_dev,
1373d5b3b0aSRuslan Bukin "%s: Can't defrag mbuf\n",
1383d5b3b0aSRuslan Bukin __func__);
1393d5b3b0aSRuslan Bukin return (c);
1403d5b3b0aSRuslan Bukin }
1415a51e5e4SRuslan Bukin
1423d5b3b0aSRuslan Bukin xr->m = m;
1433d5b3b0aSRuslan Bukin c = 1;
1443d5b3b0aSRuslan Bukin
1453d5b3b0aSRuslan Bukin return (c);
1463d5b3b0aSRuslan Bukin }
147