conn_object.c 16.7 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11
/* RxRPC virtual connection handler
 *
 * Copyright (C) 2007 Red Hat, Inc. All Rights Reserved.
 * 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.
 */

12 13
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt

14
#include <linux/module.h>
15
#include <linux/slab.h>
16 17 18 19 20 21 22
#include <linux/net.h>
#include <linux/skbuff.h>
#include <linux/crypto.h>
#include <net/sock.h>
#include <net/af_rxrpc.h>
#include "ar-internal.h"

23 24 25
/*
 * Time till a connection expires after last use (in seconds).
 */
26
unsigned int rxrpc_connection_expiry = 10 * 60;
27

28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44
static void rxrpc_connection_reaper(struct work_struct *work);

LIST_HEAD(rxrpc_connections);
DEFINE_RWLOCK(rxrpc_connection_lock);
static DECLARE_DELAYED_WORK(rxrpc_connection_reap, rxrpc_connection_reaper);

/*
 * allocate a new connection
 */
static struct rxrpc_connection *rxrpc_alloc_connection(gfp_t gfp)
{
	struct rxrpc_connection *conn;

	_enter("");

	conn = kzalloc(sizeof(struct rxrpc_connection), gfp);
	if (conn) {
45 46
		spin_lock_init(&conn->channel_lock);
		init_waitqueue_head(&conn->channel_wq);
47
		INIT_WORK(&conn->processor, &rxrpc_process_connection);
48
		INIT_LIST_HEAD(&conn->link);
49 50
		conn->calls = RB_ROOT;
		skb_queue_head_init(&conn->rx_queue);
51
		conn->security = &rxrpc_no_security;
52 53 54 55
		rwlock_init(&conn->lock);
		spin_lock_init(&conn->state_lock);
		atomic_set(&conn->usage, 1);
		conn->debug_id = atomic_inc_return(&rxrpc_debug_id);
56
		atomic_set(&conn->avail_chans, RXRPC_MAXCALLS);
57
		conn->size_align = 4;
58
		conn->header_size = sizeof(struct rxrpc_wire_header);
59 60
	}

61
	_leave(" = %p{%d}", conn, conn ? conn->debug_id : 0);
62 63 64 65 66 67 68 69 70 71 72
	return conn;
}

/*
 * add a call to a connection's call-by-ID tree
 */
static void rxrpc_add_call_ID_to_conn(struct rxrpc_connection *conn,
				      struct rxrpc_call *call)
{
	struct rxrpc_call *xcall;
	struct rb_node *parent, **p;
D
David Howells 已提交
73
	u32 call_id;
74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98

	write_lock_bh(&conn->lock);

	call_id = call->call_id;
	p = &conn->calls.rb_node;
	parent = NULL;
	while (*p) {
		parent = *p;
		xcall = rb_entry(parent, struct rxrpc_call, conn_node);

		if (call_id < xcall->call_id)
			p = &(*p)->rb_left;
		else if (call_id > xcall->call_id)
			p = &(*p)->rb_right;
		else
			BUG();
	}

	rb_link_node(&call->conn_node, parent, p);
	rb_insert_color(&call->conn_node, &conn->calls);

	write_unlock_bh(&conn->lock);
}

/*
99 100
 * Allocate a client connection.  The caller must take care to clear any
 * padding bytes in *cp.
101
 */
