peer_event.c 10.8 KB
Newer Older
1
/* Peer event handling, typically ICMP messages.
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
 *
 * 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.
 */

#include <linux/module.h>
#include <linux/net.h>
#include <linux/skbuff.h>
#include <linux/errqueue.h>
#include <linux/udp.h>
#include <linux/in.h>
#include <linux/in6.h>
#include <linux/icmp.h>
#include <net/sock.h>
#include <net/af_rxrpc.h>
#include <net/ip.h>
#include "ar-internal.h"

25 26
static void rxrpc_store_error(struct rxrpc_peer *, struct sock_exterr_skb *);

27 28 29 30 31 32 33 34 35 36 37 38 39
/*
 * Find the peer associated with an ICMP packet.
 */
static struct rxrpc_peer *rxrpc_lookup_peer_icmp_rcu(struct rxrpc_local *local,
						     const struct sk_buff *skb)
{
	struct sock_exterr_skb *serr = SKB_EXT_ERR(skb);
	struct sockaddr_rxrpc srx;

	_enter("");

	memset(&srx, 0, sizeof(srx));
	srx.transport_type = local->srx.transport_type;
D
David Howells 已提交
40
	srx.transport_len = local->srx.transport_len;
41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68
	srx.transport.family = local->srx.transport.family;

	/* Can we see an ICMP4 packet on an ICMP6 listening socket?  and vice
	 * versa?
	 */
	switch (srx.transport.family) {
	case AF_INET:
		srx.transport.sin.sin_port = serr->port;
		switch (serr->ee.ee_origin) {
		case SO_EE_ORIGIN_ICMP:
			_net("Rx ICMP");
			memcpy(&srx.transport.sin.sin_addr,
			       skb_network_header(skb) + serr->addr_offset,
			       sizeof(struct in_addr));
			break;
		case SO_EE_ORIGIN_ICMP6:
			_net("Rx ICMP6 on v4 sock");
			memcpy(&srx.transport.sin.sin_addr,
			       skb_network_header(skb) + serr->addr_offset + 12,
			       sizeof(struct in_addr));
			break;
		default:
			memcpy(&srx.transport.sin.sin_addr, &ip_hdr(skb)->saddr,
			       sizeof(struct in_addr));
			break;
		}
		break;

69
#ifdef CONFIG_AF_RXRPC_IPV6
D
David Howells 已提交
70 71 72 73 74 75 76 77 78 79 80
	case AF_INET6:
		srx.transport.sin6.sin6_port = serr->port;
		switch (serr->ee.ee_origin) {
		case SO_EE_ORIGIN_ICMP6:
			_net("Rx ICMP6");
			memcpy(&srx.transport.sin6.sin6_addr,
			       skb_network_header(skb) + serr->addr_offset,
			       sizeof(struct in6_addr));
			break;
		case SO_EE_ORIGIN_ICMP:
			_net("Rx ICMP on v6 sock");
D
David Howells 已提交
81 82 83
			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);
84
			memcpy(srx.transport.sin6.sin6_addr.s6_addr + 12,
D
David Howells 已提交
85 86 87 88 89 90 91 92 93 94
			       skb_network_header(skb) + serr->addr_offset,
			       sizeof(struct in_addr));
			break;
		default:
			memcpy(&srx.transport.sin6.sin6_addr,
			       &ipv6_hdr(skb)->saddr,
			       sizeof(struct in6_addr));
			break;
		}
		break;
95
#endif
D
David Howells 已提交
96

97 98 99 100 101 102 103
	default:
		BUG();
	}

	return rxrpc_lookup_peer_rcu(local, &srx);
}

104 105 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
/*
 * Handle an MTU/fragmentation problem.
 */
