ipath_ud.c 16 KB

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