server.c 14.3 KB
Newer Older
D
David Howells 已提交
1
/* AFS server record management
L
Linus Torvalds 已提交
2
 *
3
 * Copyright (C) 2002, 2007 Red Hat, Inc. All Rights Reserved.
L
Linus Torvalds 已提交
4 5 6 7 8 9 10 11 12 13
 * Written by David Howells (dhowells@redhat.com)
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version
 * 2 of the License, or (at your option) any later version.
 */

#include <linux/sched.h>
#include <linux/slab.h>
14
#include "afs_fs.h"
L
Linus Torvalds 已提交
15
#include "internal.h"
16
#include "protocol_yfs.h"
L
Linus Torvalds 已提交
17

18 19
static unsigned afs_server_gc_delay = 10;	/* Server record timeout in seconds */
static unsigned afs_server_update_delay = 30;	/* Time till VLDB recheck in secs */
L
Linus Torvalds 已提交
20

D
David Howells 已提交
21 22 23 24 25 26 27 28
static void afs_inc_servers_outstanding(struct afs_net *net)
{
	atomic_inc(&net->servers_outstanding);
}

static void afs_dec_servers_outstanding(struct afs_net *net)
{
	if (atomic_dec_and_test(&net->servers_outstanding))
29
		wake_up_var(&net->servers_outstanding);
D
David Howells 已提交
30 31
}

32 33 34 35 36
/*
 * Find a server by one of its addresses.
 */
struct afs_server *afs_find_server(struct afs_net *net,
				   const struct sockaddr_rxrpc *srx)
D
David Howells 已提交
37
{
38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62
	const struct sockaddr_in6 *a = &srx->transport.sin6, *b;
	const struct afs_addr_list *alist;
	struct afs_server *server = NULL;
	unsigned int i;
	bool ipv6 = true;
	int seq = 0, diff;

	if (srx->transport.sin6.sin6_addr.s6_addr32[0] == 0 ||
	    srx->transport.sin6.sin6_addr.s6_addr32[1] == 0 ||
	    srx->transport.sin6.sin6_addr.s6_addr32[2] == htonl(0xffff))
		ipv6 = false;

	rcu_read_lock();

	do {
		if (server)
			afs_put_server(net, server);
		server = NULL;
		read_seqbegin_or_lock(&net->fs_addr_lock, &seq);

		if (ipv6) {
			hlist_for_each_entry_rcu(server, &net->fs_addresses6, addr6_link) {
				alist = rcu_dereference(server->addresses);
				for (i = alist->nr_ipv4; i < alist->nr_addrs; i++) {
					b = &alist->addrs[i].transport.sin6;
D
David Howells 已提交
63 64
					diff = ((u16 __force)a->sin6_port -
						(u16 __force)b->sin6_port);
65 66 67 68 69 70 71 72 73 74 75 76 77
					if (diff == 0)
						diff = memcmp(&a->sin6_addr,
							      &b->sin6_addr,
							      sizeof(struct in6_addr));
					if (diff == 0)
						goto found;
				}
			}
		} else {
			hlist_for_each_entry_rcu(server, &net->fs_addresses4, addr4_link) {
				alist = rcu_dereference(server->addresses);
				for (i = 0; i < alist->nr_ipv4; i++) {
					b = &alist->addrs[i].transport.sin6;
D
David Howells 已提交
78 79
					diff = ((u16 __force)a->sin6_port -
						(u16 __force)b->sin6_port);
80
					if (diff == 0)
D
David Howells 已提交
81 82
						diff = ((u32 __force)a->sin6_addr.s6_addr32[3] -
							(u32 __force)b->sin6_addr.s6_addr32[3]);
83 84 85 86 87
					if (diff == 0)
						goto found;
				}
			}
		}
D
David Howells 已提交
88

89 90 91 92 93 94 95 96 97 98 99
		server = NULL;
	found:
		if (server && !atomic_inc_not_zero(&server->usage))
			server = NULL;

	} while (need_seqretry(&net->fs_addr_lock, seq));

	done_seqretry(&net->fs_addr_lock, seq);

	rcu_read_unlock();
	return server;
D
David Howells 已提交
100 101
}

102
/*
103
 * Look up a server by its UUID
104
 */