static void rxrpc_adjust_mtu(struct rxrpc_peer *peer, struct sock_exterr_skb *serr)
{
	u32 mtu = serr->ee.ee_info;

	_net("Rx ICMP Fragmentation Needed (%d)", mtu);

	/* wind down the local interface MTU */
	if (mtu > 0 && peer->if_mtu == 65535 && mtu < peer->if_mtu) {
		peer->if_mtu = mtu;
		_net("I/F MTU %u", mtu);
	}

	if (mtu == 0) {
		/* they didn't give us a size, estimate one */
		mtu = peer->if_mtu;
		if (mtu > 1500) {
			mtu >>= 1;
			if (mtu < 1500)
				mtu = 1500;
		} else {
			mtu -= 100;
			if (mtu < peer->hdrsize)
				mtu = peer->hdrsize + 4;
		}
	}

	if (mtu < peer->mtu) {
		spin_lock_bh(&peer->lock);
		peer->mtu = mtu;
		peer->maxdata = peer->mtu - peer->hdrsize;
		spin_unlock_bh(&peer->lock);
		_net("Net MTU %u (maxdata %u)",
		     peer->mtu, peer->maxdata);
	}
}

143
/*
144
 * Handle an error received on the local endpoint.
145
 */
146
void rxrpc_error_report(struct sock *sk)
147 148 149 150 151 152 153 154
{
	struct sock_exterr_skb *serr;
	struct rxrpc_local *local = sk->sk_user_data;
	struct rxrpc_peer *peer;
	struct sk_buff *skb;

	_enter("%p{%d}", sk, local->debug_id);

155
	skb = sock_dequeue_err_skb(sk);
156 157 158 159
	if (!skb) {
		_leave("UDP socket errqueue empty");
		return;
	}
D
David Howells 已提交
160
	rxrpc_new_skb(skb, rxrpc_skb_rx_received);
161 162
	serr = SKB_EXT_ERR(skb);
	if (!skb->len && serr->ee.ee_origin == SO_EE_ORIGIN_TIMESTAMPING) {
163
		_leave("UDP empty message");
D
David Howells 已提交
164
		rxrpc_free_skb(skb, rxrpc_skb_rx_freed);
165 166
		return;
	}
167

168 169 170 171 172 173
	rcu_read_lock();
	peer = rxrpc_lookup_peer_icmp_rcu(local, skb);
	if (peer && !rxrpc_get_peer_maybe(peer))
		peer = NULL;
	if (!peer) {
		rcu_read_unlock();
D
David Howells 已提交
174
		rxrpc_free_skb(skb, rxrpc_skb_rx_freed);
175 176 177 178
		_leave(" [no peer]");
		return;
	}

179 180 181 182
	if ((serr->ee.ee_origin == SO_EE_ORIGIN_ICMP &&
	     serr->ee.ee_type == ICMP_DEST_UNREACH &&
	     serr->ee.ee_code == ICMP_FRAG_NEEDED)) {
		rxrpc_adjust_mtu(peer, serr);
183
		rcu_read_unlock();
D
David Howells 已提交
184
		rxrpc_free_skb(skb, rxrpc_skb_rx_freed);
185 186 187
		rxrpc_put_peer(peer);
		_leave(" [MTU update]");
		return;
188 189
	}

190
	rxrpc_store_error(peer, serr);
191
	rcu_read_unlock();
D
David Howells 已提交
192
	rxrpc_free_skb(skb, rxrpc_skb_rx_freed);
193

194
	/* The ref we obtained is passed off to the work item */
195
	__rxrpc_queue_peer_error(peer);
196 197 198 199
	_leave("");
}

/*
200
 * Map an error report to error codes on the peer record.
201
 */
202 203
static void rxrpc_store_error(struct rxrpc_peer *peer,
			      struct sock_exterr_skb *serr)