102
static struct rxrpc_connection *
103
rxrpc_alloc_client_connection(struct rxrpc_conn_parameters *cp, gfp_t gfp)
104 105
{
	struct rxrpc_connection *conn;
106
	int ret;
107 108 109

	_enter("");

110
	conn = rxrpc_alloc_connection(gfp);
111
	if (!conn) {
112
		_leave(" = -ENOMEM");
113
		return ERR_PTR(-ENOMEM);
114
	}
115

116 117 118 119 120 121 122 123 124
	conn->params		= *cp;
	conn->proto.local	= cp->local;
	conn->proto.epoch	= rxrpc_epoch;
	conn->proto.cid		= 0;
	conn->proto.in_clientflag = 0;
	conn->proto.family	= cp->peer->srx.transport.family;
	conn->out_clientflag	= RXRPC_CLIENT_INITIATED;
	conn->state		= RXRPC_CONN_CLIENT;

125 126 127 128 129 130 131 132
	switch (conn->proto.family) {
	case AF_INET:
		conn->proto.addr_size = sizeof(conn->proto.ipv4_addr);
		conn->proto.ipv4_addr = cp->peer->srx.transport.sin.sin_addr;
		conn->proto.port = cp->peer->srx.transport.sin.sin_port;
		break;
	}

133
	ret = rxrpc_get_client_connection_id(conn, gfp);
134 135
	if (ret < 0)
		goto error_0;
136 137

	ret = rxrpc_init_client_conn_security(conn);
138 139 140 141
	if (ret < 0)
		goto error_1;

	conn->security->prime_packet_security(conn);
142

143
	write_lock(&rxrpc_connection_lock);
144
	list_add_tail(&conn->link, &rxrpc_connections);
145
	write_unlock(&rxrpc_connection_lock);
146

147 148 149
	/* We steal the caller's peer ref. */
	cp->peer = NULL;
	rxrpc_get_local(conn->params.local);
150 151 152 153 154 155 156 157 158 159 160 161 162
	key_get(conn->params.key);

	_leave(" = %p", conn);
	return conn;

error_1:
	rxrpc_put_client_connection_id(conn);
error_0:
	kfree(conn);
	_leave(" = %d", ret);
	return ERR_PTR(ret);
}

163 164 165 166
/*
 * find a connection for a call
 * - called in process context with IRQs enabled
 */