105
struct afs_server *afs_find_server_by_uuid(struct afs_net *net, const uuid_t *uuid)
L
Linus Torvalds 已提交
106
{
107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155
	struct afs_server *server = NULL;
	struct rb_node *p;
	int diff, seq = 0;

	_enter("%pU", uuid);

	do {
		/* Unfortunately, rbtree walking doesn't give reliable results
		 * under just the RCU read lock, so we have to check for
		 * changes.
		 */
		if (server)
			afs_put_server(net, server);
		server = NULL;

		read_seqbegin_or_lock(&net->fs_lock, &seq);

		p = net->fs_servers.rb_node;
		while (p) {
			server = rb_entry(p, struct afs_server, uuid_rb);

			diff = memcmp(uuid, &server->uuid, sizeof(*uuid));
			if (diff < 0) {
				p = p->rb_left;
			} else if (diff > 0) {
				p = p->rb_right;
			} else {
				afs_get_server(server);
				break;
			}

			server = NULL;
		}
	} while (need_seqretry(&net->fs_lock, seq));

	done_seqretry(&net->fs_lock, seq);

	_leave(" = %p", server);
	return server;
}

/*
 * Install a server record in the namespace tree
 */
static struct afs_server *afs_install_server(struct afs_net *net,
					     struct afs_server *candidate)
{
	const struct afs_addr_list *alist;
	struct afs_server *server;
156
	struct rb_node **pp, *p;
157
	int ret = -EEXIST, diff;
158

159
	_enter("%p", candidate);
L
Linus Torvalds 已提交
160

161
	write_seqlock(&net->fs_lock);
162

163 164
	/* Firstly install the server in the UUID lookup tree */
	pp = &net->fs_servers.rb_node;
165 166 167 168
	p = NULL;
	while (*pp) {
		p = *pp;
		_debug("- consider %p", p);
169 170
		server = rb_entry(p, struct afs_server, uuid_rb);
		diff = memcmp(&candidate->uuid, &server->uuid, sizeof(uuid_t));
171
		if (diff < 0)
172
			pp = &(*pp)->rb_left;
173
		else if (diff > 0)
174 175
			pp = &(*pp)->rb_right;
		else
176
			goto exists;
177
	}
L
Linus Torvalds 已提交
178

179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201
	server = candidate;
	rb_link_node(&server->uuid_rb, p, pp);
	rb_insert_color(&server->uuid_rb, &net->fs_servers);
	hlist_add_head_rcu(&server->proc_link, &net->fs_proc);

	write_seqlock(&net->fs_addr_lock);
	alist = rcu_dereference_protected(server->addresses,
					  lockdep_is_held(&net->fs_addr_lock.lock));

	/* Secondly, if the server has any IPv4 and/or IPv6 addresses, install
	 * it in the IPv4 and/or IPv6 reverse-map lists.
	 *
	 * TODO: For speed we want to use something other than a flat list
	 * here; even sorting the list in terms of lowest address would help a
	 * bit, but anything we might want to do gets messy and memory
	 * intensive.
	 */
	if (alist->nr_ipv4 > 0)
		hlist_add_head_rcu(&server->addr4_link, &net->fs_addresses4);
	if (alist->nr_addrs > alist->nr_ipv4)
		hlist_add_head_rcu(&server->addr6_link, &net->fs_addresses6);

	write_sequnlock(&net->fs_addr_lock);
202
	ret = 0;
L
Linus Torvalds 已提交
203

204 205 206 207
exists:
	afs_get_server(server);
	write_sequnlock(&net->fs_lock);
	return server;
208
}
L
Linus Torvalds 已提交
209 210

/*
211
 * allocate a new server record
L
Linus Torvalds 已提交
212
 */
213 214 215
static struct afs_server *afs_alloc_server(struct afs_net *net,
					   const uuid_t *uuid,
					   struct afs_addr_list *alist)
L
Linus Torvalds 已提交
216
{
217
	struct afs_server *server;
L
Linus Torvalds 已提交
218

219
	_enter("");
L
Linus Torvalds 已提交
220

221
	server = kzalloc(sizeof(struct afs_server), GFP_KERNEL);
D
David Howells 已提交
222 223 224 225
	if (!server)
		goto enomem;

	atomic_set(&server->usage, 1);
226 227 228 229 230
	RCU_INIT_POINTER(server->addresses, alist);
	server->addr_version = alist->version;
	server->uuid = *uuid;
	server->update_at = ktime_get_real_seconds() + afs_server_update_delay;
	rwlock_init(&server->fs_lock);
231
	INIT_HLIST_HEAD(&server->cb_volumes);
D
David Howells 已提交
232
	rwlock_init(&server->cb_break_lock);
233 234
	init_waitqueue_head(&server->probe_wq);
	spin_lock_init(&server->probe_lock);
D
David Howells 已提交
235

236 237
	afs_inc_servers_outstanding(net);
	_leave(" = %p", server);
238
	return server;
D
David Howells 已提交
239 240 241 242

enomem:
	_leave(" = NULL [nomem]");
	return NULL;
243
}
L
Linus Torvalds 已提交
244

