[linux-2.6-block.git] / net / rxrpc / peer_event.c

// SPDX-License-Identifier: GPL-2.0-or-later
/* Peer event handling, typically ICMP messages.
 *
 * Copyright (C) 2007 Red Hat, Inc. All Rights Reserved.
 * Written by David Howells (dhowells@redhat.com)
 */

#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"

static void rxrpc_store_error(struct rxrpc_peer *, struct sock_exterr_skb *);
static void rxrpc_distribute_error(struct rxrpc_peer *, int,
				   enum rxrpc_call_completion);

/*
 * 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 sockaddr_rxrpc *srx)
{
	struct sock_exterr_skb *serr = SKB_EXT_ERR(skb);

	_enter("");

	memset(srx, 0, sizeof(*srx));
	srx->transport_type = local->srx.transport_type;
	srx->transport_len = local->srx.transport_len;
	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_len = sizeof(srx->transport.sin);
		srx->transport.family = 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;

#ifdef CONFIG_AF_RXRPC_IPV6
	case AF_INET6:
		switch (serr->ee.ee_origin) {
		case SO_EE_ORIGIN_ICMP6:
			_net("Rx ICMP6");
			srx->transport.sin6.sin6_port = serr->port;
			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");
			srx->transport_len = sizeof(srx->transport.sin);
			srx->transport.family = AF_INET;
			srx->transport.sin.sin_port = serr->port;
			memcpy(&srx->transport.sin.sin_addr,
			       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;
#endif

	default:
		BUG();
	}

	return rxrpc_lookup_peer_rcu(local, srx);
}

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

/*
 * Handle an error received on the local endpoint.
 */
void rxrpc_error_report(struct sock *sk)
{
	struct sock_exterr_skb *serr;
	struct sockaddr_rxrpc srx;
	struct rxrpc_local *local = sk->sk_user_data;
	struct rxrpc_peer *peer;
	struct sk_buff *skb;

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

	/* Clear the outstanding error value on the socket so that it doesn't
	 * cause kernel_sendmsg() to return it later.
	 */
	sock_error(sk);

	skb = sock_dequeue_err_skb(sk);
	if (!skb) {
		_leave("UDP socket errqueue empty");
		return;
	}
	rxrpc_new_skb(skb, rxrpc_skb_rx_received);
	serr = SKB_EXT_ERR(skb);
	if (!skb->len && serr->ee.ee_origin == SO_EE_ORIGIN_TIMESTAMPING) {
		_leave("UDP empty message");
		rxrpc_free_skb(skb, rxrpc_skb_rx_freed);
		return;
	}

	rcu_read_lock();
	peer = rxrpc_lookup_peer_icmp_rcu(local, skb, &srx);
	if (peer && !rxrpc_get_peer_maybe(peer))
		peer = NULL;
	if (!peer) {
		rcu_read_unlock();
		rxrpc_free_skb(skb, rxrpc_skb_rx_freed);
		_leave(" [no peer]");
		return;
	}

	trace_rxrpc_rx_icmp(peer, &serr->ee, &srx);

	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);
		rcu_read_unlock();
		rxrpc_free_skb(skb, rxrpc_skb_rx_freed);
		rxrpc_put_peer(peer);
		_leave(" [MTU update]");
		return;
	}

	rxrpc_store_error(peer, serr);
	rcu_read_unlock();
	rxrpc_free_skb(skb, rxrpc_skb_rx_freed);
	rxrpc_put_peer(peer);

	_leave("");
}

/*
 * Map an error report to error codes on the peer record.
 */
static void rxrpc_store_error(struct rxrpc_peer *peer,
			      struct sock_exterr_skb *serr)
{
	enum rxrpc_call_completion compl = RXRPC_CALL_NETWORK_ERROR;
	struct sock_extended_err *ee;
	int err;

	_enter("");

	ee = &serr->ee;

	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;

	case SO_EE_ORIGIN_NONE:
	case SO_EE_ORIGIN_LOCAL:
		_proto("Rx Received local error { error=%d }", err);
		compl = RXRPC_CALL_LOCAL_ERROR;
		break;

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

	rxrpc_distribute_error(peer, err, compl);
}

/*
 * Distribute an error that occurred on a peer.
 */
