mthca_cq.c 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875
  1. /*
  2. * Copyright (c) 2004, 2005 Topspin Communications. All rights reserved.
  3. * Copyright (c) 2005 Sun Microsystems, Inc. All rights reserved.
  4. * Copyright (c) 2005 Cisco Systems, Inc. All rights reserved.
  5. * Copyright (c) 2005 Mellanox Technologies. All rights reserved.
  6. * Copyright (c) 2004 Voltaire, Inc. All rights reserved.
  7. *
  8. * This software is available to you under a choice of one of two
  9. * licenses. You may choose to be licensed under the terms of the GNU
  10. * General Public License (GPL) Version 2, available from the file
  11. * COPYING in the main directory of this source tree, or the
  12. * OpenIB.org BSD license below:
  13. *
  14. * Redistribution and use in source and binary forms, with or
  15. * without modification, are permitted provided that the following
  16. * conditions are met:
  17. *
  18. * - Redistributions of source code must retain the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer.
  21. *
  22. * - Redistributions in binary form must reproduce the above
  23. * copyright notice, this list of conditions and the following
  24. * disclaimer in the documentation and/or other materials
  25. * provided with the distribution.
  26. *
  27. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  28. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  29. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  30. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  31. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  32. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  33. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  34. * SOFTWARE.
  35. *
  36. * $Id: mthca_cq.c 1369 2004-12-20 16:17:07Z roland $
  37. */
  38. #include <linux/init.h>
  39. #include <linux/hardirq.h>
  40. #include <rdma/ib_pack.h>
  41. #include "mthca_dev.h"
  42. #include "mthca_cmd.h"
  43. #include "mthca_memfree.h"
  44. enum {
  45. MTHCA_MAX_DIRECT_CQ_SIZE = 4 * PAGE_SIZE
  46. };
  47. enum {
  48. MTHCA_CQ_ENTRY_SIZE = 0x20
  49. };
  50. /*
  51. * Must be packed because start is 64 bits but only aligned to 32 bits.
  52. */
  53. struct mthca_cq_context {
  54. __be32 flags;
  55. __be64 start;
  56. __be32 logsize_usrpage;
  57. __be32 error_eqn; /* Tavor only */
  58. __be32 comp_eqn;
  59. __be32 pd;
  60. __be32 lkey;
  61. __be32 last_notified_index;
  62. __be32 solicit_producer_index;
  63. __be32 consumer_index;
  64. __be32 producer_index;
  65. __be32 cqn;
  66. __be32 ci_db; /* Arbel only */
  67. __be32 state_db; /* Arbel only */
  68. u32 reserved;
  69. } __attribute__((packed));
  70. #define MTHCA_CQ_STATUS_OK ( 0 << 28)
  71. #define MTHCA_CQ_STATUS_OVERFLOW ( 9 << 28)
  72. #define MTHCA_CQ_STATUS_WRITE_FAIL (10 << 28)
  73. #define MTHCA_CQ_FLAG_TR ( 1 << 18)
  74. #define MTHCA_CQ_FLAG_OI ( 1 << 17)
  75. #define MTHCA_CQ_STATE_DISARMED ( 0 << 8)
  76. #define MTHCA_CQ_STATE_ARMED ( 1 << 8)
  77. #define MTHCA_CQ_STATE_ARMED_SOL ( 4 << 8)
  78. #define MTHCA_EQ_STATE_FIRED (10 << 8)
  79. enum {
  80. MTHCA_ERROR_CQE_OPCODE_MASK = 0xfe
  81. };
  82. enum {
  83. SYNDROME_LOCAL_LENGTH_ERR = 0x01,
  84. SYNDROME_LOCAL_QP_OP_ERR = 0x02,
  85. SYNDROME_LOCAL_EEC_OP_ERR = 0x03,
  86. SYNDROME_LOCAL_PROT_ERR = 0x04,
  87. SYNDROME_WR_FLUSH_ERR = 0x05,
  88. SYNDROME_MW_BIND_ERR = 0x06,
  89. SYNDROME_BAD_RESP_ERR = 0x10,
  90. SYNDROME_LOCAL_ACCESS_ERR = 0x11,
  91. SYNDROME_REMOTE_INVAL_REQ_ERR = 0x12,
  92. SYNDROME_REMOTE_ACCESS_ERR = 0x13,
  93. SYNDROME_REMOTE_OP_ERR = 0x14,
  94. SYNDROME_RETRY_EXC_ERR = 0x15,
  95. SYNDROME_RNR_RETRY_EXC_ERR = 0x16,
  96. SYNDROME_LOCAL_RDD_VIOL_ERR = 0x20,
  97. SYNDROME_REMOTE_INVAL_RD_REQ_ERR = 0x21,
  98. SYNDROME_REMOTE_ABORTED_ERR = 0x22,
  99. SYNDROME_INVAL_EECN_ERR = 0x23,
  100. SYNDROME_INVAL_EEC_STATE_ERR = 0x24
  101. };
  102. struct mthca_cqe {
  103. __be32 my_qpn;
  104. __be32 my_ee;
  105. __be32 rqpn;
  106. __be16 sl_g_mlpath;
  107. __be16 rlid;
  108. __be32 imm_etype_pkey_eec;
  109. __be32 byte_cnt;
  110. __be32 wqe;
  111. u8 opcode;
  112. u8 is_send;
  113. u8 reserved;
  114. u8 owner;
  115. };
  116. struct mthca_err_cqe {
  117. __be32 my_qpn;
  118. u32 reserved1[3];
  119. u8 syndrome;
  120. u8 reserved2;
  121. __be16 db_cnt;
  122. u32 reserved3;
  123. __be32 wqe;
  124. u8 opcode;
  125. u8 reserved4[2];
  126. u8 owner;
  127. };
  128. #define MTHCA_CQ_ENTRY_OWNER_SW (0 << 7)
  129. #define MTHCA_CQ_ENTRY_OWNER_HW (1 << 7)
  130. #define MTHCA_TAVOR_CQ_DB_INC_CI (1 << 24)
  131. #define MTHCA_TAVOR_CQ_DB_REQ_NOT (2 << 24)
  132. #define MTHCA_TAVOR_CQ_DB_REQ_NOT_SOL (3 << 24)
  133. #define MTHCA_TAVOR_CQ_DB_SET_CI (4 << 24)
  134. #define MTHCA_TAVOR_CQ_DB_REQ_NOT_MULT (5 << 24)
  135. #define MTHCA_ARBEL_CQ_DB_REQ_NOT_SOL (1 << 24)
  136. #define MTHCA_ARBEL_CQ_DB_REQ_NOT (2 << 24)
  137. #define MTHCA_ARBEL_CQ_DB_REQ_NOT_MULT (3 << 24)
  138. static inline struct mthca_cqe *get_cqe(struct mthca_cq *cq, int entry)
  139. {
  140. if (cq->is_direct)
  141. return cq->queue.direct.buf + (entry * MTHCA_CQ_ENTRY_SIZE);
  142. else
  143. return cq->queue.page_list[entry * MTHCA_CQ_ENTRY_SIZE / PAGE_SIZE].buf
  144. + (entry * MTHCA_CQ_ENTRY_SIZE) % PAGE_SIZE;
  145. }
  146. static inline struct mthca_cqe *cqe_sw(struct mthca_cq *cq, int i)
  147. {
  148. struct mthca_cqe *cqe = get_cqe(cq, i);
  149. return MTHCA_CQ_ENTRY_OWNER_HW & cqe->owner ? NULL : cqe;
  150. }
  151. static inline struct mthca_cqe *next_cqe_sw(struct mthca_cq *cq)
  152. {
  153. return cqe_sw(cq, cq->cons_index & cq->ibcq.cqe);
  154. }
  155. static inline void set_cqe_hw(struct mthca_cqe *cqe)
  156. {
  157. cqe->owner = MTHCA_CQ_ENTRY_OWNER_HW;
  158. }
  159. static void dump_cqe(struct mthca_dev *dev, void *cqe_ptr)
  160. {
  161. __be32 *cqe = cqe_ptr;
  162. (void) cqe; /* avoid warning if mthca_dbg compiled away... */
  163. mthca_dbg(dev, "CQE contents %08x %08x %08x %08x %08x %08x %08x %08x\n",
  164. be32_to_cpu(cqe[0]), be32_to_cpu(cqe[1]), be32_to_cpu(cqe[2]),
  165. be32_to_cpu(cqe[3]), be32_to_cpu(cqe[4]), be32_to_cpu(cqe[5]),
  166. be32_to_cpu(cqe[6]), be32_to_cpu(cqe[7]));
  167. }
  168. /*
  169. * incr is ignored in native Arbel (mem-free) mode, so cq->cons_index
  170. * should be correct before calling update_cons_index().
  171. */
  172. static inline void update_cons_index(struct mthca_dev *dev, struct mthca_cq *cq,
  173. int incr)
  174. {
  175. __be32 doorbell[2];
  176. if (mthca_is_memfree(dev)) {
  177. *cq->set_ci_db = cpu_to_be32(cq->cons_index);
  178. wmb();
  179. } else {
  180. doorbell[0] = cpu_to_be32(MTHCA_TAVOR_CQ_DB_INC_CI | cq->cqn);
  181. doorbell[1] = cpu_to_be32(incr - 1);
  182. mthca_write64(doorbell,
  183. dev->kar + MTHCA_CQ_DOORBELL,
  184. MTHCA_GET_DOORBELL_LOCK(&dev->doorbell_lock));
  185. }
  186. }
  187. void mthca_cq_event(struct mthca_dev *dev, u32 cqn)
  188. {
  189. struct mthca_cq *cq;
  190. cq = mthca_array_get(&dev->cq_table.cq, cqn & (dev->limits.num_cqs - 1));
  191. if (!cq) {
  192. mthca_warn(dev, "Completion event for bogus CQ %08x\n", cqn);
  193. return;
  194. }
  195. ++cq->arm_sn;
  196. cq->ibcq.comp_handler(&cq->ibcq, cq->ibcq.cq_context);
  197. }
  198. void mthca_cq_clean(struct mthca_dev *dev, u32 cqn, u32 qpn,
  199. struct mthca_srq *srq)
  200. {
  201. struct mthca_cq *cq;
  202. struct mthca_cqe *cqe;
  203. int prod_index;
  204. int nfreed = 0;
  205. spin_lock_irq(&dev->cq_table.lock);
  206. cq = mthca_array_get(&dev->cq_table.cq, cqn & (dev->limits.num_cqs - 1));
  207. if (cq)
  208. atomic_inc(&cq->refcount);
  209. spin_unlock_irq(&dev->cq_table.lock);
  210. if (!cq)
  211. return;
  212. spin_lock_irq(&cq->lock);
  213. /*
  214. * First we need to find the current producer index, so we
  215. * know where to start cleaning from. It doesn't matter if HW
  216. * adds new entries after this loop -- the QP we're worried
  217. * about is already in RESET, so the new entries won't come
  218. * from our QP and therefore don't need to be checked.
  219. */
  220. for (prod_index = cq->cons_index;
  221. cqe_sw(cq, prod_index & cq->ibcq.cqe);
  222. ++prod_index)
  223. if (prod_index == cq->cons_index + cq->ibcq.cqe)
  224. break;
  225. if (0)
  226. mthca_dbg(dev, "Cleaning QPN %06x from CQN %06x; ci %d, pi %d\n",
  227. qpn, cqn, cq->cons_index, prod_index);
  228. /*
  229. * Now sweep backwards through the CQ, removing CQ entries
  230. * that match our QP by copying older entries on top of them.
  231. */
  232. while (prod_index > cq->cons_index) {
  233. cqe = get_cqe(cq, (prod_index - 1) & cq->ibcq.cqe);
  234. if (cqe->my_qpn == cpu_to_be32(qpn)) {
  235. if (srq)
  236. mthca_free_srq_wqe(srq, be32_to_cpu(cqe->wqe));
  237. ++nfreed;
  238. }
  239. else if (nfreed)
  240. memcpy(get_cqe(cq, (prod_index - 1 + nfreed) &
  241. cq->ibcq.cqe),
  242. cqe,
  243. MTHCA_CQ_ENTRY_SIZE);
  244. --prod_index;
  245. }
  246. if (nfreed) {
  247. wmb();
  248. cq->cons_index += nfreed;
  249. update_cons_index(dev, cq, nfreed);
  250. }
  251. spin_unlock_irq(&cq->lock);
  252. if (atomic_dec_and_test(&cq->refcount))
  253. wake_up(&cq->wait);
  254. }
  255. static int handle_error_cqe(struct mthca_dev *dev, struct mthca_cq *cq,
  256. struct mthca_qp *qp, int wqe_index, int is_send,
  257. struct mthca_err_cqe *cqe,
  258. struct ib_wc *entry, int *free_cqe)
  259. {
  260. int err;
  261. int dbd;
  262. __be32 new_wqe;
  263. if (cqe->syndrome == SYNDROME_LOCAL_QP_OP_ERR) {
  264. mthca_dbg(dev, "local QP operation err "
  265. "(QPN %06x, WQE @ %08x, CQN %06x, index %d)\n",
  266. be32_to_cpu(cqe->my_qpn), be32_to_cpu(cqe->wqe),
  267. cq->cqn, cq->cons_index);
  268. dump_cqe(dev, cqe);
  269. }
  270. /*
  271. * For completions in error, only work request ID, status (and
  272. * freed resource count for RD) have to be set.
  273. */
  274. switch (cqe->syndrome) {
  275. case SYNDROME_LOCAL_LENGTH_ERR:
  276. entry->status = IB_WC_LOC_LEN_ERR;
  277. break;
  278. case SYNDROME_LOCAL_QP_OP_ERR:
  279. entry->status = IB_WC_LOC_QP_OP_ERR;
  280. break;
  281. case SYNDROME_LOCAL_EEC_OP_ERR:
  282. entry->status = IB_WC_LOC_EEC_OP_ERR;
  283. break;
  284. case SYNDROME_LOCAL_PROT_ERR:
  285. entry->status = IB_WC_LOC_PROT_ERR;
  286. break;
  287. case SYNDROME_WR_FLUSH_ERR:
  288. entry->status = IB_WC_WR_FLUSH_ERR;
  289. break;
  290. case SYNDROME_MW_BIND_ERR:
  291. entry->status = IB_WC_MW_BIND_ERR;
  292. break;
  293. case SYNDROME_BAD_RESP_ERR:
  294. entry->status = IB_WC_BAD_RESP_ERR;
  295. break;
  296. case SYNDROME_LOCAL_ACCESS_ERR:
  297. entry->status = IB_WC_LOC_ACCESS_ERR;
  298. break;
  299. case SYNDROME_REMOTE_INVAL_REQ_ERR:
  300. entry->status = IB_WC_REM_INV_REQ_ERR;
  301. break;
  302. case SYNDROME_REMOTE_ACCESS_ERR:
  303. entry->status = IB_WC_REM_ACCESS_ERR;
  304. break;
  305. case SYNDROME_REMOTE_OP_ERR:
  306. entry->status = IB_WC_REM_OP_ERR;
  307. break;
  308. case SYNDROME_RETRY_EXC_ERR:
  309. entry->status = IB_WC_RETRY_EXC_ERR;
  310. break;
  311. case SYNDROME_RNR_RETRY_EXC_ERR:
  312. entry->status = IB_WC_RNR_RETRY_EXC_ERR;
  313. break;
  314. case SYNDROME_LOCAL_RDD_VIOL_ERR:
  315. entry->status = IB_WC_LOC_RDD_VIOL_ERR;
  316. break;
  317. case SYNDROME_REMOTE_INVAL_RD_REQ_ERR:
  318. entry->status = IB_WC_REM_INV_RD_REQ_ERR;
  319. break;
  320. case SYNDROME_REMOTE_ABORTED_ERR:
  321. entry->status = IB_WC_REM_ABORT_ERR;
  322. break;
  323. case SYNDROME_INVAL_EECN_ERR:
  324. entry->status = IB_WC_INV_EECN_ERR;
  325. break;
  326. case SYNDROME_INVAL_EEC_STATE_ERR:
  327. entry->status = IB_WC_INV_EEC_STATE_ERR;
  328. break;
  329. default:
  330. entry->status = IB_WC_GENERAL_ERR;
  331. break;
  332. }
  333. /*
  334. * Mem-free HCAs always generate one CQE per WQE, even in the
  335. * error case, so we don't have to check the doorbell count, etc.
  336. */
  337. if (mthca_is_memfree(dev))
  338. return 0;
  339. err = mthca_free_err_wqe(dev, qp, is_send, wqe_index, &dbd, &new_wqe);
  340. if (err)
  341. return err;
  342. /*
  343. * If we're at the end of the WQE chain, or we've used up our
  344. * doorbell count, free the CQE. Otherwise just update it for
  345. * the next poll operation.
  346. */
  347. if (!(new_wqe & cpu_to_be32(0x3f)) || (!cqe->db_cnt && dbd))
  348. return 0;
  349. cqe->db_cnt = cpu_to_be16(be16_to_cpu(cqe->db_cnt) - dbd);
  350. cqe->wqe = new_wqe;
  351. cqe->syndrome = SYNDROME_WR_FLUSH_ERR;
  352. *free_cqe = 0;
  353. return 0;
  354. }
  355. static inline int mthca_poll_one(struct mthca_dev *dev,
  356. struct mthca_cq *cq,
  357. struct mthca_qp **cur_qp,
  358. int *freed,
  359. struct ib_wc *entry)
  360. {
  361. struct mthca_wq *wq;
  362. struct mthca_cqe *cqe;
  363. int wqe_index;
  364. int is_error;
  365. int is_send;
  366. int free_cqe = 1;
  367. int err = 0;
  368. cqe = next_cqe_sw(cq);
  369. if (!cqe)
  370. return -EAGAIN;
  371. /*
  372. * Make sure we read CQ entry contents after we've checked the
  373. * ownership bit.
  374. */
  375. rmb();
  376. if (0) {
  377. mthca_dbg(dev, "%x/%d: CQE -> QPN %06x, WQE @ %08x\n",
  378. cq->cqn, cq->cons_index, be32_to_cpu(cqe->my_qpn),
  379. be32_to_cpu(cqe->wqe));
  380. dump_cqe(dev, cqe);
  381. }
  382. is_error = (cqe->opcode & MTHCA_ERROR_CQE_OPCODE_MASK) ==
  383. MTHCA_ERROR_CQE_OPCODE_MASK;
  384. is_send = is_error ? cqe->opcode & 0x01 : cqe->is_send & 0x80;
  385. if (!*cur_qp || be32_to_cpu(cqe->my_qpn) != (*cur_qp)->qpn) {
  386. /*
  387. * We do not have to take the QP table lock here,
  388. * because CQs will be locked while QPs are removed
  389. * from the table.
  390. */
  391. *cur_qp = mthca_array_get(&dev->qp_table.qp,
  392. be32_to_cpu(cqe->my_qpn) &
  393. (dev->limits.num_qps - 1));
  394. if (!*cur_qp) {
  395. mthca_warn(dev, "CQ entry for unknown QP %06x\n",
  396. be32_to_cpu(cqe->my_qpn) & 0xffffff);
  397. err = -EINVAL;
  398. goto out;
  399. }
  400. }
  401. entry->qp_num = (*cur_qp)->qpn;
  402. if (is_send) {
  403. wq = &(*cur_qp)->sq;
  404. wqe_index = ((be32_to_cpu(cqe->wqe) - (*cur_qp)->send_wqe_offset)
  405. >> wq->wqe_shift);
  406. entry->wr_id = (*cur_qp)->wrid[wqe_index +
  407. (*cur_qp)->rq.max];
  408. } else if ((*cur_qp)->ibqp.srq) {
  409. struct mthca_srq *srq = to_msrq((*cur_qp)->ibqp.srq);
  410. u32 wqe = be32_to_cpu(cqe->wqe);
  411. wq = NULL;
  412. wqe_index = wqe >> srq->wqe_shift;
  413. entry->wr_id = srq->wrid[wqe_index];
  414. mthca_free_srq_wqe(srq, wqe);
  415. } else {
  416. wq = &(*cur_qp)->rq;
  417. wqe_index = be32_to_cpu(cqe->wqe) >> wq->wqe_shift;
  418. entry->wr_id = (*cur_qp)->wrid[wqe_index];
  419. }
  420. if (wq) {
  421. if (wq->last_comp < wqe_index)
  422. wq->tail += wqe_index - wq->last_comp;
  423. else
  424. wq->tail += wqe_index + wq->max - wq->last_comp;
  425. wq->last_comp = wqe_index;
  426. }
  427. if (is_error) {
  428. err = handle_error_cqe(dev, cq, *cur_qp, wqe_index, is_send,
  429. (struct mthca_err_cqe *) cqe,
  430. entry, &free_cqe);
  431. goto out;
  432. }
  433. if (is_send) {
  434. entry->wc_flags = 0;
  435. switch (cqe->opcode) {
  436. case MTHCA_OPCODE_RDMA_WRITE:
  437. entry->opcode = IB_WC_RDMA_WRITE;
  438. break;
  439. case MTHCA_OPCODE_RDMA_WRITE_IMM:
  440. entry->opcode = IB_WC_RDMA_WRITE;
  441. entry->wc_flags |= IB_WC_WITH_IMM;
  442. break;
  443. case MTHCA_OPCODE_SEND:
  444. entry->opcode = IB_WC_SEND;
  445. break;
  446. case MTHCA_OPCODE_SEND_IMM:
  447. entry->opcode = IB_WC_SEND;
  448. entry->wc_flags |= IB_WC_WITH_IMM;
  449. break;
  450. case MTHCA_OPCODE_RDMA_READ:
  451. entry->opcode = IB_WC_RDMA_READ;
  452. entry->byte_len = be32_to_cpu(cqe->byte_cnt);
  453. break;
  454. case MTHCA_OPCODE_ATOMIC_CS:
  455. entry->opcode = IB_WC_COMP_SWAP;
  456. entry->byte_len = be32_to_cpu(cqe->byte_cnt);
  457. break;
  458. case MTHCA_OPCODE_ATOMIC_FA:
  459. entry->opcode = IB_WC_FETCH_ADD;
  460. entry->byte_len = be32_to_cpu(cqe->byte_cnt);
  461. break;
  462. case MTHCA_OPCODE_BIND_MW:
  463. entry->opcode = IB_WC_BIND_MW;
  464. break;
  465. default:
  466. entry->opcode = MTHCA_OPCODE_INVALID;
  467. break;
  468. }
  469. } else {
  470. entry->byte_len = be32_to_cpu(cqe->byte_cnt);
  471. switch (cqe->opcode & 0x1f) {
  472. case IB_OPCODE_SEND_LAST_WITH_IMMEDIATE:
  473. case IB_OPCODE_SEND_ONLY_WITH_IMMEDIATE:
  474. entry->wc_flags = IB_WC_WITH_IMM;
  475. entry->imm_data = cqe->imm_etype_pkey_eec;
  476. entry->opcode = IB_WC_RECV;
  477. break;
  478. case IB_OPCODE_RDMA_WRITE_LAST_WITH_IMMEDIATE:
  479. case IB_OPCODE_RDMA_WRITE_ONLY_WITH_IMMEDIATE:
  480. entry->wc_flags = IB_WC_WITH_IMM;
  481. entry->imm_data = cqe->imm_etype_pkey_eec;
  482. entry->opcode = IB_WC_RECV_RDMA_WITH_IMM;
  483. break;
  484. default:
  485. entry->wc_flags = 0;
  486. entry->opcode = IB_WC_RECV;
  487. break;
  488. }
  489. entry->slid = be16_to_cpu(cqe->rlid);
  490. entry->sl = be16_to_cpu(cqe->sl_g_mlpath) >> 12;
  491. entry->src_qp = be32_to_cpu(cqe->rqpn) & 0xffffff;
  492. entry->dlid_path_bits = be16_to_cpu(cqe->sl_g_mlpath) & 0x7f;
  493. entry->pkey_index = be32_to_cpu(cqe->imm_etype_pkey_eec) >> 16;
  494. entry->wc_flags |= be16_to_cpu(cqe->sl_g_mlpath) & 0x80 ?
  495. IB_WC_GRH : 0;
  496. }
  497. entry->status = IB_WC_SUCCESS;
  498. out:
  499. if (likely(free_cqe)) {
  500. set_cqe_hw(cqe);
  501. ++(*freed);
  502. ++cq->cons_index;
  503. }
  504. return err;
  505. }
  506. int mthca_poll_cq(struct ib_cq *ibcq, int num_entries,
  507. struct ib_wc *entry)
  508. {
  509. struct mthca_dev *dev = to_mdev(ibcq->device);
  510. struct mthca_cq *cq = to_mcq(ibcq);
  511. struct mthca_qp *qp = NULL;
  512. unsigned long flags;
  513. int err = 0;
  514. int freed = 0;
  515. int npolled;
  516. spin_lock_irqsave(&cq->lock, flags);
  517. for (npolled = 0; npolled < num_entries; ++npolled) {
  518. err = mthca_poll_one(dev, cq, &qp,
  519. &freed, entry + npolled);
  520. if (err)
  521. break;
  522. }
  523. if (freed) {
  524. wmb();
  525. update_cons_index(dev, cq, freed);
  526. }
  527. spin_unlock_irqrestore(&cq->lock, flags);
  528. return err == 0 || err == -EAGAIN ? npolled : err;
  529. }
  530. int mthca_tavor_arm_cq(struct ib_cq *cq, enum ib_cq_notify notify)
  531. {
  532. __be32 doorbell[2];
  533. doorbell[0] = cpu_to_be32((notify == IB_CQ_SOLICITED ?
  534. MTHCA_TAVOR_CQ_DB_REQ_NOT_SOL :
  535. MTHCA_TAVOR_CQ_DB_REQ_NOT) |
  536. to_mcq(cq)->cqn);
  537. doorbell[1] = (__force __be32) 0xffffffff;
  538. mthca_write64(doorbell,
  539. to_mdev(cq->device)->kar + MTHCA_CQ_DOORBELL,
  540. MTHCA_GET_DOORBELL_LOCK(&to_mdev(cq->device)->doorbell_lock));
  541. return 0;
  542. }
  543. int mthca_arbel_arm_cq(struct ib_cq *ibcq, enum ib_cq_notify notify)
  544. {
  545. struct mthca_cq *cq = to_mcq(ibcq);
  546. __be32 doorbell[2];
  547. u32 sn;
  548. __be32 ci;
  549. sn = cq->arm_sn & 3;
  550. ci = cpu_to_be32(cq->cons_index);
  551. doorbell[0] = ci;
  552. doorbell[1] = cpu_to_be32((cq->cqn << 8) | (2 << 5) | (sn << 3) |
  553. (notify == IB_CQ_SOLICITED ? 1 : 2));
  554. mthca_write_db_rec(doorbell, cq->arm_db);
  555. /*
  556. * Make sure that the doorbell record in host memory is
  557. * written before ringing the doorbell via PCI MMIO.
  558. */
  559. wmb();
  560. doorbell[0] = cpu_to_be32((sn << 28) |
  561. (notify == IB_CQ_SOLICITED ?
  562. MTHCA_ARBEL_CQ_DB_REQ_NOT_SOL :
  563. MTHCA_ARBEL_CQ_DB_REQ_NOT) |
  564. cq->cqn);
  565. doorbell[1] = ci;
  566. mthca_write64(doorbell,
  567. to_mdev(ibcq->device)->kar + MTHCA_CQ_DOORBELL,
  568. MTHCA_GET_DOORBELL_LOCK(&to_mdev(ibcq->device)->doorbell_lock));
  569. return 0;
  570. }
  571. static void mthca_free_cq_buf(struct mthca_dev *dev, struct mthca_cq *cq)
  572. {
  573. mthca_buf_free(dev, (cq->ibcq.cqe + 1) * MTHCA_CQ_ENTRY_SIZE,
  574. &cq->queue, cq->is_direct, &cq->mr);
  575. }
  576. int mthca_init_cq(struct mthca_dev *dev, int nent,
  577. struct mthca_ucontext *ctx, u32 pdn,
  578. struct mthca_cq *cq)
  579. {
  580. int size = nent * MTHCA_CQ_ENTRY_SIZE;
  581. struct mthca_mailbox *mailbox;
  582. struct mthca_cq_context *cq_context;
  583. int err = -ENOMEM;
  584. u8 status;
  585. int i;
  586. might_sleep();
  587. cq->ibcq.cqe = nent - 1;
  588. cq->is_kernel = !ctx;
  589. cq->cqn = mthca_alloc(&dev->cq_table.alloc);
  590. if (cq->cqn == -1)
  591. return -ENOMEM;
  592. if (mthca_is_memfree(dev)) {
  593. err = mthca_table_get(dev, dev->cq_table.table, cq->cqn);
  594. if (err)
  595. goto err_out;
  596. if (cq->is_kernel) {
  597. cq->arm_sn = 1;
  598. err = -ENOMEM;
  599. cq->set_ci_db_index = mthca_alloc_db(dev, MTHCA_DB_TYPE_CQ_SET_CI,
  600. cq->cqn, &cq->set_ci_db);
  601. if (cq->set_ci_db_index < 0)
  602. goto err_out_icm;
  603. cq->arm_db_index = mthca_alloc_db(dev, MTHCA_DB_TYPE_CQ_ARM,
  604. cq->cqn, &cq->arm_db);
  605. if (cq->arm_db_index < 0)
  606. goto err_out_ci;
  607. }
  608. }
  609. mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
  610. if (IS_ERR(mailbox))
  611. goto err_out_arm;
  612. cq_context = mailbox->buf;
  613. if (cq->is_kernel) {
  614. err = mthca_buf_alloc(dev, size, MTHCA_MAX_DIRECT_CQ_SIZE,
  615. &cq->queue, &cq->is_direct,
  616. &dev->driver_pd, 1, &cq->mr);
  617. if (err)
  618. goto err_out_mailbox;
  619. for (i = 0; i < nent; ++i)
  620. set_cqe_hw(get_cqe(cq, i));
  621. }
  622. spin_lock_init(&cq->lock);
  623. atomic_set(&cq->refcount, 1);
  624. init_waitqueue_head(&cq->wait);
  625. memset(cq_context, 0, sizeof *cq_context);
  626. cq_context->flags = cpu_to_be32(MTHCA_CQ_STATUS_OK |
  627. MTHCA_CQ_STATE_DISARMED |
  628. MTHCA_CQ_FLAG_TR);
  629. cq_context->logsize_usrpage = cpu_to_be32((ffs(nent) - 1) << 24);
  630. if (ctx)
  631. cq_context->logsize_usrpage |= cpu_to_be32(ctx->uar.index);
  632. else
  633. cq_context->logsize_usrpage |= cpu_to_be32(dev->driver_uar.index);
  634. cq_context->error_eqn = cpu_to_be32(dev->eq_table.eq[MTHCA_EQ_ASYNC].eqn);
  635. cq_context->comp_eqn = cpu_to_be32(dev->eq_table.eq[MTHCA_EQ_COMP].eqn);
  636. cq_context->pd = cpu_to_be32(pdn);
  637. cq_context->lkey = cpu_to_be32(cq->mr.ibmr.lkey);
  638. cq_context->cqn = cpu_to_be32(cq->cqn);
  639. if (mthca_is_memfree(dev)) {
  640. cq_context->ci_db = cpu_to_be32(cq->set_ci_db_index);
  641. cq_context->state_db = cpu_to_be32(cq->arm_db_index);
  642. }
  643. err = mthca_SW2HW_CQ(dev, mailbox, cq->cqn, &status);
  644. if (err) {
  645. mthca_warn(dev, "SW2HW_CQ failed (%d)\n", err);
  646. goto err_out_free_mr;
  647. }
  648. if (status) {
  649. mthca_warn(dev, "SW2HW_CQ returned status 0x%02x\n",
  650. status);
  651. err = -EINVAL;
  652. goto err_out_free_mr;
  653. }
  654. spin_lock_irq(&dev->cq_table.lock);
  655. if (mthca_array_set(&dev->cq_table.cq,
  656. cq->cqn & (dev->limits.num_cqs - 1),
  657. cq)) {
  658. spin_unlock_irq(&dev->cq_table.lock);
  659. goto err_out_free_mr;
  660. }
  661. spin_unlock_irq(&dev->cq_table.lock);
  662. cq->cons_index = 0;
  663. mthca_free_mailbox(dev, mailbox);
  664. return 0;
  665. err_out_free_mr:
  666. if (cq->is_kernel)
  667. mthca_free_cq_buf(dev, cq);
  668. err_out_mailbox:
  669. mthca_free_mailbox(dev, mailbox);
  670. err_out_arm:
  671. if (cq->is_kernel && mthca_is_memfree(dev))
  672. mthca_free_db(dev, MTHCA_DB_TYPE_CQ_ARM, cq->arm_db_index);
  673. err_out_ci:
  674. if (cq->is_kernel && mthca_is_memfree(dev))
  675. mthca_free_db(dev, MTHCA_DB_TYPE_CQ_SET_CI, cq->set_ci_db_index);
  676. err_out_icm:
  677. mthca_table_put(dev, dev->cq_table.table, cq->cqn);
  678. err_out:
  679. mthca_free(&dev->cq_table.alloc, cq->cqn);
  680. return err;
  681. }
  682. void mthca_free_cq(struct mthca_dev *dev,
  683. struct mthca_cq *cq)
  684. {
  685. struct mthca_mailbox *mailbox;
  686. int err;
  687. u8 status;
  688. might_sleep();
  689. mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
  690. if (IS_ERR(mailbox)) {
  691. mthca_warn(dev, "No memory for mailbox to free CQ.\n");
  692. return;
  693. }
  694. err = mthca_HW2SW_CQ(dev, mailbox, cq->cqn, &status);
  695. if (err)
  696. mthca_warn(dev, "HW2SW_CQ failed (%d)\n", err);
  697. else if (status)
  698. mthca_warn(dev, "HW2SW_CQ returned status 0x%02x\n", status);
  699. if (0) {
  700. __be32 *ctx = mailbox->buf;
  701. int j;
  702. printk(KERN_ERR "context for CQN %x (cons index %x, next sw %d)\n",
  703. cq->cqn, cq->cons_index,
  704. cq->is_kernel ? !!next_cqe_sw(cq) : 0);
  705. for (j = 0; j < 16; ++j)
  706. printk(KERN_ERR "[%2x] %08x\n", j * 4, be32_to_cpu(ctx[j]));
  707. }
  708. spin_lock_irq(&dev->cq_table.lock);
  709. mthca_array_clear(&dev->cq_table.cq,
  710. cq->cqn & (dev->limits.num_cqs - 1));
  711. spin_unlock_irq(&dev->cq_table.lock);
  712. if (dev->mthca_flags & MTHCA_FLAG_MSI_X)
  713. synchronize_irq(dev->eq_table.eq[MTHCA_EQ_COMP].msi_x_vector);
  714. else
  715. synchronize_irq(dev->pdev->irq);
  716. atomic_dec(&cq->refcount);
  717. wait_event(cq->wait, !atomic_read(&cq->refcount));
  718. if (cq->is_kernel) {
  719. mthca_free_cq_buf(dev, cq);
  720. if (mthca_is_memfree(dev)) {
  721. mthca_free_db(dev, MTHCA_DB_TYPE_CQ_ARM, cq->arm_db_index);
  722. mthca_free_db(dev, MTHCA_DB_TYPE_CQ_SET_CI, cq->set_ci_db_index);
  723. }
  724. }
  725. mthca_table_put(dev, dev->cq_table.table, cq->cqn);
  726. mthca_free(&dev->cq_table.alloc, cq->cqn);
  727. mthca_free_mailbox(dev, mailbox);
  728. }
  729. int __devinit mthca_init_cq_table(struct mthca_dev *dev)
  730. {
  731. int err;
  732. spin_lock_init(&dev->cq_table.lock);
  733. err = mthca_alloc_init(&dev->cq_table.alloc,
  734. dev->limits.num_cqs,
  735. (1 << 24) - 1,
  736. dev->limits.reserved_cqs);
  737. if (err)
  738. return err;
  739. err = mthca_array_init(&dev->cq_table.cq,
  740. dev->limits.num_cqs);
  741. if (err)
  742. mthca_alloc_cleanup(&dev->cq_table.alloc);
  743. return err;
  744. }
  745. void __devexit mthca_cleanup_cq_table(struct mthca_dev *dev)
  746. {
  747. mthca_array_cleanup(&dev->cq_table.cq, dev->limits.num_cqs);
  748. mthca_alloc_cleanup(&dev->cq_table.alloc);
  749. }