mthca_cq.c 26 KB

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