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>
43 #include <rdma/ib_user_verbs.h>
45 #include "ipath_layer.h"
47 #define IPATH_MAX_RDMA_ATOMIC 4
49 #define QPN_MAX (1 << 24)
50 #define QPNMAP_ENTRIES (QPN_MAX / PAGE_SIZE / BITS_PER_BYTE)
53 * Increment this value if any changes that break userspace ABI
54 * compatibility are made.
56 #define IPATH_UVERBS_ABI_VERSION 2
59 * Define an ib_cq_notify value that is not valid so we know when CQ
60 * notifications are armed.
62 #define IB_CQ_NONE (IB_CQ_NEXT_COMP + 1)
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
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
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
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)
92 } __attribute__ ((packed));
94 struct ib_atomic_eth {
95 __be32 vaddr[2]; /* unaligned so access as 2 32-bit words */
99 } __attribute__ ((packed));
101 struct ipath_other_headers {
114 __be32 atomic_ack_eth[2];
118 struct ib_atomic_eth atomic_eth;
120 } __attribute__ ((packed));
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.
128 struct ipath_ib_header {
133 struct ipath_other_headers oth;
135 struct ipath_other_headers oth;
137 } __attribute__ ((packed));
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.
144 struct ipath_mcast_qp {
145 struct list_head list;
150 struct rb_node rb_node;
152 struct list_head qp_list;
153 wait_queue_head_t wait;
158 /* Protection domain */
161 int user; /* non-zero if created from user space */
167 struct ib_ah_attr attr;
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.
175 struct ipath_mmap_info {
176 struct list_head pending_mmaps;
177 struct ib_ucontext *context;
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.
190 u32 head; /* index of next entry to fill */
191 u32 tail; /* index of next ib_poll_cq() entry */
192 struct ib_uverbs_wc queue[1]; /* this is actually size ibcq.cqe + 1 */
196 * The completion queue structure.
200 struct tasklet_struct comptask;
204 struct ipath_cq_wc *queue;
205 struct ipath_mmap_info *ip;
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.
218 /* The number of ipath_segs that fit in a page. */
219 #define IPATH_SEGSZ (PAGE_SIZE / sizeof (struct ipath_seg))
221 struct ipath_segarray {
222 struct ipath_seg segs[IPATH_SEGSZ];
225 struct ipath_mregion {
226 struct ib_pd *pd; /* shares refcnt of ibmr.pd */
227 u64 user_base; /* User's address for this region */
228 u64 iova; /* IB start address of this region */
231 u32 offset; /* offset (bytes) to start of region */
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 */
239 * These keep track of the copy progress within a memory region.
240 * Used by the verbs layer.
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] */
254 struct ipath_mregion mr; /* must be last */
258 * Send work request queue entry.
259 * The size of the sg_list is determined when the QP is created and stored
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];
272 * Receive work request queue entry.
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).
279 struct ib_sge sg_list[0];
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.
291 u32 head; /* new work requests posted to the head */
292 u32 tail; /* receives pull requests from here. */
293 struct ipath_rwqe wq[0];
297 struct ipath_rwq *wq;
299 u32 size; /* size of RWQE array */
306 struct ipath_mmap_info *ip;
307 /* send signal when number of RWQEs < limit */
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 */
318 * This structure holds the information that the send tasklet needs
319 * to send a RDMA read response or atomic operation.
321 struct ipath_ack_entry {
325 struct ipath_sge_state rdma_sge;
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.
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'.
340 struct ipath_qp *next; /* link list for QPN hash table */
341 struct ipath_qp *timer_next; /* link list for ipath_ib_timer() */
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 */
347 wait_queue_head_t wait;
348 struct tasklet_struct s_task;
349 struct ipath_mmap_info *ip;
350 struct ipath_sge_state *s_cur_sge;
351 struct ipath_sge_state s_sge; /* current send request data */
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;
355 struct ipath_sge_state r_sge; /* current receive data */
357 unsigned long s_busy;
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 */
361 u32 s_rdma_read_len; /* total length of s_rdma_read_sge */
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 */
365 u32 s_ack_rdma_psn; /* PSN for sending RDMA read responses */
366 u32 s_ack_psn; /* PSN for acking sends and RDMA writes */
367 u32 s_rnr_timeout; /* number of milliseconds for RNR timeout */
368 u32 r_ack_psn; /* PSN for next ACK or atomic ACK */
369 u64 r_wr_id; /* ID for current receive WQE */
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 */
373 u32 r_msn; /* message sequence number */
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 */
379 u8 r_nak_state; /* non-zero if NAK is pending */
380 u8 r_min_rnr_timer; /* retry timeout value for RNR NAKs */
381 u8 r_reuse_sge; /* for UC receive errors */
382 u8 r_sge_inx; /* current index into sg_list */
383 u8 r_wrid_valid; /* r_wrid set but CQ entry not yet made */
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[] */
387 u8 s_max_sge; /* size of s_wq->sg_list */
388 u8 s_retry_cnt; /* number of times to retry */
390 u8 s_retry; /* requester retry counter */
391 u8 s_rnr_retry; /* requester RNR retry counter */
392 u8 s_wait_credit; /* limit number of unacked packets sent */
393 u8 s_pkey_index; /* PKEY index to use */
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[] */
398 u8 timeout; /* Timeout for this QP */
399 enum ib_mtu path_mtu;
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 */
410 struct ipath_rq r_rq; /* receive work queue */
411 struct ipath_sge r_sg_list[0]; /* verified SGEs */
414 /* Bit definition for s_busy. */
415 #define IPATH_S_BUSY 0
418 * Bit definitions for s_flags.
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
425 #define IPATH_PSN_CREDIT 512
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.
431 static inline struct ipath_swqe *get_swqe_ptr(struct ipath_qp *qp,
434 return (struct ipath_swqe *)((char *)qp->s_wq +
435 (sizeof(struct ipath_swqe) +
437 sizeof(struct ipath_sge)) * n);
441 * Since struct ipath_rwqe is not a fixed size, we can't simply index into
442 * struct ipath_rwq.wq. This function does the array index computation.
444 static inline struct ipath_rwqe *get_rwqe_ptr(struct ipath_rq *rq,
447 return (struct ipath_rwqe *)
448 ((char *) rq->wq->wq +
449 (sizeof(struct ipath_rwqe) +
450 rq->max_sge * sizeof(struct ib_sge)) * n);
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.
463 struct ipath_qp_table {
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];
473 struct ipath_lkey_table {
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;
481 struct ipath_opcode_stats {
482 u64 n_packets; /* number of packets */
483 u64 n_bytes; /* total number of bytes */
487 struct ib_device ibdev;
488 struct ipath_devdata *dd;
489 struct list_head pending_mmaps;
490 spinlock_t mmap_offset_lock;
492 int ib_unit; /* This is the device number */
493 u16 sm_lid; /* in host order */
495 u8 mkeyprot_resv_lmc;
496 /* non-zero when timer is set */
497 unsigned long mkey_lease_timeout;
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 */
511 u32 n_pds_allocated; /* number of PDs allocated for device */
512 spinlock_t n_pds_lock;
513 u32 n_ahs_allocated; /* number of AHs allocated for device */
514 spinlock_t n_ahs_lock;
515 u32 n_cqs_allocated; /* number of CQs allocated for device */
516 spinlock_t n_cqs_lock;
517 u32 n_qps_allocated; /* number of QPs allocated for device */
518 spinlock_t n_qps_lock;
519 u32 n_srqs_allocated; /* number of SRQs allocated for device */
520 spinlock_t n_srqs_lock;
521 u32 n_mcast_grps_allocated; /* number of mcast groups allocated */
522 spinlock_t n_mcast_grps_lock;
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) */
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 */
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 */
546 u32 z_local_link_integrity_errors; /* starting count for PMA */
547 u32 z_excessive_buffer_overrun_errors; /* starting count for PMA */
564 u32 pma_sample_start;
565 u32 pma_sample_interval;
566 __be16 pma_counter_select[5];
570 u16 mkey_lease_period;
571 u16 pending_index; /* which pending queue is active */
572 u8 pma_sample_status;
574 u8 link_width_enabled;
576 struct ipath_opcode_stats opstats[128];
579 struct ipath_verbs_counters {
580 u64 symbol_error_counter;
581 u64 link_error_recovery_counter;
582 u64 link_downed_counter;
584 u64 port_rcv_remphys_errors;
585 u64 port_xmit_discards;
588 u64 port_xmit_packets;
589 u64 port_rcv_packets;
590 u32 local_link_integrity_errors;
591 u32 excessive_buffer_overrun_errors;
594 static inline struct ipath_mr *to_imr(struct ib_mr *ibmr)
596 return container_of(ibmr, struct ipath_mr, ibmr);
599 static inline struct ipath_pd *to_ipd(struct ib_pd *ibpd)
601 return container_of(ibpd, struct ipath_pd, ibpd);
604 static inline struct ipath_ah *to_iah(struct ib_ah *ibah)
606 return container_of(ibah, struct ipath_ah, ibah);
609 static inline struct ipath_cq *to_icq(struct ib_cq *ibcq)
611 return container_of(ibcq, struct ipath_cq, ibcq);
614 static inline struct ipath_srq *to_isrq(struct ib_srq *ibsrq)
616 return container_of(ibsrq, struct ipath_srq, ibsrq);
619 static inline struct ipath_qp *to_iqp(struct ib_qp *ibqp)
621 return container_of(ibqp, struct ipath_qp, ibqp);
624 static inline struct ipath_ibdev *to_idev(struct ib_device *ibdev)
626 return container_of(ibdev, struct ipath_ibdev, ibdev);
629 int ipath_process_mad(struct ib_device *ibdev,
633 struct ib_grh *in_grh,
634 struct ib_mad *in_mad, struct ib_mad *out_mad);
637 * Compare the lower 24 bits of the two values.
638 * Returns an integer <, ==, or > than zero.
640 static inline int ipath_cmp24(u32 a, u32 b)
642 return (((int) a) - ((int) b)) << 8;
645 struct ipath_mcast *ipath_mcast_find(union ib_gid *mgid);
647 int ipath_snapshot_counters(struct ipath_devdata *dd, u64 *swords,
648 u64 *rwords, u64 *spkts, u64 *rpkts,
651 int ipath_get_counters(struct ipath_devdata *dd,
652 struct ipath_verbs_counters *cntrs);
654 int ipath_multicast_attach(struct ib_qp *ibqp, union ib_gid *gid, u16 lid);
656 int ipath_multicast_detach(struct ib_qp *ibqp, union ib_gid *gid, u16 lid);
658 int ipath_mcast_tree_empty(void);
660 __be32 ipath_compute_aeth(struct ipath_qp *qp);
662 struct ipath_qp *ipath_lookup_qpn(struct ipath_qp_table *qpt, u32 qpn);
664 struct ib_qp *ipath_create_qp(struct ib_pd *ibpd,
665 struct ib_qp_init_attr *init_attr,
666 struct ib_udata *udata);
668 int ipath_destroy_qp(struct ib_qp *ibqp);
670 void ipath_error_qp(struct ipath_qp *qp, enum ib_wc_status err);
672 int ipath_modify_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr,
673 int attr_mask, struct ib_udata *udata);
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);
678 void ipath_free_all_qps(struct ipath_qp_table *qpt);
680 int ipath_init_qp_table(struct ipath_ibdev *idev, int size);
682 void ipath_sqerror_qp(struct ipath_qp *qp, struct ib_wc *wc);
684 void ipath_get_credit(struct ipath_qp *qp, u32 aeth);
686 int ipath_verbs_send(struct ipath_devdata *dd, u32 hdrwords,
687 u32 *hdr, u32 len, struct ipath_sge_state *ss);
689 void ipath_cq_enter(struct ipath_cq *cq, struct ib_wc *entry, int sig);
691 void ipath_copy_sge(struct ipath_sge_state *ss, void *data, u32 length);
693 void ipath_skip_sge(struct ipath_sge_state *ss, u32 length);
695 int ipath_post_ruc_send(struct ipath_qp *qp, struct ib_send_wr *wr);
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);
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);
703 void ipath_restart_rc(struct ipath_qp *qp, u32 psn, struct ib_wc *wc);
705 int ipath_post_ud_send(struct ipath_qp *qp, struct ib_send_wr *wr);
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);
710 int ipath_alloc_lkey(struct ipath_lkey_table *rkt,
711 struct ipath_mregion *mr);
713 void ipath_free_lkey(struct ipath_lkey_table *rkt, u32 lkey);
715 int ipath_lkey_ok(struct ipath_qp *qp, struct ipath_sge *isge,
716 struct ib_sge *sge, int acc);
718 int ipath_rkey_ok(struct ipath_qp *qp, struct ipath_sge_state *ss,
719 u32 len, u64 vaddr, u32 rkey, int acc);
721 int ipath_post_srq_receive(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
722 struct ib_recv_wr **bad_wr);
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);
728 int ipath_modify_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr,
729 enum ib_srq_attr_mask attr_mask,
730 struct ib_udata *udata);
732 int ipath_query_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr);
734 int ipath_destroy_srq(struct ib_srq *ibsrq);
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, int comp_vector,
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_flags notify_flags);
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 struct ipath_mmap_info *ipath_create_mmap_info(struct ipath_ibdev *dev,
774 struct ib_ucontext *context,
777 void ipath_update_mmap_info(struct ipath_ibdev *dev,
778 struct ipath_mmap_info *ip,
779 u32 size, void *obj);
781 int ipath_mmap(struct ib_ucontext *context, struct vm_area_struct *vma);
783 void ipath_no_bufs_available(struct ipath_qp *qp, struct ipath_ibdev *dev);
785 void ipath_insert_rnr_queue(struct ipath_qp *qp);
787 int ipath_get_rwqe(struct ipath_qp *qp, int wr_id_only);
789 u32 ipath_make_grh(struct ipath_ibdev *dev, struct ib_grh *hdr,
790 struct ib_global_route *grh, u32 hwords, u32 nwords);
792 void ipath_do_ruc_send(unsigned long data);
794 int ipath_make_rc_req(struct ipath_qp *qp, struct ipath_other_headers *ohdr,
795 u32 pmtu, u32 *bth0p, u32 *bth2p);
797 int ipath_make_uc_req(struct ipath_qp *qp, struct ipath_other_headers *ohdr,
798 u32 pmtu, u32 *bth0p, u32 *bth2p);
800 int ipath_register_ib_device(struct ipath_devdata *);
802 void ipath_unregister_ib_device(struct ipath_ibdev *);
804 void ipath_ib_rcv(struct ipath_ibdev *, void *, void *, u32);
806 int ipath_ib_piobufavail(struct ipath_ibdev *);
808 void ipath_ib_timer(struct ipath_ibdev *);
810 unsigned ipath_get_npkeys(struct ipath_devdata *);
812 u32 ipath_get_cr_errpkey(struct ipath_devdata *);
814 unsigned ipath_get_pkey(struct ipath_devdata *, unsigned);
816 extern const enum ib_wc_opcode ib_ipath_wc_opcode[];
818 extern const u8 ipath_cvt_physportstate[];
820 extern const int ib_ipath_state_ops[];
822 extern unsigned int ib_ipath_lkey_table_size;
824 extern unsigned int ib_ipath_max_cqes;
826 extern unsigned int ib_ipath_max_cqs;
828 extern unsigned int ib_ipath_max_qp_wrs;
830 extern unsigned int ib_ipath_max_qps;
832 extern unsigned int ib_ipath_max_sges;
834 extern unsigned int ib_ipath_max_mcast_grps;
836 extern unsigned int ib_ipath_max_mcast_qp_attached;
838 extern unsigned int ib_ipath_max_srqs;
840 extern unsigned int ib_ipath_max_srq_sges;
842 extern unsigned int ib_ipath_max_srq_wrs;
844 extern const u32 ib_ipath_rnr_table[];
846 extern struct ib_dma_mapping_ops ipath_dma_mapping_ops;
848 #endif /* IPATH_VERBS_H */