static void rxrpc_distribute_error(struct rxrpc_peer *peer, int error,
				   enum rxrpc_call_completion compl)
{
	struct rxrpc_call *call;

	hlist_for_each_entry_rcu(call, &peer->error_targets, error_link) {
		rxrpc_see_call(call);
		if (call->state < RXRPC_CALL_COMPLETE &&
		    rxrpc_set_call_completion(call, compl, 0, -error))
			rxrpc_notify_socket(call);
	}
}

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

	spin_lock(&peer->rtt_input_lock);

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

	spin_unlock(&peer->rtt_input_lock);

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

	/* Don't need to update this under lock */
	peer->rtt = avg;
	trace_rxrpc_rtt_rx(call, why, send_serial, resp_serial, rtt,
			   usage, avg);
}

/*
 * Perform keep-alive pings.
 */
static void rxrpc_peer_keepalive_dispatch(struct rxrpc_net *rxnet,
					  struct list_head *collector,
					  time64_t base,
					  u8 cursor)
{
	struct rxrpc_peer *peer;
	const u8 mask = ARRAY_SIZE(rxnet->peer_keepalive) - 1;
	time64_t keepalive_at;
	int slot;

	spin_lock_bh(&rxnet->peer_hash_lock);

	while (!list_empty(collector)) {
		peer = list_entry(collector->next,
				  struct rxrpc_peer, keepalive_link);

		list_del_init(&peer->keepalive_link);
		if (!rxrpc_get_peer_maybe(peer))
			continue;

		spin_unlock_bh(&rxnet->peer_hash_lock);

		keepalive_at = peer->last_tx_at + RXRPC_KEEPALIVE_TIME;
		slot = keepalive_at - base;
		_debug("%02x peer %u t=%d {%pISp}",
		       cursor, peer->debug_id, slot, &peer->srx.transport);

		if (keepalive_at <= base ||
		    keepalive_at > base + RXRPC_KEEPALIVE_TIME) {
			rxrpc_send_keepalive(peer);
			slot = RXRPC_KEEPALIVE_TIME;
		}

		/* A transmission to this peer occurred since last we examined
		 * it so put it into the appropriate future bucket.
		 */
		slot += cursor;
		slot &= mask;
		spin_lock_bh(&rxnet->peer_hash_lock);
		list_add_tail(&peer->keepalive_link,
			      &rxnet->peer_keepalive[slot & mask]);
		rxrpc_put_peer_locked(peer);
	}

	spin_unlock_bh(&rxnet->peer_hash_lock);
}

/*
 * 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);
	const u8 mask = ARRAY_SIZE(rxnet->peer_keepalive) - 1;
	time64_t base, now, delay;
	u8 cursor, stop;
	LIST_HEAD(collector);

	now = ktime_get_seconds();
	base = rxnet->peer_keepalive_base;
	cursor = rxnet->peer_keepalive_cursor;
	_enter("%lld,%u", base - now, cursor);

	if (!rxnet->live)
		return;

	/* Remove to a temporary list all the peers that are currently lodged
	 * in expired buckets plus all new peers.
	 *
	 * Everything in the bucket at the cursor is processed this
	 * second; the bucket at cursor + 1 goes at now + 1s and so
	 * on...
	 */
	spin_lock_bh(&rxnet->peer_hash_lock);
	list_splice_init(&rxnet->peer_keepalive_new, &collector);

	stop = cursor + ARRAY_SIZE(rxnet->peer_keepalive);
	while (base <= now && (s8)(cursor - stop) < 0) {
		list_splice_tail_init(&rxnet->peer_keepalive[cursor & mask],
				      &collector);
		base++;
		cursor++;
	}

	base = now;
	spin_unlock_bh(&rxnet->peer_hash_lock);

	rxnet->peer_keepalive_base = base;
	rxnet->peer_keepalive_cursor = cursor;
	rxrpc_peer_keepalive_dispatch(rxnet, &collector, base, cursor);
	ASSERT(list_empty(&collector));

	/* Schedule the timer for the next occupied timeslot. */
	cursor = rxnet->peer_keepalive_cursor;
	stop = cursor + RXRPC_KEEPALIVE_TIME - 1;
	for (; (s8)(cursor - stop) < 0; cursor++) {
		if (!list_empty(&rxnet->peer_keepalive[cursor & mask]))
			break;
		base++;
	}

	now = ktime_get_seconds();
	delay = base - now;
	if (delay < 1)
		delay = 1;
	delay *= HZ;
	if (rxnet->live)
		timer_reduce(&rxnet->peer_keepalive_timer, jiffies + delay);

	_leave("");
}
Commit	Line	Data
2874c5fd	1	// SPDX-License-Identifier: GPL-2.0-or-later
f66d7490	2	/* Peer event handling, typically ICMP messages.
17926a79 DH	3	*
	4	* Copyright (C) 2007 Red Hat, Inc. All Rights Reserved.
	5	* Written by David Howells (dhowells@redhat.com)
17926a79 DH	6	*/
	7
	8	#include <linux/module.h>
	9	#include <linux/net.h>
	10	#include <linux/skbuff.h>
	11	#include <linux/errqueue.h>
	12	#include <linux/udp.h>
	13	#include <linux/in.h>
	14	#include <linux/in6.h>
	15	#include <linux/icmp.h>
	16	#include <net/sock.h>
	17	#include <net/af_rxrpc.h>
	18	#include <net/ip.h>
	19	#include "ar-internal.h"
	20
