ipath_ud.c 16 KB

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