ipath_ud.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579
  1. /*
  2. * Copyright (c) 2006, 2007, 2008 QLogic Corporation. All rights reserved.
  3. * Copyright (c) 2005, 2006 PathScale, 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 <rdma/ib_smi.h>
  34. #include "ipath_verbs.h"
  35. #include "ipath_kernel.h"
  36. /**
  37. * ipath_ud_loopback - handle send on loopback QPs
  38. * @sqp: the sending QP
  39. * @swqe: the send work request
  40. *
  41. * This is called from ipath_make_ud_req() to forward a WQE addressed
  42. * to the same HCA.
  43. * Note that the receive interrupt handler may be calling ipath_ud_rcv()
  44. * while this is being called.
  45. */
  46. static void ipath_ud_loopback(struct ipath_qp *sqp, struct ipath_swqe *swqe)
  47. {
  48. struct ipath_ibdev *dev = to_idev(sqp->ibqp.device);
  49. struct ipath_qp *qp;
  50. struct ib_ah_attr *ah_attr;
  51. unsigned long flags;
  52. struct ipath_rq *rq;
  53. struct ipath_srq *srq;
  54. struct ipath_sge_state rsge;
  55. struct ipath_sge *sge;
  56. struct ipath_rwq *wq;
  57. struct ipath_rwqe *wqe;
  58. void (*handler)(struct ib_event *, void *);
  59. struct ib_wc wc;
  60. u32 tail;
  61. u32 rlen;
  62. u32 length;
  63. qp = ipath_lookup_qpn(&dev->qp_table, swqe->wr.wr.ud.remote_qpn);
  64. if (!qp || !(ib_ipath_state_ops[qp->state] & IPATH_PROCESS_RECV_OK)) {
  65. dev->n_pkt_drops++;
  66. goto done;
  67. }
  68. /*
  69. * Check that the qkey matches (except for QP0, see 9.6.1.4.1).
  70. * Qkeys with the high order bit set mean use the
  71. * qkey from the QP context instead of the WR (see 10.2.5).
  72. */
  73. if (unlikely(qp->ibqp.qp_num &&
  74. ((int) swqe->wr.wr.ud.remote_qkey < 0 ?
  75. sqp->qkey : swqe->wr.wr.ud.remote_qkey) != qp->qkey)) {
  76. /* XXX OK to lose a count once in a while. */
  77. dev->qkey_violations++;
  78. dev->n_pkt_drops++;
  79. goto drop;
  80. }
  81. /*
  82. * A GRH is expected to preceed the data even if not
  83. * present on the wire.
  84. */
  85. length = swqe->length;
  86. memset(&wc, 0, sizeof wc);
  87. wc.byte_len = length + sizeof(struct ib_grh);
  88. if (swqe->wr.opcode == IB_WR_SEND_WITH_IMM) {
  89. wc.wc_flags = IB_WC_WITH_IMM;
  90. wc.ex.imm_data = swqe->wr.ex.imm_data;
  91. }
  92. /*
  93. * This would be a lot simpler if we could call ipath_get_rwqe()
  94. * but that uses state that the receive interrupt handler uses
  95. * so we would need to lock out receive interrupts while doing
  96. * local loopback.
  97. */
  98. if (qp->ibqp.srq) {
  99. srq = to_isrq(qp->ibqp.srq);
  100. handler = srq->ibsrq.event_handler;
  101. rq = &srq->rq;
  102. } else {
  103. srq = NULL;
  104. handler = NULL;
  105. rq = &qp->r_rq;
  106. }
  107. /*
  108. * Get the next work request entry to find where to put the data.
  109. * Note that it is safe to drop the lock after changing rq->tail
  110. * since ipath_post_receive() won't fill the empty slot.
  111. */
  112. spin_lock_irqsave(&rq->lock, flags);
  113. wq = rq->wq;
  114. tail = wq->tail;
  115. /* Validate tail before using it since it is user writable. */
  116. if (tail >= rq->size)
  117. tail = 0;
  118. if (unlikely(tail == wq->head)) {
  119. spin_unlock_irqrestore(&rq->lock, flags);
  120. dev->n_pkt_drops++;
  121. goto drop;
  122. }
  123. wqe = get_rwqe_ptr(rq, tail);
  124. rsge.sg_list = qp->r_ud_sg_list;
  125. if (!ipath_init_sge(qp, wqe, &rlen, &rsge)) {
  126. spin_unlock_irqrestore(&rq->lock, flags);
  127. dev->n_pkt_drops++;
  128. goto drop;
  129. }
  130. /* Silently drop packets which are too big. */
  131. if (wc.byte_len > rlen) {
  132. spin_unlock_irqrestore(&rq->lock, flags);
  133. dev->n_pkt_drops++;
  134. goto drop;
  135. }
  136. if (++tail >= rq->size)
  137. tail = 0;
  138. wq->tail = tail;
  139. wc.wr_id = wqe->wr_id;
  140. if (handler) {
  141. u32 n;
  142. /*
  143. * validate head pointer value and compute
  144. * the number of remaining WQEs.
  145. */
  146. n = wq->head;
  147. if (n >= rq->size)
  148. n = 0;
  149. if (n < tail)
  150. n += rq->size - tail;
  151. else
  152. n -= tail;
  153. if (n < srq->limit) {
  154. struct ib_event ev;
  155. srq->limit = 0;
  156. spin_unlock_irqrestore(&rq->lock, flags);
  157. ev.device = qp->ibqp.device;
  158. ev.element.srq = qp->ibqp.srq;
  159. ev.event = IB_EVENT_SRQ_LIMIT_REACHED;
  160. handler(&ev, srq->ibsrq.srq_context);
  161. } else
  162. spin_unlock_irqrestore(&rq->lock, flags);
  163. } else
  164. spin_unlock_irqrestore(&rq->lock, flags);
  165. ah_attr = &to_iah(swqe->wr.wr.ud.ah)->attr;
  166. if (ah_attr->ah_flags & IB_AH_GRH) {
  167. ipath_copy_sge(&rsge, &ah_attr->grh, sizeof(struct ib_grh));
  168. wc.wc_flags |= IB_WC_GRH;
  169. } else
  170. ipath_skip_sge(&rsge, sizeof(struct ib_grh));
  171. sge = swqe->sg_list;
  172. while (length) {
  173. u32 len = sge->length;
  174. if (len > length)
  175. len = length;
  176. if (len > sge->sge_length)
  177. len = sge->sge_length;
  178. BUG_ON(len == 0);
  179. ipath_copy_sge(&rsge, sge->vaddr, len);
  180. sge->vaddr += len;
  181. sge->length -= len;
  182. sge->sge_length -= len;
  183. if (sge->sge_length == 0) {
  184. if (--swqe->wr.num_sge)
  185. sge++;
  186. } else if (sge->length == 0 && sge->mr != NULL) {
  187. if (++sge->n >= IPATH_SEGSZ) {
  188. if (++sge->m >= sge->mr->mapsz)
  189. break;
  190. sge->n = 0;
  191. }
  192. sge->vaddr =
  193. sge->mr->map[sge->m]->segs[sge->n].vaddr;
  194. sge->length =
  195. sge->mr->map[sge->m]->segs[sge->n].length;
  196. }
  197. length -= len;
  198. }
  199. wc.status = IB_WC_SUCCESS;
  200. wc.opcode = IB_WC_RECV;
  201. wc.qp = &qp->ibqp;
  202. wc.src_qp = sqp->ibqp.qp_num;
  203. /* XXX do we know which pkey matched? Only needed for GSI. */
  204. wc.pkey_index = 0;
  205. wc.slid = dev->dd->ipath_lid |
  206. (ah_attr->src_path_bits &
  207. ((1 << dev->dd->ipath_lmc) - 1));
  208. wc.sl = ah_attr->sl;
  209. wc.dlid_path_bits =
  210. ah_attr->dlid & ((1 << dev->dd->ipath_lmc) - 1);
  211. wc.port_num = 1;
  212. /* Signal completion event if the solicited bit is set. */
  213. ipath_cq_enter(to_icq(qp->ibqp.recv_cq), &wc,
  214. swqe->wr.send_flags & IB_SEND_SOLICITED);
  215. drop:
  216. if (atomic_dec_and_test(&qp->refcount))
  217. wake_up(&qp->wait);
  218. done:;
  219. }
  220. /**
  221. * ipath_make_ud_req - construct a UD request packet
  222. * @qp: the QP
  223. *
  224. * Return 1 if constructed; otherwise, return 0.
  225. */
  226. int ipath_make_ud_req(struct ipath_qp *qp)
  227. {
  228. struct ipath_ibdev *dev = to_idev(qp->ibqp.device);
  229. struct ipath_other_headers *ohdr;
  230. struct ib_ah_attr *ah_attr;
  231. struct ipath_swqe *wqe;
  232. unsigned long flags;
  233. u32 nwords;
  234. u32 extra_bytes;
  235. u32 bth0;
  236. u16 lrh0;
  237. u16 lid;
  238. int ret = 0;
  239. int next_cur;
  240. spin_lock_irqsave(&qp->s_lock, flags);
  241. if (!(ib_ipath_state_ops[qp->state] & IPATH_PROCESS_NEXT_SEND_OK)) {
  242. if (!(ib_ipath_state_ops[qp->state] & IPATH_FLUSH_SEND))
  243. goto bail;
  244. /* We are in the error state, flush the work request. */
  245. if (qp->s_last == qp->s_head)
  246. goto bail;
  247. /* If DMAs are in progress, we can't flush immediately. */
  248. if (atomic_read(&qp->s_dma_busy)) {
  249. qp->s_flags |= IPATH_S_WAIT_DMA;
  250. goto bail;
  251. }
  252. wqe = get_swqe_ptr(qp, qp->s_last);
  253. ipath_send_complete(qp, wqe, IB_WC_WR_FLUSH_ERR);
  254. goto done;
  255. }
  256. if (qp->s_cur == qp->s_head)
  257. goto bail;
  258. wqe = get_swqe_ptr(qp, qp->s_cur);
  259. next_cur = qp->s_cur + 1;
  260. if (next_cur >= qp->s_size)
  261. next_cur = 0;
  262. /* Construct the header. */
  263. ah_attr = &to_iah(wqe->wr.wr.ud.ah)->attr;
  264. if (ah_attr->dlid >= IPATH_MULTICAST_LID_BASE) {
  265. if (ah_attr->dlid != IPATH_PERMISSIVE_LID)
  266. dev->n_multicast_xmit++;
  267. else
  268. dev->n_unicast_xmit++;
  269. } else {
  270. dev->n_unicast_xmit++;
  271. lid = ah_attr->dlid & ~((1 << dev->dd->ipath_lmc) - 1);
  272. if (unlikely(lid == dev->dd->ipath_lid)) {
  273. /*
  274. * If DMAs are in progress, we can't generate
  275. * a completion for the loopback packet since
  276. * it would be out of order.
  277. * XXX Instead of waiting, we could queue a
  278. * zero length descriptor so we get a callback.
  279. */
  280. if (atomic_read(&qp->s_dma_busy)) {
  281. qp->s_flags |= IPATH_S_WAIT_DMA;
  282. goto bail;
  283. }
  284. qp->s_cur = next_cur;
  285. spin_unlock_irqrestore(&qp->s_lock, flags);
  286. ipath_ud_loopback(qp, wqe);
  287. spin_lock_irqsave(&qp->s_lock, flags);
  288. ipath_send_complete(qp, wqe, IB_WC_SUCCESS);
  289. goto done;
  290. }
  291. }
  292. qp->s_cur = next_cur;
  293. extra_bytes = -wqe->length & 3;
  294. nwords = (wqe->length + extra_bytes) >> 2;
  295. /* header size in 32-bit words LRH+BTH+DETH = (8+12+8)/4. */
  296. qp->s_hdrwords = 7;
  297. qp->s_cur_size = wqe->length;
  298. qp->s_cur_sge = &qp->s_sge;
  299. qp->s_dmult = ah_attr->static_rate;
  300. qp->s_wqe = wqe;
  301. qp->s_sge.sge = wqe->sg_list[0];
  302. qp->s_sge.sg_list = wqe->sg_list + 1;
  303. qp->s_sge.num_sge = wqe->wr.num_sge;
  304. if (ah_attr->ah_flags & IB_AH_GRH) {
  305. /* Header size in 32-bit words. */
  306. qp->s_hdrwords += ipath_make_grh(dev, &qp->s_hdr.u.l.grh,
  307. &ah_attr->grh,
  308. qp->s_hdrwords, nwords);
  309. lrh0 = IPATH_LRH_GRH;
  310. ohdr = &qp->s_hdr.u.l.oth;
  311. /*
  312. * Don't worry about sending to locally attached multicast
  313. * QPs. It is unspecified by the spec. what happens.
  314. */
  315. } else {
  316. /* Header size in 32-bit words. */
  317. lrh0 = IPATH_LRH_BTH;
  318. ohdr = &qp->s_hdr.u.oth;
  319. }
  320. if (wqe->wr.opcode == IB_WR_SEND_WITH_IMM) {
  321. qp->s_hdrwords++;
  322. ohdr->u.ud.imm_data = wqe->wr.ex.imm_data;
  323. bth0 = IB_OPCODE_UD_SEND_ONLY_WITH_IMMEDIATE << 24;
  324. } else
  325. bth0 = IB_OPCODE_UD_SEND_ONLY << 24;
  326. lrh0 |= ah_attr->sl << 4;
  327. if (qp->ibqp.qp_type == IB_QPT_SMI)
  328. lrh0 |= 0xF000; /* Set VL (see ch. 13.5.3.1) */
  329. qp->s_hdr.lrh[0] = cpu_to_be16(lrh0);
  330. qp->s_hdr.lrh[1] = cpu_to_be16(ah_attr->dlid); /* DEST LID */
  331. qp->s_hdr.lrh[2] = cpu_to_be16(qp->s_hdrwords + nwords +
  332. SIZE_OF_CRC);
  333. lid = dev->dd->ipath_lid;
  334. if (lid) {
  335. lid |= ah_attr->src_path_bits &
  336. ((1 << dev->dd->ipath_lmc) - 1);
  337. qp->s_hdr.lrh[3] = cpu_to_be16(lid);
  338. } else
  339. qp->s_hdr.lrh[3] = IB_LID_PERMISSIVE;
  340. if (wqe->wr.send_flags & IB_SEND_SOLICITED)
  341. bth0 |= 1 << 23;
  342. bth0 |= extra_bytes << 20;
  343. bth0 |= qp->ibqp.qp_type == IB_QPT_SMI ? IPATH_DEFAULT_P_KEY :
  344. ipath_get_pkey(dev->dd, qp->s_pkey_index);
  345. ohdr->bth[0] = cpu_to_be32(bth0);
  346. /*
  347. * Use the multicast QP if the destination LID is a multicast LID.
  348. */
  349. ohdr->bth[1] = ah_attr->dlid >= IPATH_MULTICAST_LID_BASE &&
  350. ah_attr->dlid != IPATH_PERMISSIVE_LID ?
  351. __constant_cpu_to_be32(IPATH_MULTICAST_QPN) :
  352. cpu_to_be32(wqe->wr.wr.ud.remote_qpn);
  353. ohdr->bth[2] = cpu_to_be32(qp->s_next_psn++ & IPATH_PSN_MASK);
  354. /*
  355. * Qkeys with the high order bit set mean use the
  356. * qkey from the QP context instead of the WR (see 10.2.5).
  357. */
  358. ohdr->u.ud.deth[0] = cpu_to_be32((int)wqe->wr.wr.ud.remote_qkey < 0 ?
  359. qp->qkey : wqe->wr.wr.ud.remote_qkey);
  360. ohdr->u.ud.deth[1] = cpu_to_be32(qp->ibqp.qp_num);
  361. done:
  362. ret = 1;
  363. goto unlock;
  364. bail:
  365. qp->s_flags &= ~IPATH_S_BUSY;
  366. unlock:
  367. spin_unlock_irqrestore(&qp->s_lock, flags);
  368. return ret;
  369. }
  370. /**
  371. * ipath_ud_rcv - receive an incoming UD packet
  372. * @dev: the device the packet came in on
  373. * @hdr: the packet header
  374. * @has_grh: true if the packet has a GRH
  375. * @data: the packet data
  376. * @tlen: the packet length
  377. * @qp: the QP the packet came on
  378. *
  379. * This is called from ipath_qp_rcv() to process an incoming UD packet
  380. * for the given QP.
  381. * Called at interrupt level.
  382. */
  383. void ipath_ud_rcv(struct ipath_ibdev *dev, struct ipath_ib_header *hdr,
  384. int has_grh, void *data, u32 tlen, struct ipath_qp *qp)
  385. {
  386. struct ipath_other_headers *ohdr;
  387. int opcode;
  388. u32 hdrsize;
  389. u32 pad;
  390. struct ib_wc wc;
  391. u32 qkey;
  392. u32 src_qp;
  393. u16 dlid;
  394. int header_in_data;
  395. /* Check for GRH */
  396. if (!has_grh) {
  397. ohdr = &hdr->u.oth;
  398. hdrsize = 8 + 12 + 8; /* LRH + BTH + DETH */
  399. qkey = be32_to_cpu(ohdr->u.ud.deth[0]);
  400. src_qp = be32_to_cpu(ohdr->u.ud.deth[1]);
  401. header_in_data = 0;
  402. } else {
  403. ohdr = &hdr->u.l.oth;
  404. hdrsize = 8 + 40 + 12 + 8; /* LRH + GRH + BTH + DETH */
  405. /*
  406. * The header with GRH is 68 bytes and the core driver sets
  407. * the eager header buffer size to 56 bytes so the last 12
  408. * bytes of the IB header is in the data buffer.
  409. */
  410. header_in_data = dev->dd->ipath_rcvhdrentsize == 16;
  411. if (header_in_data) {
  412. qkey = be32_to_cpu(((__be32 *) data)[1]);
  413. src_qp = be32_to_cpu(((__be32 *) data)[2]);
  414. data += 12;
  415. } else {
  416. qkey = be32_to_cpu(ohdr->u.ud.deth[0]);
  417. src_qp = be32_to_cpu(ohdr->u.ud.deth[1]);
  418. }
  419. }
  420. src_qp &= IPATH_QPN_MASK;
  421. /*
  422. * Check that the permissive LID is only used on QP0
  423. * and the QKEY matches (see 9.6.1.4.1 and 9.6.1.5.1).
  424. */
  425. if (qp->ibqp.qp_num) {
  426. if (unlikely(hdr->lrh[1] == IB_LID_PERMISSIVE ||
  427. hdr->lrh[3] == IB_LID_PERMISSIVE)) {
  428. dev->n_pkt_drops++;
  429. goto bail;
  430. }
  431. if (unlikely(qkey != qp->qkey)) {
  432. /* XXX OK to lose a count once in a while. */
  433. dev->qkey_violations++;
  434. dev->n_pkt_drops++;
  435. goto bail;
  436. }
  437. } else if (hdr->lrh[1] == IB_LID_PERMISSIVE ||
  438. hdr->lrh[3] == IB_LID_PERMISSIVE) {
  439. struct ib_smp *smp = (struct ib_smp *) data;
  440. if (smp->mgmt_class != IB_MGMT_CLASS_SUBN_DIRECTED_ROUTE) {
  441. dev->n_pkt_drops++;
  442. goto bail;
  443. }
  444. }
  445. /*
  446. * The opcode is in the low byte when its in network order
  447. * (top byte when in host order).
  448. */
  449. opcode = be32_to_cpu(ohdr->bth[0]) >> 24;
  450. if (qp->ibqp.qp_num > 1 &&
  451. opcode == IB_OPCODE_UD_SEND_ONLY_WITH_IMMEDIATE) {
  452. if (header_in_data) {
  453. wc.ex.imm_data = *(__be32 *) data;
  454. data += sizeof(__be32);
  455. } else
  456. wc.ex.imm_data = ohdr->u.ud.imm_data;
  457. wc.wc_flags = IB_WC_WITH_IMM;
  458. hdrsize += sizeof(u32);
  459. } else if (opcode == IB_OPCODE_UD_SEND_ONLY) {
  460. wc.ex.imm_data = 0;
  461. wc.wc_flags = 0;
  462. } else {
  463. dev->n_pkt_drops++;
  464. goto bail;
  465. }
  466. /* Get the number of bytes the message was padded by. */
  467. pad = (be32_to_cpu(ohdr->bth[0]) >> 20) & 3;
  468. if (unlikely(tlen < (hdrsize + pad + 4))) {
  469. /* Drop incomplete packets. */
  470. dev->n_pkt_drops++;
  471. goto bail;
  472. }
  473. tlen -= hdrsize + pad + 4;
  474. /* Drop invalid MAD packets (see 13.5.3.1). */
  475. if (unlikely((qp->ibqp.qp_num == 0 &&
  476. (tlen != 256 ||
  477. (be16_to_cpu(hdr->lrh[0]) >> 12) != 15)) ||
  478. (qp->ibqp.qp_num == 1 &&
  479. (tlen != 256 ||
  480. (be16_to_cpu(hdr->lrh[0]) >> 12) == 15)))) {
  481. dev->n_pkt_drops++;
  482. goto bail;
  483. }
  484. /*
  485. * A GRH is expected to preceed the data even if not
  486. * present on the wire.
  487. */
  488. wc.byte_len = tlen + sizeof(struct ib_grh);
  489. /*
  490. * Get the next work request entry to find where to put the data.
  491. */
  492. if (qp->r_flags & IPATH_R_REUSE_SGE)
  493. qp->r_flags &= ~IPATH_R_REUSE_SGE;
  494. else if (!ipath_get_rwqe(qp, 0)) {
  495. /*
  496. * Count VL15 packets dropped due to no receive buffer.
  497. * Otherwise, count them as buffer overruns since usually,
  498. * the HW will be able to receive packets even if there are
  499. * no QPs with posted receive buffers.
  500. */
  501. if (qp->ibqp.qp_num == 0)
  502. dev->n_vl15_dropped++;
  503. else
  504. dev->rcv_errors++;
  505. goto bail;
  506. }
  507. /* Silently drop packets which are too big. */
  508. if (wc.byte_len > qp->r_len) {
  509. qp->r_flags |= IPATH_R_REUSE_SGE;
  510. dev->n_pkt_drops++;
  511. goto bail;
  512. }
  513. if (has_grh) {
  514. ipath_copy_sge(&qp->r_sge, &hdr->u.l.grh,
  515. sizeof(struct ib_grh));
  516. wc.wc_flags |= IB_WC_GRH;
  517. } else
  518. ipath_skip_sge(&qp->r_sge, sizeof(struct ib_grh));
  519. ipath_copy_sge(&qp->r_sge, data,
  520. wc.byte_len - sizeof(struct ib_grh));
  521. if (!test_and_clear_bit(IPATH_R_WRID_VALID, &qp->r_aflags))
  522. goto bail;
  523. wc.wr_id = qp->r_wr_id;
  524. wc.status = IB_WC_SUCCESS;
  525. wc.opcode = IB_WC_RECV;
  526. wc.vendor_err = 0;
  527. wc.qp = &qp->ibqp;
  528. wc.src_qp = src_qp;
  529. /* XXX do we know which pkey matched? Only needed for GSI. */
  530. wc.pkey_index = 0;
  531. wc.slid = be16_to_cpu(hdr->lrh[3]);
  532. wc.sl = (be16_to_cpu(hdr->lrh[0]) >> 4) & 0xF;
  533. dlid = be16_to_cpu(hdr->lrh[1]);
  534. /*
  535. * Save the LMC lower bits if the destination LID is a unicast LID.
  536. */
  537. wc.dlid_path_bits = dlid >= IPATH_MULTICAST_LID_BASE ? 0 :
  538. dlid & ((1 << dev->dd->ipath_lmc) - 1);
  539. wc.port_num = 1;
  540. /* Signal completion event if the solicited bit is set. */
  541. ipath_cq_enter(to_icq(qp->ibqp.recv_cq), &wc,
  542. (ohdr->bth[0] &
  543. __constant_cpu_to_be32(1 << 23)) != 0);
  544. bail:;
  545. }