rxe_req.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832
  1. // SPDX-License-Identifier: GPL-2.0 OR Linux-OpenIB
  2. /*
  3. * Copyright (c) 2016 Mellanox Technologies Ltd. All rights reserved.
  4. * Copyright (c) 2015 System Fabric Works, Inc. All rights reserved.
  5. */
  6. #include <linux/skbuff.h>
  7. #include <crypto/hash.h>
  8. #include "rxe.h"
  9. #include "rxe_loc.h"
  10. #include "rxe_queue.h"
  11. static int next_opcode(struct rxe_qp *qp, struct rxe_send_wqe *wqe,
  12. u32 opcode);
  13. static inline void retry_first_write_send(struct rxe_qp *qp,
  14. struct rxe_send_wqe *wqe, int npsn)
  15. {
  16. int i;
  17. for (i = 0; i < npsn; i++) {
  18. int to_send = (wqe->dma.resid > qp->mtu) ?
  19. qp->mtu : wqe->dma.resid;
  20. qp->req.opcode = next_opcode(qp, wqe,
  21. wqe->wr.opcode);
  22. if (wqe->wr.send_flags & IB_SEND_INLINE) {
  23. wqe->dma.resid -= to_send;
  24. wqe->dma.sge_offset += to_send;
  25. } else {
  26. advance_dma_data(&wqe->dma, to_send);
  27. }
  28. }
  29. }
  30. static void req_retry(struct rxe_qp *qp)
  31. {
  32. struct rxe_send_wqe *wqe;
  33. unsigned int wqe_index;
  34. unsigned int mask;
  35. int npsn;
  36. int first = 1;
  37. struct rxe_queue *q = qp->sq.queue;
  38. unsigned int cons;
  39. unsigned int prod;
  40. cons = queue_get_consumer(q, QUEUE_TYPE_FROM_CLIENT);
  41. prod = queue_get_producer(q, QUEUE_TYPE_FROM_CLIENT);
  42. qp->req.wqe_index = cons;
  43. qp->req.psn = qp->comp.psn;
  44. qp->req.opcode = -1;
  45. for (wqe_index = cons; wqe_index != prod;
  46. wqe_index = queue_next_index(q, wqe_index)) {
  47. wqe = queue_addr_from_index(qp->sq.queue, wqe_index);
  48. mask = wr_opcode_mask(wqe->wr.opcode, qp);
  49. if (wqe->state == wqe_state_posted)
  50. break;
  51. if (wqe->state == wqe_state_done)
  52. continue;
  53. wqe->iova = (mask & WR_ATOMIC_MASK) ?
  54. wqe->wr.wr.atomic.remote_addr :
  55. (mask & WR_READ_OR_WRITE_MASK) ?
  56. wqe->wr.wr.rdma.remote_addr :
  57. 0;
  58. if (!first || (mask & WR_READ_MASK) == 0) {
  59. wqe->dma.resid = wqe->dma.length;
  60. wqe->dma.cur_sge = 0;
  61. wqe->dma.sge_offset = 0;
  62. }
  63. if (first) {
  64. first = 0;
  65. if (mask & WR_WRITE_OR_SEND_MASK) {
  66. npsn = (qp->comp.psn - wqe->first_psn) &
  67. BTH_PSN_MASK;
  68. retry_first_write_send(qp, wqe, npsn);
  69. }
  70. if (mask & WR_READ_MASK) {
  71. npsn = (wqe->dma.length - wqe->dma.resid) /
  72. qp->mtu;
  73. wqe->iova += npsn * qp->mtu;
  74. }
  75. }
  76. wqe->state = wqe_state_posted;
  77. }
  78. }
  79. void rnr_nak_timer(struct timer_list *t)
  80. {
  81. struct rxe_qp *qp = from_timer(qp, t, rnr_nak_timer);
  82. pr_debug("%s: fired for qp#%d\n", __func__, qp_num(qp));
  83. /* request a send queue retry */
  84. qp->req.need_retry = 1;
  85. qp->req.wait_for_rnr_timer = 0;
  86. rxe_sched_task(&qp->req.task);
  87. }
  88. static struct rxe_send_wqe *req_next_wqe(struct rxe_qp *qp)
  89. {
  90. struct rxe_send_wqe *wqe;
  91. struct rxe_queue *q = qp->sq.queue;
  92. unsigned int index = qp->req.wqe_index;
  93. unsigned int cons;
  94. unsigned int prod;
  95. wqe = queue_head(q, QUEUE_TYPE_FROM_CLIENT);
  96. cons = queue_get_consumer(q, QUEUE_TYPE_FROM_CLIENT);
  97. prod = queue_get_producer(q, QUEUE_TYPE_FROM_CLIENT);
  98. if (unlikely(qp->req.state == QP_STATE_DRAIN)) {
  99. /* check to see if we are drained;
  100. * state_lock used by requester and completer
  101. */
  102. spin_lock_bh(&qp->state_lock);
  103. do {
  104. if (qp->req.state != QP_STATE_DRAIN) {
  105. /* comp just finished */
  106. spin_unlock_bh(&qp->state_lock);
  107. break;
  108. }
  109. if (wqe && ((index != cons) ||
  110. (wqe->state != wqe_state_posted))) {
  111. /* comp not done yet */
  112. spin_unlock_bh(&qp->state_lock);
  113. break;
  114. }
  115. qp->req.state = QP_STATE_DRAINED;
  116. spin_unlock_bh(&qp->state_lock);
  117. if (qp->ibqp.event_handler) {
  118. struct ib_event ev;
  119. ev.device = qp->ibqp.device;
  120. ev.element.qp = &qp->ibqp;
  121. ev.event = IB_EVENT_SQ_DRAINED;
  122. qp->ibqp.event_handler(&ev,
  123. qp->ibqp.qp_context);
  124. }
  125. } while (0);
  126. }
  127. if (index == prod)
  128. return NULL;
  129. wqe = queue_addr_from_index(q, index);
  130. if (unlikely((qp->req.state == QP_STATE_DRAIN ||
  131. qp->req.state == QP_STATE_DRAINED) &&
  132. (wqe->state != wqe_state_processing)))
  133. return NULL;
  134. wqe->mask = wr_opcode_mask(wqe->wr.opcode, qp);
  135. return wqe;
  136. }
  137. /**
  138. * rxe_wqe_is_fenced - check if next wqe is fenced
  139. * @qp: the queue pair
  140. * @wqe: the next wqe
  141. *
  142. * Returns: 1 if wqe needs to wait
  143. * 0 if wqe is ready to go
  144. */
  145. static int rxe_wqe_is_fenced(struct rxe_qp *qp, struct rxe_send_wqe *wqe)
  146. {
  147. /* Local invalidate fence (LIF) see IBA 10.6.5.1
  148. * Requires ALL previous operations on the send queue
  149. * are complete. Make mandatory for the rxe driver.
  150. */
  151. if (wqe->wr.opcode == IB_WR_LOCAL_INV)
  152. return qp->req.wqe_index != queue_get_consumer(qp->sq.queue,
  153. QUEUE_TYPE_FROM_CLIENT);
  154. /* Fence see IBA 10.8.3.3
  155. * Requires that all previous read and atomic operations
  156. * are complete.
  157. */
  158. return (wqe->wr.send_flags & IB_SEND_FENCE) &&
  159. atomic_read(&qp->req.rd_atomic) != qp->attr.max_rd_atomic;
  160. }
  161. static int next_opcode_rc(struct rxe_qp *qp, u32 opcode, int fits)
  162. {
  163. switch (opcode) {
  164. case IB_WR_RDMA_WRITE:
  165. if (qp->req.opcode == IB_OPCODE_RC_RDMA_WRITE_FIRST ||
  166. qp->req.opcode == IB_OPCODE_RC_RDMA_WRITE_MIDDLE)
  167. return fits ?
  168. IB_OPCODE_RC_RDMA_WRITE_LAST :
  169. IB_OPCODE_RC_RDMA_WRITE_MIDDLE;
  170. else
  171. return fits ?
  172. IB_OPCODE_RC_RDMA_WRITE_ONLY :
  173. IB_OPCODE_RC_RDMA_WRITE_FIRST;
  174. case IB_WR_RDMA_WRITE_WITH_IMM:
  175. if (qp->req.opcode == IB_OPCODE_RC_RDMA_WRITE_FIRST ||
  176. qp->req.opcode == IB_OPCODE_RC_RDMA_WRITE_MIDDLE)
  177. return fits ?
  178. IB_OPCODE_RC_RDMA_WRITE_LAST_WITH_IMMEDIATE :
  179. IB_OPCODE_RC_RDMA_WRITE_MIDDLE;
  180. else
  181. return fits ?
  182. IB_OPCODE_RC_RDMA_WRITE_ONLY_WITH_IMMEDIATE :
  183. IB_OPCODE_RC_RDMA_WRITE_FIRST;
  184. case IB_WR_SEND:
  185. if (qp->req.opcode == IB_OPCODE_RC_SEND_FIRST ||
  186. qp->req.opcode == IB_OPCODE_RC_SEND_MIDDLE)
  187. return fits ?
  188. IB_OPCODE_RC_SEND_LAST :
  189. IB_OPCODE_RC_SEND_MIDDLE;
  190. else
  191. return fits ?
  192. IB_OPCODE_RC_SEND_ONLY :
  193. IB_OPCODE_RC_SEND_FIRST;
  194. case IB_WR_SEND_WITH_IMM:
  195. if (qp->req.opcode == IB_OPCODE_RC_SEND_FIRST ||
  196. qp->req.opcode == IB_OPCODE_RC_SEND_MIDDLE)
  197. return fits ?
  198. IB_OPCODE_RC_SEND_LAST_WITH_IMMEDIATE :
  199. IB_OPCODE_RC_SEND_MIDDLE;
  200. else
  201. return fits ?
  202. IB_OPCODE_RC_SEND_ONLY_WITH_IMMEDIATE :
  203. IB_OPCODE_RC_SEND_FIRST;
  204. case IB_WR_RDMA_READ:
  205. return IB_OPCODE_RC_RDMA_READ_REQUEST;
  206. case IB_WR_ATOMIC_CMP_AND_SWP:
  207. return IB_OPCODE_RC_COMPARE_SWAP;
  208. case IB_WR_ATOMIC_FETCH_AND_ADD:
  209. return IB_OPCODE_RC_FETCH_ADD;
  210. case IB_WR_SEND_WITH_INV:
  211. if (qp->req.opcode == IB_OPCODE_RC_SEND_FIRST ||
  212. qp->req.opcode == IB_OPCODE_RC_SEND_MIDDLE)
  213. return fits ? IB_OPCODE_RC_SEND_LAST_WITH_INVALIDATE :
  214. IB_OPCODE_RC_SEND_MIDDLE;
  215. else
  216. return fits ? IB_OPCODE_RC_SEND_ONLY_WITH_INVALIDATE :
  217. IB_OPCODE_RC_SEND_FIRST;
  218. case IB_WR_REG_MR:
  219. case IB_WR_LOCAL_INV:
  220. return opcode;
  221. }
  222. return -EINVAL;
  223. }
  224. static int next_opcode_uc(struct rxe_qp *qp, u32 opcode, int fits)
  225. {
  226. switch (opcode) {
  227. case IB_WR_RDMA_WRITE:
  228. if (qp->req.opcode == IB_OPCODE_UC_RDMA_WRITE_FIRST ||
  229. qp->req.opcode == IB_OPCODE_UC_RDMA_WRITE_MIDDLE)
  230. return fits ?
  231. IB_OPCODE_UC_RDMA_WRITE_LAST :
  232. IB_OPCODE_UC_RDMA_WRITE_MIDDLE;
  233. else
  234. return fits ?
  235. IB_OPCODE_UC_RDMA_WRITE_ONLY :
  236. IB_OPCODE_UC_RDMA_WRITE_FIRST;
  237. case IB_WR_RDMA_WRITE_WITH_IMM:
  238. if (qp->req.opcode == IB_OPCODE_UC_RDMA_WRITE_FIRST ||
  239. qp->req.opcode == IB_OPCODE_UC_RDMA_WRITE_MIDDLE)
  240. return fits ?
  241. IB_OPCODE_UC_RDMA_WRITE_LAST_WITH_IMMEDIATE :
  242. IB_OPCODE_UC_RDMA_WRITE_MIDDLE;
  243. else
  244. return fits ?
  245. IB_OPCODE_UC_RDMA_WRITE_ONLY_WITH_IMMEDIATE :
  246. IB_OPCODE_UC_RDMA_WRITE_FIRST;
  247. case IB_WR_SEND:
  248. if (qp->req.opcode == IB_OPCODE_UC_SEND_FIRST ||
  249. qp->req.opcode == IB_OPCODE_UC_SEND_MIDDLE)
  250. return fits ?
  251. IB_OPCODE_UC_SEND_LAST :
  252. IB_OPCODE_UC_SEND_MIDDLE;
  253. else
  254. return fits ?
  255. IB_OPCODE_UC_SEND_ONLY :
  256. IB_OPCODE_UC_SEND_FIRST;
  257. case IB_WR_SEND_WITH_IMM:
  258. if (qp->req.opcode == IB_OPCODE_UC_SEND_FIRST ||
  259. qp->req.opcode == IB_OPCODE_UC_SEND_MIDDLE)
  260. return fits ?
  261. IB_OPCODE_UC_SEND_LAST_WITH_IMMEDIATE :
  262. IB_OPCODE_UC_SEND_MIDDLE;
  263. else
  264. return fits ?
  265. IB_OPCODE_UC_SEND_ONLY_WITH_IMMEDIATE :
  266. IB_OPCODE_UC_SEND_FIRST;
  267. }
  268. return -EINVAL;
  269. }
  270. static int next_opcode(struct rxe_qp *qp, struct rxe_send_wqe *wqe,
  271. u32 opcode)
  272. {
  273. int fits = (wqe->dma.resid <= qp->mtu);
  274. switch (qp_type(qp)) {
  275. case IB_QPT_RC:
  276. return next_opcode_rc(qp, opcode, fits);
  277. case IB_QPT_UC:
  278. return next_opcode_uc(qp, opcode, fits);
  279. case IB_QPT_UD:
  280. case IB_QPT_GSI:
  281. switch (opcode) {
  282. case IB_WR_SEND:
  283. return IB_OPCODE_UD_SEND_ONLY;
  284. case IB_WR_SEND_WITH_IMM:
  285. return IB_OPCODE_UD_SEND_ONLY_WITH_IMMEDIATE;
  286. }
  287. break;
  288. default:
  289. break;
  290. }
  291. return -EINVAL;
  292. }
  293. static inline int check_init_depth(struct rxe_qp *qp, struct rxe_send_wqe *wqe)
  294. {
  295. int depth;
  296. if (wqe->has_rd_atomic)
  297. return 0;
  298. qp->req.need_rd_atomic = 1;
  299. depth = atomic_dec_return(&qp->req.rd_atomic);
  300. if (depth >= 0) {
  301. qp->req.need_rd_atomic = 0;
  302. wqe->has_rd_atomic = 1;
  303. return 0;
  304. }
  305. atomic_inc(&qp->req.rd_atomic);
  306. return -EAGAIN;
  307. }
  308. static inline int get_mtu(struct rxe_qp *qp)
  309. {
  310. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  311. if ((qp_type(qp) == IB_QPT_RC) || (qp_type(qp) == IB_QPT_UC))
  312. return qp->mtu;
  313. return rxe->port.mtu_cap;
  314. }
  315. static struct sk_buff *init_req_packet(struct rxe_qp *qp,
  316. struct rxe_av *av,
  317. struct rxe_send_wqe *wqe,
  318. int opcode, u32 payload,
  319. struct rxe_pkt_info *pkt)
  320. {
  321. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  322. struct sk_buff *skb;
  323. struct rxe_send_wr *ibwr = &wqe->wr;
  324. int pad = (-payload) & 0x3;
  325. int paylen;
  326. int solicited;
  327. u32 qp_num;
  328. int ack_req;
  329. /* length from start of bth to end of icrc */
  330. paylen = rxe_opcode[opcode].length + payload + pad + RXE_ICRC_SIZE;
  331. pkt->paylen = paylen;
  332. /* init skb */
  333. skb = rxe_init_packet(rxe, av, paylen, pkt);
  334. if (unlikely(!skb))
  335. return NULL;
  336. /* init bth */
  337. solicited = (ibwr->send_flags & IB_SEND_SOLICITED) &&
  338. (pkt->mask & RXE_END_MASK) &&
  339. ((pkt->mask & (RXE_SEND_MASK)) ||
  340. (pkt->mask & (RXE_WRITE_MASK | RXE_IMMDT_MASK)) ==
  341. (RXE_WRITE_MASK | RXE_IMMDT_MASK));
  342. qp_num = (pkt->mask & RXE_DETH_MASK) ? ibwr->wr.ud.remote_qpn :
  343. qp->attr.dest_qp_num;
  344. ack_req = ((pkt->mask & RXE_END_MASK) ||
  345. (qp->req.noack_pkts++ > RXE_MAX_PKT_PER_ACK));
  346. if (ack_req)
  347. qp->req.noack_pkts = 0;
  348. bth_init(pkt, pkt->opcode, solicited, 0, pad, IB_DEFAULT_PKEY_FULL, qp_num,
  349. ack_req, pkt->psn);
  350. /* init optional headers */
  351. if (pkt->mask & RXE_RETH_MASK) {
  352. reth_set_rkey(pkt, ibwr->wr.rdma.rkey);
  353. reth_set_va(pkt, wqe->iova);
  354. reth_set_len(pkt, wqe->dma.resid);
  355. }
  356. if (pkt->mask & RXE_IMMDT_MASK)
  357. immdt_set_imm(pkt, ibwr->ex.imm_data);
  358. if (pkt->mask & RXE_IETH_MASK)
  359. ieth_set_rkey(pkt, ibwr->ex.invalidate_rkey);
  360. if (pkt->mask & RXE_ATMETH_MASK) {
  361. atmeth_set_va(pkt, wqe->iova);
  362. if (opcode == IB_OPCODE_RC_COMPARE_SWAP) {
  363. atmeth_set_swap_add(pkt, ibwr->wr.atomic.swap);
  364. atmeth_set_comp(pkt, ibwr->wr.atomic.compare_add);
  365. } else {
  366. atmeth_set_swap_add(pkt, ibwr->wr.atomic.compare_add);
  367. }
  368. atmeth_set_rkey(pkt, ibwr->wr.atomic.rkey);
  369. }
  370. if (pkt->mask & RXE_DETH_MASK) {
  371. if (qp->ibqp.qp_num == 1)
  372. deth_set_qkey(pkt, GSI_QKEY);
  373. else
  374. deth_set_qkey(pkt, ibwr->wr.ud.remote_qkey);
  375. deth_set_sqp(pkt, qp->ibqp.qp_num);
  376. }
  377. return skb;
  378. }
  379. static int finish_packet(struct rxe_qp *qp, struct rxe_av *av,
  380. struct rxe_send_wqe *wqe, struct rxe_pkt_info *pkt,
  381. struct sk_buff *skb, u32 payload)
  382. {
  383. int err;
  384. err = rxe_prepare(av, pkt, skb);
  385. if (err)
  386. return err;
  387. if (pkt->mask & RXE_WRITE_OR_SEND_MASK) {
  388. if (wqe->wr.send_flags & IB_SEND_INLINE) {
  389. u8 *tmp = &wqe->dma.inline_data[wqe->dma.sge_offset];
  390. memcpy(payload_addr(pkt), tmp, payload);
  391. wqe->dma.resid -= payload;
  392. wqe->dma.sge_offset += payload;
  393. } else {
  394. err = copy_data(qp->pd, 0, &wqe->dma,
  395. payload_addr(pkt), payload,
  396. RXE_FROM_MR_OBJ);
  397. if (err)
  398. return err;
  399. }
  400. if (bth_pad(pkt)) {
  401. u8 *pad = payload_addr(pkt) + payload;
  402. memset(pad, 0, bth_pad(pkt));
  403. }
  404. }
  405. return 0;
  406. }
  407. static void update_wqe_state(struct rxe_qp *qp,
  408. struct rxe_send_wqe *wqe,
  409. struct rxe_pkt_info *pkt)
  410. {
  411. if (pkt->mask & RXE_END_MASK) {
  412. if (qp_type(qp) == IB_QPT_RC)
  413. wqe->state = wqe_state_pending;
  414. } else {
  415. wqe->state = wqe_state_processing;
  416. }
  417. }
  418. static void update_wqe_psn(struct rxe_qp *qp,
  419. struct rxe_send_wqe *wqe,
  420. struct rxe_pkt_info *pkt,
  421. u32 payload)
  422. {
  423. /* number of packets left to send including current one */
  424. int num_pkt = (wqe->dma.resid + payload + qp->mtu - 1) / qp->mtu;
  425. /* handle zero length packet case */
  426. if (num_pkt == 0)
  427. num_pkt = 1;
  428. if (pkt->mask & RXE_START_MASK) {
  429. wqe->first_psn = qp->req.psn;
  430. wqe->last_psn = (qp->req.psn + num_pkt - 1) & BTH_PSN_MASK;
  431. }
  432. if (pkt->mask & RXE_READ_MASK)
  433. qp->req.psn = (wqe->first_psn + num_pkt) & BTH_PSN_MASK;
  434. else
  435. qp->req.psn = (qp->req.psn + 1) & BTH_PSN_MASK;
  436. }
  437. static void save_state(struct rxe_send_wqe *wqe,
  438. struct rxe_qp *qp,
  439. struct rxe_send_wqe *rollback_wqe,
  440. u32 *rollback_psn)
  441. {
  442. rollback_wqe->state = wqe->state;
  443. rollback_wqe->first_psn = wqe->first_psn;
  444. rollback_wqe->last_psn = wqe->last_psn;
  445. rollback_wqe->dma = wqe->dma;
  446. *rollback_psn = qp->req.psn;
  447. }
  448. static void rollback_state(struct rxe_send_wqe *wqe,
  449. struct rxe_qp *qp,
  450. struct rxe_send_wqe *rollback_wqe,
  451. u32 rollback_psn)
  452. {
  453. wqe->state = rollback_wqe->state;
  454. wqe->first_psn = rollback_wqe->first_psn;
  455. wqe->last_psn = rollback_wqe->last_psn;
  456. wqe->dma = rollback_wqe->dma;
  457. qp->req.psn = rollback_psn;
  458. }
  459. static void update_state(struct rxe_qp *qp, struct rxe_pkt_info *pkt)
  460. {
  461. qp->req.opcode = pkt->opcode;
  462. if (pkt->mask & RXE_END_MASK)
  463. qp->req.wqe_index = queue_next_index(qp->sq.queue,
  464. qp->req.wqe_index);
  465. qp->need_req_skb = 0;
  466. if (qp->qp_timeout_jiffies && !timer_pending(&qp->retrans_timer))
  467. mod_timer(&qp->retrans_timer,
  468. jiffies + qp->qp_timeout_jiffies);
  469. }
  470. static int rxe_do_local_ops(struct rxe_qp *qp, struct rxe_send_wqe *wqe)
  471. {
  472. u8 opcode = wqe->wr.opcode;
  473. u32 rkey;
  474. int ret;
  475. switch (opcode) {
  476. case IB_WR_LOCAL_INV:
  477. rkey = wqe->wr.ex.invalidate_rkey;
  478. if (rkey_is_mw(rkey))
  479. ret = rxe_invalidate_mw(qp, rkey);
  480. else
  481. ret = rxe_invalidate_mr(qp, rkey);
  482. if (unlikely(ret)) {
  483. wqe->status = IB_WC_LOC_QP_OP_ERR;
  484. return ret;
  485. }
  486. break;
  487. case IB_WR_REG_MR:
  488. ret = rxe_reg_fast_mr(qp, wqe);
  489. if (unlikely(ret)) {
  490. wqe->status = IB_WC_LOC_QP_OP_ERR;
  491. return ret;
  492. }
  493. break;
  494. case IB_WR_BIND_MW:
  495. ret = rxe_bind_mw(qp, wqe);
  496. if (unlikely(ret)) {
  497. wqe->status = IB_WC_MW_BIND_ERR;
  498. return ret;
  499. }
  500. break;
  501. default:
  502. pr_err("Unexpected send wqe opcode %d\n", opcode);
  503. wqe->status = IB_WC_LOC_QP_OP_ERR;
  504. return -EINVAL;
  505. }
  506. wqe->state = wqe_state_done;
  507. wqe->status = IB_WC_SUCCESS;
  508. qp->req.wqe_index = queue_next_index(qp->sq.queue, qp->req.wqe_index);
  509. /* There is no ack coming for local work requests
  510. * which can lead to a deadlock. So go ahead and complete
  511. * it now.
  512. */
  513. rxe_sched_task(&qp->comp.task);
  514. return 0;
  515. }
  516. int rxe_requester(void *arg)
  517. {
  518. struct rxe_qp *qp = (struct rxe_qp *)arg;
  519. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  520. struct rxe_pkt_info pkt;
  521. struct sk_buff *skb;
  522. struct rxe_send_wqe *wqe;
  523. enum rxe_hdr_mask mask;
  524. u32 payload;
  525. int mtu;
  526. int opcode;
  527. int err;
  528. int ret;
  529. struct rxe_send_wqe rollback_wqe;
  530. u32 rollback_psn;
  531. struct rxe_queue *q = qp->sq.queue;
  532. struct rxe_ah *ah;
  533. struct rxe_av *av;
  534. if (!rxe_get(qp))
  535. return -EAGAIN;
  536. if (unlikely(!qp->valid))
  537. goto exit;
  538. if (unlikely(qp->req.state == QP_STATE_ERROR)) {
  539. wqe = req_next_wqe(qp);
  540. if (wqe)
  541. /*
  542. * Generate an error completion for error qp state
  543. */
  544. goto err;
  545. else
  546. goto exit;
  547. }
  548. if (unlikely(qp->req.state == QP_STATE_RESET)) {
  549. qp->req.wqe_index = queue_get_consumer(q,
  550. QUEUE_TYPE_FROM_CLIENT);
  551. qp->req.opcode = -1;
  552. qp->req.need_rd_atomic = 0;
  553. qp->req.wait_psn = 0;
  554. qp->req.need_retry = 0;
  555. qp->req.wait_for_rnr_timer = 0;
  556. goto exit;
  557. }
  558. /* we come here if the retransmit timer has fired
  559. * or if the rnr timer has fired. If the retransmit
  560. * timer fires while we are processing an RNR NAK wait
  561. * until the rnr timer has fired before starting the
  562. * retry flow
  563. */
  564. if (unlikely(qp->req.need_retry && !qp->req.wait_for_rnr_timer)) {
  565. req_retry(qp);
  566. qp->req.need_retry = 0;
  567. }
  568. wqe = req_next_wqe(qp);
  569. if (unlikely(!wqe))
  570. goto exit;
  571. if (rxe_wqe_is_fenced(qp, wqe)) {
  572. qp->req.wait_fence = 1;
  573. goto exit;
  574. }
  575. if (wqe->mask & WR_LOCAL_OP_MASK) {
  576. err = rxe_do_local_ops(qp, wqe);
  577. if (unlikely(err))
  578. goto err;
  579. else
  580. goto done;
  581. }
  582. if (unlikely(qp_type(qp) == IB_QPT_RC &&
  583. psn_compare(qp->req.psn, (qp->comp.psn +
  584. RXE_MAX_UNACKED_PSNS)) > 0)) {
  585. qp->req.wait_psn = 1;
  586. goto exit;
  587. }
  588. /* Limit the number of inflight SKBs per QP */
  589. if (unlikely(atomic_read(&qp->skb_out) >
  590. RXE_INFLIGHT_SKBS_PER_QP_HIGH)) {
  591. qp->need_req_skb = 1;
  592. goto exit;
  593. }
  594. opcode = next_opcode(qp, wqe, wqe->wr.opcode);
  595. if (unlikely(opcode < 0)) {
  596. wqe->status = IB_WC_LOC_QP_OP_ERR;
  597. goto err;
  598. }
  599. mask = rxe_opcode[opcode].mask;
  600. if (unlikely(mask & RXE_READ_OR_ATOMIC_MASK)) {
  601. if (check_init_depth(qp, wqe))
  602. goto exit;
  603. }
  604. mtu = get_mtu(qp);
  605. payload = (mask & RXE_WRITE_OR_SEND_MASK) ? wqe->dma.resid : 0;
  606. if (payload > mtu) {
  607. if (qp_type(qp) == IB_QPT_UD) {
  608. /* C10-93.1.1: If the total sum of all the buffer lengths specified for a
  609. * UD message exceeds the MTU of the port as returned by QueryHCA, the CI
  610. * shall not emit any packets for this message. Further, the CI shall not
  611. * generate an error due to this condition.
  612. */
  613. /* fake a successful UD send */
  614. wqe->first_psn = qp->req.psn;
  615. wqe->last_psn = qp->req.psn;
  616. qp->req.psn = (qp->req.psn + 1) & BTH_PSN_MASK;
  617. qp->req.opcode = IB_OPCODE_UD_SEND_ONLY;
  618. qp->req.wqe_index = queue_next_index(qp->sq.queue,
  619. qp->req.wqe_index);
  620. wqe->state = wqe_state_done;
  621. wqe->status = IB_WC_SUCCESS;
  622. rxe_run_task(&qp->comp.task);
  623. goto done;
  624. }
  625. payload = mtu;
  626. }
  627. pkt.rxe = rxe;
  628. pkt.opcode = opcode;
  629. pkt.qp = qp;
  630. pkt.psn = qp->req.psn;
  631. pkt.mask = rxe_opcode[opcode].mask;
  632. pkt.wqe = wqe;
  633. /* save wqe state before we build and send packet */
  634. save_state(wqe, qp, &rollback_wqe, &rollback_psn);
  635. av = rxe_get_av(&pkt, &ah);
  636. if (unlikely(!av)) {
  637. pr_err("qp#%d Failed no address vector\n", qp_num(qp));
  638. wqe->status = IB_WC_LOC_QP_OP_ERR;
  639. goto err;
  640. }
  641. skb = init_req_packet(qp, av, wqe, opcode, payload, &pkt);
  642. if (unlikely(!skb)) {
  643. pr_err("qp#%d Failed allocating skb\n", qp_num(qp));
  644. wqe->status = IB_WC_LOC_QP_OP_ERR;
  645. if (ah)
  646. rxe_put(ah);
  647. goto err;
  648. }
  649. err = finish_packet(qp, av, wqe, &pkt, skb, payload);
  650. if (unlikely(err)) {
  651. pr_debug("qp#%d Error during finish packet\n", qp_num(qp));
  652. if (err == -EFAULT)
  653. wqe->status = IB_WC_LOC_PROT_ERR;
  654. else
  655. wqe->status = IB_WC_LOC_QP_OP_ERR;
  656. kfree_skb(skb);
  657. if (ah)
  658. rxe_put(ah);
  659. goto err;
  660. }
  661. if (ah)
  662. rxe_put(ah);
  663. /* update wqe state as though we had sent it */
  664. update_wqe_state(qp, wqe, &pkt);
  665. update_wqe_psn(qp, wqe, &pkt, payload);
  666. err = rxe_xmit_packet(qp, &pkt, skb);
  667. if (err) {
  668. if (err != -EAGAIN) {
  669. wqe->status = IB_WC_LOC_QP_OP_ERR;
  670. goto err;
  671. }
  672. /* the packet was dropped so reset wqe to the state
  673. * before we sent it so we can try to resend
  674. */
  675. rollback_state(wqe, qp, &rollback_wqe, rollback_psn);
  676. /* force a delay until the dropped packet is freed and
  677. * the send queue is drained below the low water mark
  678. */
  679. qp->need_req_skb = 1;
  680. rxe_sched_task(&qp->req.task);
  681. goto exit;
  682. }
  683. update_state(qp, &pkt);
  684. /* A non-zero return value will cause rxe_do_task to
  685. * exit its loop and end the tasklet. A zero return
  686. * will continue looping and return to rxe_requester
  687. */
  688. done:
  689. ret = 0;
  690. goto out;
  691. err:
  692. /* update wqe_index for each wqe completion */
  693. qp->req.wqe_index = queue_next_index(qp->sq.queue, qp->req.wqe_index);
  694. wqe->state = wqe_state_error;
  695. qp->req.state = QP_STATE_ERROR;
  696. rxe_run_task(&qp->comp.task);
  697. exit:
  698. ret = -EAGAIN;
  699. out:
  700. rxe_put(qp);
  701. return ret;
  702. }