1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39#define DEBUG_SUBSYSTEM S_LNET
40
41#include "../../include/linux/lnet/lib-lnet.h"
42#include "../../include/linux/lnet/lib-dlc.h"
43
44int
45lnet_peer_tables_create(void)
46{
47 struct lnet_peer_table *ptable;
48 struct list_head *hash;
49 int i;
50 int j;
51
52 the_lnet.ln_peer_tables = cfs_percpt_alloc(lnet_cpt_table(),
53 sizeof(*ptable));
54 if (!the_lnet.ln_peer_tables) {
55 CERROR("Failed to allocate cpu-partition peer tables\n");
56 return -ENOMEM;
57 }
58
59 cfs_percpt_for_each(ptable, i, the_lnet.ln_peer_tables) {
60 INIT_LIST_HEAD(&ptable->pt_deathrow);
61
62 LIBCFS_CPT_ALLOC(hash, lnet_cpt_table(), i,
63 LNET_PEER_HASH_SIZE * sizeof(*hash));
64 if (!hash) {
65 CERROR("Failed to create peer hash table\n");
66 lnet_peer_tables_destroy();
67 return -ENOMEM;
68 }
69
70 for (j = 0; j < LNET_PEER_HASH_SIZE; j++)
71 INIT_LIST_HEAD(&hash[j]);
72 ptable->pt_hash = hash;
73 }
74
75 return 0;
76}
77
78void
79lnet_peer_tables_destroy(void)
80{
81 struct lnet_peer_table *ptable;
82 struct list_head *hash;
83 int i;
84 int j;
85
86 if (!the_lnet.ln_peer_tables)
87 return;
88
89 cfs_percpt_for_each(ptable, i, the_lnet.ln_peer_tables) {
90 hash = ptable->pt_hash;
91 if (!hash)
92 break;
93
94 LASSERT(list_empty(&ptable->pt_deathrow));
95
96 ptable->pt_hash = NULL;
97 for (j = 0; j < LNET_PEER_HASH_SIZE; j++)
98 LASSERT(list_empty(&hash[j]));
99
100 LIBCFS_FREE(hash, LNET_PEER_HASH_SIZE * sizeof(*hash));
101 }
102
103 cfs_percpt_free(the_lnet.ln_peer_tables);
104 the_lnet.ln_peer_tables = NULL;
105}
106
107static void
108lnet_peer_table_cleanup_locked(lnet_ni_t *ni, struct lnet_peer_table *ptable)
109{
110 int i;
111 lnet_peer_t *lp;
112 lnet_peer_t *tmp;
113
114 for (i = 0; i < LNET_PEER_HASH_SIZE; i++) {
115 list_for_each_entry_safe(lp, tmp, &ptable->pt_hash[i],
116 lp_hashlist) {
117 if (ni && ni != lp->lp_ni)
118 continue;
119 list_del_init(&lp->lp_hashlist);
120
121 ptable->pt_zombies++;
122 lnet_peer_decref_locked(lp);
123 }
124 }
125}
126
127static void
128lnet_peer_table_deathrow_wait_locked(struct lnet_peer_table *ptable,
129 int cpt_locked)
130{
131 int i;
132
133 for (i = 3; ptable->pt_zombies; i++) {
134 lnet_net_unlock(cpt_locked);
135
136 if (is_power_of_2(i)) {
137 CDEBUG(D_WARNING,
138 "Waiting for %d zombies on peer table\n",
139 ptable->pt_zombies);
140 }
141 set_current_state(TASK_UNINTERRUPTIBLE);
142 schedule_timeout(cfs_time_seconds(1) >> 1);
143 lnet_net_lock(cpt_locked);
144 }
145}
146
147static void
148lnet_peer_table_del_rtrs_locked(lnet_ni_t *ni, struct lnet_peer_table *ptable,
149 int cpt_locked)
150{
151 lnet_peer_t *lp;
152 lnet_peer_t *tmp;
153 lnet_nid_t lp_nid;
154 int i;
155
156 for (i = 0; i < LNET_PEER_HASH_SIZE; i++) {
157 list_for_each_entry_safe(lp, tmp, &ptable->pt_hash[i],
158 lp_hashlist) {
159 if (ni != lp->lp_ni)
160 continue;
161
162 if (!lp->lp_rtr_refcount)
163 continue;
164
165 lp_nid = lp->lp_nid;
166
167 lnet_net_unlock(cpt_locked);
168 lnet_del_route(LNET_NIDNET(LNET_NID_ANY), lp_nid);
169 lnet_net_lock(cpt_locked);
170 }
171 }
172}
173
174void
175lnet_peer_tables_cleanup(lnet_ni_t *ni)
176{
177 struct lnet_peer_table *ptable;
178 struct list_head deathrow;
179 lnet_peer_t *lp;
180 lnet_peer_t *temp;
181 int i;
182
183 INIT_LIST_HEAD(&deathrow);
184
185 LASSERT(the_lnet.ln_shutdown || ni);
186
187
188
189
190 cfs_percpt_for_each(ptable, i, the_lnet.ln_peer_tables) {
191 lnet_net_lock(i);
192 lnet_peer_table_del_rtrs_locked(ni, ptable, i);
193 lnet_net_unlock(i);
194 }
195
196
197
198
199
200 cfs_percpt_for_each(ptable, i, the_lnet.ln_peer_tables) {
201 lnet_net_lock(i);
202 lnet_peer_table_cleanup_locked(ni, ptable);
203 lnet_net_unlock(i);
204 }
205
206
207 cfs_percpt_for_each(ptable, i, the_lnet.ln_peer_tables) {
208 lnet_net_lock(i);
209 lnet_peer_table_deathrow_wait_locked(ptable, i);
210 list_splice_init(&ptable->pt_deathrow, &deathrow);
211 lnet_net_unlock(i);
212 }
213
214 list_for_each_entry_safe(lp, temp, &deathrow, lp_hashlist) {
215 list_del(&lp->lp_hashlist);
216 LIBCFS_FREE(lp, sizeof(*lp));
217 }
218}
219
220void
221lnet_destroy_peer_locked(lnet_peer_t *lp)
222{
223 struct lnet_peer_table *ptable;
224
225 LASSERT(!lp->lp_refcount);
226 LASSERT(!lp->lp_rtr_refcount);
227 LASSERT(list_empty(&lp->lp_txq));
228 LASSERT(list_empty(&lp->lp_hashlist));
229 LASSERT(!lp->lp_txqnob);
230
231 ptable = the_lnet.ln_peer_tables[lp->lp_cpt];
232 LASSERT(ptable->pt_number > 0);
233 ptable->pt_number--;
234
235 lnet_ni_decref_locked(lp->lp_ni, lp->lp_cpt);
236 lp->lp_ni = NULL;
237
238 list_add(&lp->lp_hashlist, &ptable->pt_deathrow);
239 LASSERT(ptable->pt_zombies > 0);
240 ptable->pt_zombies--;
241}
242
243lnet_peer_t *
244lnet_find_peer_locked(struct lnet_peer_table *ptable, lnet_nid_t nid)
245{
246 struct list_head *peers;
247 lnet_peer_t *lp;
248
249 LASSERT(!the_lnet.ln_shutdown);
250
251 peers = &ptable->pt_hash[lnet_nid2peerhash(nid)];
252 list_for_each_entry(lp, peers, lp_hashlist) {
253 if (lp->lp_nid == nid) {
254 lnet_peer_addref_locked(lp);
255 return lp;
256 }
257 }
258
259 return NULL;
260}
261
262int
263lnet_nid2peer_locked(lnet_peer_t **lpp, lnet_nid_t nid, int cpt)
264{
265 struct lnet_peer_table *ptable;
266 lnet_peer_t *lp = NULL;
267 lnet_peer_t *lp2;
268 int cpt2;
269 int rc = 0;
270
271 *lpp = NULL;
272 if (the_lnet.ln_shutdown)
273 return -ESHUTDOWN;
274
275
276 cpt2 = cpt != LNET_LOCK_EX ? cpt : lnet_cpt_of_nid_locked(nid);
277
278 ptable = the_lnet.ln_peer_tables[cpt2];
279 lp = lnet_find_peer_locked(ptable, nid);
280 if (lp) {
281 *lpp = lp;
282 return 0;
283 }
284
285 if (!list_empty(&ptable->pt_deathrow)) {
286 lp = list_entry(ptable->pt_deathrow.next,
287 lnet_peer_t, lp_hashlist);
288 list_del(&lp->lp_hashlist);
289 }
290
291
292
293
294
295 ptable->pt_number++;
296 lnet_net_unlock(cpt);
297
298 if (lp)
299 memset(lp, 0, sizeof(*lp));
300 else
301 LIBCFS_CPT_ALLOC(lp, lnet_cpt_table(), cpt2, sizeof(*lp));
302
303 if (!lp) {
304 rc = -ENOMEM;
305 lnet_net_lock(cpt);
306 goto out;
307 }
308
309 INIT_LIST_HEAD(&lp->lp_txq);
310 INIT_LIST_HEAD(&lp->lp_rtrq);
311 INIT_LIST_HEAD(&lp->lp_routes);
312
313 lp->lp_notify = 0;
314 lp->lp_notifylnd = 0;
315 lp->lp_notifying = 0;
316 lp->lp_alive_count = 0;
317 lp->lp_timestamp = 0;
318 lp->lp_alive = !lnet_peers_start_down();
319 lp->lp_last_alive = cfs_time_current();
320 lp->lp_last_query = 0;
321 lp->lp_ping_timestamp = 0;
322 lp->lp_ping_feats = LNET_PING_FEAT_INVAL;
323 lp->lp_nid = nid;
324 lp->lp_cpt = cpt2;
325 lp->lp_refcount = 2;
326 lp->lp_rtr_refcount = 0;
327
328 lnet_net_lock(cpt);
329
330 if (the_lnet.ln_shutdown) {
331 rc = -ESHUTDOWN;
332 goto out;
333 }
334
335 lp2 = lnet_find_peer_locked(ptable, nid);
336 if (lp2) {
337 *lpp = lp2;
338 goto out;
339 }
340
341 lp->lp_ni = lnet_net2ni_locked(LNET_NIDNET(nid), cpt2);
342 if (!lp->lp_ni) {
343 rc = -EHOSTUNREACH;
344 goto out;
345 }
346
347 lp->lp_txcredits = lp->lp_ni->ni_peertxcredits;
348 lp->lp_mintxcredits = lp->lp_ni->ni_peertxcredits;
349 lp->lp_rtrcredits = lnet_peer_buffer_credits(lp->lp_ni);
350 lp->lp_minrtrcredits = lnet_peer_buffer_credits(lp->lp_ni);
351
352 list_add_tail(&lp->lp_hashlist,
353 &ptable->pt_hash[lnet_nid2peerhash(nid)]);
354 ptable->pt_version++;
355 *lpp = lp;
356
357 return 0;
358out:
359 if (lp)
360 list_add(&lp->lp_hashlist, &ptable->pt_deathrow);
361 ptable->pt_number--;
362 return rc;
363}
364
365void
366lnet_debug_peer(lnet_nid_t nid)
367{
368 char *aliveness = "NA";
369 lnet_peer_t *lp;
370 int rc;
371 int cpt;
372
373 cpt = lnet_cpt_of_nid(nid);
374 lnet_net_lock(cpt);
375
376 rc = lnet_nid2peer_locked(&lp, nid, cpt);
377 if (rc) {
378 lnet_net_unlock(cpt);
379 CDEBUG(D_WARNING, "No peer %s\n", libcfs_nid2str(nid));
380 return;
381 }
382
383 if (lnet_isrouter(lp) || lnet_peer_aliveness_enabled(lp))
384 aliveness = lp->lp_alive ? "up" : "down";
385
386 CDEBUG(D_WARNING, "%-24s %4d %5s %5d %5d %5d %5d %5d %ld\n",
387 libcfs_nid2str(lp->lp_nid), lp->lp_refcount,
388 aliveness, lp->lp_ni->ni_peertxcredits,
389 lp->lp_rtrcredits, lp->lp_minrtrcredits,
390 lp->lp_txcredits, lp->lp_mintxcredits, lp->lp_txqnob);
391
392 lnet_peer_decref_locked(lp);
393
394 lnet_net_unlock(cpt);
395}
396
397int
398lnet_get_peer_info(__u32 peer_index, __u64 *nid,
399 char aliveness[LNET_MAX_STR_LEN],
400 __u32 *cpt_iter, __u32 *refcount,
401 __u32 *ni_peer_tx_credits, __u32 *peer_tx_credits,
402 __u32 *peer_rtr_credits, __u32 *peer_min_rtr_credits,
403 __u32 *peer_tx_qnob)
404{
405 struct lnet_peer_table *peer_table;
406 lnet_peer_t *lp;
407 bool found = false;
408 int lncpt, j;
409
410
411 lncpt = cfs_percpt_number(the_lnet.ln_peer_tables);
412
413
414
415
416
417 if (*cpt_iter >= lncpt)
418 return -ENOENT;
419
420
421 peer_table = the_lnet.ln_peer_tables[*cpt_iter];
422
423 if (!peer_table)
424 return -ENOENT;
425
426 lnet_net_lock(*cpt_iter);
427
428 for (j = 0; j < LNET_PEER_HASH_SIZE && !found; j++) {
429 struct list_head *peers = &peer_table->pt_hash[j];
430
431 list_for_each_entry(lp, peers, lp_hashlist) {
432 if (peer_index-- > 0)
433 continue;
434
435 snprintf(aliveness, LNET_MAX_STR_LEN, "NA");
436 if (lnet_isrouter(lp) ||
437 lnet_peer_aliveness_enabled(lp))
438 snprintf(aliveness, LNET_MAX_STR_LEN,
439 lp->lp_alive ? "up" : "down");
440
441 *nid = lp->lp_nid;
442 *refcount = lp->lp_refcount;
443 *ni_peer_tx_credits = lp->lp_ni->ni_peertxcredits;
444 *peer_tx_credits = lp->lp_txcredits;
445 *peer_rtr_credits = lp->lp_rtrcredits;
446 *peer_min_rtr_credits = lp->lp_mintxcredits;
447 *peer_tx_qnob = lp->lp_txqnob;
448
449 found = true;
450 }
451 }
452 lnet_net_unlock(*cpt_iter);
453
454 *cpt_iter = lncpt;
455
456 return found ? 0 : -ENOENT;
457}
458