167
int rxrpc_connect_call(struct rxrpc_call *call,
168
		       struct rxrpc_conn_parameters *cp,
169
		       struct sockaddr_rxrpc *srx,
170 171
		       gfp_t gfp)
{
172 173 174 175
	struct rxrpc_connection *conn, *candidate = NULL;
	struct rxrpc_local *local = cp->local;
	struct rb_node *p, **pp, *parent;
	long diff;
176
	int chan;
177 178 179

	DECLARE_WAITQUEUE(myself, current);

180
	_enter("{%d,%lx},", call->debug_id, call->user_call_ID);
181

182 183 184
	cp->peer = rxrpc_lookup_peer(cp->local, srx, gfp);
	if (!cp->peer)
		return -ENOMEM;
185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205

	if (!cp->exclusive) {
		/* Search for a existing client connection unless this is going
		 * to be a connection that's used exclusively for a single call.
		 */
		_debug("search 1");
		spin_lock(&local->client_conns_lock);
		p = local->client_conns.rb_node;
		while (p) {
			conn = rb_entry(p, struct rxrpc_connection, client_node);

#define cmp(X) ((long)conn->params.X - (long)cp->X)
			diff = (cmp(peer) ?:
				cmp(key) ?:
				cmp(security_level));
			if (diff < 0)
				p = p->rb_left;
			else if (diff > 0)
				p = p->rb_right;
			else
				goto found_extant_conn;
206
		}
207 208
		spin_unlock(&local->client_conns_lock);
	}
209

210 211
	/* We didn't find a connection or we want an exclusive one. */
	_debug("get new conn");
212
	candidate = rxrpc_alloc_client_connection(cp, gfp);
213 214 215 216
	if (!candidate) {
		_leave(" = -ENOMEM");
		return -ENOMEM;
	}
217

218 219 220 221 222 223 224 225 226 227 228 229
	if (cp->exclusive) {
		/* Assign the call on an exclusive connection to channel 0 and
		 * don't add the connection to the endpoint's shareable conn
		 * lookup tree.
		 */
		_debug("exclusive chan 0");
		conn = candidate;
		atomic_set(&conn->avail_chans, RXRPC_MAXCALLS - 1);
		spin_lock(&conn->channel_lock);
		chan = 0;
		goto found_channel;
	}
230

231 232 233 234 235
	/* We need to redo the search before attempting to add a new connection
	 * lest we race with someone else adding a conflicting instance.
	 */
	_debug("search 2");
	spin_lock(&local->client_conns_lock);
236

237 238 239 240 241
	pp = &local->client_conns.rb_node;
	parent = NULL;
	while (*pp) {
		parent = *pp;
		conn = rb_entry(parent, struct rxrpc_connection, client_node);
242

243 244 245 246 247 248 249 250 251 252
		diff = (cmp(peer) ?:
			cmp(key) ?:
			cmp(security_level));
		if (diff < 0)
			pp = &(*pp)->rb_left;
		else if (diff > 0)
			pp = &(*pp)->rb_right;
		else
			goto found_extant_conn;
	}
253

254 255 256 257 258 259 260
	/* The second search also failed; simply add the new connection with
	 * the new call in channel 0.  Note that we need to take the channel
	 * lock before dropping the client conn lock.
	 */
	_debug("new conn");
	conn = candidate;
	candidate = NULL;
261

262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277
	rb_link_node(&conn->client_node, parent, pp);
	rb_insert_color(&conn->client_node, &local->client_conns);

	atomic_set(&conn->avail_chans, RXRPC_MAXCALLS - 1);
	spin_lock(&conn->channel_lock);
	spin_unlock(&local->client_conns_lock);
	chan = 0;

found_channel:
	_debug("found chan");
	call->conn	= conn;
	call->channel	= chan;
	call->epoch	= conn->proto.epoch;
	call->cid	= conn->proto.cid | chan;
	call->call_id	= ++conn->call_counter;
	rcu_assign_pointer(conn->channels[chan], call);
278

279
	_net("CONNECT call %d on conn %d", call->debug_id, conn->debug_id);
280

281 282
	rxrpc_add_call_ID_to_conn(conn, call);
	spin_unlock(&conn->channel_lock);
283 284
	rxrpc_put_peer(cp->peer);
	cp->peer = NULL;
285 286 287 288 289 290 291 292 293 294 295
	_leave(" = %p {u=%d}", conn, atomic_read(&conn->usage));
	return 0;

	/* We found a suitable connection already in existence.  Discard any
	 * candidate we may have allocated, and try to get a channel on this
	 * one.
	 */
found_extant_conn:
	_debug("found conn");
	rxrpc_get_connection(conn);
	spin_unlock(&local->client_conns_lock);
296

297
	rxrpc_put_connection(candidate);
298

299 300 301 302 303 304
	if (!atomic_add_unless(&conn->avail_chans, -1, 0)) {
		if (!gfpflags_allow_blocking(gfp)) {
			rxrpc_put_connection(conn);
			_leave(" = -EAGAIN");
			return -EAGAIN;
		}
305

306 307 308 309 310 311 312 313 314 315 316
		add_wait_queue(&conn->channel_wq, &myself);
		for (;;) {
			set_current_state(TASK_INTERRUPTIBLE);
			if (atomic_add_unless(&conn->avail_chans, -1, 0))
				break;
			if (signal_pending(current))
				goto interrupted;
			schedule();
		}
		remove_wait_queue(&conn->channel_wq, &myself);
		__set_current_state(TASK_RUNNING);
317 318
	}

319 320
	/* The connection allegedly now has a free channel and we can now
	 * attach the call to it.
321
	 */
322 323
	spin_lock(&conn->channel_lock);

324 325 326 327 328 329
	for (chan = 0; chan < RXRPC_MAXCALLS; chan++)
		if (!conn->channels[chan])
			goto found_channel;
	BUG();

interrupted:
330 331 332
	remove_wait_queue(&conn->channel_wq, &myself);
	__set_current_state(TASK_RUNNING);
	rxrpc_put_connection(conn);
333 334
	rxrpc_put_peer(cp->peer);
	cp->peer = NULL;
335 336 337 338 339 340 341
	_leave(" = -ERESTARTSYS");
	return -ERESTARTSYS;
}

/*
 * get a record of an incoming connection
 */
342 343
struct rxrpc_connection *rxrpc_incoming_connection(struct rxrpc_local *local,
						   struct rxrpc_peer *peer,
344
						   struct sk_buff *skb)
