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 _leave(" = %p {u=%d}", peer, refcount_read(&peer->ref));
143 return peer;
147 * assess the MTU size for the network interface through which this peer is
151 struct rxrpc_peer *peer)
162 peer->if_mtu = 1500;
165 switch (peer->srx.transport.family) {
169 peer->srx.transport.sin.sin_addr.s_addr, 0,
183 memcpy(&fl6->daddr, &peer->srx.transport.sin6.sin6_addr,
199 peer->if_mtu = dst_mtu(dst);
202 _leave(" [if_mtu %u]", peer->if_mtu);
206 * Allocate a peer.
211 struct rxrpc_peer *peer;
215 peer = kzalloc(sizeof(struct rxrpc_peer), gfp);
216 if (peer) {
217 refcount_set(&peer->ref, 1);
218 peer->local = rxrpc_get_local(local, rxrpc_local_get_peer);
219 INIT_HLIST_HEAD(&peer->error_targets);
220 peer->service_conns = RB_ROOT;
221 seqlock_init(&peer->service_conn_lock);
222 spin_lock_init(&peer->lock);
223 spin_lock_init(&peer->rtt_input_lock);
224 peer->debug_id = atomic_inc_return(&rxrpc_debug_id);
226 rxrpc_peer_init_rtt(peer);
228 peer->cong_ssthresh = RXRPC_TX_MAX_WINDOW;
229 trace_rxrpc_peer(peer->debug_id, 1, why);
232 _leave(" = %p", peer);
233 return peer;
237 * Initialise peer record.
239 static void rxrpc_init_peer(struct rxrpc_local *local, struct rxrpc_peer *peer,
242 peer->hash_key = hash_key;
243 rxrpc_assess_MTU_size(local, peer);
244 peer->mtu = peer->if_mtu;
245 peer->rtt_last_req = ktime_get_real();
247 switch (peer->srx.transport.family) {
249 peer->hdrsize = sizeof(struct iphdr);
253 peer->hdrsize = sizeof(struct ipv6hdr);
260 switch (peer->srx.transport_type) {
262 peer->hdrsize += sizeof(struct udphdr);
268 peer->hdrsize += sizeof(struct rxrpc_wire_header);
269 peer->maxdata = peer->mtu - peer->hdrsize;
273 * Set up a new peer.
280 struct rxrpc_peer *peer;
284 peer = rxrpc_alloc_peer(local, gfp, rxrpc_peer_new_client);
285 if (peer) {
286 memcpy(&peer->srx, srx, sizeof(*srx));
287 rxrpc_init_peer(local, peer, hash_key);
290 _leave(" = %p", peer);
291 return peer;
294 static void rxrpc_free_peer(struct rxrpc_peer *peer)
296 trace_rxrpc_peer(peer->debug_id, 0, rxrpc_peer_free);
297 rxrpc_put_local(peer->local, rxrpc_local_put_peer);
298 kfree_rcu(peer, rcu);
302 * Set up a new incoming peer. There shouldn't be any other matching peers
306 void rxrpc_new_incoming_peer(struct rxrpc_local *local, struct rxrpc_peer *peer)
311 hash_key = rxrpc_peer_hash_key(local, &peer->srx);
312 rxrpc_init_peer(local, peer, hash_key);
315 hash_add_rcu(rxnet->peer_hash, &peer->hash_link, hash_key);
316 list_add_tail(&peer->keepalive_link, &rxnet->peer_keepalive_new);
326 struct rxrpc_peer *peer, *candidate;
332 /* search the peer list first */
334 peer = __rxrpc_lookup_peer_rcu(local, srx, hash_key);
335 if (peer && !rxrpc_get_peer_maybe(peer, rxrpc_peer_get_lookup_client))
336 peer = NULL;
339 if (!peer) {
340 /* The peer is not yet present in hash - create a candidate
352 peer = __rxrpc_lookup_peer_rcu(local, srx, hash_key);
353 if (peer && !rxrpc_get_peer_maybe(peer, rxrpc_peer_get_lookup_client))
354 peer = NULL;
355 if (!peer) {
364 if (peer)
367 peer = candidate;
370 _leave(" = %p {u=%d}", peer, refcount_read(&peer->ref));
371 return peer;
375 * Get a ref on a peer record.
377 struct rxrpc_peer *rxrpc_get_peer(struct rxrpc_peer *peer, enum rxrpc_peer_trace why)
381 __refcount_inc(&peer->ref, &r);
382 trace_rxrpc_peer(peer->debug_id, r + 1, why);
383 return peer;
387 * Get a ref on a peer record unless its usage has already reached 0.
389 struct rxrpc_peer *rxrpc_get_peer_maybe(struct rxrpc_peer *peer,
394 if (peer) {
395 if (__refcount_inc_not_zero(&peer->ref, &r))
396 trace_rxrpc_peer(peer->debug_id, r + 1, why);
398 peer = NULL;
400 return peer;
404 * Discard a peer record.
406 static void __rxrpc_put_peer(struct rxrpc_peer *peer)
408 struct rxrpc_net *rxnet = peer->local->rxnet;
410 ASSERT(hlist_empty(&peer->error_targets));
413 hash_del_rcu(&peer->hash_link);
414 list_del_init(&peer->keepalive_link);
417 rxrpc_free_peer(peer);
421 * Drop a ref on a peer record.
423 void rxrpc_put_peer(struct rxrpc_peer *peer, enum rxrpc_peer_trace why)
429 if (peer) {
430 debug_id = peer->debug_id;
431 dead = __refcount_dec_and_test(&peer->ref, &r);
434 __rxrpc_put_peer(peer);
439 * Make sure all peer records have been discarded.
443 struct rxrpc_peer *peer;
450 hlist_for_each_entry(peer, &rxnet->peer_hash[i], hash_link) {
451 pr_err("Leaked peer %u {%u} %pISp\n",
452 peer->debug_id,
453 refcount_read(&peer->ref),
454 &peer->srx.transport);
460 * rxrpc_kernel_get_peer - Get the peer address of a call
465 * Get the address of the remote peer in a call.
470 *_srx = call->peer->srx;
475 * rxrpc_kernel_get_srtt - Get a call's peer smoothed RTT
480 * Get the call's peer smoothed RTT in uS.
485 struct rxrpc_peer *peer = call->peer;
487 if (peer->rtt_count == 0) {
492 *_srtt = call->peer->srtt_us >> 3;