Lines Matching refs:peer
22 * the hash function. So, instead, we use a hash table for the peer and from
27 struct rxrpc_connection *rxrpc_find_service_conn_rcu(struct rxrpc_peer *peer,
45 read_seqbegin_or_lock(&peer->service_conn_lock, &seq);
47 p = rcu_dereference_raw(peer->service_conns.rb_node);
59 } while (need_seqretry(&peer->service_conn_lock, seq));
61 done_seqretry(&peer->service_conn_lock, seq);
67 * Insert a service connection into a peer's tree, thereby making it a target
70 static void rxrpc_publish_service_conn(struct rxrpc_peer *peer,
77 write_seqlock_bh(&peer->service_conn_lock);
79 pp = &peer->service_conns.rb_node;
95 rb_insert_color(&conn->service_node, &peer->service_conns);
98 write_sequnlock_bh(&peer->service_conn_lock);
105 write_sequnlock_bh(&peer->service_conn_lock);
117 &peer->service_conns);
189 rxrpc_publish_service_conn(conn->params.peer, conn);
195 * Remove the service connection from the peer's tree, thereby removing it as a
200 struct rxrpc_peer *peer = conn->params.peer;
202 write_seqlock_bh(&peer->service_conn_lock);
204 rb_erase(&conn->service_node, &peer->service_conns);
205 write_sequnlock_bh(&peer->service_conn_lock);