]>
Commit | Line | Data |
---|---|---|
aa735edf | 1 | /* |
759d5768 | 2 | * Copyright (c) 2006 QLogic, Inc. All rights reserved. |
aa735edf BS |
3 | * Copyright (c) 2005, 2006 PathScale, Inc. All rights reserved. |
4 | * | |
5 | * This software is available to you under a choice of one of two | |
6 | * licenses. You may choose to be licensed under the terms of the GNU | |
7 | * General Public License (GPL) Version 2, available from the file | |
8 | * COPYING in the main directory of this source tree, or the | |
9 | * OpenIB.org BSD license below: | |
10 | * | |
11 | * Redistribution and use in source and binary forms, with or | |
12 | * without modification, are permitted provided that the following | |
13 | * conditions are met: | |
14 | * | |
15 | * - Redistributions of source code must retain the above | |
16 | * copyright notice, this list of conditions and the following | |
17 | * disclaimer. | |
18 | * | |
19 | * - Redistributions in binary form must reproduce the above | |
20 | * copyright notice, this list of conditions and the following | |
21 | * disclaimer in the documentation and/or other materials | |
22 | * provided with the distribution. | |
23 | * | |
24 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, | |
25 | * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF | |
26 | * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND | |
27 | * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS | |
28 | * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN | |
29 | * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN | |
30 | * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE | |
31 | * SOFTWARE. | |
32 | */ | |
33 | ||
34 | #ifndef IPATH_VERBS_H | |
35 | #define IPATH_VERBS_H | |
36 | ||
37 | #include <linux/types.h> | |
38 | #include <linux/spinlock.h> | |
39 | #include <linux/kernel.h> | |
40 | #include <linux/interrupt.h> | |
373d9915 | 41 | #include <linux/kref.h> |
aa735edf | 42 | #include <rdma/ib_pack.h> |
40b90430 | 43 | #include <rdma/ib_user_verbs.h> |
aa735edf BS |
44 | |
45 | #include "ipath_layer.h" | |
aa735edf | 46 | |
3859e39d RC |
47 | #define IPATH_MAX_RDMA_ATOMIC 4 |
48 | ||
aa735edf BS |
49 | #define QPN_MAX (1 << 24) |
50 | #define QPNMAP_ENTRIES (QPN_MAX / PAGE_SIZE / BITS_PER_BYTE) | |
51 | ||
52 | /* | |
53 | * Increment this value if any changes that break userspace ABI | |
54 | * compatibility are made. | |
55 | */ | |
373d9915 | 56 | #define IPATH_UVERBS_ABI_VERSION 2 |
aa735edf BS |
57 | |
58 | /* | |
59 | * Define an ib_cq_notify value that is not valid so we know when CQ | |
60 | * notifications are armed. | |
61 | */ | |
62 | #define IB_CQ_NONE (IB_CQ_NEXT_COMP + 1) | |
63 | ||
64 | #define IB_RNR_NAK 0x20 | |
65 | #define IB_NAK_PSN_ERROR 0x60 | |
66 | #define IB_NAK_INVALID_REQUEST 0x61 | |
67 | #define IB_NAK_REMOTE_ACCESS_ERROR 0x62 | |
68 | #define IB_NAK_REMOTE_OPERATIONAL_ERROR 0x63 | |
69 | #define IB_NAK_INVALID_RD_REQUEST 0x64 | |
70 | ||
71 | #define IPATH_POST_SEND_OK 0x01 | |
72 | #define IPATH_POST_RECV_OK 0x02 | |
73 | #define IPATH_PROCESS_RECV_OK 0x04 | |
74 | #define IPATH_PROCESS_SEND_OK 0x08 | |
75 | ||
76 | /* IB Performance Manager status values */ | |
77 | #define IB_PMA_SAMPLE_STATUS_DONE 0x00 | |
78 | #define IB_PMA_SAMPLE_STATUS_STARTED 0x01 | |
79 | #define IB_PMA_SAMPLE_STATUS_RUNNING 0x02 | |
80 | ||
81 | /* Mandatory IB performance counter select values. */ | |
82 | #define IB_PMA_PORT_XMIT_DATA __constant_htons(0x0001) | |
83 | #define IB_PMA_PORT_RCV_DATA __constant_htons(0x0002) | |
84 | #define IB_PMA_PORT_XMIT_PKTS __constant_htons(0x0003) | |
85 | #define IB_PMA_PORT_RCV_PKTS __constant_htons(0x0004) | |
86 | #define IB_PMA_PORT_XMIT_WAIT __constant_htons(0x0005) | |
87 | ||
88 | struct ib_reth { | |
89 | __be64 vaddr; | |
90 | __be32 rkey; | |
91 | __be32 length; | |
92 | } __attribute__ ((packed)); | |
93 | ||
94 | struct ib_atomic_eth { | |
3859e39d | 95 | __be32 vaddr[2]; /* unaligned so access as 2 32-bit words */ |
aa735edf BS |
96 | __be32 rkey; |
97 | __be64 swap_data; | |
98 | __be64 compare_data; | |
99 | } __attribute__ ((packed)); | |
100 | ||
101 | struct ipath_other_headers { | |
102 | __be32 bth[3]; | |
103 | union { | |
104 | struct { | |
105 | __be32 deth[2]; | |
106 | __be32 imm_data; | |
107 | } ud; | |
108 | struct { | |
109 | struct ib_reth reth; | |
110 | __be32 imm_data; | |
111 | } rc; | |
112 | struct { | |
113 | __be32 aeth; | |
3859e39d | 114 | __be32 atomic_ack_eth[2]; |
aa735edf BS |
115 | } at; |
116 | __be32 imm_data; | |
117 | __be32 aeth; | |
118 | struct ib_atomic_eth atomic_eth; | |
119 | } u; | |
120 | } __attribute__ ((packed)); | |
121 | ||
122 | /* | |
123 | * Note that UD packets with a GRH header are 8+40+12+8 = 68 bytes | |
124 | * long (72 w/ imm_data). Only the first 56 bytes of the IB header | |
125 | * will be in the eager header buffer. The remaining 12 or 16 bytes | |
126 | * are in the data buffer. | |
127 | */ | |
128 | struct ipath_ib_header { | |
129 | __be16 lrh[4]; | |
130 | union { | |
131 | struct { | |
132 | struct ib_grh grh; | |
133 | struct ipath_other_headers oth; | |
134 | } l; | |
135 | struct ipath_other_headers oth; | |
136 | } u; | |
137 | } __attribute__ ((packed)); | |
138 | ||
139 | /* | |
140 | * There is one struct ipath_mcast for each multicast GID. | |
141 | * All attached QPs are then stored as a list of | |
142 | * struct ipath_mcast_qp. | |
143 | */ | |
144 | struct ipath_mcast_qp { | |
145 | struct list_head list; | |
146 | struct ipath_qp *qp; | |
147 | }; | |
148 | ||
149 | struct ipath_mcast { | |
150 | struct rb_node rb_node; | |
151 | union ib_gid mgid; | |
152 | struct list_head qp_list; | |
153 | wait_queue_head_t wait; | |
154 | atomic_t refcount; | |
fe62546a | 155 | int n_attached; |
aa735edf BS |
156 | }; |
157 | ||
aa735edf BS |
158 | /* Protection domain */ |
159 | struct ipath_pd { | |
160 | struct ib_pd ibpd; | |
161 | int user; /* non-zero if created from user space */ | |
162 | }; | |
163 | ||
164 | /* Address Handle */ | |
165 | struct ipath_ah { | |
166 | struct ib_ah ibah; | |
167 | struct ib_ah_attr attr; | |
168 | }; | |
169 | ||
170 | /* | |
373d9915 RC |
171 | * This structure is used by ipath_mmap() to validate an offset |
172 | * when an mmap() request is made. The vm_area_struct then uses | |
173 | * this as its vm_private_data. | |
aa735edf | 174 | */ |
373d9915 | 175 | struct ipath_mmap_info { |
6b66b2da | 176 | struct list_head pending_mmaps; |
373d9915 RC |
177 | struct ib_ucontext *context; |
178 | void *obj; | |
6b66b2da | 179 | __u64 offset; |
373d9915 RC |
180 | struct kref ref; |
181 | unsigned size; | |
373d9915 | 182 | }; |
aa735edf | 183 | |
373d9915 RC |
184 | /* |
185 | * This structure is used to contain the head pointer, tail pointer, | |
186 | * and completion queue entries as a single memory allocation so | |
187 | * it can be mmap'ed into user space. | |
188 | */ | |
189 | struct ipath_cq_wc { | |
190 | u32 head; /* index of next entry to fill */ | |
191 | u32 tail; /* index of next ib_poll_cq() entry */ | |
40b90430 | 192 | struct ib_uverbs_wc queue[1]; /* this is actually size ibcq.cqe + 1 */ |
373d9915 RC |
193 | }; |
194 | ||
195 | /* | |
196 | * The completion queue structure. | |
197 | */ | |
aa735edf BS |
198 | struct ipath_cq { |
199 | struct ib_cq ibcq; | |
200 | struct tasklet_struct comptask; | |
201 | spinlock_t lock; | |
202 | u8 notify; | |
203 | u8 triggered; | |
373d9915 RC |
204 | struct ipath_cq_wc *queue; |
205 | struct ipath_mmap_info *ip; | |
aa735edf BS |
206 | }; |
207 | ||
34b2aafe BS |
208 | /* |
209 | * A segment is a linear region of low physical memory. | |
210 | * XXX Maybe we should use phys addr here and kmap()/kunmap(). | |
211 | * Used by the verbs layer. | |
212 | */ | |
213 | struct ipath_seg { | |
214 | void *vaddr; | |
215 | size_t length; | |
216 | }; | |
217 | ||
218 | /* The number of ipath_segs that fit in a page. */ | |
219 | #define IPATH_SEGSZ (PAGE_SIZE / sizeof (struct ipath_seg)) | |
220 | ||
221 | struct ipath_segarray { | |
222 | struct ipath_seg segs[IPATH_SEGSZ]; | |
223 | }; | |
224 | ||
225 | struct ipath_mregion { | |
6a553af2 | 226 | struct ib_pd *pd; /* shares refcnt of ibmr.pd */ |
34b2aafe BS |
227 | u64 user_base; /* User's address for this region */ |
228 | u64 iova; /* IB start address of this region */ | |
229 | size_t length; | |
230 | u32 lkey; | |
231 | u32 offset; /* offset (bytes) to start of region */ | |
232 | int access_flags; | |
233 | u32 max_segs; /* number of ipath_segs in all the arrays */ | |
234 | u32 mapsz; /* size of the map array */ | |
235 | struct ipath_segarray *map[0]; /* the segments */ | |
236 | }; | |
237 | ||
238 | /* | |
239 | * These keep track of the copy progress within a memory region. | |
240 | * Used by the verbs layer. | |
241 | */ | |
242 | struct ipath_sge { | |
243 | struct ipath_mregion *mr; | |
244 | void *vaddr; /* current pointer into the segment */ | |
245 | u32 sge_length; /* length of the SGE */ | |
246 | u32 length; /* remaining length of the segment */ | |
247 | u16 m; /* current index: mr->map[m] */ | |
248 | u16 n; /* current index: mr->map[m]->segs[n] */ | |
249 | }; | |
250 | ||
251 | /* Memory region */ | |
252 | struct ipath_mr { | |
253 | struct ib_mr ibmr; | |
254 | struct ipath_mregion mr; /* must be last */ | |
255 | }; | |
256 | ||
aa735edf BS |
257 | /* |
258 | * Send work request queue entry. | |
259 | * The size of the sg_list is determined when the QP is created and stored | |
260 | * in qp->s_max_sge. | |
261 | */ | |
262 | struct ipath_swqe { | |
263 | struct ib_send_wr wr; /* don't use wr.sg_list */ | |
264 | u32 psn; /* first packet sequence number */ | |
265 | u32 lpsn; /* last packet sequence number */ | |
266 | u32 ssn; /* send sequence number */ | |
267 | u32 length; /* total length of data in sg_list */ | |
268 | struct ipath_sge sg_list[0]; | |
269 | }; | |
270 | ||
271 | /* | |
272 | * Receive work request queue entry. | |
373d9915 RC |
273 | * The size of the sg_list is determined when the QP (or SRQ) is created |
274 | * and stored in qp->r_rq.max_sge (or srq->rq.max_sge). | |
aa735edf BS |
275 | */ |
276 | struct ipath_rwqe { | |
277 | u64 wr_id; | |
aa735edf | 278 | u8 num_sge; |
373d9915 | 279 | struct ib_sge sg_list[0]; |
aa735edf BS |
280 | }; |
281 | ||
373d9915 RC |
282 | /* |
283 | * This structure is used to contain the head pointer, tail pointer, | |
284 | * and receive work queue entries as a single memory allocation so | |
285 | * it can be mmap'ed into user space. | |
286 | * Note that the wq array elements are variable size so you can't | |
287 | * just index into the array to get the N'th element; | |
288 | * use get_rwqe_ptr() instead. | |
289 | */ | |
290 | struct ipath_rwq { | |
aa735edf BS |
291 | u32 head; /* new work requests posted to the head */ |
292 | u32 tail; /* receives pull requests from here. */ | |
373d9915 RC |
293 | struct ipath_rwqe wq[0]; |
294 | }; | |
295 | ||
296 | struct ipath_rq { | |
297 | struct ipath_rwq *wq; | |
298 | spinlock_t lock; | |
aa735edf BS |
299 | u32 size; /* size of RWQE array */ |
300 | u8 max_sge; | |
aa735edf BS |
301 | }; |
302 | ||
303 | struct ipath_srq { | |
304 | struct ib_srq ibsrq; | |
305 | struct ipath_rq rq; | |
373d9915 | 306 | struct ipath_mmap_info *ip; |
aa735edf BS |
307 | /* send signal when number of RWQEs < limit */ |
308 | u32 limit; | |
309 | }; | |
310 | ||
34b2aafe BS |
311 | struct ipath_sge_state { |
312 | struct ipath_sge *sg_list; /* next SGE to be used if any */ | |
313 | struct ipath_sge sge; /* progress state for the current SGE */ | |
314 | u8 num_sge; | |
315 | }; | |
316 | ||
3859e39d RC |
317 | /* |
318 | * This structure holds the information that the send tasklet needs | |
319 | * to send a RDMA read response or atomic operation. | |
320 | */ | |
321 | struct ipath_ack_entry { | |
322 | u8 opcode; | |
323 | u32 psn; | |
324 | union { | |
325 | struct ipath_sge_state rdma_sge; | |
326 | u64 atomic_data; | |
327 | }; | |
328 | }; | |
329 | ||
aa735edf BS |
330 | /* |
331 | * Variables prefixed with s_ are for the requester (sender). | |
332 | * Variables prefixed with r_ are for the responder (receiver). | |
333 | * Variables prefixed with ack_ are for responder replies. | |
334 | * | |
335 | * Common variables are protected by both r_rq.lock and s_lock in that order | |
336 | * which only happens in modify_qp() or changing the QP 'state'. | |
337 | */ | |
338 | struct ipath_qp { | |
339 | struct ib_qp ibqp; | |
9b2017f1 BS |
340 | struct ipath_qp *next; /* link list for QPN hash table */ |
341 | struct ipath_qp *timer_next; /* link list for ipath_ib_timer() */ | |
aa735edf BS |
342 | struct list_head piowait; /* link for wait PIO buf */ |
343 | struct list_head timerwait; /* link for waiting for timeouts */ | |
344 | struct ib_ah_attr remote_ah_attr; | |
345 | struct ipath_ib_header s_hdr; /* next packet header to send */ | |
346 | atomic_t refcount; | |
347 | wait_queue_head_t wait; | |
348 | struct tasklet_struct s_task; | |
373d9915 | 349 | struct ipath_mmap_info *ip; |
aa735edf BS |
350 | struct ipath_sge_state *s_cur_sge; |
351 | struct ipath_sge_state s_sge; /* current send request data */ | |
3859e39d RC |
352 | struct ipath_ack_entry s_ack_queue[IPATH_MAX_RDMA_ATOMIC + 1]; |
353 | struct ipath_sge_state s_ack_rdma_sge; | |
354 | struct ipath_sge_state s_rdma_read_sge; | |
aa735edf BS |
355 | struct ipath_sge_state r_sge; /* current receive data */ |
356 | spinlock_t s_lock; | |
3859e39d | 357 | unsigned long s_busy; |
aa735edf BS |
358 | u32 s_hdrwords; /* size of s_hdr in 32 bit words */ |
359 | u32 s_cur_size; /* size of send packet in bytes */ | |
360 | u32 s_len; /* total length of s_sge */ | |
3859e39d | 361 | u32 s_rdma_read_len; /* total length of s_rdma_read_sge */ |
aa735edf BS |
362 | u32 s_next_psn; /* PSN for next request */ |
363 | u32 s_last_psn; /* last response PSN processed */ | |
364 | u32 s_psn; /* current packet sequence number */ | |
3859e39d RC |
365 | u32 s_ack_rdma_psn; /* PSN for sending RDMA read responses */ |
366 | u32 s_ack_psn; /* PSN for acking sends and RDMA writes */ | |
aa735edf | 367 | u32 s_rnr_timeout; /* number of milliseconds for RNR timeout */ |
12eef41f | 368 | u32 r_ack_psn; /* PSN for next ACK or atomic ACK */ |
aa735edf | 369 | u64 r_wr_id; /* ID for current receive WQE */ |
aa735edf BS |
370 | u32 r_len; /* total length of r_sge */ |
371 | u32 r_rcv_len; /* receive data len processed */ | |
372 | u32 r_psn; /* expected rcv packet sequence number */ | |
12eef41f | 373 | u32 r_msn; /* message sequence number */ |
aa735edf BS |
374 | u8 state; /* QP state */ |
375 | u8 s_state; /* opcode of last packet sent */ | |
376 | u8 s_ack_state; /* opcode of packet to ACK */ | |
377 | u8 s_nak_state; /* non-zero if NAK is pending */ | |
378 | u8 r_state; /* opcode of last packet received */ | |
12eef41f BS |
379 | u8 r_nak_state; /* non-zero if NAK is pending */ |
380 | u8 r_min_rnr_timer; /* retry timeout value for RNR NAKs */ | |
aa735edf BS |
381 | u8 r_reuse_sge; /* for UC receive errors */ |
382 | u8 r_sge_inx; /* current index into sg_list */ | |
8d0208cb | 383 | u8 r_wrid_valid; /* r_wrid set but CQ entry not yet made */ |
3859e39d RC |
384 | u8 r_max_rd_atomic; /* max number of RDMA read/atomic to receive */ |
385 | u8 r_head_ack_queue; /* index into s_ack_queue[] */ | |
aa735edf | 386 | u8 qp_access_flags; |
12eef41f | 387 | u8 s_max_sge; /* size of s_wq->sg_list */ |
aa735edf BS |
388 | u8 s_retry_cnt; /* number of times to retry */ |
389 | u8 s_rnr_retry_cnt; | |
aa735edf BS |
390 | u8 s_retry; /* requester retry counter */ |
391 | u8 s_rnr_retry; /* requester RNR retry counter */ | |
6022943e | 392 | u8 s_wait_credit; /* limit number of unacked packets sent */ |
aa735edf | 393 | u8 s_pkey_index; /* PKEY index to use */ |
3859e39d RC |
394 | u8 s_max_rd_atomic; /* max number of RDMA read/atomic to send */ |
395 | u8 s_num_rd_atomic; /* number of RDMA read/atomic pending */ | |
396 | u8 s_tail_ack_queue; /* index into s_ack_queue[] */ | |
397 | u8 s_flags; | |
fc8cf8cd | 398 | u8 timeout; /* Timeout for this QP */ |
aa735edf | 399 | enum ib_mtu path_mtu; |
aa735edf BS |
400 | u32 remote_qpn; |
401 | u32 qkey; /* QKEY for this QP (for UD or RD) */ | |
402 | u32 s_size; /* send work queue size */ | |
403 | u32 s_head; /* new entries added here */ | |
404 | u32 s_tail; /* next entry to process */ | |
405 | u32 s_cur; /* current work queue entry */ | |
406 | u32 s_last; /* last un-ACK'ed entry */ | |
407 | u32 s_ssn; /* SSN of tail entry */ | |
408 | u32 s_lsn; /* limit sequence number (credit) */ | |
409 | struct ipath_swqe *s_wq; /* send work queue */ | |
373d9915 RC |
410 | struct ipath_rq r_rq; /* receive work queue */ |
411 | struct ipath_sge r_sg_list[0]; /* verified SGEs */ | |
aa735edf BS |
412 | }; |
413 | ||
3859e39d RC |
414 | /* Bit definition for s_busy. */ |
415 | #define IPATH_S_BUSY 0 | |
416 | ||
aa735edf BS |
417 | /* |
418 | * Bit definitions for s_flags. | |
419 | */ | |
3859e39d RC |
420 | #define IPATH_S_SIGNAL_REQ_WR 0x01 |
421 | #define IPATH_S_FENCE_PENDING 0x02 | |
422 | #define IPATH_S_RDMAR_PENDING 0x04 | |
423 | #define IPATH_S_ACK_PENDING 0x08 | |
aa735edf | 424 | |
c3af664a | 425 | #define IPATH_PSN_CREDIT 512 |
6022943e | 426 | |
aa735edf BS |
427 | /* |
428 | * Since struct ipath_swqe is not a fixed size, we can't simply index into | |
429 | * struct ipath_qp.s_wq. This function does the array index computation. | |
430 | */ | |
431 | static inline struct ipath_swqe *get_swqe_ptr(struct ipath_qp *qp, | |
432 | unsigned n) | |
433 | { | |
434 | return (struct ipath_swqe *)((char *)qp->s_wq + | |
435 | (sizeof(struct ipath_swqe) + | |
436 | qp->s_max_sge * | |
437 | sizeof(struct ipath_sge)) * n); | |
438 | } | |
439 | ||
440 | /* | |
441 | * Since struct ipath_rwqe is not a fixed size, we can't simply index into | |
373d9915 | 442 | * struct ipath_rwq.wq. This function does the array index computation. |
aa735edf BS |
443 | */ |
444 | static inline struct ipath_rwqe *get_rwqe_ptr(struct ipath_rq *rq, | |
445 | unsigned n) | |
446 | { | |
447 | return (struct ipath_rwqe *) | |
373d9915 | 448 | ((char *) rq->wq->wq + |
aa735edf | 449 | (sizeof(struct ipath_rwqe) + |
373d9915 | 450 | rq->max_sge * sizeof(struct ib_sge)) * n); |
aa735edf BS |
451 | } |
452 | ||
453 | /* | |
454 | * QPN-map pages start out as NULL, they get allocated upon | |
455 | * first use and are never deallocated. This way, | |
456 | * large bitmaps are not allocated unless large numbers of QPs are used. | |
457 | */ | |
458 | struct qpn_map { | |
459 | atomic_t n_free; | |
460 | void *page; | |
461 | }; | |
462 | ||
463 | struct ipath_qp_table { | |
464 | spinlock_t lock; | |
465 | u32 last; /* last QP number allocated */ | |
466 | u32 max; /* size of the hash table */ | |
467 | u32 nmaps; /* size of the map table */ | |
468 | struct ipath_qp **table; | |
469 | /* bit map of free numbers */ | |
470 | struct qpn_map map[QPNMAP_ENTRIES]; | |
471 | }; | |
472 | ||
473 | struct ipath_lkey_table { | |
474 | spinlock_t lock; | |
475 | u32 next; /* next unused index (speeds search) */ | |
476 | u32 gen; /* generation count */ | |
477 | u32 max; /* size of the table */ | |
478 | struct ipath_mregion **table; | |
479 | }; | |
480 | ||
481 | struct ipath_opcode_stats { | |
482 | u64 n_packets; /* number of packets */ | |
483 | u64 n_bytes; /* total number of bytes */ | |
484 | }; | |
485 | ||
486 | struct ipath_ibdev { | |
487 | struct ib_device ibdev; | |
aa735edf | 488 | struct ipath_devdata *dd; |
6b66b2da RW |
489 | struct list_head pending_mmaps; |
490 | spinlock_t mmap_offset_lock; | |
491 | u32 mmap_offset; | |
aa735edf BS |
492 | int ib_unit; /* This is the device number */ |
493 | u16 sm_lid; /* in host order */ | |
494 | u8 sm_sl; | |
495 | u8 mkeyprot_resv_lmc; | |
496 | /* non-zero when timer is set */ | |
497 | unsigned long mkey_lease_timeout; | |
498 | ||
499 | /* The following fields are really per port. */ | |
500 | struct ipath_qp_table qp_table; | |
501 | struct ipath_lkey_table lk_table; | |
502 | struct list_head pending[3]; /* FIFO of QPs waiting for ACKs */ | |
503 | struct list_head piowait; /* list for wait PIO buf */ | |
504 | /* list of QPs waiting for RNR timer */ | |
505 | struct list_head rnrwait; | |
506 | spinlock_t pending_lock; | |
507 | __be64 sys_image_guid; /* in network order */ | |
508 | __be64 gid_prefix; /* in network order */ | |
509 | __be64 mkey; | |
c27fef26 | 510 | |
fe62546a | 511 | u32 n_pds_allocated; /* number of PDs allocated for device */ |
c27fef26 | 512 | spinlock_t n_pds_lock; |
fe62546a | 513 | u32 n_ahs_allocated; /* number of AHs allocated for device */ |
c27fef26 | 514 | spinlock_t n_ahs_lock; |
fe62546a | 515 | u32 n_cqs_allocated; /* number of CQs allocated for device */ |
c27fef26 | 516 | spinlock_t n_cqs_lock; |
0b81e4f7 BS |
517 | u32 n_qps_allocated; /* number of QPs allocated for device */ |
518 | spinlock_t n_qps_lock; | |
fe62546a | 519 | u32 n_srqs_allocated; /* number of SRQs allocated for device */ |
c27fef26 | 520 | spinlock_t n_srqs_lock; |
fe62546a | 521 | u32 n_mcast_grps_allocated; /* number of mcast groups allocated */ |
c27fef26 BS |
522 | spinlock_t n_mcast_grps_lock; |
523 | ||
aa735edf BS |
524 | u64 ipath_sword; /* total dwords sent (sample result) */ |
525 | u64 ipath_rword; /* total dwords received (sample result) */ | |
526 | u64 ipath_spkts; /* total packets sent (sample result) */ | |
527 | u64 ipath_rpkts; /* total packets received (sample result) */ | |
528 | /* # of ticks no data sent (sample result) */ | |
529 | u64 ipath_xmit_wait; | |
530 | u64 rcv_errors; /* # of packets with SW detected rcv errs */ | |
531 | u64 n_unicast_xmit; /* total unicast packets sent */ | |
532 | u64 n_unicast_rcv; /* total unicast packets received */ | |
533 | u64 n_multicast_xmit; /* total multicast packets sent */ | |
534 | u64 n_multicast_rcv; /* total multicast packets received */ | |
443a64ab BS |
535 | u64 z_symbol_error_counter; /* starting count for PMA */ |
536 | u64 z_link_error_recovery_counter; /* starting count for PMA */ | |
537 | u64 z_link_downed_counter; /* starting count for PMA */ | |
538 | u64 z_port_rcv_errors; /* starting count for PMA */ | |
539 | u64 z_port_rcv_remphys_errors; /* starting count for PMA */ | |
540 | u64 z_port_xmit_discards; /* starting count for PMA */ | |
541 | u64 z_port_xmit_data; /* starting count for PMA */ | |
542 | u64 z_port_rcv_data; /* starting count for PMA */ | |
543 | u64 z_port_xmit_packets; /* starting count for PMA */ | |
544 | u64 z_port_rcv_packets; /* starting count for PMA */ | |
545 | u32 z_pkey_violations; /* starting count for PMA */ | |
fba75200 BS |
546 | u32 z_local_link_integrity_errors; /* starting count for PMA */ |
547 | u32 z_excessive_buffer_overrun_errors; /* starting count for PMA */ | |
aa735edf BS |
548 | u32 n_rc_resends; |
549 | u32 n_rc_acks; | |
550 | u32 n_rc_qacks; | |
551 | u32 n_seq_naks; | |
552 | u32 n_rdma_seq; | |
553 | u32 n_rnr_naks; | |
554 | u32 n_other_naks; | |
555 | u32 n_timeouts; | |
6022943e | 556 | u32 n_rc_stalls; |
aa735edf | 557 | u32 n_pkt_drops; |
fba75200 | 558 | u32 n_vl15_dropped; |
aa735edf BS |
559 | u32 n_wqe_errs; |
560 | u32 n_rdma_dup_busy; | |
561 | u32 n_piowait; | |
562 | u32 n_no_piobuf; | |
563 | u32 port_cap_flags; | |
564 | u32 pma_sample_start; | |
565 | u32 pma_sample_interval; | |
566 | __be16 pma_counter_select[5]; | |
567 | u16 pma_tag; | |
568 | u16 qkey_violations; | |
569 | u16 mkey_violations; | |
570 | u16 mkey_lease_period; | |
571 | u16 pending_index; /* which pending queue is active */ | |
572 | u8 pma_sample_status; | |
573 | u8 subnet_timeout; | |
574 | u8 link_width_enabled; | |
575 | u8 vl_high_limit; | |
576 | struct ipath_opcode_stats opstats[128]; | |
577 | }; | |
578 | ||
34b2aafe BS |
579 | struct ipath_verbs_counters { |
580 | u64 symbol_error_counter; | |
581 | u64 link_error_recovery_counter; | |
582 | u64 link_downed_counter; | |
583 | u64 port_rcv_errors; | |
584 | u64 port_rcv_remphys_errors; | |
585 | u64 port_xmit_discards; | |
586 | u64 port_xmit_data; | |
587 | u64 port_rcv_data; | |
588 | u64 port_xmit_packets; | |
589 | u64 port_rcv_packets; | |
590 | u32 local_link_integrity_errors; | |
591 | u32 excessive_buffer_overrun_errors; | |
aa735edf BS |
592 | }; |
593 | ||
594 | static inline struct ipath_mr *to_imr(struct ib_mr *ibmr) | |
595 | { | |
596 | return container_of(ibmr, struct ipath_mr, ibmr); | |
597 | } | |
598 | ||
aa735edf BS |
599 | static inline struct ipath_pd *to_ipd(struct ib_pd *ibpd) |
600 | { | |
601 | return container_of(ibpd, struct ipath_pd, ibpd); | |
602 | } | |
603 | ||
604 | static inline struct ipath_ah *to_iah(struct ib_ah *ibah) | |
605 | { | |
606 | return container_of(ibah, struct ipath_ah, ibah); | |
607 | } | |
608 | ||
609 | static inline struct ipath_cq *to_icq(struct ib_cq *ibcq) | |
610 | { | |
611 | return container_of(ibcq, struct ipath_cq, ibcq); | |
612 | } | |
613 | ||
614 | static inline struct ipath_srq *to_isrq(struct ib_srq *ibsrq) | |
615 | { | |
616 | return container_of(ibsrq, struct ipath_srq, ibsrq); | |
617 | } | |
618 | ||
619 | static inline struct ipath_qp *to_iqp(struct ib_qp *ibqp) | |
620 | { | |
621 | return container_of(ibqp, struct ipath_qp, ibqp); | |
622 | } | |
623 | ||
624 | static inline struct ipath_ibdev *to_idev(struct ib_device *ibdev) | |
625 | { | |
626 | return container_of(ibdev, struct ipath_ibdev, ibdev); | |
627 | } | |
628 | ||
629 | int ipath_process_mad(struct ib_device *ibdev, | |
630 | int mad_flags, | |
631 | u8 port_num, | |
632 | struct ib_wc *in_wc, | |
633 | struct ib_grh *in_grh, | |
634 | struct ib_mad *in_mad, struct ib_mad *out_mad); | |
635 | ||
aa735edf BS |
636 | /* |
637 | * Compare the lower 24 bits of the two values. | |
638 | * Returns an integer <, ==, or > than zero. | |
639 | */ | |
640 | static inline int ipath_cmp24(u32 a, u32 b) | |
641 | { | |
642 | return (((int) a) - ((int) b)) << 8; | |
643 | } | |
644 | ||
645 | struct ipath_mcast *ipath_mcast_find(union ib_gid *mgid); | |
646 | ||
34b2aafe BS |
647 | int ipath_snapshot_counters(struct ipath_devdata *dd, u64 *swords, |
648 | u64 *rwords, u64 *spkts, u64 *rpkts, | |
649 | u64 *xmit_wait); | |
650 | ||
651 | int ipath_get_counters(struct ipath_devdata *dd, | |
652 | struct ipath_verbs_counters *cntrs); | |
653 | ||
aa735edf BS |
654 | int ipath_multicast_attach(struct ib_qp *ibqp, union ib_gid *gid, u16 lid); |
655 | ||
656 | int ipath_multicast_detach(struct ib_qp *ibqp, union ib_gid *gid, u16 lid); | |
657 | ||
658 | int ipath_mcast_tree_empty(void); | |
659 | ||
660 | __be32 ipath_compute_aeth(struct ipath_qp *qp); | |
661 | ||
662 | struct ipath_qp *ipath_lookup_qpn(struct ipath_qp_table *qpt, u32 qpn); | |
663 | ||
664 | struct ib_qp *ipath_create_qp(struct ib_pd *ibpd, | |
665 | struct ib_qp_init_attr *init_attr, | |
666 | struct ib_udata *udata); | |
667 | ||
668 | int ipath_destroy_qp(struct ib_qp *ibqp); | |
669 | ||
8d0208cb BS |
670 | void ipath_error_qp(struct ipath_qp *qp, enum ib_wc_status err); |
671 | ||
aa735edf | 672 | int ipath_modify_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr, |
9bc57e2d | 673 | int attr_mask, struct ib_udata *udata); |
aa735edf BS |
674 | |
675 | int ipath_query_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr, | |
676 | int attr_mask, struct ib_qp_init_attr *init_attr); | |
677 | ||
678 | void ipath_free_all_qps(struct ipath_qp_table *qpt); | |
679 | ||
680 | int ipath_init_qp_table(struct ipath_ibdev *idev, int size); | |
681 | ||
682 | void ipath_sqerror_qp(struct ipath_qp *qp, struct ib_wc *wc); | |
683 | ||
aa735edf BS |
684 | void ipath_get_credit(struct ipath_qp *qp, u32 aeth); |
685 | ||
34b2aafe BS |
686 | int ipath_verbs_send(struct ipath_devdata *dd, u32 hdrwords, |
687 | u32 *hdr, u32 len, struct ipath_sge_state *ss); | |
688 | ||
aa735edf BS |
689 | void ipath_cq_enter(struct ipath_cq *cq, struct ib_wc *entry, int sig); |
690 | ||
aa735edf BS |
691 | void ipath_copy_sge(struct ipath_sge_state *ss, void *data, u32 length); |
692 | ||
693 | void ipath_skip_sge(struct ipath_sge_state *ss, u32 length); | |
694 | ||
ddd4bb22 | 695 | int ipath_post_ruc_send(struct ipath_qp *qp, struct ib_send_wr *wr); |
aa735edf BS |
696 | |
697 | void ipath_uc_rcv(struct ipath_ibdev *dev, struct ipath_ib_header *hdr, | |
698 | int has_grh, void *data, u32 tlen, struct ipath_qp *qp); | |
699 | ||
700 | void ipath_rc_rcv(struct ipath_ibdev *dev, struct ipath_ib_header *hdr, | |
701 | int has_grh, void *data, u32 tlen, struct ipath_qp *qp); | |
702 | ||
703 | void ipath_restart_rc(struct ipath_qp *qp, u32 psn, struct ib_wc *wc); | |
704 | ||
aa735edf BS |
705 | int ipath_post_ud_send(struct ipath_qp *qp, struct ib_send_wr *wr); |
706 | ||
707 | void ipath_ud_rcv(struct ipath_ibdev *dev, struct ipath_ib_header *hdr, | |
708 | int has_grh, void *data, u32 tlen, struct ipath_qp *qp); | |
709 | ||
710 | int ipath_alloc_lkey(struct ipath_lkey_table *rkt, | |
711 | struct ipath_mregion *mr); | |
712 | ||
713 | void ipath_free_lkey(struct ipath_lkey_table *rkt, u32 lkey); | |
714 | ||
6a553af2 | 715 | int ipath_lkey_ok(struct ipath_qp *qp, struct ipath_sge *isge, |
aa735edf BS |
716 | struct ib_sge *sge, int acc); |
717 | ||
6a553af2 | 718 | int ipath_rkey_ok(struct ipath_qp *qp, struct ipath_sge_state *ss, |
aa735edf BS |
719 | u32 len, u64 vaddr, u32 rkey, int acc); |
720 | ||
721 | int ipath_post_srq_receive(struct ib_srq *ibsrq, struct ib_recv_wr *wr, | |
722 | struct ib_recv_wr **bad_wr); | |
723 | ||
724 | struct ib_srq *ipath_create_srq(struct ib_pd *ibpd, | |
725 | struct ib_srq_init_attr *srq_init_attr, | |
726 | struct ib_udata *udata); | |
727 | ||
728 | int ipath_modify_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr, | |
9bc57e2d RC |
729 | enum ib_srq_attr_mask attr_mask, |
730 | struct ib_udata *udata); | |
aa735edf BS |
731 | |
732 | int ipath_query_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr); | |
733 | ||
734 | int ipath_destroy_srq(struct ib_srq *ibsrq); | |
735 | ||
aa735edf BS |
736 | int ipath_poll_cq(struct ib_cq *ibcq, int num_entries, struct ib_wc *entry); |
737 | ||
f4fd0b22 | 738 | struct ib_cq *ipath_create_cq(struct ib_device *ibdev, int entries, int comp_vector, |
aa735edf BS |
739 | struct ib_ucontext *context, |
740 | struct ib_udata *udata); | |
741 | ||
742 | int ipath_destroy_cq(struct ib_cq *ibcq); | |
743 | ||
744 | int ipath_req_notify_cq(struct ib_cq *ibcq, enum ib_cq_notify notify); | |
745 | ||
746 | int ipath_resize_cq(struct ib_cq *ibcq, int cqe, struct ib_udata *udata); | |
747 | ||
748 | struct ib_mr *ipath_get_dma_mr(struct ib_pd *pd, int acc); | |
749 | ||
750 | struct ib_mr *ipath_reg_phys_mr(struct ib_pd *pd, | |
751 | struct ib_phys_buf *buffer_list, | |
752 | int num_phys_buf, int acc, u64 *iova_start); | |
753 | ||
754 | struct ib_mr *ipath_reg_user_mr(struct ib_pd *pd, struct ib_umem *region, | |
755 | int mr_access_flags, | |
756 | struct ib_udata *udata); | |
757 | ||
758 | int ipath_dereg_mr(struct ib_mr *ibmr); | |
759 | ||
760 | struct ib_fmr *ipath_alloc_fmr(struct ib_pd *pd, int mr_access_flags, | |
761 | struct ib_fmr_attr *fmr_attr); | |
762 | ||
763 | int ipath_map_phys_fmr(struct ib_fmr *ibfmr, u64 * page_list, | |
764 | int list_len, u64 iova); | |
765 | ||
766 | int ipath_unmap_fmr(struct list_head *fmr_list); | |
767 | ||
768 | int ipath_dealloc_fmr(struct ib_fmr *ibfmr); | |
769 | ||
373d9915 RC |
770 | void ipath_release_mmap_info(struct kref *ref); |
771 | ||
6b66b2da RW |
772 | struct ipath_mmap_info *ipath_create_mmap_info(struct ipath_ibdev *dev, |
773 | u32 size, | |
774 | struct ib_ucontext *context, | |
775 | void *obj); | |
776 | ||
777 | void ipath_update_mmap_info(struct ipath_ibdev *dev, | |
778 | struct ipath_mmap_info *ip, | |
779 | u32 size, void *obj); | |
780 | ||
373d9915 RC |
781 | int ipath_mmap(struct ib_ucontext *context, struct vm_area_struct *vma); |
782 | ||
aa735edf BS |
783 | void ipath_no_bufs_available(struct ipath_qp *qp, struct ipath_ibdev *dev); |
784 | ||
785 | void ipath_insert_rnr_queue(struct ipath_qp *qp); | |
786 | ||
787 | int ipath_get_rwqe(struct ipath_qp *qp, int wr_id_only); | |
788 | ||
ddd4bb22 BS |
789 | u32 ipath_make_grh(struct ipath_ibdev *dev, struct ib_grh *hdr, |
790 | struct ib_global_route *grh, u32 hwords, u32 nwords); | |
791 | ||
792 | void ipath_do_ruc_send(unsigned long data); | |
793 | ||
ddd4bb22 BS |
794 | int ipath_make_rc_req(struct ipath_qp *qp, struct ipath_other_headers *ohdr, |
795 | u32 pmtu, u32 *bth0p, u32 *bth2p); | |
796 | ||
797 | int ipath_make_uc_req(struct ipath_qp *qp, struct ipath_other_headers *ohdr, | |
798 | u32 pmtu, u32 *bth0p, u32 *bth2p); | |
aa735edf | 799 | |
b1c1b6a3 BS |
800 | int ipath_register_ib_device(struct ipath_devdata *); |
801 | ||
802 | void ipath_unregister_ib_device(struct ipath_ibdev *); | |
803 | ||
804 | void ipath_ib_rcv(struct ipath_ibdev *, void *, void *, u32); | |
805 | ||
806 | int ipath_ib_piobufavail(struct ipath_ibdev *); | |
807 | ||
808 | void ipath_ib_timer(struct ipath_ibdev *); | |
809 | ||
34b2aafe BS |
810 | unsigned ipath_get_npkeys(struct ipath_devdata *); |
811 | ||
812 | u32 ipath_get_cr_errpkey(struct ipath_devdata *); | |
813 | ||
814 | unsigned ipath_get_pkey(struct ipath_devdata *, unsigned); | |
815 | ||
aa735edf BS |
816 | extern const enum ib_wc_opcode ib_ipath_wc_opcode[]; |
817 | ||
818 | extern const u8 ipath_cvt_physportstate[]; | |
819 | ||
820 | extern const int ib_ipath_state_ops[]; | |
821 | ||
822 | extern unsigned int ib_ipath_lkey_table_size; | |
823 | ||
fe62546a BS |
824 | extern unsigned int ib_ipath_max_cqes; |
825 | ||
826 | extern unsigned int ib_ipath_max_cqs; | |
827 | ||
828 | extern unsigned int ib_ipath_max_qp_wrs; | |
829 | ||
0b81e4f7 BS |
830 | extern unsigned int ib_ipath_max_qps; |
831 | ||
fe62546a BS |
832 | extern unsigned int ib_ipath_max_sges; |
833 | ||
834 | extern unsigned int ib_ipath_max_mcast_grps; | |
835 | ||
836 | extern unsigned int ib_ipath_max_mcast_qp_attached; | |
837 | ||
838 | extern unsigned int ib_ipath_max_srqs; | |
839 | ||
840 | extern unsigned int ib_ipath_max_srq_sges; | |
841 | ||
842 | extern unsigned int ib_ipath_max_srq_wrs; | |
843 | ||
aa735edf BS |
844 | extern const u32 ib_ipath_rnr_table[]; |
845 | ||
f2cbb660 RC |
846 | extern struct ib_dma_mapping_ops ipath_dma_mapping_ops; |
847 | ||
aa735edf | 848 | #endif /* IPATH_VERBS_H */ |