forked from Minki/linux
be6e6707f6
Rework peer object handling to use a hash table instead of a flat list and to use RCU. Peer objects are no longer destroyed by passing them to a workqueue to process, but rather are just passed to the RCU garbage collector as kfree'able objects. The hash function uses the local endpoint plus all the components of the remote address, except for the RxRPC service ID. Peers thus represent a UDP port on the remote machine as contacted by a UDP port on this machine. The RCU read lock is used to handle non-creating lookups so that they can be called from bottom half context in the sk_error_report handler without having to lock the hash table against modification. rxrpc_lookup_peer_rcu() *does* take a reference on the peer object as in the future, this will be passed to a work item for error distribution in the error_report path and this function will cease being used in the data_ready path. Creating lookups are done under spinlock rather than mutex as they might be set up due to an external stimulus if the local endpoint is a server. Captured network error messages (ICMP) are handled with respect to this struct and MTU size and RTT are cached here. Signed-off-by: David Howells <dhowells@redhat.com>
31 lines
472 B
Makefile
31 lines
472 B
Makefile
#
|
|
# Makefile for Linux kernel RxRPC
|
|
#
|
|
|
|
af-rxrpc-y := \
|
|
af_rxrpc.o \
|
|
call_accept.o \
|
|
call_event.o \
|
|
call_object.o \
|
|
conn_event.o \
|
|
conn_object.o \
|
|
input.o \
|
|
insecure.o \
|
|
key.o \
|
|
local_object.o \
|
|
misc.o \
|
|
output.o \
|
|
peer_event.o \
|
|
peer_object.o \
|
|
recvmsg.o \
|
|
security.o \
|
|
skbuff.o \
|
|
transport.o \
|
|
utils.o
|
|
|
|
af-rxrpc-$(CONFIG_PROC_FS) += proc.o
|
|
af-rxrpc-$(CONFIG_RXKAD) += rxkad.o
|
|
af-rxrpc-$(CONFIG_SYSCTL) += sysctl.o
|
|
|
|
obj-$(CONFIG_AF_RXRPC) += af-rxrpc.o
|