cq.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981
  1. /*
  2. * Copyright (c) 2007 Cisco Systems, Inc. All rights reserved.
  3. * Copyright (c) 2007, 2008 Mellanox Technologies. All rights reserved.
  4. *
  5. * This software is available to you under a choice of one of two
  6. * licenses. You may choose to be licensed under the terms of the GNU
  7. * General Public License (GPL) Version 2, available from the file
  8. * COPYING in the main directory of this source tree, or the
  9. * OpenIB.org BSD license below:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * - Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  19. * - Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials
  22. * provided with the distribution.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  25. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  26. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  27. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  28. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  29. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  30. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  31. * SOFTWARE.
  32. */
  33. #include <linux/mlx4/cq.h>
  34. #include <linux/mlx4/qp.h>
  35. #include <linux/mlx4/srq.h>
  36. #include <linux/slab.h>
  37. #include "mlx4_ib.h"
  38. #include <rdma/mlx4-abi.h>
  39. static void mlx4_ib_cq_comp(struct mlx4_cq *cq)
  40. {
  41. struct ib_cq *ibcq = &to_mibcq(cq)->ibcq;
  42. ibcq->comp_handler(ibcq, ibcq->cq_context);
  43. }
  44. static void mlx4_ib_cq_event(struct mlx4_cq *cq, enum mlx4_event type)
  45. {
  46. struct ib_event event;
  47. struct ib_cq *ibcq;
  48. if (type != MLX4_EVENT_TYPE_CQ_ERROR) {
  49. pr_warn("Unexpected event type %d "
  50. "on CQ %06x\n", type, cq->cqn);
  51. return;
  52. }
  53. ibcq = &to_mibcq(cq)->ibcq;
  54. if (ibcq->event_handler) {
  55. event.device = ibcq->device;
  56. event.event = IB_EVENT_CQ_ERR;
  57. event.element.cq = ibcq;
  58. ibcq->event_handler(&event, ibcq->cq_context);
  59. }
  60. }
  61. static void *get_cqe_from_buf(struct mlx4_ib_cq_buf *buf, int n)
  62. {
  63. return mlx4_buf_offset(&buf->buf, n * buf->entry_size);
  64. }
  65. static void *get_cqe(struct mlx4_ib_cq *cq, int n)
  66. {
  67. return get_cqe_from_buf(&cq->buf, n);
  68. }
  69. static void *get_sw_cqe(struct mlx4_ib_cq *cq, int n)
  70. {
  71. struct mlx4_cqe *cqe = get_cqe(cq, n & cq->ibcq.cqe);
  72. struct mlx4_cqe *tcqe = ((cq->buf.entry_size == 64) ? (cqe + 1) : cqe);
  73. return (!!(tcqe->owner_sr_opcode & MLX4_CQE_OWNER_MASK) ^
  74. !!(n & (cq->ibcq.cqe + 1))) ? NULL : cqe;
  75. }
  76. static struct mlx4_cqe *next_cqe_sw(struct mlx4_ib_cq *cq)
  77. {
  78. return get_sw_cqe(cq, cq->mcq.cons_index);
  79. }
  80. int mlx4_ib_modify_cq(struct ib_cq *cq, u16 cq_count, u16 cq_period)
  81. {
  82. struct mlx4_ib_cq *mcq = to_mcq(cq);
  83. struct mlx4_ib_dev *dev = to_mdev(cq->device);
  84. return mlx4_cq_modify(dev->dev, &mcq->mcq, cq_count, cq_period);
  85. }
  86. static int mlx4_ib_alloc_cq_buf(struct mlx4_ib_dev *dev, struct mlx4_ib_cq_buf *buf, int nent)
  87. {
  88. int err;
  89. err = mlx4_buf_alloc(dev->dev, nent * dev->dev->caps.cqe_size,
  90. PAGE_SIZE * 2, &buf->buf);
  91. if (err)
  92. goto out;
  93. buf->entry_size = dev->dev->caps.cqe_size;
  94. err = mlx4_mtt_init(dev->dev, buf->buf.npages, buf->buf.page_shift,
  95. &buf->mtt);
  96. if (err)
  97. goto err_buf;
  98. err = mlx4_buf_write_mtt(dev->dev, &buf->mtt, &buf->buf);
  99. if (err)
  100. goto err_mtt;
  101. return 0;
  102. err_mtt:
  103. mlx4_mtt_cleanup(dev->dev, &buf->mtt);
  104. err_buf:
  105. mlx4_buf_free(dev->dev, nent * buf->entry_size, &buf->buf);
  106. out:
  107. return err;
  108. }
  109. static void mlx4_ib_free_cq_buf(struct mlx4_ib_dev *dev, struct mlx4_ib_cq_buf *buf, int cqe)
  110. {
  111. mlx4_buf_free(dev->dev, (cqe + 1) * buf->entry_size, &buf->buf);
  112. }
  113. static int mlx4_ib_get_cq_umem(struct mlx4_ib_dev *dev, struct ib_ucontext *context,
  114. struct mlx4_ib_cq_buf *buf, struct ib_umem **umem,
  115. u64 buf_addr, int cqe)
  116. {
  117. int err;
  118. int cqe_size = dev->dev->caps.cqe_size;
  119. int shift;
  120. int n;
  121. *umem = ib_umem_get(context, buf_addr, cqe * cqe_size,
  122. IB_ACCESS_LOCAL_WRITE, 1);
  123. if (IS_ERR(*umem))
  124. return PTR_ERR(*umem);
  125. n = ib_umem_page_count(*umem);
  126. shift = mlx4_ib_umem_calc_optimal_mtt_size(*umem, 0, &n);
  127. err = mlx4_mtt_init(dev->dev, n, shift, &buf->mtt);
  128. if (err)
  129. goto err_buf;
  130. err = mlx4_ib_umem_write_mtt(dev, &buf->mtt, *umem);
  131. if (err)
  132. goto err_mtt;
  133. return 0;
  134. err_mtt:
  135. mlx4_mtt_cleanup(dev->dev, &buf->mtt);
  136. err_buf:
  137. ib_umem_release(*umem);
  138. return err;
  139. }
  140. #define CQ_CREATE_FLAGS_SUPPORTED IB_UVERBS_CQ_FLAGS_TIMESTAMP_COMPLETION
  141. struct ib_cq *mlx4_ib_create_cq(struct ib_device *ibdev,
  142. const struct ib_cq_init_attr *attr,
  143. struct ib_ucontext *context,
  144. struct ib_udata *udata)
  145. {
  146. int entries = attr->cqe;
  147. int vector = attr->comp_vector;
  148. struct mlx4_ib_dev *dev = to_mdev(ibdev);
  149. struct mlx4_ib_cq *cq;
  150. struct mlx4_uar *uar;
  151. int err;
  152. if (entries < 1 || entries > dev->dev->caps.max_cqes)
  153. return ERR_PTR(-EINVAL);
  154. if (attr->flags & ~CQ_CREATE_FLAGS_SUPPORTED)
  155. return ERR_PTR(-EINVAL);
  156. cq = kmalloc(sizeof *cq, GFP_KERNEL);
  157. if (!cq)
  158. return ERR_PTR(-ENOMEM);
  159. entries = roundup_pow_of_two(entries + 1);
  160. cq->ibcq.cqe = entries - 1;
  161. mutex_init(&cq->resize_mutex);
  162. spin_lock_init(&cq->lock);
  163. cq->resize_buf = NULL;
  164. cq->resize_umem = NULL;
  165. cq->create_flags = attr->flags;
  166. INIT_LIST_HEAD(&cq->send_qp_list);
  167. INIT_LIST_HEAD(&cq->recv_qp_list);
  168. if (context) {
  169. struct mlx4_ib_create_cq ucmd;
  170. if (ib_copy_from_udata(&ucmd, udata, sizeof ucmd)) {
  171. err = -EFAULT;
  172. goto err_cq;
  173. }
  174. err = mlx4_ib_get_cq_umem(dev, context, &cq->buf, &cq->umem,
  175. ucmd.buf_addr, entries);
  176. if (err)
  177. goto err_cq;
  178. err = mlx4_ib_db_map_user(to_mucontext(context), ucmd.db_addr,
  179. &cq->db);
  180. if (err)
  181. goto err_mtt;
  182. uar = &to_mucontext(context)->uar;
  183. cq->mcq.usage = MLX4_RES_USAGE_USER_VERBS;
  184. } else {
  185. err = mlx4_db_alloc(dev->dev, &cq->db, 1);
  186. if (err)
  187. goto err_cq;
  188. cq->mcq.set_ci_db = cq->db.db;
  189. cq->mcq.arm_db = cq->db.db + 1;
  190. *cq->mcq.set_ci_db = 0;
  191. *cq->mcq.arm_db = 0;
  192. err = mlx4_ib_alloc_cq_buf(dev, &cq->buf, entries);
  193. if (err)
  194. goto err_db;
  195. uar = &dev->priv_uar;
  196. cq->mcq.usage = MLX4_RES_USAGE_DRIVER;
  197. }
  198. if (dev->eq_table)
  199. vector = dev->eq_table[vector % ibdev->num_comp_vectors];
  200. err = mlx4_cq_alloc(dev->dev, entries, &cq->buf.mtt, uar,
  201. cq->db.dma, &cq->mcq, vector, 0,
  202. !!(cq->create_flags & IB_UVERBS_CQ_FLAGS_TIMESTAMP_COMPLETION));
  203. if (err)
  204. goto err_dbmap;
  205. if (context)
  206. cq->mcq.tasklet_ctx.comp = mlx4_ib_cq_comp;
  207. else
  208. cq->mcq.comp = mlx4_ib_cq_comp;
  209. cq->mcq.event = mlx4_ib_cq_event;
  210. if (context)
  211. if (ib_copy_to_udata(udata, &cq->mcq.cqn, sizeof (__u32))) {
  212. err = -EFAULT;
  213. goto err_cq_free;
  214. }
  215. return &cq->ibcq;
  216. err_cq_free:
  217. mlx4_cq_free(dev->dev, &cq->mcq);
  218. err_dbmap:
  219. if (context)
  220. mlx4_ib_db_unmap_user(to_mucontext(context), &cq->db);
  221. err_mtt:
  222. mlx4_mtt_cleanup(dev->dev, &cq->buf.mtt);
  223. if (context)
  224. ib_umem_release(cq->umem);
  225. else
  226. mlx4_ib_free_cq_buf(dev, &cq->buf, cq->ibcq.cqe);
  227. err_db:
  228. if (!context)
  229. mlx4_db_free(dev->dev, &cq->db);
  230. err_cq:
  231. kfree(cq);
  232. return ERR_PTR(err);
  233. }
  234. static int mlx4_alloc_resize_buf(struct mlx4_ib_dev *dev, struct mlx4_ib_cq *cq,
  235. int entries)
  236. {
  237. int err;
  238. if (cq->resize_buf)
  239. return -EBUSY;
  240. cq->resize_buf = kmalloc(sizeof *cq->resize_buf, GFP_KERNEL);
  241. if (!cq->resize_buf)
  242. return -ENOMEM;
  243. err = mlx4_ib_alloc_cq_buf(dev, &cq->resize_buf->buf, entries);
  244. if (err) {
  245. kfree(cq->resize_buf);
  246. cq->resize_buf = NULL;
  247. return err;
  248. }
  249. cq->resize_buf->cqe = entries - 1;
  250. return 0;
  251. }
  252. static int mlx4_alloc_resize_umem(struct mlx4_ib_dev *dev, struct mlx4_ib_cq *cq,
  253. int entries, struct ib_udata *udata)
  254. {
  255. struct mlx4_ib_resize_cq ucmd;
  256. int err;
  257. if (cq->resize_umem)
  258. return -EBUSY;
  259. if (ib_copy_from_udata(&ucmd, udata, sizeof ucmd))
  260. return -EFAULT;
  261. cq->resize_buf = kmalloc(sizeof *cq->resize_buf, GFP_KERNEL);
  262. if (!cq->resize_buf)
  263. return -ENOMEM;
  264. err = mlx4_ib_get_cq_umem(dev, cq->umem->context, &cq->resize_buf->buf,
  265. &cq->resize_umem, ucmd.buf_addr, entries);
  266. if (err) {
  267. kfree(cq->resize_buf);
  268. cq->resize_buf = NULL;
  269. return err;
  270. }
  271. cq->resize_buf->cqe = entries - 1;
  272. return 0;
  273. }
  274. static int mlx4_ib_get_outstanding_cqes(struct mlx4_ib_cq *cq)
  275. {
  276. u32 i;
  277. i = cq->mcq.cons_index;
  278. while (get_sw_cqe(cq, i))
  279. ++i;
  280. return i - cq->mcq.cons_index;
  281. }
  282. static void mlx4_ib_cq_resize_copy_cqes(struct mlx4_ib_cq *cq)
  283. {
  284. struct mlx4_cqe *cqe, *new_cqe;
  285. int i;
  286. int cqe_size = cq->buf.entry_size;
  287. int cqe_inc = cqe_size == 64 ? 1 : 0;
  288. i = cq->mcq.cons_index;
  289. cqe = get_cqe(cq, i & cq->ibcq.cqe);
  290. cqe += cqe_inc;
  291. while ((cqe->owner_sr_opcode & MLX4_CQE_OPCODE_MASK) != MLX4_CQE_OPCODE_RESIZE) {
  292. new_cqe = get_cqe_from_buf(&cq->resize_buf->buf,
  293. (i + 1) & cq->resize_buf->cqe);
  294. memcpy(new_cqe, get_cqe(cq, i & cq->ibcq.cqe), cqe_size);
  295. new_cqe += cqe_inc;
  296. new_cqe->owner_sr_opcode = (cqe->owner_sr_opcode & ~MLX4_CQE_OWNER_MASK) |
  297. (((i + 1) & (cq->resize_buf->cqe + 1)) ? MLX4_CQE_OWNER_MASK : 0);
  298. cqe = get_cqe(cq, ++i & cq->ibcq.cqe);
  299. cqe += cqe_inc;
  300. }
  301. ++cq->mcq.cons_index;
  302. }
  303. int mlx4_ib_resize_cq(struct ib_cq *ibcq, int entries, struct ib_udata *udata)
  304. {
  305. struct mlx4_ib_dev *dev = to_mdev(ibcq->device);
  306. struct mlx4_ib_cq *cq = to_mcq(ibcq);
  307. struct mlx4_mtt mtt;
  308. int outst_cqe;
  309. int err;
  310. mutex_lock(&cq->resize_mutex);
  311. if (entries < 1 || entries > dev->dev->caps.max_cqes) {
  312. err = -EINVAL;
  313. goto out;
  314. }
  315. entries = roundup_pow_of_two(entries + 1);
  316. if (entries == ibcq->cqe + 1) {
  317. err = 0;
  318. goto out;
  319. }
  320. if (entries > dev->dev->caps.max_cqes + 1) {
  321. err = -EINVAL;
  322. goto out;
  323. }
  324. if (ibcq->uobject) {
  325. err = mlx4_alloc_resize_umem(dev, cq, entries, udata);
  326. if (err)
  327. goto out;
  328. } else {
  329. /* Can't be smaller than the number of outstanding CQEs */
  330. outst_cqe = mlx4_ib_get_outstanding_cqes(cq);
  331. if (entries < outst_cqe + 1) {
  332. err = -EINVAL;
  333. goto out;
  334. }
  335. err = mlx4_alloc_resize_buf(dev, cq, entries);
  336. if (err)
  337. goto out;
  338. }
  339. mtt = cq->buf.mtt;
  340. err = mlx4_cq_resize(dev->dev, &cq->mcq, entries, &cq->resize_buf->buf.mtt);
  341. if (err)
  342. goto err_buf;
  343. mlx4_mtt_cleanup(dev->dev, &mtt);
  344. if (ibcq->uobject) {
  345. cq->buf = cq->resize_buf->buf;
  346. cq->ibcq.cqe = cq->resize_buf->cqe;
  347. ib_umem_release(cq->umem);
  348. cq->umem = cq->resize_umem;
  349. kfree(cq->resize_buf);
  350. cq->resize_buf = NULL;
  351. cq->resize_umem = NULL;
  352. } else {
  353. struct mlx4_ib_cq_buf tmp_buf;
  354. int tmp_cqe = 0;
  355. spin_lock_irq(&cq->lock);
  356. if (cq->resize_buf) {
  357. mlx4_ib_cq_resize_copy_cqes(cq);
  358. tmp_buf = cq->buf;
  359. tmp_cqe = cq->ibcq.cqe;
  360. cq->buf = cq->resize_buf->buf;
  361. cq->ibcq.cqe = cq->resize_buf->cqe;
  362. kfree(cq->resize_buf);
  363. cq->resize_buf = NULL;
  364. }
  365. spin_unlock_irq(&cq->lock);
  366. if (tmp_cqe)
  367. mlx4_ib_free_cq_buf(dev, &tmp_buf, tmp_cqe);
  368. }
  369. goto out;
  370. err_buf:
  371. mlx4_mtt_cleanup(dev->dev, &cq->resize_buf->buf.mtt);
  372. if (!ibcq->uobject)
  373. mlx4_ib_free_cq_buf(dev, &cq->resize_buf->buf,
  374. cq->resize_buf->cqe);
  375. kfree(cq->resize_buf);
  376. cq->resize_buf = NULL;
  377. if (cq->resize_umem) {
  378. ib_umem_release(cq->resize_umem);
  379. cq->resize_umem = NULL;
  380. }
  381. out:
  382. mutex_unlock(&cq->resize_mutex);
  383. return err;
  384. }
  385. int mlx4_ib_destroy_cq(struct ib_cq *cq)
  386. {
  387. struct mlx4_ib_dev *dev = to_mdev(cq->device);
  388. struct mlx4_ib_cq *mcq = to_mcq(cq);
  389. mlx4_cq_free(dev->dev, &mcq->mcq);
  390. mlx4_mtt_cleanup(dev->dev, &mcq->buf.mtt);
  391. if (cq->uobject) {
  392. mlx4_ib_db_unmap_user(to_mucontext(cq->uobject->context), &mcq->db);
  393. ib_umem_release(mcq->umem);
  394. } else {
  395. mlx4_ib_free_cq_buf(dev, &mcq->buf, cq->cqe);
  396. mlx4_db_free(dev->dev, &mcq->db);
  397. }
  398. kfree(mcq);
  399. return 0;
  400. }
  401. static void dump_cqe(void *cqe)
  402. {
  403. __be32 *buf = cqe;
  404. pr_debug("CQE contents %08x %08x %08x %08x %08x %08x %08x %08x\n",
  405. be32_to_cpu(buf[0]), be32_to_cpu(buf[1]), be32_to_cpu(buf[2]),
  406. be32_to_cpu(buf[3]), be32_to_cpu(buf[4]), be32_to_cpu(buf[5]),
  407. be32_to_cpu(buf[6]), be32_to_cpu(buf[7]));
  408. }
  409. static void mlx4_ib_handle_error_cqe(struct mlx4_err_cqe *cqe,
  410. struct ib_wc *wc)
  411. {
  412. if (cqe->syndrome == MLX4_CQE_SYNDROME_LOCAL_QP_OP_ERR) {
  413. pr_debug("local QP operation err "
  414. "(QPN %06x, WQE index %x, vendor syndrome %02x, "
  415. "opcode = %02x)\n",
  416. be32_to_cpu(cqe->my_qpn), be16_to_cpu(cqe->wqe_index),
  417. cqe->vendor_err_syndrome,
  418. cqe->owner_sr_opcode & ~MLX4_CQE_OWNER_MASK);
  419. dump_cqe(cqe);
  420. }
  421. switch (cqe->syndrome) {
  422. case MLX4_CQE_SYNDROME_LOCAL_LENGTH_ERR:
  423. wc->status = IB_WC_LOC_LEN_ERR;
  424. break;
  425. case MLX4_CQE_SYNDROME_LOCAL_QP_OP_ERR:
  426. wc->status = IB_WC_LOC_QP_OP_ERR;
  427. break;
  428. case MLX4_CQE_SYNDROME_LOCAL_PROT_ERR:
  429. wc->status = IB_WC_LOC_PROT_ERR;
  430. break;
  431. case MLX4_CQE_SYNDROME_WR_FLUSH_ERR:
  432. wc->status = IB_WC_WR_FLUSH_ERR;
  433. break;
  434. case MLX4_CQE_SYNDROME_MW_BIND_ERR:
  435. wc->status = IB_WC_MW_BIND_ERR;
  436. break;
  437. case MLX4_CQE_SYNDROME_BAD_RESP_ERR:
  438. wc->status = IB_WC_BAD_RESP_ERR;
  439. break;
  440. case MLX4_CQE_SYNDROME_LOCAL_ACCESS_ERR:
  441. wc->status = IB_WC_LOC_ACCESS_ERR;
  442. break;
  443. case MLX4_CQE_SYNDROME_REMOTE_INVAL_REQ_ERR:
  444. wc->status = IB_WC_REM_INV_REQ_ERR;
  445. break;
  446. case MLX4_CQE_SYNDROME_REMOTE_ACCESS_ERR:
  447. wc->status = IB_WC_REM_ACCESS_ERR;
  448. break;
  449. case MLX4_CQE_SYNDROME_REMOTE_OP_ERR:
  450. wc->status = IB_WC_REM_OP_ERR;
  451. break;
  452. case MLX4_CQE_SYNDROME_TRANSPORT_RETRY_EXC_ERR:
  453. wc->status = IB_WC_RETRY_EXC_ERR;
  454. break;
  455. case MLX4_CQE_SYNDROME_RNR_RETRY_EXC_ERR:
  456. wc->status = IB_WC_RNR_RETRY_EXC_ERR;
  457. break;
  458. case MLX4_CQE_SYNDROME_REMOTE_ABORTED_ERR:
  459. wc->status = IB_WC_REM_ABORT_ERR;
  460. break;
  461. default:
  462. wc->status = IB_WC_GENERAL_ERR;
  463. break;
  464. }
  465. wc->vendor_err = cqe->vendor_err_syndrome;
  466. }
  467. static int mlx4_ib_ipoib_csum_ok(__be16 status, __be16 checksum)
  468. {
  469. return ((status & cpu_to_be16(MLX4_CQE_STATUS_IPV4 |
  470. MLX4_CQE_STATUS_IPV4F |
  471. MLX4_CQE_STATUS_IPV4OPT |
  472. MLX4_CQE_STATUS_IPV6 |
  473. MLX4_CQE_STATUS_IPOK)) ==
  474. cpu_to_be16(MLX4_CQE_STATUS_IPV4 |
  475. MLX4_CQE_STATUS_IPOK)) &&
  476. (status & cpu_to_be16(MLX4_CQE_STATUS_UDP |
  477. MLX4_CQE_STATUS_TCP)) &&
  478. checksum == cpu_to_be16(0xffff);
  479. }
  480. static void use_tunnel_data(struct mlx4_ib_qp *qp, struct mlx4_ib_cq *cq, struct ib_wc *wc,
  481. unsigned tail, struct mlx4_cqe *cqe, int is_eth)
  482. {
  483. struct mlx4_ib_proxy_sqp_hdr *hdr;
  484. ib_dma_sync_single_for_cpu(qp->ibqp.device,
  485. qp->sqp_proxy_rcv[tail].map,
  486. sizeof (struct mlx4_ib_proxy_sqp_hdr),
  487. DMA_FROM_DEVICE);
  488. hdr = (struct mlx4_ib_proxy_sqp_hdr *) (qp->sqp_proxy_rcv[tail].addr);
  489. wc->pkey_index = be16_to_cpu(hdr->tun.pkey_index);
  490. wc->src_qp = be32_to_cpu(hdr->tun.flags_src_qp) & 0xFFFFFF;
  491. wc->wc_flags |= (hdr->tun.g_ml_path & 0x80) ? (IB_WC_GRH) : 0;
  492. wc->dlid_path_bits = 0;
  493. if (is_eth) {
  494. wc->slid = 0;
  495. wc->vlan_id = be16_to_cpu(hdr->tun.sl_vid);
  496. memcpy(&(wc->smac[0]), (char *)&hdr->tun.mac_31_0, 4);
  497. memcpy(&(wc->smac[4]), (char *)&hdr->tun.slid_mac_47_32, 2);
  498. wc->wc_flags |= (IB_WC_WITH_VLAN | IB_WC_WITH_SMAC);
  499. } else {
  500. wc->slid = be16_to_cpu(hdr->tun.slid_mac_47_32);
  501. wc->sl = (u8) (be16_to_cpu(hdr->tun.sl_vid) >> 12);
  502. }
  503. }
  504. static void mlx4_ib_qp_sw_comp(struct mlx4_ib_qp *qp, int num_entries,
  505. struct ib_wc *wc, int *npolled, int is_send)
  506. {
  507. struct mlx4_ib_wq *wq;
  508. unsigned cur;
  509. int i;
  510. wq = is_send ? &qp->sq : &qp->rq;
  511. cur = wq->head - wq->tail;
  512. if (cur == 0)
  513. return;
  514. for (i = 0; i < cur && *npolled < num_entries; i++) {
  515. wc->wr_id = wq->wrid[wq->tail & (wq->wqe_cnt - 1)];
  516. wc->status = IB_WC_WR_FLUSH_ERR;
  517. wc->vendor_err = MLX4_CQE_SYNDROME_WR_FLUSH_ERR;
  518. wq->tail++;
  519. (*npolled)++;
  520. wc->qp = &qp->ibqp;
  521. wc++;
  522. }
  523. }
  524. static void mlx4_ib_poll_sw_comp(struct mlx4_ib_cq *cq, int num_entries,
  525. struct ib_wc *wc, int *npolled)
  526. {
  527. struct mlx4_ib_qp *qp;
  528. *npolled = 0;
  529. /* Find uncompleted WQEs belonging to that cq and return
  530. * simulated FLUSH_ERR completions
  531. */
  532. list_for_each_entry(qp, &cq->send_qp_list, cq_send_list) {
  533. mlx4_ib_qp_sw_comp(qp, num_entries, wc + *npolled, npolled, 1);
  534. if (*npolled >= num_entries)
  535. goto out;
  536. }
  537. list_for_each_entry(qp, &cq->recv_qp_list, cq_recv_list) {
  538. mlx4_ib_qp_sw_comp(qp, num_entries, wc + *npolled, npolled, 0);
  539. if (*npolled >= num_entries)
  540. goto out;
  541. }
  542. out:
  543. return;
  544. }
  545. static int mlx4_ib_poll_one(struct mlx4_ib_cq *cq,
  546. struct mlx4_ib_qp **cur_qp,
  547. struct ib_wc *wc)
  548. {
  549. struct mlx4_cqe *cqe;
  550. struct mlx4_qp *mqp;
  551. struct mlx4_ib_wq *wq;
  552. struct mlx4_ib_srq *srq;
  553. struct mlx4_srq *msrq = NULL;
  554. int is_send;
  555. int is_error;
  556. int is_eth;
  557. u32 g_mlpath_rqpn;
  558. u16 wqe_ctr;
  559. unsigned tail = 0;
  560. repoll:
  561. cqe = next_cqe_sw(cq);
  562. if (!cqe)
  563. return -EAGAIN;
  564. if (cq->buf.entry_size == 64)
  565. cqe++;
  566. ++cq->mcq.cons_index;
  567. /*
  568. * Make sure we read CQ entry contents after we've checked the
  569. * ownership bit.
  570. */
  571. rmb();
  572. is_send = cqe->owner_sr_opcode & MLX4_CQE_IS_SEND_MASK;
  573. is_error = (cqe->owner_sr_opcode & MLX4_CQE_OPCODE_MASK) ==
  574. MLX4_CQE_OPCODE_ERROR;
  575. /* Resize CQ in progress */
  576. if (unlikely((cqe->owner_sr_opcode & MLX4_CQE_OPCODE_MASK) == MLX4_CQE_OPCODE_RESIZE)) {
  577. if (cq->resize_buf) {
  578. struct mlx4_ib_dev *dev = to_mdev(cq->ibcq.device);
  579. mlx4_ib_free_cq_buf(dev, &cq->buf, cq->ibcq.cqe);
  580. cq->buf = cq->resize_buf->buf;
  581. cq->ibcq.cqe = cq->resize_buf->cqe;
  582. kfree(cq->resize_buf);
  583. cq->resize_buf = NULL;
  584. }
  585. goto repoll;
  586. }
  587. if (!*cur_qp ||
  588. (be32_to_cpu(cqe->vlan_my_qpn) & MLX4_CQE_QPN_MASK) != (*cur_qp)->mqp.qpn) {
  589. /*
  590. * We do not have to take the QP table lock here,
  591. * because CQs will be locked while QPs are removed
  592. * from the table.
  593. */
  594. mqp = __mlx4_qp_lookup(to_mdev(cq->ibcq.device)->dev,
  595. be32_to_cpu(cqe->vlan_my_qpn));
  596. *cur_qp = to_mibqp(mqp);
  597. }
  598. wc->qp = &(*cur_qp)->ibqp;
  599. if (wc->qp->qp_type == IB_QPT_XRC_TGT) {
  600. u32 srq_num;
  601. g_mlpath_rqpn = be32_to_cpu(cqe->g_mlpath_rqpn);
  602. srq_num = g_mlpath_rqpn & 0xffffff;
  603. /* SRQ is also in the radix tree */
  604. msrq = mlx4_srq_lookup(to_mdev(cq->ibcq.device)->dev,
  605. srq_num);
  606. }
  607. if (is_send) {
  608. wq = &(*cur_qp)->sq;
  609. if (!(*cur_qp)->sq_signal_bits) {
  610. wqe_ctr = be16_to_cpu(cqe->wqe_index);
  611. wq->tail += (u16) (wqe_ctr - (u16) wq->tail);
  612. }
  613. wc->wr_id = wq->wrid[wq->tail & (wq->wqe_cnt - 1)];
  614. ++wq->tail;
  615. } else if ((*cur_qp)->ibqp.srq) {
  616. srq = to_msrq((*cur_qp)->ibqp.srq);
  617. wqe_ctr = be16_to_cpu(cqe->wqe_index);
  618. wc->wr_id = srq->wrid[wqe_ctr];
  619. mlx4_ib_free_srq_wqe(srq, wqe_ctr);
  620. } else if (msrq) {
  621. srq = to_mibsrq(msrq);
  622. wqe_ctr = be16_to_cpu(cqe->wqe_index);
  623. wc->wr_id = srq->wrid[wqe_ctr];
  624. mlx4_ib_free_srq_wqe(srq, wqe_ctr);
  625. } else {
  626. wq = &(*cur_qp)->rq;
  627. tail = wq->tail & (wq->wqe_cnt - 1);
  628. wc->wr_id = wq->wrid[tail];
  629. ++wq->tail;
  630. }
  631. if (unlikely(is_error)) {
  632. mlx4_ib_handle_error_cqe((struct mlx4_err_cqe *) cqe, wc);
  633. return 0;
  634. }
  635. wc->status = IB_WC_SUCCESS;
  636. if (is_send) {
  637. wc->wc_flags = 0;
  638. switch (cqe->owner_sr_opcode & MLX4_CQE_OPCODE_MASK) {
  639. case MLX4_OPCODE_RDMA_WRITE_IMM:
  640. wc->wc_flags |= IB_WC_WITH_IMM;
  641. /* fall through */
  642. case MLX4_OPCODE_RDMA_WRITE:
  643. wc->opcode = IB_WC_RDMA_WRITE;
  644. break;
  645. case MLX4_OPCODE_SEND_IMM:
  646. wc->wc_flags |= IB_WC_WITH_IMM;
  647. /* fall through */
  648. case MLX4_OPCODE_SEND:
  649. case MLX4_OPCODE_SEND_INVAL:
  650. wc->opcode = IB_WC_SEND;
  651. break;
  652. case MLX4_OPCODE_RDMA_READ:
  653. wc->opcode = IB_WC_RDMA_READ;
  654. wc->byte_len = be32_to_cpu(cqe->byte_cnt);
  655. break;
  656. case MLX4_OPCODE_ATOMIC_CS:
  657. wc->opcode = IB_WC_COMP_SWAP;
  658. wc->byte_len = 8;
  659. break;
  660. case MLX4_OPCODE_ATOMIC_FA:
  661. wc->opcode = IB_WC_FETCH_ADD;
  662. wc->byte_len = 8;
  663. break;
  664. case MLX4_OPCODE_MASKED_ATOMIC_CS:
  665. wc->opcode = IB_WC_MASKED_COMP_SWAP;
  666. wc->byte_len = 8;
  667. break;
  668. case MLX4_OPCODE_MASKED_ATOMIC_FA:
  669. wc->opcode = IB_WC_MASKED_FETCH_ADD;
  670. wc->byte_len = 8;
  671. break;
  672. case MLX4_OPCODE_LSO:
  673. wc->opcode = IB_WC_LSO;
  674. break;
  675. case MLX4_OPCODE_FMR:
  676. wc->opcode = IB_WC_REG_MR;
  677. break;
  678. case MLX4_OPCODE_LOCAL_INVAL:
  679. wc->opcode = IB_WC_LOCAL_INV;
  680. break;
  681. }
  682. } else {
  683. wc->byte_len = be32_to_cpu(cqe->byte_cnt);
  684. switch (cqe->owner_sr_opcode & MLX4_CQE_OPCODE_MASK) {
  685. case MLX4_RECV_OPCODE_RDMA_WRITE_IMM:
  686. wc->opcode = IB_WC_RECV_RDMA_WITH_IMM;
  687. wc->wc_flags = IB_WC_WITH_IMM;
  688. wc->ex.imm_data = cqe->immed_rss_invalid;
  689. break;
  690. case MLX4_RECV_OPCODE_SEND_INVAL:
  691. wc->opcode = IB_WC_RECV;
  692. wc->wc_flags = IB_WC_WITH_INVALIDATE;
  693. wc->ex.invalidate_rkey = be32_to_cpu(cqe->immed_rss_invalid);
  694. break;
  695. case MLX4_RECV_OPCODE_SEND:
  696. wc->opcode = IB_WC_RECV;
  697. wc->wc_flags = 0;
  698. break;
  699. case MLX4_RECV_OPCODE_SEND_IMM:
  700. wc->opcode = IB_WC_RECV;
  701. wc->wc_flags = IB_WC_WITH_IMM;
  702. wc->ex.imm_data = cqe->immed_rss_invalid;
  703. break;
  704. }
  705. is_eth = (rdma_port_get_link_layer(wc->qp->device,
  706. (*cur_qp)->port) ==
  707. IB_LINK_LAYER_ETHERNET);
  708. if (mlx4_is_mfunc(to_mdev(cq->ibcq.device)->dev)) {
  709. if ((*cur_qp)->mlx4_ib_qp_type &
  710. (MLX4_IB_QPT_PROXY_SMI_OWNER |
  711. MLX4_IB_QPT_PROXY_SMI | MLX4_IB_QPT_PROXY_GSI)) {
  712. use_tunnel_data(*cur_qp, cq, wc, tail, cqe,
  713. is_eth);
  714. return 0;
  715. }
  716. }
  717. g_mlpath_rqpn = be32_to_cpu(cqe->g_mlpath_rqpn);
  718. wc->src_qp = g_mlpath_rqpn & 0xffffff;
  719. wc->dlid_path_bits = (g_mlpath_rqpn >> 24) & 0x7f;
  720. wc->wc_flags |= g_mlpath_rqpn & 0x80000000 ? IB_WC_GRH : 0;
  721. wc->pkey_index = be32_to_cpu(cqe->immed_rss_invalid) & 0x7f;
  722. wc->wc_flags |= mlx4_ib_ipoib_csum_ok(cqe->status,
  723. cqe->checksum) ? IB_WC_IP_CSUM_OK : 0;
  724. if (is_eth) {
  725. wc->slid = 0;
  726. wc->sl = be16_to_cpu(cqe->sl_vid) >> 13;
  727. if (be32_to_cpu(cqe->vlan_my_qpn) &
  728. MLX4_CQE_CVLAN_PRESENT_MASK) {
  729. wc->vlan_id = be16_to_cpu(cqe->sl_vid) &
  730. MLX4_CQE_VID_MASK;
  731. } else {
  732. wc->vlan_id = 0xffff;
  733. }
  734. memcpy(wc->smac, cqe->smac, ETH_ALEN);
  735. wc->wc_flags |= (IB_WC_WITH_VLAN | IB_WC_WITH_SMAC);
  736. } else {
  737. wc->slid = be16_to_cpu(cqe->rlid);
  738. wc->sl = be16_to_cpu(cqe->sl_vid) >> 12;
  739. wc->vlan_id = 0xffff;
  740. }
  741. }
  742. return 0;
  743. }
  744. int mlx4_ib_poll_cq(struct ib_cq *ibcq, int num_entries, struct ib_wc *wc)
  745. {
  746. struct mlx4_ib_cq *cq = to_mcq(ibcq);
  747. struct mlx4_ib_qp *cur_qp = NULL;
  748. unsigned long flags;
  749. int npolled;
  750. struct mlx4_ib_dev *mdev = to_mdev(cq->ibcq.device);
  751. spin_lock_irqsave(&cq->lock, flags);
  752. if (mdev->dev->persist->state & MLX4_DEVICE_STATE_INTERNAL_ERROR) {
  753. mlx4_ib_poll_sw_comp(cq, num_entries, wc, &npolled);
  754. goto out;
  755. }
  756. for (npolled = 0; npolled < num_entries; ++npolled) {
  757. if (mlx4_ib_poll_one(cq, &cur_qp, wc + npolled))
  758. break;
  759. }
  760. mlx4_cq_set_ci(&cq->mcq);
  761. out:
  762. spin_unlock_irqrestore(&cq->lock, flags);
  763. return npolled;
  764. }
  765. int mlx4_ib_arm_cq(struct ib_cq *ibcq, enum ib_cq_notify_flags flags)
  766. {
  767. mlx4_cq_arm(&to_mcq(ibcq)->mcq,
  768. (flags & IB_CQ_SOLICITED_MASK) == IB_CQ_SOLICITED ?
  769. MLX4_CQ_DB_REQ_NOT_SOL : MLX4_CQ_DB_REQ_NOT,
  770. to_mdev(ibcq->device)->uar_map,
  771. MLX4_GET_DOORBELL_LOCK(&to_mdev(ibcq->device)->uar_lock));
  772. return 0;
  773. }
  774. void __mlx4_ib_cq_clean(struct mlx4_ib_cq *cq, u32 qpn, struct mlx4_ib_srq *srq)
  775. {
  776. u32 prod_index;
  777. int nfreed = 0;
  778. struct mlx4_cqe *cqe, *dest;
  779. u8 owner_bit;
  780. int cqe_inc = cq->buf.entry_size == 64 ? 1 : 0;
  781. /*
  782. * First we need to find the current producer index, so we
  783. * know where to start cleaning from. It doesn't matter if HW
  784. * adds new entries after this loop -- the QP we're worried
  785. * about is already in RESET, so the new entries won't come
  786. * from our QP and therefore don't need to be checked.
  787. */
  788. for (prod_index = cq->mcq.cons_index; get_sw_cqe(cq, prod_index); ++prod_index)
  789. if (prod_index == cq->mcq.cons_index + cq->ibcq.cqe)
  790. break;
  791. /*
  792. * Now sweep backwards through the CQ, removing CQ entries
  793. * that match our QP by copying older entries on top of them.
  794. */
  795. while ((int) --prod_index - (int) cq->mcq.cons_index >= 0) {
  796. cqe = get_cqe(cq, prod_index & cq->ibcq.cqe);
  797. cqe += cqe_inc;
  798. if ((be32_to_cpu(cqe->vlan_my_qpn) & MLX4_CQE_QPN_MASK) == qpn) {
  799. if (srq && !(cqe->owner_sr_opcode & MLX4_CQE_IS_SEND_MASK))
  800. mlx4_ib_free_srq_wqe(srq, be16_to_cpu(cqe->wqe_index));
  801. ++nfreed;
  802. } else if (nfreed) {
  803. dest = get_cqe(cq, (prod_index + nfreed) & cq->ibcq.cqe);
  804. dest += cqe_inc;
  805. owner_bit = dest->owner_sr_opcode & MLX4_CQE_OWNER_MASK;
  806. memcpy(dest, cqe, sizeof *cqe);
  807. dest->owner_sr_opcode = owner_bit |
  808. (dest->owner_sr_opcode & ~MLX4_CQE_OWNER_MASK);
  809. }
  810. }
  811. if (nfreed) {
  812. cq->mcq.cons_index += nfreed;
  813. /*
  814. * Make sure update of buffer contents is done before
  815. * updating consumer index.
  816. */
  817. wmb();
  818. mlx4_cq_set_ci(&cq->mcq);
  819. }
  820. }
  821. void mlx4_ib_cq_clean(struct mlx4_ib_cq *cq, u32 qpn, struct mlx4_ib_srq *srq)
  822. {
  823. spin_lock_irq(&cq->lock);
  824. __mlx4_ib_cq_clean(cq, qpn, srq);
  825. spin_unlock_irq(&cq->lock);
  826. }