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.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2007, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2012, 2014, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
39 #define DEBUG_SUBSYSTEM S_LNET
41 #include <lnet/lib-lnet.h>
42 #include <lnet/lib-dlc.h>
45 lnet_peer_tables_create(void)
47 struct lnet_peer_table *ptable;
48 struct list_head *hash;
52 the_lnet.ln_peer_tables = cfs_percpt_alloc(lnet_cpt_table(),
54 if (the_lnet.ln_peer_tables == NULL) {
55 CERROR("Failed to allocate cpu-partition peer tables\n");
59 cfs_percpt_for_each(ptable, i, the_lnet.ln_peer_tables) {
60 INIT_LIST_HEAD(&ptable->pt_deathrow);
62 LIBCFS_CPT_ALLOC(hash, lnet_cpt_table(), i,
63 LNET_PEER_HASH_SIZE * sizeof(*hash));
65 CERROR("Failed to create peer hash table\n");
66 lnet_peer_tables_destroy();
70 for (j = 0; j < LNET_PEER_HASH_SIZE; j++)
71 INIT_LIST_HEAD(&hash[j]);
72 ptable->pt_hash = hash; /* sign of initialization */
79 lnet_peer_tables_destroy(void)
81 struct lnet_peer_table *ptable;
82 struct list_head *hash;
86 if (the_lnet.ln_peer_tables == NULL)
89 cfs_percpt_for_each(ptable, i, the_lnet.ln_peer_tables) {
90 hash = ptable->pt_hash;
91 if (hash == NULL) /* not intialized */
94 LASSERT(list_empty(&ptable->pt_deathrow));
96 ptable->pt_hash = NULL;
97 for (j = 0; j < LNET_PEER_HASH_SIZE; j++)
98 LASSERT(list_empty(&hash[j]));
100 LIBCFS_FREE(hash, LNET_PEER_HASH_SIZE * sizeof(*hash));
103 cfs_percpt_free(the_lnet.ln_peer_tables);
104 the_lnet.ln_peer_tables = NULL;
108 lnet_peer_table_cleanup_locked(lnet_ni_t *ni, struct lnet_peer_table *ptable)
114 for (i = 0; i < LNET_PEER_HASH_SIZE; i++) {
115 list_for_each_entry_safe(lp, tmp, &ptable->pt_hash[i],
117 if (ni != NULL && ni != lp->lp_ni)
119 list_del_init(&lp->lp_hashlist);
120 /* Lose hash table's ref */
121 ptable->pt_zombies++;
122 lnet_peer_decref_locked(lp);
128 lnet_peer_table_deathrow_wait_locked(struct lnet_peer_table *ptable,
133 for (i = 3; ptable->pt_zombies != 0; i++) {
134 lnet_net_unlock(cpt_locked);
138 "Waiting for %d zombies on peer table\n",
141 set_current_state(TASK_UNINTERRUPTIBLE);
142 schedule_timeout(cfs_time_seconds(1) >> 1);
143 lnet_net_lock(cpt_locked);
148 lnet_peer_table_del_rtrs_locked(lnet_ni_t *ni, struct lnet_peer_table *ptable,
156 for (i = 0; i < LNET_PEER_HASH_SIZE; i++) {
157 list_for_each_entry_safe(lp, tmp, &ptable->pt_hash[i],
162 if (lp->lp_rtr_refcount == 0)
167 lnet_net_unlock(cpt_locked);
168 lnet_del_route(LNET_NIDNET(LNET_NID_ANY), lp_nid);
169 lnet_net_lock(cpt_locked);
175 lnet_peer_tables_cleanup(lnet_ni_t *ni)
178 struct lnet_peer_table *ptable;
180 struct list_head deathrow;
182 INIT_LIST_HEAD(&deathrow);
184 LASSERT(the_lnet.ln_shutdown || ni != NULL);
185 /* If just deleting the peers for a NI, get rid of any routes these
186 * peers are gateways for. */
187 cfs_percpt_for_each(ptable, i, the_lnet.ln_peer_tables) {
189 lnet_peer_table_del_rtrs_locked(ni, ptable, i);
193 /* Start the process of moving the applicable peers to
195 cfs_percpt_for_each(ptable, i, the_lnet.ln_peer_tables) {
197 lnet_peer_table_cleanup_locked(ni, ptable);
201 /* Cleanup all entries on deathrow. */
202 cfs_percpt_for_each(ptable, i, the_lnet.ln_peer_tables) {
204 lnet_peer_table_deathrow_wait_locked(ptable, i);
205 list_splice_init(&ptable->pt_deathrow, &deathrow);
209 while (!list_empty(&deathrow)) {
210 lp = list_entry(deathrow.next, lnet_peer_t, lp_hashlist);
211 list_del(&lp->lp_hashlist);
212 LIBCFS_FREE(lp, sizeof(*lp));
217 lnet_destroy_peer_locked(lnet_peer_t *lp)
219 struct lnet_peer_table *ptable;
221 LASSERT(lp->lp_refcount == 0);
222 LASSERT(lp->lp_rtr_refcount == 0);
223 LASSERT(list_empty(&lp->lp_txq));
224 LASSERT(list_empty(&lp->lp_hashlist));
225 LASSERT(lp->lp_txqnob == 0);
227 ptable = the_lnet.ln_peer_tables[lp->lp_cpt];
228 LASSERT(ptable->pt_number > 0);
231 lnet_ni_decref_locked(lp->lp_ni, lp->lp_cpt);
234 list_add(&lp->lp_hashlist, &ptable->pt_deathrow);
235 LASSERT(ptable->pt_zombies > 0);
236 ptable->pt_zombies--;
240 lnet_find_peer_locked(struct lnet_peer_table *ptable, lnet_nid_t nid)
242 struct list_head *peers;
245 LASSERT(!the_lnet.ln_shutdown);
247 peers = &ptable->pt_hash[lnet_nid2peerhash(nid)];
248 list_for_each_entry(lp, peers, lp_hashlist) {
249 if (lp->lp_nid == nid) {
250 lnet_peer_addref_locked(lp);
259 lnet_nid2peer_locked(lnet_peer_t **lpp, lnet_nid_t nid, int cpt)
261 struct lnet_peer_table *ptable;
262 lnet_peer_t *lp = NULL;
268 if (the_lnet.ln_shutdown) /* it's shutting down */
271 /* cpt can be LNET_LOCK_EX if it's called from router functions */
272 cpt2 = cpt != LNET_LOCK_EX ? cpt : lnet_cpt_of_nid_locked(nid);
274 ptable = the_lnet.ln_peer_tables[cpt2];
275 lp = lnet_find_peer_locked(ptable, nid);
281 if (!list_empty(&ptable->pt_deathrow)) {
282 lp = list_entry(ptable->pt_deathrow.next,
283 lnet_peer_t, lp_hashlist);
284 list_del(&lp->lp_hashlist);
288 * take extra refcount in case another thread has shutdown LNet
289 * and destroyed locks and peer-table before I finish the allocation
292 lnet_net_unlock(cpt);
295 memset(lp, 0, sizeof(*lp));
297 LIBCFS_CPT_ALLOC(lp, lnet_cpt_table(), cpt2, sizeof(*lp));
305 INIT_LIST_HEAD(&lp->lp_txq);
306 INIT_LIST_HEAD(&lp->lp_rtrq);
307 INIT_LIST_HEAD(&lp->lp_routes);
310 lp->lp_notifylnd = 0;
311 lp->lp_notifying = 0;
312 lp->lp_alive_count = 0;
313 lp->lp_timestamp = 0;
314 lp->lp_alive = !lnet_peers_start_down(); /* 1 bit!! */
315 lp->lp_last_alive = cfs_time_current(); /* assumes alive */
316 lp->lp_last_query = 0; /* haven't asked NI yet */
317 lp->lp_ping_timestamp = 0;
318 lp->lp_ping_feats = LNET_PING_FEAT_INVAL;
321 lp->lp_refcount = 2; /* 1 for caller; 1 for hash */
322 lp->lp_rtr_refcount = 0;
326 if (the_lnet.ln_shutdown) {
331 lp2 = lnet_find_peer_locked(ptable, nid);
337 lp->lp_ni = lnet_net2ni_locked(LNET_NIDNET(nid), cpt2);
338 if (lp->lp_ni == NULL) {
344 lp->lp_mintxcredits = lp->lp_ni->ni_peertxcredits;
346 lp->lp_minrtrcredits = lnet_peer_buffer_credits(lp->lp_ni);
348 list_add_tail(&lp->lp_hashlist,
349 &ptable->pt_hash[lnet_nid2peerhash(nid)]);
350 ptable->pt_version++;
356 list_add(&lp->lp_hashlist, &ptable->pt_deathrow);
362 lnet_debug_peer(lnet_nid_t nid)
364 char *aliveness = "NA";
369 cpt = lnet_cpt_of_nid(nid);
372 rc = lnet_nid2peer_locked(&lp, nid, cpt);
374 lnet_net_unlock(cpt);
375 CDEBUG(D_WARNING, "No peer %s\n", libcfs_nid2str(nid));
379 if (lnet_isrouter(lp) || lnet_peer_aliveness_enabled(lp))
380 aliveness = lp->lp_alive ? "up" : "down";
382 CDEBUG(D_WARNING, "%-24s %4d %5s %5d %5d %5d %5d %5d %ld\n",
383 libcfs_nid2str(lp->lp_nid), lp->lp_refcount,
384 aliveness, lp->lp_ni->ni_peertxcredits,
385 lp->lp_rtrcredits, lp->lp_minrtrcredits,
386 lp->lp_txcredits, lp->lp_mintxcredits, lp->lp_txqnob);
388 lnet_peer_decref_locked(lp);
390 lnet_net_unlock(cpt);
393 int lnet_get_peer_info(__u32 peer_index, __u64 *nid,
394 char aliveness[LNET_MAX_STR_LEN],
395 __u32 *cpt_iter, __u32 *refcount,
396 __u32 *ni_peer_tx_credits, __u32 *peer_tx_credits,
397 __u32 *peer_rtr_credits, __u32 *peer_min_rtr_credits,
400 struct lnet_peer_table *peer_table;
406 /* get the number of CPTs */
407 lncpt = cfs_percpt_number(the_lnet.ln_peer_tables);
409 /* if the cpt number to be examined is >= the number of cpts in
410 * the system then indicate that there are no more cpts to examin
412 if (*cpt_iter > lncpt)
415 /* get the current table */
416 peer_table = the_lnet.ln_peer_tables[*cpt_iter];
417 /* if the ptable is NULL then there are no more cpts to examine */
418 if (peer_table == NULL)
421 lnet_net_lock(*cpt_iter);
423 for (j = 0; j < LNET_PEER_HASH_SIZE && !found; j++) {
424 struct list_head *peers = &peer_table->pt_hash[j];
426 list_for_each_entry(lp, peers, lp_hashlist) {
427 if (peer_index-- > 0)
430 snprintf(aliveness, LNET_MAX_STR_LEN, "NA");
431 if (lnet_isrouter(lp) ||
432 lnet_peer_aliveness_enabled(lp))
433 snprintf(aliveness, LNET_MAX_STR_LEN,
434 lp->lp_alive ? "up" : "down");
437 *refcount = lp->lp_refcount;
438 *ni_peer_tx_credits = lp->lp_ni->ni_peertxcredits;
439 *peer_tx_credits = lp->lp_txcredits;
440 *peer_rtr_credits = lp->lp_rtrcredits;
441 *peer_min_rtr_credits = lp->lp_mintxcredits;
442 *peer_tx_qnob = lp->lp_txqnob;
448 lnet_net_unlock(*cpt_iter);
452 return found ? 0 : -ENOENT;