mthca_provider.h 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345
  1. /*
  2. * Copyright (c) 2004 Topspin Communications. All rights reserved.
  3. * Copyright (c) 2005, 2006 Cisco Systems. All rights reserved.
  4. * Copyright (c) 2005 Mellanox Technologies. All rights reserved.
  5. *
  6. * This software is available to you under a choice of one of two
  7. * licenses. You may choose to be licensed under the terms of the GNU
  8. * General Public License (GPL) Version 2, available from the file
  9. * COPYING in the main directory of this source tree, or the
  10. * OpenIB.org BSD license below:
  11. *
  12. * Redistribution and use in source and binary forms, with or
  13. * without modification, are permitted provided that the following
  14. * conditions are met:
  15. *
  16. * - Redistributions of source code must retain the above
  17. * copyright notice, this list of conditions and the following
  18. * disclaimer.
  19. *
  20. * - Redistributions in binary form must reproduce the above
  21. * copyright notice, this list of conditions and the following
  22. * disclaimer in the documentation and/or other materials
  23. * provided with the distribution.
  24. *
  25. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  26. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  27. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  28. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  29. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  30. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  31. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  32. * SOFTWARE.
  33. */
  34. #ifndef MTHCA_PROVIDER_H
  35. #define MTHCA_PROVIDER_H
  36. #include <rdma/ib_verbs.h>
  37. #include <rdma/ib_pack.h>
  38. #define MTHCA_MPT_FLAG_ATOMIC (1 << 14)
  39. #define MTHCA_MPT_FLAG_REMOTE_WRITE (1 << 13)
  40. #define MTHCA_MPT_FLAG_REMOTE_READ (1 << 12)
  41. #define MTHCA_MPT_FLAG_LOCAL_WRITE (1 << 11)
  42. #define MTHCA_MPT_FLAG_LOCAL_READ (1 << 10)
  43. struct mthca_buf_list {
  44. void *buf;
  45. DEFINE_DMA_UNMAP_ADDR(mapping);
  46. };
  47. union mthca_buf {
  48. struct mthca_buf_list direct;
  49. struct mthca_buf_list *page_list;
  50. };
  51. struct mthca_uar {
  52. unsigned long pfn;
  53. int index;
  54. };
  55. struct mthca_user_db_table;
  56. struct mthca_ucontext {
  57. struct ib_ucontext ibucontext;
  58. struct mthca_uar uar;
  59. struct mthca_user_db_table *db_tab;
  60. int reg_mr_warned;
  61. };
  62. struct mthca_mtt;
  63. struct mthca_mr {
  64. struct ib_mr ibmr;
  65. struct ib_umem *umem;
  66. struct mthca_mtt *mtt;
  67. };
  68. struct mthca_fmr {
  69. struct ib_fmr ibmr;
  70. struct ib_fmr_attr attr;
  71. struct mthca_mtt *mtt;
  72. int maps;
  73. union {
  74. struct {
  75. struct mthca_mpt_entry __iomem *mpt;
  76. u64 __iomem *mtts;
  77. } tavor;
  78. struct {
  79. struct mthca_mpt_entry *mpt;
  80. __be64 *mtts;
  81. dma_addr_t dma_handle;
  82. } arbel;
  83. } mem;
  84. };
  85. struct mthca_pd {
  86. struct ib_pd ibpd;
  87. u32 pd_num;
  88. atomic_t sqp_count;
  89. struct mthca_mr ntmr;
  90. int privileged;
  91. };
  92. struct mthca_eq {
  93. struct mthca_dev *dev;
  94. int eqn;
  95. u32 eqn_mask;
  96. u32 cons_index;
  97. u16 msi_x_vector;
  98. u16 msi_x_entry;
  99. int have_irq;
  100. int nent;
  101. struct mthca_buf_list *page_list;
  102. struct mthca_mr mr;
  103. char irq_name[IB_DEVICE_NAME_MAX];
  104. };
  105. struct mthca_av;
  106. enum mthca_ah_type {
  107. MTHCA_AH_ON_HCA,
  108. MTHCA_AH_PCI_POOL,
  109. MTHCA_AH_KMALLOC
  110. };
  111. struct mthca_ah {
  112. struct ib_ah ibah;
  113. enum mthca_ah_type type;
  114. u32 key;
  115. struct mthca_av *av;
  116. dma_addr_t avdma;
  117. };
  118. /*
  119. * Quick description of our CQ/QP locking scheme:
  120. *
  121. * We have one global lock that protects dev->cq/qp_table. Each
  122. * struct mthca_cq/qp also has its own lock. An individual qp lock
  123. * may be taken inside of an individual cq lock. Both cqs attached to
  124. * a qp may be locked, with the cq with the lower cqn locked first.
  125. * No other nesting should be done.
  126. *
  127. * Each struct mthca_cq/qp also has an ref count, protected by the
  128. * corresponding table lock. The pointer from the cq/qp_table to the
  129. * struct counts as one reference. This reference also is good for
  130. * access through the consumer API, so modifying the CQ/QP etc doesn't
  131. * need to take another reference. Access to a QP because of a
  132. * completion being polled does not need a reference either.
  133. *
  134. * Finally, each struct mthca_cq/qp has a wait_queue_head_t for the
  135. * destroy function to sleep on.
  136. *
  137. * This means that access from the consumer API requires nothing but
  138. * taking the struct's lock.
  139. *
  140. * Access because of a completion event should go as follows:
  141. * - lock cq/qp_table and look up struct
  142. * - increment ref count in struct
  143. * - drop cq/qp_table lock
  144. * - lock struct, do your thing, and unlock struct
  145. * - decrement ref count; if zero, wake up waiters
  146. *
  147. * To destroy a CQ/QP, we can do the following:
  148. * - lock cq/qp_table
  149. * - remove pointer and decrement ref count
  150. * - unlock cq/qp_table lock
  151. * - wait_event until ref count is zero
  152. *
  153. * It is the consumer's responsibilty to make sure that no QP
  154. * operations (WQE posting or state modification) are pending when a
  155. * QP is destroyed. Also, the consumer must make sure that calls to
  156. * qp_modify are serialized. Similarly, the consumer is responsible
  157. * for ensuring that no CQ resize operations are pending when a CQ
  158. * is destroyed.
  159. *
  160. * Possible optimizations (wait for profile data to see if/where we
  161. * have locks bouncing between CPUs):
  162. * - split cq/qp table lock into n separate (cache-aligned) locks,
  163. * indexed (say) by the page in the table
  164. * - split QP struct lock into three (one for common info, one for the
  165. * send queue and one for the receive queue)
  166. */
  167. struct mthca_cq_buf {
  168. union mthca_buf queue;
  169. struct mthca_mr mr;
  170. int is_direct;
  171. };
  172. struct mthca_cq_resize {
  173. struct mthca_cq_buf buf;
  174. int cqe;
  175. enum {
  176. CQ_RESIZE_ALLOC,
  177. CQ_RESIZE_READY,
  178. CQ_RESIZE_SWAPPED
  179. } state;
  180. };
  181. struct mthca_cq {
  182. struct ib_cq ibcq;
  183. spinlock_t lock;
  184. int refcount;
  185. int cqn;
  186. u32 cons_index;
  187. struct mthca_cq_buf buf;
  188. struct mthca_cq_resize *resize_buf;
  189. int is_kernel;
  190. /* Next fields are Arbel only */
  191. int set_ci_db_index;
  192. __be32 *set_ci_db;
  193. int arm_db_index;
  194. __be32 *arm_db;
  195. int arm_sn;
  196. wait_queue_head_t wait;
  197. struct mutex mutex;
  198. };
  199. struct mthca_srq {
  200. struct ib_srq ibsrq;
  201. spinlock_t lock;
  202. int refcount;
  203. int srqn;
  204. int max;
  205. int max_gs;
  206. int wqe_shift;
  207. int first_free;
  208. int last_free;
  209. u16 counter; /* Arbel only */
  210. int db_index; /* Arbel only */
  211. __be32 *db; /* Arbel only */
  212. void *last;
  213. int is_direct;
  214. u64 *wrid;
  215. union mthca_buf queue;
  216. struct mthca_mr mr;
  217. wait_queue_head_t wait;
  218. struct mutex mutex;
  219. };
  220. struct mthca_wq {
  221. spinlock_t lock;
  222. int max;
  223. unsigned next_ind;
  224. unsigned last_comp;
  225. unsigned head;
  226. unsigned tail;
  227. void *last;
  228. int max_gs;
  229. int wqe_shift;
  230. int db_index; /* Arbel only */
  231. __be32 *db;
  232. };
  233. struct mthca_qp {
  234. struct ib_qp ibqp;
  235. int refcount;
  236. u32 qpn;
  237. int is_direct;
  238. u8 port; /* for SQP and memfree use only */
  239. u8 alt_port; /* for memfree use only */
  240. u8 transport;
  241. u8 state;
  242. u8 atomic_rd_en;
  243. u8 resp_depth;
  244. struct mthca_mr mr;
  245. struct mthca_wq rq;
  246. struct mthca_wq sq;
  247. enum ib_sig_type sq_policy;
  248. int send_wqe_offset;
  249. int max_inline_data;
  250. u64 *wrid;
  251. union mthca_buf queue;
  252. wait_queue_head_t wait;
  253. struct mutex mutex;
  254. };
  255. struct mthca_sqp {
  256. struct mthca_qp qp;
  257. int pkey_index;
  258. u32 qkey;
  259. u32 send_psn;
  260. struct ib_ud_header ud_header;
  261. int header_buf_size;
  262. void *header_buf;
  263. dma_addr_t header_dma;
  264. };
  265. static inline struct mthca_ucontext *to_mucontext(struct ib_ucontext *ibucontext)
  266. {
  267. return container_of(ibucontext, struct mthca_ucontext, ibucontext);
  268. }
  269. static inline struct mthca_fmr *to_mfmr(struct ib_fmr *ibmr)
  270. {
  271. return container_of(ibmr, struct mthca_fmr, ibmr);
  272. }
  273. static inline struct mthca_mr *to_mmr(struct ib_mr *ibmr)
  274. {
  275. return container_of(ibmr, struct mthca_mr, ibmr);
  276. }
  277. static inline struct mthca_pd *to_mpd(struct ib_pd *ibpd)
  278. {
  279. return container_of(ibpd, struct mthca_pd, ibpd);
  280. }
  281. static inline struct mthca_ah *to_mah(struct ib_ah *ibah)
  282. {
  283. return container_of(ibah, struct mthca_ah, ibah);
  284. }
  285. static inline struct mthca_cq *to_mcq(struct ib_cq *ibcq)
  286. {
  287. return container_of(ibcq, struct mthca_cq, ibcq);
  288. }
  289. static inline struct mthca_srq *to_msrq(struct ib_srq *ibsrq)
  290. {
  291. return container_of(ibsrq, struct mthca_srq, ibsrq);
  292. }
  293. static inline struct mthca_qp *to_mqp(struct ib_qp *ibqp)
  294. {
  295. return container_of(ibqp, struct mthca_qp, ibqp);
  296. }
  297. static inline struct mthca_sqp *to_msqp(struct mthca_qp *qp)
  298. {
  299. return container_of(qp, struct mthca_sqp, qp);
  300. }
  301. #endif /* MTHCA_PROVIDER_H */