2 * Copyright (c) 2006 QLogic, Inc. All rights reserved.
3 * Copyright (c) 2005, 2006 PathScale, Inc. All rights reserved.
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:
11 * Redistribution and use in source and binary forms, with or
12 * without modification, are permitted provided that the following
15 * - Redistributions of source code must retain the above
16 * copyright notice, this list of conditions and the following
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.
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
37 #include <linux/types.h>
38 #include <linux/spinlock.h>
39 #include <linux/kernel.h>
40 #include <linux/interrupt.h>
41 #include <linux/kref.h>
42 #include <rdma/ib_pack.h>
44 #include "ipath_layer.h"
46 #define IPATH_MAX_RDMA_ATOMIC 4
48 #define QPN_MAX (1 << 24)
49 #define QPNMAP_ENTRIES (QPN_MAX / PAGE_SIZE / BITS_PER_BYTE)
52 * Increment this value if any changes that break userspace ABI
53 * compatibility are made.
55 #define IPATH_UVERBS_ABI_VERSION 2
58 * Define an ib_cq_notify value that is not valid so we know when CQ
59 * notifications are armed.
61 #define IB_CQ_NONE (IB_CQ_NEXT_COMP + 1)
63 #define IB_RNR_NAK 0x20
64 #define IB_NAK_PSN_ERROR 0x60
65 #define IB_NAK_INVALID_REQUEST 0x61
66 #define IB_NAK_REMOTE_ACCESS_ERROR 0x62
67 #define IB_NAK_REMOTE_OPERATIONAL_ERROR 0x63
68 #define IB_NAK_INVALID_RD_REQUEST 0x64
70 #define IPATH_POST_SEND_OK 0x01
71 #define IPATH_POST_RECV_OK 0x02
72 #define IPATH_PROCESS_RECV_OK 0x04
73 #define IPATH_PROCESS_SEND_OK 0x08
75 /* IB Performance Manager status values */
76 #define IB_PMA_SAMPLE_STATUS_DONE 0x00
77 #define IB_PMA_SAMPLE_STATUS_STARTED 0x01
78 #define IB_PMA_SAMPLE_STATUS_RUNNING 0x02
80 /* Mandatory IB performance counter select values. */
81 #define IB_PMA_PORT_XMIT_DATA __constant_htons(0x0001)
82 #define IB_PMA_PORT_RCV_DATA __constant_htons(0x0002)
83 #define IB_PMA_PORT_XMIT_PKTS __constant_htons(0x0003)
84 #define IB_PMA_PORT_RCV_PKTS __constant_htons(0x0004)
85 #define IB_PMA_PORT_XMIT_WAIT __constant_htons(0x0005)
91 } __attribute__ ((packed));
93 struct ib_atomic_eth {
94 __be32 vaddr[2]; /* unaligned so access as 2 32-bit words */
98 } __attribute__ ((packed));
100 struct ipath_other_headers {
113 __be32 atomic_ack_eth[2];
117 struct ib_atomic_eth atomic_eth;
119 } __attribute__ ((packed));
122 * Note that UD packets with a GRH header are 8+40+12+8 = 68 bytes
123 * long (72 w/ imm_data). Only the first 56 bytes of the IB header
124 * will be in the eager header buffer. The remaining 12 or 16 bytes
125 * are in the data buffer.
127 struct ipath_ib_header {
132 struct ipath_other_headers oth;
134 struct ipath_other_headers oth;
136 } __attribute__ ((packed));
139 * There is one struct ipath_mcast for each multicast GID.
140 * All attached QPs are then stored as a list of
141 * struct ipath_mcast_qp.
143 struct ipath_mcast_qp {
144 struct list_head list;
149 struct rb_node rb_node;
151 struct list_head qp_list;
152 wait_queue_head_t wait;
157 /* Protection domain */
160 int user; /* non-zero if created from user space */
166 struct ib_ah_attr attr;
170 * This structure is used by ipath_mmap() to validate an offset
171 * when an mmap() request is made. The vm_area_struct then uses
172 * this as its vm_private_data.
174 struct ipath_mmap_info {
175 struct ipath_mmap_info *next;
176 struct ib_ucontext *context;
184 * This structure is used to contain the head pointer, tail pointer,
185 * and completion queue entries as a single memory allocation so
186 * it can be mmap'ed into user space.
189 u32 head; /* index of next entry to fill */
190 u32 tail; /* index of next ib_poll_cq() entry */
191 struct ib_wc queue[1]; /* this is actually size ibcq.cqe + 1 */
195 * The completion queue structure.
199 struct tasklet_struct comptask;
203 struct ipath_cq_wc *queue;
204 struct ipath_mmap_info *ip;
208 * A segment is a linear region of low physical memory.
209 * XXX Maybe we should use phys addr here and kmap()/kunmap().
210 * Used by the verbs layer.
217 /* The number of ipath_segs that fit in a page. */
218 #define IPATH_SEGSZ (PAGE_SIZE / sizeof (struct ipath_seg))
220 struct ipath_segarray {
221 struct ipath_seg segs[IPATH_SEGSZ];
224 struct ipath_mregion {
225 struct ib_pd *pd; /* shares refcnt of ibmr.pd */
226 u64 user_base; /* User's address for this region */
227 u64 iova; /* IB start address of this region */
230 u32 offset; /* offset (bytes) to start of region */
232 u32 max_segs; /* number of ipath_segs in all the arrays */
233 u32 mapsz; /* size of the map array */
234 struct ipath_segarray *map[0]; /* the segments */
238 * These keep track of the copy progress within a memory region.
239 * Used by the verbs layer.
242 struct ipath_mregion *mr;
243 void *vaddr; /* current pointer into the segment */
244 u32 sge_length; /* length of the SGE */
245 u32 length; /* remaining length of the segment */
246 u16 m; /* current index: mr->map[m] */
247 u16 n; /* current index: mr->map[m]->segs[n] */
253 struct ipath_mregion mr; /* must be last */
257 * Send work request queue entry.
258 * The size of the sg_list is determined when the QP is created and stored
262 struct ib_send_wr wr; /* don't use wr.sg_list */
263 u32 psn; /* first packet sequence number */
264 u32 lpsn; /* last packet sequence number */
265 u32 ssn; /* send sequence number */
266 u32 length; /* total length of data in sg_list */
267 struct ipath_sge sg_list[0];
271 * Receive work request queue entry.
272 * The size of the sg_list is determined when the QP (or SRQ) is created
273 * and stored in qp->r_rq.max_sge (or srq->rq.max_sge).
278 struct ib_sge sg_list[0];
282 * This structure is used to contain the head pointer, tail pointer,
283 * and receive work queue entries as a single memory allocation so
284 * it can be mmap'ed into user space.
285 * Note that the wq array elements are variable size so you can't
286 * just index into the array to get the N'th element;
287 * use get_rwqe_ptr() instead.
290 u32 head; /* new work requests posted to the head */
291 u32 tail; /* receives pull requests from here. */
292 struct ipath_rwqe wq[0];
296 struct ipath_rwq *wq;
298 u32 size; /* size of RWQE array */
305 struct ipath_mmap_info *ip;
306 /* send signal when number of RWQEs < limit */
310 struct ipath_sge_state {
311 struct ipath_sge *sg_list; /* next SGE to be used if any */
312 struct ipath_sge sge; /* progress state for the current SGE */
317 * This structure holds the information that the send tasklet needs
318 * to send a RDMA read response or atomic operation.
320 struct ipath_ack_entry {
324 struct ipath_sge_state rdma_sge;
330 * Variables prefixed with s_ are for the requester (sender).
331 * Variables prefixed with r_ are for the responder (receiver).
332 * Variables prefixed with ack_ are for responder replies.
334 * Common variables are protected by both r_rq.lock and s_lock in that order
335 * which only happens in modify_qp() or changing the QP 'state'.
339 struct ipath_qp *next; /* link list for QPN hash table */
340 struct ipath_qp *timer_next; /* link list for ipath_ib_timer() */
341 struct list_head piowait; /* link for wait PIO buf */
342 struct list_head timerwait; /* link for waiting for timeouts */
343 struct ib_ah_attr remote_ah_attr;
344 struct ipath_ib_header s_hdr; /* next packet header to send */
346 wait_queue_head_t wait;
347 struct tasklet_struct s_task;
348 struct ipath_mmap_info *ip;
349 struct ipath_sge_state *s_cur_sge;
350 struct ipath_sge_state s_sge; /* current send request data */
351 struct ipath_ack_entry s_ack_queue[IPATH_MAX_RDMA_ATOMIC + 1];
352 struct ipath_sge_state s_ack_rdma_sge;
353 struct ipath_sge_state s_rdma_read_sge;
354 struct ipath_sge_state r_sge; /* current receive data */
356 unsigned long s_busy;
357 u32 s_hdrwords; /* size of s_hdr in 32 bit words */
358 u32 s_cur_size; /* size of send packet in bytes */
359 u32 s_len; /* total length of s_sge */
360 u32 s_rdma_read_len; /* total length of s_rdma_read_sge */
361 u32 s_next_psn; /* PSN for next request */
362 u32 s_last_psn; /* last response PSN processed */
363 u32 s_psn; /* current packet sequence number */
364 u32 s_ack_rdma_psn; /* PSN for sending RDMA read responses */
365 u32 s_ack_psn; /* PSN for acking sends and RDMA writes */
366 u32 s_rnr_timeout; /* number of milliseconds for RNR timeout */
367 u32 r_ack_psn; /* PSN for next ACK or atomic ACK */
368 u64 r_wr_id; /* ID for current receive WQE */
369 u32 r_len; /* total length of r_sge */
370 u32 r_rcv_len; /* receive data len processed */
371 u32 r_psn; /* expected rcv packet sequence number */
372 u32 r_msn; /* message sequence number */
373 u8 state; /* QP state */
374 u8 s_state; /* opcode of last packet sent */
375 u8 s_ack_state; /* opcode of packet to ACK */
376 u8 s_nak_state; /* non-zero if NAK is pending */
377 u8 r_state; /* opcode of last packet received */
378 u8 r_nak_state; /* non-zero if NAK is pending */
379 u8 r_min_rnr_timer; /* retry timeout value for RNR NAKs */
380 u8 r_reuse_sge; /* for UC receive errors */
381 u8 r_sge_inx; /* current index into sg_list */
382 u8 r_wrid_valid; /* r_wrid set but CQ entry not yet made */
383 u8 r_max_rd_atomic; /* max number of RDMA read/atomic to receive */
384 u8 r_head_ack_queue; /* index into s_ack_queue[] */
386 u8 s_max_sge; /* size of s_wq->sg_list */
387 u8 s_retry_cnt; /* number of times to retry */
389 u8 s_retry; /* requester retry counter */
390 u8 s_rnr_retry; /* requester RNR retry counter */
391 u8 s_wait_credit; /* limit number of unacked packets sent */
392 u8 s_pkey_index; /* PKEY index to use */
393 u8 s_max_rd_atomic; /* max number of RDMA read/atomic to send */
394 u8 s_num_rd_atomic; /* number of RDMA read/atomic pending */
395 u8 s_tail_ack_queue; /* index into s_ack_queue[] */
397 u8 timeout; /* Timeout for this QP */
398 enum ib_mtu path_mtu;
400 u32 qkey; /* QKEY for this QP (for UD or RD) */
401 u32 s_size; /* send work queue size */
402 u32 s_head; /* new entries added here */
403 u32 s_tail; /* next entry to process */
404 u32 s_cur; /* current work queue entry */
405 u32 s_last; /* last un-ACK'ed entry */
406 u32 s_ssn; /* SSN of tail entry */
407 u32 s_lsn; /* limit sequence number (credit) */
408 struct ipath_swqe *s_wq; /* send work queue */
409 struct ipath_rq r_rq; /* receive work queue */
410 struct ipath_sge r_sg_list[0]; /* verified SGEs */
413 /* Bit definition for s_busy. */
414 #define IPATH_S_BUSY 0
417 * Bit definitions for s_flags.
419 #define IPATH_S_SIGNAL_REQ_WR 0x01
420 #define IPATH_S_FENCE_PENDING 0x02
421 #define IPATH_S_RDMAR_PENDING 0x04
422 #define IPATH_S_ACK_PENDING 0x08
424 #define IPATH_PSN_CREDIT 2048
427 * Since struct ipath_swqe is not a fixed size, we can't simply index into
428 * struct ipath_qp.s_wq. This function does the array index computation.
430 static inline struct ipath_swqe *get_swqe_ptr(struct ipath_qp *qp,
433 return (struct ipath_swqe *)((char *)qp->s_wq +
434 (sizeof(struct ipath_swqe) +
436 sizeof(struct ipath_sge)) * n);
440 * Since struct ipath_rwqe is not a fixed size, we can't simply index into
441 * struct ipath_rwq.wq. This function does the array index computation.
443 static inline struct ipath_rwqe *get_rwqe_ptr(struct ipath_rq *rq,
446 return (struct ipath_rwqe *)
447 ((char *) rq->wq->wq +
448 (sizeof(struct ipath_rwqe) +
449 rq->max_sge * sizeof(struct ib_sge)) * n);
453 * QPN-map pages start out as NULL, they get allocated upon
454 * first use and are never deallocated. This way,
455 * large bitmaps are not allocated unless large numbers of QPs are used.
462 struct ipath_qp_table {
464 u32 last; /* last QP number allocated */
465 u32 max; /* size of the hash table */
466 u32 nmaps; /* size of the map table */
467 struct ipath_qp **table;
468 /* bit map of free numbers */
469 struct qpn_map map[QPNMAP_ENTRIES];
472 struct ipath_lkey_table {
474 u32 next; /* next unused index (speeds search) */
475 u32 gen; /* generation count */
476 u32 max; /* size of the table */
477 struct ipath_mregion **table;
480 struct ipath_opcode_stats {
481 u64 n_packets; /* number of packets */
482 u64 n_bytes; /* total number of bytes */
486 struct ib_device ibdev;
487 struct list_head dev_list;
488 struct ipath_devdata *dd;
489 struct ipath_mmap_info *pending_mmaps;
490 int ib_unit; /* This is the device number */
491 u16 sm_lid; /* in host order */
493 u8 mkeyprot_resv_lmc;
494 /* non-zero when timer is set */
495 unsigned long mkey_lease_timeout;
497 /* The following fields are really per port. */
498 struct ipath_qp_table qp_table;
499 struct ipath_lkey_table lk_table;
500 struct list_head pending[3]; /* FIFO of QPs waiting for ACKs */
501 struct list_head piowait; /* list for wait PIO buf */
502 /* list of QPs waiting for RNR timer */
503 struct list_head rnrwait;
504 spinlock_t pending_lock;
505 __be64 sys_image_guid; /* in network order */
506 __be64 gid_prefix; /* in network order */
509 u32 n_pds_allocated; /* number of PDs allocated for device */
510 spinlock_t n_pds_lock;
511 u32 n_ahs_allocated; /* number of AHs allocated for device */
512 spinlock_t n_ahs_lock;
513 u32 n_cqs_allocated; /* number of CQs allocated for device */
514 spinlock_t n_cqs_lock;
515 u32 n_qps_allocated; /* number of QPs allocated for device */
516 spinlock_t n_qps_lock;
517 u32 n_srqs_allocated; /* number of SRQs allocated for device */
518 spinlock_t n_srqs_lock;
519 u32 n_mcast_grps_allocated; /* number of mcast groups allocated */
520 spinlock_t n_mcast_grps_lock;
522 u64 ipath_sword; /* total dwords sent (sample result) */
523 u64 ipath_rword; /* total dwords received (sample result) */
524 u64 ipath_spkts; /* total packets sent (sample result) */
525 u64 ipath_rpkts; /* total packets received (sample result) */
526 /* # of ticks no data sent (sample result) */
528 u64 rcv_errors; /* # of packets with SW detected rcv errs */
529 u64 n_unicast_xmit; /* total unicast packets sent */
530 u64 n_unicast_rcv; /* total unicast packets received */
531 u64 n_multicast_xmit; /* total multicast packets sent */
532 u64 n_multicast_rcv; /* total multicast packets received */
533 u64 z_symbol_error_counter; /* starting count for PMA */
534 u64 z_link_error_recovery_counter; /* starting count for PMA */
535 u64 z_link_downed_counter; /* starting count for PMA */
536 u64 z_port_rcv_errors; /* starting count for PMA */
537 u64 z_port_rcv_remphys_errors; /* starting count for PMA */
538 u64 z_port_xmit_discards; /* starting count for PMA */
539 u64 z_port_xmit_data; /* starting count for PMA */
540 u64 z_port_rcv_data; /* starting count for PMA */
541 u64 z_port_xmit_packets; /* starting count for PMA */
542 u64 z_port_rcv_packets; /* starting count for PMA */
543 u32 z_pkey_violations; /* starting count for PMA */
544 u32 z_local_link_integrity_errors; /* starting count for PMA */
545 u32 z_excessive_buffer_overrun_errors; /* starting count for PMA */
562 u32 pma_sample_start;
563 u32 pma_sample_interval;
564 __be16 pma_counter_select[5];
568 u16 mkey_lease_period;
569 u16 pending_index; /* which pending queue is active */
570 u8 pma_sample_status;
572 u8 link_width_enabled;
574 struct ipath_opcode_stats opstats[128];
577 struct ipath_verbs_counters {
578 u64 symbol_error_counter;
579 u64 link_error_recovery_counter;
580 u64 link_downed_counter;
582 u64 port_rcv_remphys_errors;
583 u64 port_xmit_discards;
586 u64 port_xmit_packets;
587 u64 port_rcv_packets;
588 u32 local_link_integrity_errors;
589 u32 excessive_buffer_overrun_errors;
592 static inline struct ipath_mr *to_imr(struct ib_mr *ibmr)
594 return container_of(ibmr, struct ipath_mr, ibmr);
597 static inline struct ipath_pd *to_ipd(struct ib_pd *ibpd)
599 return container_of(ibpd, struct ipath_pd, ibpd);
602 static inline struct ipath_ah *to_iah(struct ib_ah *ibah)
604 return container_of(ibah, struct ipath_ah, ibah);
607 static inline struct ipath_cq *to_icq(struct ib_cq *ibcq)
609 return container_of(ibcq, struct ipath_cq, ibcq);
612 static inline struct ipath_srq *to_isrq(struct ib_srq *ibsrq)
614 return container_of(ibsrq, struct ipath_srq, ibsrq);
617 static inline struct ipath_qp *to_iqp(struct ib_qp *ibqp)
619 return container_of(ibqp, struct ipath_qp, ibqp);
622 static inline struct ipath_ibdev *to_idev(struct ib_device *ibdev)
624 return container_of(ibdev, struct ipath_ibdev, ibdev);
627 int ipath_process_mad(struct ib_device *ibdev,
631 struct ib_grh *in_grh,
632 struct ib_mad *in_mad, struct ib_mad *out_mad);
635 * Compare the lower 24 bits of the two values.
636 * Returns an integer <, ==, or > than zero.
638 static inline int ipath_cmp24(u32 a, u32 b)
640 return (((int) a) - ((int) b)) << 8;
643 struct ipath_mcast *ipath_mcast_find(union ib_gid *mgid);
645 int ipath_snapshot_counters(struct ipath_devdata *dd, u64 *swords,
646 u64 *rwords, u64 *spkts, u64 *rpkts,
649 int ipath_get_counters(struct ipath_devdata *dd,
650 struct ipath_verbs_counters *cntrs);
652 int ipath_multicast_attach(struct ib_qp *ibqp, union ib_gid *gid, u16 lid);
654 int ipath_multicast_detach(struct ib_qp *ibqp, union ib_gid *gid, u16 lid);
656 int ipath_mcast_tree_empty(void);
658 __be32 ipath_compute_aeth(struct ipath_qp *qp);
660 struct ipath_qp *ipath_lookup_qpn(struct ipath_qp_table *qpt, u32 qpn);
662 struct ib_qp *ipath_create_qp(struct ib_pd *ibpd,
663 struct ib_qp_init_attr *init_attr,
664 struct ib_udata *udata);
666 int ipath_destroy_qp(struct ib_qp *ibqp);
668 void ipath_error_qp(struct ipath_qp *qp, enum ib_wc_status err);
670 int ipath_modify_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr,
671 int attr_mask, struct ib_udata *udata);
673 int ipath_query_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr,
674 int attr_mask, struct ib_qp_init_attr *init_attr);
676 void ipath_free_all_qps(struct ipath_qp_table *qpt);
678 int ipath_init_qp_table(struct ipath_ibdev *idev, int size);
680 void ipath_sqerror_qp(struct ipath_qp *qp, struct ib_wc *wc);
682 void ipath_get_credit(struct ipath_qp *qp, u32 aeth);
684 int ipath_verbs_send(struct ipath_devdata *dd, u32 hdrwords,
685 u32 *hdr, u32 len, struct ipath_sge_state *ss);
687 void ipath_cq_enter(struct ipath_cq *cq, struct ib_wc *entry, int sig);
689 void ipath_copy_sge(struct ipath_sge_state *ss, void *data, u32 length);
691 void ipath_skip_sge(struct ipath_sge_state *ss, u32 length);
693 int ipath_post_ruc_send(struct ipath_qp *qp, struct ib_send_wr *wr);
695 void ipath_uc_rcv(struct ipath_ibdev *dev, struct ipath_ib_header *hdr,
696 int has_grh, void *data, u32 tlen, struct ipath_qp *qp);
698 void ipath_rc_rcv(struct ipath_ibdev *dev, struct ipath_ib_header *hdr,
699 int has_grh, void *data, u32 tlen, struct ipath_qp *qp);
701 void ipath_restart_rc(struct ipath_qp *qp, u32 psn, struct ib_wc *wc);
703 int ipath_post_ud_send(struct ipath_qp *qp, struct ib_send_wr *wr);
705 void ipath_ud_rcv(struct ipath_ibdev *dev, struct ipath_ib_header *hdr,
706 int has_grh, void *data, u32 tlen, struct ipath_qp *qp);
708 int ipath_alloc_lkey(struct ipath_lkey_table *rkt,
709 struct ipath_mregion *mr);
711 void ipath_free_lkey(struct ipath_lkey_table *rkt, u32 lkey);
713 int ipath_lkey_ok(struct ipath_qp *qp, struct ipath_sge *isge,
714 struct ib_sge *sge, int acc);
716 int ipath_rkey_ok(struct ipath_qp *qp, struct ipath_sge_state *ss,
717 u32 len, u64 vaddr, u32 rkey, int acc);
719 int ipath_post_srq_receive(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
720 struct ib_recv_wr **bad_wr);
722 struct ib_srq *ipath_create_srq(struct ib_pd *ibpd,
723 struct ib_srq_init_attr *srq_init_attr,
724 struct ib_udata *udata);
726 int ipath_modify_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr,
727 enum ib_srq_attr_mask attr_mask,
728 struct ib_udata *udata);
730 int ipath_query_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr);
732 int ipath_destroy_srq(struct ib_srq *ibsrq);
734 void ipath_cq_enter(struct ipath_cq *cq, struct ib_wc *entry, int sig);
736 int ipath_poll_cq(struct ib_cq *ibcq, int num_entries, struct ib_wc *entry);
738 struct ib_cq *ipath_create_cq(struct ib_device *ibdev, int entries,
739 struct ib_ucontext *context,
740 struct ib_udata *udata);
742 int ipath_destroy_cq(struct ib_cq *ibcq);
744 int ipath_req_notify_cq(struct ib_cq *ibcq, enum ib_cq_notify notify);
746 int ipath_resize_cq(struct ib_cq *ibcq, int cqe, struct ib_udata *udata);
748 struct ib_mr *ipath_get_dma_mr(struct ib_pd *pd, int acc);
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);
754 struct ib_mr *ipath_reg_user_mr(struct ib_pd *pd, struct ib_umem *region,
756 struct ib_udata *udata);
758 int ipath_dereg_mr(struct ib_mr *ibmr);
760 struct ib_fmr *ipath_alloc_fmr(struct ib_pd *pd, int mr_access_flags,
761 struct ib_fmr_attr *fmr_attr);
763 int ipath_map_phys_fmr(struct ib_fmr *ibfmr, u64 * page_list,
764 int list_len, u64 iova);
766 int ipath_unmap_fmr(struct list_head *fmr_list);
768 int ipath_dealloc_fmr(struct ib_fmr *ibfmr);
770 void ipath_release_mmap_info(struct kref *ref);
772 int ipath_mmap(struct ib_ucontext *context, struct vm_area_struct *vma);
774 void ipath_no_bufs_available(struct ipath_qp *qp, struct ipath_ibdev *dev);
776 void ipath_insert_rnr_queue(struct ipath_qp *qp);
778 int ipath_get_rwqe(struct ipath_qp *qp, int wr_id_only);
780 u32 ipath_make_grh(struct ipath_ibdev *dev, struct ib_grh *hdr,
781 struct ib_global_route *grh, u32 hwords, u32 nwords);
783 void ipath_do_ruc_send(unsigned long data);
785 int ipath_make_rc_req(struct ipath_qp *qp, struct ipath_other_headers *ohdr,
786 u32 pmtu, u32 *bth0p, u32 *bth2p);
788 int ipath_make_uc_req(struct ipath_qp *qp, struct ipath_other_headers *ohdr,
789 u32 pmtu, u32 *bth0p, u32 *bth2p);
791 int ipath_register_ib_device(struct ipath_devdata *);
793 void ipath_unregister_ib_device(struct ipath_ibdev *);
795 void ipath_ib_rcv(struct ipath_ibdev *, void *, void *, u32);
797 int ipath_ib_piobufavail(struct ipath_ibdev *);
799 void ipath_ib_timer(struct ipath_ibdev *);
801 unsigned ipath_get_npkeys(struct ipath_devdata *);
803 u32 ipath_get_cr_errpkey(struct ipath_devdata *);
805 unsigned ipath_get_pkey(struct ipath_devdata *, unsigned);
807 extern const enum ib_wc_opcode ib_ipath_wc_opcode[];
809 extern const u8 ipath_cvt_physportstate[];
811 extern const int ib_ipath_state_ops[];
813 extern unsigned int ib_ipath_lkey_table_size;
815 extern unsigned int ib_ipath_max_cqes;
817 extern unsigned int ib_ipath_max_cqs;
819 extern unsigned int ib_ipath_max_qp_wrs;
821 extern unsigned int ib_ipath_max_qps;
823 extern unsigned int ib_ipath_max_sges;
825 extern unsigned int ib_ipath_max_mcast_grps;
827 extern unsigned int ib_ipath_max_mcast_qp_attached;
829 extern unsigned int ib_ipath_max_srqs;
831 extern unsigned int ib_ipath_max_srq_sges;
833 extern unsigned int ib_ipath_max_srq_wrs;
835 extern const u32 ib_ipath_rnr_table[];
837 extern struct ib_dma_mapping_ops ipath_dma_mapping_ops;
839 #endif /* IPATH_VERBS_H */