ipath_ud.c 15 KB

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