Loading...
1// SPDX-License-Identifier: GPL-2.0-or-later
2/* AFS server record management
3 *
4 * Copyright (C) 2002, 2007 Red Hat, Inc. All Rights Reserved.
5 * Written by David Howells (dhowells@redhat.com)
6 */
7
8#include <linux/sched.h>
9#include <linux/slab.h>
10#include "afs_fs.h"
11#include "internal.h"
12#include "protocol_yfs.h"
13
14static unsigned afs_server_gc_delay = 10; /* Server record timeout in seconds */
15static atomic_t afs_server_debug_id;
16
17static struct afs_server *afs_maybe_use_server(struct afs_server *,
18 enum afs_server_trace);
19static void __afs_put_server(struct afs_net *, struct afs_server *);
20
21/*
22 * Find a server by one of its addresses.
23 */
24struct afs_server *afs_find_server(struct afs_net *net, const struct rxrpc_peer *peer)
25{
26 const struct afs_endpoint_state *estate;
27 const struct afs_addr_list *alist;
28 struct afs_server *server = NULL;
29 unsigned int i;
30 int seq = 1;
31
32 rcu_read_lock();
33
34 do {
35 if (server)
36 afs_unuse_server_notime(net, server, afs_server_trace_put_find_rsq);
37 server = NULL;
38 seq++; /* 2 on the 1st/lockless path, otherwise odd */
39 read_seqbegin_or_lock(&net->fs_addr_lock, &seq);
40
41 hlist_for_each_entry_rcu(server, &net->fs_addresses, addr_link) {
42 estate = rcu_dereference(server->endpoint_state);
43 alist = estate->addresses;
44 for (i = 0; i < alist->nr_addrs; i++)
45 if (alist->addrs[i].peer == peer)
46 goto found;
47 }
48
49 server = NULL;
50 continue;
51 found:
52 server = afs_maybe_use_server(server, afs_server_trace_get_by_addr);
53
54 } while (need_seqretry(&net->fs_addr_lock, seq));
55
56 done_seqretry(&net->fs_addr_lock, seq);
57
58 rcu_read_unlock();
59 return server;
60}
61
62/*
63 * Look up a server by its UUID and mark it active.
64 */
65struct afs_server *afs_find_server_by_uuid(struct afs_net *net, const uuid_t *uuid)
66{
67 struct afs_server *server = NULL;
68 struct rb_node *p;
69 int diff, seq = 1;
70
71 _enter("%pU", uuid);
72
73 do {
74 /* Unfortunately, rbtree walking doesn't give reliable results
75 * under just the RCU read lock, so we have to check for
76 * changes.
77 */
78 if (server)
79 afs_unuse_server(net, server, afs_server_trace_put_uuid_rsq);
80 server = NULL;
81 seq++; /* 2 on the 1st/lockless path, otherwise odd */
82 read_seqbegin_or_lock(&net->fs_lock, &seq);
83
84 p = net->fs_servers.rb_node;
85 while (p) {
86 server = rb_entry(p, struct afs_server, uuid_rb);
87
88 diff = memcmp(uuid, &server->uuid, sizeof(*uuid));
89 if (diff < 0) {
90 p = p->rb_left;
91 } else if (diff > 0) {
92 p = p->rb_right;
93 } else {
94 afs_use_server(server, afs_server_trace_get_by_uuid);
95 break;
96 }
97
98 server = NULL;
99 }
100 } while (need_seqretry(&net->fs_lock, seq));
101
102 done_seqretry(&net->fs_lock, seq);
103
104 _leave(" = %p", server);
105 return server;
106}
107
108/*
109 * Install a server record in the namespace tree. If there's a clash, we stick
110 * it into a list anchored on whichever afs_server struct is actually in the
111 * tree.
112 */
113static struct afs_server *afs_install_server(struct afs_cell *cell,
114 struct afs_server *candidate)
115{
116 const struct afs_endpoint_state *estate;
117 const struct afs_addr_list *alist;
118 struct afs_server *server, *next;
119 struct afs_net *net = cell->net;
120 struct rb_node **pp, *p;
121 int diff;
122
123 _enter("%p", candidate);
124
125 write_seqlock(&net->fs_lock);
126
127 /* Firstly install the server in the UUID lookup tree */
128 pp = &net->fs_servers.rb_node;
129 p = NULL;
130 while (*pp) {
131 p = *pp;
132 _debug("- consider %p", p);
133 server = rb_entry(p, struct afs_server, uuid_rb);
134 diff = memcmp(&candidate->uuid, &server->uuid, sizeof(uuid_t));
135 if (diff < 0) {
136 pp = &(*pp)->rb_left;
137 } else if (diff > 0) {
138 pp = &(*pp)->rb_right;
139 } else {
140 if (server->cell == cell)
141 goto exists;
142
143 /* We have the same UUID representing servers in
144 * different cells. Append the new server to the list.
145 */
146 for (;;) {
147 next = rcu_dereference_protected(
148 server->uuid_next,
149 lockdep_is_held(&net->fs_lock.lock));
150 if (!next)
151 break;
152 server = next;
153 }
154 rcu_assign_pointer(server->uuid_next, candidate);
155 candidate->uuid_prev = server;
156 server = candidate;
157 goto added_dup;
158 }
159 }
160
161 server = candidate;
162 rb_link_node(&server->uuid_rb, p, pp);
163 rb_insert_color(&server->uuid_rb, &net->fs_servers);
164 hlist_add_head_rcu(&server->proc_link, &net->fs_proc);
165
166 afs_get_cell(cell, afs_cell_trace_get_server);
167
168added_dup:
169 write_seqlock(&net->fs_addr_lock);
170 estate = rcu_dereference_protected(server->endpoint_state,
171 lockdep_is_held(&net->fs_addr_lock.lock));
172 alist = estate->addresses;
173
174 /* Secondly, if the server has any IPv4 and/or IPv6 addresses, install
175 * it in the IPv4 and/or IPv6 reverse-map lists.
176 *
177 * TODO: For speed we want to use something other than a flat list
178 * here; even sorting the list in terms of lowest address would help a
179 * bit, but anything we might want to do gets messy and memory
180 * intensive.
181 */
182 if (alist->nr_addrs > 0)
183 hlist_add_head_rcu(&server->addr_link, &net->fs_addresses);
184
185 write_sequnlock(&net->fs_addr_lock);
186
187exists:
188 afs_get_server(server, afs_server_trace_get_install);
189 write_sequnlock(&net->fs_lock);
190 return server;
191}
192
193/*
194 * Allocate a new server record and mark it active.
195 */
196static struct afs_server *afs_alloc_server(struct afs_cell *cell,
197 const uuid_t *uuid,
198 struct afs_addr_list *alist)
199{
200 struct afs_endpoint_state *estate;
201 struct afs_server *server;
202 struct afs_net *net = cell->net;
203
204 _enter("");
205
206 server = kzalloc(sizeof(struct afs_server), GFP_KERNEL);
207 if (!server)
208 goto enomem;
209
210 estate = kzalloc(sizeof(struct afs_endpoint_state), GFP_KERNEL);
211 if (!estate)
212 goto enomem_server;
213
214 refcount_set(&server->ref, 1);
215 atomic_set(&server->active, 1);
216 server->debug_id = atomic_inc_return(&afs_server_debug_id);
217 server->addr_version = alist->version;
218 server->uuid = *uuid;
219 rwlock_init(&server->fs_lock);
220 INIT_LIST_HEAD(&server->volumes);
221 init_waitqueue_head(&server->probe_wq);
222 INIT_LIST_HEAD(&server->probe_link);
223 spin_lock_init(&server->probe_lock);
224 server->cell = cell;
225 server->rtt = UINT_MAX;
226 server->service_id = FS_SERVICE;
227
228 server->probe_counter = 1;
229 server->probed_at = jiffies - LONG_MAX / 2;
230 refcount_set(&estate->ref, 1);
231 estate->addresses = alist;
232 estate->server_id = server->debug_id;
233 estate->probe_seq = 1;
234 rcu_assign_pointer(server->endpoint_state, estate);
235
236 afs_inc_servers_outstanding(net);
237 trace_afs_server(server->debug_id, 1, 1, afs_server_trace_alloc);
238 trace_afs_estate(estate->server_id, estate->probe_seq, refcount_read(&estate->ref),
239 afs_estate_trace_alloc_server);
240 _leave(" = %p", server);
241 return server;
242
243enomem_server:
244 kfree(server);
245enomem:
246 _leave(" = NULL [nomem]");
247 return NULL;
248}
249
250/*
251 * Look up an address record for a server
252 */
253static struct afs_addr_list *afs_vl_lookup_addrs(struct afs_cell *cell,
254 struct key *key, const uuid_t *uuid)
255{
256 struct afs_vl_cursor vc;
257 struct afs_addr_list *alist = NULL;
258 int ret;
259
260 ret = -ERESTARTSYS;
261 if (afs_begin_vlserver_operation(&vc, cell, key)) {
262 while (afs_select_vlserver(&vc)) {
263 if (test_bit(AFS_VLSERVER_FL_IS_YFS, &vc.server->flags))
264 alist = afs_yfsvl_get_endpoints(&vc, uuid);
265 else
266 alist = afs_vl_get_addrs_u(&vc, uuid);
267 }
268
269 ret = afs_end_vlserver_operation(&vc);
270 }
271
272 return ret < 0 ? ERR_PTR(ret) : alist;
273}
274
275/*
276 * Get or create a fileserver record.
277 */
278struct afs_server *afs_lookup_server(struct afs_cell *cell, struct key *key,
279 const uuid_t *uuid, u32 addr_version)
280{
281 struct afs_addr_list *alist;
282 struct afs_server *server, *candidate;
283
284 _enter("%p,%pU", cell->net, uuid);
285
286 server = afs_find_server_by_uuid(cell->net, uuid);
287 if (server) {
288 if (server->addr_version != addr_version)
289 set_bit(AFS_SERVER_FL_NEEDS_UPDATE, &server->flags);
290 return server;
291 }
292
293 alist = afs_vl_lookup_addrs(cell, key, uuid);
294 if (IS_ERR(alist))
295 return ERR_CAST(alist);
296
297 candidate = afs_alloc_server(cell, uuid, alist);
298 if (!candidate) {
299 afs_put_addrlist(alist, afs_alist_trace_put_server_oom);
300 return ERR_PTR(-ENOMEM);
301 }
302
303 server = afs_install_server(cell, candidate);
304 if (server != candidate) {
305 afs_put_addrlist(alist, afs_alist_trace_put_server_dup);
306 kfree(candidate);
307 } else {
308 /* Immediately dispatch an asynchronous probe to each interface
309 * on the fileserver. This will make sure the repeat-probing
310 * service is started.
311 */
312 afs_fs_probe_fileserver(cell->net, server, alist, key);
313 }
314
315 return server;
316}
317
318/*
319 * Set the server timer to fire after a given delay, assuming it's not already
320 * set for an earlier time.
321 */
322static void afs_set_server_timer(struct afs_net *net, time64_t delay)
323{
324 if (net->live) {
325 afs_inc_servers_outstanding(net);
326 if (timer_reduce(&net->fs_timer, jiffies + delay * HZ))
327 afs_dec_servers_outstanding(net);
328 }
329}
330
331/*
332 * Server management timer. We have an increment on fs_outstanding that we
333 * need to pass along to the work item.
334 */
335void afs_servers_timer(struct timer_list *timer)
336{
337 struct afs_net *net = container_of(timer, struct afs_net, fs_timer);
338
339 _enter("");
340 if (!queue_work(afs_wq, &net->fs_manager))
341 afs_dec_servers_outstanding(net);
342}
343
344/*
345 * Get a reference on a server object.
346 */
347struct afs_server *afs_get_server(struct afs_server *server,
348 enum afs_server_trace reason)
349{
350 unsigned int a;
351 int r;
352
353 __refcount_inc(&server->ref, &r);
354 a = atomic_read(&server->active);
355 trace_afs_server(server->debug_id, r + 1, a, reason);
356 return server;
357}
358
359/*
360 * Try to get a reference on a server object.
361 */
362static struct afs_server *afs_maybe_use_server(struct afs_server *server,
363 enum afs_server_trace reason)
364{
365 unsigned int a;
366 int r;
367
368 if (!__refcount_inc_not_zero(&server->ref, &r))
369 return NULL;
370
371 a = atomic_inc_return(&server->active);
372 trace_afs_server(server->debug_id, r + 1, a, reason);
373 return server;
374}
375
376/*
377 * Get an active count on a server object.
378 */
379struct afs_server *afs_use_server(struct afs_server *server, enum afs_server_trace reason)
380{
381 unsigned int a;
382 int r;
383
384 __refcount_inc(&server->ref, &r);
385 a = atomic_inc_return(&server->active);
386
387 trace_afs_server(server->debug_id, r + 1, a, reason);
388 return server;
389}
390
391/*
392 * Release a reference on a server record.
393 */
394void afs_put_server(struct afs_net *net, struct afs_server *server,
395 enum afs_server_trace reason)
396{
397 unsigned int a, debug_id = server->debug_id;
398 bool zero;
399 int r;
400
401 if (!server)
402 return;
403
404 a = atomic_read(&server->active);
405 zero = __refcount_dec_and_test(&server->ref, &r);
406 trace_afs_server(debug_id, r - 1, a, reason);
407 if (unlikely(zero))
408 __afs_put_server(net, server);
409}
410
411/*
412 * Drop an active count on a server object without updating the last-unused
413 * time.
414 */
415void afs_unuse_server_notime(struct afs_net *net, struct afs_server *server,
416 enum afs_server_trace reason)
417{
418 if (server) {
419 unsigned int active = atomic_dec_return(&server->active);
420
421 if (active == 0)
422 afs_set_server_timer(net, afs_server_gc_delay);
423 afs_put_server(net, server, reason);
424 }
425}
426
427/*
428 * Drop an active count on a server object.
429 */
430void afs_unuse_server(struct afs_net *net, struct afs_server *server,
431 enum afs_server_trace reason)
432{
433 if (server) {
434 server->unuse_time = ktime_get_real_seconds();
435 afs_unuse_server_notime(net, server, reason);
436 }
437}
438
439static void afs_server_rcu(struct rcu_head *rcu)
440{
441 struct afs_server *server = container_of(rcu, struct afs_server, rcu);
442
443 trace_afs_server(server->debug_id, refcount_read(&server->ref),
444 atomic_read(&server->active), afs_server_trace_free);
445 afs_put_endpoint_state(rcu_access_pointer(server->endpoint_state),
446 afs_estate_trace_put_server);
447 afs_put_cell(server->cell, afs_cell_trace_put_server);
448 kfree(server);
449}
450
451static void __afs_put_server(struct afs_net *net, struct afs_server *server)
452{
453 call_rcu(&server->rcu, afs_server_rcu);
454 afs_dec_servers_outstanding(net);
455}
456
457static void afs_give_up_callbacks(struct afs_net *net, struct afs_server *server)
458{
459 struct afs_endpoint_state *estate = rcu_access_pointer(server->endpoint_state);
460 struct afs_addr_list *alist = estate->addresses;
461
462 afs_fs_give_up_all_callbacks(net, server, &alist->addrs[alist->preferred], NULL);
463}
464
465/*
466 * destroy a dead server
467 */
468static void afs_destroy_server(struct afs_net *net, struct afs_server *server)
469{
470 if (test_bit(AFS_SERVER_FL_MAY_HAVE_CB, &server->flags))
471 afs_give_up_callbacks(net, server);
472
473 afs_put_server(net, server, afs_server_trace_destroy);
474}
475
476/*
477 * Garbage collect any expired servers.
478 */
479static void afs_gc_servers(struct afs_net *net, struct afs_server *gc_list)
480{
481 struct afs_server *server, *next, *prev;
482 int active;
483
484 while ((server = gc_list)) {
485 gc_list = server->gc_next;
486
487 write_seqlock(&net->fs_lock);
488
489 active = atomic_read(&server->active);
490 if (active == 0) {
491 trace_afs_server(server->debug_id, refcount_read(&server->ref),
492 active, afs_server_trace_gc);
493 next = rcu_dereference_protected(
494 server->uuid_next, lockdep_is_held(&net->fs_lock.lock));
495 prev = server->uuid_prev;
496 if (!prev) {
497 /* The one at the front is in the tree */
498 if (!next) {
499 rb_erase(&server->uuid_rb, &net->fs_servers);
500 } else {
501 rb_replace_node_rcu(&server->uuid_rb,
502 &next->uuid_rb,
503 &net->fs_servers);
504 next->uuid_prev = NULL;
505 }
506 } else {
507 /* This server is not at the front */
508 rcu_assign_pointer(prev->uuid_next, next);
509 if (next)
510 next->uuid_prev = prev;
511 }
512
513 list_del(&server->probe_link);
514 hlist_del_rcu(&server->proc_link);
515 if (!hlist_unhashed(&server->addr_link))
516 hlist_del_rcu(&server->addr_link);
517 }
518 write_sequnlock(&net->fs_lock);
519
520 if (active == 0)
521 afs_destroy_server(net, server);
522 }
523}
524
525/*
526 * Manage the records of servers known to be within a network namespace. This
527 * includes garbage collecting unused servers.
528 *
529 * Note also that we were given an increment on net->servers_outstanding by
530 * whoever queued us that we need to deal with before returning.
531 */
532void afs_manage_servers(struct work_struct *work)
533{
534 struct afs_net *net = container_of(work, struct afs_net, fs_manager);
535 struct afs_server *gc_list = NULL;
536 struct rb_node *cursor;
537 time64_t now = ktime_get_real_seconds(), next_manage = TIME64_MAX;
538 bool purging = !net->live;
539
540 _enter("");
541
542 /* Trawl the server list looking for servers that have expired from
543 * lack of use.
544 */
545 read_seqlock_excl(&net->fs_lock);
546
547 for (cursor = rb_first(&net->fs_servers); cursor; cursor = rb_next(cursor)) {
548 struct afs_server *server =
549 rb_entry(cursor, struct afs_server, uuid_rb);
550 int active = atomic_read(&server->active);
551
552 _debug("manage %pU %u", &server->uuid, active);
553
554 if (purging) {
555 trace_afs_server(server->debug_id, refcount_read(&server->ref),
556 active, afs_server_trace_purging);
557 if (active != 0)
558 pr_notice("Can't purge s=%08x\n", server->debug_id);
559 }
560
561 if (active == 0) {
562 time64_t expire_at = server->unuse_time;
563
564 if (!test_bit(AFS_SERVER_FL_VL_FAIL, &server->flags) &&
565 !test_bit(AFS_SERVER_FL_NOT_FOUND, &server->flags))
566 expire_at += afs_server_gc_delay;
567 if (purging || expire_at <= now) {
568 server->gc_next = gc_list;
569 gc_list = server;
570 } else if (expire_at < next_manage) {
571 next_manage = expire_at;
572 }
573 }
574 }
575
576 read_sequnlock_excl(&net->fs_lock);
577
578 /* Update the timer on the way out. We have to pass an increment on
579 * servers_outstanding in the namespace that we are in to the timer or
580 * the work scheduler.
581 */
582 if (!purging && next_manage < TIME64_MAX) {
583 now = ktime_get_real_seconds();
584
585 if (next_manage - now <= 0) {
586 if (queue_work(afs_wq, &net->fs_manager))
587 afs_inc_servers_outstanding(net);
588 } else {
589 afs_set_server_timer(net, next_manage - now);
590 }
591 }
592
593 afs_gc_servers(net, gc_list);
594
595 afs_dec_servers_outstanding(net);
596 _leave(" [%d]", atomic_read(&net->servers_outstanding));
597}
598
599static void afs_queue_server_manager(struct afs_net *net)
600{
601 afs_inc_servers_outstanding(net);
602 if (!queue_work(afs_wq, &net->fs_manager))
603 afs_dec_servers_outstanding(net);
604}
605
606/*
607 * Purge list of servers.
608 */
609void afs_purge_servers(struct afs_net *net)
610{
611 _enter("");
612
613 if (del_timer_sync(&net->fs_timer))
614 afs_dec_servers_outstanding(net);
615
616 afs_queue_server_manager(net);
617
618 _debug("wait");
619 atomic_dec(&net->servers_outstanding);
620 wait_var_event(&net->servers_outstanding,
621 !atomic_read(&net->servers_outstanding));
622 _leave("");
623}
624
625/*
626 * Get an update for a server's address list.
627 */
628static noinline bool afs_update_server_record(struct afs_operation *op,
629 struct afs_server *server,
630 struct key *key)
631{
632 struct afs_endpoint_state *estate;
633 struct afs_addr_list *alist;
634 bool has_addrs;
635
636 _enter("");
637
638 trace_afs_server(server->debug_id, refcount_read(&server->ref),
639 atomic_read(&server->active),
640 afs_server_trace_update);
641
642 alist = afs_vl_lookup_addrs(op->volume->cell, op->key, &server->uuid);
643 if (IS_ERR(alist)) {
644 rcu_read_lock();
645 estate = rcu_dereference(server->endpoint_state);
646 has_addrs = estate->addresses;
647 rcu_read_unlock();
648
649 if ((PTR_ERR(alist) == -ERESTARTSYS ||
650 PTR_ERR(alist) == -EINTR) &&
651 (op->flags & AFS_OPERATION_UNINTR) &&
652 has_addrs) {
653 _leave(" = t [intr]");
654 return true;
655 }
656 afs_op_set_error(op, PTR_ERR(alist));
657 _leave(" = f [%d]", afs_op_error(op));
658 return false;
659 }
660
661 if (server->addr_version != alist->version)
662 afs_fs_probe_fileserver(op->net, server, alist, key);
663
664 afs_put_addrlist(alist, afs_alist_trace_put_server_update);
665 _leave(" = t");
666 return true;
667}
668
669/*
670 * See if a server's address list needs updating.
671 */
672bool afs_check_server_record(struct afs_operation *op, struct afs_server *server,
673 struct key *key)
674{
675 bool success;
676 int ret, retries = 0;
677
678 _enter("");
679
680 ASSERT(server);
681
682retry:
683 if (test_bit(AFS_SERVER_FL_UPDATING, &server->flags))
684 goto wait;
685 if (test_bit(AFS_SERVER_FL_NEEDS_UPDATE, &server->flags))
686 goto update;
687 _leave(" = t [good]");
688 return true;
689
690update:
691 if (!test_and_set_bit_lock(AFS_SERVER_FL_UPDATING, &server->flags)) {
692 clear_bit(AFS_SERVER_FL_NEEDS_UPDATE, &server->flags);
693 success = afs_update_server_record(op, server, key);
694 clear_bit_unlock(AFS_SERVER_FL_UPDATING, &server->flags);
695 wake_up_bit(&server->flags, AFS_SERVER_FL_UPDATING);
696 _leave(" = %d", success);
697 return success;
698 }
699
700wait:
701 ret = wait_on_bit(&server->flags, AFS_SERVER_FL_UPDATING,
702 (op->flags & AFS_OPERATION_UNINTR) ?
703 TASK_UNINTERRUPTIBLE : TASK_INTERRUPTIBLE);
704 if (ret == -ERESTARTSYS) {
705 afs_op_set_error(op, ret);
706 _leave(" = f [intr]");
707 return false;
708 }
709
710 retries++;
711 if (retries == 4) {
712 _leave(" = f [stale]");
713 ret = -ESTALE;
714 return false;
715 }
716 goto retry;
717}
1/* AFS server record management
2 *
3 * Copyright (C) 2002, 2007 Red Hat, Inc. All Rights Reserved.
4 * Written by David Howells (dhowells@redhat.com)
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 */
11
12#include <linux/sched.h>
13#include <linux/slab.h>
14#include "internal.h"
15
16static unsigned afs_server_timeout = 10; /* server timeout in seconds */
17
18static void afs_reap_server(struct work_struct *);
19
20/* tree of all the servers, indexed by IP address */
21static struct rb_root afs_servers = RB_ROOT;
22static DEFINE_RWLOCK(afs_servers_lock);
23
24/* LRU list of all the servers not currently in use */
25static LIST_HEAD(afs_server_graveyard);
26static DEFINE_SPINLOCK(afs_server_graveyard_lock);
27static DECLARE_DELAYED_WORK(afs_server_reaper, afs_reap_server);
28
29/*
30 * install a server record in the master tree
31 */
32static int afs_install_server(struct afs_server *server)
33{
34 struct afs_server *xserver;
35 struct rb_node **pp, *p;
36 int ret;
37
38 _enter("%p", server);
39
40 write_lock(&afs_servers_lock);
41
42 ret = -EEXIST;
43 pp = &afs_servers.rb_node;
44 p = NULL;
45 while (*pp) {
46 p = *pp;
47 _debug("- consider %p", p);
48 xserver = rb_entry(p, struct afs_server, master_rb);
49 if (server->addr.s_addr < xserver->addr.s_addr)
50 pp = &(*pp)->rb_left;
51 else if (server->addr.s_addr > xserver->addr.s_addr)
52 pp = &(*pp)->rb_right;
53 else
54 goto error;
55 }
56
57 rb_link_node(&server->master_rb, p, pp);
58 rb_insert_color(&server->master_rb, &afs_servers);
59 ret = 0;
60
61error:
62 write_unlock(&afs_servers_lock);
63 return ret;
64}
65
66/*
67 * allocate a new server record
68 */
69static struct afs_server *afs_alloc_server(struct afs_cell *cell,
70 const struct in_addr *addr)
71{
72 struct afs_server *server;
73
74 _enter("");
75
76 server = kzalloc(sizeof(struct afs_server), GFP_KERNEL);
77 if (server) {
78 atomic_set(&server->usage, 1);
79 server->cell = cell;
80
81 INIT_LIST_HEAD(&server->link);
82 INIT_LIST_HEAD(&server->grave);
83 init_rwsem(&server->sem);
84 spin_lock_init(&server->fs_lock);
85 server->fs_vnodes = RB_ROOT;
86 server->cb_promises = RB_ROOT;
87 spin_lock_init(&server->cb_lock);
88 init_waitqueue_head(&server->cb_break_waitq);
89 INIT_DELAYED_WORK(&server->cb_break_work,
90 afs_dispatch_give_up_callbacks);
91
92 memcpy(&server->addr, addr, sizeof(struct in_addr));
93 server->addr.s_addr = addr->s_addr;
94 _leave(" = %p{%d}", server, atomic_read(&server->usage));
95 } else {
96 _leave(" = NULL [nomem]");
97 }
98 return server;
99}
100
101/*
102 * get an FS-server record for a cell
103 */
104struct afs_server *afs_lookup_server(struct afs_cell *cell,
105 const struct in_addr *addr)
106{
107 struct afs_server *server, *candidate;
108
109 _enter("%p,%pI4", cell, &addr->s_addr);
110
111 /* quick scan of the list to see if we already have the server */
112 read_lock(&cell->servers_lock);
113
114 list_for_each_entry(server, &cell->servers, link) {
115 if (server->addr.s_addr == addr->s_addr)
116 goto found_server_quickly;
117 }
118 read_unlock(&cell->servers_lock);
119
120 candidate = afs_alloc_server(cell, addr);
121 if (!candidate) {
122 _leave(" = -ENOMEM");
123 return ERR_PTR(-ENOMEM);
124 }
125
126 write_lock(&cell->servers_lock);
127
128 /* check the cell's server list again */
129 list_for_each_entry(server, &cell->servers, link) {
130 if (server->addr.s_addr == addr->s_addr)
131 goto found_server;
132 }
133
134 _debug("new");
135 server = candidate;
136 if (afs_install_server(server) < 0)
137 goto server_in_two_cells;
138
139 afs_get_cell(cell);
140 list_add_tail(&server->link, &cell->servers);
141
142 write_unlock(&cell->servers_lock);
143 _leave(" = %p{%d}", server, atomic_read(&server->usage));
144 return server;
145
146 /* found a matching server quickly */
147found_server_quickly:
148 _debug("found quickly");
149 afs_get_server(server);
150 read_unlock(&cell->servers_lock);
151no_longer_unused:
152 if (!list_empty(&server->grave)) {
153 spin_lock(&afs_server_graveyard_lock);
154 list_del_init(&server->grave);
155 spin_unlock(&afs_server_graveyard_lock);
156 }
157 _leave(" = %p{%d}", server, atomic_read(&server->usage));
158 return server;
159
160 /* found a matching server on the second pass */
161found_server:
162 _debug("found");
163 afs_get_server(server);
164 write_unlock(&cell->servers_lock);
165 kfree(candidate);
166 goto no_longer_unused;
167
168 /* found a server that seems to be in two cells */
169server_in_two_cells:
170 write_unlock(&cell->servers_lock);
171 kfree(candidate);
172 printk(KERN_NOTICE "kAFS: Server %pI4 appears to be in two cells\n",
173 addr);
174 _leave(" = -EEXIST");
175 return ERR_PTR(-EEXIST);
176}
177
178/*
179 * look up a server by its IP address
180 */
181struct afs_server *afs_find_server(const struct in_addr *_addr)
182{
183 struct afs_server *server = NULL;
184 struct rb_node *p;
185 struct in_addr addr = *_addr;
186
187 _enter("%pI4", &addr.s_addr);
188
189 read_lock(&afs_servers_lock);
190
191 p = afs_servers.rb_node;
192 while (p) {
193 server = rb_entry(p, struct afs_server, master_rb);
194
195 _debug("- consider %p", p);
196
197 if (addr.s_addr < server->addr.s_addr) {
198 p = p->rb_left;
199 } else if (addr.s_addr > server->addr.s_addr) {
200 p = p->rb_right;
201 } else {
202 afs_get_server(server);
203 goto found;
204 }
205 }
206
207 server = NULL;
208found:
209 read_unlock(&afs_servers_lock);
210 ASSERTIFCMP(server, server->addr.s_addr, ==, addr.s_addr);
211 _leave(" = %p", server);
212 return server;
213}
214
215/*
216 * destroy a server record
217 * - removes from the cell list
218 */
219void afs_put_server(struct afs_server *server)
220{
221 if (!server)
222 return;
223
224 _enter("%p{%d}", server, atomic_read(&server->usage));
225
226 _debug("PUT SERVER %d", atomic_read(&server->usage));
227
228 ASSERTCMP(atomic_read(&server->usage), >, 0);
229
230 if (likely(!atomic_dec_and_test(&server->usage))) {
231 _leave("");
232 return;
233 }
234
235 afs_flush_callback_breaks(server);
236
237 spin_lock(&afs_server_graveyard_lock);
238 if (atomic_read(&server->usage) == 0) {
239 list_move_tail(&server->grave, &afs_server_graveyard);
240 server->time_of_death = get_seconds();
241 queue_delayed_work(afs_wq, &afs_server_reaper,
242 afs_server_timeout * HZ);
243 }
244 spin_unlock(&afs_server_graveyard_lock);
245 _leave(" [dead]");
246}
247
248/*
249 * destroy a dead server
250 */
251static void afs_destroy_server(struct afs_server *server)
252{
253 _enter("%p", server);
254
255 ASSERTIF(server->cb_break_head != server->cb_break_tail,
256 delayed_work_pending(&server->cb_break_work));
257
258 ASSERTCMP(server->fs_vnodes.rb_node, ==, NULL);
259 ASSERTCMP(server->cb_promises.rb_node, ==, NULL);
260 ASSERTCMP(server->cb_break_head, ==, server->cb_break_tail);
261 ASSERTCMP(atomic_read(&server->cb_break_n), ==, 0);
262
263 afs_put_cell(server->cell);
264 kfree(server);
265}
266
267/*
268 * reap dead server records
269 */
270static void afs_reap_server(struct work_struct *work)
271{
272 LIST_HEAD(corpses);
273 struct afs_server *server;
274 unsigned long delay, expiry;
275 time_t now;
276
277 now = get_seconds();
278 spin_lock(&afs_server_graveyard_lock);
279
280 while (!list_empty(&afs_server_graveyard)) {
281 server = list_entry(afs_server_graveyard.next,
282 struct afs_server, grave);
283
284 /* the queue is ordered most dead first */
285 expiry = server->time_of_death + afs_server_timeout;
286 if (expiry > now) {
287 delay = (expiry - now) * HZ;
288 mod_delayed_work(afs_wq, &afs_server_reaper, delay);
289 break;
290 }
291
292 write_lock(&server->cell->servers_lock);
293 write_lock(&afs_servers_lock);
294 if (atomic_read(&server->usage) > 0) {
295 list_del_init(&server->grave);
296 } else {
297 list_move_tail(&server->grave, &corpses);
298 list_del_init(&server->link);
299 rb_erase(&server->master_rb, &afs_servers);
300 }
301 write_unlock(&afs_servers_lock);
302 write_unlock(&server->cell->servers_lock);
303 }
304
305 spin_unlock(&afs_server_graveyard_lock);
306
307 /* now reap the corpses we've extracted */
308 while (!list_empty(&corpses)) {
309 server = list_entry(corpses.next, struct afs_server, grave);
310 list_del(&server->grave);
311 afs_destroy_server(server);
312 }
313}
314
315/*
316 * discard all the server records for rmmod
317 */
318void __exit afs_purge_servers(void)
319{
320 afs_server_timeout = 0;
321 mod_delayed_work(afs_wq, &afs_server_reaper, 0);
322}