4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2012, 2016, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
32 * lnet/lnet/lib-move.c
34 * Data movement routines
37 #define DEBUG_SUBSYSTEM S_LNET
39 #include <lnet/lib-lnet.h>
40 #include <linux/nsproxy.h>
41 #include <net/net_namespace.h>
43 static int local_nid_dist_zero = 1;
44 module_param(local_nid_dist_zero, int, 0444);
45 MODULE_PARM_DESC(local_nid_dist_zero, "Reserved");
48 lnet_fail_nid(lnet_nid_t nid, unsigned int threshold)
50 struct lnet_test_peer *tp;
52 struct list_head *next;
53 struct list_head cull;
55 /* NB: use lnet_net_lock(0) to serialize operations on test peers */
57 /* Adding a new entry */
58 LIBCFS_ALLOC(tp, sizeof(*tp));
63 tp->tp_threshold = threshold;
66 list_add_tail(&tp->tp_list, &the_lnet.ln_test_peers);
71 /* removing entries */
72 INIT_LIST_HEAD(&cull);
76 list_for_each_safe(el, next, &the_lnet.ln_test_peers) {
77 tp = list_entry(el, struct lnet_test_peer, tp_list);
79 if (tp->tp_threshold == 0 || /* needs culling anyway */
80 nid == LNET_NID_ANY || /* removing all entries */
81 tp->tp_nid == nid) { /* matched this one */
82 list_del(&tp->tp_list);
83 list_add(&tp->tp_list, &cull);
89 while (!list_empty(&cull)) {
90 tp = list_entry(cull.next, struct lnet_test_peer, tp_list);
92 list_del(&tp->tp_list);
93 LIBCFS_FREE(tp, sizeof(*tp));
99 fail_peer (lnet_nid_t nid, int outgoing)
101 struct lnet_test_peer *tp;
102 struct list_head *el;
103 struct list_head *next;
104 struct list_head cull;
107 INIT_LIST_HEAD(&cull);
109 /* NB: use lnet_net_lock(0) to serialize operations on test peers */
112 list_for_each_safe(el, next, &the_lnet.ln_test_peers) {
113 tp = list_entry(el, struct lnet_test_peer, tp_list);
115 if (tp->tp_threshold == 0) {
118 /* only cull zombies on outgoing tests,
119 * since we may be at interrupt priority on
120 * incoming messages. */
121 list_del(&tp->tp_list);
122 list_add(&tp->tp_list, &cull);
127 if (tp->tp_nid == LNET_NID_ANY || /* fail every peer */
128 nid == tp->tp_nid) { /* fail this peer */
131 if (tp->tp_threshold != LNET_MD_THRESH_INF) {
134 tp->tp_threshold == 0) {
136 list_del(&tp->tp_list);
137 list_add(&tp->tp_list, &cull);
146 while (!list_empty(&cull)) {
147 tp = list_entry(cull.next, struct lnet_test_peer, tp_list);
148 list_del(&tp->tp_list);
150 LIBCFS_FREE(tp, sizeof(*tp));
157 lnet_iov_nob(unsigned int niov, struct kvec *iov)
159 unsigned int nob = 0;
161 LASSERT(niov == 0 || iov != NULL);
163 nob += (iov++)->iov_len;
167 EXPORT_SYMBOL(lnet_iov_nob);
170 lnet_copy_iov2iov(unsigned int ndiov, struct kvec *diov, unsigned int doffset,
171 unsigned int nsiov, struct kvec *siov, unsigned int soffset,
174 /* NB diov, siov are READ-ONLY */
175 unsigned int this_nob;
180 /* skip complete frags before 'doffset' */
182 while (doffset >= diov->iov_len) {
183 doffset -= diov->iov_len;
189 /* skip complete frags before 'soffset' */
191 while (soffset >= siov->iov_len) {
192 soffset -= siov->iov_len;
201 this_nob = MIN(diov->iov_len - doffset,
202 siov->iov_len - soffset);
203 this_nob = MIN(this_nob, nob);
205 memcpy((char *)diov->iov_base + doffset,
206 (char *)siov->iov_base + soffset, this_nob);
209 if (diov->iov_len > doffset + this_nob) {
217 if (siov->iov_len > soffset + this_nob) {
226 EXPORT_SYMBOL(lnet_copy_iov2iov);
229 lnet_extract_iov(int dst_niov, struct kvec *dst,
230 int src_niov, struct kvec *src,
231 unsigned int offset, unsigned int len)
233 /* Initialise 'dst' to the subset of 'src' starting at 'offset',
234 * for exactly 'len' bytes, and return the number of entries.
235 * NB not destructive to 'src' */
236 unsigned int frag_len;
239 if (len == 0) /* no data => */
240 return (0); /* no frags */
242 LASSERT(src_niov > 0);
243 while (offset >= src->iov_len) { /* skip initial frags */
244 offset -= src->iov_len;
247 LASSERT(src_niov > 0);
252 LASSERT(src_niov > 0);
253 LASSERT((int)niov <= dst_niov);
255 frag_len = src->iov_len - offset;
256 dst->iov_base = ((char *)src->iov_base) + offset;
258 if (len <= frag_len) {
263 dst->iov_len = frag_len;
273 EXPORT_SYMBOL(lnet_extract_iov);
277 lnet_kiov_nob(unsigned int niov, lnet_kiov_t *kiov)
279 unsigned int nob = 0;
281 LASSERT(niov == 0 || kiov != NULL);
283 nob += (kiov++)->kiov_len;
287 EXPORT_SYMBOL(lnet_kiov_nob);
290 lnet_copy_kiov2kiov(unsigned int ndiov, lnet_kiov_t *diov, unsigned int doffset,
291 unsigned int nsiov, lnet_kiov_t *siov, unsigned int soffset,
294 /* NB diov, siov are READ-ONLY */
295 unsigned int this_nob;
302 LASSERT (!in_interrupt ());
305 while (doffset >= diov->kiov_len) {
306 doffset -= diov->kiov_len;
313 while (soffset >= siov->kiov_len) {
314 soffset -= siov->kiov_len;
323 this_nob = MIN(diov->kiov_len - doffset,
324 siov->kiov_len - soffset);
325 this_nob = MIN(this_nob, nob);
328 daddr = ((char *)kmap(diov->kiov_page)) +
329 diov->kiov_offset + doffset;
331 saddr = ((char *)kmap(siov->kiov_page)) +
332 siov->kiov_offset + soffset;
334 /* Vanishing risk of kmap deadlock when mapping 2 pages.
335 * However in practice at least one of the kiovs will be mapped
336 * kernel pages and the map/unmap will be NOOPs */
338 memcpy (daddr, saddr, this_nob);
341 if (diov->kiov_len > doffset + this_nob) {
345 kunmap(diov->kiov_page);
352 if (siov->kiov_len > soffset + this_nob) {
356 kunmap(siov->kiov_page);
365 kunmap(diov->kiov_page);
367 kunmap(siov->kiov_page);
369 EXPORT_SYMBOL(lnet_copy_kiov2kiov);
372 lnet_copy_kiov2iov (unsigned int niov, struct kvec *iov, unsigned int iovoffset,
373 unsigned int nkiov, lnet_kiov_t *kiov, unsigned int kiovoffset,
376 /* NB iov, kiov are READ-ONLY */
377 unsigned int this_nob;
383 LASSERT (!in_interrupt ());
386 while (iovoffset >= iov->iov_len) {
387 iovoffset -= iov->iov_len;
394 while (kiovoffset >= kiov->kiov_len) {
395 kiovoffset -= kiov->kiov_len;
404 this_nob = MIN(iov->iov_len - iovoffset,
405 kiov->kiov_len - kiovoffset);
406 this_nob = MIN(this_nob, nob);
409 addr = ((char *)kmap(kiov->kiov_page)) +
410 kiov->kiov_offset + kiovoffset;
412 memcpy((char *)iov->iov_base + iovoffset, addr, this_nob);
415 if (iov->iov_len > iovoffset + this_nob) {
416 iovoffset += this_nob;
423 if (kiov->kiov_len > kiovoffset + this_nob) {
425 kiovoffset += this_nob;
427 kunmap(kiov->kiov_page);
437 kunmap(kiov->kiov_page);
439 EXPORT_SYMBOL(lnet_copy_kiov2iov);
442 lnet_copy_iov2kiov(unsigned int nkiov, lnet_kiov_t *kiov, unsigned int kiovoffset,
443 unsigned int niov, struct kvec *iov, unsigned int iovoffset,
446 /* NB kiov, iov are READ-ONLY */
447 unsigned int this_nob;
453 LASSERT (!in_interrupt ());
456 while (kiovoffset >= kiov->kiov_len) {
457 kiovoffset -= kiov->kiov_len;
464 while (iovoffset >= iov->iov_len) {
465 iovoffset -= iov->iov_len;
474 this_nob = MIN(kiov->kiov_len - kiovoffset,
475 iov->iov_len - iovoffset);
476 this_nob = MIN(this_nob, nob);
479 addr = ((char *)kmap(kiov->kiov_page)) +
480 kiov->kiov_offset + kiovoffset;
482 memcpy (addr, (char *)iov->iov_base + iovoffset, this_nob);
485 if (kiov->kiov_len > kiovoffset + this_nob) {
487 kiovoffset += this_nob;
489 kunmap(kiov->kiov_page);
496 if (iov->iov_len > iovoffset + this_nob) {
497 iovoffset += this_nob;
506 kunmap(kiov->kiov_page);
508 EXPORT_SYMBOL(lnet_copy_iov2kiov);
511 lnet_extract_kiov(int dst_niov, lnet_kiov_t *dst,
512 int src_niov, lnet_kiov_t *src,
513 unsigned int offset, unsigned int len)
515 /* Initialise 'dst' to the subset of 'src' starting at 'offset',
516 * for exactly 'len' bytes, and return the number of entries.
517 * NB not destructive to 'src' */
518 unsigned int frag_len;
521 if (len == 0) /* no data => */
522 return (0); /* no frags */
524 LASSERT(src_niov > 0);
525 while (offset >= src->kiov_len) { /* skip initial frags */
526 offset -= src->kiov_len;
529 LASSERT(src_niov > 0);
534 LASSERT(src_niov > 0);
535 LASSERT((int)niov <= dst_niov);
537 frag_len = src->kiov_len - offset;
538 dst->kiov_page = src->kiov_page;
539 dst->kiov_offset = src->kiov_offset + offset;
541 if (len <= frag_len) {
543 LASSERT(dst->kiov_offset + dst->kiov_len <= PAGE_SIZE);
547 dst->kiov_len = frag_len;
548 LASSERT(dst->kiov_offset + dst->kiov_len <= PAGE_SIZE);
558 EXPORT_SYMBOL(lnet_extract_kiov);
561 lnet_ni_recv(struct lnet_ni *ni, void *private, struct lnet_msg *msg,
562 int delayed, unsigned int offset, unsigned int mlen,
565 unsigned int niov = 0;
566 struct kvec *iov = NULL;
567 lnet_kiov_t *kiov = NULL;
570 LASSERT (!in_interrupt ());
571 LASSERT (mlen == 0 || msg != NULL);
574 LASSERT(msg->msg_receiving);
575 LASSERT(!msg->msg_sending);
576 LASSERT(rlen == msg->msg_len);
577 LASSERT(mlen <= msg->msg_len);
578 LASSERT(msg->msg_offset == offset);
579 LASSERT(msg->msg_wanted == mlen);
581 msg->msg_receiving = 0;
584 niov = msg->msg_niov;
586 kiov = msg->msg_kiov;
589 LASSERT ((iov == NULL) != (kiov == NULL));
593 rc = (ni->ni_net->net_lnd->lnd_recv)(ni, private, msg, delayed,
594 niov, iov, kiov, offset, mlen,
597 lnet_finalize(msg, rc);
601 lnet_setpayloadbuffer(struct lnet_msg *msg)
603 struct lnet_libmd *md = msg->msg_md;
605 LASSERT(msg->msg_len > 0);
606 LASSERT(!msg->msg_routing);
608 LASSERT(msg->msg_niov == 0);
609 LASSERT(msg->msg_iov == NULL);
610 LASSERT(msg->msg_kiov == NULL);
612 msg->msg_niov = md->md_niov;
613 if ((md->md_options & LNET_MD_KIOV) != 0)
614 msg->msg_kiov = md->md_iov.kiov;
616 msg->msg_iov = md->md_iov.iov;
620 lnet_prep_send(struct lnet_msg *msg, int type, struct lnet_process_id target,
621 unsigned int offset, unsigned int len)
623 msg->msg_type = type;
624 msg->msg_target = target;
626 msg->msg_offset = offset;
629 lnet_setpayloadbuffer(msg);
631 memset (&msg->msg_hdr, 0, sizeof (msg->msg_hdr));
632 msg->msg_hdr.type = cpu_to_le32(type);
633 msg->msg_hdr.dest_pid = cpu_to_le32(target.pid);
634 /* src_nid will be set later */
635 msg->msg_hdr.src_pid = cpu_to_le32(the_lnet.ln_pid);
636 msg->msg_hdr.payload_length = cpu_to_le32(len);
640 lnet_ni_send(struct lnet_ni *ni, struct lnet_msg *msg)
642 void *priv = msg->msg_private;
645 LASSERT (!in_interrupt ());
646 LASSERT (LNET_NETTYP(LNET_NIDNET(ni->ni_nid)) == LOLND ||
647 (msg->msg_txcredit && msg->msg_peertxcredit));
649 rc = (ni->ni_net->net_lnd->lnd_send)(ni, priv, msg);
651 lnet_finalize(msg, rc);
655 lnet_ni_eager_recv(struct lnet_ni *ni, struct lnet_msg *msg)
659 LASSERT(!msg->msg_sending);
660 LASSERT(msg->msg_receiving);
661 LASSERT(!msg->msg_rx_ready_delay);
662 LASSERT(ni->ni_net->net_lnd->lnd_eager_recv != NULL);
664 msg->msg_rx_ready_delay = 1;
665 rc = (ni->ni_net->net_lnd->lnd_eager_recv)(ni, msg->msg_private, msg,
668 CERROR("recv from %s / send to %s aborted: "
669 "eager_recv failed %d\n",
670 libcfs_nid2str(msg->msg_rxpeer->lpni_nid),
671 libcfs_id2str(msg->msg_target), rc);
672 LASSERT(rc < 0); /* required by my callers */
679 * This function can be called from two paths:
680 * 1. when sending a message
681 * 2. when decommiting a message (lnet_msg_decommit_tx())
682 * In both these cases the peer_ni should have it's reference count
683 * acquired by the caller and therefore it is safe to drop the spin
684 * lock before calling lnd_query()
687 lnet_ni_query_locked(struct lnet_ni *ni, struct lnet_peer_ni *lp)
689 cfs_time_t last_alive = 0;
690 int cpt = lnet_cpt_of_nid_locked(lp->lpni_nid, ni);
692 LASSERT(lnet_peer_aliveness_enabled(lp));
693 LASSERT(ni->ni_net->net_lnd->lnd_query != NULL);
695 lnet_net_unlock(cpt);
696 (ni->ni_net->net_lnd->lnd_query)(ni, lp->lpni_nid, &last_alive);
699 lp->lpni_last_query = cfs_time_current();
701 if (last_alive != 0) /* NI has updated timestamp */
702 lp->lpni_last_alive = last_alive;
705 /* NB: always called with lnet_net_lock held */
707 lnet_peer_is_alive (struct lnet_peer_ni *lp, cfs_time_t now)
712 LASSERT (lnet_peer_aliveness_enabled(lp));
715 * Trust lnet_notify() if it has more recent aliveness news, but
716 * ignore the initial assumed death (see lnet_peers_start_down()).
718 spin_lock(&lp->lpni_lock);
719 if (!lp->lpni_alive && lp->lpni_alive_count > 0 &&
720 cfs_time_aftereq(lp->lpni_timestamp, lp->lpni_last_alive)) {
721 spin_unlock(&lp->lpni_lock);
726 cfs_time_add(lp->lpni_last_alive,
727 cfs_time_seconds(lp->lpni_net->net_tunables.
729 alive = cfs_time_after(deadline, now);
732 * Update obsolete lp_alive except for routers assumed to be dead
733 * initially, because router checker would update aliveness in this
734 * case, and moreover lpni_last_alive at peer creation is assumed.
736 if (alive && !lp->lpni_alive &&
737 !(lnet_isrouter(lp) && lp->lpni_alive_count == 0)) {
738 spin_unlock(&lp->lpni_lock);
739 lnet_notify_locked(lp, 0, 1, lp->lpni_last_alive);
741 spin_unlock(&lp->lpni_lock);
748 /* NB: returns 1 when alive, 0 when dead, negative when error;
749 * may drop the lnet_net_lock */
751 lnet_peer_alive_locked (struct lnet_ni *ni, struct lnet_peer_ni *lp)
753 cfs_time_t now = cfs_time_current();
755 if (!lnet_peer_aliveness_enabled(lp))
758 if (lnet_peer_is_alive(lp, now))
762 * Peer appears dead, but we should avoid frequent NI queries (at
763 * most once per lnet_queryinterval seconds).
765 if (lp->lpni_last_query != 0) {
766 static const int lnet_queryinterval = 1;
768 cfs_time_t next_query =
769 cfs_time_add(lp->lpni_last_query,
770 cfs_time_seconds(lnet_queryinterval));
772 if (cfs_time_before(now, next_query)) {
774 CWARN("Unexpected aliveness of peer %s: "
776 libcfs_nid2str(lp->lpni_nid),
777 (int)now, (int)next_query,
779 lp->lpni_net->net_tunables.lct_peer_timeout);
784 /* query NI for latest aliveness news */
785 lnet_ni_query_locked(ni, lp);
787 if (lnet_peer_is_alive(lp, now))
790 lnet_notify_locked(lp, 0, 0, lp->lpni_last_alive);
795 * \param msg The message to be sent.
796 * \param do_send True if lnet_ni_send() should be called in this function.
797 * lnet_send() is going to lnet_net_unlock immediately after this, so
798 * it sets do_send FALSE and I don't do the unlock/send/lock bit.
800 * \retval LNET_CREDIT_OK If \a msg sent or OK to send.
801 * \retval LNET_CREDIT_WAIT If \a msg blocked for credit.
802 * \retval -EHOSTUNREACH If the next hop of the message appears dead.
803 * \retval -ECANCELED If the MD of the message has been unlinked.
806 lnet_post_send_locked(struct lnet_msg *msg, int do_send)
808 struct lnet_peer_ni *lp = msg->msg_txpeer;
809 struct lnet_ni *ni = msg->msg_txni;
810 int cpt = msg->msg_tx_cpt;
811 struct lnet_tx_queue *tq = ni->ni_tx_queues[cpt];
813 /* non-lnet_send() callers have checked before */
814 LASSERT(!do_send || msg->msg_tx_delayed);
815 LASSERT(!msg->msg_receiving);
816 LASSERT(msg->msg_tx_committed);
818 /* NB 'lp' is always the next hop */
819 if ((msg->msg_target.pid & LNET_PID_USERFLAG) == 0 &&
820 lnet_peer_alive_locked(ni, lp) == 0) {
821 the_lnet.ln_counters[cpt]->drop_count++;
822 the_lnet.ln_counters[cpt]->drop_length += msg->msg_len;
823 lnet_net_unlock(cpt);
825 atomic_inc(&msg->msg_txpeer->lpni_stats.drop_count);
827 atomic_inc(&msg->msg_txni->ni_stats.drop_count);
829 CNETERR("Dropping message for %s: peer not alive\n",
830 libcfs_id2str(msg->msg_target));
832 lnet_finalize(msg, -EHOSTUNREACH);
835 return -EHOSTUNREACH;
838 if (msg->msg_md != NULL &&
839 (msg->msg_md->md_flags & LNET_MD_FLAG_ABORTED) != 0) {
840 lnet_net_unlock(cpt);
842 CNETERR("Aborting message for %s: LNetM[DE]Unlink() already "
843 "called on the MD/ME.\n",
844 libcfs_id2str(msg->msg_target));
846 lnet_finalize(msg, -ECANCELED);
852 if (!msg->msg_peertxcredit) {
853 spin_lock(&lp->lpni_lock);
854 LASSERT((lp->lpni_txcredits < 0) ==
855 !list_empty(&lp->lpni_txq));
857 msg->msg_peertxcredit = 1;
858 lp->lpni_txqnob += msg->msg_len + sizeof(struct lnet_hdr);
859 lp->lpni_txcredits--;
861 if (lp->lpni_txcredits < lp->lpni_mintxcredits)
862 lp->lpni_mintxcredits = lp->lpni_txcredits;
864 if (lp->lpni_txcredits < 0) {
865 msg->msg_tx_delayed = 1;
866 list_add_tail(&msg->msg_list, &lp->lpni_txq);
867 spin_unlock(&lp->lpni_lock);
868 return LNET_CREDIT_WAIT;
870 spin_unlock(&lp->lpni_lock);
873 if (!msg->msg_txcredit) {
874 LASSERT((tq->tq_credits < 0) ==
875 !list_empty(&tq->tq_delayed));
877 msg->msg_txcredit = 1;
879 atomic_dec(&ni->ni_tx_credits);
881 if (tq->tq_credits < tq->tq_credits_min)
882 tq->tq_credits_min = tq->tq_credits;
884 if (tq->tq_credits < 0) {
885 msg->msg_tx_delayed = 1;
886 list_add_tail(&msg->msg_list, &tq->tq_delayed);
887 return LNET_CREDIT_WAIT;
892 lnet_net_unlock(cpt);
893 lnet_ni_send(ni, msg);
896 return LNET_CREDIT_OK;
900 static struct lnet_rtrbufpool *
901 lnet_msg2bufpool(struct lnet_msg *msg)
903 struct lnet_rtrbufpool *rbp;
906 LASSERT(msg->msg_rx_committed);
908 cpt = msg->msg_rx_cpt;
909 rbp = &the_lnet.ln_rtrpools[cpt][0];
911 LASSERT(msg->msg_len <= LNET_MTU);
912 while (msg->msg_len > (unsigned int)rbp->rbp_npages * PAGE_SIZE) {
914 LASSERT(rbp < &the_lnet.ln_rtrpools[cpt][LNET_NRBPOOLS]);
921 lnet_post_routed_recv_locked(struct lnet_msg *msg, int do_recv)
923 /* lnet_parse is going to lnet_net_unlock immediately after this, so it
924 * sets do_recv FALSE and I don't do the unlock/send/lock bit.
925 * I return LNET_CREDIT_WAIT if msg blocked and LNET_CREDIT_OK if
926 * received or OK to receive */
927 struct lnet_peer_ni *lp = msg->msg_rxpeer;
928 struct lnet_rtrbufpool *rbp;
929 struct lnet_rtrbuf *rb;
931 LASSERT (msg->msg_iov == NULL);
932 LASSERT (msg->msg_kiov == NULL);
933 LASSERT (msg->msg_niov == 0);
934 LASSERT (msg->msg_routing);
935 LASSERT (msg->msg_receiving);
936 LASSERT (!msg->msg_sending);
938 /* non-lnet_parse callers only receive delayed messages */
939 LASSERT(!do_recv || msg->msg_rx_delayed);
941 if (!msg->msg_peerrtrcredit) {
942 spin_lock(&lp->lpni_lock);
943 LASSERT((lp->lpni_rtrcredits < 0) ==
944 !list_empty(&lp->lpni_rtrq));
946 msg->msg_peerrtrcredit = 1;
947 lp->lpni_rtrcredits--;
948 if (lp->lpni_rtrcredits < lp->lpni_minrtrcredits)
949 lp->lpni_minrtrcredits = lp->lpni_rtrcredits;
951 if (lp->lpni_rtrcredits < 0) {
952 /* must have checked eager_recv before here */
953 LASSERT(msg->msg_rx_ready_delay);
954 msg->msg_rx_delayed = 1;
955 list_add_tail(&msg->msg_list, &lp->lpni_rtrq);
956 spin_unlock(&lp->lpni_lock);
957 return LNET_CREDIT_WAIT;
959 spin_unlock(&lp->lpni_lock);
962 rbp = lnet_msg2bufpool(msg);
964 if (!msg->msg_rtrcredit) {
965 msg->msg_rtrcredit = 1;
967 if (rbp->rbp_credits < rbp->rbp_mincredits)
968 rbp->rbp_mincredits = rbp->rbp_credits;
970 if (rbp->rbp_credits < 0) {
971 /* must have checked eager_recv before here */
972 LASSERT(msg->msg_rx_ready_delay);
973 msg->msg_rx_delayed = 1;
974 list_add_tail(&msg->msg_list, &rbp->rbp_msgs);
975 return LNET_CREDIT_WAIT;
979 LASSERT(!list_empty(&rbp->rbp_bufs));
980 rb = list_entry(rbp->rbp_bufs.next, struct lnet_rtrbuf, rb_list);
981 list_del(&rb->rb_list);
983 msg->msg_niov = rbp->rbp_npages;
984 msg->msg_kiov = &rb->rb_kiov[0];
987 int cpt = msg->msg_rx_cpt;
989 lnet_net_unlock(cpt);
990 lnet_ni_recv(msg->msg_rxni, msg->msg_private, msg, 1,
991 0, msg->msg_len, msg->msg_len);
994 return LNET_CREDIT_OK;
998 lnet_return_tx_credits_locked(struct lnet_msg *msg)
1000 struct lnet_peer_ni *txpeer = msg->msg_txpeer;
1001 struct lnet_ni *txni = msg->msg_txni;
1002 struct lnet_msg *msg2;
1004 if (msg->msg_txcredit) {
1005 struct lnet_ni *ni = msg->msg_txni;
1006 struct lnet_tx_queue *tq = ni->ni_tx_queues[msg->msg_tx_cpt];
1008 /* give back NI txcredits */
1009 msg->msg_txcredit = 0;
1011 LASSERT((tq->tq_credits < 0) ==
1012 !list_empty(&tq->tq_delayed));
1015 atomic_inc(&ni->ni_tx_credits);
1016 if (tq->tq_credits <= 0) {
1017 msg2 = list_entry(tq->tq_delayed.next,
1018 struct lnet_msg, msg_list);
1019 list_del(&msg2->msg_list);
1021 LASSERT(msg2->msg_txni == ni);
1022 LASSERT(msg2->msg_tx_delayed);
1023 LASSERT(msg2->msg_tx_cpt == msg->msg_tx_cpt);
1025 (void) lnet_post_send_locked(msg2, 1);
1029 if (msg->msg_peertxcredit) {
1030 /* give back peer txcredits */
1031 msg->msg_peertxcredit = 0;
1033 spin_lock(&txpeer->lpni_lock);
1034 LASSERT((txpeer->lpni_txcredits < 0) ==
1035 !list_empty(&txpeer->lpni_txq));
1037 txpeer->lpni_txqnob -= msg->msg_len + sizeof(struct lnet_hdr);
1038 LASSERT(txpeer->lpni_txqnob >= 0);
1040 txpeer->lpni_txcredits++;
1041 if (txpeer->lpni_txcredits <= 0) {
1042 msg2 = list_entry(txpeer->lpni_txq.next,
1043 struct lnet_msg, msg_list);
1044 list_del(&msg2->msg_list);
1045 spin_unlock(&txpeer->lpni_lock);
1047 LASSERT(msg2->msg_txpeer == txpeer);
1048 LASSERT(msg2->msg_tx_delayed);
1050 if (msg2->msg_tx_cpt != msg->msg_tx_cpt) {
1051 lnet_net_unlock(msg->msg_tx_cpt);
1052 lnet_net_lock(msg2->msg_tx_cpt);
1054 (void) lnet_post_send_locked(msg2, 1);
1055 if (msg2->msg_tx_cpt != msg->msg_tx_cpt) {
1056 lnet_net_unlock(msg2->msg_tx_cpt);
1057 lnet_net_lock(msg->msg_tx_cpt);
1060 spin_unlock(&txpeer->lpni_lock);
1065 msg->msg_txni = NULL;
1066 lnet_ni_decref_locked(txni, msg->msg_tx_cpt);
1069 if (txpeer != NULL) {
1072 * Once the patch for the health comes in we need to set
1073 * the health of the peer ni to bad when we fail to send
1075 * int status = msg->msg_ev.status;
1077 * lnet_set_peer_ni_health_locked(txpeer, false)
1079 msg->msg_txpeer = NULL;
1080 lnet_peer_ni_decref_locked(txpeer);
1085 lnet_schedule_blocked_locked(struct lnet_rtrbufpool *rbp)
1087 struct lnet_msg *msg;
1089 if (list_empty(&rbp->rbp_msgs))
1091 msg = list_entry(rbp->rbp_msgs.next,
1092 struct lnet_msg, msg_list);
1093 list_del(&msg->msg_list);
1095 (void)lnet_post_routed_recv_locked(msg, 1);
1099 lnet_drop_routed_msgs_locked(struct list_head *list, int cpt)
1101 struct lnet_msg *msg;
1102 struct lnet_msg *tmp;
1104 lnet_net_unlock(cpt);
1106 list_for_each_entry_safe(msg, tmp, list, msg_list) {
1107 lnet_ni_recv(msg->msg_rxni, msg->msg_private, NULL,
1108 0, 0, 0, msg->msg_hdr.payload_length);
1109 list_del_init(&msg->msg_list);
1110 lnet_finalize(msg, -ECANCELED);
1117 lnet_return_rx_credits_locked(struct lnet_msg *msg)
1119 struct lnet_peer_ni *rxpeer = msg->msg_rxpeer;
1120 struct lnet_ni *rxni = msg->msg_rxni;
1121 struct lnet_msg *msg2;
1123 if (msg->msg_rtrcredit) {
1124 /* give back global router credits */
1125 struct lnet_rtrbuf *rb;
1126 struct lnet_rtrbufpool *rbp;
1128 /* NB If a msg ever blocks for a buffer in rbp_msgs, it stays
1129 * there until it gets one allocated, or aborts the wait
1131 LASSERT(msg->msg_kiov != NULL);
1133 rb = list_entry(msg->msg_kiov, struct lnet_rtrbuf, rb_kiov[0]);
1136 msg->msg_kiov = NULL;
1137 msg->msg_rtrcredit = 0;
1139 LASSERT(rbp == lnet_msg2bufpool(msg));
1141 LASSERT((rbp->rbp_credits > 0) ==
1142 !list_empty(&rbp->rbp_bufs));
1144 /* If routing is now turned off, we just drop this buffer and
1145 * don't bother trying to return credits. */
1146 if (!the_lnet.ln_routing) {
1147 lnet_destroy_rtrbuf(rb, rbp->rbp_npages);
1151 /* It is possible that a user has lowered the desired number of
1152 * buffers in this pool. Make sure we never put back
1153 * more buffers than the stated number. */
1154 if (unlikely(rbp->rbp_credits >= rbp->rbp_req_nbuffers)) {
1155 /* Discard this buffer so we don't have too
1157 lnet_destroy_rtrbuf(rb, rbp->rbp_npages);
1158 rbp->rbp_nbuffers--;
1160 list_add(&rb->rb_list, &rbp->rbp_bufs);
1162 if (rbp->rbp_credits <= 0)
1163 lnet_schedule_blocked_locked(rbp);
1168 if (msg->msg_peerrtrcredit) {
1169 /* give back peer router credits */
1170 msg->msg_peerrtrcredit = 0;
1172 spin_lock(&rxpeer->lpni_lock);
1173 LASSERT((rxpeer->lpni_rtrcredits < 0) ==
1174 !list_empty(&rxpeer->lpni_rtrq));
1176 rxpeer->lpni_rtrcredits++;
1178 /* drop all messages which are queued to be routed on that
1180 if (!the_lnet.ln_routing) {
1181 struct list_head drop;
1182 INIT_LIST_HEAD(&drop);
1183 list_splice_init(&rxpeer->lpni_rtrq, &drop);
1184 spin_unlock(&rxpeer->lpni_lock);
1185 lnet_drop_routed_msgs_locked(&drop, msg->msg_rx_cpt);
1186 } else if (rxpeer->lpni_rtrcredits <= 0) {
1187 msg2 = list_entry(rxpeer->lpni_rtrq.next,
1188 struct lnet_msg, msg_list);
1189 list_del(&msg2->msg_list);
1190 spin_unlock(&rxpeer->lpni_lock);
1191 (void) lnet_post_routed_recv_locked(msg2, 1);
1193 spin_unlock(&rxpeer->lpni_lock);
1197 msg->msg_rxni = NULL;
1198 lnet_ni_decref_locked(rxni, msg->msg_rx_cpt);
1200 if (rxpeer != NULL) {
1201 msg->msg_rxpeer = NULL;
1202 lnet_peer_ni_decref_locked(rxpeer);
1207 lnet_compare_peers(struct lnet_peer_ni *p1, struct lnet_peer_ni *p2)
1209 if (p1->lpni_txqnob < p2->lpni_txqnob)
1212 if (p1->lpni_txqnob > p2->lpni_txqnob)
1215 if (p1->lpni_txcredits > p2->lpni_txcredits)
1218 if (p1->lpni_txcredits < p2->lpni_txcredits)
1225 lnet_compare_routes(struct lnet_route *r1, struct lnet_route *r2)
1227 struct lnet_peer_ni *p1 = r1->lr_gateway;
1228 struct lnet_peer_ni *p2 = r2->lr_gateway;
1229 int r1_hops = (r1->lr_hops == LNET_UNDEFINED_HOPS) ? 1 : r1->lr_hops;
1230 int r2_hops = (r2->lr_hops == LNET_UNDEFINED_HOPS) ? 1 : r2->lr_hops;
1233 if (r1->lr_priority < r2->lr_priority)
1236 if (r1->lr_priority > r2->lr_priority)
1239 if (r1_hops < r2_hops)
1242 if (r1_hops > r2_hops)
1245 rc = lnet_compare_peers(p1, p2);
1249 if (r1->lr_seq - r2->lr_seq <= 0)
1255 static struct lnet_peer_ni *
1256 lnet_find_route_locked(struct lnet_net *net, lnet_nid_t target,
1259 struct lnet_remotenet *rnet;
1260 struct lnet_route *route;
1261 struct lnet_route *best_route;
1262 struct lnet_route *last_route;
1263 struct lnet_peer_ni *lpni_best;
1264 struct lnet_peer_ni *lp;
1267 /* If @rtr_nid is not LNET_NID_ANY, return the gateway with
1268 * rtr_nid nid, otherwise find the best gateway I can use */
1270 rnet = lnet_find_rnet_locked(LNET_NIDNET(target));
1275 best_route = last_route = NULL;
1276 list_for_each_entry(route, &rnet->lrn_routes, lr_list) {
1277 lp = route->lr_gateway;
1279 if (!lnet_is_route_alive(route))
1282 if (net != NULL && lp->lpni_net != net)
1285 if (lp->lpni_nid == rtr_nid) /* it's pre-determined router */
1288 if (lpni_best == NULL) {
1289 best_route = last_route = route;
1294 /* no protection on below fields, but it's harmless */
1295 if (last_route->lr_seq - route->lr_seq < 0)
1298 rc = lnet_compare_routes(route, best_route);
1306 /* set sequence number on the best router to the latest sequence + 1
1307 * so we can round-robin all routers, it's race and inaccurate but
1308 * harmless and functional */
1309 if (best_route != NULL)
1310 best_route->lr_seq = last_route->lr_seq + 1;
1314 static struct lnet_ni *
1315 lnet_get_best_ni(struct lnet_net *local_net, struct lnet_ni *cur_ni,
1318 struct lnet_ni *ni = NULL, *best_ni = cur_ni;
1319 unsigned int shortest_distance;
1322 if (best_ni == NULL) {
1323 shortest_distance = UINT_MAX;
1324 best_credits = INT_MIN;
1326 shortest_distance = cfs_cpt_distance(lnet_cpt_table(), md_cpt,
1327 best_ni->ni_dev_cpt);
1328 best_credits = atomic_read(&best_ni->ni_tx_credits);
1331 while ((ni = lnet_get_next_ni_locked(local_net, ni))) {
1332 unsigned int distance;
1335 if (!lnet_is_ni_healthy_locked(ni))
1338 ni_credits = atomic_read(&ni->ni_tx_credits);
1341 * calculate the distance from the CPT on which
1342 * the message memory is allocated to the CPT of
1343 * the NI's physical device
1345 distance = cfs_cpt_distance(lnet_cpt_table(),
1350 * All distances smaller than the NUMA range
1351 * are treated equally.
1353 if (distance < lnet_numa_range)
1354 distance = lnet_numa_range;
1357 * Select on shorter distance, then available
1358 * credits, then round-robin.
1360 if (distance > shortest_distance) {
1362 } else if (distance < shortest_distance) {
1363 shortest_distance = distance;
1364 } else if (ni_credits < best_credits) {
1366 } else if (ni_credits == best_credits) {
1367 if (best_ni && (best_ni)->ni_seq <= ni->ni_seq)
1371 best_credits = ni_credits;
1378 lnet_select_pathway(lnet_nid_t src_nid, lnet_nid_t dst_nid,
1379 struct lnet_msg *msg, lnet_nid_t rtr_nid)
1381 struct lnet_ni *best_ni;
1382 struct lnet_peer_ni *best_lpni;
1383 struct lnet_peer_ni *best_gw;
1384 struct lnet_peer_ni *lpni;
1385 struct lnet_peer_ni *final_dst;
1386 struct lnet_peer *peer;
1387 struct lnet_peer_net *peer_net;
1388 struct lnet_net *local_net;
1396 int best_lpni_credits;
1400 * get an initial CPT to use for locking. The idea here is not to
1401 * serialize the calls to select_pathway, so that as many
1402 * operations can run concurrently as possible. To do that we use
1403 * the CPT where this call is being executed. Later on when we
1404 * determine the CPT to use in lnet_message_commit, we switch the
1405 * lock and check if there was any configuration change. If none,
1406 * then we proceed, if there is, then we restart the operation.
1408 cpt = lnet_net_lock_current();
1410 md_cpt = lnet_cpt_of_md(msg->msg_md);
1411 if (md_cpt == CFS_CPT_ANY)
1422 local_found = false;
1424 seq = lnet_get_dlc_seq_locked();
1426 if (the_lnet.ln_state != LNET_STATE_RUNNING) {
1427 lnet_net_unlock(cpt);
1431 peer = lnet_find_or_create_peer_locked(dst_nid, cpt);
1433 lnet_net_unlock(cpt);
1434 return PTR_ERR(peer);
1437 /* If peer is not healthy then can not send anything to it */
1438 if (!lnet_is_peer_healthy_locked(peer)) {
1439 lnet_net_unlock(cpt);
1440 return -EHOSTUNREACH;
1443 if (!peer->lp_multi_rail && lnet_get_num_peer_nis(peer) > 1) {
1444 CERROR("peer %s is declared to be non MR capable, "
1445 "yet configured with more than one NID\n",
1446 libcfs_nid2str(dst_nid));
1451 * STEP 1: first jab at determining best_ni
1452 * if src_nid is explicitly specified, then best_ni is already
1453 * pre-determiend for us. Otherwise we need to select the best
1454 * one to use later on
1456 if (src_nid != LNET_NID_ANY) {
1457 best_ni = lnet_nid2ni_locked(src_nid, cpt);
1459 lnet_net_unlock(cpt);
1460 LCONSOLE_WARN("Can't send to %s: src %s is not a "
1461 "local nid\n", libcfs_nid2str(dst_nid),
1462 libcfs_nid2str(src_nid));
1467 if (msg->msg_type == LNET_MSG_REPLY ||
1468 msg->msg_type == LNET_MSG_ACK ||
1469 !peer->lp_multi_rail ||
1472 * for replies we want to respond on the same peer_ni we
1473 * received the message on if possible. If not, then pick
1474 * a peer_ni to send to
1476 * if the peer is non-multi-rail then you want to send to
1477 * the dst_nid provided as well.
1479 * If the best_ni has already been determined, IE the
1480 * src_nid has been specified, then use the
1481 * destination_nid provided as well, since we're
1482 * continuing a series of related messages for the same
1485 * It is expected to find the lpni using dst_nid, since we
1486 * created it earlier.
1488 best_lpni = lnet_find_peer_ni_locked(dst_nid);
1490 lnet_peer_ni_decref_locked(best_lpni);
1492 if (best_lpni && !lnet_get_net_locked(LNET_NIDNET(dst_nid))) {
1494 * this lpni is not on a local network so we need
1495 * to route this reply.
1497 best_gw = lnet_find_route_locked(NULL,
1498 best_lpni->lpni_nid,
1502 * RULE: Each node considers only the next-hop
1504 * We're going to route the message, so change the peer to
1507 LASSERT(best_gw->lpni_peer_net);
1508 LASSERT(best_gw->lpni_peer_net->lpn_peer);
1509 peer = best_gw->lpni_peer_net->lpn_peer;
1512 * if the router is not multi-rail then use the best_gw
1513 * found to send the message to
1515 if (!peer->lp_multi_rail)
1516 best_lpni = best_gw;
1524 } else if (!best_lpni) {
1525 lnet_net_unlock(cpt);
1526 CERROR("unable to send msg_type %d to "
1527 "originating %s. Destination NID not in DB\n",
1528 msg->msg_type, libcfs_nid2str(dst_nid));
1534 * if the peer is not MR capable, then we should always send to it
1535 * using the first NI in the NET we determined.
1537 if (!peer->lp_multi_rail) {
1539 lnet_net_unlock(cpt);
1540 CERROR("no route to %s\n",
1541 libcfs_nid2str(dst_nid));
1542 return -EHOSTUNREACH;
1545 /* best ni could be set because src_nid was provided */
1547 best_ni = lnet_net2ni_locked(best_lpni->lpni_net->net_id, cpt);
1549 lnet_net_unlock(cpt);
1550 CERROR("no path to %s from net %s\n",
1551 libcfs_nid2str(best_lpni->lpni_nid),
1552 libcfs_net2str(best_lpni->lpni_net->net_id));
1553 return -EHOSTUNREACH;
1559 * if we already found a best_ni because src_nid is specified and
1560 * best_lpni because we are replying to a message then just send
1563 if (best_ni && best_lpni)
1567 * If we already found a best_ni because src_nid is specified then
1568 * pick the peer then send the message
1574 * pick the best_ni by going through all the possible networks of
1575 * that peer and see which local NI is best suited to talk to that
1578 * Locally connected networks will always be preferred over
1579 * a routed network. If there are only routed paths to the peer,
1580 * then the best route is chosen. If all routes are equal then
1581 * they are used in round robin.
1583 list_for_each_entry(peer_net, &peer->lp_peer_nets, lpn_on_peer_list) {
1584 if (!lnet_is_peer_net_healthy_locked(peer_net))
1587 local_net = lnet_get_net_locked(peer_net->lpn_net_id);
1588 if (!local_net && !routing && !local_found) {
1589 struct lnet_peer_ni *net_gw;
1591 lpni = list_entry(peer_net->lpn_peer_nis.next,
1592 struct lnet_peer_ni,
1593 lpni_on_peer_net_list);
1595 net_gw = lnet_find_route_locked(NULL,
1603 * lnet_find_route_locked() call
1604 * will return the best_Gw on the
1605 * lpni->lpni_nid network.
1606 * However, best_gw and net_gw can
1607 * be on different networks.
1608 * Therefore need to compare them
1609 * to pick the better of either.
1611 if (lnet_compare_peers(best_gw, net_gw) > 0)
1613 if (best_gw->lpni_gw_seq <= net_gw->lpni_gw_seq)
1628 * a gw on this network is found, but there could be
1629 * other better gateways on other networks. So don't pick
1630 * the best_ni until we determine the best_gw.
1635 /* if no local_net found continue */
1640 * Iterate through the NIs in this local Net and select
1641 * the NI to send from. The selection is determined by
1642 * these 3 criterion in the following priority:
1644 * 2. NI available credits
1647 best_ni = lnet_get_best_ni(local_net, best_ni, md_cpt);
1650 if (!best_ni && !best_gw) {
1651 lnet_net_unlock(cpt);
1652 LCONSOLE_WARN("No local ni found to send from to %s\n",
1653 libcfs_nid2str(dst_nid));
1658 best_ni = lnet_get_best_ni(best_gw->lpni_net, best_ni, md_cpt);
1659 LASSERT(best_gw && best_ni);
1662 * We're going to route the message, so change the peer to
1665 LASSERT(best_gw->lpni_peer_net);
1666 LASSERT(best_gw->lpni_peer_net->lpn_peer);
1667 best_gw->lpni_gw_seq++;
1668 peer = best_gw->lpni_peer_net->lpn_peer;
1672 * Now that we selected the NI to use increment its sequence
1673 * number so the Round Robin algorithm will detect that it has
1674 * been used and pick the next NI.
1680 * At this point the best_ni is on a local network on which
1681 * the peer has a peer_ni as well
1683 peer_net = lnet_peer_get_net_locked(peer,
1684 best_ni->ni_net->net_id);
1686 * peer_net is not available or the src_nid is explicitly defined
1687 * and the peer_net for that src_nid is unhealthy. find a route to
1688 * the destination nid.
1691 (src_nid != LNET_NID_ANY &&
1692 !lnet_is_peer_net_healthy_locked(peer_net))) {
1693 best_gw = lnet_find_route_locked(best_ni->ni_net,
1697 * if no route is found for that network then
1698 * move onto the next peer_ni in the peer
1701 lnet_net_unlock(cpt);
1702 LCONSOLE_WARN("No route to peer from %s\n",
1703 libcfs_nid2str(best_ni->ni_nid));
1704 return -EHOSTUNREACH;
1707 CDEBUG(D_NET, "Best route to %s via %s for %s %d\n",
1708 libcfs_nid2str(dst_nid),
1709 libcfs_nid2str(best_gw->lpni_nid),
1710 lnet_msgtyp2str(msg->msg_type), msg->msg_len);
1714 * RULE: Each node considers only the next-hop
1716 * We're going to route the message, so change the peer to
1719 LASSERT(best_gw->lpni_peer_net);
1720 LASSERT(best_gw->lpni_peer_net->lpn_peer);
1721 peer = best_gw->lpni_peer_net->lpn_peer;
1722 } else if (!lnet_is_peer_net_healthy_locked(peer_net)) {
1724 * this peer_net is unhealthy but we still have an opportunity
1725 * to find another peer_net that we can use
1727 __u32 net_id = peer_net->lpn_net_id;
1728 LCONSOLE_WARN("peer net %s unhealthy\n",
1729 libcfs_net2str(net_id));
1734 * Look at the peer NIs for the destination peer that connect
1735 * to the chosen net. If a peer_ni is preferred when using the
1736 * best_ni to communicate, we use that one. If there is no
1737 * preferred peer_ni, or there are multiple preferred peer_ni,
1738 * the available transmit credits are used. If the transmit
1739 * credits are equal, we round-robin over the peer_ni.
1742 best_lpni_credits = INT_MIN;
1745 while ((lpni = lnet_get_next_peer_ni_locked(peer, peer_net, lpni))) {
1747 * if this peer ni is not healthy just skip it, no point in
1748 * examining it further
1750 if (!lnet_is_peer_ni_healthy_locked(lpni))
1752 ni_is_pref = lnet_peer_is_ni_pref_locked(lpni, best_ni);
1754 /* if this is a preferred peer use it */
1755 if (!preferred && ni_is_pref) {
1757 } else if (preferred && !ni_is_pref) {
1759 * this is not the preferred peer so let's ignore
1763 } else if (lpni->lpni_txcredits < best_lpni_credits) {
1765 * We already have a peer that has more credits
1766 * available than this one. No need to consider
1767 * this peer further.
1770 } else if (lpni->lpni_txcredits == best_lpni_credits) {
1772 * The best peer found so far and the current peer
1773 * have the same number of available credits let's
1774 * make sure to select between them using Round
1778 if (best_lpni->lpni_seq <= lpni->lpni_seq)
1784 best_lpni_credits = lpni->lpni_txcredits;
1787 /* if we still can't find a peer ni then we can't reach it */
1789 __u32 net_id = (peer_net) ? peer_net->lpn_net_id :
1790 LNET_NIDNET(dst_nid);
1791 lnet_net_unlock(cpt);
1792 LCONSOLE_WARN("no peer_ni found on peer net %s\n",
1793 libcfs_net2str(net_id));
1794 return -EHOSTUNREACH;
1799 /* Shortcut for loopback. */
1800 if (best_ni == the_lnet.ln_loni) {
1801 /* No send credit hassles with LOLND */
1802 lnet_ni_addref_locked(best_ni, cpt);
1803 msg->msg_hdr.dest_nid = cpu_to_le64(best_ni->ni_nid);
1804 if (!msg->msg_routing)
1805 msg->msg_hdr.src_nid = cpu_to_le64(best_ni->ni_nid);
1806 msg->msg_target.nid = best_ni->ni_nid;
1807 lnet_msg_commit(msg, cpt);
1808 msg->msg_txni = best_ni;
1809 lnet_net_unlock(cpt);
1811 return LNET_CREDIT_OK;
1814 routing = routing || routing2;
1817 * Increment sequence number of the peer selected so that we
1818 * pick the next one in Round Robin.
1820 best_lpni->lpni_seq++;
1823 * grab a reference on the peer_ni so it sticks around even if
1824 * we need to drop and relock the lnet_net_lock below.
1826 lnet_peer_ni_addref_locked(best_lpni);
1829 * Use lnet_cpt_of_nid() to determine the CPT used to commit the
1830 * message. This ensures that we get a CPT that is correct for
1831 * the NI when the NI has been restricted to a subset of all CPTs.
1832 * If the selected CPT differs from the one currently locked, we
1833 * must unlock and relock the lnet_net_lock(), and then check whether
1834 * the configuration has changed. We don't have a hold on the best_ni
1835 * yet, and it may have vanished.
1837 cpt2 = lnet_cpt_of_nid_locked(best_lpni->lpni_nid, best_ni);
1839 lnet_net_unlock(cpt);
1842 if (seq != lnet_get_dlc_seq_locked()) {
1843 lnet_peer_ni_decref_locked(best_lpni);
1849 * store the best_lpni in the message right away to avoid having
1850 * to do the same operation under different conditions
1852 msg->msg_txpeer = best_lpni;
1853 msg->msg_txni = best_ni;
1856 * grab a reference for the best_ni since now it's in use in this
1857 * send. the reference will need to be dropped when the message is
1858 * finished in lnet_finalize()
1860 lnet_ni_addref_locked(msg->msg_txni, cpt);
1863 * Always set the target.nid to the best peer picked. Either the
1864 * nid will be one of the preconfigured NIDs, or the same NID as
1865 * what was originally set in the target or it will be the NID of
1866 * a router if this message should be routed
1868 msg->msg_target.nid = msg->msg_txpeer->lpni_nid;
1871 * lnet_msg_commit assigns the correct cpt to the message, which
1872 * is used to decrement the correct refcount on the ni when it's
1873 * time to return the credits
1875 lnet_msg_commit(msg, cpt);
1878 * If we are routing the message then we don't need to overwrite
1879 * the src_nid since it would've been set at the origin. Otherwise
1880 * we are the originator so we need to set it.
1882 if (!msg->msg_routing)
1883 msg->msg_hdr.src_nid = cpu_to_le64(msg->msg_txni->ni_nid);
1886 msg->msg_target_is_router = 1;
1887 msg->msg_target.pid = LNET_PID_LUSTRE;
1889 * since we're routing we want to ensure that the
1890 * msg_hdr.dest_nid is set to the final destination. When
1891 * the router receives this message it knows how to route
1894 msg->msg_hdr.dest_nid =
1895 cpu_to_le64(final_dst ? final_dst->lpni_nid : dst_nid);
1898 * if we're not routing set the dest_nid to the best peer
1899 * ni that we picked earlier in the algorithm.
1901 msg->msg_hdr.dest_nid = cpu_to_le64(msg->msg_txpeer->lpni_nid);
1904 rc = lnet_post_send_locked(msg, 0);
1906 lnet_net_unlock(cpt);
1912 lnet_send(lnet_nid_t src_nid, struct lnet_msg *msg, lnet_nid_t rtr_nid)
1914 lnet_nid_t dst_nid = msg->msg_target.nid;
1918 * NB: rtr_nid is set to LNET_NID_ANY for all current use-cases,
1919 * but we might want to use pre-determined router for ACK/REPLY
1922 /* NB: ni != NULL == interface pre-determined (ACK/REPLY) */
1923 LASSERT (msg->msg_txpeer == NULL);
1924 LASSERT (!msg->msg_sending);
1925 LASSERT (!msg->msg_target_is_router);
1926 LASSERT (!msg->msg_receiving);
1928 msg->msg_sending = 1;
1930 LASSERT(!msg->msg_tx_committed);
1932 rc = lnet_select_pathway(src_nid, dst_nid, msg, rtr_nid);
1936 if (rc == LNET_CREDIT_OK)
1937 lnet_ni_send(msg->msg_txni, msg);
1939 /* rc == LNET_CREDIT_OK or LNET_CREDIT_WAIT */
1944 lnet_drop_message(struct lnet_ni *ni, int cpt, void *private, unsigned int nob)
1947 the_lnet.ln_counters[cpt]->drop_count++;
1948 the_lnet.ln_counters[cpt]->drop_length += nob;
1949 lnet_net_unlock(cpt);
1951 lnet_ni_recv(ni, private, NULL, 0, 0, 0, nob);
1955 lnet_recv_put(struct lnet_ni *ni, struct lnet_msg *msg)
1957 struct lnet_hdr *hdr = &msg->msg_hdr;
1959 if (msg->msg_wanted != 0)
1960 lnet_setpayloadbuffer(msg);
1962 lnet_build_msg_event(msg, LNET_EVENT_PUT);
1964 /* Must I ACK? If so I'll grab the ack_wmd out of the header and put
1965 * it back into the ACK during lnet_finalize() */
1966 msg->msg_ack = (!lnet_is_wire_handle_none(&hdr->msg.put.ack_wmd) &&
1967 (msg->msg_md->md_options & LNET_MD_ACK_DISABLE) == 0);
1969 lnet_ni_recv(ni, msg->msg_private, msg, msg->msg_rx_delayed,
1970 msg->msg_offset, msg->msg_wanted, hdr->payload_length);
1974 lnet_parse_put(struct lnet_ni *ni, struct lnet_msg *msg)
1976 struct lnet_hdr *hdr = &msg->msg_hdr;
1977 struct lnet_match_info info;
1981 /* Convert put fields to host byte order */
1982 hdr->msg.put.match_bits = le64_to_cpu(hdr->msg.put.match_bits);
1983 hdr->msg.put.ptl_index = le32_to_cpu(hdr->msg.put.ptl_index);
1984 hdr->msg.put.offset = le32_to_cpu(hdr->msg.put.offset);
1986 /* Primary peer NID. */
1987 info.mi_id.nid = msg->msg_initiator;
1988 info.mi_id.pid = hdr->src_pid;
1989 info.mi_opc = LNET_MD_OP_PUT;
1990 info.mi_portal = hdr->msg.put.ptl_index;
1991 info.mi_rlength = hdr->payload_length;
1992 info.mi_roffset = hdr->msg.put.offset;
1993 info.mi_mbits = hdr->msg.put.match_bits;
1994 info.mi_cpt = lnet_cpt_of_nid(msg->msg_rxpeer->lpni_nid, ni);
1996 msg->msg_rx_ready_delay = ni->ni_net->net_lnd->lnd_eager_recv == NULL;
1997 ready_delay = msg->msg_rx_ready_delay;
2000 rc = lnet_ptl_match_md(&info, msg);
2005 case LNET_MATCHMD_OK:
2006 lnet_recv_put(ni, msg);
2009 case LNET_MATCHMD_NONE:
2011 /* no eager_recv or has already called it, should
2012 * have been attached on delayed list */
2015 rc = lnet_ni_eager_recv(ni, msg);
2022 case LNET_MATCHMD_DROP:
2023 CNETERR("Dropping PUT from %s portal %d match %llu"
2024 " offset %d length %d: %d\n",
2025 libcfs_id2str(info.mi_id), info.mi_portal,
2026 info.mi_mbits, info.mi_roffset, info.mi_rlength, rc);
2028 return -ENOENT; /* -ve: OK but no match */
2033 lnet_parse_get(struct lnet_ni *ni, struct lnet_msg *msg, int rdma_get)
2035 struct lnet_match_info info;
2036 struct lnet_hdr *hdr = &msg->msg_hdr;
2037 struct lnet_process_id source_id;
2038 struct lnet_handle_wire reply_wmd;
2041 /* Convert get fields to host byte order */
2042 hdr->msg.get.match_bits = le64_to_cpu(hdr->msg.get.match_bits);
2043 hdr->msg.get.ptl_index = le32_to_cpu(hdr->msg.get.ptl_index);
2044 hdr->msg.get.sink_length = le32_to_cpu(hdr->msg.get.sink_length);
2045 hdr->msg.get.src_offset = le32_to_cpu(hdr->msg.get.src_offset);
2047 source_id.nid = hdr->src_nid;
2048 source_id.pid = hdr->src_pid;
2049 /* Primary peer NID */
2050 info.mi_id.nid = msg->msg_initiator;
2051 info.mi_id.pid = hdr->src_pid;
2052 info.mi_opc = LNET_MD_OP_GET;
2053 info.mi_portal = hdr->msg.get.ptl_index;
2054 info.mi_rlength = hdr->msg.get.sink_length;
2055 info.mi_roffset = hdr->msg.get.src_offset;
2056 info.mi_mbits = hdr->msg.get.match_bits;
2057 info.mi_cpt = lnet_cpt_of_nid(msg->msg_rxpeer->lpni_nid, ni);
2059 rc = lnet_ptl_match_md(&info, msg);
2060 if (rc == LNET_MATCHMD_DROP) {
2061 CNETERR("Dropping GET from %s portal %d match %llu"
2062 " offset %d length %d\n",
2063 libcfs_id2str(info.mi_id), info.mi_portal,
2064 info.mi_mbits, info.mi_roffset, info.mi_rlength);
2065 return -ENOENT; /* -ve: OK but no match */
2068 LASSERT(rc == LNET_MATCHMD_OK);
2070 lnet_build_msg_event(msg, LNET_EVENT_GET);
2072 reply_wmd = hdr->msg.get.return_wmd;
2074 lnet_prep_send(msg, LNET_MSG_REPLY, source_id,
2075 msg->msg_offset, msg->msg_wanted);
2077 msg->msg_hdr.msg.reply.dst_wmd = reply_wmd;
2080 /* The LND completes the REPLY from her recv procedure */
2081 lnet_ni_recv(ni, msg->msg_private, msg, 0,
2082 msg->msg_offset, msg->msg_len, msg->msg_len);
2086 lnet_ni_recv(ni, msg->msg_private, NULL, 0, 0, 0, 0);
2087 msg->msg_receiving = 0;
2089 rc = lnet_send(ni->ni_nid, msg, LNET_NID_ANY);
2091 /* didn't get as far as lnet_ni_send() */
2092 CERROR("%s: Unable to send REPLY for GET from %s: %d\n",
2093 libcfs_nid2str(ni->ni_nid),
2094 libcfs_id2str(info.mi_id), rc);
2096 lnet_finalize(msg, rc);
2103 lnet_parse_reply(struct lnet_ni *ni, struct lnet_msg *msg)
2105 void *private = msg->msg_private;
2106 struct lnet_hdr *hdr = &msg->msg_hdr;
2107 struct lnet_process_id src = {0};
2108 struct lnet_libmd *md;
2113 cpt = lnet_cpt_of_cookie(hdr->msg.reply.dst_wmd.wh_object_cookie);
2116 src.nid = hdr->src_nid;
2117 src.pid = hdr->src_pid;
2119 /* NB handles only looked up by creator (no flips) */
2120 md = lnet_wire_handle2md(&hdr->msg.reply.dst_wmd);
2121 if (md == NULL || md->md_threshold == 0 || md->md_me != NULL) {
2122 CNETERR("%s: Dropping REPLY from %s for %s "
2124 libcfs_nid2str(ni->ni_nid), libcfs_id2str(src),
2125 (md == NULL) ? "invalid" : "inactive",
2126 hdr->msg.reply.dst_wmd.wh_interface_cookie,
2127 hdr->msg.reply.dst_wmd.wh_object_cookie);
2128 if (md != NULL && md->md_me != NULL)
2129 CERROR("REPLY MD also attached to portal %d\n",
2130 md->md_me->me_portal);
2132 lnet_res_unlock(cpt);
2133 return -ENOENT; /* -ve: OK but no match */
2136 LASSERT(md->md_offset == 0);
2138 rlength = hdr->payload_length;
2139 mlength = MIN(rlength, (int)md->md_length);
2141 if (mlength < rlength &&
2142 (md->md_options & LNET_MD_TRUNCATE) == 0) {
2143 CNETERR("%s: Dropping REPLY from %s length %d "
2144 "for MD %#llx would overflow (%d)\n",
2145 libcfs_nid2str(ni->ni_nid), libcfs_id2str(src),
2146 rlength, hdr->msg.reply.dst_wmd.wh_object_cookie,
2148 lnet_res_unlock(cpt);
2149 return -ENOENT; /* -ve: OK but no match */
2152 CDEBUG(D_NET, "%s: Reply from %s of length %d/%d into md %#llx\n",
2153 libcfs_nid2str(ni->ni_nid), libcfs_id2str(src),
2154 mlength, rlength, hdr->msg.reply.dst_wmd.wh_object_cookie);
2156 lnet_msg_attach_md(msg, md, 0, mlength);
2159 lnet_setpayloadbuffer(msg);
2161 lnet_res_unlock(cpt);
2163 lnet_build_msg_event(msg, LNET_EVENT_REPLY);
2165 lnet_ni_recv(ni, private, msg, 0, 0, mlength, rlength);
2170 lnet_parse_ack(struct lnet_ni *ni, struct lnet_msg *msg)
2172 struct lnet_hdr *hdr = &msg->msg_hdr;
2173 struct lnet_process_id src = {0};
2174 struct lnet_libmd *md;
2177 src.nid = hdr->src_nid;
2178 src.pid = hdr->src_pid;
2180 /* Convert ack fields to host byte order */
2181 hdr->msg.ack.match_bits = le64_to_cpu(hdr->msg.ack.match_bits);
2182 hdr->msg.ack.mlength = le32_to_cpu(hdr->msg.ack.mlength);
2184 cpt = lnet_cpt_of_cookie(hdr->msg.ack.dst_wmd.wh_object_cookie);
2187 /* NB handles only looked up by creator (no flips) */
2188 md = lnet_wire_handle2md(&hdr->msg.ack.dst_wmd);
2189 if (md == NULL || md->md_threshold == 0 || md->md_me != NULL) {
2190 /* Don't moan; this is expected */
2192 "%s: Dropping ACK from %s to %s MD %#llx.%#llx\n",
2193 libcfs_nid2str(ni->ni_nid), libcfs_id2str(src),
2194 (md == NULL) ? "invalid" : "inactive",
2195 hdr->msg.ack.dst_wmd.wh_interface_cookie,
2196 hdr->msg.ack.dst_wmd.wh_object_cookie);
2197 if (md != NULL && md->md_me != NULL)
2198 CERROR("Source MD also attached to portal %d\n",
2199 md->md_me->me_portal);
2201 lnet_res_unlock(cpt);
2202 return -ENOENT; /* -ve! */
2205 CDEBUG(D_NET, "%s: ACK from %s into md %#llx\n",
2206 libcfs_nid2str(ni->ni_nid), libcfs_id2str(src),
2207 hdr->msg.ack.dst_wmd.wh_object_cookie);
2209 lnet_msg_attach_md(msg, md, 0, 0);
2211 lnet_res_unlock(cpt);
2213 lnet_build_msg_event(msg, LNET_EVENT_ACK);
2215 lnet_ni_recv(ni, msg->msg_private, msg, 0, 0, 0, msg->msg_len);
2220 * \retval LNET_CREDIT_OK If \a msg is forwarded
2221 * \retval LNET_CREDIT_WAIT If \a msg is blocked because w/o buffer
2222 * \retval -ve error code
2225 lnet_parse_forward_locked(struct lnet_ni *ni, struct lnet_msg *msg)
2229 if (!the_lnet.ln_routing)
2232 if (msg->msg_rxpeer->lpni_rtrcredits <= 0 ||
2233 lnet_msg2bufpool(msg)->rbp_credits <= 0) {
2234 if (ni->ni_net->net_lnd->lnd_eager_recv == NULL) {
2235 msg->msg_rx_ready_delay = 1;
2237 lnet_net_unlock(msg->msg_rx_cpt);
2238 rc = lnet_ni_eager_recv(ni, msg);
2239 lnet_net_lock(msg->msg_rx_cpt);
2244 rc = lnet_post_routed_recv_locked(msg, 0);
2249 lnet_parse_local(struct lnet_ni *ni, struct lnet_msg *msg)
2253 switch (msg->msg_type) {
2255 rc = lnet_parse_ack(ni, msg);
2258 rc = lnet_parse_put(ni, msg);
2261 rc = lnet_parse_get(ni, msg, msg->msg_rdma_get);
2263 case LNET_MSG_REPLY:
2264 rc = lnet_parse_reply(ni, msg);
2266 default: /* prevent an unused label if !kernel */
2271 LASSERT(rc == 0 || rc == -ENOENT);
2276 lnet_msgtyp2str (int type)
2285 case LNET_MSG_REPLY:
2287 case LNET_MSG_HELLO:
2290 return ("<UNKNOWN>");
2295 lnet_print_hdr(struct lnet_hdr *hdr)
2297 struct lnet_process_id src = {
2298 .nid = hdr->src_nid,
2299 .pid = hdr->src_pid,
2301 struct lnet_process_id dst = {
2302 .nid = hdr->dest_nid,
2303 .pid = hdr->dest_pid,
2305 char *type_str = lnet_msgtyp2str(hdr->type);
2307 CWARN("P3 Header at %p of type %s\n", hdr, type_str);
2308 CWARN(" From %s\n", libcfs_id2str(src));
2309 CWARN(" To %s\n", libcfs_id2str(dst));
2311 switch (hdr->type) {
2316 CWARN(" Ptl index %d, ack md %#llx.%#llx, "
2317 "match bits %llu\n",
2318 hdr->msg.put.ptl_index,
2319 hdr->msg.put.ack_wmd.wh_interface_cookie,
2320 hdr->msg.put.ack_wmd.wh_object_cookie,
2321 hdr->msg.put.match_bits);
2322 CWARN(" Length %d, offset %d, hdr data %#llx\n",
2323 hdr->payload_length, hdr->msg.put.offset,
2324 hdr->msg.put.hdr_data);
2328 CWARN(" Ptl index %d, return md %#llx.%#llx, "
2329 "match bits %llu\n", hdr->msg.get.ptl_index,
2330 hdr->msg.get.return_wmd.wh_interface_cookie,
2331 hdr->msg.get.return_wmd.wh_object_cookie,
2332 hdr->msg.get.match_bits);
2333 CWARN(" Length %d, src offset %d\n",
2334 hdr->msg.get.sink_length,
2335 hdr->msg.get.src_offset);
2339 CWARN(" dst md %#llx.%#llx, "
2340 "manipulated length %d\n",
2341 hdr->msg.ack.dst_wmd.wh_interface_cookie,
2342 hdr->msg.ack.dst_wmd.wh_object_cookie,
2343 hdr->msg.ack.mlength);
2346 case LNET_MSG_REPLY:
2347 CWARN(" dst md %#llx.%#llx, "
2349 hdr->msg.reply.dst_wmd.wh_interface_cookie,
2350 hdr->msg.reply.dst_wmd.wh_object_cookie,
2351 hdr->payload_length);
2357 lnet_parse(struct lnet_ni *ni, struct lnet_hdr *hdr, lnet_nid_t from_nid,
2358 void *private, int rdma_req)
2363 struct lnet_msg *msg;
2364 lnet_pid_t dest_pid;
2365 lnet_nid_t dest_nid;
2367 struct lnet_peer_ni *lpni;
2368 __u32 payload_length;
2371 LASSERT (!in_interrupt ());
2373 type = le32_to_cpu(hdr->type);
2374 src_nid = le64_to_cpu(hdr->src_nid);
2375 dest_nid = le64_to_cpu(hdr->dest_nid);
2376 dest_pid = le32_to_cpu(hdr->dest_pid);
2377 payload_length = le32_to_cpu(hdr->payload_length);
2379 for_me = (ni->ni_nid == dest_nid);
2380 cpt = lnet_cpt_of_nid(from_nid, ni);
2385 if (payload_length > 0) {
2386 CERROR("%s, src %s: bad %s payload %d (0 expected)\n",
2387 libcfs_nid2str(from_nid),
2388 libcfs_nid2str(src_nid),
2389 lnet_msgtyp2str(type), payload_length);
2395 case LNET_MSG_REPLY:
2396 if (payload_length >
2397 (__u32)(for_me ? LNET_MAX_PAYLOAD : LNET_MTU)) {
2398 CERROR("%s, src %s: bad %s payload %d "
2399 "(%d max expected)\n",
2400 libcfs_nid2str(from_nid),
2401 libcfs_nid2str(src_nid),
2402 lnet_msgtyp2str(type),
2404 for_me ? LNET_MAX_PAYLOAD : LNET_MTU);
2410 CERROR("%s, src %s: Bad message type 0x%x\n",
2411 libcfs_nid2str(from_nid),
2412 libcfs_nid2str(src_nid), type);
2416 if (the_lnet.ln_routing &&
2417 ni->ni_last_alive != ktime_get_real_seconds()) {
2418 /* NB: so far here is the only place to set NI status to "up */
2420 ni->ni_last_alive = ktime_get_real_seconds();
2421 if (ni->ni_status != NULL &&
2422 ni->ni_status->ns_status == LNET_NI_STATUS_DOWN)
2423 ni->ni_status->ns_status = LNET_NI_STATUS_UP;
2427 /* Regard a bad destination NID as a protocol error. Senders should
2428 * know what they're doing; if they don't they're misconfigured, buggy
2429 * or malicious so we chop them off at the knees :) */
2432 if (LNET_NIDNET(dest_nid) == LNET_NIDNET(ni->ni_nid)) {
2433 /* should have gone direct */
2434 CERROR("%s, src %s: Bad dest nid %s "
2435 "(should have been sent direct)\n",
2436 libcfs_nid2str(from_nid),
2437 libcfs_nid2str(src_nid),
2438 libcfs_nid2str(dest_nid));
2442 if (lnet_islocalnid(dest_nid)) {
2443 /* dest is another local NI; sender should have used
2444 * this node's NID on its own network */
2445 CERROR("%s, src %s: Bad dest nid %s "
2446 "(it's my nid but on a different network)\n",
2447 libcfs_nid2str(from_nid),
2448 libcfs_nid2str(src_nid),
2449 libcfs_nid2str(dest_nid));
2453 if (rdma_req && type == LNET_MSG_GET) {
2454 CERROR("%s, src %s: Bad optimized GET for %s "
2455 "(final destination must be me)\n",
2456 libcfs_nid2str(from_nid),
2457 libcfs_nid2str(src_nid),
2458 libcfs_nid2str(dest_nid));
2462 if (!the_lnet.ln_routing) {
2463 CERROR("%s, src %s: Dropping message for %s "
2464 "(routing not enabled)\n",
2465 libcfs_nid2str(from_nid),
2466 libcfs_nid2str(src_nid),
2467 libcfs_nid2str(dest_nid));
2472 /* Message looks OK; we're not going to return an error, so we MUST
2473 * call back lnd_recv() come what may... */
2475 if (!list_empty(&the_lnet.ln_test_peers) && /* normally we don't */
2476 fail_peer(src_nid, 0)) { /* shall we now? */
2477 CERROR("%s, src %s: Dropping %s to simulate failure\n",
2478 libcfs_nid2str(from_nid), libcfs_nid2str(src_nid),
2479 lnet_msgtyp2str(type));
2483 if (!list_empty(&the_lnet.ln_drop_rules) &&
2484 lnet_drop_rule_match(hdr)) {
2485 CDEBUG(D_NET, "%s, src %s, dst %s: Dropping %s to simulate"
2486 "silent message loss\n",
2487 libcfs_nid2str(from_nid), libcfs_nid2str(src_nid),
2488 libcfs_nid2str(dest_nid), lnet_msgtyp2str(type));
2493 msg = lnet_msg_alloc();
2495 CERROR("%s, src %s: Dropping %s (out of memory)\n",
2496 libcfs_nid2str(from_nid), libcfs_nid2str(src_nid),
2497 lnet_msgtyp2str(type));
2501 /* msg zeroed in lnet_msg_alloc; i.e. flags all clear,
2502 * pointers NULL etc */
2504 msg->msg_type = type;
2505 msg->msg_private = private;
2506 msg->msg_receiving = 1;
2507 msg->msg_rdma_get = rdma_req;
2508 msg->msg_len = msg->msg_wanted = payload_length;
2509 msg->msg_offset = 0;
2510 msg->msg_hdr = *hdr;
2511 /* for building message event */
2512 msg->msg_from = from_nid;
2514 msg->msg_target.pid = dest_pid;
2515 msg->msg_target.nid = dest_nid;
2516 msg->msg_routing = 1;
2519 /* convert common msg->hdr fields to host byteorder */
2520 msg->msg_hdr.type = type;
2521 msg->msg_hdr.src_nid = src_nid;
2522 msg->msg_hdr.src_pid = le32_to_cpu(msg->msg_hdr.src_pid);
2523 msg->msg_hdr.dest_nid = dest_nid;
2524 msg->msg_hdr.dest_pid = dest_pid;
2525 msg->msg_hdr.payload_length = payload_length;
2527 /* Multi-Rail: Primary NID of source. */
2528 msg->msg_initiator = lnet_peer_primary_nid(src_nid);
2531 lpni = lnet_nid2peerni_locked(from_nid, cpt);
2533 lnet_net_unlock(cpt);
2534 CERROR("%s, src %s: Dropping %s "
2535 "(error %ld looking up sender)\n",
2536 libcfs_nid2str(from_nid), libcfs_nid2str(src_nid),
2537 lnet_msgtyp2str(type), PTR_ERR(lpni));
2539 if (rc == -ESHUTDOWN)
2540 /* We are shutting down. Don't do anything more */
2544 msg->msg_rxpeer = lpni;
2546 lnet_ni_addref_locked(ni, cpt);
2548 if (lnet_isrouter(msg->msg_rxpeer)) {
2549 lnet_peer_set_alive(msg->msg_rxpeer);
2550 if (avoid_asym_router_failure &&
2551 LNET_NIDNET(src_nid) != LNET_NIDNET(from_nid)) {
2552 /* received a remote message from router, update
2553 * remote NI status on this router.
2554 * NB: multi-hop routed message will be ignored.
2556 lnet_router_ni_update_locked(msg->msg_rxpeer,
2557 LNET_NIDNET(src_nid));
2561 lnet_msg_commit(msg, cpt);
2563 /* message delay simulation */
2564 if (unlikely(!list_empty(&the_lnet.ln_delay_rules) &&
2565 lnet_delay_rule_match_locked(hdr, msg))) {
2566 lnet_net_unlock(cpt);
2571 rc = lnet_parse_forward_locked(ni, msg);
2572 lnet_net_unlock(cpt);
2577 if (rc == LNET_CREDIT_OK) {
2578 lnet_ni_recv(ni, msg->msg_private, msg, 0,
2579 0, payload_length, payload_length);
2584 lnet_net_unlock(cpt);
2586 rc = lnet_parse_local(ni, msg);
2592 LASSERT(msg->msg_md == NULL);
2593 lnet_finalize(msg, rc);
2596 lnet_drop_message(ni, cpt, private, payload_length);
2599 EXPORT_SYMBOL(lnet_parse);
2602 lnet_drop_delayed_msg_list(struct list_head *head, char *reason)
2604 while (!list_empty(head)) {
2605 struct lnet_process_id id = {0};
2606 struct lnet_msg *msg;
2608 msg = list_entry(head->next, struct lnet_msg, msg_list);
2609 list_del(&msg->msg_list);
2611 id.nid = msg->msg_hdr.src_nid;
2612 id.pid = msg->msg_hdr.src_pid;
2614 LASSERT(msg->msg_md == NULL);
2615 LASSERT(msg->msg_rx_delayed);
2616 LASSERT(msg->msg_rxpeer != NULL);
2617 LASSERT(msg->msg_hdr.type == LNET_MSG_PUT);
2619 CWARN("Dropping delayed PUT from %s portal %d match %llu"
2620 " offset %d length %d: %s\n",
2622 msg->msg_hdr.msg.put.ptl_index,
2623 msg->msg_hdr.msg.put.match_bits,
2624 msg->msg_hdr.msg.put.offset,
2625 msg->msg_hdr.payload_length, reason);
2627 /* NB I can't drop msg's ref on msg_rxpeer until after I've
2628 * called lnet_drop_message(), so I just hang onto msg as well
2629 * until that's done */
2631 lnet_drop_message(msg->msg_rxni, msg->msg_rx_cpt,
2632 msg->msg_private, msg->msg_len);
2634 * NB: message will not generate event because w/o attached MD,
2635 * but we still should give error code so lnet_msg_decommit()
2636 * can skip counters operations and other checks.
2638 lnet_finalize(msg, -ENOENT);
2643 lnet_recv_delayed_msg_list(struct list_head *head)
2645 while (!list_empty(head)) {
2646 struct lnet_msg *msg;
2647 struct lnet_process_id id;
2649 msg = list_entry(head->next, struct lnet_msg, msg_list);
2650 list_del(&msg->msg_list);
2652 /* md won't disappear under me, since each msg
2653 * holds a ref on it */
2655 id.nid = msg->msg_hdr.src_nid;
2656 id.pid = msg->msg_hdr.src_pid;
2658 LASSERT(msg->msg_rx_delayed);
2659 LASSERT(msg->msg_md != NULL);
2660 LASSERT(msg->msg_rxpeer != NULL);
2661 LASSERT(msg->msg_rxni != NULL);
2662 LASSERT(msg->msg_hdr.type == LNET_MSG_PUT);
2664 CDEBUG(D_NET, "Resuming delayed PUT from %s portal %d "
2665 "match %llu offset %d length %d.\n",
2666 libcfs_id2str(id), msg->msg_hdr.msg.put.ptl_index,
2667 msg->msg_hdr.msg.put.match_bits,
2668 msg->msg_hdr.msg.put.offset,
2669 msg->msg_hdr.payload_length);
2671 lnet_recv_put(msg->msg_rxni, msg);
2676 * Initiate an asynchronous PUT operation.
2678 * There are several events associated with a PUT: completion of the send on
2679 * the initiator node (LNET_EVENT_SEND), and when the send completes
2680 * successfully, the receipt of an acknowledgment (LNET_EVENT_ACK) indicating
2681 * that the operation was accepted by the target. The event LNET_EVENT_PUT is
2682 * used at the target node to indicate the completion of incoming data
2685 * The local events will be logged in the EQ associated with the MD pointed to
2686 * by \a mdh handle. Using a MD without an associated EQ results in these
2687 * events being discarded. In this case, the caller must have another
2688 * mechanism (e.g., a higher level protocol) for determining when it is safe
2689 * to modify the memory region associated with the MD.
2691 * Note that LNet does not guarantee the order of LNET_EVENT_SEND and
2692 * LNET_EVENT_ACK, though intuitively ACK should happen after SEND.
2694 * \param self Indicates the NID of a local interface through which to send
2695 * the PUT request. Use LNET_NID_ANY to let LNet choose one by itself.
2696 * \param mdh A handle for the MD that describes the memory to be sent. The MD
2697 * must be "free floating" (See LNetMDBind()).
2698 * \param ack Controls whether an acknowledgment is requested.
2699 * Acknowledgments are only sent when they are requested by the initiating
2700 * process and the target MD enables them.
2701 * \param target A process identifier for the target process.
2702 * \param portal The index in the \a target's portal table.
2703 * \param match_bits The match bits to use for MD selection at the target
2705 * \param offset The offset into the target MD (only used when the target
2706 * MD has the LNET_MD_MANAGE_REMOTE option set).
2707 * \param hdr_data 64 bits of user data that can be included in the message
2708 * header. This data is written to an event queue entry at the target if an
2709 * EQ is present on the matching MD.
2711 * \retval 0 Success, and only in this case events will be generated
2712 * and logged to EQ (if it exists).
2713 * \retval -EIO Simulated failure.
2714 * \retval -ENOMEM Memory allocation failure.
2715 * \retval -ENOENT Invalid MD object.
2717 * \see struct lnet_event::hdr_data and lnet_event_kind_t.
2720 LNetPut(lnet_nid_t self, struct lnet_handle_md mdh, enum lnet_ack_req ack,
2721 struct lnet_process_id target, unsigned int portal,
2722 __u64 match_bits, unsigned int offset,
2725 struct lnet_msg *msg;
2726 struct lnet_libmd *md;
2730 LASSERT(the_lnet.ln_refcount > 0);
2732 if (!list_empty(&the_lnet.ln_test_peers) && /* normally we don't */
2733 fail_peer(target.nid, 1)) { /* shall we now? */
2734 CERROR("Dropping PUT to %s: simulated failure\n",
2735 libcfs_id2str(target));
2739 msg = lnet_msg_alloc();
2741 CERROR("Dropping PUT to %s: ENOMEM on struct lnet_msg\n",
2742 libcfs_id2str(target));
2745 msg->msg_vmflush = !!memory_pressure_get();
2747 cpt = lnet_cpt_of_cookie(mdh.cookie);
2750 md = lnet_handle2md(&mdh);
2751 if (md == NULL || md->md_threshold == 0 || md->md_me != NULL) {
2752 CERROR("Dropping PUT (%llu:%d:%s): MD (%d) invalid\n",
2753 match_bits, portal, libcfs_id2str(target),
2754 md == NULL ? -1 : md->md_threshold);
2755 if (md != NULL && md->md_me != NULL)
2756 CERROR("Source MD also attached to portal %d\n",
2757 md->md_me->me_portal);
2758 lnet_res_unlock(cpt);
2764 CDEBUG(D_NET, "LNetPut -> %s\n", libcfs_id2str(target));
2766 lnet_msg_attach_md(msg, md, 0, 0);
2768 lnet_prep_send(msg, LNET_MSG_PUT, target, 0, md->md_length);
2770 msg->msg_hdr.msg.put.match_bits = cpu_to_le64(match_bits);
2771 msg->msg_hdr.msg.put.ptl_index = cpu_to_le32(portal);
2772 msg->msg_hdr.msg.put.offset = cpu_to_le32(offset);
2773 msg->msg_hdr.msg.put.hdr_data = hdr_data;
2775 /* NB handles only looked up by creator (no flips) */
2776 if (ack == LNET_ACK_REQ) {
2777 msg->msg_hdr.msg.put.ack_wmd.wh_interface_cookie =
2778 the_lnet.ln_interface_cookie;
2779 msg->msg_hdr.msg.put.ack_wmd.wh_object_cookie =
2780 md->md_lh.lh_cookie;
2782 msg->msg_hdr.msg.put.ack_wmd.wh_interface_cookie =
2783 LNET_WIRE_HANDLE_COOKIE_NONE;
2784 msg->msg_hdr.msg.put.ack_wmd.wh_object_cookie =
2785 LNET_WIRE_HANDLE_COOKIE_NONE;
2788 lnet_res_unlock(cpt);
2790 lnet_build_msg_event(msg, LNET_EVENT_SEND);
2792 rc = lnet_send(self, msg, LNET_NID_ANY);
2794 CNETERR("Error sending PUT to %s: %d\n",
2795 libcfs_id2str(target), rc);
2796 lnet_finalize(msg, rc);
2799 /* completion will be signalled by an event */
2802 EXPORT_SYMBOL(LNetPut);
2805 * The LND can DMA direct to the GET md (i.e. no REPLY msg). This
2806 * returns a msg for the LND to pass to lnet_finalize() when the sink
2807 * data has been received.
2809 * CAVEAT EMPTOR: 'getmsg' is the original GET, which is freed when
2810 * lnet_finalize() is called on it, so the LND must call this first
2813 lnet_create_reply_msg(struct lnet_ni *ni, struct lnet_msg *getmsg)
2815 struct lnet_msg *msg = lnet_msg_alloc();
2816 struct lnet_libmd *getmd = getmsg->msg_md;
2817 struct lnet_process_id peer_id = getmsg->msg_target;
2820 LASSERT(!getmsg->msg_target_is_router);
2821 LASSERT(!getmsg->msg_routing);
2824 CERROR("%s: Dropping REPLY from %s: can't allocate msg\n",
2825 libcfs_nid2str(ni->ni_nid), libcfs_id2str(peer_id));
2829 cpt = lnet_cpt_of_cookie(getmd->md_lh.lh_cookie);
2832 LASSERT(getmd->md_refcount > 0);
2834 if (getmd->md_threshold == 0) {
2835 CERROR("%s: Dropping REPLY from %s for inactive MD %p\n",
2836 libcfs_nid2str(ni->ni_nid), libcfs_id2str(peer_id),
2838 lnet_res_unlock(cpt);
2842 LASSERT(getmd->md_offset == 0);
2844 CDEBUG(D_NET, "%s: Reply from %s md %p\n",
2845 libcfs_nid2str(ni->ni_nid), libcfs_id2str(peer_id), getmd);
2847 /* setup information for lnet_build_msg_event */
2848 msg->msg_initiator = lnet_peer_primary_nid(peer_id.nid);
2849 /* Cheaper: msg->msg_initiator = getmsg->msg_txpeer->lp_nid; */
2850 msg->msg_from = peer_id.nid;
2851 msg->msg_type = LNET_MSG_GET; /* flag this msg as an "optimized" GET */
2852 msg->msg_hdr.src_nid = peer_id.nid;
2853 msg->msg_hdr.payload_length = getmd->md_length;
2854 msg->msg_receiving = 1; /* required by lnet_msg_attach_md */
2856 lnet_msg_attach_md(msg, getmd, getmd->md_offset, getmd->md_length);
2857 lnet_res_unlock(cpt);
2859 cpt = lnet_cpt_of_nid(peer_id.nid, ni);
2862 lnet_msg_commit(msg, cpt);
2863 lnet_net_unlock(cpt);
2865 lnet_build_msg_event(msg, LNET_EVENT_REPLY);
2870 cpt = lnet_cpt_of_nid(peer_id.nid, ni);
2873 the_lnet.ln_counters[cpt]->drop_count++;
2874 the_lnet.ln_counters[cpt]->drop_length += getmd->md_length;
2875 lnet_net_unlock(cpt);
2882 EXPORT_SYMBOL(lnet_create_reply_msg);
2885 lnet_set_reply_msg_len(struct lnet_ni *ni, struct lnet_msg *reply,
2888 /* Set the REPLY length, now the RDMA that elides the REPLY message has
2889 * completed and I know it. */
2890 LASSERT(reply != NULL);
2891 LASSERT(reply->msg_type == LNET_MSG_GET);
2892 LASSERT(reply->msg_ev.type == LNET_EVENT_REPLY);
2894 /* NB I trusted my peer to RDMA. If she tells me she's written beyond
2895 * the end of my buffer, I might as well be dead. */
2896 LASSERT(len <= reply->msg_ev.mlength);
2898 reply->msg_ev.mlength = len;
2900 EXPORT_SYMBOL(lnet_set_reply_msg_len);
2903 * Initiate an asynchronous GET operation.
2905 * On the initiator node, an LNET_EVENT_SEND is logged when the GET request
2906 * is sent, and an LNET_EVENT_REPLY is logged when the data returned from
2907 * the target node in the REPLY has been written to local MD.
2909 * On the target node, an LNET_EVENT_GET is logged when the GET request
2910 * arrives and is accepted into a MD.
2912 * \param self,target,portal,match_bits,offset See the discussion in LNetPut().
2913 * \param mdh A handle for the MD that describes the memory into which the
2914 * requested data will be received. The MD must be "free floating" (See LNetMDBind()).
2916 * \retval 0 Success, and only in this case events will be generated
2917 * and logged to EQ (if it exists) of the MD.
2918 * \retval -EIO Simulated failure.
2919 * \retval -ENOMEM Memory allocation failure.
2920 * \retval -ENOENT Invalid MD object.
2923 LNetGet(lnet_nid_t self, struct lnet_handle_md mdh,
2924 struct lnet_process_id target, unsigned int portal,
2925 __u64 match_bits, unsigned int offset)
2927 struct lnet_msg *msg;
2928 struct lnet_libmd *md;
2932 LASSERT(the_lnet.ln_refcount > 0);
2934 if (!list_empty(&the_lnet.ln_test_peers) && /* normally we don't */
2935 fail_peer(target.nid, 1)) /* shall we now? */
2937 CERROR("Dropping GET to %s: simulated failure\n",
2938 libcfs_id2str(target));
2942 msg = lnet_msg_alloc();
2944 CERROR("Dropping GET to %s: ENOMEM on struct lnet_msg\n",
2945 libcfs_id2str(target));
2949 cpt = lnet_cpt_of_cookie(mdh.cookie);
2952 md = lnet_handle2md(&mdh);
2953 if (md == NULL || md->md_threshold == 0 || md->md_me != NULL) {
2954 CERROR("Dropping GET (%llu:%d:%s): MD (%d) invalid\n",
2955 match_bits, portal, libcfs_id2str(target),
2956 md == NULL ? -1 : md->md_threshold);
2957 if (md != NULL && md->md_me != NULL)
2958 CERROR("REPLY MD also attached to portal %d\n",
2959 md->md_me->me_portal);
2961 lnet_res_unlock(cpt);
2967 CDEBUG(D_NET, "LNetGet -> %s\n", libcfs_id2str(target));
2969 lnet_msg_attach_md(msg, md, 0, 0);
2971 lnet_prep_send(msg, LNET_MSG_GET, target, 0, 0);
2973 msg->msg_hdr.msg.get.match_bits = cpu_to_le64(match_bits);
2974 msg->msg_hdr.msg.get.ptl_index = cpu_to_le32(portal);
2975 msg->msg_hdr.msg.get.src_offset = cpu_to_le32(offset);
2976 msg->msg_hdr.msg.get.sink_length = cpu_to_le32(md->md_length);
2978 /* NB handles only looked up by creator (no flips) */
2979 msg->msg_hdr.msg.get.return_wmd.wh_interface_cookie =
2980 the_lnet.ln_interface_cookie;
2981 msg->msg_hdr.msg.get.return_wmd.wh_object_cookie =
2982 md->md_lh.lh_cookie;
2984 lnet_res_unlock(cpt);
2986 lnet_build_msg_event(msg, LNET_EVENT_SEND);
2988 rc = lnet_send(self, msg, LNET_NID_ANY);
2990 CNETERR("Error sending GET to %s: %d\n",
2991 libcfs_id2str(target), rc);
2992 lnet_finalize(msg, rc);
2995 /* completion will be signalled by an event */
2998 EXPORT_SYMBOL(LNetGet);
3001 * Calculate distance to node at \a dstnid.
3003 * \param dstnid Target NID.
3004 * \param srcnidp If not NULL, NID of the local interface to reach \a dstnid
3006 * \param orderp If not NULL, order of the route to reach \a dstnid is saved
3009 * \retval 0 If \a dstnid belongs to a local interface, and reserved option
3010 * local_nid_dist_zero is set, which is the default.
3011 * \retval positives Distance to target NID, i.e. number of hops plus one.
3012 * \retval -EHOSTUNREACH If \a dstnid is not reachable.
3015 LNetDist(lnet_nid_t dstnid, lnet_nid_t *srcnidp, __u32 *orderp)
3017 struct list_head *e;
3018 struct lnet_ni *ni = NULL;
3019 struct lnet_remotenet *rnet;
3020 __u32 dstnet = LNET_NIDNET(dstnid);
3024 struct list_head *rn_list;
3026 /* if !local_nid_dist_zero, I don't return a distance of 0 ever
3027 * (when lustre sees a distance of 0, it substitutes 0@lo), so I
3028 * keep order 0 free for 0@lo and order 1 free for a local NID
3031 LASSERT(the_lnet.ln_refcount > 0);
3033 cpt = lnet_net_lock_current();
3035 while ((ni = lnet_get_next_ni_locked(NULL, ni))) {
3036 if (ni->ni_nid == dstnid) {
3037 if (srcnidp != NULL)
3039 if (orderp != NULL) {
3040 if (LNET_NETTYP(LNET_NIDNET(dstnid)) == LOLND)
3045 lnet_net_unlock(cpt);
3047 return local_nid_dist_zero ? 0 : 1;
3050 if (LNET_NIDNET(ni->ni_nid) == dstnet) {
3051 /* Check if ni was originally created in
3052 * current net namespace.
3053 * If not, assign order above 0xffff0000,
3054 * to make this ni not a priority. */
3055 if (!net_eq(ni->ni_net_ns, current->nsproxy->net_ns))
3056 order += 0xffff0000;
3058 if (srcnidp != NULL)
3059 *srcnidp = ni->ni_nid;
3062 lnet_net_unlock(cpt);
3069 rn_list = lnet_net2rnethash(dstnet);
3070 list_for_each(e, rn_list) {
3071 rnet = list_entry(e, struct lnet_remotenet, lrn_list);
3073 if (rnet->lrn_net == dstnet) {
3074 struct lnet_route *route;
3075 struct lnet_route *shortest = NULL;
3076 __u32 shortest_hops = LNET_UNDEFINED_HOPS;
3079 LASSERT(!list_empty(&rnet->lrn_routes));
3081 list_for_each_entry(route, &rnet->lrn_routes,
3083 route_hops = route->lr_hops;
3084 if (route_hops == LNET_UNDEFINED_HOPS)
3086 if (shortest == NULL ||
3087 route_hops < shortest_hops) {
3089 shortest_hops = route_hops;
3093 LASSERT(shortest != NULL);
3094 hops = shortest_hops;
3095 if (srcnidp != NULL) {
3096 ni = lnet_get_next_ni_locked(
3097 shortest->lr_gateway->lpni_net,
3099 *srcnidp = ni->ni_nid;
3103 lnet_net_unlock(cpt);
3109 lnet_net_unlock(cpt);
3110 return -EHOSTUNREACH;
3112 EXPORT_SYMBOL(LNetDist);