conn_object.c 10.1 KB
Newer Older
1
/* RxRPC virtual connection handler, common bits.
2
 *
3
 * Copyright (C) 2007, 2016 Red Hat, Inc. All Rights Reserved.
4 5 6 7 8 9 10 11
 * 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
#include <linux/net.h>
#include <linux/skbuff.h>
#include "ar-internal.h"

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

25 26 27
static void rxrpc_connection_reaper(struct work_struct *work);

LIST_HEAD(rxrpc_connections);
28
LIST_HEAD(rxrpc_connection_proc_list);
29 30 31
DEFINE_RWLOCK(rxrpc_connection_lock);
static DECLARE_DELAYED_WORK(rxrpc_connection_reap, rxrpc_connection_reaper);

32 33
static void rxrpc_destroy_connection(struct rcu_head *);

34 35 36
/*
 * 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
		INIT_LIST_HEAD(&conn->cache_link);
46
		spin_lock_init(&conn->channel_lock);
47
		INIT_LIST_HEAD(&conn->waiting_calls);
48
		INIT_WORK(&conn->processor, &rxrpc_process_connection);
49
		INIT_LIST_HEAD(&conn->proc_link);
50
		INIT_LIST_HEAD(&conn->link);
51
		skb_queue_head_init(&conn->rx_queue);
52
		conn->security = &rxrpc_no_security;
53 54 55
		spin_lock_init(&conn->state_lock);
		conn->debug_id = atomic_inc_return(&rxrpc_debug_id);
		conn->size_align = 4;
56
		conn->header_size = sizeof(struct rxrpc_wire_header);
57
		conn->idle_timestamp = jiffies;
58 59
	}

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

/*
65 66 67 68 69 70
 * 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.
71
 */
72 73
struct rxrpc_connection *rxrpc_find_connection_rcu(struct rxrpc_local *local,
						   struct sk_buff *skb)
74 75
{
	struct rxrpc_connection *conn;
76
	struct rxrpc_conn_proto k;
77
	struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
78 79
	struct sockaddr_rxrpc srx;
	struct rxrpc_peer *peer;
80

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

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

86 87 88
	k.epoch	= sp->hdr.epoch;
	k.cid	= sp->hdr.cid & RXRPC_CIDMASK;

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

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

		if (conn->proto.epoch != k.epoch ||
125 126 127 128 129 130 131 132 133 134 135 136
		    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;
137
#ifdef CONFIG_AF_RXRPC_IPV6
D
David Howells 已提交
138 139 140 141 142 143 144 145
		case AF_INET6:
			if (peer->srx.transport.sin6.sin6_port !=
			    srx.transport.sin6.sin6_port ||
			    memcmp(&peer->srx.transport.sin6.sin6_addr,
				   &srx.transport.sin6.sin6_addr,
				   sizeof(struct in6_addr)) != 0)
				goto not_found;
			break;
146
#endif
147 148 149 150 151 152
		default:
			BUG();
		}

		_leave(" = %p", conn);
		return conn;
153 154
	}

155
not_found:
156 157 158 159
	_leave(" = NULL");
	return NULL;
}

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

171
	_enter("%d,%x", conn->debug_id, call->cid);
172

173 174 175 176
	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.
		 */
177
		chan->last_service_id = call->service_id;
178 179
		if (call->abort_code) {
			chan->last_abort = call->abort_code;
180 181
			chan->last_type = RXRPC_PACKET_TYPE_ABORT;
		} else {
182
			chan->last_seq = call->rx_hard_ack;
183 184 185
			chan->last_type = RXRPC_PACKET_TYPE_ACK;
		}
		/* Sync with rxrpc_conn_retransmit(). */
186 187 188
		smp_wmb();
		chan->last_call = chan->call_id;
		chan->call_id = chan->call_counter;
189

190
		rcu_assign_pointer(chan->call, NULL);
191
	}
192

193 194 195 196 197 198 199 200 201 202 203
	_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;

204 205 206 207
	spin_lock_bh(&conn->params.peer->lock);
	hlist_del_init(&call->error_link);
	spin_unlock_bh(&conn->params.peer->lock);

208 209 210
	if (rxrpc_is_client_call(call))
		return rxrpc_disconnect_client_call(call);

211
	spin_lock(&conn->channel_lock);
212
	__rxrpc_disconnect_call(conn, call);
213 214 215
	spin_unlock(&conn->channel_lock);

	call->conn = NULL;
216
	conn->idle_timestamp = jiffies;
217
	rxrpc_put_connection(conn);
218 219
}

220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247
/*
 * Kill off a connection.
 */