204 205
{
	struct sock_extended_err *ee;
206
	int err;
207 208 209 210 211 212 213 214 215 216 217 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 248 249 250 251 252 253 254

	_enter("");

	ee = &serr->ee;

	_net("Rx Error o=%d t=%d c=%d e=%d",
	     ee->ee_origin, ee->ee_type, ee->ee_code, ee->ee_errno);

	err = ee->ee_errno;

	switch (ee->ee_origin) {
	case SO_EE_ORIGIN_ICMP:
		switch (ee->ee_type) {
		case ICMP_DEST_UNREACH:
			switch (ee->ee_code) {
			case ICMP_NET_UNREACH:
				_net("Rx Received ICMP Network Unreachable");
				break;
			case ICMP_HOST_UNREACH:
				_net("Rx Received ICMP Host Unreachable");
				break;
			case ICMP_PORT_UNREACH:
				_net("Rx Received ICMP Port Unreachable");
				break;
			case ICMP_NET_UNKNOWN:
				_net("Rx Received ICMP Unknown Network");
				break;
			case ICMP_HOST_UNKNOWN:
				_net("Rx Received ICMP Unknown Host");
				break;
			default:
				_net("Rx Received ICMP DestUnreach code=%u",
				     ee->ee_code);
				break;
			}
			break;

		case ICMP_TIME_EXCEEDED:
			_net("Rx Received ICMP TTL Exceeded");
			break;

		default:
			_proto("Rx Received ICMP error { type=%u code=%u }",
			       ee->ee_type, ee->ee_code);
			break;
		}
		break;

255
	case SO_EE_ORIGIN_NONE:
256
	case SO_EE_ORIGIN_LOCAL:
257
		_proto("Rx Received local error { error=%d }", err);
258
		err += RXRPC_LOCAL_ERROR_OFFSET;
259 260 261 262
		break;

	case SO_EE_ORIGIN_ICMP6:
	default:
263
		_proto("Rx Received error report { orig=%u }", ee->ee_origin);
264 265 266
		break;
	}

267 268 269 270 271 272 273 274 275 276 277
	peer->error_report = err;
}

/*
 * Distribute an error that occurred on a peer
 */
void rxrpc_peer_error_distributor(struct work_struct *work)
{
	struct rxrpc_peer *peer =
		container_of(work, struct rxrpc_peer, error_distributor);
	struct rxrpc_call *call;
278 279
	enum rxrpc_call_completion compl;
	int error;
280 281

	_enter("");
282

283 284 285 286 287 288 289
	error = READ_ONCE(peer->error_report);
	if (error < RXRPC_LOCAL_ERROR_OFFSET) {
		compl = RXRPC_CALL_NETWORK_ERROR;
	} else {
		compl = RXRPC_CALL_LOCAL_ERROR;
		error -= RXRPC_LOCAL_ERROR_OFFSET;
	}
290

291
	_debug("ISSUE ERROR %s %d", rxrpc_call_completions[compl], error);
292

293
	spin_lock_bh(&peer->lock);
294

295 296 297 298
	while (!hlist_empty(&peer->error_targets)) {
		call = hlist_entry(peer->error_targets.first,
				   struct rxrpc_call, error_link);
		hlist_del_init(&call->error_link);
D
David Howells 已提交
299
		rxrpc_see_call(call);
300

301
		if (rxrpc_set_call_completion(call, compl, 0, -error))
302
			rxrpc_notify_socket(call);
303 304
	}

305
	spin_unlock_bh(&peer->lock);
306

307
	rxrpc_put_peer(peer);
308 309
	_leave("");
}
D
David Howells 已提交
310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350

/*
 * Add RTT information to cache.  This is called in softirq mode and has
 * exclusive access to the peer RTT data.
 */
void rxrpc_peer_add_rtt(struct rxrpc_call *call, enum rxrpc_rtt_rx_trace why,
			rxrpc_serial_t send_serial, rxrpc_serial_t resp_serial,
			ktime_t send_time, ktime_t resp_time)
{
	struct rxrpc_peer *peer = call->peer;
	s64 rtt;
	u64 sum = peer->rtt_sum, avg;
	u8 cursor = peer->rtt_cursor, usage = peer->rtt_usage;

	rtt = ktime_to_ns(ktime_sub(resp_time, send_time));
	if (rtt < 0)
		return;

	/* Replace the oldest datum in the RTT buffer */
	sum -= peer->rtt_cache[cursor];
	sum += rtt;
	peer->rtt_cache[cursor] = rtt;
	peer->rtt_cursor = (cursor + 1) & (RXRPC_RTT_CACHE_SIZE - 1);
	peer->rtt_sum = sum;
	if (usage < RXRPC_RTT_CACHE_SIZE) {
		usage++;
		peer->rtt_usage = usage;
	}

	/* Now recalculate the average */
	if (usage == RXRPC_RTT_CACHE_SIZE) {
		avg = sum / RXRPC_RTT_CACHE_SIZE;
	} else {
		avg = sum;
		do_div(avg, usage);
	}

	peer->rtt = avg;
	trace_rxrpc_rtt_rx(call, why, send_serial, resp_serial, rtt,
			   usage, avg);
}
351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 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

