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/malloc.h>
39*e2e050c8SConrad Meyer #include <sys/mutex.h>
403d5b3b0aSRuslan Bukin
413d5b3b0aSRuslan Bukin #include <machine/bus.h>
423d5b3b0aSRuslan Bukin
433d5b3b0aSRuslan Bukin #include <dev/xdma/xdma.h>
443d5b3b0aSRuslan Bukin
453d5b3b0aSRuslan Bukin int
xdma_dequeue_bio(xdma_channel_t * xchan,struct bio ** bp,xdma_transfer_status_t * status)463d5b3b0aSRuslan Bukin xdma_dequeue_bio(xdma_channel_t *xchan, struct bio **bp,
473d5b3b0aSRuslan Bukin xdma_transfer_status_t *status)
483d5b3b0aSRuslan Bukin {
493d5b3b0aSRuslan Bukin struct xdma_request *xr_tmp;
503d5b3b0aSRuslan Bukin struct xdma_request *xr;
513d5b3b0aSRuslan Bukin
523d5b3b0aSRuslan Bukin QUEUE_OUT_LOCK(xchan);
533d5b3b0aSRuslan Bukin TAILQ_FOREACH_SAFE(xr, &xchan->queue_out, xr_next, xr_tmp) {
543d5b3b0aSRuslan Bukin TAILQ_REMOVE(&xchan->queue_out, xr, xr_next);
553d5b3b0aSRuslan Bukin break;
563d5b3b0aSRuslan Bukin }
573d5b3b0aSRuslan Bukin QUEUE_OUT_UNLOCK(xchan);
583d5b3b0aSRuslan Bukin
593d5b3b0aSRuslan Bukin if (xr == NULL)
603d5b3b0aSRuslan Bukin return (-1);
613d5b3b0aSRuslan Bukin
623d5b3b0aSRuslan Bukin *bp = xr->bp;
633d5b3b0aSRuslan Bukin
643d5b3b0aSRuslan Bukin status->error = xr->status.error;
653d5b3b0aSRuslan Bukin status->transferred = xr->status.transferred;
663d5b3b0aSRuslan Bukin
673d5b3b0aSRuslan Bukin xchan_bank_put(xchan, xr);
683d5b3b0aSRuslan Bukin
693d5b3b0aSRuslan Bukin return (0);
703d5b3b0aSRuslan Bukin }
713d5b3b0aSRuslan Bukin
723d5b3b0aSRuslan Bukin int
xdma_enqueue_bio(xdma_channel_t * xchan,struct bio ** bp,bus_addr_t addr,uint8_t src_width,uint8_t dst_width,enum xdma_direction dir)733d5b3b0aSRuslan Bukin xdma_enqueue_bio(xdma_channel_t *xchan, struct bio **bp,
743d5b3b0aSRuslan Bukin bus_addr_t addr, uint8_t src_width, uint8_t dst_width,
753d5b3b0aSRuslan Bukin enum xdma_direction dir)
763d5b3b0aSRuslan Bukin {
773d5b3b0aSRuslan Bukin struct xdma_request *xr;
783d5b3b0aSRuslan Bukin
793d5b3b0aSRuslan Bukin xr = xchan_bank_get(xchan);
803d5b3b0aSRuslan Bukin if (xr == NULL)
813d5b3b0aSRuslan Bukin return (-1); /* No space is available yet. */
823d5b3b0aSRuslan Bukin
833d5b3b0aSRuslan Bukin xr->direction = dir;
843d5b3b0aSRuslan Bukin xr->bp = *bp;
853d5b3b0aSRuslan Bukin xr->req_type = XR_TYPE_BIO;
863d5b3b0aSRuslan Bukin xr->src_width = src_width;
873d5b3b0aSRuslan Bukin xr->dst_width = dst_width;
883d5b3b0aSRuslan Bukin if (dir == XDMA_MEM_TO_DEV) {
893d5b3b0aSRuslan Bukin xr->dst_addr = addr;
903d5b3b0aSRuslan Bukin xr->src_addr = 0;
913d5b3b0aSRuslan Bukin } else {
923d5b3b0aSRuslan Bukin xr->dst_addr = 0;
933d5b3b0aSRuslan Bukin xr->src_addr = addr;
943d5b3b0aSRuslan Bukin }
953d5b3b0aSRuslan Bukin
963d5b3b0aSRuslan Bukin QUEUE_IN_LOCK(xchan);
973d5b3b0aSRuslan Bukin TAILQ_INSERT_TAIL(&xchan->queue_in, xr, xr_next);
983d5b3b0aSRuslan Bukin QUEUE_IN_UNLOCK(xchan);
993d5b3b0aSRuslan Bukin
1003d5b3b0aSRuslan Bukin return (0);
1013d5b3b0aSRuslan Bukin }
102