void rxrpc_kill_connection(struct rxrpc_connection *conn)
{
	ASSERT(!rcu_access_pointer(conn->channels[0].call) &&
	       !rcu_access_pointer(conn->channels[1].call) &&
	       !rcu_access_pointer(conn->channels[2].call) &&
	       !rcu_access_pointer(conn->channels[3].call));
	ASSERT(list_empty(&conn->cache_link));

	write_lock(&rxrpc_connection_lock);
	list_del_init(&conn->proc_link);
	write_unlock(&rxrpc_connection_lock);

	/* Drain the Rx queue.  Note that even though we've unpublished, an
	 * incoming packet could still be being added to our Rx queue, so we
	 * will need to drain it again in the RCU cleanup handler.
	 */
	rxrpc_purge_queue(&conn->rx_queue);

	/* Leave final destruction to RCU.  The connection processor work item
	 * must carry a ref on the connection to prevent us getting here whilst
	 * it is queued or running.
	 */
	call_rcu(&conn->rcu, rxrpc_destroy_connection);
}

248 249 250
/*
 * release a virtual connection
 */
251
void __rxrpc_put_connection(struct rxrpc_connection *conn)
252
{
253
	rxrpc_queue_delayed_work(&rxrpc_connection_reap, 0);
254 255 256 257 258
}

/*
 * destroy a virtual connection
 */
259
static void rxrpc_destroy_connection(struct rcu_head *rcu)
260
{
261 262 263 264
	struct rxrpc_connection *conn =
		container_of(rcu, struct rxrpc_connection, rcu);

	_enter("{%d,u=%d}", conn->debug_id, atomic_read(&conn->usage));
265 266 267 268 269 270 271

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

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

	rxrpc_purge_queue(&conn->rx_queue);

272
	conn->security->clear(conn);
273
	key_put(conn->params.key);
274
	key_put(conn->server_key);
275 276
	rxrpc_put_peer(conn->params.peer);
	rxrpc_put_local(conn->params.local);
277

278 279 280 281 282
	kfree(conn);
	_leave("");
}

/*
283
 * reap dead service connections
284
 */
R
Roel Kluin 已提交
285
static void rxrpc_connection_reaper(struct work_struct *work)
286 287
{
	struct rxrpc_connection *conn, *_p;
288
	unsigned long reap_older_than, earliest, idle_timestamp, now;
289 290 291 292 293

	LIST_HEAD(graveyard);

	_enter("");

294 295
	now = jiffies;
	reap_older_than = now - rxrpc_connection_expiry * HZ;
296 297
	earliest = ULONG_MAX;

298
	write_lock(&rxrpc_connection_lock);
299
	list_for_each_entry_safe(conn, _p, &rxrpc_connections, link) {
300 301
		ASSERTCMP(atomic_read(&conn->usage), >, 0);
		if (likely(atomic_read(&conn->usage) > 1))
302
			continue;
303 304
		if (conn->state == RXRPC_CONN_SERVICE_PREALLOC)
			continue;
305

306 307 308 309 310 311 312 313
		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;
314
			continue;
315
		}
316 317 318 319 320 321 322 323

		/* 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))
324
			BUG();
325 326 327 328
		else
			rxrpc_unpublish_service_conn(conn);

		list_move_tail(&conn->link, &graveyard);
329
	}
330
	write_unlock(&rxrpc_connection_lock);
331 332 333

	if (earliest != ULONG_MAX) {
		_debug("reschedule reaper %ld", (long) earliest - now);
334
		ASSERT(time_after(earliest, now));
335
		rxrpc_queue_delayed_work(&rxrpc_connection_reap,
336
					 earliest - now);
337 338 339 340 341 342 343 344
	}

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

		ASSERTCMP(atomic_read(&conn->usage), ==, 0);
345
		rxrpc_kill_connection(conn);
346 347 348 349 350 351
	}

	_leave("");
}

/*
352 353
 * preemptively destroy all the service connection records rather than
 * waiting for them to time out
354 355 356
 */
void __exit rxrpc_destroy_all_connections(void)
{
357 358 359
	struct rxrpc_connection *conn, *_p;
	bool leak = false;

360 361
	_enter("");

362 363
	rxrpc_destroy_all_client_connections();

364
	rxrpc_connection_expiry = 0;
365
	cancel_delayed_work(&rxrpc_connection_reap);
366
	rxrpc_queue_delayed_work(&rxrpc_connection_reap, 0);
367 368 369 370 371 372 373 374 375 376 377
	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);

378 379
	ASSERT(list_empty(&rxrpc_connection_proc_list));

380 381 382 383 384
	/* Make sure the local and peer records pinned by any dying connections
	 * are released.
	 */
	rcu_barrier();
	rxrpc_destroy_client_conn_ids();
385 386 387

	_leave("");
}