/*
 * Perform keep-alive pings with VERSION packets to keep any NAT alive.
 */
void rxrpc_peer_keepalive_worker(struct work_struct *work)
{
	struct rxrpc_net *rxnet =
		container_of(work, struct rxrpc_net, peer_keepalive_work);
	struct rxrpc_peer *peer;
	unsigned long delay;
	ktime_t base, now = ktime_get_real();
	s64 diff;
	u8 cursor, slot;

	base = rxnet->peer_keepalive_base;
	cursor = rxnet->peer_keepalive_cursor;

	_enter("%u,%lld", cursor, ktime_sub(now, base));

next_bucket:
	diff = ktime_to_ns(ktime_sub(now, base));
	if (diff < 0)
		goto resched;

	_debug("at %u", cursor);
	spin_lock_bh(&rxnet->peer_hash_lock);
next_peer:
	if (!rxnet->live) {
		spin_unlock_bh(&rxnet->peer_hash_lock);
		goto out;
	}

	/* Everything in the bucket at the cursor is processed this second; the
	 * bucket at cursor + 1 goes now + 1s and so on...
	 */
	if (hlist_empty(&rxnet->peer_keepalive[cursor])) {
		if (hlist_empty(&rxnet->peer_keepalive_new)) {
			spin_unlock_bh(&rxnet->peer_hash_lock);
			goto emptied_bucket;
		}

		hlist_move_list(&rxnet->peer_keepalive_new,
				&rxnet->peer_keepalive[cursor]);
	}

	peer = hlist_entry(rxnet->peer_keepalive[cursor].first,
			   struct rxrpc_peer, keepalive_link);
	hlist_del_init(&peer->keepalive_link);
	if (!rxrpc_get_peer_maybe(peer))
		goto next_peer;

	spin_unlock_bh(&rxnet->peer_hash_lock);

	_debug("peer %u {%pISp}", peer->debug_id, &peer->srx.transport);

recalc:
	diff = ktime_divns(ktime_sub(peer->last_tx_at, base), NSEC_PER_SEC);
	if (diff < -30 || diff > 30)
		goto send; /* LSW of 64-bit time probably wrapped on 32-bit */
	diff += RXRPC_KEEPALIVE_TIME - 1;
	if (diff < 0)
		goto send;

	slot = (diff > RXRPC_KEEPALIVE_TIME - 1) ? RXRPC_KEEPALIVE_TIME - 1 : diff;
	if (slot == 0)
		goto send;

	/* A transmission to this peer occurred since last we examined it so
	 * put it into the appropriate future bucket.
	 */
	slot = (slot + cursor) % ARRAY_SIZE(rxnet->peer_keepalive);
	spin_lock_bh(&rxnet->peer_hash_lock);
	hlist_add_head(&peer->keepalive_link, &rxnet->peer_keepalive[slot]);
	rxrpc_put_peer(peer);
	goto next_peer;

send:
	rxrpc_send_keepalive(peer);
	now = ktime_get_real();
	goto recalc;

emptied_bucket:
	cursor++;
	if (cursor >= ARRAY_SIZE(rxnet->peer_keepalive))
		cursor = 0;
	base = ktime_add_ns(base, NSEC_PER_SEC);
	goto next_bucket;

resched:
	rxnet->peer_keepalive_base = base;
	rxnet->peer_keepalive_cursor = cursor;
	delay = nsecs_to_jiffies(-diff) + 1;
	timer_reduce(&rxnet->peer_keepalive_timer, jiffies + delay);
out:
	_leave("");
}