conn_object.c 8.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
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
 */
37
struct rxrpc_connection *rxrpc_alloc_connection(gfp_t gfp)
38 39 40 41 42 43 44
{
	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
		skb_queue_head_init(&conn->rx_queue);
50
		conn->security = &rxrpc_no_security;
51
		spin_lock_init(&conn->state_lock);
52 53 54 55
		/* We maintain an extra ref on the connection whilst it is
		 * on the rxrpc_connections list.
		 */
		atomic_set(&conn->usage, 2);
56
		conn->debug_id = atomic_inc_return(&rxrpc_debug_id);
57
		atomic_set(&conn->avail_chans, RXRPC_MAXCALLS);
58
		conn->size_align = 4;
59
		conn->header_size = sizeof(struct rxrpc_wire_header);
60 61
	}

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

/*
 * find a connection based on transport and RxRPC connection ID for an incoming
 * packet
 */
70
struct rxrpc_connection *rxrpc_find_connection(struct rxrpc_local *local,
71
					       struct sk_buff *skb)
72 73
{
	struct rxrpc_connection *conn;
74
	struct rxrpc_conn_proto k;
75
	struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
76 77
	struct sockaddr_rxrpc srx;
	struct rxrpc_peer *peer;
78 79
	struct rb_node *p;

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

82 83
	if (rxrpc_extract_addr_from_skb(&srx, skb) < 0)
		goto not_found;
84

85 86 87 88 89 90 91 92 93 94
	/* We may have to handle mixing IPv4 and IPv6 */
	if (srx.transport.family != local->srx.transport.family) {
		pr_warn_ratelimited("AF_RXRPC: Protocol mismatch %u not %u\n",
				    srx.transport.family,
				    local->srx.transport.family);
		goto not_found;
	}

	k.epoch	= sp->hdr.epoch;
	k.cid	= sp->hdr.cid & RXRPC_CIDMASK;
95

96
	if (sp->hdr.flags & RXRPC_CLIENT_INITIATED) {
97 98 99 100 101 102 103 104 105 106
		/* We need to look up service connections by the full protocol
		 * parameter set.  We look up the peer first as an intermediate
		 * step and then the connection from the peer's tree.
		 */
		peer = rxrpc_lookup_peer_rcu(local, &srx);
		if (!peer)
			goto not_found;

		read_lock_bh(&peer->conn_lock);

107
		p = peer->service_conns.rb_node;
108
		while (p) {
109
			conn = rb_entry(p, struct rxrpc_connection, service_node);
110 111 112

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

113
			if (k.epoch < conn->proto.epoch)
114
				p = p->rb_left;
115
			else if (k.epoch > conn->proto.epoch)
116
				p = p->rb_right;
117
			else if (k.cid < conn->proto.cid)
118
				p = p->rb_left;
119
			else if (k.cid > conn->proto.cid)
120 121
				p = p->rb_right;
			else
122
				goto found_service_conn;
123
		}
124
		read_unlock_bh(&peer->conn_lock);
125
	} else {
126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148
		conn = idr_find(&rxrpc_client_conn_ids,
				k.cid >> RXRPC_CIDSHIFT);
		if (!conn ||
		    conn->proto.epoch != k.epoch ||
		    conn->params.local != local)
			goto not_found;

		peer = conn->params.peer;
		switch (srx.transport.family) {
		case AF_INET:
			if (peer->srx.transport.sin.sin_port !=
			    srx.transport.sin.sin_port ||
			    peer->srx.transport.sin.sin_addr.s_addr !=
			    srx.transport.sin.sin_addr.s_addr)
				goto not_found;
			break;
		default:
			BUG();
		}

		conn = rxrpc_get_connection_maybe(conn);
		_leave(" = %p", conn);
		return conn;
149 150
	}

151
not_found:
152 153 154
	_leave(" = NULL");
	return NULL;

155
found_service_conn:
156
	conn = rxrpc_get_connection_maybe(conn);
157
	read_unlock_bh(&peer->conn_lock);
158 159 160 161
	_leave(" = %p", conn);
	return conn;
}

162 163
/*
 * Disconnect a call and clear any channel it occupies when that call
164 165
 * terminates.  The caller must hold the channel_lock and must release the
 * call's ref on the connection.
166
 */
167
void __rxrpc_disconnect_call(struct rxrpc_call *call)
168 169
{
	struct rxrpc_connection *conn = call->conn;
170
	struct rxrpc_channel *chan = &conn->channels[call->channel];
171 172 173

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

174 175 176 177 178 179 180 181
	if (rcu_access_pointer(chan->call) == call) {
		/* Save the result of the call so that we can repeat it if necessary
		 * through the channel, whilst disposing of the actual call record.
		 */
		chan->last_result = call->local_abort;
		smp_wmb();
		chan->last_call = chan->call_id;
		chan->call_id = chan->call_counter;
182

183
		rcu_assign_pointer(chan->call, NULL);
184 185 186
		atomic_inc(&conn->avail_chans);
		wake_up(&conn->channel_wq);
	}
187

188 189 190 191 192 193 194 195 196 197 198 199 200
	_leave("");
}

