1/*-
2 * Copyright (c) 2018-2019 Ruslan Bukin <br@bsdpad.com>
3 * All rights reserved.
4 *
5 * This software was developed by SRI International and the University of
6 * Cambridge Computer Laboratory under DARPA/AFRL contract FA8750-10-C-0237
7 * ("CTSRD"), as part of the DARPA CRASH research programme.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 *    notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 *    notice, this list of conditions and the following disclaimer in the
16 *    documentation and/or other materials provided with the distribution.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 * SUCH DAMAGE.
29 */
30
31#include <sys/cdefs.h>
32__FBSDID("$FreeBSD$");
33
34#include "opt_platform.h"
35#include <sys/param.h>
36#include <sys/conf.h>
37#include <sys/bus.h>
38#include <sys/kernel.h>
39#include <sys/malloc.h>
40
41#include <machine/bus.h>
42
43#include <dev/xdma/xdma.h>
44
45void
46xchan_bank_init(xdma_channel_t *xchan)
47{
48	struct xdma_request *xr;
49	xdma_controller_t *xdma;
50	int i;
51
52	xdma = xchan->xdma;
53	KASSERT(xdma != NULL, ("xdma is NULL"));
54
55	xchan->xr_mem = malloc(sizeof(struct xdma_request) * xchan->xr_num,
56	    M_XDMA, M_WAITOK | M_ZERO);
57
58	for (i = 0; i < xchan->xr_num; i++) {
59		xr = &xchan->xr_mem[i];
60		TAILQ_INSERT_TAIL(&xchan->bank, xr, xr_next);
61	}
62}
63
64int
65xchan_bank_free(xdma_channel_t *xchan)
66{
67
68	free(xchan->xr_mem, M_XDMA);
69
70	return (0);
71}
72
73struct xdma_request *
74xchan_bank_get(xdma_channel_t *xchan)
75{
76	struct xdma_request *xr;
77	struct xdma_request *xr_tmp;
78
79	QUEUE_BANK_LOCK(xchan);
80	TAILQ_FOREACH_SAFE(xr, &xchan->bank, xr_next, xr_tmp) {
81		TAILQ_REMOVE(&xchan->bank, xr, xr_next);
82		break;
83	}
84	QUEUE_BANK_UNLOCK(xchan);
85
86	return (xr);
87}
88
89int
90xchan_bank_put(xdma_channel_t *xchan, struct xdma_request *xr)
91{
92
93	QUEUE_BANK_LOCK(xchan);
94	TAILQ_INSERT_TAIL(&xchan->bank, xr, xr_next);
95	QUEUE_BANK_UNLOCK(xchan);
96
97	return (0);
98}
99