rxe_resp.c 33 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414
  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 "rxe.h"
  35. #include "rxe_loc.h"
  36. #include "rxe_queue.h"
  37. enum resp_states {
  38. RESPST_NONE,
  39. RESPST_GET_REQ,
  40. RESPST_CHK_PSN,
  41. RESPST_CHK_OP_SEQ,
  42. RESPST_CHK_OP_VALID,
  43. RESPST_CHK_RESOURCE,
  44. RESPST_CHK_LENGTH,
  45. RESPST_CHK_RKEY,
  46. RESPST_EXECUTE,
  47. RESPST_READ_REPLY,
  48. RESPST_COMPLETE,
  49. RESPST_ACKNOWLEDGE,
  50. RESPST_CLEANUP,
  51. RESPST_DUPLICATE_REQUEST,
  52. RESPST_ERR_MALFORMED_WQE,
  53. RESPST_ERR_UNSUPPORTED_OPCODE,
  54. RESPST_ERR_MISALIGNED_ATOMIC,
  55. RESPST_ERR_PSN_OUT_OF_SEQ,
  56. RESPST_ERR_MISSING_OPCODE_FIRST,
  57. RESPST_ERR_MISSING_OPCODE_LAST_C,
  58. RESPST_ERR_MISSING_OPCODE_LAST_D1E,
  59. RESPST_ERR_TOO_MANY_RDMA_ATM_REQ,
  60. RESPST_ERR_RNR,
  61. RESPST_ERR_RKEY_VIOLATION,
  62. RESPST_ERR_LENGTH,
  63. RESPST_ERR_CQ_OVERFLOW,
  64. RESPST_ERROR,
  65. RESPST_RESET,
  66. RESPST_DONE,
  67. RESPST_EXIT,
  68. };
  69. static char *resp_state_name[] = {
  70. [RESPST_NONE] = "NONE",
  71. [RESPST_GET_REQ] = "GET_REQ",
  72. [RESPST_CHK_PSN] = "CHK_PSN",
  73. [RESPST_CHK_OP_SEQ] = "CHK_OP_SEQ",
  74. [RESPST_CHK_OP_VALID] = "CHK_OP_VALID",
  75. [RESPST_CHK_RESOURCE] = "CHK_RESOURCE",
  76. [RESPST_CHK_LENGTH] = "CHK_LENGTH",
  77. [RESPST_CHK_RKEY] = "CHK_RKEY",
  78. [RESPST_EXECUTE] = "EXECUTE",
  79. [RESPST_READ_REPLY] = "READ_REPLY",
  80. [RESPST_COMPLETE] = "COMPLETE",
  81. [RESPST_ACKNOWLEDGE] = "ACKNOWLEDGE",
  82. [RESPST_CLEANUP] = "CLEANUP",
  83. [RESPST_DUPLICATE_REQUEST] = "DUPLICATE_REQUEST",
  84. [RESPST_ERR_MALFORMED_WQE] = "ERR_MALFORMED_WQE",
  85. [RESPST_ERR_UNSUPPORTED_OPCODE] = "ERR_UNSUPPORTED_OPCODE",
  86. [RESPST_ERR_MISALIGNED_ATOMIC] = "ERR_MISALIGNED_ATOMIC",
  87. [RESPST_ERR_PSN_OUT_OF_SEQ] = "ERR_PSN_OUT_OF_SEQ",
  88. [RESPST_ERR_MISSING_OPCODE_FIRST] = "ERR_MISSING_OPCODE_FIRST",
  89. [RESPST_ERR_MISSING_OPCODE_LAST_C] = "ERR_MISSING_OPCODE_LAST_C",
  90. [RESPST_ERR_MISSING_OPCODE_LAST_D1E] = "ERR_MISSING_OPCODE_LAST_D1E",
  91. [RESPST_ERR_TOO_MANY_RDMA_ATM_REQ] = "ERR_TOO_MANY_RDMA_ATM_REQ",
  92. [RESPST_ERR_RNR] = "ERR_RNR",
  93. [RESPST_ERR_RKEY_VIOLATION] = "ERR_RKEY_VIOLATION",
  94. [RESPST_ERR_LENGTH] = "ERR_LENGTH",
  95. [RESPST_ERR_CQ_OVERFLOW] = "ERR_CQ_OVERFLOW",
  96. [RESPST_ERROR] = "ERROR",
  97. [RESPST_RESET] = "RESET",
  98. [RESPST_DONE] = "DONE",
  99. [RESPST_EXIT] = "EXIT",
  100. };
  101. /* rxe_recv calls here to add a request packet to the input queue */
  102. void rxe_resp_queue_pkt(struct rxe_dev *rxe, struct rxe_qp *qp,
  103. struct sk_buff *skb)
  104. {
  105. int must_sched;
  106. struct rxe_pkt_info *pkt = SKB_TO_PKT(skb);
  107. skb_queue_tail(&qp->req_pkts, skb);
  108. must_sched = (pkt->opcode == IB_OPCODE_RC_RDMA_READ_REQUEST) ||
  109. (skb_queue_len(&qp->req_pkts) > 1);
  110. rxe_run_task(&qp->resp.task, must_sched);
  111. }
  112. static inline enum resp_states get_req(struct rxe_qp *qp,
  113. struct rxe_pkt_info **pkt_p)
  114. {
  115. struct sk_buff *skb;
  116. if (qp->resp.state == QP_STATE_ERROR) {
  117. skb = skb_dequeue(&qp->req_pkts);
  118. if (skb) {
  119. /* drain request packet queue */
  120. rxe_drop_ref(qp);
  121. kfree_skb(skb);
  122. return RESPST_GET_REQ;
  123. }
  124. /* go drain recv wr queue */
  125. return RESPST_CHK_RESOURCE;
  126. }
  127. skb = skb_peek(&qp->req_pkts);
  128. if (!skb)
  129. return RESPST_EXIT;
  130. *pkt_p = SKB_TO_PKT(skb);
  131. return (qp->resp.res) ? RESPST_READ_REPLY : RESPST_CHK_PSN;
  132. }
  133. static enum resp_states check_psn(struct rxe_qp *qp,
  134. struct rxe_pkt_info *pkt)
  135. {
  136. int diff = psn_compare(pkt->psn, qp->resp.psn);
  137. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  138. switch (qp_type(qp)) {
  139. case IB_QPT_RC:
  140. if (diff > 0) {
  141. if (qp->resp.sent_psn_nak)
  142. return RESPST_CLEANUP;
  143. qp->resp.sent_psn_nak = 1;
  144. rxe_counter_inc(rxe, RXE_CNT_OUT_OF_SEQ_REQ);
  145. return RESPST_ERR_PSN_OUT_OF_SEQ;
  146. } else if (diff < 0) {
  147. rxe_counter_inc(rxe, RXE_CNT_DUP_REQ);
  148. return RESPST_DUPLICATE_REQUEST;
  149. }
  150. if (qp->resp.sent_psn_nak)
  151. qp->resp.sent_psn_nak = 0;
  152. break;
  153. case IB_QPT_UC:
  154. if (qp->resp.drop_msg || diff != 0) {
  155. if (pkt->mask & RXE_START_MASK) {
  156. qp->resp.drop_msg = 0;
  157. return RESPST_CHK_OP_SEQ;
  158. }
  159. qp->resp.drop_msg = 1;
  160. return RESPST_CLEANUP;
  161. }
  162. break;
  163. default:
  164. break;
  165. }
  166. return RESPST_CHK_OP_SEQ;
  167. }
  168. static enum resp_states check_op_seq(struct rxe_qp *qp,
  169. struct rxe_pkt_info *pkt)
  170. {
  171. switch (qp_type(qp)) {
  172. case IB_QPT_RC:
  173. switch (qp->resp.opcode) {
  174. case IB_OPCODE_RC_SEND_FIRST:
  175. case IB_OPCODE_RC_SEND_MIDDLE:
  176. switch (pkt->opcode) {
  177. case IB_OPCODE_RC_SEND_MIDDLE:
  178. case IB_OPCODE_RC_SEND_LAST:
  179. case IB_OPCODE_RC_SEND_LAST_WITH_IMMEDIATE:
  180. case IB_OPCODE_RC_SEND_LAST_WITH_INVALIDATE:
  181. return RESPST_CHK_OP_VALID;
  182. default:
  183. return RESPST_ERR_MISSING_OPCODE_LAST_C;
  184. }
  185. case IB_OPCODE_RC_RDMA_WRITE_FIRST:
  186. case IB_OPCODE_RC_RDMA_WRITE_MIDDLE:
  187. switch (pkt->opcode) {
  188. case IB_OPCODE_RC_RDMA_WRITE_MIDDLE:
  189. case IB_OPCODE_RC_RDMA_WRITE_LAST:
  190. case IB_OPCODE_RC_RDMA_WRITE_LAST_WITH_IMMEDIATE:
  191. return RESPST_CHK_OP_VALID;
  192. default:
  193. return RESPST_ERR_MISSING_OPCODE_LAST_C;
  194. }
  195. default:
  196. switch (pkt->opcode) {
  197. case IB_OPCODE_RC_SEND_MIDDLE:
  198. case IB_OPCODE_RC_SEND_LAST:
  199. case IB_OPCODE_RC_SEND_LAST_WITH_IMMEDIATE:
  200. case IB_OPCODE_RC_SEND_LAST_WITH_INVALIDATE:
  201. case IB_OPCODE_RC_RDMA_WRITE_MIDDLE:
  202. case IB_OPCODE_RC_RDMA_WRITE_LAST:
  203. case IB_OPCODE_RC_RDMA_WRITE_LAST_WITH_IMMEDIATE:
  204. return RESPST_ERR_MISSING_OPCODE_FIRST;
  205. default:
  206. return RESPST_CHK_OP_VALID;
  207. }
  208. }
  209. break;
  210. case IB_QPT_UC:
  211. switch (qp->resp.opcode) {
  212. case IB_OPCODE_UC_SEND_FIRST:
  213. case IB_OPCODE_UC_SEND_MIDDLE:
  214. switch (pkt->opcode) {
  215. case IB_OPCODE_UC_SEND_MIDDLE:
  216. case IB_OPCODE_UC_SEND_LAST:
  217. case IB_OPCODE_UC_SEND_LAST_WITH_IMMEDIATE:
  218. return RESPST_CHK_OP_VALID;
  219. default:
  220. return RESPST_ERR_MISSING_OPCODE_LAST_D1E;
  221. }
  222. case IB_OPCODE_UC_RDMA_WRITE_FIRST:
  223. case IB_OPCODE_UC_RDMA_WRITE_MIDDLE:
  224. switch (pkt->opcode) {
  225. case IB_OPCODE_UC_RDMA_WRITE_MIDDLE:
  226. case IB_OPCODE_UC_RDMA_WRITE_LAST:
  227. case IB_OPCODE_UC_RDMA_WRITE_LAST_WITH_IMMEDIATE:
  228. return RESPST_CHK_OP_VALID;
  229. default:
  230. return RESPST_ERR_MISSING_OPCODE_LAST_D1E;
  231. }
  232. default:
  233. switch (pkt->opcode) {
  234. case IB_OPCODE_UC_SEND_MIDDLE:
  235. case IB_OPCODE_UC_SEND_LAST:
  236. case IB_OPCODE_UC_SEND_LAST_WITH_IMMEDIATE:
  237. case IB_OPCODE_UC_RDMA_WRITE_MIDDLE:
  238. case IB_OPCODE_UC_RDMA_WRITE_LAST:
  239. case IB_OPCODE_UC_RDMA_WRITE_LAST_WITH_IMMEDIATE:
  240. qp->resp.drop_msg = 1;
  241. return RESPST_CLEANUP;
  242. default:
  243. return RESPST_CHK_OP_VALID;
  244. }
  245. }
  246. break;
  247. default:
  248. return RESPST_CHK_OP_VALID;
  249. }
  250. }
  251. static enum resp_states check_op_valid(struct rxe_qp *qp,
  252. struct rxe_pkt_info *pkt)
  253. {
  254. switch (qp_type(qp)) {
  255. case IB_QPT_RC:
  256. if (((pkt->mask & RXE_READ_MASK) &&
  257. !(qp->attr.qp_access_flags & IB_ACCESS_REMOTE_READ)) ||
  258. ((pkt->mask & RXE_WRITE_MASK) &&
  259. !(qp->attr.qp_access_flags & IB_ACCESS_REMOTE_WRITE)) ||
  260. ((pkt->mask & RXE_ATOMIC_MASK) &&
  261. !(qp->attr.qp_access_flags & IB_ACCESS_REMOTE_ATOMIC))) {
  262. return RESPST_ERR_UNSUPPORTED_OPCODE;
  263. }
  264. break;
  265. case IB_QPT_UC:
  266. if ((pkt->mask & RXE_WRITE_MASK) &&
  267. !(qp->attr.qp_access_flags & IB_ACCESS_REMOTE_WRITE)) {
  268. qp->resp.drop_msg = 1;
  269. return RESPST_CLEANUP;
  270. }
  271. break;
  272. case IB_QPT_UD:
  273. case IB_QPT_SMI:
  274. case IB_QPT_GSI:
  275. break;
  276. default:
  277. WARN_ON_ONCE(1);
  278. break;
  279. }
  280. return RESPST_CHK_RESOURCE;
  281. }
  282. static enum resp_states get_srq_wqe(struct rxe_qp *qp)
  283. {
  284. struct rxe_srq *srq = qp->srq;
  285. struct rxe_queue *q = srq->rq.queue;
  286. struct rxe_recv_wqe *wqe;
  287. struct ib_event ev;
  288. if (srq->error)
  289. return RESPST_ERR_RNR;
  290. spin_lock_bh(&srq->rq.consumer_lock);
  291. wqe = queue_head(q);
  292. if (!wqe) {
  293. spin_unlock_bh(&srq->rq.consumer_lock);
  294. return RESPST_ERR_RNR;
  295. }
  296. /* note kernel and user space recv wqes have same size */
  297. memcpy(&qp->resp.srq_wqe, wqe, sizeof(qp->resp.srq_wqe));
  298. qp->resp.wqe = &qp->resp.srq_wqe.wqe;
  299. advance_consumer(q);
  300. if (srq->limit && srq->ibsrq.event_handler &&
  301. (queue_count(q) < srq->limit)) {
  302. srq->limit = 0;
  303. goto event;
  304. }
  305. spin_unlock_bh(&srq->rq.consumer_lock);
  306. return RESPST_CHK_LENGTH;
  307. event:
  308. spin_unlock_bh(&srq->rq.consumer_lock);
  309. ev.device = qp->ibqp.device;
  310. ev.element.srq = qp->ibqp.srq;
  311. ev.event = IB_EVENT_SRQ_LIMIT_REACHED;
  312. srq->ibsrq.event_handler(&ev, srq->ibsrq.srq_context);
  313. return RESPST_CHK_LENGTH;
  314. }
  315. static enum resp_states check_resource(struct rxe_qp *qp,
  316. struct rxe_pkt_info *pkt)
  317. {
  318. struct rxe_srq *srq = qp->srq;
  319. if (qp->resp.state == QP_STATE_ERROR) {
  320. if (qp->resp.wqe) {
  321. qp->resp.status = IB_WC_WR_FLUSH_ERR;
  322. return RESPST_COMPLETE;
  323. } else if (!srq) {
  324. qp->resp.wqe = queue_head(qp->rq.queue);
  325. if (qp->resp.wqe) {
  326. qp->resp.status = IB_WC_WR_FLUSH_ERR;
  327. return RESPST_COMPLETE;
  328. } else {
  329. return RESPST_EXIT;
  330. }
  331. } else {
  332. return RESPST_EXIT;
  333. }
  334. }
  335. if (pkt->mask & RXE_READ_OR_ATOMIC) {
  336. /* it is the requesters job to not send
  337. * too many read/atomic ops, we just
  338. * recycle the responder resource queue
  339. */
  340. if (likely(qp->attr.max_dest_rd_atomic > 0))
  341. return RESPST_CHK_LENGTH;
  342. else
  343. return RESPST_ERR_TOO_MANY_RDMA_ATM_REQ;
  344. }
  345. if (pkt->mask & RXE_RWR_MASK) {
  346. if (srq)
  347. return get_srq_wqe(qp);
  348. qp->resp.wqe = queue_head(qp->rq.queue);
  349. return (qp->resp.wqe) ? RESPST_CHK_LENGTH : RESPST_ERR_RNR;
  350. }
  351. return RESPST_CHK_LENGTH;
  352. }
  353. static enum resp_states check_length(struct rxe_qp *qp,
  354. struct rxe_pkt_info *pkt)
  355. {
  356. switch (qp_type(qp)) {
  357. case IB_QPT_RC:
  358. return RESPST_CHK_RKEY;
  359. case IB_QPT_UC:
  360. return RESPST_CHK_RKEY;
  361. default:
  362. return RESPST_CHK_RKEY;
  363. }
  364. }
  365. static enum resp_states check_rkey(struct rxe_qp *qp,
  366. struct rxe_pkt_info *pkt)
  367. {
  368. struct rxe_mem *mem = NULL;
  369. u64 va;
  370. u32 rkey;
  371. u32 resid;
  372. u32 pktlen;
  373. int mtu = qp->mtu;
  374. enum resp_states state;
  375. int access;
  376. if (pkt->mask & (RXE_READ_MASK | RXE_WRITE_MASK)) {
  377. if (pkt->mask & RXE_RETH_MASK) {
  378. qp->resp.va = reth_va(pkt);
  379. qp->resp.rkey = reth_rkey(pkt);
  380. qp->resp.resid = reth_len(pkt);
  381. }
  382. access = (pkt->mask & RXE_READ_MASK) ? IB_ACCESS_REMOTE_READ
  383. : IB_ACCESS_REMOTE_WRITE;
  384. } else if (pkt->mask & RXE_ATOMIC_MASK) {
  385. qp->resp.va = atmeth_va(pkt);
  386. qp->resp.rkey = atmeth_rkey(pkt);
  387. qp->resp.resid = sizeof(u64);
  388. access = IB_ACCESS_REMOTE_ATOMIC;
  389. } else {
  390. return RESPST_EXECUTE;
  391. }
  392. /* A zero-byte op is not required to set an addr or rkey. */
  393. if ((pkt->mask & (RXE_READ_MASK | RXE_WRITE_OR_SEND)) &&
  394. (pkt->mask & RXE_RETH_MASK) &&
  395. reth_len(pkt) == 0) {
  396. return RESPST_EXECUTE;
  397. }
  398. va = qp->resp.va;
  399. rkey = qp->resp.rkey;
  400. resid = qp->resp.resid;
  401. pktlen = payload_size(pkt);
  402. mem = lookup_mem(qp->pd, access, rkey, lookup_remote);
  403. if (!mem) {
  404. state = RESPST_ERR_RKEY_VIOLATION;
  405. goto err;
  406. }
  407. if (unlikely(mem->state == RXE_MEM_STATE_FREE)) {
  408. state = RESPST_ERR_RKEY_VIOLATION;
  409. goto err;
  410. }
  411. if (mem_check_range(mem, va, resid)) {
  412. state = RESPST_ERR_RKEY_VIOLATION;
  413. goto err;
  414. }
  415. if (pkt->mask & RXE_WRITE_MASK) {
  416. if (resid > mtu) {
  417. if (pktlen != mtu || bth_pad(pkt)) {
  418. state = RESPST_ERR_LENGTH;
  419. goto err;
  420. }
  421. } else {
  422. if (pktlen != resid) {
  423. state = RESPST_ERR_LENGTH;
  424. goto err;
  425. }
  426. if ((bth_pad(pkt) != (0x3 & (-resid)))) {
  427. /* This case may not be exactly that
  428. * but nothing else fits.
  429. */
  430. state = RESPST_ERR_LENGTH;
  431. goto err;
  432. }
  433. }
  434. }
  435. WARN_ON_ONCE(qp->resp.mr);
  436. qp->resp.mr = mem;
  437. return RESPST_EXECUTE;
  438. err:
  439. if (mem)
  440. rxe_drop_ref(mem);
  441. return state;
  442. }
  443. static enum resp_states send_data_in(struct rxe_qp *qp, void *data_addr,
  444. int data_len)
  445. {
  446. int err;
  447. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  448. err = copy_data(rxe, qp->pd, IB_ACCESS_LOCAL_WRITE, &qp->resp.wqe->dma,
  449. data_addr, data_len, to_mem_obj, NULL);
  450. if (unlikely(err))
  451. return (err == -ENOSPC) ? RESPST_ERR_LENGTH
  452. : RESPST_ERR_MALFORMED_WQE;
  453. return RESPST_NONE;
  454. }
  455. static enum resp_states write_data_in(struct rxe_qp *qp,
  456. struct rxe_pkt_info *pkt)
  457. {
  458. enum resp_states rc = RESPST_NONE;
  459. int err;
  460. int data_len = payload_size(pkt);
  461. err = rxe_mem_copy(qp->resp.mr, qp->resp.va, payload_addr(pkt),
  462. data_len, to_mem_obj, NULL);
  463. if (err) {
  464. rc = RESPST_ERR_RKEY_VIOLATION;
  465. goto out;
  466. }
  467. qp->resp.va += data_len;
  468. qp->resp.resid -= data_len;
  469. out:
  470. return rc;
  471. }
  472. /* Guarantee atomicity of atomic operations at the machine level. */
  473. static DEFINE_SPINLOCK(atomic_ops_lock);
  474. static enum resp_states process_atomic(struct rxe_qp *qp,
  475. struct rxe_pkt_info *pkt)
  476. {
  477. u64 iova = atmeth_va(pkt);
  478. u64 *vaddr;
  479. enum resp_states ret;
  480. struct rxe_mem *mr = qp->resp.mr;
  481. if (mr->state != RXE_MEM_STATE_VALID) {
  482. ret = RESPST_ERR_RKEY_VIOLATION;
  483. goto out;
  484. }
  485. vaddr = iova_to_vaddr(mr, iova, sizeof(u64));
  486. /* check vaddr is 8 bytes aligned. */
  487. if (!vaddr || (uintptr_t)vaddr & 7) {
  488. ret = RESPST_ERR_MISALIGNED_ATOMIC;
  489. goto out;
  490. }
  491. spin_lock_bh(&atomic_ops_lock);
  492. qp->resp.atomic_orig = *vaddr;
  493. if (pkt->opcode == IB_OPCODE_RC_COMPARE_SWAP ||
  494. pkt->opcode == IB_OPCODE_RD_COMPARE_SWAP) {
  495. if (*vaddr == atmeth_comp(pkt))
  496. *vaddr = atmeth_swap_add(pkt);
  497. } else {
  498. *vaddr += atmeth_swap_add(pkt);
  499. }
  500. spin_unlock_bh(&atomic_ops_lock);
  501. ret = RESPST_NONE;
  502. out:
  503. return ret;
  504. }
  505. static struct sk_buff *prepare_ack_packet(struct rxe_qp *qp,
  506. struct rxe_pkt_info *pkt,
  507. struct rxe_pkt_info *ack,
  508. int opcode,
  509. int payload,
  510. u32 psn,
  511. u8 syndrome,
  512. u32 *crcp)
  513. {
  514. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  515. struct sk_buff *skb;
  516. u32 crc = 0;
  517. u32 *p;
  518. int paylen;
  519. int pad;
  520. int err;
  521. /*
  522. * allocate packet
  523. */
  524. pad = (-payload) & 0x3;
  525. paylen = rxe_opcode[opcode].length + payload + pad + RXE_ICRC_SIZE;
  526. skb = rxe_init_packet(rxe, &qp->pri_av, paylen, ack);
  527. if (!skb)
  528. return NULL;
  529. ack->qp = qp;
  530. ack->opcode = opcode;
  531. ack->mask = rxe_opcode[opcode].mask;
  532. ack->offset = pkt->offset;
  533. ack->paylen = paylen;
  534. /* fill in bth using the request packet headers */
  535. memcpy(ack->hdr, pkt->hdr, pkt->offset + RXE_BTH_BYTES);
  536. bth_set_opcode(ack, opcode);
  537. bth_set_qpn(ack, qp->attr.dest_qp_num);
  538. bth_set_pad(ack, pad);
  539. bth_set_se(ack, 0);
  540. bth_set_psn(ack, psn);
  541. bth_set_ack(ack, 0);
  542. ack->psn = psn;
  543. if (ack->mask & RXE_AETH_MASK) {
  544. aeth_set_syn(ack, syndrome);
  545. aeth_set_msn(ack, qp->resp.msn);
  546. }
  547. if (ack->mask & RXE_ATMACK_MASK)
  548. atmack_set_orig(ack, qp->resp.atomic_orig);
  549. err = rxe_prepare(rxe, ack, skb, &crc);
  550. if (err) {
  551. kfree_skb(skb);
  552. return NULL;
  553. }
  554. if (crcp) {
  555. /* CRC computation will be continued by the caller */
  556. *crcp = crc;
  557. } else {
  558. p = payload_addr(ack) + payload + bth_pad(ack);
  559. *p = ~crc;
  560. }
  561. return skb;
  562. }
  563. /* RDMA read response. If res is not NULL, then we have a current RDMA request
  564. * being processed or replayed.
  565. */
  566. static enum resp_states read_reply(struct rxe_qp *qp,
  567. struct rxe_pkt_info *req_pkt)
  568. {
  569. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  570. struct rxe_pkt_info ack_pkt;
  571. struct sk_buff *skb;
  572. int mtu = qp->mtu;
  573. enum resp_states state;
  574. int payload;
  575. int opcode;
  576. int err;
  577. struct resp_res *res = qp->resp.res;
  578. u32 icrc;
  579. u32 *p;
  580. if (!res) {
  581. /* This is the first time we process that request. Get a
  582. * resource
  583. */
  584. res = &qp->resp.resources[qp->resp.res_head];
  585. free_rd_atomic_resource(qp, res);
  586. rxe_advance_resp_resource(qp);
  587. res->type = RXE_READ_MASK;
  588. res->read.va = qp->resp.va;
  589. res->read.va_org = qp->resp.va;
  590. res->first_psn = req_pkt->psn;
  591. if (reth_len(req_pkt)) {
  592. res->last_psn = (req_pkt->psn +
  593. (reth_len(req_pkt) + mtu - 1) /
  594. mtu - 1) & BTH_PSN_MASK;
  595. } else {
  596. res->last_psn = res->first_psn;
  597. }
  598. res->cur_psn = req_pkt->psn;
  599. res->read.resid = qp->resp.resid;
  600. res->read.length = qp->resp.resid;
  601. res->read.rkey = qp->resp.rkey;
  602. /* note res inherits the reference to mr from qp */
  603. res->read.mr = qp->resp.mr;
  604. qp->resp.mr = NULL;
  605. qp->resp.res = res;
  606. res->state = rdatm_res_state_new;
  607. }
  608. if (res->state == rdatm_res_state_new) {
  609. if (res->read.resid <= mtu)
  610. opcode = IB_OPCODE_RC_RDMA_READ_RESPONSE_ONLY;
  611. else
  612. opcode = IB_OPCODE_RC_RDMA_READ_RESPONSE_FIRST;
  613. } else {
  614. if (res->read.resid > mtu)
  615. opcode = IB_OPCODE_RC_RDMA_READ_RESPONSE_MIDDLE;
  616. else
  617. opcode = IB_OPCODE_RC_RDMA_READ_RESPONSE_LAST;
  618. }
  619. res->state = rdatm_res_state_next;
  620. payload = min_t(int, res->read.resid, mtu);
  621. skb = prepare_ack_packet(qp, req_pkt, &ack_pkt, opcode, payload,
  622. res->cur_psn, AETH_ACK_UNLIMITED, &icrc);
  623. if (!skb)
  624. return RESPST_ERR_RNR;
  625. err = rxe_mem_copy(res->read.mr, res->read.va, payload_addr(&ack_pkt),
  626. payload, from_mem_obj, &icrc);
  627. if (err)
  628. pr_err("Failed copying memory\n");
  629. p = payload_addr(&ack_pkt) + payload + bth_pad(&ack_pkt);
  630. *p = ~icrc;
  631. err = rxe_xmit_packet(rxe, qp, &ack_pkt, skb);
  632. if (err) {
  633. pr_err("Failed sending RDMA reply.\n");
  634. kfree_skb(skb);
  635. return RESPST_ERR_RNR;
  636. }
  637. res->read.va += payload;
  638. res->read.resid -= payload;
  639. res->cur_psn = (res->cur_psn + 1) & BTH_PSN_MASK;
  640. if (res->read.resid > 0) {
  641. state = RESPST_DONE;
  642. } else {
  643. qp->resp.res = NULL;
  644. qp->resp.opcode = -1;
  645. if (psn_compare(res->cur_psn, qp->resp.psn) >= 0)
  646. qp->resp.psn = res->cur_psn;
  647. state = RESPST_CLEANUP;
  648. }
  649. return state;
  650. }
  651. static void build_rdma_network_hdr(union rdma_network_hdr *hdr,
  652. struct rxe_pkt_info *pkt)
  653. {
  654. struct sk_buff *skb = PKT_TO_SKB(pkt);
  655. memset(hdr, 0, sizeof(*hdr));
  656. if (skb->protocol == htons(ETH_P_IP))
  657. memcpy(&hdr->roce4grh, ip_hdr(skb), sizeof(hdr->roce4grh));
  658. else if (skb->protocol == htons(ETH_P_IPV6))
  659. memcpy(&hdr->ibgrh, ipv6_hdr(skb), sizeof(hdr->ibgrh));
  660. }
  661. /* Executes a new request. A retried request never reach that function (send
  662. * and writes are discarded, and reads and atomics are retried elsewhere.
  663. */
  664. static enum resp_states execute(struct rxe_qp *qp, struct rxe_pkt_info *pkt)
  665. {
  666. enum resp_states err;
  667. if (pkt->mask & RXE_SEND_MASK) {
  668. if (qp_type(qp) == IB_QPT_UD ||
  669. qp_type(qp) == IB_QPT_SMI ||
  670. qp_type(qp) == IB_QPT_GSI) {
  671. union rdma_network_hdr hdr;
  672. build_rdma_network_hdr(&hdr, pkt);
  673. err = send_data_in(qp, &hdr, sizeof(hdr));
  674. if (err)
  675. return err;
  676. }
  677. err = send_data_in(qp, payload_addr(pkt), payload_size(pkt));
  678. if (err)
  679. return err;
  680. } else if (pkt->mask & RXE_WRITE_MASK) {
  681. err = write_data_in(qp, pkt);
  682. if (err)
  683. return err;
  684. } else if (pkt->mask & RXE_READ_MASK) {
  685. /* For RDMA Read we can increment the msn now. See C9-148. */
  686. qp->resp.msn++;
  687. return RESPST_READ_REPLY;
  688. } else if (pkt->mask & RXE_ATOMIC_MASK) {
  689. err = process_atomic(qp, pkt);
  690. if (err)
  691. return err;
  692. } else {
  693. /* Unreachable */
  694. WARN_ON_ONCE(1);
  695. }
  696. /* next expected psn, read handles this separately */
  697. qp->resp.psn = (pkt->psn + 1) & BTH_PSN_MASK;
  698. qp->resp.opcode = pkt->opcode;
  699. qp->resp.status = IB_WC_SUCCESS;
  700. if (pkt->mask & RXE_COMP_MASK) {
  701. /* We successfully processed this new request. */
  702. qp->resp.msn++;
  703. return RESPST_COMPLETE;
  704. } else if (qp_type(qp) == IB_QPT_RC)
  705. return RESPST_ACKNOWLEDGE;
  706. else
  707. return RESPST_CLEANUP;
  708. }
  709. static enum resp_states do_complete(struct rxe_qp *qp,
  710. struct rxe_pkt_info *pkt)
  711. {
  712. struct rxe_cqe cqe;
  713. struct ib_wc *wc = &cqe.ibwc;
  714. struct ib_uverbs_wc *uwc = &cqe.uibwc;
  715. struct rxe_recv_wqe *wqe = qp->resp.wqe;
  716. if (unlikely(!wqe))
  717. return RESPST_CLEANUP;
  718. memset(&cqe, 0, sizeof(cqe));
  719. wc->wr_id = wqe->wr_id;
  720. wc->status = qp->resp.status;
  721. wc->qp = &qp->ibqp;
  722. /* fields after status are not required for errors */
  723. if (wc->status == IB_WC_SUCCESS) {
  724. wc->opcode = (pkt->mask & RXE_IMMDT_MASK &&
  725. pkt->mask & RXE_WRITE_MASK) ?
  726. IB_WC_RECV_RDMA_WITH_IMM : IB_WC_RECV;
  727. wc->vendor_err = 0;
  728. wc->byte_len = wqe->dma.length - wqe->dma.resid;
  729. /* fields after byte_len are different between kernel and user
  730. * space
  731. */
  732. if (qp->rcq->is_user) {
  733. uwc->wc_flags = IB_WC_GRH;
  734. if (pkt->mask & RXE_IMMDT_MASK) {
  735. uwc->wc_flags |= IB_WC_WITH_IMM;
  736. uwc->ex.imm_data =
  737. (__u32 __force)immdt_imm(pkt);
  738. }
  739. if (pkt->mask & RXE_IETH_MASK) {
  740. uwc->wc_flags |= IB_WC_WITH_INVALIDATE;
  741. uwc->ex.invalidate_rkey = ieth_rkey(pkt);
  742. }
  743. uwc->qp_num = qp->ibqp.qp_num;
  744. if (pkt->mask & RXE_DETH_MASK)
  745. uwc->src_qp = deth_sqp(pkt);
  746. uwc->port_num = qp->attr.port_num;
  747. } else {
  748. struct sk_buff *skb = PKT_TO_SKB(pkt);
  749. wc->wc_flags = IB_WC_GRH | IB_WC_WITH_NETWORK_HDR_TYPE;
  750. if (skb->protocol == htons(ETH_P_IP))
  751. wc->network_hdr_type = RDMA_NETWORK_IPV4;
  752. else
  753. wc->network_hdr_type = RDMA_NETWORK_IPV6;
  754. if (pkt->mask & RXE_IMMDT_MASK) {
  755. wc->wc_flags |= IB_WC_WITH_IMM;
  756. wc->ex.imm_data = immdt_imm(pkt);
  757. }
  758. if (pkt->mask & RXE_IETH_MASK) {
  759. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  760. struct rxe_mem *rmr;
  761. wc->wc_flags |= IB_WC_WITH_INVALIDATE;
  762. wc->ex.invalidate_rkey = ieth_rkey(pkt);
  763. rmr = rxe_pool_get_index(&rxe->mr_pool,
  764. wc->ex.invalidate_rkey >> 8);
  765. if (unlikely(!rmr)) {
  766. pr_err("Bad rkey %#x invalidation\n",
  767. wc->ex.invalidate_rkey);
  768. return RESPST_ERROR;
  769. }
  770. rmr->state = RXE_MEM_STATE_FREE;
  771. rxe_drop_ref(rmr);
  772. }
  773. wc->qp = &qp->ibqp;
  774. if (pkt->mask & RXE_DETH_MASK)
  775. wc->src_qp = deth_sqp(pkt);
  776. wc->port_num = qp->attr.port_num;
  777. }
  778. }
  779. /* have copy for srq and reference for !srq */
  780. if (!qp->srq)
  781. advance_consumer(qp->rq.queue);
  782. qp->resp.wqe = NULL;
  783. if (rxe_cq_post(qp->rcq, &cqe, pkt ? bth_se(pkt) : 1))
  784. return RESPST_ERR_CQ_OVERFLOW;
  785. if (qp->resp.state == QP_STATE_ERROR)
  786. return RESPST_CHK_RESOURCE;
  787. if (!pkt)
  788. return RESPST_DONE;
  789. else if (qp_type(qp) == IB_QPT_RC)
  790. return RESPST_ACKNOWLEDGE;
  791. else
  792. return RESPST_CLEANUP;
  793. }
  794. static int send_ack(struct rxe_qp *qp, struct rxe_pkt_info *pkt,
  795. u8 syndrome, u32 psn)
  796. {
  797. int err = 0;
  798. struct rxe_pkt_info ack_pkt;
  799. struct sk_buff *skb;
  800. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  801. skb = prepare_ack_packet(qp, pkt, &ack_pkt, IB_OPCODE_RC_ACKNOWLEDGE,
  802. 0, psn, syndrome, NULL);
  803. if (!skb) {
  804. err = -ENOMEM;
  805. goto err1;
  806. }
  807. err = rxe_xmit_packet(rxe, qp, &ack_pkt, skb);
  808. if (err) {
  809. pr_err_ratelimited("Failed sending ack\n");
  810. kfree_skb(skb);
  811. }
  812. err1:
  813. return err;
  814. }
  815. static int send_atomic_ack(struct rxe_qp *qp, struct rxe_pkt_info *pkt,
  816. u8 syndrome)
  817. {
  818. int rc = 0;
  819. struct rxe_pkt_info ack_pkt;
  820. struct sk_buff *skb;
  821. struct sk_buff *skb_copy;
  822. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  823. struct resp_res *res;
  824. skb = prepare_ack_packet(qp, pkt, &ack_pkt,
  825. IB_OPCODE_RC_ATOMIC_ACKNOWLEDGE, 0, pkt->psn,
  826. syndrome, NULL);
  827. if (!skb) {
  828. rc = -ENOMEM;
  829. goto out;
  830. }
  831. skb_copy = skb_clone(skb, GFP_ATOMIC);
  832. if (skb_copy)
  833. rxe_add_ref(qp); /* for the new SKB */
  834. else {
  835. pr_warn("Could not clone atomic response\n");
  836. rc = -ENOMEM;
  837. goto out;
  838. }
  839. res = &qp->resp.resources[qp->resp.res_head];
  840. free_rd_atomic_resource(qp, res);
  841. rxe_advance_resp_resource(qp);
  842. memcpy(SKB_TO_PKT(skb), &ack_pkt, sizeof(skb->cb));
  843. res->type = RXE_ATOMIC_MASK;
  844. res->atomic.skb = skb;
  845. res->first_psn = ack_pkt.psn;
  846. res->last_psn = ack_pkt.psn;
  847. res->cur_psn = ack_pkt.psn;
  848. rc = rxe_xmit_packet(rxe, qp, &ack_pkt, skb_copy);
  849. if (rc) {
  850. pr_err_ratelimited("Failed sending ack\n");
  851. rxe_drop_ref(qp);
  852. kfree_skb(skb_copy);
  853. }
  854. out:
  855. return rc;
  856. }
  857. static enum resp_states acknowledge(struct rxe_qp *qp,
  858. struct rxe_pkt_info *pkt)
  859. {
  860. if (qp_type(qp) != IB_QPT_RC)
  861. return RESPST_CLEANUP;
  862. if (qp->resp.aeth_syndrome != AETH_ACK_UNLIMITED)
  863. send_ack(qp, pkt, qp->resp.aeth_syndrome, pkt->psn);
  864. else if (pkt->mask & RXE_ATOMIC_MASK)
  865. send_atomic_ack(qp, pkt, AETH_ACK_UNLIMITED);
  866. else if (bth_ack(pkt))
  867. send_ack(qp, pkt, AETH_ACK_UNLIMITED, pkt->psn);
  868. return RESPST_CLEANUP;
  869. }
  870. static enum resp_states cleanup(struct rxe_qp *qp,
  871. struct rxe_pkt_info *pkt)
  872. {
  873. struct sk_buff *skb;
  874. if (pkt) {
  875. skb = skb_dequeue(&qp->req_pkts);
  876. rxe_drop_ref(qp);
  877. kfree_skb(skb);
  878. }
  879. if (qp->resp.mr) {
  880. rxe_drop_ref(qp->resp.mr);
  881. qp->resp.mr = NULL;
  882. }
  883. return RESPST_DONE;
  884. }
  885. static struct resp_res *find_resource(struct rxe_qp *qp, u32 psn)
  886. {
  887. int i;
  888. for (i = 0; i < qp->attr.max_rd_atomic; i++) {
  889. struct resp_res *res = &qp->resp.resources[i];
  890. if (res->type == 0)
  891. continue;
  892. if (psn_compare(psn, res->first_psn) >= 0 &&
  893. psn_compare(psn, res->last_psn) <= 0) {
  894. return res;
  895. }
  896. }
  897. return NULL;
  898. }
  899. static enum resp_states duplicate_request(struct rxe_qp *qp,
  900. struct rxe_pkt_info *pkt)
  901. {
  902. enum resp_states rc;
  903. u32 prev_psn = (qp->resp.psn - 1) & BTH_PSN_MASK;
  904. if (pkt->mask & RXE_SEND_MASK ||
  905. pkt->mask & RXE_WRITE_MASK) {
  906. /* SEND. Ack again and cleanup. C9-105. */
  907. if (bth_ack(pkt))
  908. send_ack(qp, pkt, AETH_ACK_UNLIMITED, prev_psn);
  909. rc = RESPST_CLEANUP;
  910. goto out;
  911. } else if (pkt->mask & RXE_READ_MASK) {
  912. struct resp_res *res;
  913. res = find_resource(qp, pkt->psn);
  914. if (!res) {
  915. /* Resource not found. Class D error. Drop the
  916. * request.
  917. */
  918. rc = RESPST_CLEANUP;
  919. goto out;
  920. } else {
  921. /* Ensure this new request is the same as the previous
  922. * one or a subset of it.
  923. */
  924. u64 iova = reth_va(pkt);
  925. u32 resid = reth_len(pkt);
  926. if (iova < res->read.va_org ||
  927. resid > res->read.length ||
  928. (iova + resid) > (res->read.va_org +
  929. res->read.length)) {
  930. rc = RESPST_CLEANUP;
  931. goto out;
  932. }
  933. if (reth_rkey(pkt) != res->read.rkey) {
  934. rc = RESPST_CLEANUP;
  935. goto out;
  936. }
  937. res->cur_psn = pkt->psn;
  938. res->state = (pkt->psn == res->first_psn) ?
  939. rdatm_res_state_new :
  940. rdatm_res_state_replay;
  941. /* Reset the resource, except length. */
  942. res->read.va_org = iova;
  943. res->read.va = iova;
  944. res->read.resid = resid;
  945. /* Replay the RDMA read reply. */
  946. qp->resp.res = res;
  947. rc = RESPST_READ_REPLY;
  948. goto out;
  949. }
  950. } else {
  951. struct resp_res *res;
  952. /* Find the operation in our list of responder resources. */
  953. res = find_resource(qp, pkt->psn);
  954. if (res) {
  955. struct sk_buff *skb_copy;
  956. skb_copy = skb_clone(res->atomic.skb, GFP_ATOMIC);
  957. if (skb_copy) {
  958. rxe_add_ref(qp); /* for the new SKB */
  959. } else {
  960. pr_warn("Couldn't clone atomic resp\n");
  961. rc = RESPST_CLEANUP;
  962. goto out;
  963. }
  964. /* Resend the result. */
  965. rc = rxe_xmit_packet(to_rdev(qp->ibqp.device), qp,
  966. pkt, skb_copy);
  967. if (rc) {
  968. pr_err("Failed resending result. This flow is not handled - skb ignored\n");
  969. rxe_drop_ref(qp);
  970. kfree_skb(skb_copy);
  971. rc = RESPST_CLEANUP;
  972. goto out;
  973. }
  974. }
  975. /* Resource not found. Class D error. Drop the request. */
  976. rc = RESPST_CLEANUP;
  977. goto out;
  978. }
  979. out:
  980. return rc;
  981. }
  982. /* Process a class A or C. Both are treated the same in this implementation. */
  983. static void do_class_ac_error(struct rxe_qp *qp, u8 syndrome,
  984. enum ib_wc_status status)
  985. {
  986. qp->resp.aeth_syndrome = syndrome;
  987. qp->resp.status = status;
  988. /* indicate that we should go through the ERROR state */
  989. qp->resp.goto_error = 1;
  990. }
  991. static enum resp_states do_class_d1e_error(struct rxe_qp *qp)
  992. {
  993. /* UC */
  994. if (qp->srq) {
  995. /* Class E */
  996. qp->resp.drop_msg = 1;
  997. if (qp->resp.wqe) {
  998. qp->resp.status = IB_WC_REM_INV_REQ_ERR;
  999. return RESPST_COMPLETE;
  1000. } else {
  1001. return RESPST_CLEANUP;
  1002. }
  1003. } else {
  1004. /* Class D1. This packet may be the start of a
  1005. * new message and could be valid. The previous
  1006. * message is invalid and ignored. reset the
  1007. * recv wr to its original state
  1008. */
  1009. if (qp->resp.wqe) {
  1010. qp->resp.wqe->dma.resid = qp->resp.wqe->dma.length;
  1011. qp->resp.wqe->dma.cur_sge = 0;
  1012. qp->resp.wqe->dma.sge_offset = 0;
  1013. qp->resp.opcode = -1;
  1014. }
  1015. if (qp->resp.mr) {
  1016. rxe_drop_ref(qp->resp.mr);
  1017. qp->resp.mr = NULL;
  1018. }
  1019. return RESPST_CLEANUP;
  1020. }
  1021. }
  1022. void rxe_drain_req_pkts(struct rxe_qp *qp, bool notify)
  1023. {
  1024. struct sk_buff *skb;
  1025. while ((skb = skb_dequeue(&qp->req_pkts))) {
  1026. rxe_drop_ref(qp);
  1027. kfree_skb(skb);
  1028. }
  1029. while (!qp->srq && qp->rq.queue && queue_head(qp->rq.queue))
  1030. advance_consumer(qp->rq.queue);
  1031. }
  1032. int rxe_responder(void *arg)
  1033. {
  1034. struct rxe_qp *qp = (struct rxe_qp *)arg;
  1035. struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
  1036. enum resp_states state;
  1037. struct rxe_pkt_info *pkt = NULL;
  1038. int ret = 0;
  1039. rxe_add_ref(qp);
  1040. qp->resp.aeth_syndrome = AETH_ACK_UNLIMITED;
  1041. if (!qp->valid) {
  1042. ret = -EINVAL;
  1043. goto done;
  1044. }
  1045. switch (qp->resp.state) {
  1046. case QP_STATE_RESET:
  1047. state = RESPST_RESET;
  1048. break;
  1049. default:
  1050. state = RESPST_GET_REQ;
  1051. break;
  1052. }
  1053. while (1) {
  1054. pr_debug("qp#%d state = %s\n", qp_num(qp),
  1055. resp_state_name[state]);
  1056. switch (state) {
  1057. case RESPST_GET_REQ:
  1058. state = get_req(qp, &pkt);
  1059. break;
  1060. case RESPST_CHK_PSN:
  1061. state = check_psn(qp, pkt);
  1062. break;
  1063. case RESPST_CHK_OP_SEQ:
  1064. state = check_op_seq(qp, pkt);
  1065. break;
  1066. case RESPST_CHK_OP_VALID:
  1067. state = check_op_valid(qp, pkt);
  1068. break;
  1069. case RESPST_CHK_RESOURCE:
  1070. state = check_resource(qp, pkt);
  1071. break;
  1072. case RESPST_CHK_LENGTH:
  1073. state = check_length(qp, pkt);
  1074. break;
  1075. case RESPST_CHK_RKEY:
  1076. state = check_rkey(qp, pkt);
  1077. break;
  1078. case RESPST_EXECUTE:
  1079. state = execute(qp, pkt);
  1080. break;
  1081. case RESPST_COMPLETE:
  1082. state = do_complete(qp, pkt);
  1083. break;
  1084. case RESPST_READ_REPLY:
  1085. state = read_reply(qp, pkt);
  1086. break;
  1087. case RESPST_ACKNOWLEDGE:
  1088. state = acknowledge(qp, pkt);
  1089. break;
  1090. case RESPST_CLEANUP:
  1091. state = cleanup(qp, pkt);
  1092. break;
  1093. case RESPST_DUPLICATE_REQUEST:
  1094. state = duplicate_request(qp, pkt);
  1095. break;
  1096. case RESPST_ERR_PSN_OUT_OF_SEQ:
  1097. /* RC only - Class B. Drop packet. */
  1098. send_ack(qp, pkt, AETH_NAK_PSN_SEQ_ERROR, qp->resp.psn);
  1099. state = RESPST_CLEANUP;
  1100. break;
  1101. case RESPST_ERR_TOO_MANY_RDMA_ATM_REQ:
  1102. case RESPST_ERR_MISSING_OPCODE_FIRST:
  1103. case RESPST_ERR_MISSING_OPCODE_LAST_C:
  1104. case RESPST_ERR_UNSUPPORTED_OPCODE:
  1105. case RESPST_ERR_MISALIGNED_ATOMIC:
  1106. /* RC Only - Class C. */
  1107. do_class_ac_error(qp, AETH_NAK_INVALID_REQ,
  1108. IB_WC_REM_INV_REQ_ERR);
  1109. state = RESPST_COMPLETE;
  1110. break;
  1111. case RESPST_ERR_MISSING_OPCODE_LAST_D1E:
  1112. state = do_class_d1e_error(qp);
  1113. break;
  1114. case RESPST_ERR_RNR:
  1115. if (qp_type(qp) == IB_QPT_RC) {
  1116. rxe_counter_inc(rxe, RXE_CNT_SND_RNR);
  1117. /* RC - class B */
  1118. send_ack(qp, pkt, AETH_RNR_NAK |
  1119. (~AETH_TYPE_MASK &
  1120. qp->attr.min_rnr_timer),
  1121. pkt->psn);
  1122. } else {
  1123. /* UD/UC - class D */
  1124. qp->resp.drop_msg = 1;
  1125. }
  1126. state = RESPST_CLEANUP;
  1127. break;
  1128. case RESPST_ERR_RKEY_VIOLATION:
  1129. if (qp_type(qp) == IB_QPT_RC) {
  1130. /* Class C */
  1131. do_class_ac_error(qp, AETH_NAK_REM_ACC_ERR,
  1132. IB_WC_REM_ACCESS_ERR);
  1133. state = RESPST_COMPLETE;
  1134. } else {
  1135. qp->resp.drop_msg = 1;
  1136. if (qp->srq) {
  1137. /* UC/SRQ Class D */
  1138. qp->resp.status = IB_WC_REM_ACCESS_ERR;
  1139. state = RESPST_COMPLETE;
  1140. } else {
  1141. /* UC/non-SRQ Class E. */
  1142. state = RESPST_CLEANUP;
  1143. }
  1144. }
  1145. break;
  1146. case RESPST_ERR_LENGTH:
  1147. if (qp_type(qp) == IB_QPT_RC) {
  1148. /* Class C */
  1149. do_class_ac_error(qp, AETH_NAK_INVALID_REQ,
  1150. IB_WC_REM_INV_REQ_ERR);
  1151. state = RESPST_COMPLETE;
  1152. } else if (qp->srq) {
  1153. /* UC/UD - class E */
  1154. qp->resp.status = IB_WC_REM_INV_REQ_ERR;
  1155. state = RESPST_COMPLETE;
  1156. } else {
  1157. /* UC/UD - class D */
  1158. qp->resp.drop_msg = 1;
  1159. state = RESPST_CLEANUP;
  1160. }
  1161. break;
  1162. case RESPST_ERR_MALFORMED_WQE:
  1163. /* All, Class A. */
  1164. do_class_ac_error(qp, AETH_NAK_REM_OP_ERR,
  1165. IB_WC_LOC_QP_OP_ERR);
  1166. state = RESPST_COMPLETE;
  1167. break;
  1168. case RESPST_ERR_CQ_OVERFLOW:
  1169. /* All - Class G */
  1170. state = RESPST_ERROR;
  1171. break;
  1172. case RESPST_DONE:
  1173. if (qp->resp.goto_error) {
  1174. state = RESPST_ERROR;
  1175. break;
  1176. }
  1177. goto done;
  1178. case RESPST_EXIT:
  1179. if (qp->resp.goto_error) {
  1180. state = RESPST_ERROR;
  1181. break;
  1182. }
  1183. goto exit;
  1184. case RESPST_RESET:
  1185. rxe_drain_req_pkts(qp, false);
  1186. qp->resp.wqe = NULL;
  1187. goto exit;
  1188. case RESPST_ERROR:
  1189. qp->resp.goto_error = 0;
  1190. pr_warn("qp#%d moved to error state\n", qp_num(qp));
  1191. rxe_qp_error(qp);
  1192. goto exit;
  1193. default:
  1194. WARN_ON_ONCE(1);
  1195. }
  1196. }
  1197. exit:
  1198. ret = -EAGAIN;
  1199. done:
  1200. rxe_drop_ref(qp);
  1201. return ret;
  1202. }