mthca_srq.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738
  1. /*
  2. * Copyright (c) 2005 Cisco Systems. 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. * $Id: mthca_srq.c 3047 2005-08-10 03:59:35Z roland $
  33. */
  34. #include <linux/slab.h>
  35. #include <linux/string.h>
  36. #include "mthca_dev.h"
  37. #include "mthca_cmd.h"
  38. #include "mthca_memfree.h"
  39. #include "mthca_wqe.h"
  40. enum {
  41. MTHCA_MAX_DIRECT_SRQ_SIZE = 4 * PAGE_SIZE
  42. };
  43. struct mthca_tavor_srq_context {
  44. __be64 wqe_base_ds; /* low 6 bits is descriptor size */
  45. __be32 state_pd;
  46. __be32 lkey;
  47. __be32 uar;
  48. __be16 limit_watermark;
  49. __be16 wqe_cnt;
  50. u32 reserved[2];
  51. };
  52. struct mthca_arbel_srq_context {
  53. __be32 state_logsize_srqn;
  54. __be32 lkey;
  55. __be32 db_index;
  56. __be32 logstride_usrpage;
  57. __be64 wqe_base;
  58. __be32 eq_pd;
  59. __be16 limit_watermark;
  60. __be16 wqe_cnt;
  61. u16 reserved1;
  62. __be16 wqe_counter;
  63. u32 reserved2[3];
  64. };
  65. static void *get_wqe(struct mthca_srq *srq, int n)
  66. {
  67. if (srq->is_direct)
  68. return srq->queue.direct.buf + (n << srq->wqe_shift);
  69. else
  70. return srq->queue.page_list[(n << srq->wqe_shift) >> PAGE_SHIFT].buf +
  71. ((n << srq->wqe_shift) & (PAGE_SIZE - 1));
  72. }
  73. /*
  74. * Return a pointer to the location within a WQE that we're using as a
  75. * link when the WQE is in the free list. We use the imm field
  76. * because in the Tavor case, posting a WQE may overwrite the next
  77. * segment of the previous WQE, but a receive WQE will never touch the
  78. * imm field. This avoids corrupting our free list if the previous
  79. * WQE has already completed and been put on the free list when we
  80. * post the next WQE.
  81. */
  82. static inline int *wqe_to_link(void *wqe)
  83. {
  84. return (int *) (wqe + offsetof(struct mthca_next_seg, imm));
  85. }
  86. static void mthca_tavor_init_srq_context(struct mthca_dev *dev,
  87. struct mthca_pd *pd,
  88. struct mthca_srq *srq,
  89. struct mthca_tavor_srq_context *context)
  90. {
  91. memset(context, 0, sizeof *context);
  92. context->wqe_base_ds = cpu_to_be64(1 << (srq->wqe_shift - 4));
  93. context->state_pd = cpu_to_be32(pd->pd_num);
  94. context->lkey = cpu_to_be32(srq->mr.ibmr.lkey);
  95. if (pd->ibpd.uobject)
  96. context->uar =
  97. cpu_to_be32(to_mucontext(pd->ibpd.uobject->context)->uar.index);
  98. else
  99. context->uar = cpu_to_be32(dev->driver_uar.index);
  100. }
  101. static void mthca_arbel_init_srq_context(struct mthca_dev *dev,
  102. struct mthca_pd *pd,
  103. struct mthca_srq *srq,
  104. struct mthca_arbel_srq_context *context)
  105. {
  106. int logsize;
  107. memset(context, 0, sizeof *context);
  108. logsize = long_log2(srq->max) + srq->wqe_shift;
  109. context->state_logsize_srqn = cpu_to_be32(logsize << 24 | srq->srqn);
  110. context->lkey = cpu_to_be32(srq->mr.ibmr.lkey);
  111. context->db_index = cpu_to_be32(srq->db_index);
  112. context->logstride_usrpage = cpu_to_be32((srq->wqe_shift - 4) << 29);
  113. if (pd->ibpd.uobject)
  114. context->logstride_usrpage |=
  115. cpu_to_be32(to_mucontext(pd->ibpd.uobject->context)->uar.index);
  116. else
  117. context->logstride_usrpage |= cpu_to_be32(dev->driver_uar.index);
  118. context->eq_pd = cpu_to_be32(MTHCA_EQ_ASYNC << 24 | pd->pd_num);
  119. }
  120. static void mthca_free_srq_buf(struct mthca_dev *dev, struct mthca_srq *srq)
  121. {
  122. mthca_buf_free(dev, srq->max << srq->wqe_shift, &srq->queue,
  123. srq->is_direct, &srq->mr);
  124. kfree(srq->wrid);
  125. }
  126. static int mthca_alloc_srq_buf(struct mthca_dev *dev, struct mthca_pd *pd,
  127. struct mthca_srq *srq)
  128. {
  129. struct mthca_data_seg *scatter;
  130. void *wqe;
  131. int err;
  132. int i;
  133. if (pd->ibpd.uobject)
  134. return 0;
  135. srq->wrid = kmalloc(srq->max * sizeof (u64), GFP_KERNEL);
  136. if (!srq->wrid)
  137. return -ENOMEM;
  138. err = mthca_buf_alloc(dev, srq->max << srq->wqe_shift,
  139. MTHCA_MAX_DIRECT_SRQ_SIZE,
  140. &srq->queue, &srq->is_direct, pd, 1, &srq->mr);
  141. if (err) {
  142. kfree(srq->wrid);
  143. return err;
  144. }
  145. /*
  146. * Now initialize the SRQ buffer so that all of the WQEs are
  147. * linked into the list of free WQEs. In addition, set the
  148. * scatter list L_Keys to the sentry value of 0x100.
  149. */
  150. for (i = 0; i < srq->max; ++i) {
  151. wqe = get_wqe(srq, i);
  152. *wqe_to_link(wqe) = i < srq->max - 1 ? i + 1 : -1;
  153. for (scatter = wqe + sizeof (struct mthca_next_seg);
  154. (void *) scatter < wqe + (1 << srq->wqe_shift);
  155. ++scatter)
  156. scatter->lkey = cpu_to_be32(MTHCA_INVAL_LKEY);
  157. }
  158. srq->last = get_wqe(srq, srq->max - 1);
  159. return 0;
  160. }
  161. int mthca_alloc_srq(struct mthca_dev *dev, struct mthca_pd *pd,
  162. struct ib_srq_attr *attr, struct mthca_srq *srq)
  163. {
  164. struct mthca_mailbox *mailbox;
  165. u8 status;
  166. int ds;
  167. int err;
  168. /* Sanity check SRQ size before proceeding */
  169. if (attr->max_wr > dev->limits.max_srq_wqes ||
  170. attr->max_sge > dev->limits.max_srq_sge)
  171. return -EINVAL;
  172. srq->max = attr->max_wr;
  173. srq->max_gs = attr->max_sge;
  174. srq->counter = 0;
  175. if (mthca_is_memfree(dev))
  176. srq->max = roundup_pow_of_two(srq->max + 1);
  177. ds = max(64UL,
  178. roundup_pow_of_two(sizeof (struct mthca_next_seg) +
  179. srq->max_gs * sizeof (struct mthca_data_seg)));
  180. if (!mthca_is_memfree(dev) && (ds > dev->limits.max_desc_sz))
  181. return -EINVAL;
  182. srq->wqe_shift = long_log2(ds);
  183. srq->srqn = mthca_alloc(&dev->srq_table.alloc);
  184. if (srq->srqn == -1)
  185. return -ENOMEM;
  186. if (mthca_is_memfree(dev)) {
  187. err = mthca_table_get(dev, dev->srq_table.table, srq->srqn);
  188. if (err)
  189. goto err_out;
  190. if (!pd->ibpd.uobject) {
  191. srq->db_index = mthca_alloc_db(dev, MTHCA_DB_TYPE_SRQ,
  192. srq->srqn, &srq->db);
  193. if (srq->db_index < 0) {
  194. err = -ENOMEM;
  195. goto err_out_icm;
  196. }
  197. }
  198. }
  199. mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
  200. if (IS_ERR(mailbox)) {
  201. err = PTR_ERR(mailbox);
  202. goto err_out_db;
  203. }
  204. err = mthca_alloc_srq_buf(dev, pd, srq);
  205. if (err)
  206. goto err_out_mailbox;
  207. spin_lock_init(&srq->lock);
  208. srq->refcount = 1;
  209. init_waitqueue_head(&srq->wait);
  210. mutex_init(&srq->mutex);
  211. if (mthca_is_memfree(dev))
  212. mthca_arbel_init_srq_context(dev, pd, srq, mailbox->buf);
  213. else
  214. mthca_tavor_init_srq_context(dev, pd, srq, mailbox->buf);
  215. err = mthca_SW2HW_SRQ(dev, mailbox, srq->srqn, &status);
  216. if (err) {
  217. mthca_warn(dev, "SW2HW_SRQ failed (%d)\n", err);
  218. goto err_out_free_buf;
  219. }
  220. if (status) {
  221. mthca_warn(dev, "SW2HW_SRQ returned status 0x%02x\n",
  222. status);
  223. err = -EINVAL;
  224. goto err_out_free_buf;
  225. }
  226. spin_lock_irq(&dev->srq_table.lock);
  227. if (mthca_array_set(&dev->srq_table.srq,
  228. srq->srqn & (dev->limits.num_srqs - 1),
  229. srq)) {
  230. spin_unlock_irq(&dev->srq_table.lock);
  231. goto err_out_free_srq;
  232. }
  233. spin_unlock_irq(&dev->srq_table.lock);
  234. mthca_free_mailbox(dev, mailbox);
  235. srq->first_free = 0;
  236. srq->last_free = srq->max - 1;
  237. attr->max_wr = (mthca_is_memfree(dev)) ? srq->max - 1 : srq->max;
  238. attr->max_sge = srq->max_gs;
  239. return 0;
  240. err_out_free_srq:
  241. err = mthca_HW2SW_SRQ(dev, mailbox, srq->srqn, &status);
  242. if (err)
  243. mthca_warn(dev, "HW2SW_SRQ failed (%d)\n", err);
  244. else if (status)
  245. mthca_warn(dev, "HW2SW_SRQ returned status 0x%02x\n", status);
  246. err_out_free_buf:
  247. if (!pd->ibpd.uobject)
  248. mthca_free_srq_buf(dev, srq);
  249. err_out_mailbox:
  250. mthca_free_mailbox(dev, mailbox);
  251. err_out_db:
  252. if (!pd->ibpd.uobject && mthca_is_memfree(dev))
  253. mthca_free_db(dev, MTHCA_DB_TYPE_SRQ, srq->db_index);
  254. err_out_icm:
  255. mthca_table_put(dev, dev->srq_table.table, srq->srqn);
  256. err_out:
  257. mthca_free(&dev->srq_table.alloc, srq->srqn);
  258. return err;
  259. }
  260. static inline int get_srq_refcount(struct mthca_dev *dev, struct mthca_srq *srq)
  261. {
  262. int c;
  263. spin_lock_irq(&dev->srq_table.lock);
  264. c = srq->refcount;
  265. spin_unlock_irq(&dev->srq_table.lock);
  266. return c;
  267. }
  268. void mthca_free_srq(struct mthca_dev *dev, struct mthca_srq *srq)
  269. {
  270. struct mthca_mailbox *mailbox;
  271. int err;
  272. u8 status;
  273. mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
  274. if (IS_ERR(mailbox)) {
  275. mthca_warn(dev, "No memory for mailbox to free SRQ.\n");
  276. return;
  277. }
  278. err = mthca_HW2SW_SRQ(dev, mailbox, srq->srqn, &status);
  279. if (err)
  280. mthca_warn(dev, "HW2SW_SRQ failed (%d)\n", err);
  281. else if (status)
  282. mthca_warn(dev, "HW2SW_SRQ returned status 0x%02x\n", status);
  283. spin_lock_irq(&dev->srq_table.lock);
  284. mthca_array_clear(&dev->srq_table.srq,
  285. srq->srqn & (dev->limits.num_srqs - 1));
  286. --srq->refcount;
  287. spin_unlock_irq(&dev->srq_table.lock);
  288. wait_event(srq->wait, !get_srq_refcount(dev, srq));
  289. if (!srq->ibsrq.uobject) {
  290. mthca_free_srq_buf(dev, srq);
  291. if (mthca_is_memfree(dev))
  292. mthca_free_db(dev, MTHCA_DB_TYPE_SRQ, srq->db_index);
  293. }
  294. mthca_table_put(dev, dev->srq_table.table, srq->srqn);
  295. mthca_free(&dev->srq_table.alloc, srq->srqn);
  296. mthca_free_mailbox(dev, mailbox);
  297. }
  298. int mthca_modify_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr,
  299. enum ib_srq_attr_mask attr_mask)
  300. {
  301. struct mthca_dev *dev = to_mdev(ibsrq->device);
  302. struct mthca_srq *srq = to_msrq(ibsrq);
  303. int ret;
  304. u8 status;
  305. /* We don't support resizing SRQs (yet?) */
  306. if (attr_mask & IB_SRQ_MAX_WR)
  307. return -EINVAL;
  308. if (attr_mask & IB_SRQ_LIMIT) {
  309. if (attr->srq_limit > srq->max)
  310. return -EINVAL;
  311. mutex_lock(&srq->mutex);
  312. ret = mthca_ARM_SRQ(dev, srq->srqn, attr->srq_limit, &status);
  313. mutex_unlock(&srq->mutex);
  314. if (ret)
  315. return ret;
  316. if (status)
  317. return -EINVAL;
  318. }
  319. return 0;
  320. }
  321. int mthca_query_srq(struct ib_srq *ibsrq, struct ib_srq_attr *srq_attr)
  322. {
  323. struct mthca_dev *dev = to_mdev(ibsrq->device);
  324. struct mthca_srq *srq = to_msrq(ibsrq);
  325. struct mthca_mailbox *mailbox;
  326. struct mthca_arbel_srq_context *arbel_ctx;
  327. struct mthca_tavor_srq_context *tavor_ctx;
  328. u8 status;
  329. int err;
  330. mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
  331. if (IS_ERR(mailbox))
  332. return PTR_ERR(mailbox);
  333. err = mthca_QUERY_SRQ(dev, srq->srqn, mailbox, &status);
  334. if (err)
  335. goto out;
  336. if (mthca_is_memfree(dev)) {
  337. arbel_ctx = mailbox->buf;
  338. srq_attr->srq_limit = be16_to_cpu(arbel_ctx->limit_watermark);
  339. } else {
  340. tavor_ctx = mailbox->buf;
  341. srq_attr->srq_limit = be16_to_cpu(tavor_ctx->limit_watermark);
  342. }
  343. srq_attr->max_wr = (mthca_is_memfree(dev)) ? srq->max - 1 : srq->max;
  344. srq_attr->max_sge = srq->max_gs;
  345. out:
  346. mthca_free_mailbox(dev, mailbox);
  347. return err;
  348. }
  349. void mthca_srq_event(struct mthca_dev *dev, u32 srqn,
  350. enum ib_event_type event_type)
  351. {
  352. struct mthca_srq *srq;
  353. struct ib_event event;
  354. spin_lock(&dev->srq_table.lock);
  355. srq = mthca_array_get(&dev->srq_table.srq, srqn & (dev->limits.num_srqs - 1));
  356. if (srq)
  357. ++srq->refcount;
  358. spin_unlock(&dev->srq_table.lock);
  359. if (!srq) {
  360. mthca_warn(dev, "Async event for bogus SRQ %08x\n", srqn);
  361. return;
  362. }
  363. if (!srq->ibsrq.event_handler)
  364. goto out;
  365. event.device = &dev->ib_dev;
  366. event.event = event_type;
  367. event.element.srq = &srq->ibsrq;
  368. srq->ibsrq.event_handler(&event, srq->ibsrq.srq_context);
  369. out:
  370. spin_lock(&dev->srq_table.lock);
  371. if (!--srq->refcount)
  372. wake_up(&srq->wait);
  373. spin_unlock(&dev->srq_table.lock);
  374. }
  375. /*
  376. * This function must be called with IRQs disabled.
  377. */
  378. void mthca_free_srq_wqe(struct mthca_srq *srq, u32 wqe_addr)
  379. {
  380. int ind;
  381. ind = wqe_addr >> srq->wqe_shift;
  382. spin_lock(&srq->lock);
  383. if (likely(srq->first_free >= 0))
  384. *wqe_to_link(get_wqe(srq, srq->last_free)) = ind;
  385. else
  386. srq->first_free = ind;
  387. *wqe_to_link(get_wqe(srq, ind)) = -1;
  388. srq->last_free = ind;
  389. spin_unlock(&srq->lock);
  390. }
  391. int mthca_tavor_post_srq_recv(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
  392. struct ib_recv_wr **bad_wr)
  393. {
  394. struct mthca_dev *dev = to_mdev(ibsrq->device);
  395. struct mthca_srq *srq = to_msrq(ibsrq);
  396. __be32 doorbell[2];
  397. unsigned long flags;
  398. int err = 0;
  399. int first_ind;
  400. int ind;
  401. int next_ind;
  402. int nreq;
  403. int i;
  404. void *wqe;
  405. void *prev_wqe;
  406. spin_lock_irqsave(&srq->lock, flags);
  407. first_ind = srq->first_free;
  408. for (nreq = 0; wr; wr = wr->next) {
  409. ind = srq->first_free;
  410. if (ind < 0) {
  411. mthca_err(dev, "SRQ %06x full\n", srq->srqn);
  412. err = -ENOMEM;
  413. *bad_wr = wr;
  414. break;
  415. }
  416. wqe = get_wqe(srq, ind);
  417. next_ind = *wqe_to_link(wqe);
  418. if (next_ind < 0) {
  419. mthca_err(dev, "SRQ %06x full\n", srq->srqn);
  420. err = -ENOMEM;
  421. *bad_wr = wr;
  422. break;
  423. }
  424. prev_wqe = srq->last;
  425. srq->last = wqe;
  426. ((struct mthca_next_seg *) wqe)->nda_op = 0;
  427. ((struct mthca_next_seg *) wqe)->ee_nds = 0;
  428. /* flags field will always remain 0 */
  429. wqe += sizeof (struct mthca_next_seg);
  430. if (unlikely(wr->num_sge > srq->max_gs)) {
  431. err = -EINVAL;
  432. *bad_wr = wr;
  433. srq->last = prev_wqe;
  434. break;
  435. }
  436. for (i = 0; i < wr->num_sge; ++i) {
  437. ((struct mthca_data_seg *) wqe)->byte_count =
  438. cpu_to_be32(wr->sg_list[i].length);
  439. ((struct mthca_data_seg *) wqe)->lkey =
  440. cpu_to_be32(wr->sg_list[i].lkey);
  441. ((struct mthca_data_seg *) wqe)->addr =
  442. cpu_to_be64(wr->sg_list[i].addr);
  443. wqe += sizeof (struct mthca_data_seg);
  444. }
  445. if (i < srq->max_gs) {
  446. ((struct mthca_data_seg *) wqe)->byte_count = 0;
  447. ((struct mthca_data_seg *) wqe)->lkey = cpu_to_be32(MTHCA_INVAL_LKEY);
  448. ((struct mthca_data_seg *) wqe)->addr = 0;
  449. }
  450. ((struct mthca_next_seg *) prev_wqe)->nda_op =
  451. cpu_to_be32((ind << srq->wqe_shift) | 1);
  452. wmb();
  453. ((struct mthca_next_seg *) prev_wqe)->ee_nds =
  454. cpu_to_be32(MTHCA_NEXT_DBD);
  455. srq->wrid[ind] = wr->wr_id;
  456. srq->first_free = next_ind;
  457. ++nreq;
  458. if (unlikely(nreq == MTHCA_TAVOR_MAX_WQES_PER_RECV_DB)) {
  459. nreq = 0;
  460. doorbell[0] = cpu_to_be32(first_ind << srq->wqe_shift);
  461. doorbell[1] = cpu_to_be32(srq->srqn << 8);
  462. /*
  463. * Make sure that descriptors are written
  464. * before doorbell is rung.
  465. */
  466. wmb();
  467. mthca_write64(doorbell,
  468. dev->kar + MTHCA_RECEIVE_DOORBELL,
  469. MTHCA_GET_DOORBELL_LOCK(&dev->doorbell_lock));
  470. first_ind = srq->first_free;
  471. }
  472. }
  473. if (likely(nreq)) {
  474. doorbell[0] = cpu_to_be32(first_ind << srq->wqe_shift);
  475. doorbell[1] = cpu_to_be32((srq->srqn << 8) | nreq);
  476. /*
  477. * Make sure that descriptors are written before
  478. * doorbell is rung.
  479. */
  480. wmb();
  481. mthca_write64(doorbell,
  482. dev->kar + MTHCA_RECEIVE_DOORBELL,
  483. MTHCA_GET_DOORBELL_LOCK(&dev->doorbell_lock));
  484. }
  485. spin_unlock_irqrestore(&srq->lock, flags);
  486. return err;
  487. }
  488. int mthca_arbel_post_srq_recv(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
  489. struct ib_recv_wr **bad_wr)
  490. {
  491. struct mthca_dev *dev = to_mdev(ibsrq->device);
  492. struct mthca_srq *srq = to_msrq(ibsrq);
  493. unsigned long flags;
  494. int err = 0;
  495. int ind;
  496. int next_ind;
  497. int nreq;
  498. int i;
  499. void *wqe;
  500. spin_lock_irqsave(&srq->lock, flags);
  501. for (nreq = 0; wr; ++nreq, wr = wr->next) {
  502. ind = srq->first_free;
  503. if (ind < 0) {
  504. mthca_err(dev, "SRQ %06x full\n", srq->srqn);
  505. err = -ENOMEM;
  506. *bad_wr = wr;
  507. break;
  508. }
  509. wqe = get_wqe(srq, ind);
  510. next_ind = *wqe_to_link(wqe);
  511. if (next_ind < 0) {
  512. mthca_err(dev, "SRQ %06x full\n", srq->srqn);
  513. err = -ENOMEM;
  514. *bad_wr = wr;
  515. break;
  516. }
  517. ((struct mthca_next_seg *) wqe)->nda_op =
  518. cpu_to_be32((next_ind << srq->wqe_shift) | 1);
  519. ((struct mthca_next_seg *) wqe)->ee_nds = 0;
  520. /* flags field will always remain 0 */
  521. wqe += sizeof (struct mthca_next_seg);
  522. if (unlikely(wr->num_sge > srq->max_gs)) {
  523. err = -EINVAL;
  524. *bad_wr = wr;
  525. break;
  526. }
  527. for (i = 0; i < wr->num_sge; ++i) {
  528. ((struct mthca_data_seg *) wqe)->byte_count =
  529. cpu_to_be32(wr->sg_list[i].length);
  530. ((struct mthca_data_seg *) wqe)->lkey =
  531. cpu_to_be32(wr->sg_list[i].lkey);
  532. ((struct mthca_data_seg *) wqe)->addr =
  533. cpu_to_be64(wr->sg_list[i].addr);
  534. wqe += sizeof (struct mthca_data_seg);
  535. }
  536. if (i < srq->max_gs) {
  537. ((struct mthca_data_seg *) wqe)->byte_count = 0;
  538. ((struct mthca_data_seg *) wqe)->lkey = cpu_to_be32(MTHCA_INVAL_LKEY);
  539. ((struct mthca_data_seg *) wqe)->addr = 0;
  540. }
  541. srq->wrid[ind] = wr->wr_id;
  542. srq->first_free = next_ind;
  543. }
  544. if (likely(nreq)) {
  545. srq->counter += nreq;
  546. /*
  547. * Make sure that descriptors are written before
  548. * we write doorbell record.
  549. */
  550. wmb();
  551. *srq->db = cpu_to_be32(srq->counter);
  552. }
  553. spin_unlock_irqrestore(&srq->lock, flags);
  554. return err;
  555. }
  556. int mthca_max_srq_sge(struct mthca_dev *dev)
  557. {
  558. if (mthca_is_memfree(dev))
  559. return dev->limits.max_sg;
  560. /*
  561. * SRQ allocations are based on powers of 2 for Tavor,
  562. * (although they only need to be multiples of 16 bytes).
  563. *
  564. * Therefore, we need to base the max number of sg entries on
  565. * the largest power of 2 descriptor size that is <= to the
  566. * actual max WQE descriptor size, rather than return the
  567. * max_sg value given by the firmware (which is based on WQE
  568. * sizes as multiples of 16, not powers of 2).
  569. *
  570. * If SRQ implementation is changed for Tavor to be based on
  571. * multiples of 16, the calculation below can be deleted and
  572. * the FW max_sg value returned.
  573. */
  574. return min_t(int, dev->limits.max_sg,
  575. ((1 << (fls(dev->limits.max_desc_sz) - 1)) -
  576. sizeof (struct mthca_next_seg)) /
  577. sizeof (struct mthca_data_seg));
  578. }
  579. int __devinit mthca_init_srq_table(struct mthca_dev *dev)
  580. {
  581. int err;
  582. if (!(dev->mthca_flags & MTHCA_FLAG_SRQ))
  583. return 0;
  584. spin_lock_init(&dev->srq_table.lock);
  585. err = mthca_alloc_init(&dev->srq_table.alloc,
  586. dev->limits.num_srqs,
  587. dev->limits.num_srqs - 1,
  588. dev->limits.reserved_srqs);
  589. if (err)
  590. return err;
  591. err = mthca_array_init(&dev->srq_table.srq,
  592. dev->limits.num_srqs);
  593. if (err)
  594. mthca_alloc_cleanup(&dev->srq_table.alloc);
  595. return err;
  596. }
  597. void mthca_cleanup_srq_table(struct mthca_dev *dev)
  598. {
  599. if (!(dev->mthca_flags & MTHCA_FLAG_SRQ))
  600. return;
  601. mthca_array_cleanup(&dev->srq_table.srq, dev->limits.num_srqs);
  602. mthca_alloc_cleanup(&dev->srq_table.alloc);
  603. }