2019-05-20 19:08:01 +02:00
|
|
|
|
2016-08-23 15:27:24 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-05-10 23:26:01 +01:00
|
|
|
|
2016-08-23 15:27:24 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-06 21:45:42 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
2022-10-06 21:45:42 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:53 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-06 21:45:42 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
2022-10-06 21:45:42 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-01-26 16:17:03 +00:00
|
|
|
|
2022-10-06 21:45:42 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-10 15:51:39 +01:00
|
|
|
|
2022-10-12 22:17:56 +01:00
|
|
|
|
2022-10-12 17:01:25 +01:00
|
|
|
|
2024-12-04 07:46:30 +00:00
|
|
|
|
2022-10-10 15:51:39 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:41 +00:00
|
|
|
|
2024-01-30 21:37:16 +00:00
|
|
|
|
2022-10-10 15:51:39 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:41 +00:00
|
|
|
|
2022-10-21 08:54:03 +01:00
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
2022-10-06 15:43:51 +01:00
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
2022-10-06 15:43:51 +01:00
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
|
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
2024-12-04 07:46:41 +00:00
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
2022-10-21 08:54:03 +01:00
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
|
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2018-03-30 21:05:28 +01:00
|
|
|
|
2022-10-21 13:00:34 +01:00
|
|
|
|
2022-10-20 21:58:36 +01:00
|
|
|
|
2022-10-21 13:00:34 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-20 21:58:36 +01:00
|
|
|
|
2022-10-21 13:00:34 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-12-19 14:22:12 +00:00
|
|
|
|
2022-10-21 13:00:34 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2020-01-23 13:13:41 +00:00
|
|
|
|
2018-03-30 21:05:28 +01:00
|
|
|
|
2018-03-30 21:05:38 +01:00
|
|
|
|
2022-10-21 13:39:34 +01:00
|
|
|
|
|
|
|
|
|
rxrpc, afs: Allow afs to pin rxrpc_peer objects
Change rxrpc's API such that:
(1) A new function, rxrpc_kernel_lookup_peer(), is provided to look up an
rxrpc_peer record for a remote address and a corresponding function,
rxrpc_kernel_put_peer(), is provided to dispose of it again.
(2) When setting up a call, the rxrpc_peer object used during a call is
now passed in rather than being set up by rxrpc_connect_call(). For
afs, this meenat passing it to rxrpc_kernel_begin_call() rather than
the full address (the service ID then has to be passed in as a
separate parameter).
(3) A new function, rxrpc_kernel_remote_addr(), is added so that afs can
get a pointer to the transport address for display purposed, and
another, rxrpc_kernel_remote_srx(), to gain a pointer to the full
rxrpc address.
(4) The function to retrieve the RTT from a call, rxrpc_kernel_get_srtt(),
is then altered to take a peer. This now returns the RTT or -1 if
there are insufficient samples.
(5) Rename rxrpc_kernel_get_peer() to rxrpc_kernel_call_get_peer().
(6) Provide a new function, rxrpc_kernel_get_peer(), to get a ref on a
peer the caller already has.
This allows the afs filesystem to pin the rxrpc_peer records that it is
using, allowing faster lookups and pointer comparisons rather than
comparing sockaddr_rxrpc contents. It also makes it easier to get hold of
the RTT. The following changes are made to afs:
(1) The addr_list struct's addrs[] elements now hold a peer struct pointer
and a service ID rather than a sockaddr_rxrpc.
(2) When displaying the transport address, rxrpc_kernel_remote_addr() is
used.
(3) The port arg is removed from afs_alloc_addrlist() since it's always
overridden.
(4) afs_merge_fs_addr4() and afs_merge_fs_addr6() do peer lookup and may
now return an error that must be handled.
(5) afs_find_server() now takes a peer pointer to specify the address.
(6) afs_find_server(), afs_compare_fs_alists() and afs_merge_fs_addr[46]{}
now do peer pointer comparison rather than address comparison.
Signed-off-by: David Howells <dhowells@redhat.com>
cc: Marc Dionne <marc.dionne@auristor.com>
cc: linux-afs@lists.infradead.org
2023-10-19 12:55:11 +01:00
|
|
|
|
2022-10-21 13:39:34 +01:00
|
|
|
|
rxrpc, afs: Allow afs to pin rxrpc_peer objects
Change rxrpc's API such that:
(1) A new function, rxrpc_kernel_lookup_peer(), is provided to look up an
rxrpc_peer record for a remote address and a corresponding function,
rxrpc_kernel_put_peer(), is provided to dispose of it again.
(2) When setting up a call, the rxrpc_peer object used during a call is
now passed in rather than being set up by rxrpc_connect_call(). For
afs, this meenat passing it to rxrpc_kernel_begin_call() rather than
the full address (the service ID then has to be passed in as a
separate parameter).
(3) A new function, rxrpc_kernel_remote_addr(), is added so that afs can
get a pointer to the transport address for display purposed, and
another, rxrpc_kernel_remote_srx(), to gain a pointer to the full
rxrpc address.
(4) The function to retrieve the RTT from a call, rxrpc_kernel_get_srtt(),
is then altered to take a peer. This now returns the RTT or -1 if
there are insufficient samples.
(5) Rename rxrpc_kernel_get_peer() to rxrpc_kernel_call_get_peer().
(6) Provide a new function, rxrpc_kernel_get_peer(), to get a ref on a
peer the caller already has.
This allows the afs filesystem to pin the rxrpc_peer records that it is
using, allowing faster lookups and pointer comparisons rather than
comparing sockaddr_rxrpc contents. It also makes it easier to get hold of
the RTT. The following changes are made to afs:
(1) The addr_list struct's addrs[] elements now hold a peer struct pointer
and a service ID rather than a sockaddr_rxrpc.
(2) When displaying the transport address, rxrpc_kernel_remote_addr() is
used.
(3) The port arg is removed from afs_alloc_addrlist() since it's always
overridden.
(4) afs_merge_fs_addr4() and afs_merge_fs_addr6() do peer lookup and may
now return an error that must be handled.
(5) afs_find_server() now takes a peer pointer to specify the address.
(6) afs_find_server(), afs_compare_fs_alists() and afs_merge_fs_addr[46]{}
now do peer pointer comparison rather than address comparison.
Signed-off-by: David Howells <dhowells@redhat.com>
cc: Marc Dionne <marc.dionne@auristor.com>
cc: linux-afs@lists.infradead.org
2023-10-19 12:55:11 +01:00
|
|
|
|
2022-10-21 13:39:34 +01:00
|
|
|
|
2020-01-23 13:13:41 +00:00
|
|
|
|
2022-10-21 13:39:34 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
rxrpc, afs: Allow afs to pin rxrpc_peer objects
Change rxrpc's API such that:
(1) A new function, rxrpc_kernel_lookup_peer(), is provided to look up an
rxrpc_peer record for a remote address and a corresponding function,
rxrpc_kernel_put_peer(), is provided to dispose of it again.
(2) When setting up a call, the rxrpc_peer object used during a call is
now passed in rather than being set up by rxrpc_connect_call(). For
afs, this meenat passing it to rxrpc_kernel_begin_call() rather than
the full address (the service ID then has to be passed in as a
separate parameter).
(3) A new function, rxrpc_kernel_remote_addr(), is added so that afs can
get a pointer to the transport address for display purposed, and
another, rxrpc_kernel_remote_srx(), to gain a pointer to the full
rxrpc address.
(4) The function to retrieve the RTT from a call, rxrpc_kernel_get_srtt(),
is then altered to take a peer. This now returns the RTT or -1 if
there are insufficient samples.
(5) Rename rxrpc_kernel_get_peer() to rxrpc_kernel_call_get_peer().
(6) Provide a new function, rxrpc_kernel_get_peer(), to get a ref on a
peer the caller already has.
This allows the afs filesystem to pin the rxrpc_peer records that it is
using, allowing faster lookups and pointer comparisons rather than
comparing sockaddr_rxrpc contents. It also makes it easier to get hold of
the RTT. The following changes are made to afs:
(1) The addr_list struct's addrs[] elements now hold a peer struct pointer
and a service ID rather than a sockaddr_rxrpc.
(2) When displaying the transport address, rxrpc_kernel_remote_addr() is
used.
(3) The port arg is removed from afs_alloc_addrlist() since it's always
overridden.
(4) afs_merge_fs_addr4() and afs_merge_fs_addr6() do peer lookup and may
now return an error that must be handled.
(5) afs_find_server() now takes a peer pointer to specify the address.
(6) afs_find_server(), afs_compare_fs_alists() and afs_merge_fs_addr[46]{}
now do peer pointer comparison rather than address comparison.
Signed-off-by: David Howells <dhowells@redhat.com>
cc: Marc Dionne <marc.dionne@auristor.com>
cc: linux-afs@lists.infradead.org
2023-10-19 12:55:11 +01:00
|
|
|
|
2022-10-21 13:39:34 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2020-01-23 13:13:41 +00:00
|
|
|
|
2022-10-21 13:39:34 +01:00
|
|
|
|
|
|
|
|
|
2018-03-30 21:05:38 +01:00
|
|
|
|
2022-11-02 21:54:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-21 09:30:23 +01:00
|
|
|
|
2022-11-02 21:54:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2022-10-21 14:06:16 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
2022-10-21 14:06:16 +01:00
|
|
|
|
|
|
|
|
|
2022-10-20 09:56:36 +01:00
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
2025-02-03 11:03:04 +00:00
|
|
|
|
2022-10-20 09:08:34 +01:00
|
|
|
|
2022-10-21 14:06:16 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
2022-10-21 14:06:16 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
2022-10-21 14:06:16 +01:00
|
|
|
|
2022-11-25 12:43:50 +00:00
|
|
|
|
2022-10-21 14:06:16 +01:00
|
|
|
|
|
|
|
|
|
2022-10-20 09:08:34 +01:00
|
|
|
|
2022-11-25 12:43:50 +00:00
|
|
|
|
2022-10-20 09:56:36 +01:00
|
|
|
|
2022-11-25 12:43:50 +00:00
|
|
|
|
2022-10-21 14:06:16 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-19 09:45:43 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
rxrpc: Rewrite the client connection manager
Rewrite the rxrpc client connection manager so that it can support multiple
connections for a given security key to a peer. The following changes are
made:
(1) For each open socket, the code currently maintains an rbtree with the
connections placed into it, keyed by communications parameters. This
is tricky to maintain as connections can be culled from the tree or
replaced within it. Connections can require replacement for a number
of reasons, e.g. their IDs span too great a range for the IDR data
type to represent efficiently, the call ID numbers on that conn would
overflow or the conn got aborted.
This is changed so that there's now a connection bundle object placed
in the tree, keyed on the same parameters. The bundle, however, does
not need to be replaced.
(2) An rxrpc_bundle object can now manage the available channels for a set
of parallel connections. The lock that manages this is moved there
from the rxrpc_connection struct (channel_lock).
(3) There'a a dummy bundle for all incoming connections to share so that
they have a channel_lock too. It might be better to give each
incoming connection its own bundle. This bundle is not needed to
manage which channels incoming calls are made on because that's the
solely at whim of the client.
(4) The restrictions on how many client connections are around are
removed. Instead, a previous patch limits the number of client calls
that can be allocated. Ordinarily, client connections are reaped
after 2 minutes on the idle queue, but when more than a certain number
of connections are in existence, the reaper starts reaping them after
2s of idleness instead to get the numbers back down.
It could also be made such that new call allocations are forced to
wait until the number of outstanding connections subsides.
Signed-off-by: David Howells <dhowells@redhat.com>
2020-07-01 11:15:32 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
2022-11-02 10:24:29 +00:00
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-10 15:51:39 +01:00
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-20 21:58:36 +01:00
|
|
|
|
2022-11-02 10:24:29 +00:00
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
|
|
|
|
|
2022-10-10 15:51:39 +01:00
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
2026-01-14 22:03:23 +00:00
|
|
|
|
rxrpc: Fix notification vs call-release vs recvmsg
When a call is released, rxrpc takes the spinlock and removes it from
->recvmsg_q in an effort to prevent racing recvmsg() invocations from
seeing the same call. Now, rxrpc_recvmsg() only takes the spinlock when
actually removing a call from the queue; it doesn't, however, take it in
the lead up to that when it checks to see if the queue is empty. It *does*
hold the socket lock, which prevents a recvmsg/recvmsg race - but this
doesn't prevent sendmsg from ending the call because sendmsg() drops the
socket lock and relies on the call->user_mutex.
Fix this by firstly removing the bit in rxrpc_release_call() that dequeues
the released call and, instead, rely on recvmsg() to simply discard
released calls (done in a preceding fix).
Secondly, rxrpc_notify_socket() is abandoned if the call is already marked
as released rather than trying to be clever by setting both pointers in
call->recvmsg_link to NULL to trick list_empty(). This isn't perfect and
can still race, resulting in a released call on the queue, but recvmsg()
will now clean that up.
Fixes: 17926a79320a ("[AF_RXRPC]: Provide secure RxRPC sockets for use by userspace and kernel both")
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: Jeffrey Altman <jaltman@auristor.com>
cc: Marc Dionne <marc.dionne@auristor.com>
cc: Junvyyang, Tencent Zhuque Lab <zhuque@tencent.com>
cc: LePremierHomme <kwqcheii@proton.me>
cc: Simon Horman <horms@kernel.org>
cc: linux-afs@lists.infradead.org
Link: https://patch.msgid.link/20250717074350.3767366-4-dhowells@redhat.com
Signed-off-by: Jakub Kicinski <kuba@kernel.org>
2025-07-17 08:43:43 +01:00
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-19 09:45:43 +01:00
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
|
|
|
|
|
rxrpc: Fix recv-recv race of completed call
If a call receives an event (such as incoming data), the call gets placed
on the socket's queue and a thread in recvmsg can be awakened to go and
process it. Once the thread has picked up the call off of the queue,
further events will cause it to be requeued, and once the socket lock is
dropped (recvmsg uses call->user_mutex to allow the socket to be used in
parallel), a second thread can come in and its recvmsg can pop the call off
the socket queue again.
In such a case, the first thread will be receiving stuff from the call and
the second thread will be blocked on call->user_mutex. The first thread
can, at this point, process both the event that it picked call for and the
event that the second thread picked the call for and may see the call
terminate - in which case the call will be "released", decoupling the call
from the user call ID assigned to it (RXRPC_USER_CALL_ID in the control
message).
The first thread will return okay, but then the second thread will wake up
holding the user_mutex and, if it sees that the call has been released by
the first thread, it will BUG thusly:
kernel BUG at net/rxrpc/recvmsg.c:474!
Fix this by just dequeuing the call and ignoring it if it is seen to be
already released. We can't tell userspace about it anyway as the user call
ID has become stale.
Fixes: 248f219cb8bc ("rxrpc: Rewrite the data and ack handling code")
Reported-by: Junvyyang, Tencent Zhuque Lab <zhuque@tencent.com>
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: Jeffrey Altman <jaltman@auristor.com>
cc: LePremierHomme <kwqcheii@proton.me>
cc: Marc Dionne <marc.dionne@auristor.com>
cc: Simon Horman <horms@kernel.org>
cc: linux-afs@lists.infradead.org
Link: https://patch.msgid.link/20250717074350.3767366-3-dhowells@redhat.com
Signed-off-by: Jakub Kicinski <kuba@kernel.org>
2025-07-17 08:43:42 +01:00
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:30 +00:00
|
|
|
|
rxrpc: Fix recv-recv race of completed call
If a call receives an event (such as incoming data), the call gets placed
on the socket's queue and a thread in recvmsg can be awakened to go and
process it. Once the thread has picked up the call off of the queue,
further events will cause it to be requeued, and once the socket lock is
dropped (recvmsg uses call->user_mutex to allow the socket to be used in
parallel), a second thread can come in and its recvmsg can pop the call off
the socket queue again.
In such a case, the first thread will be receiving stuff from the call and
the second thread will be blocked on call->user_mutex. The first thread
can, at this point, process both the event that it picked call for and the
event that the second thread picked the call for and may see the call
terminate - in which case the call will be "released", decoupling the call
from the user call ID assigned to it (RXRPC_USER_CALL_ID in the control
message).
The first thread will return okay, but then the second thread will wake up
holding the user_mutex and, if it sees that the call has been released by
the first thread, it will BUG thusly:
kernel BUG at net/rxrpc/recvmsg.c:474!
Fix this by just dequeuing the call and ignoring it if it is seen to be
already released. We can't tell userspace about it anyway as the user call
ID has become stale.
Fixes: 248f219cb8bc ("rxrpc: Rewrite the data and ack handling code")
Reported-by: Junvyyang, Tencent Zhuque Lab <zhuque@tencent.com>
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: Jeffrey Altman <jaltman@auristor.com>
cc: LePremierHomme <kwqcheii@proton.me>
cc: Marc Dionne <marc.dionne@auristor.com>
cc: Simon Horman <horms@kernel.org>
cc: linux-afs@lists.infradead.org
Link: https://patch.msgid.link/20250717074350.3767366-3-dhowells@redhat.com
Signed-off-by: Jakub Kicinski <kuba@kernel.org>
2025-07-17 08:43:42 +01:00
|
|
|
|
2022-11-02 10:24:29 +00:00
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
|
|
|
|
|
rxrpc: Fix notification vs call-release vs recvmsg
When a call is released, rxrpc takes the spinlock and removes it from
->recvmsg_q in an effort to prevent racing recvmsg() invocations from
seeing the same call. Now, rxrpc_recvmsg() only takes the spinlock when
actually removing a call from the queue; it doesn't, however, take it in
the lead up to that when it checks to see if the queue is empty. It *does*
hold the socket lock, which prevents a recvmsg/recvmsg race - but this
doesn't prevent sendmsg from ending the call because sendmsg() drops the
socket lock and relies on the call->user_mutex.
Fix this by firstly removing the bit in rxrpc_release_call() that dequeues
the released call and, instead, rely on recvmsg() to simply discard
released calls (done in a preceding fix).
Secondly, rxrpc_notify_socket() is abandoned if the call is already marked
as released rather than trying to be clever by setting both pointers in
call->recvmsg_link to NULL to trick list_empty(). This isn't perfect and
can still race, resulting in a released call on the queue, but recvmsg()
will now clean that up.
Fixes: 17926a79320a ("[AF_RXRPC]: Provide secure RxRPC sockets for use by userspace and kernel both")
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: Jeffrey Altman <jaltman@auristor.com>
cc: Marc Dionne <marc.dionne@auristor.com>
cc: Junvyyang, Tencent Zhuque Lab <zhuque@tencent.com>
cc: LePremierHomme <kwqcheii@proton.me>
cc: Simon Horman <horms@kernel.org>
cc: linux-afs@lists.infradead.org
Link: https://patch.msgid.link/20250717074350.3767366-4-dhowells@redhat.com
Signed-off-by: Jakub Kicinski <kuba@kernel.org>
2025-07-17 08:43:43 +01:00
|
|
|
|
rxrpc: Fix recv-recv race of completed call
If a call receives an event (such as incoming data), the call gets placed
on the socket's queue and a thread in recvmsg can be awakened to go and
process it. Once the thread has picked up the call off of the queue,
further events will cause it to be requeued, and once the socket lock is
dropped (recvmsg uses call->user_mutex to allow the socket to be used in
parallel), a second thread can come in and its recvmsg can pop the call off
the socket queue again.
In such a case, the first thread will be receiving stuff from the call and
the second thread will be blocked on call->user_mutex. The first thread
can, at this point, process both the event that it picked call for and the
event that the second thread picked the call for and may see the call
terminate - in which case the call will be "released", decoupling the call
from the user call ID assigned to it (RXRPC_USER_CALL_ID in the control
message).
The first thread will return okay, but then the second thread will wake up
holding the user_mutex and, if it sees that the call has been released by
the first thread, it will BUG thusly:
kernel BUG at net/rxrpc/recvmsg.c:474!
Fix this by just dequeuing the call and ignoring it if it is seen to be
already released. We can't tell userspace about it anyway as the user call
ID has become stale.
Fixes: 248f219cb8bc ("rxrpc: Rewrite the data and ack handling code")
Reported-by: Junvyyang, Tencent Zhuque Lab <zhuque@tencent.com>
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: Jeffrey Altman <jaltman@auristor.com>
cc: LePremierHomme <kwqcheii@proton.me>
cc: Marc Dionne <marc.dionne@auristor.com>
cc: Simon Horman <horms@kernel.org>
cc: linux-afs@lists.infradead.org
Link: https://patch.msgid.link/20250717074350.3767366-3-dhowells@redhat.com
Signed-off-by: Jakub Kicinski <kuba@kernel.org>
2025-07-17 08:43:42 +01:00
|
|
|
|
2026-01-14 22:03:23 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
|
|
|
|
|
2024-11-06 13:03:22 +00:00
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2022-03-31 23:55:08 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2024-12-04 07:47:03 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:03 +00:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-08-27 14:27:56 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
rxrpc: Fix deadlock between call creation and sendmsg/recvmsg
All the routines by which rxrpc is accessed from the outside are serialised
by means of the socket lock (sendmsg, recvmsg, bind,
rxrpc_kernel_begin_call(), ...) and this presents a problem:
(1) If a number of calls on the same socket are in the process of
connection to the same peer, a maximum of four concurrent live calls
are permitted before further calls need to wait for a slot.
(2) If a call is waiting for a slot, it is deep inside sendmsg() or
rxrpc_kernel_begin_call() and the entry function is holding the socket
lock.
(3) sendmsg() and recvmsg() or the in-kernel equivalents are prevented
from servicing the other calls as they need to take the socket lock to
do so.
(4) The socket is stuck until a call is aborted and makes its slot
available to the waiter.
Fix this by:
(1) Provide each call with a mutex ('user_mutex') that arbitrates access
by the users of rxrpc separately for each specific call.
(2) Make rxrpc_sendmsg() and rxrpc_recvmsg() unlock the socket as soon as
they've got a call and taken its mutex.
Note that I'm returning EWOULDBLOCK from recvmsg() if MSG_DONTWAIT is
set but someone else has the lock. Should I instead only return
EWOULDBLOCK if there's nothing currently to be done on a socket, and
sleep in this particular instance because there is something to be
done, but we appear to be blocked by the interrupt handler doing its
ping?
(3) Make rxrpc_new_client_call() unlock the socket after allocating a new
call, locking its user mutex and adding it to the socket's call tree.
The call is returned locked so that sendmsg() can add data to it
immediately.
From the moment the call is in the socket tree, it is subject to
access by sendmsg() and recvmsg() - even if it isn't connected yet.
(4) Lock new service calls in the UDP data_ready handler (in
rxrpc_new_incoming_call()) because they may already be in the socket's
tree and the data_ready handler makes them live immediately if a user
ID has already been preassigned.
Note that the new call is locked before any notifications are sent
that it is live, so doing mutex_trylock() *ought* to always succeed.
Userspace is prevented from doing sendmsg() on calls that are in a
too-early state in rxrpc_do_sendmsg().
(5) Make rxrpc_new_incoming_call() return the call with the user mutex
held so that a ping can be scheduled immediately under it.
Note that it might be worth moving the ping call into
rxrpc_new_incoming_call() and then we can drop the mutex there.
(6) Make rxrpc_accept_call() take the lock on the call it is accepting and
release the socket after adding the call to the socket's tree. This
is slightly tricky as we've dequeued the call by that point and have
to requeue it.
Note that requeuing emits a trace event.
(7) Make rxrpc_kernel_send_data() and rxrpc_kernel_recv_data() take the
new mutex immediately and don't bother with the socket mutex at all.
This patch has the nice bonus that calls on the same socket are now to some
extent parallelisable.
Note that we might want to move rxrpc_service_prealloc() calls out from the
socket lock and give it its own lock, so that we don't hang progress in
other calls because we're waiting for the allocator.
We probably also want to avoid calling rxrpc_notify_socket() from within
the socket lock (rxrpc_accept_call()).
Signed-off-by: David Howells <dhowells@redhat.com>
Tested-by: Marc Dionne <marc.c.dionne@auristor.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-02-27 15:43:06 +00:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-02-15 21:48:05 +00:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
rxrpc: Fix loss of RTT samples due to interposed ACK
The Rx protocol has a mechanism to help generate RTT samples that works by
a client transmitting a REQUESTED-type ACK when it receives a DATA packet
that has the REQUEST_ACK flag set.
The peer, however, may interpose other ACKs before transmitting the
REQUESTED-ACK, as can be seen in the following trace excerpt:
rxrpc_tx_data: c=00000044 DATA d0b5ece8:00000001 00000001 q=00000001 fl=07
rxrpc_rx_ack: c=00000044 00000001 PNG r=00000000 f=00000002 p=00000000 n=0
rxrpc_rx_ack: c=00000044 00000002 REQ r=00000001 f=00000002 p=00000001 n=0
...
DATA packet 1 (q=xx) has REQUEST_ACK set (bit 1 of fl=xx). The incoming
ping (labelled PNG) hard-acks the request DATA packet (f=xx exceeds the
sequence number of the DATA packet), causing it to be discarded from the Tx
ring. The ACK that was requested (labelled REQ, r=xx references the serial
of the DATA packet) comes after the ping, but the sk_buff holding the
timestamp has gone and the RTT sample is lost.
This is particularly noticeable on RPC calls used to probe the service
offered by the peer. A lot of peers end up with an unknown RTT because we
only ever sent a single RPC. This confuses the server rotation algorithm.
Fix this by caching the information about the outgoing packet in RTT
calculations in the rxrpc_call struct rather than looking in the Tx ring.
A four-deep buffer is maintained and both REQUEST_ACK-flagged DATA and
PING-ACK transmissions are recorded in there. When the appropriate
response ACK is received, the buffer is checked for a match and, if found,
an RTT sample is recorded.
If a received ACK refers to a packet with a later serial number than an
entry in the cache, that entry is presumed lost and the entry is made
available to record a new transmission.
ACKs types other than REQUESTED-type and PING-type cause any matching
sample to be cancelled as they don't necessarily represent a useful
measurement.
If there's no space in the buffer on ping/data transmission, the sample
base is discarded.
Fixes: 50235c4b5a2f ("rxrpc: Obtain RTT data by requesting ACKs on DATA packets")
Signed-off-by: David Howells <dhowells@redhat.com>
2020-08-19 23:29:16 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
rxrpc: Fix loss of RTT samples due to interposed ACK
The Rx protocol has a mechanism to help generate RTT samples that works by
a client transmitting a REQUESTED-type ACK when it receives a DATA packet
that has the REQUEST_ACK flag set.
The peer, however, may interpose other ACKs before transmitting the
REQUESTED-ACK, as can be seen in the following trace excerpt:
rxrpc_tx_data: c=00000044 DATA d0b5ece8:00000001 00000001 q=00000001 fl=07
rxrpc_rx_ack: c=00000044 00000001 PNG r=00000000 f=00000002 p=00000000 n=0
rxrpc_rx_ack: c=00000044 00000002 REQ r=00000001 f=00000002 p=00000001 n=0
...
DATA packet 1 (q=xx) has REQUEST_ACK set (bit 1 of fl=xx). The incoming
ping (labelled PNG) hard-acks the request DATA packet (f=xx exceeds the
sequence number of the DATA packet), causing it to be discarded from the Tx
ring. The ACK that was requested (labelled REQ, r=xx references the serial
of the DATA packet) comes after the ping, but the sk_buff holding the
timestamp has gone and the RTT sample is lost.
This is particularly noticeable on RPC calls used to probe the service
offered by the peer. A lot of peers end up with an unknown RTT because we
only ever sent a single RPC. This confuses the server rotation algorithm.
Fix this by caching the information about the outgoing packet in RTT
calculations in the rxrpc_call struct rather than looking in the Tx ring.
A four-deep buffer is maintained and both REQUEST_ACK-flagged DATA and
PING-ACK transmissions are recorded in there. When the appropriate
response ACK is received, the buffer is checked for a match and, if found,
an RTT sample is recorded.
If a received ACK refers to a packet with a later serial number than an
entry in the cache, that entry is presumed lost and the entry is made
available to record a new transmission.
ACKs types other than REQUESTED-type and PING-type cause any matching
sample to be cancelled as they don't necessarily represent a useful
measurement.
If there's no space in the buffer on ping/data transmission, the sample
base is discarded.
Fixes: 50235c4b5a2f ("rxrpc: Obtain RTT data by requesting ACKs on DATA packets")
Signed-off-by: David Howells <dhowells@redhat.com>
2020-08-19 23:29:16 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:52 +00:00
|
|
|
|
rxrpc: Fix loss of RTT samples due to interposed ACK
The Rx protocol has a mechanism to help generate RTT samples that works by
a client transmitting a REQUESTED-type ACK when it receives a DATA packet
that has the REQUEST_ACK flag set.
The peer, however, may interpose other ACKs before transmitting the
REQUESTED-ACK, as can be seen in the following trace excerpt:
rxrpc_tx_data: c=00000044 DATA d0b5ece8:00000001 00000001 q=00000001 fl=07
rxrpc_rx_ack: c=00000044 00000001 PNG r=00000000 f=00000002 p=00000000 n=0
rxrpc_rx_ack: c=00000044 00000002 REQ r=00000001 f=00000002 p=00000001 n=0
...
DATA packet 1 (q=xx) has REQUEST_ACK set (bit 1 of fl=xx). The incoming
ping (labelled PNG) hard-acks the request DATA packet (f=xx exceeds the
sequence number of the DATA packet), causing it to be discarded from the Tx
ring. The ACK that was requested (labelled REQ, r=xx references the serial
of the DATA packet) comes after the ping, but the sk_buff holding the
timestamp has gone and the RTT sample is lost.
This is particularly noticeable on RPC calls used to probe the service
offered by the peer. A lot of peers end up with an unknown RTT because we
only ever sent a single RPC. This confuses the server rotation algorithm.
Fix this by caching the information about the outgoing packet in RTT
calculations in the rxrpc_call struct rather than looking in the Tx ring.
A four-deep buffer is maintained and both REQUEST_ACK-flagged DATA and
PING-ACK transmissions are recorded in there. When the appropriate
response ACK is received, the buffer is checked for a match and, if found,
an RTT sample is recorded.
If a received ACK refers to a packet with a later serial number than an
entry in the cache, that entry is presumed lost and the entry is made
available to record a new transmission.
ACKs types other than REQUESTED-type and PING-type cause any matching
sample to be cancelled as they don't necessarily represent a useful
measurement.
If there's no space in the buffer on ping/data transmission, the sample
base is discarded.
Fixes: 50235c4b5a2f ("rxrpc: Obtain RTT data by requesting ACKs on DATA packets")
Signed-off-by: David Howells <dhowells@redhat.com>
2020-08-19 23:29:16 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:52 +00:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
2024-01-30 21:37:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-01-30 20:30:03 +00:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2020-01-30 21:48:14 +00:00
|
|
|
|
2017-11-24 10:18:42 +00:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
2024-01-30 20:30:03 +00:00
|
|
|
|
2024-12-04 07:46:37 +00:00
|
|
|
|
2022-10-17 10:55:41 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2022-10-17 10:55:41 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:04 +00:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
2020-01-23 13:13:41 +00:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:50 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2020-06-17 22:50:33 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2022-10-03 18:49:11 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-16 08:01:32 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:08:20 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:53 +01:00
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
2025-04-11 10:52:49 +01:00
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
|
|
|
|
|
2018-05-10 23:26:01 +01:00
|
|
|
|
2022-04-05 21:48:48 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:35 +00:00
|
|
|
|
2022-04-05 21:48:48 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-08-18 11:52:36 +01:00
|
|
|
|
2022-04-05 21:48:48 +01:00
|
|
|
|
2022-04-05 21:16:32 +01:00
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:53 +01:00
|
|
|
|
2022-04-05 21:16:32 +01:00
|
|
|
|
2022-03-31 23:55:08 +01:00
|
|
|
|
2022-04-05 21:16:32 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2020-01-30 21:48:13 +00:00
|
|
|
|
2022-04-05 21:16:32 +01:00
|
|
|
|
2025-04-11 10:52:53 +01:00
|
|
|
|
2022-04-05 21:16:32 +01:00
|
|
|
|
2022-03-31 23:55:08 +01:00
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
2022-11-25 09:00:55 +00:00
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
2022-04-05 21:16:32 +01:00
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:37 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:51 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-05-21 08:45:35 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-06 21:45:42 +01:00
|
|
|
|
2022-11-02 21:54:46 +00:00
|
|
|
|
2022-10-10 15:51:39 +01:00
|
|
|
|
2022-05-21 08:45:35 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:37 +00:00
|
|
|
|
2022-05-21 08:45:35 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-04-05 21:48:48 +01:00
|
|
|
|
2024-12-04 07:46:51 +00:00
|
|
|
|
2022-05-21 08:45:35 +01:00
|
|
|
|
|
|
|
|
|
2022-10-16 08:01:32 +01:00
|
|
|
|
2022-05-21 08:45:35 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
2022-05-21 08:45:35 +01:00
|
|
|
|
2022-04-05 21:16:32 +01:00
|
|
|
|
2024-12-04 07:47:03 +00:00
|
|
|
|
2022-03-31 23:55:08 +01:00
|
|
|
|
2022-05-21 08:45:35 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-06 21:45:42 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-06 21:45:42 +01:00
|
|
|
|
2022-11-02 21:54:46 +00:00
|
|
|
|
2024-12-04 07:46:50 +00:00
|
|
|
|
2022-10-10 15:51:39 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2022-05-21 08:45:35 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:37 +00:00
|
|
|
|
2022-05-21 08:45:35 +01:00
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
2022-04-05 21:48:48 +01:00
|
|
|
|
2024-12-04 07:46:51 +00:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2022-05-21 08:45:35 +01:00
|
|
|
|
2022-10-16 08:01:32 +01:00
|
|
|
|
2022-05-21 08:45:35 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
2022-04-05 21:16:32 +01:00
|
|
|
|
2024-12-04 07:47:03 +00:00
|
|
|
|
2022-03-31 23:55:08 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-30 21:05:28 +01:00
|
|
|
|
2019-08-13 22:26:36 +01:00
|
|
|
|
2022-10-21 13:00:34 +01:00
|
|
|
|
2018-03-30 21:05:28 +01:00
|
|
|
|
2022-10-21 13:00:34 +01:00
|
|
|
|
2018-03-30 21:05:28 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-30 21:05:28 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2019-08-13 22:26:36 +01:00
|
|
|
|
2018-03-30 21:05:28 +01:00
|
|
|
|
2022-10-21 13:00:34 +01:00
|
|
|
|
2018-03-30 21:05:28 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-21 13:00:34 +01:00
|
|
|
|
2018-03-30 21:05:28 +01:00
|
|
|
|
|
|
|
|
|
2022-10-21 13:00:34 +01:00
|
|
|
|
|
|
|
|
|
2018-03-30 21:05:28 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-30 21:05:38 +01:00
|
|
|
|
2022-10-21 13:39:34 +01:00
|
|
|
|
2018-03-30 21:05:38 +01:00
|
|
|
|
2022-10-21 13:39:34 +01:00
|
|
|
|
2018-03-30 21:05:38 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-30 21:05:38 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2019-10-07 10:58:29 +01:00
|
|
|
|
2022-10-21 13:39:34 +01:00
|
|
|
|
|
|
|
|
|
2018-03-30 21:05:38 +01:00
|
|
|
|
|
|
|
|
|
2022-10-21 13:39:34 +01:00
|
|
|
|
2018-03-30 21:05:38 +01:00
|
|
|
|
2022-10-21 13:39:34 +01:00
|
|
|
|
|
|
|
|
|
2018-03-30 21:05:38 +01:00
|
|
|
|
|
|
|
|
|
2022-11-02 21:54:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-11-02 21:54:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:14 +01:00
|
|
|
|
2022-10-21 14:06:16 +01:00
|
|
|
|
2016-09-17 10:49:14 +01:00
|
|
|
|
2022-10-21 14:06:16 +01:00
|
|
|
|
2016-09-17 10:49:14 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:14 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2019-10-07 10:58:29 +01:00
|
|
|
|
2022-10-21 14:06:16 +01:00
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:14 +01:00
|
|
|
|
|
|
|
|
|
2022-10-21 14:06:16 +01:00
|
|
|
|
2016-09-17 10:49:14 +01:00
|
|
|
|
2022-10-21 14:06:16 +01:00
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:14 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:14 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
rxrpc: Rewrite the client connection manager
Rewrite the rxrpc client connection manager so that it can support multiple
connections for a given security key to a peer. The following changes are
made:
(1) For each open socket, the code currently maintains an rbtree with the
connections placed into it, keyed by communications parameters. This
is tricky to maintain as connections can be culled from the tree or
replaced within it. Connections can require replacement for a number
of reasons, e.g. their IDs span too great a range for the IDR data
type to represent efficiently, the call ID numbers on that conn would
overflow or the conn got aborted.
This is changed so that there's now a connection bundle object placed
in the tree, keyed on the same parameters. The bundle, however, does
not need to be replaced.
(2) An rxrpc_bundle object can now manage the available channels for a set
of parallel connections. The lock that manages this is moved there
from the rxrpc_connection struct (channel_lock).
(3) There'a a dummy bundle for all incoming connections to share so that
they have a channel_lock too. It might be better to give each
incoming connection its own bundle. This bundle is not needed to
manage which channels incoming calls are made on because that's the
solely at whim of the client.
(4) The restrictions on how many client connections are around are
removed. Instead, a previous patch limits the number of client calls
that can be allocated. Ordinarily, client connections are reaped
after 2 minutes on the idle queue, but when more than a certain number
of connections are in existence, the reaper starts reaping them after
2s of idleness instead to get the numbers back down.
It could also be made such that new call allocations are forced to
wait until the number of outstanding connections subsides.
Signed-off-by: David Howells <dhowells@redhat.com>
2020-07-01 11:15:32 +01:00
|
|
|
|
2016-09-17 10:49:14 +01:00
|
|
|
|
2022-05-21 08:45:22 +01:00
|
|
|
|
2016-09-17 10:49:14 +01:00
|
|
|
|
2020-09-14 13:02:58 +01:00
|
|
|
|
2016-09-17 10:49:14 +01:00
|
|
|
|
|
|
|
|
|
rxrpc: Rewrite the client connection manager
Rewrite the rxrpc client connection manager so that it can support multiple
connections for a given security key to a peer. The following changes are
made:
(1) For each open socket, the code currently maintains an rbtree with the
connections placed into it, keyed by communications parameters. This
is tricky to maintain as connections can be culled from the tree or
replaced within it. Connections can require replacement for a number
of reasons, e.g. their IDs span too great a range for the IDR data
type to represent efficiently, the call ID numbers on that conn would
overflow or the conn got aborted.
This is changed so that there's now a connection bundle object placed
in the tree, keyed on the same parameters. The bundle, however, does
not need to be replaced.
(2) An rxrpc_bundle object can now manage the available channels for a set
of parallel connections. The lock that manages this is moved there
from the rxrpc_connection struct (channel_lock).
(3) There'a a dummy bundle for all incoming connections to share so that
they have a channel_lock too. It might be better to give each
incoming connection its own bundle. This bundle is not needed to
manage which channels incoming calls are made on because that's the
solely at whim of the client.
(4) The restrictions on how many client connections are around are
removed. Instead, a previous patch limits the number of client calls
that can be allocated. Ordinarily, client connections are reaped
after 2 minutes on the idle queue, but when more than a certain number
of connections are in existence, the reaper starts reaping them after
2s of idleness instead to get the numbers back down.
It could also be made such that new call allocations are forced to
wait until the number of outstanding connections subsides.
Signed-off-by: David Howells <dhowells@redhat.com>
2020-07-01 11:15:32 +01:00
|
|
|
|
2016-09-17 10:49:14 +01:00
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2016-09-17 10:49:14 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-08-30 09:49:29 +01:00
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
|
|
|
|
|
2016-08-30 09:49:29 +01:00
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
2016-08-30 09:49:29 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-08-30 09:49:29 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2019-10-07 10:58:29 +01:00
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
|
|
|
|
|
2016-08-30 09:49:29 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
2016-08-30 09:49:29 +01:00
|
|
|
|
2022-10-21 14:39:26 +01:00
|
|
|
|
|
|
|
|
|
2016-08-30 09:49:29 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-08-23 15:27:24 +01:00
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
|
|
|
|
|
2016-08-23 15:27:24 +01:00
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
2016-08-23 15:27:24 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-08-23 15:27:24 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
2016-08-23 15:27:24 +01:00
|
|
|
|
|
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
2016-08-23 15:27:24 +01:00
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
2016-08-23 15:27:24 +01:00
|
|
|
|
2022-10-21 15:31:21 +01:00
|
|
|
|
2016-08-23 15:27:24 +01:00
|
|
|
|
|
|
|
|
|
2016-09-08 11:10:12 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
2016-09-08 11:10:12 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
2016-09-08 11:10:12 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-12-05 17:38:31 +00:00
|
|
|
|
|
|
|
|
|
2016-09-08 11:10:12 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
2016-09-08 11:10:12 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-11-06 13:00:45 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-06 22:19:51 +01:00
|
|
|
|
2022-10-06 21:45:42 +01:00
|
|
|
|
|
|
|
|
|
2016-09-06 22:19:51 +01:00
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2016-09-06 22:19:51 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-06 22:19:51 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2022-10-06 21:45:42 +01:00
|
|
|
|
2016-09-06 22:19:51 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
|
|
|
|
|
2016-09-06 22:19:51 +01:00
|
|
|
|
2022-10-06 21:45:42 +01:00
|
|
|
|
|
|
|
|
|
2016-09-06 22:19:51 +01:00
|
|
|
|
|
|
|
|
|
2018-03-27 23:08:20 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:08:20 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-03-31 23:55:08 +01:00
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
2022-03-31 23:55:08 +01:00
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
2022-03-31 23:55:08 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:40 +00:00
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
2024-12-04 07:46:40 +00:00
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
2024-12-04 07:46:40 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
2024-12-04 07:46:40 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
2024-12-04 07:46:47 +00:00
|
|
|
|
2024-12-04 07:46:40 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
2022-10-07 17:44:39 +01:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
2022-10-07 17:44:39 +01:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-07 17:44:39 +01:00
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-07 17:44:39 +01:00
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:56 +00:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:56 +00:00
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:56 +00:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
2024-12-04 07:46:56 +00:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-04-06 10:12:00 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-04-06 10:12:00 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2017-04-06 10:12:00 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2017-04-06 10:12:00 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:30 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:58 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-20 11:51:06 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:58 +01:00
|
|
|
|
2025-04-11 10:52:53 +01:00
|
|
|
|
2022-10-20 11:51:06 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:58 +01:00
|
|
|
|
2025-04-11 10:52:53 +01:00
|
|
|
|
2022-10-20 11:51:06 +01:00
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:58 +01:00
|
|
|
|
2022-10-20 11:51:06 +01:00
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:58 +01:00
|
|
|
|
2025-04-11 10:52:53 +01:00
|
|
|
|
2022-10-20 11:51:06 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:58 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-20 11:51:06 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:53 +01:00
|
|
|
|
2022-10-20 11:51:06 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:53 +01:00
|
|
|
|
2022-10-20 11:51:06 +01:00
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:53 +01:00
|
|
|
|
2022-10-20 11:51:06 +01:00
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:53 +01:00
|
|
|
|
2022-10-20 11:51:06 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-04-06 10:12:00 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-04-06 10:12:00 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2017-04-06 10:12:00 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2017-04-06 10:12:00 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-10-08 19:44:39 +01:00
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:03 +00:00
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
2024-12-04 07:47:03 +00:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-01-29 15:01:10 +00:00
|
|
|
|
2024-12-04 07:47:03 +00:00
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
|
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:03 +00:00
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:03 +00:00
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
|
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
|
|
|
|
|
2024-01-29 15:01:10 +00:00
|
|
|
|
2024-12-04 07:47:03 +00:00
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
2024-12-04 07:47:04 +00:00
|
|
|
|
|
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
2024-12-04 07:47:04 +00:00
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 15:31:49 +00:00
|
|
|
|
2024-12-04 07:47:04 +00:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 15:31:49 +00:00
|
|
|
|
2024-12-04 07:47:04 +00:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:04 +00:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 15:31:49 +00:00
|
|
|
|
2024-12-04 07:47:04 +00:00
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-17 11:44:22 +01:00
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-17 11:44:22 +01:00
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
2022-10-17 11:44:22 +01:00
|
|
|
|
|
|
|
|
|
2016-09-17 10:49:13 +01:00
|
|
|
|
|
|
|
|
|
2016-09-17 11:13:31 +01:00
|
|
|
|
2022-12-24 14:49:00 +00:00
|
|
|
|
2022-10-07 17:22:40 +01:00
|
|
|
|
|
|
|
|
|
2022-12-24 14:49:00 +00:00
|
|
|
|
2022-10-07 17:22:40 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-07 17:22:40 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-12-24 14:49:00 +00:00
|
|
|
|
2022-10-07 17:22:40 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-17 11:13:31 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-17 11:13:31 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2019-10-03 17:44:44 +01:00
|
|
|
|
2016-09-17 11:13:31 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2016-09-17 11:13:31 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2016-09-17 11:13:31 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
|
|
|
|
|
rxrpc: Fix loss of RTT samples due to interposed ACK
The Rx protocol has a mechanism to help generate RTT samples that works by
a client transmitting a REQUESTED-type ACK when it receives a DATA packet
that has the REQUEST_ACK flag set.
The peer, however, may interpose other ACKs before transmitting the
REQUESTED-ACK, as can be seen in the following trace excerpt:
rxrpc_tx_data: c=00000044 DATA d0b5ece8:00000001 00000001 q=00000001 fl=07
rxrpc_rx_ack: c=00000044 00000001 PNG r=00000000 f=00000002 p=00000000 n=0
rxrpc_rx_ack: c=00000044 00000002 REQ r=00000001 f=00000002 p=00000001 n=0
...
DATA packet 1 (q=xx) has REQUEST_ACK set (bit 1 of fl=xx). The incoming
ping (labelled PNG) hard-acks the request DATA packet (f=xx exceeds the
sequence number of the DATA packet), causing it to be discarded from the Tx
ring. The ACK that was requested (labelled REQ, r=xx references the serial
of the DATA packet) comes after the ping, but the sk_buff holding the
timestamp has gone and the RTT sample is lost.
This is particularly noticeable on RPC calls used to probe the service
offered by the peer. A lot of peers end up with an unknown RTT because we
only ever sent a single RPC. This confuses the server rotation algorithm.
Fix this by caching the information about the outgoing packet in RTT
calculations in the rxrpc_call struct rather than looking in the Tx ring.
A four-deep buffer is maintained and both REQUEST_ACK-flagged DATA and
PING-ACK transmissions are recorded in there. When the appropriate
response ACK is received, the buffer is checked for a match and, if found,
an RTT sample is recorded.
If a received ACK refers to a packet with a later serial number than an
entry in the cache, that entry is presumed lost and the entry is made
available to record a new transmission.
ACKs types other than REQUESTED-type and PING-type cause any matching
sample to be cancelled as they don't necessarily represent a useful
measurement.
If there's no space in the buffer on ping/data transmission, the sample
base is discarded.
Fixes: 50235c4b5a2f ("rxrpc: Obtain RTT data by requesting ACKs on DATA packets")
Signed-off-by: David Howells <dhowells@redhat.com>
2020-08-19 23:29:16 +01:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
rxrpc: Fix loss of RTT samples due to interposed ACK
The Rx protocol has a mechanism to help generate RTT samples that works by
a client transmitting a REQUESTED-type ACK when it receives a DATA packet
that has the REQUEST_ACK flag set.
The peer, however, may interpose other ACKs before transmitting the
REQUESTED-ACK, as can be seen in the following trace excerpt:
rxrpc_tx_data: c=00000044 DATA d0b5ece8:00000001 00000001 q=00000001 fl=07
rxrpc_rx_ack: c=00000044 00000001 PNG r=00000000 f=00000002 p=00000000 n=0
rxrpc_rx_ack: c=00000044 00000002 REQ r=00000001 f=00000002 p=00000001 n=0
...
DATA packet 1 (q=xx) has REQUEST_ACK set (bit 1 of fl=xx). The incoming
ping (labelled PNG) hard-acks the request DATA packet (f=xx exceeds the
sequence number of the DATA packet), causing it to be discarded from the Tx
ring. The ACK that was requested (labelled REQ, r=xx references the serial
of the DATA packet) comes after the ping, but the sk_buff holding the
timestamp has gone and the RTT sample is lost.
This is particularly noticeable on RPC calls used to probe the service
offered by the peer. A lot of peers end up with an unknown RTT because we
only ever sent a single RPC. This confuses the server rotation algorithm.
Fix this by caching the information about the outgoing packet in RTT
calculations in the rxrpc_call struct rather than looking in the Tx ring.
A four-deep buffer is maintained and both REQUEST_ACK-flagged DATA and
PING-ACK transmissions are recorded in there. When the appropriate
response ACK is received, the buffer is checked for a match and, if found,
an RTT sample is recorded.
If a received ACK refers to a packet with a later serial number than an
entry in the cache, that entry is presumed lost and the entry is made
available to record a new transmission.
ACKs types other than REQUESTED-type and PING-type cause any matching
sample to be cancelled as they don't necessarily represent a useful
measurement.
If there's no space in the buffer on ping/data transmission, the sample
base is discarded.
Fixes: 50235c4b5a2f ("rxrpc: Obtain RTT data by requesting ACKs on DATA packets")
Signed-off-by: David Howells <dhowells@redhat.com>
2020-08-19 23:29:16 +01:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
rxrpc: Fix loss of RTT samples due to interposed ACK
The Rx protocol has a mechanism to help generate RTT samples that works by
a client transmitting a REQUESTED-type ACK when it receives a DATA packet
that has the REQUEST_ACK flag set.
The peer, however, may interpose other ACKs before transmitting the
REQUESTED-ACK, as can be seen in the following trace excerpt:
rxrpc_tx_data: c=00000044 DATA d0b5ece8:00000001 00000001 q=00000001 fl=07
rxrpc_rx_ack: c=00000044 00000001 PNG r=00000000 f=00000002 p=00000000 n=0
rxrpc_rx_ack: c=00000044 00000002 REQ r=00000001 f=00000002 p=00000001 n=0
...
DATA packet 1 (q=xx) has REQUEST_ACK set (bit 1 of fl=xx). The incoming
ping (labelled PNG) hard-acks the request DATA packet (f=xx exceeds the
sequence number of the DATA packet), causing it to be discarded from the Tx
ring. The ACK that was requested (labelled REQ, r=xx references the serial
of the DATA packet) comes after the ping, but the sk_buff holding the
timestamp has gone and the RTT sample is lost.
This is particularly noticeable on RPC calls used to probe the service
offered by the peer. A lot of peers end up with an unknown RTT because we
only ever sent a single RPC. This confuses the server rotation algorithm.
Fix this by caching the information about the outgoing packet in RTT
calculations in the rxrpc_call struct rather than looking in the Tx ring.
A four-deep buffer is maintained and both REQUEST_ACK-flagged DATA and
PING-ACK transmissions are recorded in there. When the appropriate
response ACK is received, the buffer is checked for a match and, if found,
an RTT sample is recorded.
If a received ACK refers to a packet with a later serial number than an
entry in the cache, that entry is presumed lost and the entry is made
available to record a new transmission.
ACKs types other than REQUESTED-type and PING-type cause any matching
sample to be cancelled as they don't necessarily represent a useful
measurement.
If there's no space in the buffer on ping/data transmission, the sample
base is discarded.
Fixes: 50235c4b5a2f ("rxrpc: Obtain RTT data by requesting ACKs on DATA packets")
Signed-off-by: David Howells <dhowells@redhat.com>
2020-08-19 23:29:16 +01:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
rxrpc: Fix loss of RTT samples due to interposed ACK
The Rx protocol has a mechanism to help generate RTT samples that works by
a client transmitting a REQUESTED-type ACK when it receives a DATA packet
that has the REQUEST_ACK flag set.
The peer, however, may interpose other ACKs before transmitting the
REQUESTED-ACK, as can be seen in the following trace excerpt:
rxrpc_tx_data: c=00000044 DATA d0b5ece8:00000001 00000001 q=00000001 fl=07
rxrpc_rx_ack: c=00000044 00000001 PNG r=00000000 f=00000002 p=00000000 n=0
rxrpc_rx_ack: c=00000044 00000002 REQ r=00000001 f=00000002 p=00000001 n=0
...
DATA packet 1 (q=xx) has REQUEST_ACK set (bit 1 of fl=xx). The incoming
ping (labelled PNG) hard-acks the request DATA packet (f=xx exceeds the
sequence number of the DATA packet), causing it to be discarded from the Tx
ring. The ACK that was requested (labelled REQ, r=xx references the serial
of the DATA packet) comes after the ping, but the sk_buff holding the
timestamp has gone and the RTT sample is lost.
This is particularly noticeable on RPC calls used to probe the service
offered by the peer. A lot of peers end up with an unknown RTT because we
only ever sent a single RPC. This confuses the server rotation algorithm.
Fix this by caching the information about the outgoing packet in RTT
calculations in the rxrpc_call struct rather than looking in the Tx ring.
A four-deep buffer is maintained and both REQUEST_ACK-flagged DATA and
PING-ACK transmissions are recorded in there. When the appropriate
response ACK is received, the buffer is checked for a match and, if found,
an RTT sample is recorded.
If a received ACK refers to a packet with a later serial number than an
entry in the cache, that entry is presumed lost and the entry is made
available to record a new transmission.
ACKs types other than REQUESTED-type and PING-type cause any matching
sample to be cancelled as they don't necessarily represent a useful
measurement.
If there's no space in the buffer on ping/data transmission, the sample
base is discarded.
Fixes: 50235c4b5a2f ("rxrpc: Obtain RTT data by requesting ACKs on DATA packets")
Signed-off-by: David Howells <dhowells@redhat.com>
2020-08-19 23:29:16 +01:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
rxrpc: Fix loss of RTT samples due to interposed ACK
The Rx protocol has a mechanism to help generate RTT samples that works by
a client transmitting a REQUESTED-type ACK when it receives a DATA packet
that has the REQUEST_ACK flag set.
The peer, however, may interpose other ACKs before transmitting the
REQUESTED-ACK, as can be seen in the following trace excerpt:
rxrpc_tx_data: c=00000044 DATA d0b5ece8:00000001 00000001 q=00000001 fl=07
rxrpc_rx_ack: c=00000044 00000001 PNG r=00000000 f=00000002 p=00000000 n=0
rxrpc_rx_ack: c=00000044 00000002 REQ r=00000001 f=00000002 p=00000001 n=0
...
DATA packet 1 (q=xx) has REQUEST_ACK set (bit 1 of fl=xx). The incoming
ping (labelled PNG) hard-acks the request DATA packet (f=xx exceeds the
sequence number of the DATA packet), causing it to be discarded from the Tx
ring. The ACK that was requested (labelled REQ, r=xx references the serial
of the DATA packet) comes after the ping, but the sk_buff holding the
timestamp has gone and the RTT sample is lost.
This is particularly noticeable on RPC calls used to probe the service
offered by the peer. A lot of peers end up with an unknown RTT because we
only ever sent a single RPC. This confuses the server rotation algorithm.
Fix this by caching the information about the outgoing packet in RTT
calculations in the rxrpc_call struct rather than looking in the Tx ring.
A four-deep buffer is maintained and both REQUEST_ACK-flagged DATA and
PING-ACK transmissions are recorded in there. When the appropriate
response ACK is received, the buffer is checked for a match and, if found,
an RTT sample is recorded.
If a received ACK refers to a packet with a later serial number than an
entry in the cache, that entry is presumed lost and the entry is made
available to record a new transmission.
ACKs types other than REQUESTED-type and PING-type cause any matching
sample to be cancelled as they don't necessarily represent a useful
measurement.
If there's no space in the buffer on ping/data transmission, the sample
base is discarded.
Fixes: 50235c4b5a2f ("rxrpc: Obtain RTT data by requesting ACKs on DATA packets")
Signed-off-by: David Howells <dhowells@redhat.com>
2020-08-19 23:29:16 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
rxrpc: Fix loss of RTT samples due to interposed ACK
The Rx protocol has a mechanism to help generate RTT samples that works by
a client transmitting a REQUESTED-type ACK when it receives a DATA packet
that has the REQUEST_ACK flag set.
The peer, however, may interpose other ACKs before transmitting the
REQUESTED-ACK, as can be seen in the following trace excerpt:
rxrpc_tx_data: c=00000044 DATA d0b5ece8:00000001 00000001 q=00000001 fl=07
rxrpc_rx_ack: c=00000044 00000001 PNG r=00000000 f=00000002 p=00000000 n=0
rxrpc_rx_ack: c=00000044 00000002 REQ r=00000001 f=00000002 p=00000001 n=0
...
DATA packet 1 (q=xx) has REQUEST_ACK set (bit 1 of fl=xx). The incoming
ping (labelled PNG) hard-acks the request DATA packet (f=xx exceeds the
sequence number of the DATA packet), causing it to be discarded from the Tx
ring. The ACK that was requested (labelled REQ, r=xx references the serial
of the DATA packet) comes after the ping, but the sk_buff holding the
timestamp has gone and the RTT sample is lost.
This is particularly noticeable on RPC calls used to probe the service
offered by the peer. A lot of peers end up with an unknown RTT because we
only ever sent a single RPC. This confuses the server rotation algorithm.
Fix this by caching the information about the outgoing packet in RTT
calculations in the rxrpc_call struct rather than looking in the Tx ring.
A four-deep buffer is maintained and both REQUEST_ACK-flagged DATA and
PING-ACK transmissions are recorded in there. When the appropriate
response ACK is received, the buffer is checked for a match and, if found,
an RTT sample is recorded.
If a received ACK refers to a packet with a later serial number than an
entry in the cache, that entry is presumed lost and the entry is made
available to record a new transmission.
ACKs types other than REQUESTED-type and PING-type cause any matching
sample to be cancelled as they don't necessarily represent a useful
measurement.
If there's no space in the buffer on ping/data transmission, the sample
base is discarded.
Fixes: 50235c4b5a2f ("rxrpc: Obtain RTT data by requesting ACKs on DATA packets")
Signed-off-by: David Howells <dhowells@redhat.com>
2020-08-19 23:29:16 +01:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
2024-12-04 07:46:55 +00:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
2024-12-04 07:46:55 +00:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:55 +00:00
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
2024-12-04 07:46:55 +00:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
rxrpc: Fix loss of RTT samples due to interposed ACK
The Rx protocol has a mechanism to help generate RTT samples that works by
a client transmitting a REQUESTED-type ACK when it receives a DATA packet
that has the REQUEST_ACK flag set.
The peer, however, may interpose other ACKs before transmitting the
REQUESTED-ACK, as can be seen in the following trace excerpt:
rxrpc_tx_data: c=00000044 DATA d0b5ece8:00000001 00000001 q=00000001 fl=07
rxrpc_rx_ack: c=00000044 00000001 PNG r=00000000 f=00000002 p=00000000 n=0
rxrpc_rx_ack: c=00000044 00000002 REQ r=00000001 f=00000002 p=00000001 n=0
...
DATA packet 1 (q=xx) has REQUEST_ACK set (bit 1 of fl=xx). The incoming
ping (labelled PNG) hard-acks the request DATA packet (f=xx exceeds the
sequence number of the DATA packet), causing it to be discarded from the Tx
ring. The ACK that was requested (labelled REQ, r=xx references the serial
of the DATA packet) comes after the ping, but the sk_buff holding the
timestamp has gone and the RTT sample is lost.
This is particularly noticeable on RPC calls used to probe the service
offered by the peer. A lot of peers end up with an unknown RTT because we
only ever sent a single RPC. This confuses the server rotation algorithm.
Fix this by caching the information about the outgoing packet in RTT
calculations in the rxrpc_call struct rather than looking in the Tx ring.
A four-deep buffer is maintained and both REQUEST_ACK-flagged DATA and
PING-ACK transmissions are recorded in there. When the appropriate
response ACK is received, the buffer is checked for a match and, if found,
an RTT sample is recorded.
If a received ACK refers to a packet with a later serial number than an
entry in the cache, that entry is presumed lost and the entry is made
available to record a new transmission.
ACKs types other than REQUESTED-type and PING-type cause any matching
sample to be cancelled as they don't necessarily represent a useful
measurement.
If there's no space in the buffer on ping/data transmission, the sample
base is discarded.
Fixes: 50235c4b5a2f ("rxrpc: Obtain RTT data by requesting ACKs on DATA packets")
Signed-off-by: David Howells <dhowells@redhat.com>
2020-08-19 23:29:16 +01:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:55 +00:00
|
|
|
|
2020-05-11 14:54:34 +01:00
|
|
|
|
2024-12-04 07:47:05 +00:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:55 +00:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
rxrpc: Fix loss of RTT samples due to interposed ACK
The Rx protocol has a mechanism to help generate RTT samples that works by
a client transmitting a REQUESTED-type ACK when it receives a DATA packet
that has the REQUEST_ACK flag set.
The peer, however, may interpose other ACKs before transmitting the
REQUESTED-ACK, as can be seen in the following trace excerpt:
rxrpc_tx_data: c=00000044 DATA d0b5ece8:00000001 00000001 q=00000001 fl=07
rxrpc_rx_ack: c=00000044 00000001 PNG r=00000000 f=00000002 p=00000000 n=0
rxrpc_rx_ack: c=00000044 00000002 REQ r=00000001 f=00000002 p=00000001 n=0
...
DATA packet 1 (q=xx) has REQUEST_ACK set (bit 1 of fl=xx). The incoming
ping (labelled PNG) hard-acks the request DATA packet (f=xx exceeds the
sequence number of the DATA packet), causing it to be discarded from the Tx
ring. The ACK that was requested (labelled REQ, r=xx references the serial
of the DATA packet) comes after the ping, but the sk_buff holding the
timestamp has gone and the RTT sample is lost.
This is particularly noticeable on RPC calls used to probe the service
offered by the peer. A lot of peers end up with an unknown RTT because we
only ever sent a single RPC. This confuses the server rotation algorithm.
Fix this by caching the information about the outgoing packet in RTT
calculations in the rxrpc_call struct rather than looking in the Tx ring.
A four-deep buffer is maintained and both REQUEST_ACK-flagged DATA and
PING-ACK transmissions are recorded in there. When the appropriate
response ACK is received, the buffer is checked for a match and, if found,
an RTT sample is recorded.
If a received ACK refers to a packet with a later serial number than an
entry in the cache, that entry is presumed lost and the entry is made
available to record a new transmission.
ACKs types other than REQUESTED-type and PING-type cause any matching
sample to be cancelled as they don't necessarily represent a useful
measurement.
If there's no space in the buffer on ping/data transmission, the sample
base is discarded.
Fixes: 50235c4b5a2f ("rxrpc: Obtain RTT data by requesting ACKs on DATA packets")
Signed-off-by: David Howells <dhowells@redhat.com>
2020-08-19 23:29:16 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:55 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-22 00:41:53 +01:00
|
|
|
|
|
|
|
|
|
2024-01-30 21:37:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-23 15:22:36 +01:00
|
|
|
|
2024-01-30 21:37:16 +00:00
|
|
|
|
2016-09-23 15:22:36 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
2024-01-30 21:37:16 +00:00
|
|
|
|
2016-09-23 15:22:36 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2017-11-24 10:18:41 +00:00
|
|
|
|
2024-01-30 21:37:16 +00:00
|
|
|
|
2016-09-23 15:22:36 +01:00
|
|
|
|
|
|
|
|
|
2024-01-30 21:37:16 +00:00
|
|
|
|
2016-09-23 15:22:36 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2024-01-30 21:37:16 +00:00
|
|
|
|
2016-09-23 15:22:36 +01:00
|
|
|
|
|
|
|
|
|
2024-01-30 21:37:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-04-22 00:20:49 +01:00
|
|
|
|
2024-01-30 21:37:16 +00:00
|
|
|
|
2022-04-22 00:20:49 +01:00
|
|
|
|
|
|
|
|
|
2024-01-30 21:37:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-04-22 00:20:49 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-01-30 21:37:16 +00:00
|
|
|
|
|
|
|
|
|
2022-04-22 00:20:49 +01:00
|
|
|
|
|
|
|
|
|
2024-01-30 21:37:16 +00:00
|
|
|
|
2022-04-22 00:20:49 +01:00
|
|
|
|
2024-01-30 21:37:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-04-22 00:20:49 +01:00
|
|
|
|
|
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
2016-09-23 12:39:22 +01:00
|
|
|
|
|
|
|
|
|
2016-09-23 13:50:40 +01:00
|
|
|
|
|
|
|
|
|
2020-01-30 21:48:14 +00:00
|
|
|
|
2016-09-23 13:50:40 +01:00
|
|
|
|
2020-01-30 21:48:14 +00:00
|
|
|
|
2016-09-23 13:50:40 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-23 13:50:40 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2016-09-23 13:50:40 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2020-01-30 21:48:14 +00:00
|
|
|
|
2016-09-23 13:50:40 +01:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
|
|
|
|
|
2020-01-30 21:48:14 +00:00
|
|
|
|
2016-09-23 13:50:40 +01:00
|
|
|
|
|
|
|
|
|
2020-01-30 21:48:13 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2020-01-30 21:48:13 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2020-01-30 21:48:14 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2020-01-30 21:48:14 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-23 13:58:55 +01:00
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
2016-09-23 13:58:55 +01:00
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
2016-09-23 13:58:55 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
2024-12-04 07:46:51 +00:00
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
2024-01-29 13:51:30 +00:00
|
|
|
|
2016-09-23 13:58:55 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2024-12-04 07:46:51 +00:00
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
|
|
|
|
|
2016-09-23 13:58:55 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
2016-09-23 13:58:55 +01:00
|
|
|
|
2024-12-04 07:46:51 +00:00
|
|
|
|
2016-09-23 13:58:55 +01:00
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
2016-09-23 13:58:55 +01:00
|
|
|
|
|
|
|
|
|
2016-09-24 18:05:27 +01:00
|
|
|
|
2024-12-04 07:46:52 +00:00
|
|
|
|
2016-09-24 18:05:27 +01:00
|
|
|
|
2024-12-04 07:46:52 +00:00
|
|
|
|
2016-09-24 18:05:27 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
2024-12-04 07:46:50 +00:00
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:50 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
2016-09-24 18:05:27 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2024-12-04 07:46:50 +00:00
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
2016-09-24 18:05:27 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:50 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-24 18:05:27 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:51 +00:00
|
|
|
|
2016-09-24 18:05:27 +01:00
|
|
|
|
2024-12-04 07:46:52 +00:00
|
|
|
|
2017-01-05 10:38:33 +00:00
|
|
|
|
2016-09-24 18:05:27 +01:00
|
|
|
|
2024-12-04 07:46:50 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:51 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-24 18:05:27 +01:00
|
|
|
|
2024-12-04 07:46:50 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-09-24 18:05:27 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-11-11 13:47:35 +00:00
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
2022-11-11 13:47:35 +00:00
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
2022-11-11 13:47:35 +00:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
2024-12-04 07:46:50 +00:00
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
2022-11-11 13:47:35 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:50 +00:00
|
|
|
|
2022-11-11 13:47:35 +00:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
2022-11-11 13:47:35 +00:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
2022-11-11 13:47:35 +00:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:50 +00:00
|
|
|
|
2022-11-11 13:47:35 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
|
|
|
|
|
2022-11-11 13:47:35 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2017-01-05 10:38:34 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-04-06 10:12:00 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-04-06 10:12:00 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2017-04-06 10:12:00 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2020-01-23 13:13:41 +00:00
|
|
|
|
2017-04-06 10:12:00 +01:00
|
|
|
|
|
|
|
|
|
2020-01-23 13:13:41 +00:00
|
|
|
|
2017-04-06 10:12:00 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2020-01-23 13:13:41 +00:00
|
|
|
|
|
|
|
|
|
2017-04-06 10:12:00 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:51 +00:00
|
|
|
|
|
|
|
|
|
2018-03-27 23:02:47 +01:00
|
|
|
|
2024-12-04 07:46:51 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:02:47 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:02:47 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:03:00 +01:00
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
2020-01-23 13:13:41 +00:00
|
|
|
|
2024-12-04 07:46:51 +00:00
|
|
|
|
2018-03-27 23:02:47 +01:00
|
|
|
|
|
|
|
|
|
2020-01-23 13:13:41 +00:00
|
|
|
|
2018-03-27 23:02:47 +01:00
|
|
|
|
2020-01-23 13:13:41 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-03-27 23:02:47 +01:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:51 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-05-10 23:26:01 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-05-10 23:26:01 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-05-10 23:26:01 +01:00
|
|
|
|
|
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
2018-05-10 23:26:01 +01:00
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
2018-05-10 23:26:01 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-05-10 23:26:01 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
2018-05-10 23:26:01 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
2018-05-10 23:26:01 +01:00
|
|
|
|
|
|
|
|
|
rxrpc: Fix handling of call quietly cancelled out on server
Sometimes an in-progress call will stop responding on the fileserver when
the fileserver quietly cancels the call with an internally marked abort
(RX_CALL_DEAD), without sending an ABORT to the client.
This causes the client's call to eventually expire from lack of incoming
packets directed its way, which currently leads to it being cancelled
locally with ETIME. Note that it's not currently clear as to why this
happens as it's really hard to reproduce.
The rotation policy implement by kAFS, however, doesn't differentiate
between ETIME meaning we didn't get any response from the server and ETIME
meaning the call got cancelled mid-flow. The latter leads to an oops when
fetching data as the rotation partially resets the afs_read descriptor,
which can result in a cleared page pointer being dereferenced because that
page has already been filled.
Handle this by the following means:
(1) Set a flag on a call when we receive a packet for it.
(2) Store the highest packet serial number so far received for a call
(bearing in mind this may wrap).
(3) If, when the "not received anything recently" timeout expires on a
call, we've received at least one packet for a call and the connection
as a whole has received packets more recently than that call, then
cancel the call locally with ECONNRESET rather than ETIME.
This indicates that the call was definitely in progress on the server.
(4) In kAFS, if the rotation algorithm sees ECONNRESET rather than ETIME,
don't try the next server, but rather abort the call.
This avoids the oops as we don't try to reuse the afs_read struct.
Rather, as-yet ungotten pages will be reread at a later data.
Also:
(5) Add an rxrpc tracepoint to log detection of the call being reset.
Without this, I occasionally see an oops like the following:
general protection fault: 0000 [#1] SMP PTI
...
RIP: 0010:_copy_to_iter+0x204/0x310
RSP: 0018:ffff8800cae0f828 EFLAGS: 00010206
RAX: 0000000000000560 RBX: 0000000000000560 RCX: 0000000000000560
RDX: ffff8800cae0f968 RSI: ffff8800d58b3312 RDI: 0005080000000000
RBP: ffff8800cae0f968 R08: 0000000000000560 R09: ffff8800ca00f400
R10: ffff8800c36f28d4 R11: 00000000000008c4 R12: ffff8800cae0f958
R13: 0000000000000560 R14: ffff8800d58b3312 R15: 0000000000000560
FS: 00007fdaef108080(0000) GS:ffff8800ca680000(0000) knlGS:0000000000000000
CS: 0010 DS: 0000 ES: 0000 CR0: 0000000080050033
CR2: 00007fb28a8fa000 CR3: 00000000d2a76002 CR4: 00000000001606e0
Call Trace:
skb_copy_datagram_iter+0x14e/0x289
rxrpc_recvmsg_data.isra.0+0x6f3/0xf68
? trace_buffer_unlock_commit_regs+0x4f/0x89
rxrpc_kernel_recv_data+0x149/0x421
afs_extract_data+0x1e0/0x798
? afs_wait_for_call_to_complete+0xc9/0x52e
afs_deliver_fs_fetch_data+0x33a/0x5ab
afs_deliver_to_call+0x1ee/0x5e0
? afs_wait_for_call_to_complete+0xc9/0x52e
afs_wait_for_call_to_complete+0x12b/0x52e
? wake_up_q+0x54/0x54
afs_make_call+0x287/0x462
? afs_fs_fetch_data+0x3e6/0x3ed
? rcu_read_lock_sched_held+0x5d/0x63
afs_fs_fetch_data+0x3e6/0x3ed
afs_fetch_data+0xbb/0x14a
afs_readpages+0x317/0x40d
__do_page_cache_readahead+0x203/0x2ba
? ondemand_readahead+0x3a7/0x3c1
ondemand_readahead+0x3a7/0x3c1
generic_file_buffered_read+0x18b/0x62f
__vfs_read+0xdb/0xfe
vfs_read+0xb2/0x137
ksys_read+0x50/0x8c
do_syscall_64+0x7d/0x1a0
entry_SYSCALL_64_after_hwframe+0x49/0xbe
Note the weird value in RDI which is a result of trying to kmap() a NULL
page pointer.
Signed-off-by: David Howells <dhowells@redhat.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2018-06-03 02:17:39 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
rxrpc: Fix handling of call quietly cancelled out on server
Sometimes an in-progress call will stop responding on the fileserver when
the fileserver quietly cancels the call with an internally marked abort
(RX_CALL_DEAD), without sending an ABORT to the client.
This causes the client's call to eventually expire from lack of incoming
packets directed its way, which currently leads to it being cancelled
locally with ETIME. Note that it's not currently clear as to why this
happens as it's really hard to reproduce.
The rotation policy implement by kAFS, however, doesn't differentiate
between ETIME meaning we didn't get any response from the server and ETIME
meaning the call got cancelled mid-flow. The latter leads to an oops when
fetching data as the rotation partially resets the afs_read descriptor,
which can result in a cleared page pointer being dereferenced because that
page has already been filled.
Handle this by the following means:
(1) Set a flag on a call when we receive a packet for it.
(2) Store the highest packet serial number so far received for a call
(bearing in mind this may wrap).
(3) If, when the "not received anything recently" timeout expires on a
call, we've received at least one packet for a call and the connection
as a whole has received packets more recently than that call, then
cancel the call locally with ECONNRESET rather than ETIME.
This indicates that the call was definitely in progress on the server.
(4) In kAFS, if the rotation algorithm sees ECONNRESET rather than ETIME,
don't try the next server, but rather abort the call.
This avoids the oops as we don't try to reuse the afs_read struct.
Rather, as-yet ungotten pages will be reread at a later data.
Also:
(5) Add an rxrpc tracepoint to log detection of the call being reset.
Without this, I occasionally see an oops like the following:
general protection fault: 0000 [#1] SMP PTI
...
RIP: 0010:_copy_to_iter+0x204/0x310
RSP: 0018:ffff8800cae0f828 EFLAGS: 00010206
RAX: 0000000000000560 RBX: 0000000000000560 RCX: 0000000000000560
RDX: ffff8800cae0f968 RSI: ffff8800d58b3312 RDI: 0005080000000000
RBP: ffff8800cae0f968 R08: 0000000000000560 R09: ffff8800ca00f400
R10: ffff8800c36f28d4 R11: 00000000000008c4 R12: ffff8800cae0f958
R13: 0000000000000560 R14: ffff8800d58b3312 R15: 0000000000000560
FS: 00007fdaef108080(0000) GS:ffff8800ca680000(0000) knlGS:0000000000000000
CS: 0010 DS: 0000 ES: 0000 CR0: 0000000080050033
CR2: 00007fb28a8fa000 CR3: 00000000d2a76002 CR4: 00000000001606e0
Call Trace:
skb_copy_datagram_iter+0x14e/0x289
rxrpc_recvmsg_data.isra.0+0x6f3/0xf68
? trace_buffer_unlock_commit_regs+0x4f/0x89
rxrpc_kernel_recv_data+0x149/0x421
afs_extract_data+0x1e0/0x798
? afs_wait_for_call_to_complete+0xc9/0x52e
afs_deliver_fs_fetch_data+0x33a/0x5ab
afs_deliver_to_call+0x1ee/0x5e0
? afs_wait_for_call_to_complete+0xc9/0x52e
afs_wait_for_call_to_complete+0x12b/0x52e
? wake_up_q+0x54/0x54
afs_make_call+0x287/0x462
? afs_fs_fetch_data+0x3e6/0x3ed
? rcu_read_lock_sched_held+0x5d/0x63
afs_fs_fetch_data+0x3e6/0x3ed
afs_fetch_data+0xbb/0x14a
afs_readpages+0x317/0x40d
__do_page_cache_readahead+0x203/0x2ba
? ondemand_readahead+0x3a7/0x3c1
ondemand_readahead+0x3a7/0x3c1
generic_file_buffered_read+0x18b/0x62f
__vfs_read+0xdb/0xfe
vfs_read+0xb2/0x137
ksys_read+0x50/0x8c
do_syscall_64+0x7d/0x1a0
entry_SYSCALL_64_after_hwframe+0x49/0xbe
Note the weird value in RDI which is a result of trying to kmap() a NULL
page pointer.
Signed-off-by: David Howells <dhowells@redhat.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2018-06-03 02:17:39 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
2022-08-27 14:27:56 +01:00
|
|
|
|
rxrpc: Fix handling of call quietly cancelled out on server
Sometimes an in-progress call will stop responding on the fileserver when
the fileserver quietly cancels the call with an internally marked abort
(RX_CALL_DEAD), without sending an ABORT to the client.
This causes the client's call to eventually expire from lack of incoming
packets directed its way, which currently leads to it being cancelled
locally with ETIME. Note that it's not currently clear as to why this
happens as it's really hard to reproduce.
The rotation policy implement by kAFS, however, doesn't differentiate
between ETIME meaning we didn't get any response from the server and ETIME
meaning the call got cancelled mid-flow. The latter leads to an oops when
fetching data as the rotation partially resets the afs_read descriptor,
which can result in a cleared page pointer being dereferenced because that
page has already been filled.
Handle this by the following means:
(1) Set a flag on a call when we receive a packet for it.
(2) Store the highest packet serial number so far received for a call
(bearing in mind this may wrap).
(3) If, when the "not received anything recently" timeout expires on a
call, we've received at least one packet for a call and the connection
as a whole has received packets more recently than that call, then
cancel the call locally with ECONNRESET rather than ETIME.
This indicates that the call was definitely in progress on the server.
(4) In kAFS, if the rotation algorithm sees ECONNRESET rather than ETIME,
don't try the next server, but rather abort the call.
This avoids the oops as we don't try to reuse the afs_read struct.
Rather, as-yet ungotten pages will be reread at a later data.
Also:
(5) Add an rxrpc tracepoint to log detection of the call being reset.
Without this, I occasionally see an oops like the following:
general protection fault: 0000 [#1] SMP PTI
...
RIP: 0010:_copy_to_iter+0x204/0x310
RSP: 0018:ffff8800cae0f828 EFLAGS: 00010206
RAX: 0000000000000560 RBX: 0000000000000560 RCX: 0000000000000560
RDX: ffff8800cae0f968 RSI: ffff8800d58b3312 RDI: 0005080000000000
RBP: ffff8800cae0f968 R08: 0000000000000560 R09: ffff8800ca00f400
R10: ffff8800c36f28d4 R11: 00000000000008c4 R12: ffff8800cae0f958
R13: 0000000000000560 R14: ffff8800d58b3312 R15: 0000000000000560
FS: 00007fdaef108080(0000) GS:ffff8800ca680000(0000) knlGS:0000000000000000
CS: 0010 DS: 0000 ES: 0000 CR0: 0000000080050033
CR2: 00007fb28a8fa000 CR3: 00000000d2a76002 CR4: 00000000001606e0
Call Trace:
skb_copy_datagram_iter+0x14e/0x289
rxrpc_recvmsg_data.isra.0+0x6f3/0xf68
? trace_buffer_unlock_commit_regs+0x4f/0x89
rxrpc_kernel_recv_data+0x149/0x421
afs_extract_data+0x1e0/0x798
? afs_wait_for_call_to_complete+0xc9/0x52e
afs_deliver_fs_fetch_data+0x33a/0x5ab
afs_deliver_to_call+0x1ee/0x5e0
? afs_wait_for_call_to_complete+0xc9/0x52e
afs_wait_for_call_to_complete+0x12b/0x52e
? wake_up_q+0x54/0x54
afs_make_call+0x287/0x462
? afs_fs_fetch_data+0x3e6/0x3ed
? rcu_read_lock_sched_held+0x5d/0x63
afs_fs_fetch_data+0x3e6/0x3ed
afs_fetch_data+0xbb/0x14a
afs_readpages+0x317/0x40d
__do_page_cache_readahead+0x203/0x2ba
? ondemand_readahead+0x3a7/0x3c1
ondemand_readahead+0x3a7/0x3c1
generic_file_buffered_read+0x18b/0x62f
__vfs_read+0xdb/0xfe
vfs_read+0xb2/0x137
ksys_read+0x50/0x8c
do_syscall_64+0x7d/0x1a0
entry_SYSCALL_64_after_hwframe+0x49/0xbe
Note the weird value in RDI which is a result of trying to kmap() a NULL
page pointer.
Signed-off-by: David Howells <dhowells@redhat.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2018-06-03 02:17:39 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
|
|
|
|
|
2018-07-23 17:18:37 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2020-04-28 22:06:54 +01:00
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
|
|
|
|
|
2020-04-28 22:06:54 +01:00
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
2020-04-28 22:06:54 +01:00
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
2020-04-28 22:06:54 +01:00
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
|
|
|
|
|
2020-04-28 22:06:54 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
2020-04-28 22:06:54 +01:00
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
2020-04-28 22:06:54 +01:00
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
|
|
|
|
|
2020-04-28 22:06:54 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
|
|
|
|
|
2020-04-28 22:06:54 +01:00
|
|
|
|
2024-12-04 07:46:48 +00:00
|
|
|
|
2020-04-28 22:06:54 +01:00
|
|
|
|
|
|
|
|
|
2022-04-05 21:48:48 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-04-05 21:48:48 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-04-05 21:16:32 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-04-05 21:16:32 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:46 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-10 15:51:39 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:35:16 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-10 15:51:39 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2023-01-31 08:39:46 +00:00
|
|
|
|
2022-10-10 15:51:39 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-10-16 08:01:32 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:46:37 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-12-04 07:47:07 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-04-11 10:52:54 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-05-21 08:45:35 +01:00
|
|
|
|
|
|
|
|
|
2022-10-06 21:45:42 +01:00
|
|
|
|
|
|
|
|
|
2016-08-23 15:27:24 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|