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 BS |
42 | #include <rdma/ib_pack.h> |
43 | ||
44 | #include "ipath_layer.h" | |
45 | #include "verbs_debug.h" | |
46 | ||
47 | #define QPN_MAX (1 << 24) | |
48 | #define QPNMAP_ENTRIES (QPN_MAX / PAGE_SIZE / BITS_PER_BYTE) | |
49 | ||
50 | /* | |
51 | * Increment this value if any changes that break userspace ABI | |
52 | * compatibility are made. | |
53 | */ | |
373d9915 | 54 | #define IPATH_UVERBS_ABI_VERSION 2 |
aa735edf BS |
55 | |
56 | /* | |
57 | * Define an ib_cq_notify value that is not valid so we know when CQ | |
58 | * notifications are armed. | |
59 | */ | |
60 | #define IB_CQ_NONE (IB_CQ_NEXT_COMP + 1) | |
61 | ||
62 | #define IB_RNR_NAK 0x20 | |
63 | #define IB_NAK_PSN_ERROR 0x60 | |
64 | #define IB_NAK_INVALID_REQUEST 0x61 | |
65 | #define IB_NAK_REMOTE_ACCESS_ERROR 0x62 | |
66 | #define IB_NAK_REMOTE_OPERATIONAL_ERROR 0x63 | |
67 | #define IB_NAK_INVALID_RD_REQUEST 0x64 | |
68 | ||
69 | #define IPATH_POST_SEND_OK 0x01 | |
70 | #define IPATH_POST_RECV_OK 0x02 | |
71 | #define IPATH_PROCESS_RECV_OK 0x04 | |
72 | #define IPATH_PROCESS_SEND_OK 0x08 | |
73 | ||
74 | /* IB Performance Manager status values */ | |
75 | #define IB_PMA_SAMPLE_STATUS_DONE 0x00 | |
76 | #define IB_PMA_SAMPLE_STATUS_STARTED 0x01 | |
77 | #define IB_PMA_SAMPLE_STATUS_RUNNING 0x02 | |
78 | ||
79 | /* Mandatory IB performance counter select values. */ | |
80 | #define IB_PMA_PORT_XMIT_DATA __constant_htons(0x0001) | |
81 | #define IB_PMA_PORT_RCV_DATA __constant_htons(0x0002) | |
82 | #define IB_PMA_PORT_XMIT_PKTS __constant_htons(0x0003) | |
83 | #define IB_PMA_PORT_RCV_PKTS __constant_htons(0x0004) | |
84 | #define IB_PMA_PORT_XMIT_WAIT __constant_htons(0x0005) | |
85 | ||
86 | struct ib_reth { | |
87 | __be64 vaddr; | |
88 | __be32 rkey; | |
89 | __be32 length; | |
90 | } __attribute__ ((packed)); | |
91 | ||
92 | struct ib_atomic_eth { | |
93 | __be64 vaddr; | |
94 | __be32 rkey; | |
95 | __be64 swap_data; | |
96 | __be64 compare_data; | |
97 | } __attribute__ ((packed)); | |
98 | ||
99 | struct ipath_other_headers { | |
100 | __be32 bth[3]; | |
101 | union { | |
102 | struct { | |
103 | __be32 deth[2]; | |
104 | __be32 imm_data; | |
105 | } ud; | |
106 | struct { | |
107 | struct ib_reth reth; | |
108 | __be32 imm_data; | |
109 | } rc; | |
110 | struct { | |
111 | __be32 aeth; | |
112 | __be64 atomic_ack_eth; | |
113 | } at; | |
114 | __be32 imm_data; | |
115 | __be32 aeth; | |
116 | struct ib_atomic_eth atomic_eth; | |
117 | } u; | |
118 | } __attribute__ ((packed)); | |
119 | ||
120 | /* | |
121 | * Note that UD packets with a GRH header are 8+40+12+8 = 68 bytes | |
122 | * long (72 w/ imm_data). Only the first 56 bytes of the IB header | |
123 | * will be in the eager header buffer. The remaining 12 or 16 bytes | |
124 | * are in the data buffer. | |
125 | */ | |
126 | struct ipath_ib_header { | |
127 | __be16 lrh[4]; | |
128 | union { | |
129 | struct { | |
130 | struct ib_grh grh; | |
131 | struct ipath_other_headers oth; | |
132 | } l; | |
133 | struct ipath_other_headers oth; | |
134 | } u; | |
135 | } __attribute__ ((packed)); | |
136 | ||
137 | /* | |
138 | * There is one struct ipath_mcast for each multicast GID. | |
139 | * All attached QPs are then stored as a list of | |
140 | * struct ipath_mcast_qp. | |
141 | */ | |
142 | struct ipath_mcast_qp { | |
143 | struct list_head list; | |
144 | struct ipath_qp *qp; | |
145 | }; | |
146 | ||
147 | struct ipath_mcast { | |
148 | struct rb_node rb_node; | |
149 | union ib_gid mgid; | |
150 | struct list_head qp_list; | |
151 | wait_queue_head_t wait; | |
152 | atomic_t refcount; | |
fe62546a | 153 | int n_attached; |
aa735edf BS |
154 | }; |
155 | ||
156 | /* Memory region */ | |
157 | struct ipath_mr { | |
158 | struct ib_mr ibmr; | |
159 | struct ipath_mregion mr; /* must be last */ | |
160 | }; | |
161 | ||
162 | /* Fast memory region */ | |
163 | struct ipath_fmr { | |
164 | struct ib_fmr ibfmr; | |
165 | u8 page_shift; | |
166 | struct ipath_mregion mr; /* must be last */ | |
167 | }; | |
168 | ||
169 | /* Protection domain */ | |
170 | struct ipath_pd { | |
171 | struct ib_pd ibpd; | |
172 | int user; /* non-zero if created from user space */ | |
173 | }; | |
174 | ||
175 | /* Address Handle */ | |
176 | struct ipath_ah { | |
177 | struct ib_ah ibah; | |
178 | struct ib_ah_attr attr; | |
179 | }; | |
180 | ||
181 | /* | |
373d9915 RC |
182 | * This structure is used by ipath_mmap() to validate an offset |
183 | * when an mmap() request is made. The vm_area_struct then uses | |
184 | * this as its vm_private_data. | |
aa735edf | 185 | */ |
373d9915 RC |
186 | struct ipath_mmap_info { |
187 | struct ipath_mmap_info *next; | |
188 | struct ib_ucontext *context; | |
189 | void *obj; | |
190 | struct kref ref; | |
191 | unsigned size; | |
192 | unsigned mmap_cnt; | |
193 | }; | |
aa735edf | 194 | |
373d9915 RC |
195 | /* |
196 | * This structure is used to contain the head pointer, tail pointer, | |
197 | * and completion queue entries as a single memory allocation so | |
198 | * it can be mmap'ed into user space. | |
199 | */ | |
200 | struct ipath_cq_wc { | |
201 | u32 head; /* index of next entry to fill */ | |
202 | u32 tail; /* index of next ib_poll_cq() entry */ | |
203 | struct ib_wc queue[1]; /* this is actually size ibcq.cqe + 1 */ | |
204 | }; | |
205 | ||
206 | /* | |
207 | * The completion queue structure. | |
208 | */ | |
aa735edf BS |
209 | struct ipath_cq { |
210 | struct ib_cq ibcq; | |
211 | struct tasklet_struct comptask; | |
212 | spinlock_t lock; | |
213 | u8 notify; | |
214 | u8 triggered; | |
373d9915 RC |
215 | struct ipath_cq_wc *queue; |
216 | struct ipath_mmap_info *ip; | |
aa735edf BS |
217 | }; |
218 | ||
219 | /* | |
220 | * Send work request queue entry. | |
221 | * The size of the sg_list is determined when the QP is created and stored | |
222 | * in qp->s_max_sge. | |
223 | */ | |
224 | struct ipath_swqe { | |
225 | struct ib_send_wr wr; /* don't use wr.sg_list */ | |
226 | u32 psn; /* first packet sequence number */ | |
227 | u32 lpsn; /* last packet sequence number */ | |
228 | u32 ssn; /* send sequence number */ | |
229 | u32 length; /* total length of data in sg_list */ | |
230 | struct ipath_sge sg_list[0]; | |
231 | }; | |
232 | ||
233 | /* | |
234 | * Receive work request queue entry. | |
373d9915 RC |
235 | * The size of the sg_list is determined when the QP (or SRQ) is created |
236 | * and stored in qp->r_rq.max_sge (or srq->rq.max_sge). | |
aa735edf BS |
237 | */ |
238 | struct ipath_rwqe { | |
239 | u64 wr_id; | |
aa735edf | 240 | u8 num_sge; |
373d9915 | 241 | struct ib_sge sg_list[0]; |
aa735edf BS |
242 | }; |
243 | ||
373d9915 RC |
244 | /* |
245 | * This structure is used to contain the head pointer, tail pointer, | |
246 | * and receive work queue entries as a single memory allocation so | |
247 | * it can be mmap'ed into user space. | |
248 | * Note that the wq array elements are variable size so you can't | |
249 | * just index into the array to get the N'th element; | |
250 | * use get_rwqe_ptr() instead. | |
251 | */ | |
252 | struct ipath_rwq { | |
aa735edf BS |
253 | u32 head; /* new work requests posted to the head */ |
254 | u32 tail; /* receives pull requests from here. */ | |
373d9915 RC |
255 | struct ipath_rwqe wq[0]; |
256 | }; | |
257 | ||
258 | struct ipath_rq { | |
259 | struct ipath_rwq *wq; | |
260 | spinlock_t lock; | |
aa735edf BS |
261 | u32 size; /* size of RWQE array */ |
262 | u8 max_sge; | |
aa735edf BS |
263 | }; |
264 | ||
265 | struct ipath_srq { | |
266 | struct ib_srq ibsrq; | |
267 | struct ipath_rq rq; | |
373d9915 | 268 | struct ipath_mmap_info *ip; |
aa735edf BS |
269 | /* send signal when number of RWQEs < limit */ |
270 | u32 limit; | |
271 | }; | |
272 | ||
273 | /* | |
274 | * Variables prefixed with s_ are for the requester (sender). | |
275 | * Variables prefixed with r_ are for the responder (receiver). | |
276 | * Variables prefixed with ack_ are for responder replies. | |
277 | * | |
278 | * Common variables are protected by both r_rq.lock and s_lock in that order | |
279 | * which only happens in modify_qp() or changing the QP 'state'. | |
280 | */ | |
281 | struct ipath_qp { | |
282 | struct ib_qp ibqp; | |
9b2017f1 BS |
283 | struct ipath_qp *next; /* link list for QPN hash table */ |
284 | struct ipath_qp *timer_next; /* link list for ipath_ib_timer() */ | |
aa735edf BS |
285 | struct list_head piowait; /* link for wait PIO buf */ |
286 | struct list_head timerwait; /* link for waiting for timeouts */ | |
287 | struct ib_ah_attr remote_ah_attr; | |
288 | struct ipath_ib_header s_hdr; /* next packet header to send */ | |
289 | atomic_t refcount; | |
290 | wait_queue_head_t wait; | |
291 | struct tasklet_struct s_task; | |
373d9915 | 292 | struct ipath_mmap_info *ip; |
aa735edf BS |
293 | struct ipath_sge_state *s_cur_sge; |
294 | struct ipath_sge_state s_sge; /* current send request data */ | |
295 | /* current RDMA read send data */ | |
296 | struct ipath_sge_state s_rdma_sge; | |
297 | struct ipath_sge_state r_sge; /* current receive data */ | |
298 | spinlock_t s_lock; | |
299 | unsigned long s_flags; | |
300 | u32 s_hdrwords; /* size of s_hdr in 32 bit words */ | |
301 | u32 s_cur_size; /* size of send packet in bytes */ | |
302 | u32 s_len; /* total length of s_sge */ | |
303 | u32 s_rdma_len; /* total length of s_rdma_sge */ | |
304 | u32 s_next_psn; /* PSN for next request */ | |
305 | u32 s_last_psn; /* last response PSN processed */ | |
306 | u32 s_psn; /* current packet sequence number */ | |
12eef41f | 307 | u32 s_ack_psn; /* PSN for RDMA_READ */ |
aa735edf | 308 | u32 s_rnr_timeout; /* number of milliseconds for RNR timeout */ |
12eef41f | 309 | u32 r_ack_psn; /* PSN for next ACK or atomic ACK */ |
aa735edf BS |
310 | u64 r_wr_id; /* ID for current receive WQE */ |
311 | u64 r_atomic_data; /* data for last atomic op */ | |
312 | u32 r_atomic_psn; /* PSN of last atomic op */ | |
313 | u32 r_len; /* total length of r_sge */ | |
314 | u32 r_rcv_len; /* receive data len processed */ | |
315 | u32 r_psn; /* expected rcv packet sequence number */ | |
12eef41f | 316 | u32 r_msn; /* message sequence number */ |
aa735edf BS |
317 | u8 state; /* QP state */ |
318 | u8 s_state; /* opcode of last packet sent */ | |
319 | u8 s_ack_state; /* opcode of packet to ACK */ | |
320 | u8 s_nak_state; /* non-zero if NAK is pending */ | |
321 | u8 r_state; /* opcode of last packet received */ | |
12eef41f BS |
322 | u8 r_ack_state; /* opcode of packet to ACK */ |
323 | u8 r_nak_state; /* non-zero if NAK is pending */ | |
324 | u8 r_min_rnr_timer; /* retry timeout value for RNR NAKs */ | |
aa735edf BS |
325 | u8 r_reuse_sge; /* for UC receive errors */ |
326 | u8 r_sge_inx; /* current index into sg_list */ | |
aa735edf | 327 | u8 qp_access_flags; |
12eef41f | 328 | u8 s_max_sge; /* size of s_wq->sg_list */ |
aa735edf BS |
329 | u8 s_retry_cnt; /* number of times to retry */ |
330 | u8 s_rnr_retry_cnt; | |
aa735edf BS |
331 | u8 s_retry; /* requester retry counter */ |
332 | u8 s_rnr_retry; /* requester RNR retry counter */ | |
333 | u8 s_pkey_index; /* PKEY index to use */ | |
334 | enum ib_mtu path_mtu; | |
aa735edf BS |
335 | u32 remote_qpn; |
336 | u32 qkey; /* QKEY for this QP (for UD or RD) */ | |
337 | u32 s_size; /* send work queue size */ | |
338 | u32 s_head; /* new entries added here */ | |
339 | u32 s_tail; /* next entry to process */ | |
340 | u32 s_cur; /* current work queue entry */ | |
341 | u32 s_last; /* last un-ACK'ed entry */ | |
342 | u32 s_ssn; /* SSN of tail entry */ | |
343 | u32 s_lsn; /* limit sequence number (credit) */ | |
344 | struct ipath_swqe *s_wq; /* send work queue */ | |
373d9915 RC |
345 | struct ipath_rq r_rq; /* receive work queue */ |
346 | struct ipath_sge r_sg_list[0]; /* verified SGEs */ | |
aa735edf BS |
347 | }; |
348 | ||
349 | /* | |
350 | * Bit definitions for s_flags. | |
351 | */ | |
352 | #define IPATH_S_BUSY 0 | |
353 | #define IPATH_S_SIGNAL_REQ_WR 1 | |
354 | ||
355 | /* | |
356 | * Since struct ipath_swqe is not a fixed size, we can't simply index into | |
357 | * struct ipath_qp.s_wq. This function does the array index computation. | |
358 | */ | |
359 | static inline struct ipath_swqe *get_swqe_ptr(struct ipath_qp *qp, | |
360 | unsigned n) | |
361 | { | |
362 | return (struct ipath_swqe *)((char *)qp->s_wq + | |
363 | (sizeof(struct ipath_swqe) + | |
364 | qp->s_max_sge * | |
365 | sizeof(struct ipath_sge)) * n); | |
366 | } | |
367 | ||
368 | /* | |
369 | * Since struct ipath_rwqe is not a fixed size, we can't simply index into | |
373d9915 | 370 | * struct ipath_rwq.wq. This function does the array index computation. |
aa735edf BS |
371 | */ |
372 | static inline struct ipath_rwqe *get_rwqe_ptr(struct ipath_rq *rq, | |
373 | unsigned n) | |
374 | { | |
375 | return (struct ipath_rwqe *) | |
373d9915 | 376 | ((char *) rq->wq->wq + |
aa735edf | 377 | (sizeof(struct ipath_rwqe) + |
373d9915 | 378 | rq->max_sge * sizeof(struct ib_sge)) * n); |
aa735edf BS |
379 | } |
380 | ||
381 | /* | |
382 | * QPN-map pages start out as NULL, they get allocated upon | |
383 | * first use and are never deallocated. This way, | |
384 | * large bitmaps are not allocated unless large numbers of QPs are used. | |
385 | */ | |
386 | struct qpn_map { | |
387 | atomic_t n_free; | |
388 | void *page; | |
389 | }; | |
390 | ||
391 | struct ipath_qp_table { | |
392 | spinlock_t lock; | |
393 | u32 last; /* last QP number allocated */ | |
394 | u32 max; /* size of the hash table */ | |
395 | u32 nmaps; /* size of the map table */ | |
396 | struct ipath_qp **table; | |
397 | /* bit map of free numbers */ | |
398 | struct qpn_map map[QPNMAP_ENTRIES]; | |
399 | }; | |
400 | ||
401 | struct ipath_lkey_table { | |
402 | spinlock_t lock; | |
403 | u32 next; /* next unused index (speeds search) */ | |
404 | u32 gen; /* generation count */ | |
405 | u32 max; /* size of the table */ | |
406 | struct ipath_mregion **table; | |
407 | }; | |
408 | ||
409 | struct ipath_opcode_stats { | |
410 | u64 n_packets; /* number of packets */ | |
411 | u64 n_bytes; /* total number of bytes */ | |
412 | }; | |
413 | ||
414 | struct ipath_ibdev { | |
415 | struct ib_device ibdev; | |
416 | struct list_head dev_list; | |
417 | struct ipath_devdata *dd; | |
373d9915 | 418 | struct ipath_mmap_info *pending_mmaps; |
aa735edf BS |
419 | int ib_unit; /* This is the device number */ |
420 | u16 sm_lid; /* in host order */ | |
421 | u8 sm_sl; | |
422 | u8 mkeyprot_resv_lmc; | |
423 | /* non-zero when timer is set */ | |
424 | unsigned long mkey_lease_timeout; | |
425 | ||
426 | /* The following fields are really per port. */ | |
427 | struct ipath_qp_table qp_table; | |
428 | struct ipath_lkey_table lk_table; | |
429 | struct list_head pending[3]; /* FIFO of QPs waiting for ACKs */ | |
430 | struct list_head piowait; /* list for wait PIO buf */ | |
431 | /* list of QPs waiting for RNR timer */ | |
432 | struct list_head rnrwait; | |
433 | spinlock_t pending_lock; | |
434 | __be64 sys_image_guid; /* in network order */ | |
435 | __be64 gid_prefix; /* in network order */ | |
436 | __be64 mkey; | |
fe62546a BS |
437 | u32 n_pds_allocated; /* number of PDs allocated for device */ |
438 | u32 n_ahs_allocated; /* number of AHs allocated for device */ | |
439 | u32 n_cqs_allocated; /* number of CQs allocated for device */ | |
440 | u32 n_srqs_allocated; /* number of SRQs allocated for device */ | |
441 | u32 n_mcast_grps_allocated; /* number of mcast groups allocated */ | |
aa735edf BS |
442 | u64 ipath_sword; /* total dwords sent (sample result) */ |
443 | u64 ipath_rword; /* total dwords received (sample result) */ | |
444 | u64 ipath_spkts; /* total packets sent (sample result) */ | |
445 | u64 ipath_rpkts; /* total packets received (sample result) */ | |
446 | /* # of ticks no data sent (sample result) */ | |
447 | u64 ipath_xmit_wait; | |
448 | u64 rcv_errors; /* # of packets with SW detected rcv errs */ | |
449 | u64 n_unicast_xmit; /* total unicast packets sent */ | |
450 | u64 n_unicast_rcv; /* total unicast packets received */ | |
451 | u64 n_multicast_xmit; /* total multicast packets sent */ | |
452 | u64 n_multicast_rcv; /* total multicast packets received */ | |
443a64ab BS |
453 | u64 z_symbol_error_counter; /* starting count for PMA */ |
454 | u64 z_link_error_recovery_counter; /* starting count for PMA */ | |
455 | u64 z_link_downed_counter; /* starting count for PMA */ | |
456 | u64 z_port_rcv_errors; /* starting count for PMA */ | |
457 | u64 z_port_rcv_remphys_errors; /* starting count for PMA */ | |
458 | u64 z_port_xmit_discards; /* starting count for PMA */ | |
459 | u64 z_port_xmit_data; /* starting count for PMA */ | |
460 | u64 z_port_rcv_data; /* starting count for PMA */ | |
461 | u64 z_port_xmit_packets; /* starting count for PMA */ | |
462 | u64 z_port_rcv_packets; /* starting count for PMA */ | |
463 | u32 z_pkey_violations; /* starting count for PMA */ | |
fba75200 BS |
464 | u32 z_local_link_integrity_errors; /* starting count for PMA */ |
465 | u32 z_excessive_buffer_overrun_errors; /* starting count for PMA */ | |
aa735edf BS |
466 | u32 n_rc_resends; |
467 | u32 n_rc_acks; | |
468 | u32 n_rc_qacks; | |
469 | u32 n_seq_naks; | |
470 | u32 n_rdma_seq; | |
471 | u32 n_rnr_naks; | |
472 | u32 n_other_naks; | |
473 | u32 n_timeouts; | |
474 | u32 n_pkt_drops; | |
fba75200 | 475 | u32 n_vl15_dropped; |
aa735edf BS |
476 | u32 n_wqe_errs; |
477 | u32 n_rdma_dup_busy; | |
478 | u32 n_piowait; | |
479 | u32 n_no_piobuf; | |
480 | u32 port_cap_flags; | |
481 | u32 pma_sample_start; | |
482 | u32 pma_sample_interval; | |
483 | __be16 pma_counter_select[5]; | |
484 | u16 pma_tag; | |
485 | u16 qkey_violations; | |
486 | u16 mkey_violations; | |
487 | u16 mkey_lease_period; | |
488 | u16 pending_index; /* which pending queue is active */ | |
489 | u8 pma_sample_status; | |
490 | u8 subnet_timeout; | |
491 | u8 link_width_enabled; | |
492 | u8 vl_high_limit; | |
493 | struct ipath_opcode_stats opstats[128]; | |
494 | }; | |
495 | ||
496 | struct ipath_ucontext { | |
497 | struct ib_ucontext ibucontext; | |
498 | }; | |
499 | ||
500 | static inline struct ipath_mr *to_imr(struct ib_mr *ibmr) | |
501 | { | |
502 | return container_of(ibmr, struct ipath_mr, ibmr); | |
503 | } | |
504 | ||
505 | static inline struct ipath_fmr *to_ifmr(struct ib_fmr *ibfmr) | |
506 | { | |
507 | return container_of(ibfmr, struct ipath_fmr, ibfmr); | |
508 | } | |
509 | ||
510 | static inline struct ipath_pd *to_ipd(struct ib_pd *ibpd) | |
511 | { | |
512 | return container_of(ibpd, struct ipath_pd, ibpd); | |
513 | } | |
514 | ||
515 | static inline struct ipath_ah *to_iah(struct ib_ah *ibah) | |
516 | { | |
517 | return container_of(ibah, struct ipath_ah, ibah); | |
518 | } | |
519 | ||
520 | static inline struct ipath_cq *to_icq(struct ib_cq *ibcq) | |
521 | { | |
522 | return container_of(ibcq, struct ipath_cq, ibcq); | |
523 | } | |
524 | ||
525 | static inline struct ipath_srq *to_isrq(struct ib_srq *ibsrq) | |
526 | { | |
527 | return container_of(ibsrq, struct ipath_srq, ibsrq); | |
528 | } | |
529 | ||
530 | static inline struct ipath_qp *to_iqp(struct ib_qp *ibqp) | |
531 | { | |
532 | return container_of(ibqp, struct ipath_qp, ibqp); | |
533 | } | |
534 | ||
535 | static inline struct ipath_ibdev *to_idev(struct ib_device *ibdev) | |
536 | { | |
537 | return container_of(ibdev, struct ipath_ibdev, ibdev); | |
538 | } | |
539 | ||
540 | int ipath_process_mad(struct ib_device *ibdev, | |
541 | int mad_flags, | |
542 | u8 port_num, | |
543 | struct ib_wc *in_wc, | |
544 | struct ib_grh *in_grh, | |
545 | struct ib_mad *in_mad, struct ib_mad *out_mad); | |
546 | ||
547 | static inline struct ipath_ucontext *to_iucontext(struct ib_ucontext | |
548 | *ibucontext) | |
549 | { | |
550 | return container_of(ibucontext, struct ipath_ucontext, ibucontext); | |
551 | } | |
552 | ||
553 | /* | |
554 | * Compare the lower 24 bits of the two values. | |
555 | * Returns an integer <, ==, or > than zero. | |
556 | */ | |
557 | static inline int ipath_cmp24(u32 a, u32 b) | |
558 | { | |
559 | return (((int) a) - ((int) b)) << 8; | |
560 | } | |
561 | ||
562 | struct ipath_mcast *ipath_mcast_find(union ib_gid *mgid); | |
563 | ||
564 | int ipath_multicast_attach(struct ib_qp *ibqp, union ib_gid *gid, u16 lid); | |
565 | ||
566 | int ipath_multicast_detach(struct ib_qp *ibqp, union ib_gid *gid, u16 lid); | |
567 | ||
568 | int ipath_mcast_tree_empty(void); | |
569 | ||
570 | __be32 ipath_compute_aeth(struct ipath_qp *qp); | |
571 | ||
572 | struct ipath_qp *ipath_lookup_qpn(struct ipath_qp_table *qpt, u32 qpn); | |
573 | ||
574 | struct ib_qp *ipath_create_qp(struct ib_pd *ibpd, | |
575 | struct ib_qp_init_attr *init_attr, | |
576 | struct ib_udata *udata); | |
577 | ||
578 | int ipath_destroy_qp(struct ib_qp *ibqp); | |
579 | ||
580 | int ipath_modify_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr, | |
9bc57e2d | 581 | int attr_mask, struct ib_udata *udata); |
aa735edf BS |
582 | |
583 | int ipath_query_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr, | |
584 | int attr_mask, struct ib_qp_init_attr *init_attr); | |
585 | ||
586 | void ipath_free_all_qps(struct ipath_qp_table *qpt); | |
587 | ||
588 | int ipath_init_qp_table(struct ipath_ibdev *idev, int size); | |
589 | ||
590 | void ipath_sqerror_qp(struct ipath_qp *qp, struct ib_wc *wc); | |
591 | ||
aa735edf BS |
592 | void ipath_get_credit(struct ipath_qp *qp, u32 aeth); |
593 | ||
aa735edf BS |
594 | void ipath_cq_enter(struct ipath_cq *cq, struct ib_wc *entry, int sig); |
595 | ||
596 | int ipath_rkey_ok(struct ipath_ibdev *dev, struct ipath_sge_state *ss, | |
597 | u32 len, u64 vaddr, u32 rkey, int acc); | |
598 | ||
599 | int ipath_lkey_ok(struct ipath_lkey_table *rkt, struct ipath_sge *isge, | |
600 | struct ib_sge *sge, int acc); | |
601 | ||
602 | void ipath_copy_sge(struct ipath_sge_state *ss, void *data, u32 length); | |
603 | ||
604 | void ipath_skip_sge(struct ipath_sge_state *ss, u32 length); | |
605 | ||
ddd4bb22 | 606 | int ipath_post_ruc_send(struct ipath_qp *qp, struct ib_send_wr *wr); |
aa735edf BS |
607 | |
608 | void ipath_uc_rcv(struct ipath_ibdev *dev, struct ipath_ib_header *hdr, | |
609 | int has_grh, void *data, u32 tlen, struct ipath_qp *qp); | |
610 | ||
611 | void ipath_rc_rcv(struct ipath_ibdev *dev, struct ipath_ib_header *hdr, | |
612 | int has_grh, void *data, u32 tlen, struct ipath_qp *qp); | |
613 | ||
614 | void ipath_restart_rc(struct ipath_qp *qp, u32 psn, struct ib_wc *wc); | |
615 | ||
aa735edf BS |
616 | int ipath_post_ud_send(struct ipath_qp *qp, struct ib_send_wr *wr); |
617 | ||
618 | void ipath_ud_rcv(struct ipath_ibdev *dev, struct ipath_ib_header *hdr, | |
619 | int has_grh, void *data, u32 tlen, struct ipath_qp *qp); | |
620 | ||
621 | int ipath_alloc_lkey(struct ipath_lkey_table *rkt, | |
622 | struct ipath_mregion *mr); | |
623 | ||
624 | void ipath_free_lkey(struct ipath_lkey_table *rkt, u32 lkey); | |
625 | ||
626 | int ipath_lkey_ok(struct ipath_lkey_table *rkt, struct ipath_sge *isge, | |
627 | struct ib_sge *sge, int acc); | |
628 | ||
629 | int ipath_rkey_ok(struct ipath_ibdev *dev, struct ipath_sge_state *ss, | |
630 | u32 len, u64 vaddr, u32 rkey, int acc); | |
631 | ||
632 | int ipath_post_srq_receive(struct ib_srq *ibsrq, struct ib_recv_wr *wr, | |
633 | struct ib_recv_wr **bad_wr); | |
634 | ||
635 | struct ib_srq *ipath_create_srq(struct ib_pd *ibpd, | |
636 | struct ib_srq_init_attr *srq_init_attr, | |
637 | struct ib_udata *udata); | |
638 | ||
639 | int ipath_modify_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr, | |
9bc57e2d RC |
640 | enum ib_srq_attr_mask attr_mask, |
641 | struct ib_udata *udata); | |
aa735edf BS |
642 | |
643 | int ipath_query_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr); | |
644 | ||
645 | int ipath_destroy_srq(struct ib_srq *ibsrq); | |
646 | ||
647 | void ipath_cq_enter(struct ipath_cq *cq, struct ib_wc *entry, int sig); | |
648 | ||
649 | int ipath_poll_cq(struct ib_cq *ibcq, int num_entries, struct ib_wc *entry); | |
650 | ||
651 | struct ib_cq *ipath_create_cq(struct ib_device *ibdev, int entries, | |
652 | struct ib_ucontext *context, | |
653 | struct ib_udata *udata); | |
654 | ||
655 | int ipath_destroy_cq(struct ib_cq *ibcq); | |
656 | ||
657 | int ipath_req_notify_cq(struct ib_cq *ibcq, enum ib_cq_notify notify); | |
658 | ||
659 | int ipath_resize_cq(struct ib_cq *ibcq, int cqe, struct ib_udata *udata); | |
660 | ||
661 | struct ib_mr *ipath_get_dma_mr(struct ib_pd *pd, int acc); | |
662 | ||
663 | struct ib_mr *ipath_reg_phys_mr(struct ib_pd *pd, | |
664 | struct ib_phys_buf *buffer_list, | |
665 | int num_phys_buf, int acc, u64 *iova_start); | |
666 | ||
667 | struct ib_mr *ipath_reg_user_mr(struct ib_pd *pd, struct ib_umem *region, | |
668 | int mr_access_flags, | |
669 | struct ib_udata *udata); | |
670 | ||
671 | int ipath_dereg_mr(struct ib_mr *ibmr); | |
672 | ||
673 | struct ib_fmr *ipath_alloc_fmr(struct ib_pd *pd, int mr_access_flags, | |
674 | struct ib_fmr_attr *fmr_attr); | |
675 | ||
676 | int ipath_map_phys_fmr(struct ib_fmr *ibfmr, u64 * page_list, | |
677 | int list_len, u64 iova); | |
678 | ||
679 | int ipath_unmap_fmr(struct list_head *fmr_list); | |
680 | ||
681 | int ipath_dealloc_fmr(struct ib_fmr *ibfmr); | |
682 | ||
373d9915 RC |
683 | void ipath_release_mmap_info(struct kref *ref); |
684 | ||
685 | int ipath_mmap(struct ib_ucontext *context, struct vm_area_struct *vma); | |
686 | ||
aa735edf BS |
687 | void ipath_no_bufs_available(struct ipath_qp *qp, struct ipath_ibdev *dev); |
688 | ||
689 | void ipath_insert_rnr_queue(struct ipath_qp *qp); | |
690 | ||
691 | int ipath_get_rwqe(struct ipath_qp *qp, int wr_id_only); | |
692 | ||
ddd4bb22 BS |
693 | u32 ipath_make_grh(struct ipath_ibdev *dev, struct ib_grh *hdr, |
694 | struct ib_global_route *grh, u32 hwords, u32 nwords); | |
695 | ||
696 | void ipath_do_ruc_send(unsigned long data); | |
697 | ||
698 | u32 ipath_make_rc_ack(struct ipath_qp *qp, struct ipath_other_headers *ohdr, | |
699 | u32 pmtu); | |
700 | ||
701 | int ipath_make_rc_req(struct ipath_qp *qp, struct ipath_other_headers *ohdr, | |
702 | u32 pmtu, u32 *bth0p, u32 *bth2p); | |
703 | ||
704 | int ipath_make_uc_req(struct ipath_qp *qp, struct ipath_other_headers *ohdr, | |
705 | u32 pmtu, u32 *bth0p, u32 *bth2p); | |
aa735edf BS |
706 | |
707 | extern const enum ib_wc_opcode ib_ipath_wc_opcode[]; | |
708 | ||
709 | extern const u8 ipath_cvt_physportstate[]; | |
710 | ||
711 | extern const int ib_ipath_state_ops[]; | |
712 | ||
713 | extern unsigned int ib_ipath_lkey_table_size; | |
714 | ||
fe62546a BS |
715 | extern unsigned int ib_ipath_max_cqes; |
716 | ||
717 | extern unsigned int ib_ipath_max_cqs; | |
718 | ||
719 | extern unsigned int ib_ipath_max_qp_wrs; | |
720 | ||
721 | extern unsigned int ib_ipath_max_sges; | |
722 | ||
723 | extern unsigned int ib_ipath_max_mcast_grps; | |
724 | ||
725 | extern unsigned int ib_ipath_max_mcast_qp_attached; | |
726 | ||
727 | extern unsigned int ib_ipath_max_srqs; | |
728 | ||
729 | extern unsigned int ib_ipath_max_srq_sges; | |
730 | ||
731 | extern unsigned int ib_ipath_max_srq_wrs; | |
732 | ||
aa735edf BS |
733 | extern const u32 ib_ipath_rnr_table[]; |
734 | ||
735 | #endif /* IPATH_VERBS_H */ |