13d5b3b0aSRuslan Bukin /*-
2101869a8SRuslan Bukin * Copyright (c) 2018-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>
37e2e050c8SConrad Meyer #include <sys/lock.h>
383d5b3b0aSRuslan Bukin #include <sys/malloc.h>
39e2e050c8SConrad 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 void
xchan_bank_init(xdma_channel_t * xchan)463d5b3b0aSRuslan Bukin xchan_bank_init(xdma_channel_t *xchan)
473d5b3b0aSRuslan Bukin {
483d5b3b0aSRuslan Bukin struct xdma_request *xr;
493d5b3b0aSRuslan Bukin int i;
503d5b3b0aSRuslan Bukin
51*695d3e52SJohn Baldwin KASSERT(xchan->xdma != NULL, ("xdma is NULL"));
523d5b3b0aSRuslan Bukin
533d5b3b0aSRuslan Bukin xchan->xr_mem = malloc(sizeof(struct xdma_request) * xchan->xr_num,
543d5b3b0aSRuslan Bukin M_XDMA, M_WAITOK | M_ZERO);
553d5b3b0aSRuslan Bukin
563d5b3b0aSRuslan Bukin for (i = 0; i < xchan->xr_num; i++) {
573d5b3b0aSRuslan Bukin xr = &xchan->xr_mem[i];
583d5b3b0aSRuslan Bukin TAILQ_INSERT_TAIL(&xchan->bank, xr, xr_next);
593d5b3b0aSRuslan Bukin }
603d5b3b0aSRuslan Bukin }
613d5b3b0aSRuslan Bukin
623d5b3b0aSRuslan Bukin int
xchan_bank_free(xdma_channel_t * xchan)633d5b3b0aSRuslan Bukin xchan_bank_free(xdma_channel_t *xchan)
643d5b3b0aSRuslan Bukin {
653d5b3b0aSRuslan Bukin
663d5b3b0aSRuslan Bukin free(xchan->xr_mem, M_XDMA);
673d5b3b0aSRuslan Bukin
683d5b3b0aSRuslan Bukin return (0);
693d5b3b0aSRuslan Bukin }
703d5b3b0aSRuslan Bukin
713d5b3b0aSRuslan Bukin struct xdma_request *
xchan_bank_get(xdma_channel_t * xchan)723d5b3b0aSRuslan Bukin xchan_bank_get(xdma_channel_t *xchan)
733d5b3b0aSRuslan Bukin {
743d5b3b0aSRuslan Bukin struct xdma_request *xr;
753d5b3b0aSRuslan Bukin struct xdma_request *xr_tmp;
763d5b3b0aSRuslan Bukin
773d5b3b0aSRuslan Bukin QUEUE_BANK_LOCK(xchan);
783d5b3b0aSRuslan Bukin TAILQ_FOREACH_SAFE(xr, &xchan->bank, xr_next, xr_tmp) {
793d5b3b0aSRuslan Bukin TAILQ_REMOVE(&xchan->bank, xr, xr_next);
803d5b3b0aSRuslan Bukin break;
813d5b3b0aSRuslan Bukin }
823d5b3b0aSRuslan Bukin QUEUE_BANK_UNLOCK(xchan);
833d5b3b0aSRuslan Bukin
843d5b3b0aSRuslan Bukin return (xr);
853d5b3b0aSRuslan Bukin }
863d5b3b0aSRuslan Bukin
873d5b3b0aSRuslan Bukin int
xchan_bank_put(xdma_channel_t * xchan,struct xdma_request * xr)883d5b3b0aSRuslan Bukin xchan_bank_put(xdma_channel_t *xchan, struct xdma_request *xr)
893d5b3b0aSRuslan Bukin {
903d5b3b0aSRuslan Bukin
913d5b3b0aSRuslan Bukin QUEUE_BANK_LOCK(xchan);
923d5b3b0aSRuslan Bukin TAILQ_INSERT_TAIL(&xchan->bank, xr, xr_next);
933d5b3b0aSRuslan Bukin QUEUE_BANK_UNLOCK(xchan);
943d5b3b0aSRuslan Bukin
953d5b3b0aSRuslan Bukin return (0);
963d5b3b0aSRuslan Bukin }
97