345 346
{
	struct rxrpc_connection *conn, *candidate = NULL;
347
	struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
348 349
	struct rb_node *p, **pp;
	const char *new = "old";
D
David Howells 已提交
350
	u32 epoch, cid;
351 352 353

	_enter("");

354
	ASSERT(sp->hdr.flags & RXRPC_CLIENT_INITIATED);
355

356 357
	epoch = sp->hdr.epoch;
	cid = sp->hdr.cid & RXRPC_CIDMASK;
358 359

	/* search the connection list first */
360
	read_lock_bh(&peer->conn_lock);
361

362
	p = peer->service_conns.rb_node;
363
	while (p) {
364
		conn = rb_entry(p, struct rxrpc_connection, service_node);
365

366
		_debug("maybe %x", conn->proto.cid);
367

368
		if (epoch < conn->proto.epoch)
369
			p = p->rb_left;
370
		else if (epoch > conn->proto.epoch)
371
			p = p->rb_right;
372
		else if (cid < conn->proto.cid)
373
			p = p->rb_left;
374
		else if (cid > conn->proto.cid)
375 376 377 378
			p = p->rb_right;
		else
			goto found_extant_connection;
	}
379
	read_unlock_bh(&peer->conn_lock);
380 381 382

	/* not yet present - create a candidate for a new record and then
	 * redo the search */
383
	candidate = rxrpc_alloc_connection(GFP_NOIO);
384 385 386 387 388
	if (!candidate) {
		_leave(" = -ENOMEM");
		return ERR_PTR(-ENOMEM);
	}

389
	candidate->proto.local		= local;
390 391 392
	candidate->proto.epoch		= sp->hdr.epoch;
	candidate->proto.cid		= sp->hdr.cid & RXRPC_CIDMASK;
	candidate->proto.in_clientflag	= RXRPC_CLIENT_INITIATED;
393 394
	candidate->params.local		= local;
	candidate->params.peer		= peer;
395 396 397 398
	candidate->params.service_id	= sp->hdr.serviceId;
	candidate->security_ix		= sp->hdr.securityIndex;
	candidate->out_clientflag	= 0;
	candidate->state		= RXRPC_CONN_SERVER;
399
	if (candidate->params.service_id)
400
		candidate->state	= RXRPC_CONN_SERVER_UNSECURED;
401

402
	write_lock_bh(&peer->conn_lock);
403

404
	pp = &peer->service_conns.rb_node;
405 406 407
	p = NULL;
	while (*pp) {
		p = *pp;
408
		conn = rb_entry(p, struct rxrpc_connection, service_node);
409

410
		if (epoch < conn->proto.epoch)
411
			pp = &(*pp)->rb_left;
412
		else if (epoch > conn->proto.epoch)
413
			pp = &(*pp)->rb_right;
414
		else if (cid < conn->proto.cid)
415
			pp = &(*pp)->rb_left;
416
		else if (cid > conn->proto.cid)
417 418 419 420 421 422 423 424
			pp = &(*pp)->rb_right;
		else
			goto found_extant_second;
	}

	/* we can now add the new candidate to the list */
	conn = candidate;
	candidate = NULL;
425
	rb_link_node(&conn->service_node, p, pp);
426 427 428
	rb_insert_color(&conn->service_node, &peer->service_conns);
	rxrpc_get_peer(peer);
	rxrpc_get_local(local);
429

430
	write_unlock_bh(&peer->conn_lock);
431

432
	write_lock(&rxrpc_connection_lock);
433
	list_add_tail(&conn->link, &rxrpc_connections);
434
	write_unlock(&rxrpc_connection_lock);
435 436 437 438

	new = "new";

success:
439
	_net("CONNECTION %s %d {%x}", new, conn->debug_id, conn->proto.cid);
440 441 442 443 444 445

	_leave(" = %p {u=%d}", conn, atomic_read(&conn->usage));
	return conn;

	/* we found the connection in the list immediately */
found_extant_connection:
446
	if (sp->hdr.securityIndex != conn->security_ix) {
447
		read_unlock_bh(&peer->conn_lock);
448 449
		goto security_mismatch;
	}
450
	rxrpc_get_connection(conn);
451
	read_unlock_bh(&peer->conn_lock);
452 453 454 455
	goto success;

	/* we found the connection on the second time through the list */
found_extant_second:
456
	if (sp->hdr.securityIndex != conn->security_ix) {
457
		write_unlock_bh(&peer->conn_lock);
458 459
		goto security_mismatch;
	}
460
	rxrpc_get_connection(conn);
461
	write_unlock_bh(&peer->conn_lock);
462 463 464 465 466 467 468 469 470 471 472 473 474
	kfree(candidate);
	goto success;

security_mismatch:
	kfree(candidate);
	_leave(" = -EKEYREJECTED");
	return ERR_PTR(-EKEYREJECTED);
}

