cq.c 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041
  1. /*
  2. * Copyright (c) 2009-2010 Chelsio, Inc. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. */
  32. #include "iw_cxgb4.h"
  33. static int destroy_cq(struct c4iw_rdev *rdev, struct t4_cq *cq,
  34. struct c4iw_dev_ucontext *uctx, struct sk_buff *skb)
  35. {
  36. struct fw_ri_res_wr *res_wr;
  37. struct fw_ri_res *res;
  38. int wr_len;
  39. struct c4iw_wr_wait wr_wait;
  40. int ret;
  41. wr_len = sizeof *res_wr + sizeof *res;
  42. set_wr_txq(skb, CPL_PRIORITY_CONTROL, 0);
  43. res_wr = (struct fw_ri_res_wr *)__skb_put(skb, wr_len);
  44. memset(res_wr, 0, wr_len);
  45. res_wr->op_nres = cpu_to_be32(
  46. FW_WR_OP_V(FW_RI_RES_WR) |
  47. FW_RI_RES_WR_NRES_V(1) |
  48. FW_WR_COMPL_F);
  49. res_wr->len16_pkd = cpu_to_be32(DIV_ROUND_UP(wr_len, 16));
  50. res_wr->cookie = (uintptr_t)&wr_wait;
  51. res = res_wr->res;
  52. res->u.cq.restype = FW_RI_RES_TYPE_CQ;
  53. res->u.cq.op = FW_RI_RES_OP_RESET;
  54. res->u.cq.iqid = cpu_to_be32(cq->cqid);
  55. c4iw_init_wr_wait(&wr_wait);
  56. ret = c4iw_ofld_send(rdev, skb);
  57. if (!ret) {
  58. ret = c4iw_wait_for_reply(rdev, &wr_wait, 0, 0, __func__);
  59. }
  60. kfree(cq->sw_queue);
  61. dma_free_coherent(&(rdev->lldi.pdev->dev),
  62. cq->memsize, cq->queue,
  63. dma_unmap_addr(cq, mapping));
  64. c4iw_put_cqid(rdev, cq->cqid, uctx);
  65. return ret;
  66. }
  67. static int create_cq(struct c4iw_rdev *rdev, struct t4_cq *cq,
  68. struct c4iw_dev_ucontext *uctx)
  69. {
  70. struct fw_ri_res_wr *res_wr;
  71. struct fw_ri_res *res;
  72. int wr_len;
  73. int user = (uctx != &rdev->uctx);
  74. struct c4iw_wr_wait wr_wait;
  75. int ret;
  76. struct sk_buff *skb;
  77. cq->cqid = c4iw_get_cqid(rdev, uctx);
  78. if (!cq->cqid) {
  79. ret = -ENOMEM;
  80. goto err1;
  81. }
  82. if (!user) {
  83. cq->sw_queue = kzalloc(cq->memsize, GFP_KERNEL);
  84. if (!cq->sw_queue) {
  85. ret = -ENOMEM;
  86. goto err2;
  87. }
  88. }
  89. cq->queue = dma_alloc_coherent(&rdev->lldi.pdev->dev, cq->memsize,
  90. &cq->dma_addr, GFP_KERNEL);
  91. if (!cq->queue) {
  92. ret = -ENOMEM;
  93. goto err3;
  94. }
  95. dma_unmap_addr_set(cq, mapping, cq->dma_addr);
  96. memset(cq->queue, 0, cq->memsize);
  97. /* build fw_ri_res_wr */
  98. wr_len = sizeof *res_wr + sizeof *res;
  99. skb = alloc_skb(wr_len, GFP_KERNEL);
  100. if (!skb) {
  101. ret = -ENOMEM;
  102. goto err4;
  103. }
  104. set_wr_txq(skb, CPL_PRIORITY_CONTROL, 0);
  105. res_wr = (struct fw_ri_res_wr *)__skb_put(skb, wr_len);
  106. memset(res_wr, 0, wr_len);
  107. res_wr->op_nres = cpu_to_be32(
  108. FW_WR_OP_V(FW_RI_RES_WR) |
  109. FW_RI_RES_WR_NRES_V(1) |
  110. FW_WR_COMPL_F);
  111. res_wr->len16_pkd = cpu_to_be32(DIV_ROUND_UP(wr_len, 16));
  112. res_wr->cookie = (uintptr_t)&wr_wait;
  113. res = res_wr->res;
  114. res->u.cq.restype = FW_RI_RES_TYPE_CQ;
  115. res->u.cq.op = FW_RI_RES_OP_WRITE;
  116. res->u.cq.iqid = cpu_to_be32(cq->cqid);
  117. res->u.cq.iqandst_to_iqandstindex = cpu_to_be32(
  118. FW_RI_RES_WR_IQANUS_V(0) |
  119. FW_RI_RES_WR_IQANUD_V(1) |
  120. FW_RI_RES_WR_IQANDST_F |
  121. FW_RI_RES_WR_IQANDSTINDEX_V(
  122. rdev->lldi.ciq_ids[cq->vector]));
  123. res->u.cq.iqdroprss_to_iqesize = cpu_to_be16(
  124. FW_RI_RES_WR_IQDROPRSS_F |
  125. FW_RI_RES_WR_IQPCIECH_V(2) |
  126. FW_RI_RES_WR_IQINTCNTTHRESH_V(0) |
  127. FW_RI_RES_WR_IQO_F |
  128. FW_RI_RES_WR_IQESIZE_V(1));
  129. res->u.cq.iqsize = cpu_to_be16(cq->size);
  130. res->u.cq.iqaddr = cpu_to_be64(cq->dma_addr);
  131. c4iw_init_wr_wait(&wr_wait);
  132. ret = c4iw_ofld_send(rdev, skb);
  133. if (ret)
  134. goto err4;
  135. PDBG("%s wait_event wr_wait %p\n", __func__, &wr_wait);
  136. ret = c4iw_wait_for_reply(rdev, &wr_wait, 0, 0, __func__);
  137. if (ret)
  138. goto err4;
  139. cq->gen = 1;
  140. cq->gts = rdev->lldi.gts_reg;
  141. cq->rdev = rdev;
  142. cq->bar2_va = c4iw_bar2_addrs(rdev, cq->cqid, T4_BAR2_QTYPE_INGRESS,
  143. &cq->bar2_qid,
  144. user ? &cq->bar2_pa : NULL);
  145. if (user && !cq->bar2_pa) {
  146. pr_warn(MOD "%s: cqid %u not in BAR2 range.\n",
  147. pci_name(rdev->lldi.pdev), cq->cqid);
  148. ret = -EINVAL;
  149. goto err4;
  150. }
  151. return 0;
  152. err4:
  153. dma_free_coherent(&rdev->lldi.pdev->dev, cq->memsize, cq->queue,
  154. dma_unmap_addr(cq, mapping));
  155. err3:
  156. kfree(cq->sw_queue);
  157. err2:
  158. c4iw_put_cqid(rdev, cq->cqid, uctx);
  159. err1:
  160. return ret;
  161. }
  162. static void insert_recv_cqe(struct t4_wq *wq, struct t4_cq *cq)
  163. {
  164. struct t4_cqe cqe;
  165. PDBG("%s wq %p cq %p sw_cidx %u sw_pidx %u\n", __func__,
  166. wq, cq, cq->sw_cidx, cq->sw_pidx);
  167. memset(&cqe, 0, sizeof(cqe));
  168. cqe.header = cpu_to_be32(CQE_STATUS_V(T4_ERR_SWFLUSH) |
  169. CQE_OPCODE_V(FW_RI_SEND) |
  170. CQE_TYPE_V(0) |
  171. CQE_SWCQE_V(1) |
  172. CQE_QPID_V(wq->sq.qid));
  173. cqe.bits_type_ts = cpu_to_be64(CQE_GENBIT_V((u64)cq->gen));
  174. cq->sw_queue[cq->sw_pidx] = cqe;
  175. t4_swcq_produce(cq);
  176. }
  177. int c4iw_flush_rq(struct t4_wq *wq, struct t4_cq *cq, int count)
  178. {
  179. int flushed = 0;
  180. int in_use = wq->rq.in_use - count;
  181. BUG_ON(in_use < 0);
  182. PDBG("%s wq %p cq %p rq.in_use %u skip count %u\n", __func__,
  183. wq, cq, wq->rq.in_use, count);
  184. while (in_use--) {
  185. insert_recv_cqe(wq, cq);
  186. flushed++;
  187. }
  188. return flushed;
  189. }
  190. static void insert_sq_cqe(struct t4_wq *wq, struct t4_cq *cq,
  191. struct t4_swsqe *swcqe)
  192. {
  193. struct t4_cqe cqe;
  194. PDBG("%s wq %p cq %p sw_cidx %u sw_pidx %u\n", __func__,
  195. wq, cq, cq->sw_cidx, cq->sw_pidx);
  196. memset(&cqe, 0, sizeof(cqe));
  197. cqe.header = cpu_to_be32(CQE_STATUS_V(T4_ERR_SWFLUSH) |
  198. CQE_OPCODE_V(swcqe->opcode) |
  199. CQE_TYPE_V(1) |
  200. CQE_SWCQE_V(1) |
  201. CQE_QPID_V(wq->sq.qid));
  202. CQE_WRID_SQ_IDX(&cqe) = swcqe->idx;
  203. cqe.bits_type_ts = cpu_to_be64(CQE_GENBIT_V((u64)cq->gen));
  204. cq->sw_queue[cq->sw_pidx] = cqe;
  205. t4_swcq_produce(cq);
  206. }
  207. static void advance_oldest_read(struct t4_wq *wq);
  208. int c4iw_flush_sq(struct c4iw_qp *qhp)
  209. {
  210. int flushed = 0;
  211. struct t4_wq *wq = &qhp->wq;
  212. struct c4iw_cq *chp = to_c4iw_cq(qhp->ibqp.send_cq);
  213. struct t4_cq *cq = &chp->cq;
  214. int idx;
  215. struct t4_swsqe *swsqe;
  216. if (wq->sq.flush_cidx == -1)
  217. wq->sq.flush_cidx = wq->sq.cidx;
  218. idx = wq->sq.flush_cidx;
  219. BUG_ON(idx >= wq->sq.size);
  220. while (idx != wq->sq.pidx) {
  221. swsqe = &wq->sq.sw_sq[idx];
  222. BUG_ON(swsqe->flushed);
  223. swsqe->flushed = 1;
  224. insert_sq_cqe(wq, cq, swsqe);
  225. if (wq->sq.oldest_read == swsqe) {
  226. BUG_ON(swsqe->opcode != FW_RI_READ_REQ);
  227. advance_oldest_read(wq);
  228. }
  229. flushed++;
  230. if (++idx == wq->sq.size)
  231. idx = 0;
  232. }
  233. wq->sq.flush_cidx += flushed;
  234. if (wq->sq.flush_cidx >= wq->sq.size)
  235. wq->sq.flush_cidx -= wq->sq.size;
  236. return flushed;
  237. }
  238. static void flush_completed_wrs(struct t4_wq *wq, struct t4_cq *cq)
  239. {
  240. struct t4_swsqe *swsqe;
  241. int cidx;
  242. if (wq->sq.flush_cidx == -1)
  243. wq->sq.flush_cidx = wq->sq.cidx;
  244. cidx = wq->sq.flush_cidx;
  245. BUG_ON(cidx > wq->sq.size);
  246. while (cidx != wq->sq.pidx) {
  247. swsqe = &wq->sq.sw_sq[cidx];
  248. if (!swsqe->signaled) {
  249. if (++cidx == wq->sq.size)
  250. cidx = 0;
  251. } else if (swsqe->complete) {
  252. BUG_ON(swsqe->flushed);
  253. /*
  254. * Insert this completed cqe into the swcq.
  255. */
  256. PDBG("%s moving cqe into swcq sq idx %u cq idx %u\n",
  257. __func__, cidx, cq->sw_pidx);
  258. swsqe->cqe.header |= htonl(CQE_SWCQE_V(1));
  259. cq->sw_queue[cq->sw_pidx] = swsqe->cqe;
  260. t4_swcq_produce(cq);
  261. swsqe->flushed = 1;
  262. if (++cidx == wq->sq.size)
  263. cidx = 0;
  264. wq->sq.flush_cidx = cidx;
  265. } else
  266. break;
  267. }
  268. }
  269. static void create_read_req_cqe(struct t4_wq *wq, struct t4_cqe *hw_cqe,
  270. struct t4_cqe *read_cqe)
  271. {
  272. read_cqe->u.scqe.cidx = wq->sq.oldest_read->idx;
  273. read_cqe->len = htonl(wq->sq.oldest_read->read_len);
  274. read_cqe->header = htonl(CQE_QPID_V(CQE_QPID(hw_cqe)) |
  275. CQE_SWCQE_V(SW_CQE(hw_cqe)) |
  276. CQE_OPCODE_V(FW_RI_READ_REQ) |
  277. CQE_TYPE_V(1));
  278. read_cqe->bits_type_ts = hw_cqe->bits_type_ts;
  279. }
  280. static void advance_oldest_read(struct t4_wq *wq)
  281. {
  282. u32 rptr = wq->sq.oldest_read - wq->sq.sw_sq + 1;
  283. if (rptr == wq->sq.size)
  284. rptr = 0;
  285. while (rptr != wq->sq.pidx) {
  286. wq->sq.oldest_read = &wq->sq.sw_sq[rptr];
  287. if (wq->sq.oldest_read->opcode == FW_RI_READ_REQ)
  288. return;
  289. if (++rptr == wq->sq.size)
  290. rptr = 0;
  291. }
  292. wq->sq.oldest_read = NULL;
  293. }
  294. /*
  295. * Move all CQEs from the HWCQ into the SWCQ.
  296. * Deal with out-of-order and/or completions that complete
  297. * prior unsignalled WRs.
  298. */
  299. void c4iw_flush_hw_cq(struct c4iw_cq *chp)
  300. {
  301. struct t4_cqe *hw_cqe, *swcqe, read_cqe;
  302. struct c4iw_qp *qhp;
  303. struct t4_swsqe *swsqe;
  304. int ret;
  305. PDBG("%s cqid 0x%x\n", __func__, chp->cq.cqid);
  306. ret = t4_next_hw_cqe(&chp->cq, &hw_cqe);
  307. /*
  308. * This logic is similar to poll_cq(), but not quite the same
  309. * unfortunately. Need to move pertinent HW CQEs to the SW CQ but
  310. * also do any translation magic that poll_cq() normally does.
  311. */
  312. while (!ret) {
  313. qhp = get_qhp(chp->rhp, CQE_QPID(hw_cqe));
  314. /*
  315. * drop CQEs with no associated QP
  316. */
  317. if (qhp == NULL)
  318. goto next_cqe;
  319. if (CQE_OPCODE(hw_cqe) == FW_RI_TERMINATE)
  320. goto next_cqe;
  321. if (CQE_OPCODE(hw_cqe) == FW_RI_READ_RESP) {
  322. /* If we have reached here because of async
  323. * event or other error, and have egress error
  324. * then drop
  325. */
  326. if (CQE_TYPE(hw_cqe) == 1)
  327. goto next_cqe;
  328. /* drop peer2peer RTR reads.
  329. */
  330. if (CQE_WRID_STAG(hw_cqe) == 1)
  331. goto next_cqe;
  332. /*
  333. * Eat completions for unsignaled read WRs.
  334. */
  335. if (!qhp->wq.sq.oldest_read->signaled) {
  336. advance_oldest_read(&qhp->wq);
  337. goto next_cqe;
  338. }
  339. /*
  340. * Don't write to the HWCQ, create a new read req CQE
  341. * in local memory and move it into the swcq.
  342. */
  343. create_read_req_cqe(&qhp->wq, hw_cqe, &read_cqe);
  344. hw_cqe = &read_cqe;
  345. advance_oldest_read(&qhp->wq);
  346. }
  347. /* if its a SQ completion, then do the magic to move all the
  348. * unsignaled and now in-order completions into the swcq.
  349. */
  350. if (SQ_TYPE(hw_cqe)) {
  351. swsqe = &qhp->wq.sq.sw_sq[CQE_WRID_SQ_IDX(hw_cqe)];
  352. swsqe->cqe = *hw_cqe;
  353. swsqe->complete = 1;
  354. flush_completed_wrs(&qhp->wq, &chp->cq);
  355. } else {
  356. swcqe = &chp->cq.sw_queue[chp->cq.sw_pidx];
  357. *swcqe = *hw_cqe;
  358. swcqe->header |= cpu_to_be32(CQE_SWCQE_V(1));
  359. t4_swcq_produce(&chp->cq);
  360. }
  361. next_cqe:
  362. t4_hwcq_consume(&chp->cq);
  363. ret = t4_next_hw_cqe(&chp->cq, &hw_cqe);
  364. }
  365. }
  366. static int cqe_completes_wr(struct t4_cqe *cqe, struct t4_wq *wq)
  367. {
  368. if (CQE_OPCODE(cqe) == FW_RI_TERMINATE)
  369. return 0;
  370. if ((CQE_OPCODE(cqe) == FW_RI_RDMA_WRITE) && RQ_TYPE(cqe))
  371. return 0;
  372. if ((CQE_OPCODE(cqe) == FW_RI_READ_RESP) && SQ_TYPE(cqe))
  373. return 0;
  374. if (CQE_SEND_OPCODE(cqe) && RQ_TYPE(cqe) && t4_rq_empty(wq))
  375. return 0;
  376. return 1;
  377. }
  378. void c4iw_count_rcqes(struct t4_cq *cq, struct t4_wq *wq, int *count)
  379. {
  380. struct t4_cqe *cqe;
  381. u32 ptr;
  382. *count = 0;
  383. PDBG("%s count zero %d\n", __func__, *count);
  384. ptr = cq->sw_cidx;
  385. while (ptr != cq->sw_pidx) {
  386. cqe = &cq->sw_queue[ptr];
  387. if (RQ_TYPE(cqe) && (CQE_OPCODE(cqe) != FW_RI_READ_RESP) &&
  388. (CQE_QPID(cqe) == wq->sq.qid) && cqe_completes_wr(cqe, wq))
  389. (*count)++;
  390. if (++ptr == cq->size)
  391. ptr = 0;
  392. }
  393. PDBG("%s cq %p count %d\n", __func__, cq, *count);
  394. }
  395. /*
  396. * poll_cq
  397. *
  398. * Caller must:
  399. * check the validity of the first CQE,
  400. * supply the wq assicated with the qpid.
  401. *
  402. * credit: cq credit to return to sge.
  403. * cqe_flushed: 1 iff the CQE is flushed.
  404. * cqe: copy of the polled CQE.
  405. *
  406. * return value:
  407. * 0 CQE returned ok.
  408. * -EAGAIN CQE skipped, try again.
  409. * -EOVERFLOW CQ overflow detected.
  410. */
  411. static int poll_cq(struct t4_wq *wq, struct t4_cq *cq, struct t4_cqe *cqe,
  412. u8 *cqe_flushed, u64 *cookie, u32 *credit)
  413. {
  414. int ret = 0;
  415. struct t4_cqe *hw_cqe, read_cqe;
  416. *cqe_flushed = 0;
  417. *credit = 0;
  418. ret = t4_next_cqe(cq, &hw_cqe);
  419. if (ret)
  420. return ret;
  421. PDBG("%s CQE OVF %u qpid 0x%0x genbit %u type %u status 0x%0x"
  422. " opcode 0x%0x len 0x%0x wrid_hi_stag 0x%x wrid_low_msn 0x%x\n",
  423. __func__, CQE_OVFBIT(hw_cqe), CQE_QPID(hw_cqe),
  424. CQE_GENBIT(hw_cqe), CQE_TYPE(hw_cqe), CQE_STATUS(hw_cqe),
  425. CQE_OPCODE(hw_cqe), CQE_LEN(hw_cqe), CQE_WRID_HI(hw_cqe),
  426. CQE_WRID_LOW(hw_cqe));
  427. /*
  428. * skip cqe's not affiliated with a QP.
  429. */
  430. if (wq == NULL) {
  431. ret = -EAGAIN;
  432. goto skip_cqe;
  433. }
  434. /*
  435. * skip hw cqe's if the wq is flushed.
  436. */
  437. if (wq->flushed && !SW_CQE(hw_cqe)) {
  438. ret = -EAGAIN;
  439. goto skip_cqe;
  440. }
  441. /*
  442. * skip TERMINATE cqes...
  443. */
  444. if (CQE_OPCODE(hw_cqe) == FW_RI_TERMINATE) {
  445. ret = -EAGAIN;
  446. goto skip_cqe;
  447. }
  448. /*
  449. * Special cqe for drain WR completions...
  450. */
  451. if (CQE_OPCODE(hw_cqe) == C4IW_DRAIN_OPCODE) {
  452. *cookie = CQE_DRAIN_COOKIE(hw_cqe);
  453. *cqe = *hw_cqe;
  454. goto skip_cqe;
  455. }
  456. /*
  457. * Gotta tweak READ completions:
  458. * 1) the cqe doesn't contain the sq_wptr from the wr.
  459. * 2) opcode not reflected from the wr.
  460. * 3) read_len not reflected from the wr.
  461. * 4) cq_type is RQ_TYPE not SQ_TYPE.
  462. */
  463. if (RQ_TYPE(hw_cqe) && (CQE_OPCODE(hw_cqe) == FW_RI_READ_RESP)) {
  464. /* If we have reached here because of async
  465. * event or other error, and have egress error
  466. * then drop
  467. */
  468. if (CQE_TYPE(hw_cqe) == 1) {
  469. if (CQE_STATUS(hw_cqe))
  470. t4_set_wq_in_error(wq);
  471. ret = -EAGAIN;
  472. goto skip_cqe;
  473. }
  474. /* If this is an unsolicited read response, then the read
  475. * was generated by the kernel driver as part of peer-2-peer
  476. * connection setup. So ignore the completion.
  477. */
  478. if (CQE_WRID_STAG(hw_cqe) == 1) {
  479. if (CQE_STATUS(hw_cqe))
  480. t4_set_wq_in_error(wq);
  481. ret = -EAGAIN;
  482. goto skip_cqe;
  483. }
  484. /*
  485. * Eat completions for unsignaled read WRs.
  486. */
  487. if (!wq->sq.oldest_read->signaled) {
  488. advance_oldest_read(wq);
  489. ret = -EAGAIN;
  490. goto skip_cqe;
  491. }
  492. /*
  493. * Don't write to the HWCQ, so create a new read req CQE
  494. * in local memory.
  495. */
  496. create_read_req_cqe(wq, hw_cqe, &read_cqe);
  497. hw_cqe = &read_cqe;
  498. advance_oldest_read(wq);
  499. }
  500. if (CQE_STATUS(hw_cqe) || t4_wq_in_error(wq)) {
  501. *cqe_flushed = (CQE_STATUS(hw_cqe) == T4_ERR_SWFLUSH);
  502. t4_set_wq_in_error(wq);
  503. }
  504. /*
  505. * RECV completion.
  506. */
  507. if (RQ_TYPE(hw_cqe)) {
  508. /*
  509. * HW only validates 4 bits of MSN. So we must validate that
  510. * the MSN in the SEND is the next expected MSN. If its not,
  511. * then we complete this with T4_ERR_MSN and mark the wq in
  512. * error.
  513. */
  514. if (t4_rq_empty(wq)) {
  515. t4_set_wq_in_error(wq);
  516. ret = -EAGAIN;
  517. goto skip_cqe;
  518. }
  519. if (unlikely((CQE_WRID_MSN(hw_cqe) != (wq->rq.msn)))) {
  520. t4_set_wq_in_error(wq);
  521. hw_cqe->header |= htonl(CQE_STATUS_V(T4_ERR_MSN));
  522. goto proc_cqe;
  523. }
  524. goto proc_cqe;
  525. }
  526. /*
  527. * If we get here its a send completion.
  528. *
  529. * Handle out of order completion. These get stuffed
  530. * in the SW SQ. Then the SW SQ is walked to move any
  531. * now in-order completions into the SW CQ. This handles
  532. * 2 cases:
  533. * 1) reaping unsignaled WRs when the first subsequent
  534. * signaled WR is completed.
  535. * 2) out of order read completions.
  536. */
  537. if (!SW_CQE(hw_cqe) && (CQE_WRID_SQ_IDX(hw_cqe) != wq->sq.cidx)) {
  538. struct t4_swsqe *swsqe;
  539. PDBG("%s out of order completion going in sw_sq at idx %u\n",
  540. __func__, CQE_WRID_SQ_IDX(hw_cqe));
  541. swsqe = &wq->sq.sw_sq[CQE_WRID_SQ_IDX(hw_cqe)];
  542. swsqe->cqe = *hw_cqe;
  543. swsqe->complete = 1;
  544. ret = -EAGAIN;
  545. goto flush_wq;
  546. }
  547. proc_cqe:
  548. *cqe = *hw_cqe;
  549. /*
  550. * Reap the associated WR(s) that are freed up with this
  551. * completion.
  552. */
  553. if (SQ_TYPE(hw_cqe)) {
  554. int idx = CQE_WRID_SQ_IDX(hw_cqe);
  555. BUG_ON(idx >= wq->sq.size);
  556. /*
  557. * Account for any unsignaled completions completed by
  558. * this signaled completion. In this case, cidx points
  559. * to the first unsignaled one, and idx points to the
  560. * signaled one. So adjust in_use based on this delta.
  561. * if this is not completing any unsigned wrs, then the
  562. * delta will be 0. Handle wrapping also!
  563. */
  564. if (idx < wq->sq.cidx)
  565. wq->sq.in_use -= wq->sq.size + idx - wq->sq.cidx;
  566. else
  567. wq->sq.in_use -= idx - wq->sq.cidx;
  568. BUG_ON(wq->sq.in_use <= 0 && wq->sq.in_use >= wq->sq.size);
  569. wq->sq.cidx = (uint16_t)idx;
  570. PDBG("%s completing sq idx %u\n", __func__, wq->sq.cidx);
  571. *cookie = wq->sq.sw_sq[wq->sq.cidx].wr_id;
  572. if (c4iw_wr_log)
  573. c4iw_log_wr_stats(wq, hw_cqe);
  574. t4_sq_consume(wq);
  575. } else {
  576. PDBG("%s completing rq idx %u\n", __func__, wq->rq.cidx);
  577. *cookie = wq->rq.sw_rq[wq->rq.cidx].wr_id;
  578. BUG_ON(t4_rq_empty(wq));
  579. if (c4iw_wr_log)
  580. c4iw_log_wr_stats(wq, hw_cqe);
  581. t4_rq_consume(wq);
  582. goto skip_cqe;
  583. }
  584. flush_wq:
  585. /*
  586. * Flush any completed cqes that are now in-order.
  587. */
  588. flush_completed_wrs(wq, cq);
  589. skip_cqe:
  590. if (SW_CQE(hw_cqe)) {
  591. PDBG("%s cq %p cqid 0x%x skip sw cqe cidx %u\n",
  592. __func__, cq, cq->cqid, cq->sw_cidx);
  593. t4_swcq_consume(cq);
  594. } else {
  595. PDBG("%s cq %p cqid 0x%x skip hw cqe cidx %u\n",
  596. __func__, cq, cq->cqid, cq->cidx);
  597. t4_hwcq_consume(cq);
  598. }
  599. return ret;
  600. }
  601. /*
  602. * Get one cq entry from c4iw and map it to openib.
  603. *
  604. * Returns:
  605. * 0 cqe returned
  606. * -ENODATA EMPTY;
  607. * -EAGAIN caller must try again
  608. * any other -errno fatal error
  609. */
  610. static int c4iw_poll_cq_one(struct c4iw_cq *chp, struct ib_wc *wc)
  611. {
  612. struct c4iw_qp *qhp = NULL;
  613. struct t4_cqe uninitialized_var(cqe), *rd_cqe;
  614. struct t4_wq *wq;
  615. u32 credit = 0;
  616. u8 cqe_flushed;
  617. u64 cookie = 0;
  618. int ret;
  619. ret = t4_next_cqe(&chp->cq, &rd_cqe);
  620. if (ret)
  621. return ret;
  622. qhp = get_qhp(chp->rhp, CQE_QPID(rd_cqe));
  623. if (!qhp)
  624. wq = NULL;
  625. else {
  626. spin_lock(&qhp->lock);
  627. wq = &(qhp->wq);
  628. }
  629. ret = poll_cq(wq, &(chp->cq), &cqe, &cqe_flushed, &cookie, &credit);
  630. if (ret)
  631. goto out;
  632. wc->wr_id = cookie;
  633. wc->qp = &qhp->ibqp;
  634. wc->vendor_err = CQE_STATUS(&cqe);
  635. wc->wc_flags = 0;
  636. PDBG("%s qpid 0x%x type %d opcode %d status 0x%x len %u wrid hi 0x%x "
  637. "lo 0x%x cookie 0x%llx\n", __func__, CQE_QPID(&cqe),
  638. CQE_TYPE(&cqe), CQE_OPCODE(&cqe), CQE_STATUS(&cqe), CQE_LEN(&cqe),
  639. CQE_WRID_HI(&cqe), CQE_WRID_LOW(&cqe), (unsigned long long)cookie);
  640. if (CQE_TYPE(&cqe) == 0) {
  641. if (!CQE_STATUS(&cqe))
  642. wc->byte_len = CQE_LEN(&cqe);
  643. else
  644. wc->byte_len = 0;
  645. wc->opcode = IB_WC_RECV;
  646. if (CQE_OPCODE(&cqe) == FW_RI_SEND_WITH_INV ||
  647. CQE_OPCODE(&cqe) == FW_RI_SEND_WITH_SE_INV) {
  648. wc->ex.invalidate_rkey = CQE_WRID_STAG(&cqe);
  649. wc->wc_flags |= IB_WC_WITH_INVALIDATE;
  650. c4iw_invalidate_mr(qhp->rhp, wc->ex.invalidate_rkey);
  651. }
  652. } else {
  653. switch (CQE_OPCODE(&cqe)) {
  654. case FW_RI_RDMA_WRITE:
  655. wc->opcode = IB_WC_RDMA_WRITE;
  656. break;
  657. case FW_RI_READ_REQ:
  658. wc->opcode = IB_WC_RDMA_READ;
  659. wc->byte_len = CQE_LEN(&cqe);
  660. break;
  661. case FW_RI_SEND_WITH_INV:
  662. case FW_RI_SEND_WITH_SE_INV:
  663. wc->opcode = IB_WC_SEND;
  664. wc->wc_flags |= IB_WC_WITH_INVALIDATE;
  665. break;
  666. case FW_RI_SEND:
  667. case FW_RI_SEND_WITH_SE:
  668. wc->opcode = IB_WC_SEND;
  669. break;
  670. case FW_RI_LOCAL_INV:
  671. wc->opcode = IB_WC_LOCAL_INV;
  672. break;
  673. case FW_RI_FAST_REGISTER:
  674. wc->opcode = IB_WC_REG_MR;
  675. /* Invalidate the MR if the fastreg failed */
  676. if (CQE_STATUS(&cqe) != T4_ERR_SUCCESS)
  677. c4iw_invalidate_mr(qhp->rhp,
  678. CQE_WRID_FR_STAG(&cqe));
  679. break;
  680. case C4IW_DRAIN_OPCODE:
  681. wc->opcode = IB_WC_SEND;
  682. break;
  683. default:
  684. printk(KERN_ERR MOD "Unexpected opcode %d "
  685. "in the CQE received for QPID=0x%0x\n",
  686. CQE_OPCODE(&cqe), CQE_QPID(&cqe));
  687. ret = -EINVAL;
  688. goto out;
  689. }
  690. }
  691. if (cqe_flushed)
  692. wc->status = IB_WC_WR_FLUSH_ERR;
  693. else {
  694. switch (CQE_STATUS(&cqe)) {
  695. case T4_ERR_SUCCESS:
  696. wc->status = IB_WC_SUCCESS;
  697. break;
  698. case T4_ERR_STAG:
  699. wc->status = IB_WC_LOC_ACCESS_ERR;
  700. break;
  701. case T4_ERR_PDID:
  702. wc->status = IB_WC_LOC_PROT_ERR;
  703. break;
  704. case T4_ERR_QPID:
  705. case T4_ERR_ACCESS:
  706. wc->status = IB_WC_LOC_ACCESS_ERR;
  707. break;
  708. case T4_ERR_WRAP:
  709. wc->status = IB_WC_GENERAL_ERR;
  710. break;
  711. case T4_ERR_BOUND:
  712. wc->status = IB_WC_LOC_LEN_ERR;
  713. break;
  714. case T4_ERR_INVALIDATE_SHARED_MR:
  715. case T4_ERR_INVALIDATE_MR_WITH_MW_BOUND:
  716. wc->status = IB_WC_MW_BIND_ERR;
  717. break;
  718. case T4_ERR_CRC:
  719. case T4_ERR_MARKER:
  720. case T4_ERR_PDU_LEN_ERR:
  721. case T4_ERR_OUT_OF_RQE:
  722. case T4_ERR_DDP_VERSION:
  723. case T4_ERR_RDMA_VERSION:
  724. case T4_ERR_DDP_QUEUE_NUM:
  725. case T4_ERR_MSN:
  726. case T4_ERR_TBIT:
  727. case T4_ERR_MO:
  728. case T4_ERR_MSN_RANGE:
  729. case T4_ERR_IRD_OVERFLOW:
  730. case T4_ERR_OPCODE:
  731. case T4_ERR_INTERNAL_ERR:
  732. wc->status = IB_WC_FATAL_ERR;
  733. break;
  734. case T4_ERR_SWFLUSH:
  735. wc->status = IB_WC_WR_FLUSH_ERR;
  736. break;
  737. default:
  738. printk(KERN_ERR MOD
  739. "Unexpected cqe_status 0x%x for QPID=0x%0x\n",
  740. CQE_STATUS(&cqe), CQE_QPID(&cqe));
  741. wc->status = IB_WC_FATAL_ERR;
  742. }
  743. }
  744. out:
  745. if (wq)
  746. spin_unlock(&qhp->lock);
  747. return ret;
  748. }
  749. int c4iw_poll_cq(struct ib_cq *ibcq, int num_entries, struct ib_wc *wc)
  750. {
  751. struct c4iw_cq *chp;
  752. unsigned long flags;
  753. int npolled;
  754. int err = 0;
  755. chp = to_c4iw_cq(ibcq);
  756. spin_lock_irqsave(&chp->lock, flags);
  757. for (npolled = 0; npolled < num_entries; ++npolled) {
  758. do {
  759. err = c4iw_poll_cq_one(chp, wc + npolled);
  760. } while (err == -EAGAIN);
  761. if (err)
  762. break;
  763. }
  764. spin_unlock_irqrestore(&chp->lock, flags);
  765. return !err || err == -ENODATA ? npolled : err;
  766. }
  767. int c4iw_destroy_cq(struct ib_cq *ib_cq)
  768. {
  769. struct c4iw_cq *chp;
  770. struct c4iw_ucontext *ucontext;
  771. PDBG("%s ib_cq %p\n", __func__, ib_cq);
  772. chp = to_c4iw_cq(ib_cq);
  773. remove_handle(chp->rhp, &chp->rhp->cqidr, chp->cq.cqid);
  774. atomic_dec(&chp->refcnt);
  775. wait_event(chp->wait, !atomic_read(&chp->refcnt));
  776. ucontext = ib_cq->uobject ? to_c4iw_ucontext(ib_cq->uobject->context)
  777. : NULL;
  778. destroy_cq(&chp->rhp->rdev, &chp->cq,
  779. ucontext ? &ucontext->uctx : &chp->cq.rdev->uctx,
  780. chp->destroy_skb);
  781. chp->destroy_skb = NULL;
  782. kfree(chp);
  783. return 0;
  784. }
  785. struct ib_cq *c4iw_create_cq(struct ib_device *ibdev,
  786. const struct ib_cq_init_attr *attr,
  787. struct ib_ucontext *ib_context,
  788. struct ib_udata *udata)
  789. {
  790. int entries = attr->cqe;
  791. int vector = attr->comp_vector;
  792. struct c4iw_dev *rhp;
  793. struct c4iw_cq *chp;
  794. struct c4iw_create_cq_resp uresp;
  795. struct c4iw_ucontext *ucontext = NULL;
  796. int ret, wr_len;
  797. size_t memsize, hwentries;
  798. struct c4iw_mm_entry *mm, *mm2;
  799. PDBG("%s ib_dev %p entries %d\n", __func__, ibdev, entries);
  800. if (attr->flags)
  801. return ERR_PTR(-EINVAL);
  802. rhp = to_c4iw_dev(ibdev);
  803. if (vector >= rhp->rdev.lldi.nciq)
  804. return ERR_PTR(-EINVAL);
  805. chp = kzalloc(sizeof(*chp), GFP_KERNEL);
  806. if (!chp)
  807. return ERR_PTR(-ENOMEM);
  808. wr_len = sizeof(struct fw_ri_res_wr) + sizeof(struct fw_ri_res);
  809. chp->destroy_skb = alloc_skb(wr_len, GFP_KERNEL);
  810. if (!chp->destroy_skb) {
  811. ret = -ENOMEM;
  812. goto err1;
  813. }
  814. if (ib_context)
  815. ucontext = to_c4iw_ucontext(ib_context);
  816. /* account for the status page. */
  817. entries++;
  818. /* IQ needs one extra entry to differentiate full vs empty. */
  819. entries++;
  820. /*
  821. * entries must be multiple of 16 for HW.
  822. */
  823. entries = roundup(entries, 16);
  824. /*
  825. * Make actual HW queue 2x to avoid cdix_inc overflows.
  826. */
  827. hwentries = min(entries * 2, rhp->rdev.hw_queue.t4_max_iq_size);
  828. /*
  829. * Make HW queue at least 64 entries so GTS updates aren't too
  830. * frequent.
  831. */
  832. if (hwentries < 64)
  833. hwentries = 64;
  834. memsize = hwentries * sizeof *chp->cq.queue;
  835. /*
  836. * memsize must be a multiple of the page size if its a user cq.
  837. */
  838. if (ucontext)
  839. memsize = roundup(memsize, PAGE_SIZE);
  840. chp->cq.size = hwentries;
  841. chp->cq.memsize = memsize;
  842. chp->cq.vector = vector;
  843. ret = create_cq(&rhp->rdev, &chp->cq,
  844. ucontext ? &ucontext->uctx : &rhp->rdev.uctx);
  845. if (ret)
  846. goto err2;
  847. chp->rhp = rhp;
  848. chp->cq.size--; /* status page */
  849. chp->ibcq.cqe = entries - 2;
  850. spin_lock_init(&chp->lock);
  851. spin_lock_init(&chp->comp_handler_lock);
  852. atomic_set(&chp->refcnt, 1);
  853. init_waitqueue_head(&chp->wait);
  854. ret = insert_handle(rhp, &rhp->cqidr, chp, chp->cq.cqid);
  855. if (ret)
  856. goto err3;
  857. if (ucontext) {
  858. mm = kmalloc(sizeof *mm, GFP_KERNEL);
  859. if (!mm)
  860. goto err4;
  861. mm2 = kmalloc(sizeof *mm2, GFP_KERNEL);
  862. if (!mm2)
  863. goto err5;
  864. uresp.qid_mask = rhp->rdev.cqmask;
  865. uresp.cqid = chp->cq.cqid;
  866. uresp.size = chp->cq.size;
  867. uresp.memsize = chp->cq.memsize;
  868. spin_lock(&ucontext->mmap_lock);
  869. uresp.key = ucontext->key;
  870. ucontext->key += PAGE_SIZE;
  871. uresp.gts_key = ucontext->key;
  872. ucontext->key += PAGE_SIZE;
  873. spin_unlock(&ucontext->mmap_lock);
  874. ret = ib_copy_to_udata(udata, &uresp,
  875. sizeof(uresp) - sizeof(uresp.reserved));
  876. if (ret)
  877. goto err6;
  878. mm->key = uresp.key;
  879. mm->addr = virt_to_phys(chp->cq.queue);
  880. mm->len = chp->cq.memsize;
  881. insert_mmap(ucontext, mm);
  882. mm2->key = uresp.gts_key;
  883. mm2->addr = chp->cq.bar2_pa;
  884. mm2->len = PAGE_SIZE;
  885. insert_mmap(ucontext, mm2);
  886. }
  887. PDBG("%s cqid 0x%0x chp %p size %u memsize %zu, dma_addr 0x%0llx\n",
  888. __func__, chp->cq.cqid, chp, chp->cq.size,
  889. chp->cq.memsize, (unsigned long long) chp->cq.dma_addr);
  890. return &chp->ibcq;
  891. err6:
  892. kfree(mm2);
  893. err5:
  894. kfree(mm);
  895. err4:
  896. remove_handle(rhp, &rhp->cqidr, chp->cq.cqid);
  897. err3:
  898. destroy_cq(&chp->rhp->rdev, &chp->cq,
  899. ucontext ? &ucontext->uctx : &rhp->rdev.uctx,
  900. chp->destroy_skb);
  901. err2:
  902. kfree_skb(chp->destroy_skb);
  903. err1:
  904. kfree(chp);
  905. return ERR_PTR(ret);
  906. }
  907. int c4iw_resize_cq(struct ib_cq *cq, int cqe, struct ib_udata *udata)
  908. {
  909. return -ENOSYS;
  910. }
  911. int c4iw_arm_cq(struct ib_cq *ibcq, enum ib_cq_notify_flags flags)
  912. {
  913. struct c4iw_cq *chp;
  914. int ret = 0;
  915. unsigned long flag;
  916. chp = to_c4iw_cq(ibcq);
  917. spin_lock_irqsave(&chp->lock, flag);
  918. t4_arm_cq(&chp->cq,
  919. (flags & IB_CQ_SOLICITED_MASK) == IB_CQ_SOLICITED);
  920. if (flags & IB_CQ_REPORT_MISSED_EVENTS)
  921. ret = t4_cq_notempty(&chp->cq);
  922. spin_unlock_irqrestore(&chp->lock, flag);
  923. return ret;
  924. }