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