1 /* RxRPC remote transport endpoint record management
3 * Copyright (C) 2007, 2016 Red Hat, Inc. All Rights Reserved.
4 * Written by David Howells (dhowells@redhat.com)
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
12 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
14 #include <linux/module.h>
15 #include <linux/net.h>
16 #include <linux/skbuff.h>
17 #include <linux/udp.h>
19 #include <linux/slab.h>
20 #include <linux/hashtable.h>
22 #include <net/af_rxrpc.h>
24 #include <net/route.h>
25 #include "ar-internal.h"
27 static DEFINE_HASHTABLE(rxrpc_peer_hash, 10);
28 static DEFINE_SPINLOCK(rxrpc_peer_hash_lock);
33 static unsigned long rxrpc_peer_hash_key(struct rxrpc_local *local,
34 const struct sockaddr_rxrpc *srx)
38 unsigned long hash_key;
42 hash_key = (unsigned long)local / __alignof__(*local);
43 hash_key += srx->transport_type;
44 hash_key += srx->transport_len;
45 hash_key += srx->transport.family;
47 switch (srx->transport.family) {
49 hash_key += (u16 __force)srx->transport.sin.sin_port;
50 size = sizeof(srx->transport.sin.sin_addr);
51 p = (u16 *)&srx->transport.sin.sin_addr;
54 WARN(1, "AF_RXRPC: Unsupported transport address family\n");
58 /* Step through the peer address in 16-bit portions for speed */
59 for (i = 0; i < size; i += sizeof(*p), p++)
62 _leave(" 0x%lx", hash_key);
67 * Compare a peer to a key. Return -ve, 0 or +ve to indicate less than, same
70 * Unfortunately, the primitives in linux/hashtable.h don't allow for sorted
71 * buckets and mid-bucket insertion, so we don't make full use of this
72 * information at this point.
74 static long rxrpc_peer_cmp_key(const struct rxrpc_peer *peer,
75 struct rxrpc_local *local,
76 const struct sockaddr_rxrpc *srx,
77 unsigned long hash_key)
81 diff = ((peer->hash_key - hash_key) ?:
82 ((unsigned long)peer->local - (unsigned long)local) ?:
83 (peer->srx.transport_type - srx->transport_type) ?:
84 (peer->srx.transport_len - srx->transport_len) ?:
85 (peer->srx.transport.family - srx->transport.family));
89 switch (srx->transport.family) {
91 return ((u16 __force)peer->srx.transport.sin.sin_port -
92 (u16 __force)srx->transport.sin.sin_port) ?:
93 memcmp(&peer->srx.transport.sin.sin_addr,
94 &srx->transport.sin.sin_addr,
95 sizeof(struct in_addr));
102 * Look up a remote transport endpoint for the specified address using RCU.
104 static struct rxrpc_peer *__rxrpc_lookup_peer_rcu(
105 struct rxrpc_local *local,
106 const struct sockaddr_rxrpc *srx,
107 unsigned long hash_key)
109 struct rxrpc_peer *peer;
111 hash_for_each_possible_rcu(rxrpc_peer_hash, peer, hash_link, hash_key) {
112 if (rxrpc_peer_cmp_key(peer, local, srx, hash_key) == 0) {
113 if (atomic_read(&peer->usage) == 0)
123 * Look up a remote transport endpoint for the specified address using RCU.
125 struct rxrpc_peer *rxrpc_lookup_peer_rcu(struct rxrpc_local *local,
126 const struct sockaddr_rxrpc *srx)
128 struct rxrpc_peer *peer;
129 unsigned long hash_key = rxrpc_peer_hash_key(local, srx);
131 peer = __rxrpc_lookup_peer_rcu(local, srx, hash_key);
133 switch (srx->transport.family) {
135 _net("PEER %d {%d,%u,%pI4+%hu}",
137 peer->srx.transport_type,
138 peer->srx.transport.family,
139 &peer->srx.transport.sin.sin_addr,
140 ntohs(peer->srx.transport.sin.sin_port));
144 _leave(" = %p {u=%d}", peer, atomic_read(&peer->usage));
150 * assess the MTU size for the network interface through which this peer is
153 static void rxrpc_assess_MTU_size(struct rxrpc_peer *peer)
160 rt = ip_route_output_ports(&init_net, &fl4, NULL,
161 peer->srx.transport.sin.sin_addr.s_addr, 0,
162 htons(7000), htons(7001),
165 _leave(" [route err %ld]", PTR_ERR(rt));
169 peer->if_mtu = dst_mtu(&rt->dst);
170 dst_release(&rt->dst);
172 _leave(" [if_mtu %u]", peer->if_mtu);
178 struct rxrpc_peer *rxrpc_alloc_peer(struct rxrpc_local *local, gfp_t gfp)
180 struct rxrpc_peer *peer;
184 peer = kzalloc(sizeof(struct rxrpc_peer), gfp);
186 atomic_set(&peer->usage, 1);
188 INIT_HLIST_HEAD(&peer->error_targets);
189 INIT_WORK(&peer->error_distributor,
190 &rxrpc_peer_error_distributor);
191 peer->service_conns = RB_ROOT;
192 seqlock_init(&peer->service_conn_lock);
193 spin_lock_init(&peer->lock);
194 peer->debug_id = atomic_inc_return(&rxrpc_debug_id);
197 _leave(" = %p", peer);
202 * Initialise peer record.
204 static void rxrpc_init_peer(struct rxrpc_peer *peer, unsigned long hash_key)
206 rxrpc_assess_MTU_size(peer);
207 peer->mtu = peer->if_mtu;
209 if (peer->srx.transport.family == AF_INET) {
210 peer->hdrsize = sizeof(struct iphdr);
211 switch (peer->srx.transport_type) {
213 peer->hdrsize += sizeof(struct udphdr);
223 peer->hdrsize += sizeof(struct rxrpc_wire_header);
224 peer->maxdata = peer->mtu - peer->hdrsize;
230 static struct rxrpc_peer *rxrpc_create_peer(struct rxrpc_local *local,
231 struct sockaddr_rxrpc *srx,
232 unsigned long hash_key,
235 struct rxrpc_peer *peer;
239 peer = rxrpc_alloc_peer(local, gfp);
241 peer->hash_key = hash_key;
242 memcpy(&peer->srx, srx, sizeof(*srx));
243 rxrpc_init_peer(peer, hash_key);
246 _leave(" = %p", peer);
251 * Set up a new incoming peer. The address is prestored in the preallocated
254 struct rxrpc_peer *rxrpc_lookup_incoming_peer(struct rxrpc_local *local,
255 struct rxrpc_peer *prealloc)
257 struct rxrpc_peer *peer;
258 unsigned long hash_key;
260 hash_key = rxrpc_peer_hash_key(local, &prealloc->srx);
261 prealloc->local = local;
262 rxrpc_init_peer(prealloc, hash_key);
264 spin_lock(&rxrpc_peer_hash_lock);
266 /* Need to check that we aren't racing with someone else */
267 peer = __rxrpc_lookup_peer_rcu(local, &prealloc->srx, hash_key);
268 if (peer && !rxrpc_get_peer_maybe(peer))
272 hash_add_rcu(rxrpc_peer_hash, &peer->hash_link, hash_key);
275 spin_unlock(&rxrpc_peer_hash_lock);
280 * obtain a remote transport endpoint for the specified address
282 struct rxrpc_peer *rxrpc_lookup_peer(struct rxrpc_local *local,
283 struct sockaddr_rxrpc *srx, gfp_t gfp)
285 struct rxrpc_peer *peer, *candidate;
286 unsigned long hash_key = rxrpc_peer_hash_key(local, srx);
288 _enter("{%d,%d,%pI4+%hu}",
291 &srx->transport.sin.sin_addr,
292 ntohs(srx->transport.sin.sin_port));
294 /* search the peer list first */
296 peer = __rxrpc_lookup_peer_rcu(local, srx, hash_key);
297 if (peer && !rxrpc_get_peer_maybe(peer))
302 /* The peer is not yet present in hash - create a candidate
303 * for a new record and then redo the search.
305 candidate = rxrpc_create_peer(local, srx, hash_key, gfp);
307 _leave(" = NULL [nomem]");
311 spin_lock_bh(&rxrpc_peer_hash_lock);
313 /* Need to check that we aren't racing with someone else */
314 peer = __rxrpc_lookup_peer_rcu(local, srx, hash_key);
315 if (peer && !rxrpc_get_peer_maybe(peer))
318 hash_add_rcu(rxrpc_peer_hash,
319 &candidate->hash_link, hash_key);
321 spin_unlock_bh(&rxrpc_peer_hash_lock);
329 _net("PEER %d {%d,%pI4+%hu}",
331 peer->srx.transport_type,
332 &peer->srx.transport.sin.sin_addr,
333 ntohs(peer->srx.transport.sin.sin_port));
335 _leave(" = %p {u=%d}", peer, atomic_read(&peer->usage));
340 * Discard a ref on a remote peer record.
342 void __rxrpc_put_peer(struct rxrpc_peer *peer)
344 ASSERT(hlist_empty(&peer->error_targets));
346 spin_lock_bh(&rxrpc_peer_hash_lock);
347 hash_del_rcu(&peer->hash_link);
348 spin_unlock_bh(&rxrpc_peer_hash_lock);
350 kfree_rcu(peer, rcu);
354 * rxrpc_kernel_get_peer - Get the peer address of a call
355 * @sock: The socket on which the call is in progress.
356 * @call: The call to query
357 * @_srx: Where to place the result
359 * Get the address of the remote peer in a call.
361 void rxrpc_kernel_get_peer(struct socket *sock, struct rxrpc_call *call,
362 struct sockaddr_rxrpc *_srx)
364 *_srx = call->peer->srx;
366 EXPORT_SYMBOL(rxrpc_kernel_get_peer);