1 /*-
2 * Copyright (c) 2018-2019 Ruslan Bukin <[email protected]>
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/lock.h>
40 #include <sys/malloc.h>
41 #include <sys/mutex.h>
42
43 #include <machine/bus.h>
44
45 #include <dev/xdma/xdma.h>
46
47 int
xdma_dequeue(xdma_channel_t * xchan,void ** user,xdma_transfer_status_t * status)48 xdma_dequeue(xdma_channel_t *xchan, void **user,
49 xdma_transfer_status_t *status)
50 {
51 struct xdma_request *xr_tmp;
52 struct xdma_request *xr;
53
54 QUEUE_OUT_LOCK(xchan);
55 TAILQ_FOREACH_SAFE(xr, &xchan->queue_out, xr_next, xr_tmp) {
56 TAILQ_REMOVE(&xchan->queue_out, xr, xr_next);
57 break;
58 }
59 QUEUE_OUT_UNLOCK(xchan);
60
61 if (xr == NULL)
62 return (-1);
63
64 *user = xr->user;
65 status->error = xr->status.error;
66 status->transferred = xr->status.transferred;
67
68 xchan_bank_put(xchan, xr);
69
70 return (0);
71 }
72
73 int
xdma_enqueue(xdma_channel_t * xchan,uintptr_t src,uintptr_t dst,uint8_t src_width,uint8_t dst_width,bus_size_t len,enum xdma_direction dir,void * user)74 xdma_enqueue(xdma_channel_t *xchan, uintptr_t src, uintptr_t dst,
75 uint8_t src_width, uint8_t dst_width, bus_size_t len,
76 enum xdma_direction dir, void *user)
77 {
78 struct xdma_request *xr;
79 xdma_controller_t *xdma;
80
81 xdma = xchan->xdma;
82 KASSERT(xdma != NULL, ("xdma is NULL"));
83
84 xr = xchan_bank_get(xchan);
85 if (xr == NULL)
86 return (-1); /* No space is available. */
87
88 xr->user = user;
89 xr->direction = dir;
90 xr->m = NULL;
91 xr->bp = NULL;
92 xr->block_num = 1;
93 xr->block_len = len;
94 xr->req_type = XR_TYPE_VIRT;
95 xr->src_addr = src;
96 xr->dst_addr = dst;
97 xr->src_width = src_width;
98 xr->dst_width = dst_width;
99
100 QUEUE_IN_LOCK(xchan);
101 TAILQ_INSERT_TAIL(&xchan->queue_in, xr, xr_next);
102 QUEUE_IN_UNLOCK(xchan);
103
104 return (0);
105 }
106
107 int
xdma_queue_submit(xdma_channel_t * xchan)108 xdma_queue_submit(xdma_channel_t *xchan)
109 {
110 xdma_controller_t *xdma;
111 int ret;
112
113 xdma = xchan->xdma;
114 KASSERT(xdma != NULL, ("xdma is NULL"));
115
116 ret = 0;
117
118 XCHAN_LOCK(xchan);
119
120 if (xchan->flags & XCHAN_TYPE_SG)
121 ret = xdma_queue_submit_sg(xchan);
122
123 XCHAN_UNLOCK(xchan);
124
125 return (ret);
126 }
127