mthca_cq.c 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991
  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, 2006 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 vendor_err;
  121. __be16 db_cnt;
  122. u32 reserved2;
  123. __be32 wqe;
  124. u8 opcode;
  125. u8 reserved3[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_from_buf(struct mthca_cq_buf *buf,
  139. int entry)
  140. {
  141. if (buf->is_direct)
  142. return buf->queue.direct.buf + (entry * MTHCA_CQ_ENTRY_SIZE);
  143. else
  144. return buf->queue.page_list[entry * MTHCA_CQ_ENTRY_SIZE / PAGE_SIZE].buf
  145. + (entry * MTHCA_CQ_ENTRY_SIZE) % PAGE_SIZE;
  146. }
  147. static inline struct mthca_cqe *get_cqe(struct mthca_cq *cq, int entry)
  148. {
  149. return get_cqe_from_buf(&cq->buf, entry);
  150. }
  151. static inline struct mthca_cqe *cqe_sw(struct mthca_cqe *cqe)
  152. {
  153. return MTHCA_CQ_ENTRY_OWNER_HW & cqe->owner ? NULL : cqe;
  154. }
  155. static inline struct mthca_cqe *next_cqe_sw(struct mthca_cq *cq)
  156. {
  157. return cqe_sw(get_cqe(cq, cq->cons_index & cq->ibcq.cqe));
  158. }
  159. static inline void set_cqe_hw(struct mthca_cqe *cqe)
  160. {
  161. cqe->owner = MTHCA_CQ_ENTRY_OWNER_HW;
  162. }
  163. static void dump_cqe(struct mthca_dev *dev, void *cqe_ptr)
  164. {
  165. __be32 *cqe = cqe_ptr;
  166. (void) cqe; /* avoid warning if mthca_dbg compiled away... */
  167. mthca_dbg(dev, "CQE contents %08x %08x %08x %08x %08x %08x %08x %08x\n",
  168. be32_to_cpu(cqe[0]), be32_to_cpu(cqe[1]), be32_to_cpu(cqe[2]),
  169. be32_to_cpu(cqe[3]), be32_to_cpu(cqe[4]), be32_to_cpu(cqe[5]),
  170. be32_to_cpu(cqe[6]), be32_to_cpu(cqe[7]));
  171. }
  172. /*
  173. * incr is ignored in native Arbel (mem-free) mode, so cq->cons_index
  174. * should be correct before calling update_cons_index().
  175. */
  176. static inline void update_cons_index(struct mthca_dev *dev, struct mthca_cq *cq,
  177. int incr)
  178. {
  179. __be32 doorbell[2];
  180. if (mthca_is_memfree(dev)) {
  181. *cq->set_ci_db = cpu_to_be32(cq->cons_index);
  182. wmb();
  183. } else {
  184. doorbell[0] = cpu_to_be32(MTHCA_TAVOR_CQ_DB_INC_CI | cq->cqn);
  185. doorbell[1] = cpu_to_be32(incr - 1);
  186. mthca_write64(doorbell,
  187. dev->kar + MTHCA_CQ_DOORBELL,
  188. MTHCA_GET_DOORBELL_LOCK(&dev->doorbell_lock));
  189. }
  190. }
  191. void mthca_cq_completion(struct mthca_dev *dev, u32 cqn)
  192. {
  193. struct mthca_cq *cq;
  194. cq = mthca_array_get(&dev->cq_table.cq, cqn & (dev->limits.num_cqs - 1));
  195. if (!cq) {
  196. mthca_warn(dev, "Completion event for bogus CQ %08x\n", cqn);
  197. return;
  198. }
  199. ++cq->arm_sn;
  200. cq->ibcq.comp_handler(&cq->ibcq, cq->ibcq.cq_context);
  201. }
  202. void mthca_cq_event(struct mthca_dev *dev, u32 cqn,
  203. enum ib_event_type event_type)
  204. {
  205. struct mthca_cq *cq;
  206. struct ib_event event;
  207. spin_lock(&dev->cq_table.lock);
  208. cq = mthca_array_get(&dev->cq_table.cq, cqn & (dev->limits.num_cqs - 1));
  209. if (cq)
  210. ++cq->refcount;
  211. spin_unlock(&dev->cq_table.lock);
  212. if (!cq) {
  213. mthca_warn(dev, "Async event for bogus CQ %08x\n", cqn);
  214. return;
  215. }
  216. event.device = &dev->ib_dev;
  217. event.event = event_type;
  218. event.element.cq = &cq->ibcq;
  219. if (cq->ibcq.event_handler)
  220. cq->ibcq.event_handler(&event, cq->ibcq.cq_context);
  221. spin_lock(&dev->cq_table.lock);
  222. if (!--cq->refcount)
  223. wake_up(&cq->wait);
  224. spin_unlock(&dev->cq_table.lock);
  225. }
  226. static inline int is_recv_cqe(struct mthca_cqe *cqe)
  227. {
  228. if ((cqe->opcode & MTHCA_ERROR_CQE_OPCODE_MASK) ==
  229. MTHCA_ERROR_CQE_OPCODE_MASK)
  230. return !(cqe->opcode & 0x01);
  231. else
  232. return !(cqe->is_send & 0x80);
  233. }
  234. void mthca_cq_clean(struct mthca_dev *dev, struct mthca_cq *cq, u32 qpn,
  235. struct mthca_srq *srq)
  236. {
  237. struct mthca_cqe *cqe;
  238. u32 prod_index;
  239. int nfreed = 0;
  240. spin_lock_irq(&cq->lock);
  241. /*
  242. * First we need to find the current producer index, so we
  243. * know where to start cleaning from. It doesn't matter if HW
  244. * adds new entries after this loop -- the QP we're worried
  245. * about is already in RESET, so the new entries won't come
  246. * from our QP and therefore don't need to be checked.
  247. */
  248. for (prod_index = cq->cons_index;
  249. cqe_sw(get_cqe(cq, prod_index & cq->ibcq.cqe));
  250. ++prod_index)
  251. if (prod_index == cq->cons_index + cq->ibcq.cqe)
  252. break;
  253. if (0)
  254. mthca_dbg(dev, "Cleaning QPN %06x from CQN %06x; ci %d, pi %d\n",
  255. qpn, cq->cqn, cq->cons_index, prod_index);
  256. /*
  257. * Now sweep backwards through the CQ, removing CQ entries
  258. * that match our QP by copying older entries on top of them.
  259. */
  260. while ((int) --prod_index - (int) cq->cons_index >= 0) {
  261. cqe = get_cqe(cq, prod_index & cq->ibcq.cqe);
  262. if (cqe->my_qpn == cpu_to_be32(qpn)) {
  263. if (srq && is_recv_cqe(cqe))
  264. mthca_free_srq_wqe(srq, be32_to_cpu(cqe->wqe));
  265. ++nfreed;
  266. } else if (nfreed)
  267. memcpy(get_cqe(cq, (prod_index + nfreed) & cq->ibcq.cqe),
  268. cqe, MTHCA_CQ_ENTRY_SIZE);
  269. }
  270. if (nfreed) {
  271. wmb();
  272. cq->cons_index += nfreed;
  273. update_cons_index(dev, cq, nfreed);
  274. }
  275. spin_unlock_irq(&cq->lock);
  276. }
  277. void mthca_cq_resize_copy_cqes(struct mthca_cq *cq)
  278. {
  279. int i;
  280. /*
  281. * In Tavor mode, the hardware keeps the consumer and producer
  282. * indices mod the CQ size. Since we might be making the CQ
  283. * bigger, we need to deal with the case where the producer
  284. * index wrapped around before the CQ was resized.
  285. */
  286. if (!mthca_is_memfree(to_mdev(cq->ibcq.device)) &&
  287. cq->ibcq.cqe < cq->resize_buf->cqe) {
  288. cq->cons_index &= cq->ibcq.cqe;
  289. if (cqe_sw(get_cqe(cq, cq->ibcq.cqe)))
  290. cq->cons_index -= cq->ibcq.cqe + 1;
  291. }
  292. for (i = cq->cons_index; cqe_sw(get_cqe(cq, i & cq->ibcq.cqe)); ++i)
  293. memcpy(get_cqe_from_buf(&cq->resize_buf->buf,
  294. i & cq->resize_buf->cqe),
  295. get_cqe(cq, i & cq->ibcq.cqe), MTHCA_CQ_ENTRY_SIZE);
  296. }
  297. int mthca_alloc_cq_buf(struct mthca_dev *dev, struct mthca_cq_buf *buf, int nent)
  298. {
  299. int ret;
  300. int i;
  301. ret = mthca_buf_alloc(dev, nent * MTHCA_CQ_ENTRY_SIZE,
  302. MTHCA_MAX_DIRECT_CQ_SIZE,
  303. &buf->queue, &buf->is_direct,
  304. &dev->driver_pd, 1, &buf->mr);
  305. if (ret)
  306. return ret;
  307. for (i = 0; i < nent; ++i)
  308. set_cqe_hw(get_cqe_from_buf(buf, i));
  309. return 0;
  310. }
  311. void mthca_free_cq_buf(struct mthca_dev *dev, struct mthca_cq_buf *buf, int cqe)
  312. {
  313. mthca_buf_free(dev, (cqe + 1) * MTHCA_CQ_ENTRY_SIZE, &buf->queue,
  314. buf->is_direct, &buf->mr);
  315. }
  316. static void handle_error_cqe(struct mthca_dev *dev, struct mthca_cq *cq,
  317. struct mthca_qp *qp, int wqe_index, int is_send,
  318. struct mthca_err_cqe *cqe,
  319. struct ib_wc *entry, int *free_cqe)
  320. {
  321. int dbd;
  322. __be32 new_wqe;
  323. if (cqe->syndrome == SYNDROME_LOCAL_QP_OP_ERR) {
  324. mthca_dbg(dev, "local QP operation err "
  325. "(QPN %06x, WQE @ %08x, CQN %06x, index %d)\n",
  326. be32_to_cpu(cqe->my_qpn), be32_to_cpu(cqe->wqe),
  327. cq->cqn, cq->cons_index);
  328. dump_cqe(dev, cqe);
  329. }
  330. /*
  331. * For completions in error, only work request ID, status, vendor error
  332. * (and freed resource count for RD) have to be set.
  333. */
  334. switch (cqe->syndrome) {
  335. case SYNDROME_LOCAL_LENGTH_ERR:
  336. entry->status = IB_WC_LOC_LEN_ERR;
  337. break;
  338. case SYNDROME_LOCAL_QP_OP_ERR:
  339. entry->status = IB_WC_LOC_QP_OP_ERR;
  340. break;
  341. case SYNDROME_LOCAL_EEC_OP_ERR:
  342. entry->status = IB_WC_LOC_EEC_OP_ERR;
  343. break;
  344. case SYNDROME_LOCAL_PROT_ERR:
  345. entry->status = IB_WC_LOC_PROT_ERR;
  346. break;
  347. case SYNDROME_WR_FLUSH_ERR:
  348. entry->status = IB_WC_WR_FLUSH_ERR;
  349. break;
  350. case SYNDROME_MW_BIND_ERR:
  351. entry->status = IB_WC_MW_BIND_ERR;
  352. break;
  353. case SYNDROME_BAD_RESP_ERR:
  354. entry->status = IB_WC_BAD_RESP_ERR;
  355. break;
  356. case SYNDROME_LOCAL_ACCESS_ERR:
  357. entry->status = IB_WC_LOC_ACCESS_ERR;
  358. break;
  359. case SYNDROME_REMOTE_INVAL_REQ_ERR:
  360. entry->status = IB_WC_REM_INV_REQ_ERR;
  361. break;
  362. case SYNDROME_REMOTE_ACCESS_ERR:
  363. entry->status = IB_WC_REM_ACCESS_ERR;
  364. break;
  365. case SYNDROME_REMOTE_OP_ERR:
  366. entry->status = IB_WC_REM_OP_ERR;
  367. break;
  368. case SYNDROME_RETRY_EXC_ERR:
  369. entry->status = IB_WC_RETRY_EXC_ERR;
  370. break;
  371. case SYNDROME_RNR_RETRY_EXC_ERR:
  372. entry->status = IB_WC_RNR_RETRY_EXC_ERR;
  373. break;
  374. case SYNDROME_LOCAL_RDD_VIOL_ERR:
  375. entry->status = IB_WC_LOC_RDD_VIOL_ERR;
  376. break;
  377. case SYNDROME_REMOTE_INVAL_RD_REQ_ERR:
  378. entry->status = IB_WC_REM_INV_RD_REQ_ERR;
  379. break;
  380. case SYNDROME_REMOTE_ABORTED_ERR:
  381. entry->status = IB_WC_REM_ABORT_ERR;
  382. break;
  383. case SYNDROME_INVAL_EECN_ERR:
  384. entry->status = IB_WC_INV_EECN_ERR;
  385. break;
  386. case SYNDROME_INVAL_EEC_STATE_ERR:
  387. entry->status = IB_WC_INV_EEC_STATE_ERR;
  388. break;
  389. default:
  390. entry->status = IB_WC_GENERAL_ERR;
  391. break;
  392. }
  393. entry->vendor_err = cqe->vendor_err;
  394. /*
  395. * Mem-free HCAs always generate one CQE per WQE, even in the
  396. * error case, so we don't have to check the doorbell count, etc.
  397. */
  398. if (mthca_is_memfree(dev))
  399. return;
  400. mthca_free_err_wqe(dev, qp, is_send, wqe_index, &dbd, &new_wqe);
  401. /*
  402. * If we're at the end of the WQE chain, or we've used up our
  403. * doorbell count, free the CQE. Otherwise just update it for
  404. * the next poll operation.
  405. */
  406. if (!(new_wqe & cpu_to_be32(0x3f)) || (!cqe->db_cnt && dbd))
  407. return;
  408. cqe->db_cnt = cpu_to_be16(be16_to_cpu(cqe->db_cnt) - dbd);
  409. cqe->wqe = new_wqe;
  410. cqe->syndrome = SYNDROME_WR_FLUSH_ERR;
  411. *free_cqe = 0;
  412. }
  413. static inline int mthca_poll_one(struct mthca_dev *dev,
  414. struct mthca_cq *cq,
  415. struct mthca_qp **cur_qp,
  416. int *freed,
  417. struct ib_wc *entry)
  418. {
  419. struct mthca_wq *wq;
  420. struct mthca_cqe *cqe;
  421. int wqe_index;
  422. int is_error;
  423. int is_send;
  424. int free_cqe = 1;
  425. int err = 0;
  426. cqe = next_cqe_sw(cq);
  427. if (!cqe)
  428. return -EAGAIN;
  429. /*
  430. * Make sure we read CQ entry contents after we've checked the
  431. * ownership bit.
  432. */
  433. rmb();
  434. if (0) {
  435. mthca_dbg(dev, "%x/%d: CQE -> QPN %06x, WQE @ %08x\n",
  436. cq->cqn, cq->cons_index, be32_to_cpu(cqe->my_qpn),
  437. be32_to_cpu(cqe->wqe));
  438. dump_cqe(dev, cqe);
  439. }
  440. is_error = (cqe->opcode & MTHCA_ERROR_CQE_OPCODE_MASK) ==
  441. MTHCA_ERROR_CQE_OPCODE_MASK;
  442. is_send = is_error ? cqe->opcode & 0x01 : cqe->is_send & 0x80;
  443. if (!*cur_qp || be32_to_cpu(cqe->my_qpn) != (*cur_qp)->qpn) {
  444. /*
  445. * We do not have to take the QP table lock here,
  446. * because CQs will be locked while QPs are removed
  447. * from the table.
  448. */
  449. *cur_qp = mthca_array_get(&dev->qp_table.qp,
  450. be32_to_cpu(cqe->my_qpn) &
  451. (dev->limits.num_qps - 1));
  452. if (!*cur_qp) {
  453. mthca_warn(dev, "CQ entry for unknown QP %06x\n",
  454. be32_to_cpu(cqe->my_qpn) & 0xffffff);
  455. err = -EINVAL;
  456. goto out;
  457. }
  458. }
  459. entry->qp_num = (*cur_qp)->qpn;
  460. if (is_send) {
  461. wq = &(*cur_qp)->sq;
  462. wqe_index = ((be32_to_cpu(cqe->wqe) - (*cur_qp)->send_wqe_offset)
  463. >> wq->wqe_shift);
  464. entry->wr_id = (*cur_qp)->wrid[wqe_index +
  465. (*cur_qp)->rq.max];
  466. } else if ((*cur_qp)->ibqp.srq) {
  467. struct mthca_srq *srq = to_msrq((*cur_qp)->ibqp.srq);
  468. u32 wqe = be32_to_cpu(cqe->wqe);
  469. wq = NULL;
  470. wqe_index = wqe >> srq->wqe_shift;
  471. entry->wr_id = srq->wrid[wqe_index];
  472. mthca_free_srq_wqe(srq, wqe);
  473. } else {
  474. s32 wqe;
  475. wq = &(*cur_qp)->rq;
  476. wqe = be32_to_cpu(cqe->wqe);
  477. wqe_index = wqe >> wq->wqe_shift;
  478. /*
  479. * WQE addr == base - 1 might be reported in receive completion
  480. * with error instead of (rq size - 1) by Sinai FW 1.0.800 and
  481. * Arbel FW 5.1.400. This bug should be fixed in later FW revs.
  482. */
  483. if (unlikely(wqe_index < 0))
  484. wqe_index = wq->max - 1;
  485. entry->wr_id = (*cur_qp)->wrid[wqe_index];
  486. }
  487. if (wq) {
  488. if (wq->last_comp < wqe_index)
  489. wq->tail += wqe_index - wq->last_comp;
  490. else
  491. wq->tail += wqe_index + wq->max - wq->last_comp;
  492. wq->last_comp = wqe_index;
  493. }
  494. if (is_error) {
  495. handle_error_cqe(dev, cq, *cur_qp, wqe_index, is_send,
  496. (struct mthca_err_cqe *) cqe,
  497. entry, &free_cqe);
  498. goto out;
  499. }
  500. if (is_send) {
  501. entry->wc_flags = 0;
  502. switch (cqe->opcode) {
  503. case MTHCA_OPCODE_RDMA_WRITE:
  504. entry->opcode = IB_WC_RDMA_WRITE;
  505. break;
  506. case MTHCA_OPCODE_RDMA_WRITE_IMM:
  507. entry->opcode = IB_WC_RDMA_WRITE;
  508. entry->wc_flags |= IB_WC_WITH_IMM;
  509. break;
  510. case MTHCA_OPCODE_SEND:
  511. entry->opcode = IB_WC_SEND;
  512. break;
  513. case MTHCA_OPCODE_SEND_IMM:
  514. entry->opcode = IB_WC_SEND;
  515. entry->wc_flags |= IB_WC_WITH_IMM;
  516. break;
  517. case MTHCA_OPCODE_RDMA_READ:
  518. entry->opcode = IB_WC_RDMA_READ;
  519. entry->byte_len = be32_to_cpu(cqe->byte_cnt);
  520. break;
  521. case MTHCA_OPCODE_ATOMIC_CS:
  522. entry->opcode = IB_WC_COMP_SWAP;
  523. entry->byte_len = be32_to_cpu(cqe->byte_cnt);
  524. break;
  525. case MTHCA_OPCODE_ATOMIC_FA:
  526. entry->opcode = IB_WC_FETCH_ADD;
  527. entry->byte_len = be32_to_cpu(cqe->byte_cnt);
  528. break;
  529. case MTHCA_OPCODE_BIND_MW:
  530. entry->opcode = IB_WC_BIND_MW;
  531. break;
  532. default:
  533. entry->opcode = MTHCA_OPCODE_INVALID;
  534. break;
  535. }
  536. } else {
  537. entry->byte_len = be32_to_cpu(cqe->byte_cnt);
  538. switch (cqe->opcode & 0x1f) {
  539. case IB_OPCODE_SEND_LAST_WITH_IMMEDIATE:
  540. case IB_OPCODE_SEND_ONLY_WITH_IMMEDIATE:
  541. entry->wc_flags = IB_WC_WITH_IMM;
  542. entry->imm_data = cqe->imm_etype_pkey_eec;
  543. entry->opcode = IB_WC_RECV;
  544. break;
  545. case IB_OPCODE_RDMA_WRITE_LAST_WITH_IMMEDIATE:
  546. case IB_OPCODE_RDMA_WRITE_ONLY_WITH_IMMEDIATE:
  547. entry->wc_flags = IB_WC_WITH_IMM;
  548. entry->imm_data = cqe->imm_etype_pkey_eec;
  549. entry->opcode = IB_WC_RECV_RDMA_WITH_IMM;
  550. break;
  551. default:
  552. entry->wc_flags = 0;
  553. entry->opcode = IB_WC_RECV;
  554. break;
  555. }
  556. entry->slid = be16_to_cpu(cqe->rlid);
  557. entry->sl = be16_to_cpu(cqe->sl_g_mlpath) >> 12;
  558. entry->src_qp = be32_to_cpu(cqe->rqpn) & 0xffffff;
  559. entry->dlid_path_bits = be16_to_cpu(cqe->sl_g_mlpath) & 0x7f;
  560. entry->pkey_index = be32_to_cpu(cqe->imm_etype_pkey_eec) >> 16;
  561. entry->wc_flags |= be16_to_cpu(cqe->sl_g_mlpath) & 0x80 ?
  562. IB_WC_GRH : 0;
  563. }
  564. entry->status = IB_WC_SUCCESS;
  565. out:
  566. if (likely(free_cqe)) {
  567. set_cqe_hw(cqe);
  568. ++(*freed);
  569. ++cq->cons_index;
  570. }
  571. return err;
  572. }
  573. int mthca_poll_cq(struct ib_cq *ibcq, int num_entries,
  574. struct ib_wc *entry)
  575. {
  576. struct mthca_dev *dev = to_mdev(ibcq->device);
  577. struct mthca_cq *cq = to_mcq(ibcq);
  578. struct mthca_qp *qp = NULL;
  579. unsigned long flags;
  580. int err = 0;
  581. int freed = 0;
  582. int npolled;
  583. spin_lock_irqsave(&cq->lock, flags);
  584. npolled = 0;
  585. repoll:
  586. while (npolled < num_entries) {
  587. err = mthca_poll_one(dev, cq, &qp,
  588. &freed, entry + npolled);
  589. if (err)
  590. break;
  591. ++npolled;
  592. }
  593. if (freed) {
  594. wmb();
  595. update_cons_index(dev, cq, freed);
  596. }
  597. /*
  598. * If a CQ resize is in progress and we discovered that the
  599. * old buffer is empty, then peek in the new buffer, and if
  600. * it's not empty, switch to the new buffer and continue
  601. * polling there.
  602. */
  603. if (unlikely(err == -EAGAIN && cq->resize_buf &&
  604. cq->resize_buf->state == CQ_RESIZE_READY)) {
  605. /*
  606. * In Tavor mode, the hardware keeps the producer
  607. * index modulo the CQ size. Since we might be making
  608. * the CQ bigger, we need to mask our consumer index
  609. * using the size of the old CQ buffer before looking
  610. * in the new CQ buffer.
  611. */
  612. if (!mthca_is_memfree(dev))
  613. cq->cons_index &= cq->ibcq.cqe;
  614. if (cqe_sw(get_cqe_from_buf(&cq->resize_buf->buf,
  615. cq->cons_index & cq->resize_buf->cqe))) {
  616. struct mthca_cq_buf tbuf;
  617. int tcqe;
  618. tbuf = cq->buf;
  619. tcqe = cq->ibcq.cqe;
  620. cq->buf = cq->resize_buf->buf;
  621. cq->ibcq.cqe = cq->resize_buf->cqe;
  622. cq->resize_buf->buf = tbuf;
  623. cq->resize_buf->cqe = tcqe;
  624. cq->resize_buf->state = CQ_RESIZE_SWAPPED;
  625. goto repoll;
  626. }
  627. }
  628. spin_unlock_irqrestore(&cq->lock, flags);
  629. return err == 0 || err == -EAGAIN ? npolled : err;
  630. }
  631. int mthca_tavor_arm_cq(struct ib_cq *cq, enum ib_cq_notify notify)
  632. {
  633. __be32 doorbell[2];
  634. doorbell[0] = cpu_to_be32((notify == IB_CQ_SOLICITED ?
  635. MTHCA_TAVOR_CQ_DB_REQ_NOT_SOL :
  636. MTHCA_TAVOR_CQ_DB_REQ_NOT) |
  637. to_mcq(cq)->cqn);
  638. doorbell[1] = (__force __be32) 0xffffffff;
  639. mthca_write64(doorbell,
  640. to_mdev(cq->device)->kar + MTHCA_CQ_DOORBELL,
  641. MTHCA_GET_DOORBELL_LOCK(&to_mdev(cq->device)->doorbell_lock));
  642. return 0;
  643. }
  644. int mthca_arbel_arm_cq(struct ib_cq *ibcq, enum ib_cq_notify notify)
  645. {
  646. struct mthca_cq *cq = to_mcq(ibcq);
  647. __be32 doorbell[2];
  648. u32 sn;
  649. __be32 ci;
  650. sn = cq->arm_sn & 3;
  651. ci = cpu_to_be32(cq->cons_index);
  652. doorbell[0] = ci;
  653. doorbell[1] = cpu_to_be32((cq->cqn << 8) | (2 << 5) | (sn << 3) |
  654. (notify == IB_CQ_SOLICITED ? 1 : 2));
  655. mthca_write_db_rec(doorbell, cq->arm_db);
  656. /*
  657. * Make sure that the doorbell record in host memory is
  658. * written before ringing the doorbell via PCI MMIO.
  659. */
  660. wmb();
  661. doorbell[0] = cpu_to_be32((sn << 28) |
  662. (notify == IB_CQ_SOLICITED ?
  663. MTHCA_ARBEL_CQ_DB_REQ_NOT_SOL :
  664. MTHCA_ARBEL_CQ_DB_REQ_NOT) |
  665. cq->cqn);
  666. doorbell[1] = ci;
  667. mthca_write64(doorbell,
  668. to_mdev(ibcq->device)->kar + MTHCA_CQ_DOORBELL,
  669. MTHCA_GET_DOORBELL_LOCK(&to_mdev(ibcq->device)->doorbell_lock));
  670. return 0;
  671. }
  672. int mthca_init_cq(struct mthca_dev *dev, int nent,
  673. struct mthca_ucontext *ctx, u32 pdn,
  674. struct mthca_cq *cq)
  675. {
  676. struct mthca_mailbox *mailbox;
  677. struct mthca_cq_context *cq_context;
  678. int err = -ENOMEM;
  679. u8 status;
  680. cq->ibcq.cqe = nent - 1;
  681. cq->is_kernel = !ctx;
  682. cq->cqn = mthca_alloc(&dev->cq_table.alloc);
  683. if (cq->cqn == -1)
  684. return -ENOMEM;
  685. if (mthca_is_memfree(dev)) {
  686. err = mthca_table_get(dev, dev->cq_table.table, cq->cqn);
  687. if (err)
  688. goto err_out;
  689. if (cq->is_kernel) {
  690. cq->arm_sn = 1;
  691. err = -ENOMEM;
  692. cq->set_ci_db_index = mthca_alloc_db(dev, MTHCA_DB_TYPE_CQ_SET_CI,
  693. cq->cqn, &cq->set_ci_db);
  694. if (cq->set_ci_db_index < 0)
  695. goto err_out_icm;
  696. cq->arm_db_index = mthca_alloc_db(dev, MTHCA_DB_TYPE_CQ_ARM,
  697. cq->cqn, &cq->arm_db);
  698. if (cq->arm_db_index < 0)
  699. goto err_out_ci;
  700. }
  701. }
  702. mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
  703. if (IS_ERR(mailbox))
  704. goto err_out_arm;
  705. cq_context = mailbox->buf;
  706. if (cq->is_kernel) {
  707. err = mthca_alloc_cq_buf(dev, &cq->buf, nent);
  708. if (err)
  709. goto err_out_mailbox;
  710. }
  711. spin_lock_init(&cq->lock);
  712. cq->refcount = 1;
  713. init_waitqueue_head(&cq->wait);
  714. mutex_init(&cq->mutex);
  715. memset(cq_context, 0, sizeof *cq_context);
  716. cq_context->flags = cpu_to_be32(MTHCA_CQ_STATUS_OK |
  717. MTHCA_CQ_STATE_DISARMED |
  718. MTHCA_CQ_FLAG_TR);
  719. cq_context->logsize_usrpage = cpu_to_be32((ffs(nent) - 1) << 24);
  720. if (ctx)
  721. cq_context->logsize_usrpage |= cpu_to_be32(ctx->uar.index);
  722. else
  723. cq_context->logsize_usrpage |= cpu_to_be32(dev->driver_uar.index);
  724. cq_context->error_eqn = cpu_to_be32(dev->eq_table.eq[MTHCA_EQ_ASYNC].eqn);
  725. cq_context->comp_eqn = cpu_to_be32(dev->eq_table.eq[MTHCA_EQ_COMP].eqn);
  726. cq_context->pd = cpu_to_be32(pdn);
  727. cq_context->lkey = cpu_to_be32(cq->buf.mr.ibmr.lkey);
  728. cq_context->cqn = cpu_to_be32(cq->cqn);
  729. if (mthca_is_memfree(dev)) {
  730. cq_context->ci_db = cpu_to_be32(cq->set_ci_db_index);
  731. cq_context->state_db = cpu_to_be32(cq->arm_db_index);
  732. }
  733. err = mthca_SW2HW_CQ(dev, mailbox, cq->cqn, &status);
  734. if (err) {
  735. mthca_warn(dev, "SW2HW_CQ failed (%d)\n", err);
  736. goto err_out_free_mr;
  737. }
  738. if (status) {
  739. mthca_warn(dev, "SW2HW_CQ returned status 0x%02x\n",
  740. status);
  741. err = -EINVAL;
  742. goto err_out_free_mr;
  743. }
  744. spin_lock_irq(&dev->cq_table.lock);
  745. if (mthca_array_set(&dev->cq_table.cq,
  746. cq->cqn & (dev->limits.num_cqs - 1),
  747. cq)) {
  748. spin_unlock_irq(&dev->cq_table.lock);
  749. goto err_out_free_mr;
  750. }
  751. spin_unlock_irq(&dev->cq_table.lock);
  752. cq->cons_index = 0;
  753. mthca_free_mailbox(dev, mailbox);
  754. return 0;
  755. err_out_free_mr:
  756. if (cq->is_kernel)
  757. mthca_free_cq_buf(dev, &cq->buf, cq->ibcq.cqe);
  758. err_out_mailbox:
  759. mthca_free_mailbox(dev, mailbox);
  760. err_out_arm:
  761. if (cq->is_kernel && mthca_is_memfree(dev))
  762. mthca_free_db(dev, MTHCA_DB_TYPE_CQ_ARM, cq->arm_db_index);
  763. err_out_ci:
  764. if (cq->is_kernel && mthca_is_memfree(dev))
  765. mthca_free_db(dev, MTHCA_DB_TYPE_CQ_SET_CI, cq->set_ci_db_index);
  766. err_out_icm:
  767. mthca_table_put(dev, dev->cq_table.table, cq->cqn);
  768. err_out:
  769. mthca_free(&dev->cq_table.alloc, cq->cqn);
  770. return err;
  771. }
  772. static inline int get_cq_refcount(struct mthca_dev *dev, struct mthca_cq *cq)
  773. {
  774. int c;
  775. spin_lock_irq(&dev->cq_table.lock);
  776. c = cq->refcount;
  777. spin_unlock_irq(&dev->cq_table.lock);
  778. return c;
  779. }
  780. void mthca_free_cq(struct mthca_dev *dev,
  781. struct mthca_cq *cq)
  782. {
  783. struct mthca_mailbox *mailbox;
  784. int err;
  785. u8 status;
  786. mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
  787. if (IS_ERR(mailbox)) {
  788. mthca_warn(dev, "No memory for mailbox to free CQ.\n");
  789. return;
  790. }
  791. err = mthca_HW2SW_CQ(dev, mailbox, cq->cqn, &status);
  792. if (err)
  793. mthca_warn(dev, "HW2SW_CQ failed (%d)\n", err);
  794. else if (status)
  795. mthca_warn(dev, "HW2SW_CQ returned status 0x%02x\n", status);
  796. if (0) {
  797. __be32 *ctx = mailbox->buf;
  798. int j;
  799. printk(KERN_ERR "context for CQN %x (cons index %x, next sw %d)\n",
  800. cq->cqn, cq->cons_index,
  801. cq->is_kernel ? !!next_cqe_sw(cq) : 0);
  802. for (j = 0; j < 16; ++j)
  803. printk(KERN_ERR "[%2x] %08x\n", j * 4, be32_to_cpu(ctx[j]));
  804. }
  805. spin_lock_irq(&dev->cq_table.lock);
  806. mthca_array_clear(&dev->cq_table.cq,
  807. cq->cqn & (dev->limits.num_cqs - 1));
  808. --cq->refcount;
  809. spin_unlock_irq(&dev->cq_table.lock);
  810. if (dev->mthca_flags & MTHCA_FLAG_MSI_X)
  811. synchronize_irq(dev->eq_table.eq[MTHCA_EQ_COMP].msi_x_vector);
  812. else
  813. synchronize_irq(dev->pdev->irq);
  814. wait_event(cq->wait, !get_cq_refcount(dev, cq));
  815. if (cq->is_kernel) {
  816. mthca_free_cq_buf(dev, &cq->buf, cq->ibcq.cqe);
  817. if (mthca_is_memfree(dev)) {
  818. mthca_free_db(dev, MTHCA_DB_TYPE_CQ_ARM, cq->arm_db_index);
  819. mthca_free_db(dev, MTHCA_DB_TYPE_CQ_SET_CI, cq->set_ci_db_index);
  820. }
  821. }
  822. mthca_table_put(dev, dev->cq_table.table, cq->cqn);
  823. mthca_free(&dev->cq_table.alloc, cq->cqn);
  824. mthca_free_mailbox(dev, mailbox);
  825. }
  826. int __devinit mthca_init_cq_table(struct mthca_dev *dev)
  827. {
  828. int err;
  829. spin_lock_init(&dev->cq_table.lock);
  830. err = mthca_alloc_init(&dev->cq_table.alloc,
  831. dev->limits.num_cqs,
  832. (1 << 24) - 1,
  833. dev->limits.reserved_cqs);
  834. if (err)
  835. return err;
  836. err = mthca_array_init(&dev->cq_table.cq,
  837. dev->limits.num_cqs);
  838. if (err)
  839. mthca_alloc_cleanup(&dev->cq_table.alloc);
  840. return err;
  841. }
  842. void mthca_cleanup_cq_table(struct mthca_dev *dev)
  843. {
  844. mthca_array_cleanup(&dev->cq_table.cq, dev->limits.num_cqs);
  845. mthca_alloc_cleanup(&dev->cq_table.alloc);
  846. }