Lines Matching refs:peer
26 * Hash a peer key.
60 /* Step through the peer address in 16-bit portions for speed */
69 * Compare a peer to a key. Return -ve, 0 or +ve to indicate less than, same
76 static long rxrpc_peer_cmp_key(const struct rxrpc_peer *peer,
83 diff = ((peer->hash_key - hash_key) ?:
84 ((unsigned long)peer->local - (unsigned long)local) ?:
85 (peer->srx.transport_type - srx->transport_type) ?:
86 (peer->srx.transport_len - srx->transport_len) ?:
87 (peer->srx.transport.family - srx->transport.family));
93 return ((u16 __force)peer->srx.transport.sin.sin_port -
95 memcmp(&peer->srx.transport.sin.sin_addr,
100 return ((u16 __force)peer->srx.transport.sin6.sin6_port -
102 memcmp(&peer->srx.transport.sin6.sin6_addr,
119 struct rxrpc_peer *peer;
122 hash_for_each_possible_rcu(rxnet->peer_hash, peer, hash_link, hash_key) {
123 if (rxrpc_peer_cmp_key(peer, local, srx, hash_key) == 0 &&
124 refcount_read(&peer->ref) > 0)
125 return peer;
137 struct rxrpc_peer *peer;
140 peer = __rxrpc_lookup_peer_rcu(local, srx, hash_key);
141 if (peer) {
142 _net("PEER %d {%pISp}", peer->debug_id, &peer->srx.transport);
143 _leave(" = %p {u=%d}", peer, refcount_read(&peer->ref));
145 return peer;
149 * assess the MTU size for the network interface through which this peer is
153 struct rxrpc_peer *peer)
164 peer->if_mtu = 1500;
167 switch (peer->srx.transport.family) {
171 peer->srx.transport.sin.sin_addr.s_addr, 0,
185 memcpy(&fl6->daddr, &peer->srx.transport.sin6.sin6_addr,
201 peer->if_mtu = dst_mtu(dst);
204 _leave(" [if_mtu %u]", peer->if_mtu);
208 * Allocate a peer.
213 struct rxrpc_peer *peer;
217 peer = kzalloc(sizeof(struct rxrpc_peer), gfp);
218 if (peer) {
219 refcount_set(&peer->ref, 1);
220 peer->local = rxrpc_get_local(local);
221 INIT_HLIST_HEAD(&peer->error_targets);
222 peer->service_conns = RB_ROOT;
223 seqlock_init(&peer->service_conn_lock);
224 spin_lock_init(&peer->lock);
225 spin_lock_init(&peer->rtt_input_lock);
226 peer->debug_id = atomic_inc_return(&rxrpc_debug_id);
228 rxrpc_peer_init_rtt(peer);
231 peer->cong_cwnd = 2;
233 peer->cong_cwnd = 3;
235 peer->cong_cwnd = 4;
236 trace_rxrpc_peer(peer->debug_id, rxrpc_peer_new, 1, here);
239 _leave(" = %p", peer);
240 return peer;
244 * Initialise peer record.
246 static void rxrpc_init_peer(struct rxrpc_sock *rx, struct rxrpc_peer *peer,
249 peer->hash_key = hash_key;
250 rxrpc_assess_MTU_size(rx, peer);
251 peer->mtu = peer->if_mtu;
252 peer->rtt_last_req = ktime_get_real();
254 switch (peer->srx.transport.family) {
256 peer->hdrsize = sizeof(struct iphdr);
260 peer->hdrsize = sizeof(struct ipv6hdr);
267 switch (peer->srx.transport_type) {
269 peer->hdrsize += sizeof(struct udphdr);
275 peer->hdrsize += sizeof(struct rxrpc_wire_header);
276 peer->maxdata = peer->mtu - peer->hdrsize;
280 * Set up a new peer.
288 struct rxrpc_peer *peer;
292 peer = rxrpc_alloc_peer(local, gfp);
293 if (peer) {
294 memcpy(&peer->srx, srx, sizeof(*srx));
295 rxrpc_init_peer(rx, peer, hash_key);
298 _leave(" = %p", peer);
299 return peer;
302 static void rxrpc_free_peer(struct rxrpc_peer *peer)
304 rxrpc_put_local(peer->local);
305 kfree_rcu(peer, rcu);
309 * Set up a new incoming peer. There shouldn't be any other matching peers
314 struct rxrpc_peer *peer)
319 hash_key = rxrpc_peer_hash_key(local, &peer->srx);
320 rxrpc_init_peer(rx, peer, hash_key);
323 hash_add_rcu(rxnet->peer_hash, &peer->hash_link, hash_key);
324 list_add_tail(&peer->keepalive_link, &rxnet->peer_keepalive_new);
335 struct rxrpc_peer *peer, *candidate;
341 /* search the peer list first */
343 peer = __rxrpc_lookup_peer_rcu(local, srx, hash_key);
344 if (peer && !rxrpc_get_peer_maybe(peer))
345 peer = NULL;
348 if (!peer) {
349 /* The peer is not yet present in hash - create a candidate
361 peer = __rxrpc_lookup_peer_rcu(local, srx, hash_key);
362 if (peer && !rxrpc_get_peer_maybe(peer))
363 peer = NULL;
364 if (!peer) {
373 if (peer)
376 peer = candidate;
379 _net("PEER %d {%pISp}", peer->debug_id, &peer->srx.transport);
381 _leave(" = %p {u=%d}", peer, refcount_read(&peer->ref));
382 return peer;
386 * Get a ref on a peer record.
388 struct rxrpc_peer *rxrpc_get_peer(struct rxrpc_peer *peer)
393 __refcount_inc(&peer->ref, &r);
394 trace_rxrpc_peer(peer->debug_id, rxrpc_peer_got, r + 1, here);
395 return peer;
399 * Get a ref on a peer record unless its usage has already reached 0.
401 struct rxrpc_peer *rxrpc_get_peer_maybe(struct rxrpc_peer *peer)
406 if (peer) {
407 if (__refcount_inc_not_zero(&peer->ref, &r))
408 trace_rxrpc_peer(peer->debug_id, rxrpc_peer_got, r + 1, here);
410 peer = NULL;
412 return peer;
416 * Discard a peer record.
418 static void __rxrpc_put_peer(struct rxrpc_peer *peer)
420 struct rxrpc_net *rxnet = peer->local->rxnet;
422 ASSERT(hlist_empty(&peer->error_targets));
425 hash_del_rcu(&peer->hash_link);
426 list_del_init(&peer->keepalive_link);
429 rxrpc_free_peer(peer);
433 * Drop a ref on a peer record.
435 void rxrpc_put_peer(struct rxrpc_peer *peer)
442 if (peer) {
443 debug_id = peer->debug_id;
444 dead = __refcount_dec_and_test(&peer->ref, &r);
447 __rxrpc_put_peer(peer);
452 * Drop a ref on a peer record where the caller already holds the
455 void rxrpc_put_peer_locked(struct rxrpc_peer *peer)
458 unsigned int debug_id = peer->debug_id;
462 dead = __refcount_dec_and_test(&peer->ref, &r);
465 hash_del_rcu(&peer->hash_link);
466 list_del_init(&peer->keepalive_link);
467 rxrpc_free_peer(peer);
472 * Make sure all peer records have been discarded.
476 struct rxrpc_peer *peer;
483 hlist_for_each_entry(peer, &rxnet->peer_hash[i], hash_link) {
484 pr_err("Leaked peer %u {%u} %pISp\n",
485 peer->debug_id,
486 refcount_read(&peer->ref),
487 &peer->srx.transport);
493 * rxrpc_kernel_get_peer - Get the peer address of a call
498 * Get the address of the remote peer in a call.
503 *_srx = call->peer->srx;
508 * rxrpc_kernel_get_srtt - Get a call's peer smoothed RTT
513 * Get the call's peer smoothed RTT in uS.
518 struct rxrpc_peer *peer = call->peer;
520 if (peer->rtt_count == 0) {
525 *_srtt = call->peer->srtt_us >> 3;