conn_object.c 8.5 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
#include <linux/net.h>
#include <linux/skbuff.h>
#include <net/sock.h>
#include <net/af_rxrpc.h>
#include "ar-internal.h"

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

27 28 29 30 31 32 33 34 35
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
 */
36
struct rxrpc_connection *rxrpc_alloc_connection(gfp_t gfp)
37 38 39 40 41 42 43
{
	struct rxrpc_connection *conn;

	_enter("");

	conn = kzalloc(sizeof(struct rxrpc_connection), gfp);
	if (conn) {
44 45
		spin_lock_init(&conn->channel_lock);
		init_waitqueue_head(&conn->channel_wq);
46
		INIT_WORK(&conn->processor, &rxrpc_process_connection);
47
		INIT_LIST_HEAD(&conn->link);
48
		skb_queue_head_init(&conn->rx_queue);
49
		conn->security = &rxrpc_no_security;
50
		spin_lock_init(&conn->state_lock);
51 52 53 54
		/* We maintain an extra ref on the connection whilst it is
		 * on the rxrpc_connections list.
		 */
		atomic_set(&conn->usage, 2);
55
		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
		conn->idle_timestamp = jiffies;
60 61
	}

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

/*
67 68 69 70 71 72
 * Look up a connection in the cache by protocol parameters.
 *
 * If successful, a pointer to the connection is returned, but no ref is taken.
 * NULL is returned if there is no match.
 *
 * The caller must be holding the RCU read lock.
73
 */
74 75
struct rxrpc_connection *rxrpc_find_connection_rcu(struct rxrpc_local *local,
						   struct sk_buff *skb)
76 77
{
	struct rxrpc_connection *conn;
78
	struct rxrpc_conn_proto k;
79
	struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
80 81
	struct sockaddr_rxrpc srx;
	struct rxrpc_peer *peer;
82

83
	_enter(",%x", sp->hdr.cid & RXRPC_CIDMASK);
84

85 86
	if (rxrpc_extract_addr_from_skb(&srx, skb) < 0)
		goto not_found;
87

88 89 90
	k.epoch	= sp->hdr.epoch;
	k.cid	= sp->hdr.cid & RXRPC_CIDMASK;

91 92 93 94 95 96 97 98 99 100
	/* 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;
101

102
	if (sp->hdr.flags & RXRPC_CLIENT_INITIATED) {
103 104 105 106 107 108 109
		/* 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;
110 111 112 113 114
		conn = rxrpc_find_service_conn_rcu(peer, skb);
		if (!conn || atomic_read(&conn->usage) == 0)
			goto not_found;
		_leave(" = %p", conn);
		return conn;
115
	} else {
116 117 118
		/* Look up client connections by connection ID alone as their
		 * IDs are unique for this machine.
		 */
119
		conn = idr_find(&rxrpc_client_conn_ids,
120 121 122 123 124 125 126
				sp->hdr.cid >> RXRPC_CIDSHIFT);
		if (!conn || atomic_read(&conn->usage) == 0) {
			_debug("no conn");
			goto not_found;
		}

		if (conn->proto.epoch != k.epoch ||
127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144
		    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();
		}

		_leave(" = %p", conn);
		return conn;
145 146
	}

147
not_found:
148 149 150 151
	_leave(" = NULL");
	return NULL;
}

152 153
/*
 * Disconnect a call and clear any channel it occupies when that call
154 155
 * terminates.  The caller must hold the channel_lock and must release the
 * call's ref on the connection.
156
 */
157
void __rxrpc_disconnect_call(struct rxrpc_call *call)
158 159
{
	struct rxrpc_connection *conn = call->conn;
160 161
	struct rxrpc_channel *chan =
		&conn->channels[call->cid & RXRPC_CHANNELMASK];
162

163
	_enter("%d,%x", conn->debug_id, call->cid);
164

165 166 167 168 169 170 171 172
	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;
173

174
		rcu_assign_pointer(chan->call, NULL);
175 176 177
		atomic_inc(&conn->avail_chans);
		wake_up(&conn->channel_wq);
	}
