ipath_verbs.h 26 KB

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