/*
 * 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;

	spin_lock(&conn->channel_lock);
	__rxrpc_disconnect_call(call);
201 202 203 204
	spin_unlock(&conn->channel_lock);

	call->conn = NULL;
	rxrpc_put_connection(conn);
205 206
}

207 208 209 210 211
/*
 * release a virtual connection
 */
void rxrpc_put_connection(struct rxrpc_connection *conn)
{
212 213 214
	if (!conn)
		return;

215 216 217
	_enter("%p{u=%d,d=%d}",
	       conn, atomic_read(&conn->usage), conn->debug_id);

218
	ASSERTCMP(atomic_read(&conn->usage), >, 1);
219

220
	conn->put_time = ktime_get_seconds();
221
	if (atomic_dec_return(&conn->usage) == 1) {
222
		_debug("zombie");
223
		rxrpc_queue_delayed_work(&rxrpc_connection_reap, 0);
224 225 226 227 228 229 230 231
	}

	_leave("");
}

/*
 * destroy a virtual connection
 */
232
static void rxrpc_destroy_connection(struct rcu_head *rcu)
233
{
234 235 236 237
	struct rxrpc_connection *conn =
		container_of(rcu, struct rxrpc_connection, rcu);

	_enter("{%d,u=%d}", conn->debug_id, atomic_read(&conn->usage));
238 239 240 241 242 243 244

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

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

	rxrpc_purge_queue(&conn->rx_queue);

245
	conn->security->clear(conn);
246
	key_put(conn->params.key);
247
	key_put(conn->server_key);
248 249
	rxrpc_put_peer(conn->params.peer);
	rxrpc_put_local(conn->params.local);
250

251 252 253 254 255 256 257
	kfree(conn);
	_leave("");
}

/*
 * reap dead connections
 */
R
Roel Kluin 已提交
258
static void rxrpc_connection_reaper(struct work_struct *work)
259 260
{
	struct rxrpc_connection *conn, *_p;
261
	unsigned long reap_older_than, earliest, put_time, now;
262 263 264 265 266

	LIST_HEAD(graveyard);

	_enter("");

267
	now = ktime_get_seconds();
268
	reap_older_than =  now - rxrpc_connection_expiry;
269 270
	earliest = ULONG_MAX;

271
	write_lock(&rxrpc_connection_lock);
272
	list_for_each_entry_safe(conn, _p, &rxrpc_connections, link) {
273 274
		ASSERTCMP(atomic_read(&conn->usage), >, 0);
		if (likely(atomic_read(&conn->usage) > 1))
275 276
			continue;

277 278 279 280 281
		put_time = READ_ONCE(conn->put_time);
		if (time_after(put_time, reap_older_than)) {
			if (time_before(put_time, earliest))
				earliest = put_time;
			continue;
282
		}
283 284 285 286 287 288 289 290 291 292 293 294 295

		/* The usage count sits at 1 whilst the object is unused on the
		 * list; we reduce that to 0 to make the object unavailable.
		 */
		if (atomic_cmpxchg(&conn->usage, 1, 0) != 1)
			continue;

		if (rxrpc_conn_is_client(conn))
			rxrpc_unpublish_client_conn(conn);
		else
			rxrpc_unpublish_service_conn(conn);

		list_move_tail(&conn->link, &graveyard);
296
	}
297
	write_unlock(&rxrpc_connection_lock);
298 299 300 301

	if (earliest != ULONG_MAX) {
		_debug("reschedule reaper %ld", (long) earliest - now);
		ASSERTCMP(earliest, >, now);
302 303
		rxrpc_queue_delayed_work(&rxrpc_connection_reap,
					 (earliest - now) * HZ);
304 305 306 307 308 309 310 311
	}

	while (!list_empty(&graveyard)) {
		conn = list_entry(graveyard.next, struct rxrpc_connection,
				  link);
		list_del_init(&conn->link);

		ASSERTCMP(atomic_read(&conn->usage), ==, 0);
312 313
		skb_queue_purge(&conn->rx_queue);
		call_rcu(&conn->rcu, rxrpc_destroy_connection);
314 315 316 317 318 319 320 321 322 323 324
	}

	_leave("");
}

/*
 * preemptively destroy all the connection records rather than waiting for them
 * to time out
 */
void __exit rxrpc_destroy_all_connections(void)
{
325 326 327
	struct rxrpc_connection *conn, *_p;
	bool leak = false;

328 329
	_enter("");

330
	rxrpc_connection_expiry = 0;
331
	cancel_delayed_work(&rxrpc_connection_reap);
332
	rxrpc_queue_delayed_work(&rxrpc_connection_reap, 0);
333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348
	flush_workqueue(rxrpc_workqueue);

	write_lock(&rxrpc_connection_lock);
	list_for_each_entry_safe(conn, _p, &rxrpc_connections, link) {
		pr_err("AF_RXRPC: Leaked conn %p {%d}\n",
		       conn, atomic_read(&conn->usage));
		leak = true;
	}
	write_unlock(&rxrpc_connection_lock);
	BUG_ON(leak);

	/* Make sure the local and peer records pinned by any dying connections
	 * are released.
	 */
	rcu_barrier();
	rxrpc_destroy_client_conn_ids();
349 350 351

	_leave("");
}