f66d7490	21	static void rxrpc_store_error(struct rxrpc_peer , struct sock_exterr_skb );
f3344303 DH	22	static void rxrpc_distribute_error(struct rxrpc_peer *, int,
f3344303 DH	23	enum rxrpc_call_completion);
f66d7490	24
be6e6707 DH	25	/*
	26	* Find the peer associated with an ICMP packet.
	27	*/
	28	static struct rxrpc_peer rxrpc_lookup_peer_icmp_rcu(struct rxrpc_local local,
494337c9 DH	29	const struct sk_buff *skb,
494337c9 DH	30	struct sockaddr_rxrpc *srx)
be6e6707 DH	31	{
be6e6707 DH	32	struct sock_exterr_skb *serr = SKB_EXT_ERR(skb);
be6e6707 DH	33
	34	_enter("");
	35
494337c9 DH	36	memset(srx, 0, sizeof(*srx));
	37	srx->transport_type = local->srx.transport_type;
	38	srx->transport_len = local->srx.transport_len;
	39	srx->transport.family = local->srx.transport.family;
be6e6707 DH	40
	41	/* Can we see an ICMP4 packet on an ICMP6 listening socket? and vice
	42	* versa?
	43	*/
494337c9	44	switch (srx->transport.family) {
be6e6707	45	case AF_INET:
46894a13 DH	46	srx->transport_len = sizeof(srx->transport.sin);
46894a13 DH	47	srx->transport.family = AF_INET;
494337c9	48	srx->transport.sin.sin_port = serr->port;
be6e6707 DH	49	switch (serr->ee.ee_origin) {
	50	case SO_EE_ORIGIN_ICMP:
	51	_net("Rx ICMP");
494337c9	52	memcpy(&srx->transport.sin.sin_addr,
be6e6707 DH	53	skb_network_header(skb) + serr->addr_offset,
	54	sizeof(struct in_addr));
	55	break;
	56	case SO_EE_ORIGIN_ICMP6:
	57	_net("Rx ICMP6 on v4 sock");
494337c9	58	memcpy(&srx->transport.sin.sin_addr,
be6e6707 DH	59	skb_network_header(skb) + serr->addr_offset + 12,
	60	sizeof(struct in_addr));
	61	break;
	62	default:
494337c9	63	memcpy(&srx->transport.sin.sin_addr, &ip_hdr(skb)->saddr,
be6e6707 DH	64	sizeof(struct in_addr));
	65	break;
	66	}
	67	break;
	68
d1912747	69	#ifdef CONFIG_AF_RXRPC_IPV6
75b54cb5	70	case AF_INET6:
75b54cb5 DH	71	switch (serr->ee.ee_origin) {
	72	case SO_EE_ORIGIN_ICMP6:
	73	_net("Rx ICMP6");
46894a13	74	srx->transport.sin6.sin6_port = serr->port;
494337c9	75	memcpy(&srx->transport.sin6.sin6_addr,
75b54cb5 DH	76	skb_network_header(skb) + serr->addr_offset,
	77	sizeof(struct in6_addr));
	78	break;
	79	case SO_EE_ORIGIN_ICMP:
	80	_net("Rx ICMP on v6 sock");
46894a13 DH	81	srx->transport_len = sizeof(srx->transport.sin);
	82	srx->transport.family = AF_INET;
	83	srx->transport.sin.sin_port = serr->port;
	84	memcpy(&srx->transport.sin.sin_addr,
75b54cb5 DH	85	skb_network_header(skb) + serr->addr_offset,
	86	sizeof(struct in_addr));
	87	break;
	88	default:
494337c9	89	memcpy(&srx->transport.sin6.sin6_addr,
75b54cb5 DH	90	&ipv6_hdr(skb)->saddr,
	91	sizeof(struct in6_addr));
	92	break;
	93	}
	94	break;
d1912747	95	#endif
75b54cb5	96
be6e6707 DH	97	default:
	98	BUG();
	99	}
	100
494337c9	101	return rxrpc_lookup_peer_rcu(local, srx);
be6e6707 DH	102	}
be6e6707 DH	103
1a70c05b DH	104	/*
	105	* Handle an MTU/fragmentation problem.
	106	*/
	107	static void rxrpc_adjust_mtu(struct rxrpc_peer peer, struct sock_exterr_skb serr)
	108	{
	109	u32 mtu = serr->ee.ee_info;
	110
	111	_net("Rx ICMP Fragmentation Needed (%d)", mtu);
	112
	113	/* wind down the local interface MTU */
	114	if (mtu > 0 && peer->if_mtu == 65535 && mtu < peer->if_mtu) {
	115	peer->if_mtu = mtu;
	116	_net("I/F MTU %u", mtu);
	117	}
	118
	119	if (mtu == 0) {
	120	/* they didn't give us a size, estimate one */
	121	mtu = peer->if_mtu;
	122	if (mtu > 1500) {
	123	mtu >>= 1;
	124	if (mtu < 1500)
	125	mtu = 1500;
	126	} else {
	127	mtu -= 100;
	128	if (mtu < peer->hdrsize)
	129	mtu = peer->hdrsize + 4;
	130	}
	131	}
	132
	133	if (mtu < peer->mtu) {
	134	spin_lock_bh(&peer->lock);
	135	peer->mtu = mtu;
	136	peer->maxdata = peer->mtu - peer->hdrsize;
	137	spin_unlock_bh(&peer->lock);
	138	_net("Net MTU %u (maxdata %u)",
	139	peer->mtu, peer->maxdata);
	140	}
	141	}
	142
