ipath_verbs.h 22 KB

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