245
/*
246
 * Look up an address record for a server
247
 */
248 249
static struct afs_addr_list *afs_vl_lookup_addrs(struct afs_cell *cell,
						 struct key *key, const uuid_t *uuid)
250
{
D
David Howells 已提交
251 252
	struct afs_vl_cursor vc;
	struct afs_addr_list *alist = NULL;
253 254
	int ret;

D
David Howells 已提交
255 256 257
	ret = -ERESTARTSYS;
	if (afs_begin_vlserver_operation(&vc, cell, key)) {
		while (afs_select_vlserver(&vc)) {
258
			if (test_bit(AFS_VLSERVER_FL_IS_YFS, &vc.server->flags))
D
David Howells 已提交
259 260 261
				alist = afs_yfsvl_get_endpoints(&vc, uuid);
			else
				alist = afs_vl_get_addrs_u(&vc, uuid);
262
		}
D
David Howells 已提交
263 264

		ret = afs_end_vlserver_operation(&vc);
265 266
	}

D
David Howells 已提交
267
	return ret < 0 ? ERR_PTR(ret) : alist;
268
}
L
Linus Torvalds 已提交
269

270
/*
271
 * Get or create a fileserver record.
272
 */
273 274
struct afs_server *afs_lookup_server(struct afs_cell *cell, struct key *key,
				     const uuid_t *uuid)
275
{
276 277
	struct afs_addr_list *alist;
	struct afs_server *server, *candidate;
L
Linus Torvalds 已提交
278

279
	_enter("%p,%pU", cell->net, uuid);
280

281 282 283
	server = afs_find_server_by_uuid(cell->net, uuid);
	if (server)
		return server;
L
Linus Torvalds 已提交
284

285 286 287
	alist = afs_vl_lookup_addrs(cell, key, uuid);
	if (IS_ERR(alist))
		return ERR_CAST(alist);
L
Linus Torvalds 已提交
288

289 290 291 292 293
	candidate = afs_alloc_server(cell->net, uuid, alist);
	if (!candidate) {
		afs_put_addrlist(alist);
		return ERR_PTR(-ENOMEM);
	}
L
Linus Torvalds 已提交
294

295 296 297 298
	server = afs_install_server(cell->net, candidate);
	if (server != candidate) {
		afs_put_addrlist(alist);
		kfree(candidate);
299
	}
L
Linus Torvalds 已提交
300

301
	_leave(" = %p{%d}", server, atomic_read(&server->usage));
302
	return server;
D
David Howells 已提交
303
}
L
Linus Torvalds 已提交
304

305 306 307 308
/*
 * Set the server timer to fire after a given delay, assuming it's not already
 * set for an earlier time.
 */
D
David Howells 已提交
309 310 311
static void afs_set_server_timer(struct afs_net *net, time64_t delay)
{
	if (net->live) {
312 313
		afs_inc_servers_outstanding(net);
		if (timer_reduce(&net->fs_timer, jiffies + delay * HZ))
D
David Howells 已提交
314 315 316 317
			afs_dec_servers_outstanding(net);
	}
}

L
Linus Torvalds 已提交
318
/*
319 320 321 322 323 324 325 326 327 328 329 330 331 332
 * Server management timer.  We have an increment on fs_outstanding that we
 * need to pass along to the work item.
 */
void afs_servers_timer(struct timer_list *timer)
{
	struct afs_net *net = container_of(timer, struct afs_net, fs_timer);

	_enter("");
	if (!queue_work(afs_wq, &net->fs_manager))
		afs_dec_servers_outstanding(net);
}

/*
 * Release a reference on a server record.
L
Linus Torvalds 已提交
333
 */
334
void afs_put_server(struct afs_net *net, struct afs_server *server)
L
Linus Torvalds 已提交
335
{
336 337
	unsigned int usage;

L
Linus Torvalds 已提交
338 339 340
	if (!server)
		return;

341
	server->put_time = ktime_get_real_seconds();
L
Linus Torvalds 已提交
342

343
	usage = atomic_dec_return(&server->usage);
344

345
	_enter("{%u}", usage);
L
Linus Torvalds 已提交
346

347
	if (likely(usage > 0))
L
Linus Torvalds 已提交
348 349
		return;

350 351 352 353 354 355 356
	afs_set_server_timer(net, afs_server_gc_delay);
}

