rxe_resp.c 32 KB

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