rxe_req.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765
  1. /*
  2. * Copyright (c) 2016 Mellanox Technologies Ltd. All rights reserved.
  3. * Copyright (c) 2015 System Fabric Works, Inc. 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/skbuff.h>
  34. #include <crypto/hash.h>
  35. #include "rxe.h"
  36. #include "rxe_loc.h"
  37. #include "rxe_queue.h"
  38. static int next_opcode(struct rxe_qp *qp, struct rxe_send_wqe *wqe,
  39. u32 opcode);
  40. static inline void retry_first_write_send(struct rxe_qp *qp,
  41. struct rxe_send_wqe *wqe,
  42. unsigned int mask, int npsn)
  43. {
  44. int i;
  45. for (i = 0; i < npsn; i++) {
  46. int to_send = (wqe->dma.resid > qp->mtu) ?
  47. qp->mtu : wqe->dma.resid;
  48. qp->req.opcode = next_opcode(qp, wqe,
  49. wqe->wr.opcode);
  50. if (wqe->wr.send_flags & IB_SEND_INLINE) {
  51. wqe->dma.resid -= to_send;
  52. wqe->dma.sge_offset += to_send;
  53. } else {
  54. advance_dma_data(&wqe->dma, to_send);
  55. }
  56. if (mask & WR_WRITE_MASK)
  57. wqe->iova += qp->mtu;
  58. }
  59. }
  60. static void req_retry(struct rxe_qp *qp)
  61. {
  62. struct rxe_send_wqe *wqe;
  63. unsigned int wqe_index;
  64. unsigned int mask;
  65. int npsn;
  66. int first = 1;
  67. qp->req.wqe_index = consumer_index(qp->sq.queue);
  68. qp->req.psn = qp->comp.psn;
  69. qp->req.opcode = -1;
  70. for (wqe_index = consumer_index(qp->sq.queue);
  71. wqe_index != producer_index(qp->sq.queue);
  72. wqe_index = next_index(qp->sq.queue, wqe_index)) {
  73. wqe = addr_from_index(qp->sq.queue, wqe_index);
  74. mask = wr_opcode_mask(wqe->wr.opcode, qp);
  75. if (wqe->state == wqe_state_posted)
  76. break;
  77. if (wqe->state == wqe_state_done)
  78. continue;
  79. wqe->iova = (mask & WR_ATOMIC_MASK) ?
  80. wqe->wr.wr.atomic.remote_addr :
  81. (mask & WR_READ_OR_WRITE_MASK) ?
  82. wqe->wr.wr.rdma.remote_addr :
  83. 0;
  84. if (!first || (mask & WR_READ_MASK) == 0) {
  85. wqe->dma.resid = wqe->dma.length;
  86. wqe->dma.cur_sge = 0;
  87. wqe->dma.sge_offset = 0;
  88. }
  89. if (first) {
  90. first = 0;
  91. if (mask & WR_WRITE_OR_SEND_MASK) {
  92. npsn = (qp->comp.psn - wqe->first_psn) &
  93. BTH_PSN_MASK;
  94. retry_first_write_send(qp, wqe, mask, npsn);
  95. }
  96. if (mask & WR_READ_MASK) {
  97. npsn = (wqe->dma.length - wqe->dma.resid) /
  98. qp->mtu;
  99. wqe->iova += npsn * qp->mtu;
  100. }
  101. }
  102. wqe->state = wqe_state_posted;
  103. }
  104. }
  105. void rnr_nak_timer(struct timer_list *t)
  106. {
  107. struct rxe_qp *qp = from_timer(qp, t, rnr_nak_timer);
  108. pr_debug("qp#%d rnr nak timer fired\n", qp_num(qp));
  109. rxe_run_task(&qp->req.task, 1);
  110. }
  111. static struct rxe_send_wqe *req_next_wqe(struct rxe_qp *qp)
  112. {
  113. struct rxe_send_wqe *wqe = queue_head(qp->sq.queue);
  114. unsigned long flags;
  115. if (unlikely(qp->req.state == QP_STATE_DRAIN)) {
  116. /* check to see if we are drained;
  117. * state_lock used by requester and completer
  118. */
  119. spin_lock_irqsave(&qp->state_lock, flags);
  120. do {
  121. if (qp->req.state != QP_STATE_DRAIN) {
  122. /* comp just finished */
  123. spin_unlock_irqrestore(&qp->state_lock,
  124. flags);
  125. break;
  126. }
  127. if (wqe && ((qp->req.wqe_index !=
  128. consumer_index(qp->sq.queue)) ||
  129. (wqe->state != wqe_state_posted))) {
  130. /* comp not done yet */
  131. spin_unlock_irqrestore(&qp->state_lock,
  132. flags);
  133. break;
  134. }
  135. qp->req.state = QP_STATE_DRAINED;
  136. spin_unlock_irqrestore(&qp->state_lock, flags);
  137. if (qp->ibqp.event_handler) {
  138. struct ib_event ev;
  139. ev.device = qp->ibqp.device;
  140. ev.element.qp = &qp->ibqp;
  141. ev.event = IB_EVENT_SQ_DRAINED;
  142. qp->ibqp.event_handler(&ev,
  143. qp->ibqp.qp_context);
  144. }
  145. } while (0);
  146. }
  147. if (qp->req.wqe_index == producer_index(qp->sq.queue))
  148. return NULL;
  149. wqe = addr_from_index(qp->sq.queue, qp->req.wqe_index);
  150. if (unlikely((qp->req.state == QP_STATE_DRAIN ||
  151. qp->req.state == QP_STATE_DRAINED) &&
  152. (wqe->state != wqe_state_processing)))
  153. return NULL;
  154. if (unlikely((wqe->wr.send_flags & IB_SEND_FENCE) &&
  155. (qp->req.wqe_index != consumer_index(qp->sq.queue)))) {
  156. qp->req.wait_fence = 1;
  157. return NULL;
  158. }
  159. wqe->mask = wr_opcode_mask(wqe->wr.opcode, qp);
  160. return wqe;
  161. }
  162. static int next_opcode_rc(struct rxe_qp *qp, u32 opcode, int fits)
  163. {
  164. switch (opcode) {
  165. case IB_WR_RDMA_WRITE:
  166. if (qp->req.opcode == IB_OPCODE_RC_RDMA_WRITE_FIRST ||
  167. qp->req.opcode == IB_OPCODE_RC_RDMA_WRITE_MIDDLE)
  168. return fits ?
  169. IB_OPCODE_RC_RDMA_WRITE_LAST :
  170. IB_OPCODE_RC_RDMA_WRITE_MIDDLE;
  171. else
  172. return fits ?
  173. IB_OPCODE_RC_RDMA_WRITE_ONLY :
  174. IB_OPCODE_RC_RDMA_WRITE_FIRST;
  175. case IB_WR_RDMA_WRITE_WITH_IMM:
  176. if (qp->req.opcode == IB_OPCODE_RC_RDMA_WRITE_FIRST ||
  177. qp->req.opcode == IB_OPCODE_RC_RDMA_WRITE_MIDDLE)
  178. return fits ?
  179. IB_OPCODE_RC_RDMA_WRITE_LAST_WITH_IMMEDIATE :
  180. IB_OPCODE_RC_RDMA_WRITE_MIDDLE;
  181. else
  182. return fits ?
  183. IB_OPCODE_RC_RDMA_WRITE_ONLY_WITH_IMMEDIATE :
  184. IB_OPCODE_RC_RDMA_WRITE_FIRST;
  185. case IB_WR_SEND:
  186. if (qp->req.opcode == IB_OPCODE_RC_SEND_FIRST ||
  187. qp->req.opcode == IB_OPCODE_RC_SEND_MIDDLE)
  188. return fits ?
  189. IB_OPCODE_RC_SEND_LAST :
  190. IB_OPCODE_RC_SEND_MIDDLE;
  191. else
  192. return fits ?
  193. IB_OPCODE_RC_SEND_ONLY :
  194. IB_OPCODE_RC_SEND_FIRST;
  195. case IB_WR_SEND_WITH_IMM:
  196. if (qp->req.opcode == IB_OPCODE_RC_SEND_FIRST ||
  197. qp->req.opcode == IB_OPCODE_RC_SEND_MIDDLE)
  198. return fits ?
  199. IB_OPCODE_RC_SEND_LAST_WITH_IMMEDIATE :
  200. IB_OPCODE_RC_SEND_MIDDLE;
  201. else
  202. return fits ?
  203. IB_OPCODE_RC_SEND_ONLY_WITH_IMMEDIATE :
  204. IB_OPCODE_RC_SEND_FIRST;
  205. case IB_WR_RDMA_READ:
  206. return IB_OPCODE_RC_RDMA_READ_REQUEST;
  207. case IB_WR_ATOMIC_CMP_AND_SWP:
  208. return IB_OPCODE_RC_COMPARE_SWAP;
  209. case IB_WR_ATOMIC_FETCH_AND_ADD:
  210. return IB_OPCODE_RC_FETCH_ADD;
  211. case IB_WR_SEND_WITH_INV:
  212. if (qp->req.opcode == IB_OPCODE_RC_SEND_FIRST ||
  213. qp->req.opcode == IB_OPCODE_RC_SEND_MIDDLE)
  214. return fits ? IB_OPCODE_RC_SEND_LAST_WITH_INVALIDATE :
  215. IB_OPCODE_RC_SEND_MIDDLE;
  216. else
  217. return fits ? IB_OPCODE_RC_SEND_ONLY_WITH_INVALIDATE :
  218. IB_OPCODE_RC_SEND_FIRST;
  219. case IB_WR_REG_MR:
  220. case IB_WR_LOCAL_INV:
  221. return opcode;
  222. }
  223. return -EINVAL;
  224. }
  225. static int next_opcode_uc(struct rxe_qp *qp, u32 opcode, int fits)
  226. {
  227. switch (opcode) {
  228. case IB_WR_RDMA_WRITE:
  229. if (qp->req.opcode == IB_OPCODE_UC_RDMA_WRITE_FIRST ||
  230. qp->req.opcode == IB_OPCODE_UC_RDMA_WRITE_MIDDLE)
  231. return fits ?
  232. IB_OPCODE_UC_RDMA_WRITE_LAST :
  233. IB_OPCODE_UC_RDMA_WRITE_MIDDLE;
  234. else
  235. return fits ?
  236. IB_OPCODE_UC_RDMA_WRITE_ONLY :
  237. IB_OPCODE_UC_RDMA_WRITE_FIRST;
  238. case IB_WR_RDMA_WRITE_WITH_IMM:
  239. if (qp->req.opcode == IB_OPCODE_UC_RDMA_WRITE_FIRST ||
  240. qp->req.opcode == IB_OPCODE_UC_RDMA_WRITE_MIDDLE)
  241. return fits ?
  242. IB_OPCODE_UC_RDMA_WRITE_LAST_WITH_IMMEDIATE :
  243. IB_OPCODE_UC_RDMA_WRITE_MIDDLE;
  244. else
  245. return fits ?
  246. IB_OPCODE_UC_RDMA_WRITE_ONLY_WITH_IMMEDIATE :
  247. IB_OPCODE_UC_RDMA_WRITE_FIRST;
  248. case IB_WR_SEND:
  249. if (qp->req.opcode == IB_OPCODE_UC_SEND_FIRST ||
  250. qp->req.opcode == IB_OPCODE_UC_SEND_MIDDLE)
  251. return fits ?
  252. IB_OPCODE_UC_SEND_LAST :
  253. IB_OPCODE_UC_SEND_MIDDLE;
  254. else
  255. return fits ?
  256. IB_OPCODE_UC_SEND_ONLY :
  257. IB_OPCODE_UC_SEND_FIRST;
  258. case IB_WR_SEND_WITH_IMM:
  259. if (qp->req.opcode == IB_OPCODE_UC_SEND_FIRST ||
  260. qp->req.opcode == IB_OPCODE_UC_SEND_MIDDLE)
  261. return fits ?
  262. IB_OPCODE_UC_SEND_LAST_WITH_IMMEDIATE :
  263. IB_OPCODE_UC_SEND_MIDDLE;
  264. else
  265. return fits ?
  266. IB_OPCODE_UC_SEND_ONLY_WITH_IMMEDIATE :
  267. IB_OPCODE_UC_SEND_FIRST;
  268. }
  269. return -EINVAL;
  270. }
  271. static int next_opcode(struct rxe_qp *qp, struct rxe_send_wqe *wqe,
  272. u32 opcode)
  273. {
  274. int fits = (wqe->dma.resid <= qp->mtu);
  275. switch (qp_type(qp)) {
  276. case IB_QPT_RC:
  277. return next_opcode_rc(qp, opcode, fits);
  278. case IB_QPT_UC:
  279. return next_opcode_uc(qp, opcode, fits);
  280. case IB_QPT_SMI:
  281. case IB_QPT_UD:
  282. case IB_QPT_GSI:
  283. switch (opcode) {
  284. case IB_WR_SEND:
  285. return IB_OPCODE_UD_SEND_ONLY;
  286. case IB_WR_SEND_WITH_IMM:
  287. return IB_OPCODE_UD_SEND_ONLY_WITH_IMMEDIATE;
  288. }
  289. break;
  290. default:
  291. break;
  292. }
  293. return -EINVAL;
  294. }
  295. static inline int check_init_depth(struct rxe_qp *qp, struct rxe_send_wqe *wqe)
  296. {
  297. int depth;
  298. if (wqe->has_rd_atomic)
  299. return 0;
  300. qp->req.need_rd_atomic = 1;
  301. depth = atomic_dec_return(&qp->req.rd_atomic);
  302. if (depth >= 0) {
  303. qp->req.need_rd_atomic = 0;
  304. wqe->has_rd_atomic = 1;
  305. return 0;
  306. }
  307. atomic_inc(&qp->req.rd_atomic);
  308. return -EAGAIN;
  309. }
  310. static inline int get_mtu(struct rxe_qp *qp)
  311. {
  312. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  313. if ((qp_type(qp) == IB_QPT_RC) || (qp_type(qp) == IB_QPT_UC))
  314. return qp->mtu;
  315. return rxe->port.mtu_cap;
  316. }
  317. static struct sk_buff *init_req_packet(struct rxe_qp *qp,
  318. struct rxe_send_wqe *wqe,
  319. int opcode, int payload,
  320. struct rxe_pkt_info *pkt)
  321. {
  322. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  323. struct rxe_port *port = &rxe->port;
  324. struct sk_buff *skb;
  325. struct rxe_send_wr *ibwr = &wqe->wr;
  326. struct rxe_av *av;
  327. int pad = (-payload) & 0x3;
  328. int paylen;
  329. int solicited;
  330. u16 pkey;
  331. u32 qp_num;
  332. int ack_req;
  333. /* length from start of bth to end of icrc */
  334. paylen = rxe_opcode[opcode].length + payload + pad + RXE_ICRC_SIZE;
  335. /* pkt->hdr, rxe, port_num and mask are initialized in ifc
  336. * layer
  337. */
  338. pkt->opcode = opcode;
  339. pkt->qp = qp;
  340. pkt->psn = qp->req.psn;
  341. pkt->mask = rxe_opcode[opcode].mask;
  342. pkt->paylen = paylen;
  343. pkt->offset = 0;
  344. pkt->wqe = wqe;
  345. /* init skb */
  346. av = rxe_get_av(pkt);
  347. skb = rxe_init_packet(rxe, av, paylen, pkt);
  348. if (unlikely(!skb))
  349. return NULL;
  350. /* init bth */
  351. solicited = (ibwr->send_flags & IB_SEND_SOLICITED) &&
  352. (pkt->mask & RXE_END_MASK) &&
  353. ((pkt->mask & (RXE_SEND_MASK)) ||
  354. (pkt->mask & (RXE_WRITE_MASK | RXE_IMMDT_MASK)) ==
  355. (RXE_WRITE_MASK | RXE_IMMDT_MASK));
  356. pkey = (qp_type(qp) == IB_QPT_GSI) ?
  357. port->pkey_tbl[ibwr->wr.ud.pkey_index] :
  358. port->pkey_tbl[qp->attr.pkey_index];
  359. qp_num = (pkt->mask & RXE_DETH_MASK) ? ibwr->wr.ud.remote_qpn :
  360. qp->attr.dest_qp_num;
  361. ack_req = ((pkt->mask & RXE_END_MASK) ||
  362. (qp->req.noack_pkts++ > RXE_MAX_PKT_PER_ACK));
  363. if (ack_req)
  364. qp->req.noack_pkts = 0;
  365. bth_init(pkt, pkt->opcode, solicited, 0, pad, pkey, qp_num,
  366. ack_req, pkt->psn);
  367. /* init optional headers */
  368. if (pkt->mask & RXE_RETH_MASK) {
  369. reth_set_rkey(pkt, ibwr->wr.rdma.rkey);
  370. reth_set_va(pkt, wqe->iova);
  371. reth_set_len(pkt, wqe->dma.resid);
  372. }
  373. if (pkt->mask & RXE_IMMDT_MASK)
  374. immdt_set_imm(pkt, ibwr->ex.imm_data);
  375. if (pkt->mask & RXE_IETH_MASK)
  376. ieth_set_rkey(pkt, ibwr->ex.invalidate_rkey);
  377. if (pkt->mask & RXE_ATMETH_MASK) {
  378. atmeth_set_va(pkt, wqe->iova);
  379. if (opcode == IB_OPCODE_RC_COMPARE_SWAP ||
  380. opcode == IB_OPCODE_RD_COMPARE_SWAP) {
  381. atmeth_set_swap_add(pkt, ibwr->wr.atomic.swap);
  382. atmeth_set_comp(pkt, ibwr->wr.atomic.compare_add);
  383. } else {
  384. atmeth_set_swap_add(pkt, ibwr->wr.atomic.compare_add);
  385. }
  386. atmeth_set_rkey(pkt, ibwr->wr.atomic.rkey);
  387. }
  388. if (pkt->mask & RXE_DETH_MASK) {
  389. if (qp->ibqp.qp_num == 1)
  390. deth_set_qkey(pkt, GSI_QKEY);
  391. else
  392. deth_set_qkey(pkt, ibwr->wr.ud.remote_qkey);
  393. deth_set_sqp(pkt, qp->ibqp.qp_num);
  394. }
  395. return skb;
  396. }
  397. static int fill_packet(struct rxe_qp *qp, struct rxe_send_wqe *wqe,
  398. struct rxe_pkt_info *pkt, struct sk_buff *skb,
  399. int paylen)
  400. {
  401. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  402. u32 crc = 0;
  403. u32 *p;
  404. int err;
  405. err = rxe_prepare(rxe, pkt, skb, &crc);
  406. if (err)
  407. return err;
  408. if (pkt->mask & RXE_WRITE_OR_SEND) {
  409. if (wqe->wr.send_flags & IB_SEND_INLINE) {
  410. u8 *tmp = &wqe->dma.inline_data[wqe->dma.sge_offset];
  411. crc = rxe_crc32(rxe, crc, tmp, paylen);
  412. memcpy(payload_addr(pkt), tmp, paylen);
  413. wqe->dma.resid -= paylen;
  414. wqe->dma.sge_offset += paylen;
  415. } else {
  416. err = copy_data(qp->pd, 0, &wqe->dma,
  417. payload_addr(pkt), paylen,
  418. from_mem_obj,
  419. &crc);
  420. if (err)
  421. return err;
  422. }
  423. if (bth_pad(pkt)) {
  424. u8 *pad = payload_addr(pkt) + paylen;
  425. memset(pad, 0, bth_pad(pkt));
  426. crc = rxe_crc32(rxe, crc, pad, bth_pad(pkt));
  427. }
  428. }
  429. p = payload_addr(pkt) + paylen + bth_pad(pkt);
  430. *p = ~crc;
  431. return 0;
  432. }
  433. static void update_wqe_state(struct rxe_qp *qp,
  434. struct rxe_send_wqe *wqe,
  435. struct rxe_pkt_info *pkt)
  436. {
  437. if (pkt->mask & RXE_END_MASK) {
  438. if (qp_type(qp) == IB_QPT_RC)
  439. wqe->state = wqe_state_pending;
  440. } else {
  441. wqe->state = wqe_state_processing;
  442. }
  443. }
  444. static void update_wqe_psn(struct rxe_qp *qp,
  445. struct rxe_send_wqe *wqe,
  446. struct rxe_pkt_info *pkt,
  447. int payload)
  448. {
  449. /* number of packets left to send including current one */
  450. int num_pkt = (wqe->dma.resid + payload + qp->mtu - 1) / qp->mtu;
  451. /* handle zero length packet case */
  452. if (num_pkt == 0)
  453. num_pkt = 1;
  454. if (pkt->mask & RXE_START_MASK) {
  455. wqe->first_psn = qp->req.psn;
  456. wqe->last_psn = (qp->req.psn + num_pkt - 1) & BTH_PSN_MASK;
  457. }
  458. if (pkt->mask & RXE_READ_MASK)
  459. qp->req.psn = (wqe->first_psn + num_pkt) & BTH_PSN_MASK;
  460. else
  461. qp->req.psn = (qp->req.psn + 1) & BTH_PSN_MASK;
  462. }
  463. static void save_state(struct rxe_send_wqe *wqe,
  464. struct rxe_qp *qp,
  465. struct rxe_send_wqe *rollback_wqe,
  466. u32 *rollback_psn)
  467. {
  468. rollback_wqe->state = wqe->state;
  469. rollback_wqe->first_psn = wqe->first_psn;
  470. rollback_wqe->last_psn = wqe->last_psn;
  471. *rollback_psn = qp->req.psn;
  472. }
  473. static void rollback_state(struct rxe_send_wqe *wqe,
  474. struct rxe_qp *qp,
  475. struct rxe_send_wqe *rollback_wqe,
  476. u32 rollback_psn)
  477. {
  478. wqe->state = rollback_wqe->state;
  479. wqe->first_psn = rollback_wqe->first_psn;
  480. wqe->last_psn = rollback_wqe->last_psn;
  481. qp->req.psn = rollback_psn;
  482. }
  483. static void update_state(struct rxe_qp *qp, struct rxe_send_wqe *wqe,
  484. struct rxe_pkt_info *pkt, int payload)
  485. {
  486. qp->req.opcode = pkt->opcode;
  487. if (pkt->mask & RXE_END_MASK)
  488. qp->req.wqe_index = next_index(qp->sq.queue, qp->req.wqe_index);
  489. qp->need_req_skb = 0;
  490. if (qp->qp_timeout_jiffies && !timer_pending(&qp->retrans_timer))
  491. mod_timer(&qp->retrans_timer,
  492. jiffies + qp->qp_timeout_jiffies);
  493. }
  494. int rxe_requester(void *arg)
  495. {
  496. struct rxe_qp *qp = (struct rxe_qp *)arg;
  497. struct rxe_pkt_info pkt;
  498. struct sk_buff *skb;
  499. struct rxe_send_wqe *wqe;
  500. enum rxe_hdr_mask mask;
  501. int payload;
  502. int mtu;
  503. int opcode;
  504. int ret;
  505. struct rxe_send_wqe rollback_wqe;
  506. u32 rollback_psn;
  507. rxe_add_ref(qp);
  508. next_wqe:
  509. if (unlikely(!qp->valid || qp->req.state == QP_STATE_ERROR))
  510. goto exit;
  511. if (unlikely(qp->req.state == QP_STATE_RESET)) {
  512. qp->req.wqe_index = consumer_index(qp->sq.queue);
  513. qp->req.opcode = -1;
  514. qp->req.need_rd_atomic = 0;
  515. qp->req.wait_psn = 0;
  516. qp->req.need_retry = 0;
  517. goto exit;
  518. }
  519. if (unlikely(qp->req.need_retry)) {
  520. req_retry(qp);
  521. qp->req.need_retry = 0;
  522. }
  523. wqe = req_next_wqe(qp);
  524. if (unlikely(!wqe))
  525. goto exit;
  526. if (wqe->mask & WR_REG_MASK) {
  527. if (wqe->wr.opcode == IB_WR_LOCAL_INV) {
  528. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  529. struct rxe_mem *rmr;
  530. rmr = rxe_pool_get_index(&rxe->mr_pool,
  531. wqe->wr.ex.invalidate_rkey >> 8);
  532. if (!rmr) {
  533. pr_err("No mr for key %#x\n",
  534. wqe->wr.ex.invalidate_rkey);
  535. wqe->state = wqe_state_error;
  536. wqe->status = IB_WC_MW_BIND_ERR;
  537. goto exit;
  538. }
  539. rmr->state = RXE_MEM_STATE_FREE;
  540. rxe_drop_ref(rmr);
  541. wqe->state = wqe_state_done;
  542. wqe->status = IB_WC_SUCCESS;
  543. } else if (wqe->wr.opcode == IB_WR_REG_MR) {
  544. struct rxe_mem *rmr = to_rmr(wqe->wr.wr.reg.mr);
  545. rmr->state = RXE_MEM_STATE_VALID;
  546. rmr->access = wqe->wr.wr.reg.access;
  547. rmr->lkey = wqe->wr.wr.reg.key;
  548. rmr->rkey = wqe->wr.wr.reg.key;
  549. rmr->iova = wqe->wr.wr.reg.mr->iova;
  550. wqe->state = wqe_state_done;
  551. wqe->status = IB_WC_SUCCESS;
  552. } else {
  553. goto exit;
  554. }
  555. if ((wqe->wr.send_flags & IB_SEND_SIGNALED) ||
  556. qp->sq_sig_type == IB_SIGNAL_ALL_WR)
  557. rxe_run_task(&qp->comp.task, 1);
  558. qp->req.wqe_index = next_index(qp->sq.queue,
  559. qp->req.wqe_index);
  560. goto next_wqe;
  561. }
  562. if (unlikely(qp_type(qp) == IB_QPT_RC &&
  563. qp->req.psn > (qp->comp.psn + RXE_MAX_UNACKED_PSNS))) {
  564. qp->req.wait_psn = 1;
  565. goto exit;
  566. }
  567. /* Limit the number of inflight SKBs per QP */
  568. if (unlikely(atomic_read(&qp->skb_out) >
  569. RXE_INFLIGHT_SKBS_PER_QP_HIGH)) {
  570. qp->need_req_skb = 1;
  571. goto exit;
  572. }
  573. opcode = next_opcode(qp, wqe, wqe->wr.opcode);
  574. if (unlikely(opcode < 0)) {
  575. wqe->status = IB_WC_LOC_QP_OP_ERR;
  576. goto exit;
  577. }
  578. mask = rxe_opcode[opcode].mask;
  579. if (unlikely(mask & RXE_READ_OR_ATOMIC)) {
  580. if (check_init_depth(qp, wqe))
  581. goto exit;
  582. }
  583. mtu = get_mtu(qp);
  584. payload = (mask & RXE_WRITE_OR_SEND) ? wqe->dma.resid : 0;
  585. if (payload > mtu) {
  586. if (qp_type(qp) == IB_QPT_UD) {
  587. /* C10-93.1.1: If the total sum of all the buffer lengths specified for a
  588. * UD message exceeds the MTU of the port as returned by QueryHCA, the CI
  589. * shall not emit any packets for this message. Further, the CI shall not
  590. * generate an error due to this condition.
  591. */
  592. /* fake a successful UD send */
  593. wqe->first_psn = qp->req.psn;
  594. wqe->last_psn = qp->req.psn;
  595. qp->req.psn = (qp->req.psn + 1) & BTH_PSN_MASK;
  596. qp->req.opcode = IB_OPCODE_UD_SEND_ONLY;
  597. qp->req.wqe_index = next_index(qp->sq.queue,
  598. qp->req.wqe_index);
  599. wqe->state = wqe_state_done;
  600. wqe->status = IB_WC_SUCCESS;
  601. __rxe_do_task(&qp->comp.task);
  602. rxe_drop_ref(qp);
  603. return 0;
  604. }
  605. payload = mtu;
  606. }
  607. skb = init_req_packet(qp, wqe, opcode, payload, &pkt);
  608. if (unlikely(!skb)) {
  609. pr_err("qp#%d Failed allocating skb\n", qp_num(qp));
  610. goto err;
  611. }
  612. if (fill_packet(qp, wqe, &pkt, skb, payload)) {
  613. pr_debug("qp#%d Error during fill packet\n", qp_num(qp));
  614. kfree_skb(skb);
  615. goto err;
  616. }
  617. /*
  618. * To prevent a race on wqe access between requester and completer,
  619. * wqe members state and psn need to be set before calling
  620. * rxe_xmit_packet().
  621. * Otherwise, completer might initiate an unjustified retry flow.
  622. */
  623. save_state(wqe, qp, &rollback_wqe, &rollback_psn);
  624. update_wqe_state(qp, wqe, &pkt);
  625. update_wqe_psn(qp, wqe, &pkt, payload);
  626. ret = rxe_xmit_packet(to_rdev(qp->ibqp.device), qp, &pkt, skb);
  627. if (ret) {
  628. qp->need_req_skb = 1;
  629. rollback_state(wqe, qp, &rollback_wqe, rollback_psn);
  630. if (ret == -EAGAIN) {
  631. rxe_run_task(&qp->req.task, 1);
  632. goto exit;
  633. }
  634. goto err;
  635. }
  636. update_state(qp, wqe, &pkt, payload);
  637. goto next_wqe;
  638. err:
  639. wqe->status = IB_WC_LOC_PROT_ERR;
  640. wqe->state = wqe_state_error;
  641. __rxe_do_task(&qp->comp.task);
  642. exit:
  643. rxe_drop_ref(qp);
  644. return -EAGAIN;
  645. }