static void afs_server_rcu(struct rcu_head *rcu)
{
	struct afs_server *server = container_of(rcu, struct afs_server, rcu);

D
David Howells 已提交
357
	afs_put_addrlist(rcu_access_pointer(server->addresses));
358
	kfree(server);
D
David Howells 已提交
359
}
L
Linus Torvalds 已提交
360 361

/*
362
 * destroy a dead server
L
Linus Torvalds 已提交
363
 */
D
David Howells 已提交
364
static void afs_destroy_server(struct afs_net *net, struct afs_server *server)
L
Linus Torvalds 已提交
365
{
D
David Howells 已提交
366
	struct afs_addr_list *alist = rcu_access_pointer(server->addresses);
D
David Howells 已提交
367 368
	struct afs_addr_cursor ac = {
		.alist	= alist,
369
		.index	= alist->preferred,
D
David Howells 已提交
370 371
		.error	= 0,
	};
L
Linus Torvalds 已提交
372 373
	_enter("%p", server);

374 375 376
	if (test_bit(AFS_SERVER_FL_MAY_HAVE_CB, &server->flags))
		afs_fs_give_up_all_callbacks(net, server, &ac, NULL);

377 378 379
	wait_var_event(&server->probe_outstanding,
		       atomic_read(&server->probe_outstanding) == 0);

380
	call_rcu(&server->rcu, afs_server_rcu);
D
David Howells 已提交
381
	afs_dec_servers_outstanding(net);
D
David Howells 已提交
382
}
L
Linus Torvalds 已提交
383 384

/*
385
 * Garbage collect any expired servers.
L
Linus Torvalds 已提交
386
 */
387
static void afs_gc_servers(struct afs_net *net, struct afs_server *gc_list)
L
Linus Torvalds 已提交
388
{
389
	struct afs_server *server;
390 391 392 393 394 395 396 397 398 399 400 401
	bool deleted;
	int usage;

	while ((server = gc_list)) {
		gc_list = server->gc_next;

		write_seqlock(&net->fs_lock);
		usage = 1;
		deleted = atomic_try_cmpxchg(&server->usage, &usage, 0);
		if (deleted) {
			rb_erase(&server->uuid_rb, &net->fs_servers);
			hlist_del_rcu(&server->proc_link);
L
Linus Torvalds 已提交
402
		}
403
		write_sequnlock(&net->fs_lock);
L
Linus Torvalds 已提交
404

D
David Howells 已提交
405 406 407 408 409 410 411
		if (deleted) {
			write_seqlock(&net->fs_addr_lock);
			if (!hlist_unhashed(&server->addr4_link))
				hlist_del_rcu(&server->addr4_link);
			if (!hlist_unhashed(&server->addr6_link))
				hlist_del_rcu(&server->addr6_link);
			write_sequnlock(&net->fs_addr_lock);
412
			afs_destroy_server(net, server);
D
David Howells 已提交
413
		}
414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460
	}
}

/*
 * Manage the records of servers known to be within a network namespace.  This
 * includes garbage collecting unused servers.
 *
 * Note also that we were given an increment on net->servers_outstanding by
 * whoever queued us that we need to deal with before returning.
 */
void afs_manage_servers(struct work_struct *work)
{
	struct afs_net *net = container_of(work, struct afs_net, fs_manager);
	struct afs_server *gc_list = NULL;
	struct rb_node *cursor;
	time64_t now = ktime_get_real_seconds(), next_manage = TIME64_MAX;
	bool purging = !net->live;

	_enter("");

	/* Trawl the server list looking for servers that have expired from
	 * lack of use.
	 */
	read_seqlock_excl(&net->fs_lock);

	for (cursor = rb_first(&net->fs_servers); cursor; cursor = rb_next(cursor)) {
		struct afs_server *server =
			rb_entry(cursor, struct afs_server, uuid_rb);
		int usage = atomic_read(&server->usage);

		_debug("manage %pU %u", &server->uuid, usage);

		ASSERTCMP(usage, >=, 1);
		ASSERTIFCMP(purging, usage, ==, 1);

		if (usage == 1) {
			time64_t expire_at = server->put_time;

			if (!test_bit(AFS_SERVER_FL_VL_FAIL, &server->flags) &&
			    !test_bit(AFS_SERVER_FL_NOT_FOUND, &server->flags))
				expire_at += afs_server_gc_delay;
			if (purging || expire_at <= now) {
				server->gc_next = gc_list;
				gc_list = server;
			} else if (expire_at < next_manage) {
				next_manage = expire_at;
			}
L
Linus Torvalds 已提交
461 462 463
		}
	}

464
	read_sequnlock_excl(&net->fs_lock);
L
Linus Torvalds 已提交
465

466 467 468 469 470 471 472 473 474 475 476 477 478
	/* Update the timer on the way out.  We have to pass an increment on
	 * servers_outstanding in the namespace that we are in to the timer or
	 * the work scheduler.
	 */
	if (!purging && next_manage < TIME64_MAX) {
		now = ktime_get_real_seconds();

		if (next_manage - now <= 0) {
			if (queue_work(afs_wq, &net->fs_manager))
				afs_inc_servers_outstanding(net);
		} else {
			afs_set_server_timer(net, next_manage - now);
		}
L
Linus Torvalds 已提交
479
	}
D
David Howells 已提交
480

481 482
	afs_gc_servers(net, gc_list);

D
David Howells 已提交
483
	afs_dec_servers_outstanding(net);
484 485 486 487 488 489 490 491
	_leave(" [%d]", atomic_read(&net->servers_outstanding));
}