178

179 180 181 182 183 184 185 186 187 188 189 190 191
	_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);
192 193 194
	spin_unlock(&conn->channel_lock);

	call->conn = NULL;
195
	conn->idle_timestamp = jiffies;
196
	rxrpc_put_connection(conn);
197 198
}

199 200 201
/*
 * release a virtual connection
 */
202
void __rxrpc_put_connection(struct rxrpc_connection *conn)
203
{
204
	rxrpc_queue_delayed_work(&rxrpc_connection_reap, 0);
205 206 207 208 209
}

/*
 * destroy a virtual connection
 */
210
static void rxrpc_destroy_connection(struct rcu_head *rcu)
211
{
212 213 214 215
	struct rxrpc_connection *conn =
		container_of(rcu, struct rxrpc_connection, rcu);

	_enter("{%d,u=%d}", conn->debug_id, atomic_read(&conn->usage));
216 217 218 219 220 221 222

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

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

	rxrpc_purge_queue(&conn->rx_queue);

223
	conn->security->clear(conn);
224
	key_put(conn->params.key);
225
	key_put(conn->server_key);
226 227
	rxrpc_put_peer(conn->params.peer);
	rxrpc_put_local(conn->params.local);
228

229 230 231 232 233 234 235
	kfree(conn);
	_leave("");
}

/*
 * reap dead connections
 */
R
Roel Kluin 已提交
236
static void rxrpc_connection_reaper(struct work_struct *work)
237 238
{
	struct rxrpc_connection *conn, *_p;
239
	unsigned long reap_older_than, earliest, idle_timestamp, now;
240 241 242 243 244

	LIST_HEAD(graveyard);

	_enter("");

245 246
	now = jiffies;
	reap_older_than = now - rxrpc_connection_expiry * HZ;
247 248
	earliest = ULONG_MAX;

249
	write_lock(&rxrpc_connection_lock);
250
	list_for_each_entry_safe(conn, _p, &rxrpc_connections, link) {
251 252
		ASSERTCMP(atomic_read(&conn->usage), >, 0);
		if (likely(atomic_read(&conn->usage) > 1))
253 254
			continue;

255 256 257 258 259 260 261 262
		idle_timestamp = READ_ONCE(conn->idle_timestamp);
		_debug("reap CONN %d { u=%d,t=%ld }",
		       conn->debug_id, atomic_read(&conn->usage),
		       (long)reap_older_than - (long)idle_timestamp);

		if (time_after(idle_timestamp, reap_older_than)) {
			if (time_before(idle_timestamp, earliest))
				earliest = idle_timestamp;
263
			continue;
264
		}
265 266 267 268 269 270 271 272 273 274 275 276 277

		/* 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);
278
	}
279
	write_unlock(&rxrpc_connection_lock);
280 281 282

	if (earliest != ULONG_MAX) {
		_debug("reschedule reaper %ld", (long) earliest - now);
283
		ASSERT(time_after(earliest, now));
284
		rxrpc_queue_delayed_work(&rxrpc_connection_reap,
285
					 earliest - now);
286 287 288 289 290 291 292 293
	}

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

		ASSERTCMP(atomic_read(&conn->usage), ==, 0);
294 295
		skb_queue_purge(&conn->rx_queue);
		call_rcu(&conn->rcu, rxrpc_destroy_connection);
296 297 298 299 300 301 302 303 304 305 306
	}

	_leave("");
}

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

310 311
	_enter("");

312
	rxrpc_connection_expiry = 0;
313
	cancel_delayed_work(&rxrpc_connection_reap);
314
	rxrpc_queue_delayed_work(&rxrpc_connection_reap, 0);
315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330
	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();
331 332 333

	_leave("");
}