17926a79	143	/*
f66d7490	144	* Handle an error received on the local endpoint.
17926a79	145	*/
abe89ef0	146	void rxrpc_error_report(struct sock *sk)
17926a79 DH	147	{
17926a79 DH	148	struct sock_exterr_skb *serr;
494337c9	149	struct sockaddr_rxrpc srx;
17926a79 DH	150	struct rxrpc_local *local = sk->sk_user_data;
	151	struct rxrpc_peer *peer;
	152	struct sk_buff *skb;
17926a79 DH	153
	154	_enter("%p{%d}", sk, local->debug_id);
	155
56d282d9 MD	156	/* Clear the outstanding error value on the socket so that it doesn't
	157	* cause kernel_sendmsg() to return it later.
	158	*/
	159	sock_error(sk);
	160
364a9e93	161	skb = sock_dequeue_err_skb(sk);
17926a79 DH	162	if (!skb) {
	163	_leave("UDP socket errqueue empty");
	164	return;
	165	}
71f3ca40	166	rxrpc_new_skb(skb, rxrpc_skb_rx_received);
c247f053 WB	167	serr = SKB_EXT_ERR(skb);
c247f053 WB	168	if (!skb->len && serr->ee.ee_origin == SO_EE_ORIGIN_TIMESTAMPING) {
49ca0d8b	169	_leave("UDP empty message");
71f3ca40	170	rxrpc_free_skb(skb, rxrpc_skb_rx_freed);
49ca0d8b WB	171	return;
49ca0d8b WB	172	}
17926a79	173
be6e6707	174	rcu_read_lock();
494337c9	175	peer = rxrpc_lookup_peer_icmp_rcu(local, skb, &srx);
be6e6707 DH	176	if (peer && !rxrpc_get_peer_maybe(peer))
	177	peer = NULL;
	178	if (!peer) {
	179	rcu_read_unlock();
71f3ca40	180	rxrpc_free_skb(skb, rxrpc_skb_rx_freed);
17926a79 DH	181	_leave(" [no peer]");
	182	return;
	183	}
	184
494337c9 DH	185	trace_rxrpc_rx_icmp(peer, &serr->ee, &srx);
494337c9 DH	186
1a70c05b DH	187	if ((serr->ee.ee_origin == SO_EE_ORIGIN_ICMP &&
	188	serr->ee.ee_type == ICMP_DEST_UNREACH &&
	189	serr->ee.ee_code == ICMP_FRAG_NEEDED)) {
	190	rxrpc_adjust_mtu(peer, serr);
f66d7490	191	rcu_read_unlock();
71f3ca40	192	rxrpc_free_skb(skb, rxrpc_skb_rx_freed);
f66d7490 DH	193	rxrpc_put_peer(peer);
	194	_leave(" [MTU update]");
	195	return;
17926a79 DH	196	}
17926a79 DH	197
f66d7490	198	rxrpc_store_error(peer, serr);
be6e6707	199	rcu_read_unlock();
71f3ca40	200	rxrpc_free_skb(skb, rxrpc_skb_rx_freed);
1890fea7	201	rxrpc_put_peer(peer);
17926a79	202
17926a79 DH	203	_leave("");
	204	}
	205
	206	/*
f66d7490	207	* Map an error report to error codes on the peer record.
17926a79	208	*/
f66d7490 DH	209	static void rxrpc_store_error(struct rxrpc_peer *peer,
f66d7490 DH	210	struct sock_exterr_skb *serr)
17926a79	211	{
f3344303	212	enum rxrpc_call_completion compl = RXRPC_CALL_NETWORK_ERROR;
17926a79	213	struct sock_extended_err *ee;
c9d10c49	214	int err;
17926a79 DH	215
	216	_enter("");
	217
17926a79 DH	218	ee = &serr->ee;
17926a79 DH	219
17926a79 DH	220	err = ee->ee_errno;
	221
	222	switch (ee->ee_origin) {
	223	case SO_EE_ORIGIN_ICMP:
17926a79 DH	224	switch (ee->ee_type) {
	225	case ICMP_DEST_UNREACH:
	226	switch (ee->ee_code) {
	227	case ICMP_NET_UNREACH:
	228	_net("Rx Received ICMP Network Unreachable");
17926a79 DH	229	break;
	230	case ICMP_HOST_UNREACH:
	231	_net("Rx Received ICMP Host Unreachable");
17926a79 DH	232	break;
	233	case ICMP_PORT_UNREACH:
	234	_net("Rx Received ICMP Port Unreachable");
17926a79 DH	235	break;
	236	case ICMP_NET_UNKNOWN:
	237	_net("Rx Received ICMP Unknown Network");
17926a79 DH	238	break;
	239	case ICMP_HOST_UNKNOWN:
	240	_net("Rx Received ICMP Unknown Host");
17926a79 DH	241	break;
	242	default:
	243	_net("Rx Received ICMP DestUnreach code=%u",
	244	ee->ee_code);
	245	break;
	246	}
	247	break;
	248
	249	case ICMP_TIME_EXCEEDED:
	250	_net("Rx Received ICMP TTL Exceeded");
	251	break;
	252
	253	default:
	254	_proto("Rx Received ICMP error { type=%u code=%u }",
	255	ee->ee_type, ee->ee_code);
	256	break;
	257	}
	258	break;
	259
f66d7490	260	case SO_EE_ORIGIN_NONE:
17926a79	261	case SO_EE_ORIGIN_LOCAL:
fe77d5fc	262	_proto("Rx Received local error { error=%d }", err);
f3344303	263	compl = RXRPC_CALL_LOCAL_ERROR;
17926a79 DH	264	break;
17926a79 DH	265
17926a79 DH	266	case SO_EE_ORIGIN_ICMP6:
17926a79 DH	267	default:
fe77d5fc	268	_proto("Rx Received error report { orig=%u }", ee->ee_origin);
17926a79 DH	269	break;
	270	}
	271
f3344303	272	rxrpc_distribute_error(peer, err, compl);
f66d7490 DH	273	}
	274
	275	/*
f3344303	276	* Distribute an error that occurred on a peer.
f66d7490	277	*/
f3344303 DH	278	static void rxrpc_distribute_error(struct rxrpc_peer *peer, int error,
f3344303 DH	279	enum rxrpc_call_completion compl)
f66d7490	280	{
f66d7490	281	struct rxrpc_call *call;
17926a79	282
f3344303	283	hlist_for_each_entry_rcu(call, &peer->error_targets, error_link) {
e34d4234	284	rxrpc_see_call(call);
f3344303 DH	285	if (call->state < RXRPC_CALL_COMPLETE &&
f3344303 DH	286	rxrpc_set_call_completion(call, compl, 0, -error))
248f219c	287	rxrpc_notify_socket(call);
17926a79	288	}
17926a79	289	}
cf1a6474 DH	290
	291	/*
	292	* Add RTT information to cache. This is called in softirq mode and has
	293	* exclusive access to the peer RTT data.
	294	*/
	295	void rxrpc_peer_add_rtt(struct rxrpc_call *call, enum rxrpc_rtt_rx_trace why,
	296	rxrpc_serial_t send_serial, rxrpc_serial_t resp_serial,
	297	ktime_t send_time, ktime_t resp_time)
	298	{
	299	struct rxrpc_peer *peer = call->peer;
	300	s64 rtt;
	301	u64 sum = peer->rtt_sum, avg;
	302	u8 cursor = peer->rtt_cursor, usage = peer->rtt_usage;
	303
	304	rtt = ktime_to_ns(ktime_sub(resp_time, send_time));
	305	if (rtt < 0)
	306	return;
	307
c1e15b49 DH	308	spin_lock(&peer->rtt_input_lock);
c1e15b49 DH	309
cf1a6474 DH	310	/* Replace the oldest datum in the RTT buffer */
	311	sum -= peer->rtt_cache[cursor];
	312	sum += rtt;
	313	peer->rtt_cache[cursor] = rtt;
	314	peer->rtt_cursor = (cursor + 1) & (RXRPC_RTT_CACHE_SIZE - 1);
	315	peer->rtt_sum = sum;
	316	if (usage < RXRPC_RTT_CACHE_SIZE) {
	317	usage++;
	318	peer->rtt_usage = usage;
	319	}
	320
c1e15b49 DH	321	spin_unlock(&peer->rtt_input_lock);
c1e15b49 DH	322
cf1a6474 DH	323	/* Now recalculate the average */
	324	if (usage == RXRPC_RTT_CACHE_SIZE) {
	325	avg = sum / RXRPC_RTT_CACHE_SIZE;
	326	} else {
	327	avg = sum;
	328	do_div(avg, usage);
	329	}
	330
c1e15b49	331	/* Don't need to update this under lock */
cf1a6474 DH	332	peer->rtt = avg;
	333	trace_rxrpc_rtt_rx(call, why, send_serial, resp_serial, rtt,
	334	usage, avg);
	335	}