static void afs_queue_server_manager(struct afs_net *net)
{
	afs_inc_servers_outstanding(net);
	if (!queue_work(afs_wq, &net->fs_manager))
		afs_dec_servers_outstanding(net);
D
David Howells 已提交
492
}
L
Linus Torvalds 已提交
493 494

/*
495
 * Purge list of servers.
L
Linus Torvalds 已提交
496
 */
497
void afs_purge_servers(struct afs_net *net)
L
Linus Torvalds 已提交
498
{
499 500 501
	_enter("");

	if (del_timer_sync(&net->fs_timer))
D
David Howells 已提交
502 503
		atomic_dec(&net->servers_outstanding);

504
	afs_queue_server_manager(net);
D
David Howells 已提交
505

506
	_debug("wait");
507 508
	wait_var_event(&net->servers_outstanding,
		       !atomic_read(&net->servers_outstanding));
509 510 511 512 513 514 515 516 517 518 519 520 521 522 523
	_leave("");
}

/*
 * Get an update for a server's address list.
 */
static noinline bool afs_update_server_record(struct afs_fs_cursor *fc, struct afs_server *server)
{
	struct afs_addr_list *alist, *discard;

	_enter("");

	alist = afs_vl_lookup_addrs(fc->vnode->volume->cell, fc->key,
				    &server->uuid);
	if (IS_ERR(alist)) {
524 525
		fc->error = PTR_ERR(alist);
		_leave(" = f [%d]", fc->error);
526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576
		return false;
	}

	discard = alist;
	if (server->addr_version != alist->version) {
		write_lock(&server->fs_lock);
		discard = rcu_dereference_protected(server->addresses,
						    lockdep_is_held(&server->fs_lock));
		rcu_assign_pointer(server->addresses, alist);
		server->addr_version = alist->version;
		write_unlock(&server->fs_lock);
	}

	server->update_at = ktime_get_real_seconds() + afs_server_update_delay;
	afs_put_addrlist(discard);
	_leave(" = t");
	return true;
}

/*
 * See if a server's address list needs updating.
 */
bool afs_check_server_record(struct afs_fs_cursor *fc, struct afs_server *server)
{
	time64_t now = ktime_get_real_seconds();
	long diff;
	bool success;
	int ret, retries = 0;

	_enter("");

	ASSERT(server);

retry:
	diff = READ_ONCE(server->update_at) - now;
	if (diff > 0) {
		_leave(" = t [not now %ld]", diff);
		return true;
	}

	if (!test_and_set_bit_lock(AFS_SERVER_FL_UPDATING, &server->flags)) {
		success = afs_update_server_record(fc, server);
		clear_bit_unlock(AFS_SERVER_FL_UPDATING, &server->flags);
		wake_up_bit(&server->flags, AFS_SERVER_FL_UPDATING);
		_leave(" = %d", success);
		return success;
	}

	ret = wait_on_bit(&server->flags, AFS_SERVER_FL_UPDATING,
			  TASK_INTERRUPTIBLE);
	if (ret == -ERESTARTSYS) {
577
		fc->error = ret;
578 579 580 581 582 583 584 585 586 587 588
		_leave(" = f [intr]");
		return false;
	}

	retries++;
	if (retries == 4) {
		_leave(" = f [stale]");
		ret = -ESTALE;
		return false;
	}
	goto retry;
D
David Howells 已提交
589
}