peer_object.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560
  1. // SPDX-License-Identifier: GPL-2.0-or-later
  2. /* RxRPC remote transport endpoint record management
  3. *
  4. * Copyright (C) 2007, 2016 Red Hat, Inc. All Rights Reserved.
  5. * Written by David Howells (dhowells@redhat.com)
  6. */
  7. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  8. #include <linux/module.h>
  9. #include <linux/net.h>
  10. #include <linux/skbuff.h>
  11. #include <linux/udp.h>
  12. #include <linux/in.h>
  13. #include <linux/in6.h>
  14. #include <linux/slab.h>
  15. #include <linux/hashtable.h>
  16. #include <net/sock.h>
  17. #include <net/af_rxrpc.h>
  18. #include <net/ip.h>
  19. #include <net/route.h>
  20. #include <net/ip6_route.h>
  21. #include "ar-internal.h"
  22. static const struct sockaddr_rxrpc rxrpc_null_addr;
  23. /*
  24. * Hash a peer key.
  25. */
  26. static unsigned long rxrpc_peer_hash_key(struct rxrpc_local *local,
  27. const struct sockaddr_rxrpc *srx)
  28. {
  29. const u16 *p;
  30. unsigned int i, size;
  31. unsigned long hash_key;
  32. _enter("");
  33. hash_key = (unsigned long)local / __alignof__(*local);
  34. hash_key += srx->transport_type;
  35. hash_key += srx->transport_len;
  36. hash_key += srx->transport.family;
  37. switch (srx->transport.family) {
  38. case AF_INET:
  39. hash_key += (u16 __force)srx->transport.sin.sin_port;
  40. size = sizeof(srx->transport.sin.sin_addr);
  41. p = (u16 *)&srx->transport.sin.sin_addr;
  42. break;
  43. #ifdef CONFIG_AF_RXRPC_IPV6
  44. case AF_INET6:
  45. hash_key += (u16 __force)srx->transport.sin.sin_port;
  46. size = sizeof(srx->transport.sin6.sin6_addr);
  47. p = (u16 *)&srx->transport.sin6.sin6_addr;
  48. break;
  49. #endif
  50. default:
  51. WARN(1, "AF_RXRPC: Unsupported transport address family\n");
  52. return 0;
  53. }
  54. /* Step through the peer address in 16-bit portions for speed */
  55. for (i = 0; i < size; i += sizeof(*p), p++)
  56. hash_key += *p;
  57. _leave(" 0x%lx", hash_key);
  58. return hash_key;
  59. }
  60. /*
  61. * Compare a peer to a key. Return -ve, 0 or +ve to indicate less than, same
  62. * or greater than.
  63. *
  64. * Unfortunately, the primitives in linux/hashtable.h don't allow for sorted
  65. * buckets and mid-bucket insertion, so we don't make full use of this
  66. * information at this point.
  67. */
  68. static long rxrpc_peer_cmp_key(const struct rxrpc_peer *peer,
  69. struct rxrpc_local *local,
  70. const struct sockaddr_rxrpc *srx,
  71. unsigned long hash_key)
  72. {
  73. long diff;
  74. diff = ((peer->hash_key - hash_key) ?:
  75. ((unsigned long)peer->local - (unsigned long)local) ?:
  76. (peer->srx.transport_type - srx->transport_type) ?:
  77. (peer->srx.transport_len - srx->transport_len) ?:
  78. (peer->srx.transport.family - srx->transport.family));
  79. if (diff != 0)
  80. return diff;
  81. switch (srx->transport.family) {
  82. case AF_INET:
  83. return ((u16 __force)peer->srx.transport.sin.sin_port -
  84. (u16 __force)srx->transport.sin.sin_port) ?:
  85. memcmp(&peer->srx.transport.sin.sin_addr,
  86. &srx->transport.sin.sin_addr,
  87. sizeof(struct in_addr));
  88. #ifdef CONFIG_AF_RXRPC_IPV6
  89. case AF_INET6:
  90. return ((u16 __force)peer->srx.transport.sin6.sin6_port -
  91. (u16 __force)srx->transport.sin6.sin6_port) ?:
  92. memcmp(&peer->srx.transport.sin6.sin6_addr,
  93. &srx->transport.sin6.sin6_addr,
  94. sizeof(struct in6_addr));
  95. #endif
  96. default:
  97. BUG();
  98. }
  99. }
  100. /*
  101. * Look up a remote transport endpoint for the specified address using RCU.
  102. */
  103. static struct rxrpc_peer *__rxrpc_lookup_peer_rcu(
  104. struct rxrpc_local *local,
  105. const struct sockaddr_rxrpc *srx,
  106. unsigned long hash_key)
  107. {
  108. struct rxrpc_peer *peer;
  109. struct rxrpc_net *rxnet = local->rxnet;
  110. hash_for_each_possible_rcu(rxnet->peer_hash, peer, hash_link, hash_key) {
  111. if (rxrpc_peer_cmp_key(peer, local, srx, hash_key) == 0 &&
  112. refcount_read(&peer->ref) > 0)
  113. return peer;
  114. }
  115. return NULL;
  116. }
  117. /*
  118. * Look up a remote transport endpoint for the specified address using RCU.
  119. */
  120. struct rxrpc_peer *rxrpc_lookup_peer_rcu(struct rxrpc_local *local,
  121. const struct sockaddr_rxrpc *srx)
  122. {
  123. struct rxrpc_peer *peer;
  124. unsigned long hash_key = rxrpc_peer_hash_key(local, srx);
  125. peer = __rxrpc_lookup_peer_rcu(local, srx, hash_key);
  126. if (peer)
  127. _leave(" = %p {u=%d}", peer, refcount_read(&peer->ref));
  128. return peer;
  129. }
  130. /*
  131. * assess the MTU size for the network interface through which this peer is
  132. * reached
  133. */
  134. void rxrpc_assess_MTU_size(struct rxrpc_local *local, struct rxrpc_peer *peer)
  135. {
  136. struct net *net = local->net;
  137. struct dst_entry *dst;
  138. struct rtable *rt;
  139. struct flowi fl;
  140. struct flowi4 *fl4 = &fl.u.ip4;
  141. #ifdef CONFIG_AF_RXRPC_IPV6
  142. struct flowi6 *fl6 = &fl.u.ip6;
  143. #endif
  144. peer->if_mtu = 1500;
  145. if (peer->max_data < peer->if_mtu - peer->hdrsize) {
  146. trace_rxrpc_pmtud_reduce(peer, 0, peer->if_mtu - peer->hdrsize,
  147. rxrpc_pmtud_reduce_route);
  148. peer->max_data = peer->if_mtu - peer->hdrsize;
  149. }
  150. memset(&fl, 0, sizeof(fl));
  151. switch (peer->srx.transport.family) {
  152. case AF_INET:
  153. rt = ip_route_output_ports(
  154. net, fl4, NULL,
  155. peer->srx.transport.sin.sin_addr.s_addr, 0,
  156. htons(7000), htons(7001), IPPROTO_UDP, 0, 0);
  157. if (IS_ERR(rt)) {
  158. _leave(" [route err %ld]", PTR_ERR(rt));
  159. return;
  160. }
  161. dst = &rt->dst;
  162. break;
  163. #ifdef CONFIG_AF_RXRPC_IPV6
  164. case AF_INET6:
  165. fl6->flowi6_iif = LOOPBACK_IFINDEX;
  166. fl6->flowi6_scope = RT_SCOPE_UNIVERSE;
  167. fl6->flowi6_proto = IPPROTO_UDP;
  168. memcpy(&fl6->daddr, &peer->srx.transport.sin6.sin6_addr,
  169. sizeof(struct in6_addr));
  170. fl6->fl6_dport = htons(7001);
  171. fl6->fl6_sport = htons(7000);
  172. dst = ip6_route_output(net, NULL, fl6);
  173. if (dst->error) {
  174. _leave(" [route err %d]", dst->error);
  175. return;
  176. }
  177. break;
  178. #endif
  179. default:
  180. BUG();
  181. }
  182. peer->if_mtu = dst_mtu(dst);
  183. peer->hdrsize += dst->header_len + dst->trailer_len;
  184. peer->tx_seg_max = dst->dev->gso_max_segs;
  185. dst_release(dst);
  186. peer->max_data = umin(RXRPC_JUMBO(1), peer->if_mtu - peer->hdrsize);
  187. peer->pmtud_good = 500;
  188. peer->pmtud_bad = peer->if_mtu - peer->hdrsize + 1;
  189. peer->pmtud_trial = umin(peer->max_data, peer->pmtud_bad - 1);
  190. peer->pmtud_pending = true;
  191. _leave(" [if_mtu %u]", peer->if_mtu);
  192. }
  193. /*
  194. * Allocate a peer.
  195. */
  196. struct rxrpc_peer *rxrpc_alloc_peer(struct rxrpc_local *local, gfp_t gfp,
  197. enum rxrpc_peer_trace why)
  198. {
  199. struct rxrpc_peer *peer;
  200. _enter("");
  201. peer = kzalloc_obj(struct rxrpc_peer, gfp);
  202. if (peer) {
  203. refcount_set(&peer->ref, 1);
  204. peer->local = rxrpc_get_local(local, rxrpc_local_get_peer);
  205. INIT_HLIST_HEAD(&peer->error_targets);
  206. peer->service_conns = RB_ROOT;
  207. seqlock_init(&peer->service_conn_lock);
  208. spin_lock_init(&peer->lock);
  209. peer->debug_id = atomic_inc_return(&rxrpc_debug_id);
  210. peer->recent_srtt_us = UINT_MAX;
  211. peer->cong_ssthresh = RXRPC_TX_MAX_WINDOW;
  212. trace_rxrpc_peer(peer->debug_id, 1, why);
  213. }
  214. _leave(" = %p", peer);
  215. return peer;
  216. }
  217. /*
  218. * Initialise peer record.
  219. */
  220. static void rxrpc_init_peer(struct rxrpc_local *local, struct rxrpc_peer *peer,
  221. unsigned long hash_key)
  222. {
  223. peer->hash_key = hash_key;
  224. switch (peer->srx.transport.family) {
  225. case AF_INET:
  226. peer->hdrsize = sizeof(struct iphdr);
  227. break;
  228. #ifdef CONFIG_AF_RXRPC_IPV6
  229. case AF_INET6:
  230. peer->hdrsize = sizeof(struct ipv6hdr);
  231. break;
  232. #endif
  233. default:
  234. BUG();
  235. }
  236. switch (peer->srx.transport_type) {
  237. case SOCK_DGRAM:
  238. peer->hdrsize += sizeof(struct udphdr);
  239. break;
  240. default:
  241. BUG();
  242. }
  243. peer->hdrsize += sizeof(struct rxrpc_wire_header);
  244. peer->max_data = peer->if_mtu - peer->hdrsize;
  245. }
  246. /*
  247. * Set up a new peer.
  248. */
  249. static struct rxrpc_peer *rxrpc_create_peer(struct rxrpc_local *local,
  250. struct sockaddr_rxrpc *srx,
  251. unsigned long hash_key,
  252. gfp_t gfp)
  253. {
  254. struct rxrpc_peer *peer;
  255. _enter("");
  256. peer = rxrpc_alloc_peer(local, gfp, rxrpc_peer_new_client);
  257. if (peer) {
  258. memcpy(&peer->srx, srx, sizeof(*srx));
  259. rxrpc_init_peer(local, peer, hash_key);
  260. rxrpc_assess_MTU_size(local, peer);
  261. }
  262. _leave(" = %p", peer);
  263. return peer;
  264. }
  265. static void rxrpc_free_peer(struct rxrpc_peer *peer)
  266. {
  267. trace_rxrpc_peer(peer->debug_id, 0, rxrpc_peer_free);
  268. rxrpc_put_local(peer->local, rxrpc_local_put_peer);
  269. kfree_rcu(peer, rcu);
  270. }
  271. /*
  272. * Set up a new incoming peer. There shouldn't be any other matching peers
  273. * since we've already done a search in the list from the non-reentrant context
  274. * (the data_ready handler) that is the only place we can add new peers.
  275. * Called with interrupts disabled.
  276. */
  277. void rxrpc_new_incoming_peer(struct rxrpc_local *local, struct rxrpc_peer *peer)
  278. {
  279. struct rxrpc_net *rxnet = local->rxnet;
  280. unsigned long hash_key;
  281. hash_key = rxrpc_peer_hash_key(local, &peer->srx);
  282. rxrpc_init_peer(local, peer, hash_key);
  283. spin_lock(&rxnet->peer_hash_lock);
  284. hash_add_rcu(rxnet->peer_hash, &peer->hash_link, hash_key);
  285. list_add_tail(&peer->keepalive_link, &rxnet->peer_keepalive_new);
  286. spin_unlock(&rxnet->peer_hash_lock);
  287. }
  288. /*
  289. * obtain a remote transport endpoint for the specified address
  290. */
  291. struct rxrpc_peer *rxrpc_lookup_peer(struct rxrpc_local *local,
  292. struct sockaddr_rxrpc *srx, gfp_t gfp)
  293. {
  294. struct rxrpc_peer *peer, *candidate;
  295. struct rxrpc_net *rxnet = local->rxnet;
  296. unsigned long hash_key = rxrpc_peer_hash_key(local, srx);
  297. _enter("{%pISp}", &srx->transport);
  298. /* search the peer list first */
  299. rcu_read_lock();
  300. peer = __rxrpc_lookup_peer_rcu(local, srx, hash_key);
  301. if (peer && !rxrpc_get_peer_maybe(peer, rxrpc_peer_get_lookup_client))
  302. peer = NULL;
  303. rcu_read_unlock();
  304. if (!peer) {
  305. /* The peer is not yet present in hash - create a candidate
  306. * for a new record and then redo the search.
  307. */
  308. candidate = rxrpc_create_peer(local, srx, hash_key, gfp);
  309. if (!candidate) {
  310. _leave(" = NULL [nomem]");
  311. return NULL;
  312. }
  313. spin_lock_bh(&rxnet->peer_hash_lock);
  314. /* Need to check that we aren't racing with someone else */
  315. peer = __rxrpc_lookup_peer_rcu(local, srx, hash_key);
  316. if (peer && !rxrpc_get_peer_maybe(peer, rxrpc_peer_get_lookup_client))
  317. peer = NULL;
  318. if (!peer) {
  319. hash_add_rcu(rxnet->peer_hash,
  320. &candidate->hash_link, hash_key);
  321. list_add_tail(&candidate->keepalive_link,
  322. &rxnet->peer_keepalive_new);
  323. }
  324. spin_unlock_bh(&rxnet->peer_hash_lock);
  325. if (peer)
  326. rxrpc_free_peer(candidate);
  327. else
  328. peer = candidate;
  329. }
  330. _leave(" = %p {u=%d}", peer, refcount_read(&peer->ref));
  331. return peer;
  332. }
  333. /*
  334. * Get a ref on a peer record.
  335. */
  336. struct rxrpc_peer *rxrpc_get_peer(struct rxrpc_peer *peer, enum rxrpc_peer_trace why)
  337. {
  338. int r;
  339. __refcount_inc(&peer->ref, &r);
  340. trace_rxrpc_peer(peer->debug_id, r + 1, why);
  341. return peer;
  342. }
  343. /*
  344. * Get a ref on a peer record unless its usage has already reached 0.
  345. */
  346. struct rxrpc_peer *rxrpc_get_peer_maybe(struct rxrpc_peer *peer,
  347. enum rxrpc_peer_trace why)
  348. {
  349. int r;
  350. if (peer) {
  351. if (__refcount_inc_not_zero(&peer->ref, &r))
  352. trace_rxrpc_peer(peer->debug_id, r + 1, why);
  353. else
  354. peer = NULL;
  355. }
  356. return peer;
  357. }
  358. /*
  359. * Discard a peer record.
  360. */
  361. static void __rxrpc_put_peer(struct rxrpc_peer *peer)
  362. {
  363. struct rxrpc_net *rxnet = peer->local->rxnet;
  364. ASSERT(hlist_empty(&peer->error_targets));
  365. spin_lock_bh(&rxnet->peer_hash_lock);
  366. hash_del_rcu(&peer->hash_link);
  367. list_del_init(&peer->keepalive_link);
  368. spin_unlock_bh(&rxnet->peer_hash_lock);
  369. rxrpc_free_peer(peer);
  370. }
  371. /*
  372. * Drop a ref on a peer record.
  373. */
  374. void rxrpc_put_peer(struct rxrpc_peer *peer, enum rxrpc_peer_trace why)
  375. {
  376. unsigned int debug_id;
  377. bool dead;
  378. int r;
  379. if (peer) {
  380. debug_id = peer->debug_id;
  381. dead = __refcount_dec_and_test(&peer->ref, &r);
  382. trace_rxrpc_peer(debug_id, r - 1, why);
  383. if (dead)
  384. __rxrpc_put_peer(peer);
  385. }
  386. }
  387. /*
  388. * Make sure all peer records have been discarded.
  389. */
  390. void rxrpc_destroy_all_peers(struct rxrpc_net *rxnet)
  391. {
  392. struct rxrpc_peer *peer;
  393. int i;
  394. for (i = 0; i < HASH_SIZE(rxnet->peer_hash); i++) {
  395. if (hlist_empty(&rxnet->peer_hash[i]))
  396. continue;
  397. hlist_for_each_entry(peer, &rxnet->peer_hash[i], hash_link) {
  398. pr_err("Leaked peer %x {%u} %pISp\n",
  399. peer->debug_id,
  400. refcount_read(&peer->ref),
  401. &peer->srx.transport);
  402. }
  403. }
  404. }
  405. /**
  406. * rxrpc_kernel_get_call_peer - Get the peer address of a call
  407. * @sock: The socket on which the call is in progress.
  408. * @call: The call to query
  409. *
  410. * Get a record for the remote peer in a call.
  411. *
  412. * Return: The call's peer record.
  413. */
  414. struct rxrpc_peer *rxrpc_kernel_get_call_peer(struct socket *sock, struct rxrpc_call *call)
  415. {
  416. return rxrpc_get_peer(call->peer, rxrpc_peer_get_application);
  417. }
  418. EXPORT_SYMBOL(rxrpc_kernel_get_call_peer);
  419. /**
  420. * rxrpc_kernel_get_srtt - Get a call's peer smoothed RTT
  421. * @peer: The peer to query
  422. *
  423. * Get the call's peer smoothed RTT.
  424. *
  425. * Return: The RTT in uS or %UINT_MAX if we have no samples.
  426. */
  427. unsigned int rxrpc_kernel_get_srtt(const struct rxrpc_peer *peer)
  428. {
  429. return READ_ONCE(peer->recent_srtt_us);
  430. }
  431. EXPORT_SYMBOL(rxrpc_kernel_get_srtt);
  432. /**
  433. * rxrpc_kernel_remote_srx - Get the address of a peer
  434. * @peer: The peer to query
  435. *
  436. * Get a pointer to the address from a peer record. The caller is responsible
  437. * for making sure that the address is not deallocated. A fake address will be
  438. * substituted if %peer in NULL.
  439. *
  440. * Return: The rxrpc address record or a fake record.
  441. */
  442. const struct sockaddr_rxrpc *rxrpc_kernel_remote_srx(const struct rxrpc_peer *peer)
  443. {
  444. return peer ? &peer->srx : &rxrpc_null_addr;
  445. }
  446. EXPORT_SYMBOL(rxrpc_kernel_remote_srx);
  447. /**
  448. * rxrpc_kernel_remote_addr - Get the peer transport address of a call
  449. * @peer: The peer to query
  450. *
  451. * Get a pointer to the transport address from a peer record. The caller is
  452. * responsible for making sure that the address is not deallocated. A fake
  453. * address will be substituted if %peer in NULL.
  454. *
  455. * Return: The transport address record or a fake record.
  456. */
  457. const struct sockaddr *rxrpc_kernel_remote_addr(const struct rxrpc_peer *peer)
  458. {
  459. return (const struct sockaddr *)
  460. (peer ? &peer->srx.transport : &rxrpc_null_addr.transport);
  461. }
  462. EXPORT_SYMBOL(rxrpc_kernel_remote_addr);
  463. /**
  464. * rxrpc_kernel_set_peer_data - Set app-specific data on a peer.
  465. * @peer: The peer to alter
  466. * @app_data: The data to set
  467. *
  468. * Set the app-specific data on a peer. AF_RXRPC makes no effort to retain
  469. * anything the data might refer to.
  470. *
  471. * Return: The previous app_data.
  472. */
  473. unsigned long rxrpc_kernel_set_peer_data(struct rxrpc_peer *peer, unsigned long app_data)
  474. {
  475. return xchg(&peer->app_data, app_data);
  476. }
  477. EXPORT_SYMBOL(rxrpc_kernel_set_peer_data);
  478. /**
  479. * rxrpc_kernel_get_peer_data - Get app-specific data from a peer.
  480. * @peer: The peer to query
  481. *
  482. * Retrieve the app-specific data from a peer.
  483. *
  484. * Return: The peer's app data.
  485. */
  486. unsigned long rxrpc_kernel_get_peer_data(const struct rxrpc_peer *peer)
  487. {
  488. return peer->app_data;
  489. }
  490. EXPORT_SYMBOL(rxrpc_kernel_get_peer_data);