/*
 * find a connection based on transport and RxRPC connection ID for an incoming
 * packet
 */
475 476
struct rxrpc_connection *rxrpc_find_connection(struct rxrpc_local *local,
					       struct rxrpc_peer *peer,
477
					       struct sk_buff *skb)
478 479
{
	struct rxrpc_connection *conn;
480
	struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
481
	struct rb_node *p;
482
	u32 epoch, cid;
483

484
	_enter(",{%x,%x}", sp->hdr.cid, sp->hdr.flags);
485

486
	read_lock_bh(&peer->conn_lock);
487

488 489
	cid	= sp->hdr.cid & RXRPC_CIDMASK;
	epoch	= sp->hdr.epoch;
490

491
	if (sp->hdr.flags & RXRPC_CLIENT_INITIATED) {
492
		p = peer->service_conns.rb_node;
493
		while (p) {
494
			conn = rb_entry(p, struct rxrpc_connection, service_node);
495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510

			_debug("maybe %x", conn->proto.cid);

			if (epoch < conn->proto.epoch)
				p = p->rb_left;
			else if (epoch > conn->proto.epoch)
				p = p->rb_right;
			else if (cid < conn->proto.cid)
				p = p->rb_left;
			else if (cid > conn->proto.cid)
				p = p->rb_right;
			else
				goto found;
		}
	} else {
		conn = idr_find(&rxrpc_client_conn_ids, cid >> RXRPC_CIDSHIFT);
511 512 513
		if (conn &&
		    conn->proto.epoch == epoch &&
		    conn->params.peer == peer)
514 515 516
			goto found;
	}

517
	read_unlock_bh(&peer->conn_lock);
518 519 520 521
	_leave(" = NULL");
	return NULL;

found:
522
	rxrpc_get_connection(conn);
523
	read_unlock_bh(&peer->conn_lock);
524 525 526 527
	_leave(" = %p", conn);
	return conn;
}

528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545
/*
 * Disconnect a call and clear any channel it occupies when that call
 * terminates.
 */
void rxrpc_disconnect_call(struct rxrpc_call *call)
{
	struct rxrpc_connection *conn = call->conn;
	unsigned chan = call->channel;

	_enter("%d,%d", conn->debug_id, call->channel);

	if (conn->channels[chan] == call) {
		rcu_assign_pointer(conn->channels[chan], NULL);
		atomic_inc(&conn->avail_chans);
		wake_up(&conn->channel_wq);
	}
}

546 547 548 549 550
/*
 * release a virtual connection
 */
void rxrpc_put_connection(struct rxrpc_connection *conn)
{
551 552 553
	if (!conn)
		return;

554 555 556 557 558
	_enter("%p{u=%d,d=%d}",
	       conn, atomic_read(&conn->usage), conn->debug_id);

	ASSERTCMP(atomic_read(&conn->usage), >, 0);

559
	conn->put_time = ktime_get_seconds();
560 561
	if (atomic_dec_and_test(&conn->usage)) {
		_debug("zombie");
562
		rxrpc_queue_delayed_work(&rxrpc_connection_reap, 0);
563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581
	}

	_leave("");
}

/*
 * destroy a virtual connection
 */
