/*-
 * Copyright (c) 2017-2019 Ruslan Bukin <br@bsdpad.com>
 * All rights reserved.
 *
 * This software was developed by SRI International and the University of
 * Cambridge Computer Laboratory under DARPA/AFRL contract FA8750-10-C-0237
 * ("CTSRD"), as part of the DARPA CRASH research programme.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#include <sys/cdefs.h>
#include "opt_platform.h"
#include <sys/param.h>
#include <sys/conf.h>
#include <sys/bus.h>
#include <sys/kernel.h>
#include <sys/lock.h>
#include <sys/malloc.h>
#include <sys/mutex.h>

#include <machine/bus.h>

#include <dev/xdma/xdma.h>

int
xdma_dequeue_bio(xdma_channel_t *xchan, struct bio **bp,
    xdma_transfer_status_t *status)
{
        struct xdma_request *xr_tmp;
        struct xdma_request *xr;

        QUEUE_OUT_LOCK(xchan);
        TAILQ_FOREACH_SAFE(xr, &xchan->queue_out, xr_next, xr_tmp) {
                TAILQ_REMOVE(&xchan->queue_out, xr, xr_next);
                break;
        }
        QUEUE_OUT_UNLOCK(xchan);

        if (xr == NULL)
                return (-1);

        *bp = xr->bp;

        status->error = xr->status.error;
        status->transferred = xr->status.transferred;

        xchan_bank_put(xchan, xr);

        return (0);
}

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)
{
        struct xdma_request *xr;

        xr = xchan_bank_get(xchan);
        if (xr == NULL)
                return (-1); /* No space is available yet. */

        xr->direction = dir;
        xr->bp = *bp;
        xr->req_type = XR_TYPE_BIO;
        xr->src_width = src_width;
        xr->dst_width = dst_width;
        if (dir == XDMA_MEM_TO_DEV) {
                xr->dst_addr = addr;
                xr->src_addr = 0;
        } else {
                xr->dst_addr = 0;
                xr->src_addr = addr;
        }

        QUEUE_IN_LOCK(xchan);
        TAILQ_INSERT_TAIL(&xchan->queue_in, xr, xr_next);
        QUEUE_IN_UNLOCK(xchan);

        return (0);
}