ace45bec DH	336
ace45bec DH	337	/*
330bdcfa	338	* Perform keep-alive pings.
ace45bec	339	*/
330bdcfa DH	340	static void rxrpc_peer_keepalive_dispatch(struct rxrpc_net *rxnet,
	341	struct list_head *collector,
	342	time64_t base,
	343	u8 cursor)
ace45bec	344	{
ace45bec	345	struct rxrpc_peer *peer;
330bdcfa DH	346	const u8 mask = ARRAY_SIZE(rxnet->peer_keepalive) - 1;
	347	time64_t keepalive_at;
	348	int slot;
ace45bec	349
330bdcfa	350	spin_lock_bh(&rxnet->peer_hash_lock);
ace45bec	351
330bdcfa DH	352	while (!list_empty(collector)) {
	353	peer = list_entry(collector->next,
	354	struct rxrpc_peer, keepalive_link);
ace45bec	355
330bdcfa DH	356	list_del_init(&peer->keepalive_link);
	357	if (!rxrpc_get_peer_maybe(peer))
	358	continue;
ace45bec	359
ace45bec	360	spin_unlock_bh(&rxnet->peer_hash_lock);
ace45bec	361
330bdcfa DH	362	keepalive_at = peer->last_tx_at + RXRPC_KEEPALIVE_TIME;
	363	slot = keepalive_at - base;
	364	_debug("%02x peer %u t=%d {%pISp}",
	365	cursor, peer->debug_id, slot, &peer->srx.transport);
	366
	367	if (keepalive_at <= base \|\|
	368	keepalive_at > base + RXRPC_KEEPALIVE_TIME) {
	369	rxrpc_send_keepalive(peer);
	370	slot = RXRPC_KEEPALIVE_TIME;
ace45bec DH	371	}
ace45bec DH	372
330bdcfa DH	373	/* A transmission to this peer occurred since last we examined
	374	* it so put it into the appropriate future bucket.
	375	*/
	376	slot += cursor;
	377	slot &= mask;
	378	spin_lock_bh(&rxnet->peer_hash_lock);
	379	list_add_tail(&peer->keepalive_link,
	380	&rxnet->peer_keepalive[slot & mask]);
60034d3d	381	rxrpc_put_peer_locked(peer);
ace45bec DH	382	}
ace45bec DH	383
ace45bec	384	spin_unlock_bh(&rxnet->peer_hash_lock);
330bdcfa	385	}
ace45bec	386
330bdcfa DH	387	/*
	388	* Perform keep-alive pings with VERSION packets to keep any NAT alive.
	389	*/
	390	void rxrpc_peer_keepalive_worker(struct work_struct *work)
	391	{
	392	struct rxrpc_net *rxnet =
	393	container_of(work, struct rxrpc_net, peer_keepalive_work);
	394	const u8 mask = ARRAY_SIZE(rxnet->peer_keepalive) - 1;
	395	time64_t base, now, delay;
	396	u8 cursor, stop;
	397	LIST_HEAD(collector);
ace45bec	398
330bdcfa DH	399	now = ktime_get_seconds();
	400	base = rxnet->peer_keepalive_base;
	401	cursor = rxnet->peer_keepalive_cursor;
	402	_enter("%lld,%u", base - now, cursor);
ace45bec	403
330bdcfa DH	404	if (!rxnet->live)
330bdcfa DH	405	return;
ace45bec	406
330bdcfa DH	407	/* Remove to a temporary list all the peers that are currently lodged
	408	* in expired buckets plus all new peers.
	409	*
	410	* Everything in the bucket at the cursor is processed this
	411	* second; the bucket at cursor + 1 goes at now + 1s and so
	412	* on...
ace45bec	413	*/
ace45bec	414	spin_lock_bh(&rxnet->peer_hash_lock);
330bdcfa DH	415	list_splice_init(&rxnet->peer_keepalive_new, &collector);
	416
	417	stop = cursor + ARRAY_SIZE(rxnet->peer_keepalive);
	418	while (base <= now && (s8)(cursor - stop) < 0) {
	419	list_splice_tail_init(&rxnet->peer_keepalive[cursor & mask],
	420	&collector);
	421	base++;
	422	cursor++;
	423	}
ace45bec	424
330bdcfa DH	425	base = now;
330bdcfa DH	426	spin_unlock_bh(&rxnet->peer_hash_lock);
ace45bec	427
ace45bec DH	428	rxnet->peer_keepalive_base = base;
ace45bec DH	429	rxnet->peer_keepalive_cursor = cursor;
330bdcfa DH	430	rxrpc_peer_keepalive_dispatch(rxnet, &collector, base, cursor);
	431	ASSERT(list_empty(&collector));
	432
	433	/* Schedule the timer for the next occupied timeslot. */
	434	cursor = rxnet->peer_keepalive_cursor;
	435	stop = cursor + RXRPC_KEEPALIVE_TIME - 1;
	436	for (; (s8)(cursor - stop) < 0; cursor++) {
	437	if (!list_empty(&rxnet->peer_keepalive[cursor & mask]))
	438	break;
	439	base++;
	440	}
	441
	442	now = ktime_get_seconds();
	443	delay = base - now;
	444	if (delay < 1)
	445	delay = 1;
	446	delay *= HZ;
	447	if (rxnet->live)
	448	timer_reduce(&rxnet->peer_keepalive_timer, jiffies + delay);
	449
ace45bec DH	450	_leave("");
ace45bec DH	451	}