static void rxrpc_destroy_connection(struct rxrpc_connection *conn)
{
	_enter("%p{%d}", conn, atomic_read(&conn->usage));

	ASSERTCMP(atomic_read(&conn->usage), ==, 0);

	_net("DESTROY CONN %d", conn->debug_id);

	ASSERT(RB_EMPTY_ROOT(&conn->calls));
	rxrpc_purge_queue(&conn->rx_queue);

582
	conn->security->clear(conn);
583
	key_put(conn->params.key);
584
	key_put(conn->server_key);
585 586
	rxrpc_put_peer(conn->params.peer);
	rxrpc_put_local(conn->params.local);
587

588 589 590 591 592 593 594
	kfree(conn);
	_leave("");
}

/*
 * reap dead connections
 */
R
Roel Kluin 已提交
595
static void rxrpc_connection_reaper(struct work_struct *work)
596 597
{
	struct rxrpc_connection *conn, *_p;
598
	struct rxrpc_peer *peer;
599 600 601 602 603 604
	unsigned long now, earliest, reap_time;

	LIST_HEAD(graveyard);

	_enter("");

605
	now = ktime_get_seconds();
606 607
	earliest = ULONG_MAX;

608
	write_lock(&rxrpc_connection_lock);
609 610 611 612 613 614 615 616
	list_for_each_entry_safe(conn, _p, &rxrpc_connections, link) {
		_debug("reap CONN %d { u=%d,t=%ld }",
		       conn->debug_id, atomic_read(&conn->usage),
		       (long) now - (long) conn->put_time);

		if (likely(atomic_read(&conn->usage) > 0))
			continue;

617 618 619 620
		if (rxrpc_conn_is_client(conn)) {
			struct rxrpc_local *local = conn->params.local;
			spin_lock(&local->client_conns_lock);
			reap_time = conn->put_time + rxrpc_connection_expiry;
621

622 623 624 625
			if (atomic_read(&conn->usage) > 0) {
				;
			} else if (reap_time <= now) {
				list_move_tail(&conn->link, &graveyard);
626
				rxrpc_put_client_connection_id(conn);
627 628 629 630 631 632 633 634
				rb_erase(&conn->client_node,
					 &local->client_conns);
			} else if (reap_time < earliest) {
				earliest = reap_time;
			}

			spin_unlock(&local->client_conns_lock);
		} else {
635 636
			peer = conn->params.peer;
			write_lock_bh(&peer->conn_lock);
637 638 639 640 641 642 643
			reap_time = conn->put_time + rxrpc_connection_expiry;

			if (atomic_read(&conn->usage) > 0) {
				;
			} else if (reap_time <= now) {
				list_move_tail(&conn->link, &graveyard);
				rb_erase(&conn->service_node,
644
					 &peer->service_conns);
645 646
			} else if (reap_time < earliest) {
				earliest = reap_time;
647 648
			}

649
			write_unlock_bh(&peer->conn_lock);
650 651
		}
	}
652
	write_unlock(&rxrpc_connection_lock);
653 654 655 656

	if (earliest != ULONG_MAX) {
		_debug("reschedule reaper %ld", (long) earliest - now);
		ASSERTCMP(earliest, >, now);
657 658
		rxrpc_queue_delayed_work(&rxrpc_connection_reap,
					 (earliest - now) * HZ);
659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681
	}

	/* then destroy all those pulled out */
	while (!list_empty(&graveyard)) {
		conn = list_entry(graveyard.next, struct rxrpc_connection,
				  link);
		list_del_init(&conn->link);

		ASSERTCMP(atomic_read(&conn->usage), ==, 0);
		rxrpc_destroy_connection(conn);
	}

	_leave("");
}

/*
 * preemptively destroy all the connection records rather than waiting for them
 * to time out
 */
void __exit rxrpc_destroy_all_connections(void)
{
	_enter("");

682
	rxrpc_connection_expiry = 0;
683
	cancel_delayed_work(&rxrpc_connection_reap);
684
	rxrpc_queue_delayed_work(&rxrpc_connection_reap, 0);
685 686 687

	_leave("");
}