hns_roce_cq.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467
  1. /*
  2. * Copyright (c) 2016 Hisilicon Limited.
  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 <linux/platform_device.h>
  33. #include <rdma/ib_umem.h>
  34. #include "hns_roce_device.h"
  35. #include "hns_roce_cmd.h"
  36. #include "hns_roce_hem.h"
  37. #include <rdma/hns-abi.h>
  38. #include "hns_roce_common.h"
  39. static void hns_roce_ib_cq_comp(struct hns_roce_cq *hr_cq)
  40. {
  41. struct ib_cq *ibcq = &hr_cq->ib_cq;
  42. ibcq->comp_handler(ibcq, ibcq->cq_context);
  43. }
  44. static void hns_roce_ib_cq_event(struct hns_roce_cq *hr_cq,
  45. enum hns_roce_event event_type)
  46. {
  47. struct hns_roce_dev *hr_dev;
  48. struct ib_event event;
  49. struct ib_cq *ibcq;
  50. ibcq = &hr_cq->ib_cq;
  51. hr_dev = to_hr_dev(ibcq->device);
  52. if (event_type != HNS_ROCE_EVENT_TYPE_CQ_ID_INVALID &&
  53. event_type != HNS_ROCE_EVENT_TYPE_CQ_ACCESS_ERROR &&
  54. event_type != HNS_ROCE_EVENT_TYPE_CQ_OVERFLOW) {
  55. dev_err(&hr_dev->pdev->dev,
  56. "hns_roce_ib: Unexpected event type 0x%x on CQ %06lx\n",
  57. event_type, hr_cq->cqn);
  58. return;
  59. }
  60. if (ibcq->event_handler) {
  61. event.device = ibcq->device;
  62. event.event = IB_EVENT_CQ_ERR;
  63. event.element.cq = ibcq;
  64. ibcq->event_handler(&event, ibcq->cq_context);
  65. }
  66. }
  67. static int hns_roce_sw2hw_cq(struct hns_roce_dev *dev,
  68. struct hns_roce_cmd_mailbox *mailbox,
  69. unsigned long cq_num)
  70. {
  71. return hns_roce_cmd_mbox(dev, mailbox->dma, 0, cq_num, 0,
  72. HNS_ROCE_CMD_SW2HW_CQ, HNS_ROCE_CMD_TIMEOUT_MSECS);
  73. }
  74. static int hns_roce_cq_alloc(struct hns_roce_dev *hr_dev, int nent,
  75. struct hns_roce_mtt *hr_mtt,
  76. struct hns_roce_uar *hr_uar,
  77. struct hns_roce_cq *hr_cq, int vector)
  78. {
  79. struct hns_roce_cmd_mailbox *mailbox = NULL;
  80. struct hns_roce_cq_table *cq_table = NULL;
  81. struct device *dev = &hr_dev->pdev->dev;
  82. dma_addr_t dma_handle;
  83. u64 *mtts = NULL;
  84. int ret = 0;
  85. cq_table = &hr_dev->cq_table;
  86. /* Get the physical address of cq buf */
  87. mtts = hns_roce_table_find(&hr_dev->mr_table.mtt_table,
  88. hr_mtt->first_seg, &dma_handle);
  89. if (!mtts) {
  90. dev_err(dev, "CQ alloc.Failed to find cq buf addr.\n");
  91. return -EINVAL;
  92. }
  93. if (vector >= hr_dev->caps.num_comp_vectors) {
  94. dev_err(dev, "CQ alloc.Invalid vector.\n");
  95. return -EINVAL;
  96. }
  97. hr_cq->vector = vector;
  98. ret = hns_roce_bitmap_alloc(&cq_table->bitmap, &hr_cq->cqn);
  99. if (ret == -1) {
  100. dev_err(dev, "CQ alloc.Failed to alloc index.\n");
  101. return -ENOMEM;
  102. }
  103. /* Get CQC memory HEM(Hardware Entry Memory) table */
  104. ret = hns_roce_table_get(hr_dev, &cq_table->table, hr_cq->cqn);
  105. if (ret) {
  106. dev_err(dev, "CQ alloc.Failed to get context mem.\n");
  107. goto err_out;
  108. }
  109. /* The cq insert radix tree */
  110. spin_lock_irq(&cq_table->lock);
  111. /* Radix_tree: The associated pointer and long integer key value like */
  112. ret = radix_tree_insert(&cq_table->tree, hr_cq->cqn, hr_cq);
  113. spin_unlock_irq(&cq_table->lock);
  114. if (ret) {
  115. dev_err(dev, "CQ alloc.Failed to radix_tree_insert.\n");
  116. goto err_put;
  117. }
  118. /* Allocate mailbox memory */
  119. mailbox = hns_roce_alloc_cmd_mailbox(hr_dev);
  120. if (IS_ERR(mailbox)) {
  121. ret = PTR_ERR(mailbox);
  122. goto err_radix;
  123. }
  124. hr_dev->hw->write_cqc(hr_dev, hr_cq, mailbox->buf, mtts, dma_handle,
  125. nent, vector);
  126. /* Send mailbox to hw */
  127. ret = hns_roce_sw2hw_cq(hr_dev, mailbox, hr_cq->cqn);
  128. hns_roce_free_cmd_mailbox(hr_dev, mailbox);
  129. if (ret) {
  130. dev_err(dev, "CQ alloc.Failed to cmd mailbox.\n");
  131. goto err_radix;
  132. }
  133. hr_cq->cons_index = 0;
  134. hr_cq->uar = hr_uar;
  135. atomic_set(&hr_cq->refcount, 1);
  136. init_completion(&hr_cq->free);
  137. return 0;
  138. err_radix:
  139. spin_lock_irq(&cq_table->lock);
  140. radix_tree_delete(&cq_table->tree, hr_cq->cqn);
  141. spin_unlock_irq(&cq_table->lock);
  142. err_put:
  143. hns_roce_table_put(hr_dev, &cq_table->table, hr_cq->cqn);
  144. err_out:
  145. hns_roce_bitmap_free(&cq_table->bitmap, hr_cq->cqn, BITMAP_NO_RR);
  146. return ret;
  147. }
  148. static int hns_roce_hw2sw_cq(struct hns_roce_dev *dev,
  149. struct hns_roce_cmd_mailbox *mailbox,
  150. unsigned long cq_num)
  151. {
  152. return hns_roce_cmd_mbox(dev, 0, mailbox ? mailbox->dma : 0, cq_num,
  153. mailbox ? 0 : 1, HNS_ROCE_CMD_HW2SW_CQ,
  154. HNS_ROCE_CMD_TIMEOUT_MSECS);
  155. }
  156. void hns_roce_free_cq(struct hns_roce_dev *hr_dev, struct hns_roce_cq *hr_cq)
  157. {
  158. struct hns_roce_cq_table *cq_table = &hr_dev->cq_table;
  159. struct device *dev = &hr_dev->pdev->dev;
  160. int ret;
  161. ret = hns_roce_hw2sw_cq(hr_dev, NULL, hr_cq->cqn);
  162. if (ret)
  163. dev_err(dev, "HW2SW_CQ failed (%d) for CQN %06lx\n", ret,
  164. hr_cq->cqn);
  165. /* Waiting interrupt process procedure carried out */
  166. synchronize_irq(hr_dev->eq_table.eq[hr_cq->vector].irq);
  167. /* wait for all interrupt processed */
  168. if (atomic_dec_and_test(&hr_cq->refcount))
  169. complete(&hr_cq->free);
  170. wait_for_completion(&hr_cq->free);
  171. spin_lock_irq(&cq_table->lock);
  172. radix_tree_delete(&cq_table->tree, hr_cq->cqn);
  173. spin_unlock_irq(&cq_table->lock);
  174. hns_roce_table_put(hr_dev, &cq_table->table, hr_cq->cqn);
  175. hns_roce_bitmap_free(&cq_table->bitmap, hr_cq->cqn, BITMAP_NO_RR);
  176. }
  177. static int hns_roce_ib_get_cq_umem(struct hns_roce_dev *hr_dev,
  178. struct ib_ucontext *context,
  179. struct hns_roce_cq_buf *buf,
  180. struct ib_umem **umem, u64 buf_addr, int cqe)
  181. {
  182. int ret;
  183. *umem = ib_umem_get(context, buf_addr, cqe * hr_dev->caps.cq_entry_sz,
  184. IB_ACCESS_LOCAL_WRITE, 1);
  185. if (IS_ERR(*umem))
  186. return PTR_ERR(*umem);
  187. ret = hns_roce_mtt_init(hr_dev, ib_umem_page_count(*umem),
  188. ilog2((unsigned int)(*umem)->page_size),
  189. &buf->hr_mtt);
  190. if (ret)
  191. goto err_buf;
  192. ret = hns_roce_ib_umem_write_mtt(hr_dev, &buf->hr_mtt, *umem);
  193. if (ret)
  194. goto err_mtt;
  195. return 0;
  196. err_mtt:
  197. hns_roce_mtt_cleanup(hr_dev, &buf->hr_mtt);
  198. err_buf:
  199. ib_umem_release(*umem);
  200. return ret;
  201. }
  202. static int hns_roce_ib_alloc_cq_buf(struct hns_roce_dev *hr_dev,
  203. struct hns_roce_cq_buf *buf, u32 nent)
  204. {
  205. int ret;
  206. ret = hns_roce_buf_alloc(hr_dev, nent * hr_dev->caps.cq_entry_sz,
  207. PAGE_SIZE * 2, &buf->hr_buf);
  208. if (ret)
  209. goto out;
  210. ret = hns_roce_mtt_init(hr_dev, buf->hr_buf.npages,
  211. buf->hr_buf.page_shift, &buf->hr_mtt);
  212. if (ret)
  213. goto err_buf;
  214. ret = hns_roce_buf_write_mtt(hr_dev, &buf->hr_mtt, &buf->hr_buf);
  215. if (ret)
  216. goto err_mtt;
  217. return 0;
  218. err_mtt:
  219. hns_roce_mtt_cleanup(hr_dev, &buf->hr_mtt);
  220. err_buf:
  221. hns_roce_buf_free(hr_dev, nent * hr_dev->caps.cq_entry_sz,
  222. &buf->hr_buf);
  223. out:
  224. return ret;
  225. }
  226. static void hns_roce_ib_free_cq_buf(struct hns_roce_dev *hr_dev,
  227. struct hns_roce_cq_buf *buf, int cqe)
  228. {
  229. hns_roce_buf_free(hr_dev, (cqe + 1) * hr_dev->caps.cq_entry_sz,
  230. &buf->hr_buf);
  231. }
  232. struct ib_cq *hns_roce_ib_create_cq(struct ib_device *ib_dev,
  233. const struct ib_cq_init_attr *attr,
  234. struct ib_ucontext *context,
  235. struct ib_udata *udata)
  236. {
  237. struct hns_roce_dev *hr_dev = to_hr_dev(ib_dev);
  238. struct device *dev = &hr_dev->pdev->dev;
  239. struct hns_roce_ib_create_cq ucmd;
  240. struct hns_roce_cq *hr_cq = NULL;
  241. struct hns_roce_uar *uar = NULL;
  242. int vector = attr->comp_vector;
  243. int cq_entries = attr->cqe;
  244. int ret = 0;
  245. if (cq_entries < 1 || cq_entries > hr_dev->caps.max_cqes) {
  246. dev_err(dev, "Creat CQ failed. entries=%d, max=%d\n",
  247. cq_entries, hr_dev->caps.max_cqes);
  248. return ERR_PTR(-EINVAL);
  249. }
  250. hr_cq = kmalloc(sizeof(*hr_cq), GFP_KERNEL);
  251. if (!hr_cq)
  252. return ERR_PTR(-ENOMEM);
  253. /* In v1 engine, parameter verification */
  254. if (cq_entries < HNS_ROCE_MIN_CQE_NUM)
  255. cq_entries = HNS_ROCE_MIN_CQE_NUM;
  256. cq_entries = roundup_pow_of_two((unsigned int)cq_entries);
  257. hr_cq->ib_cq.cqe = cq_entries - 1;
  258. spin_lock_init(&hr_cq->lock);
  259. if (context) {
  260. if (ib_copy_from_udata(&ucmd, udata, sizeof(ucmd))) {
  261. dev_err(dev, "Failed to copy_from_udata.\n");
  262. ret = -EFAULT;
  263. goto err_cq;
  264. }
  265. /* Get user space address, write it into mtt table */
  266. ret = hns_roce_ib_get_cq_umem(hr_dev, context, &hr_cq->hr_buf,
  267. &hr_cq->umem, ucmd.buf_addr,
  268. cq_entries);
  269. if (ret) {
  270. dev_err(dev, "Failed to get_cq_umem.\n");
  271. goto err_cq;
  272. }
  273. /* Get user space parameters */
  274. uar = &to_hr_ucontext(context)->uar;
  275. } else {
  276. /* Init mmt table and write buff address to mtt table */
  277. ret = hns_roce_ib_alloc_cq_buf(hr_dev, &hr_cq->hr_buf,
  278. cq_entries);
  279. if (ret) {
  280. dev_err(dev, "Failed to alloc_cq_buf.\n");
  281. goto err_cq;
  282. }
  283. uar = &hr_dev->priv_uar;
  284. hr_cq->cq_db_l = hr_dev->reg_base + ROCEE_DB_OTHERS_L_0_REG +
  285. 0x1000 * uar->index;
  286. }
  287. /* Allocate cq index, fill cq_context */
  288. ret = hns_roce_cq_alloc(hr_dev, cq_entries, &hr_cq->hr_buf.hr_mtt, uar,
  289. hr_cq, vector);
  290. if (ret) {
  291. dev_err(dev, "Creat CQ .Failed to cq_alloc.\n");
  292. goto err_mtt;
  293. }
  294. /*
  295. * For the QP created by kernel space, tptr value should be initialized
  296. * to zero; For the QP created by user space, it will cause synchronous
  297. * problems if tptr is set to zero here, so we initialze it in user
  298. * space.
  299. */
  300. if (!context)
  301. *hr_cq->tptr_addr = 0;
  302. /* Get created cq handler and carry out event */
  303. hr_cq->comp = hns_roce_ib_cq_comp;
  304. hr_cq->event = hns_roce_ib_cq_event;
  305. hr_cq->cq_depth = cq_entries;
  306. if (context) {
  307. if (ib_copy_to_udata(udata, &hr_cq->cqn, sizeof(u64))) {
  308. ret = -EFAULT;
  309. goto err_cqc;
  310. }
  311. }
  312. return &hr_cq->ib_cq;
  313. err_cqc:
  314. hns_roce_free_cq(hr_dev, hr_cq);
  315. err_mtt:
  316. hns_roce_mtt_cleanup(hr_dev, &hr_cq->hr_buf.hr_mtt);
  317. if (context)
  318. ib_umem_release(hr_cq->umem);
  319. else
  320. hns_roce_ib_free_cq_buf(hr_dev, &hr_cq->hr_buf,
  321. hr_cq->ib_cq.cqe);
  322. err_cq:
  323. kfree(hr_cq);
  324. return ERR_PTR(ret);
  325. }
  326. int hns_roce_ib_destroy_cq(struct ib_cq *ib_cq)
  327. {
  328. struct hns_roce_dev *hr_dev = to_hr_dev(ib_cq->device);
  329. struct hns_roce_cq *hr_cq = to_hr_cq(ib_cq);
  330. int ret = 0;
  331. if (hr_dev->hw->destroy_cq) {
  332. ret = hr_dev->hw->destroy_cq(ib_cq);
  333. } else {
  334. hns_roce_free_cq(hr_dev, hr_cq);
  335. hns_roce_mtt_cleanup(hr_dev, &hr_cq->hr_buf.hr_mtt);
  336. if (ib_cq->uobject)
  337. ib_umem_release(hr_cq->umem);
  338. else
  339. /* Free the buff of stored cq */
  340. hns_roce_ib_free_cq_buf(hr_dev, &hr_cq->hr_buf,
  341. ib_cq->cqe);
  342. kfree(hr_cq);
  343. }
  344. return ret;
  345. }
  346. void hns_roce_cq_completion(struct hns_roce_dev *hr_dev, u32 cqn)
  347. {
  348. struct device *dev = &hr_dev->pdev->dev;
  349. struct hns_roce_cq *cq;
  350. cq = radix_tree_lookup(&hr_dev->cq_table.tree,
  351. cqn & (hr_dev->caps.num_cqs - 1));
  352. if (!cq) {
  353. dev_warn(dev, "Completion event for bogus CQ 0x%08x\n", cqn);
  354. return;
  355. }
  356. cq->comp(cq);
  357. }
  358. void hns_roce_cq_event(struct hns_roce_dev *hr_dev, u32 cqn, int event_type)
  359. {
  360. struct hns_roce_cq_table *cq_table = &hr_dev->cq_table;
  361. struct device *dev = &hr_dev->pdev->dev;
  362. struct hns_roce_cq *cq;
  363. cq = radix_tree_lookup(&cq_table->tree,
  364. cqn & (hr_dev->caps.num_cqs - 1));
  365. if (cq)
  366. atomic_inc(&cq->refcount);
  367. if (!cq) {
  368. dev_warn(dev, "Async event for bogus CQ %08x\n", cqn);
  369. return;
  370. }
  371. cq->event(cq, (enum hns_roce_event)event_type);
  372. if (atomic_dec_and_test(&cq->refcount))
  373. complete(&cq->free);
  374. }
  375. int hns_roce_init_cq_table(struct hns_roce_dev *hr_dev)
  376. {
  377. struct hns_roce_cq_table *cq_table = &hr_dev->cq_table;
  378. spin_lock_init(&cq_table->lock);
  379. INIT_RADIX_TREE(&cq_table->tree, GFP_ATOMIC);
  380. return hns_roce_bitmap_init(&cq_table->bitmap, hr_dev->caps.num_cqs,
  381. hr_dev->caps.num_cqs - 1,
  382. hr_dev->caps.reserved_cqs, 0);
  383. }
  384. void hns_roce_cleanup_cq_table(struct hns_roce_dev *hr_dev)
  385. {
  386. hns_roce_bitmap_cleanup(&hr_dev->cq_table.bitmap);
  387. }