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