1 #ifndef _HFI1_USER_SDMA_H
2 #define _HFI1_USER_SDMA_H
4 * Copyright(c) 2015 - 2017 Intel Corporation.
6 * This file is provided under a dual BSD/GPLv2 license. When using or
7 * redistributing this file, you may do so under either license.
11 * This program is free software; you can redistribute it and/or modify
12 * it under the terms of version 2 of the GNU General Public License as
13 * published by the Free Software Foundation.
15 * This program is distributed in the hope that it will be useful, but
16 * WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * General Public License for more details.
22 * Redistribution and use in source and binary forms, with or without
23 * modification, are permitted provided that the following conditions
26 * - Redistributions of source code must retain the above copyright
27 * notice, this list of conditions and the following disclaimer.
28 * - Redistributions in binary form must reproduce the above copyright
29 * notice, this list of conditions and the following disclaimer in
30 * the documentation and/or other materials provided with the
32 * - Neither the name of Intel Corporation nor the names of its
33 * contributors may be used to endorse or promote products derived
34 * from this software without specific prior written permission.
36 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
37 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
38 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
39 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
40 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
41 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
42 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
43 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
44 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
45 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
46 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
49 #include <linux/device.h>
50 #include <linux/wait.h>
54 #include "user_exp_rcv.h"
56 /* The maximum number of Data io vectors per message/request */
57 #define MAX_VECTORS_PER_REQ 8
59 * Maximum number of packet to send from each message/request
60 * before moving to the next one.
62 #define MAX_PKTS_PER_QUEUE 16
64 #define num_pages(x) (1 + ((((x) - 1) & PAGE_MASK) >> PAGE_SHIFT))
66 #define req_opcode(x) \
67 (((x) >> HFI1_SDMA_REQ_OPCODE_SHIFT) & HFI1_SDMA_REQ_OPCODE_MASK)
68 #define req_version(x) \
69 (((x) >> HFI1_SDMA_REQ_VERSION_SHIFT) & HFI1_SDMA_REQ_OPCODE_MASK)
70 #define req_iovcnt(x) \
71 (((x) >> HFI1_SDMA_REQ_IOVCNT_SHIFT) & HFI1_SDMA_REQ_IOVCNT_MASK)
73 /* Number of BTH.PSN bits used for sequence number in expected rcvs */
74 #define BTH_SEQ_MASK 0x7ffull
76 #define AHG_KDETH_INTR_SHIFT 12
77 #define AHG_KDETH_SH_SHIFT 13
78 #define AHG_KDETH_ARRAY_SIZE 9
80 #define PBC2LRH(x) ((((x) & 0xfff) << 2) - 4)
81 #define LRH2PBC(x) ((((x) >> 2) + 1) & 0xfff)
84 * Build an SDMA AHG header update descriptor and save it to an array.
85 * @arr - Array to save the descriptor to.
86 * @idx - Index of the array at which the descriptor will be saved.
87 * @array_size - Size of the array arr.
88 * @dw - Update index into the header in DWs.
90 * @width - Field width.
91 * @value - 16 bits of immediate data to write into the field.
92 * Returns -ERANGE if idx is invalid. If successful, returns the next index
93 * (idx + 1) of the array to be used for the next descriptor.
95 static inline int ahg_header_set(u32
*arr
, int idx
, size_t array_size
,
96 u8 dw
, u8 bit
, u8 width
, u16 value
)
98 if ((size_t)idx
>= array_size
)
100 arr
[idx
++] = sdma_build_ahg_descriptor(value
, dw
, bit
, width
);
104 /* Tx request flag bits */
105 #define TXREQ_FLAGS_REQ_ACK BIT(0) /* Set the ACK bit in the header */
106 #define TXREQ_FLAGS_REQ_DISABLE_SH BIT(1) /* Disable header suppression */
108 #define SDMA_PKT_Q_INACTIVE BIT(0)
109 #define SDMA_PKT_Q_ACTIVE BIT(1)
110 #define SDMA_PKT_Q_DEFERRED BIT(2)
113 * Maximum retry attempts to submit a TX request
114 * before putting the process to sleep.
116 #define MAX_DEFER_RETRY_COUNT 1
118 #define SDMA_IOWAIT_TIMEOUT 1000 /* in milliseconds */
120 #define SDMA_DBG(req, fmt, ...) \
121 hfi1_cdbg(SDMA, "[%u:%u:%u:%u] " fmt, (req)->pq->dd->unit, \
122 (req)->pq->ctxt, (req)->pq->subctxt, (req)->info.comp_idx, \
125 extern uint extended_psn
;
127 struct hfi1_user_sdma_pkt_q
{
133 struct hfi1_devdata
*dd
;
134 struct kmem_cache
*txreq_cache
;
135 struct user_sdma_request
*reqs
;
136 unsigned long *req_in_use
;
139 wait_queue_head_t wait
;
140 unsigned long unpinned
;
141 struct mmu_rb_handler
*handler
;
143 struct mm_struct
*mm
;
146 struct hfi1_user_sdma_comp_q
{
148 struct hfi1_sdma_comp_entry
*comps
;
151 struct sdma_mmu_node
{
152 struct mmu_rb_node rb
;
153 struct hfi1_user_sdma_pkt_q
*pq
;
159 struct user_sdma_iovec
{
160 struct list_head list
;
162 /* number of pages in this vector */
164 /* array of pinned pages for this vector */
167 * offset into the virtual address space of the vector at
168 * which we last left off.
171 struct sdma_mmu_node
*node
;
174 /* evict operation argument */
176 u32 cleared
; /* count evicted so far */
177 u32 target
; /* target count to evict */
180 struct user_sdma_request
{
181 /* This is the original header from user space */
182 struct hfi1_pkt_header hdr
;
184 /* Read mostly fields */
185 struct hfi1_user_sdma_pkt_q
*pq ____cacheline_aligned_in_smp
;
186 struct hfi1_user_sdma_comp_q
*cq
;
188 * Pointer to the SDMA engine for this request.
189 * Since different request could be on different VLs,
190 * each request will need it's own engine pointer.
192 struct sdma_engine
*sde
;
193 struct sdma_req_info info
;
194 /* TID array values copied from the tid_iov vector */
196 /* total length of the data in the request */
198 /* number of elements copied to the tids array */
201 * We copy the iovs for this request (based on
202 * info.iovcnt). These are only the data vectors
207 /* Writeable fields shared with interrupt */
208 u64 seqcomp ____cacheline_aligned_in_smp
;
210 /* status of the last txreq completed */
213 /* Send side fields */
214 struct list_head txps ____cacheline_aligned_in_smp
;
217 * KDETH.OFFSET (TID) field
218 * The offset can cover multiple packets, depending on the
219 * size of the TID entry.
223 * KDETH.Offset (Eager) field
224 * We need to remember the initial value so the headers
225 * can be updated properly.
229 /* TID index copied from the tid_iov vector */
231 /* progress index moving along the iovs array */
236 struct user_sdma_iovec iovs
[MAX_VECTORS_PER_REQ
];
237 } ____cacheline_aligned_in_smp
;
240 * A single txreq could span up to 3 physical pages when the MTU
241 * is sufficiently large (> 4K). Each of the IOV pointers also
242 * needs it's own set of flags so the vector has been handled
243 * independently of each other.
245 struct user_sdma_txreq
{
246 /* Packet header for the txreq */
247 struct hfi1_pkt_header hdr
;
248 struct sdma_txreq txreq
;
249 struct list_head list
;
250 struct user_sdma_request
*req
;
252 unsigned int busycount
;
256 int hfi1_user_sdma_alloc_queues(struct hfi1_ctxtdata
*uctxt
,
257 struct hfi1_filedata
*fd
);
258 int hfi1_user_sdma_free_queues(struct hfi1_filedata
*fd
,
259 struct hfi1_ctxtdata
*uctxt
);
260 int hfi1_user_sdma_process_request(struct hfi1_filedata
*fd
,
261 struct iovec
*iovec
, unsigned long dim
,
262 unsigned long *count
);
264 #endif /* _HFI1_USER_SDMA_H */