Lines Matching defs:peer
16 * the hash function. So, instead, we use a hash table for the peer and from
21 struct rxrpc_connection *rxrpc_find_service_conn_rcu(struct rxrpc_peer *peer,
39 read_seqbegin_or_lock(&peer->service_conn_lock, &seq);
41 p = rcu_dereference_raw(peer->service_conns.rb_node);
53 } while (need_seqretry(&peer->service_conn_lock, seq));
55 done_seqretry(&peer->service_conn_lock, seq);
61 * Insert a service connection into a peer's tree, thereby making it a target
64 static void rxrpc_publish_service_conn(struct rxrpc_peer *peer,
71 write_seqlock(&peer->service_conn_lock);
73 pp = &peer->service_conns.rb_node;
89 rb_insert_color(&conn->service_node, &peer->service_conns);
92 write_sequnlock(&peer->service_conn_lock);
99 write_sequnlock(&peer->service_conn_lock);
111 &peer->service_conns);
180 rxrpc_publish_service_conn(conn->peer, conn);
184 * Remove the service connection from the peer's tree, thereby removing it as a
189 struct rxrpc_peer *peer = conn->peer;
191 write_seqlock(&peer->service_conn_lock);
193 rb_erase(&conn->service_node, &peer->service_conns);
194 write_sequnlock(&peer->service_conn_lock);