Hi Linus,
Is it too late to put in a pull request for AFS changes? Apologies - I was
holding off and hoping that I could get Al to review the changes I made to
the core VFS change commit (first in the series) in response to his earlier
review comments. I have an ack for the Ext4 changes made, though. If you
would prefer it to be held off at this point, fair enough.
Note that the series also got rebased to -rc7 to remove the dependency on
fix patches that got merged through the net tree.
---
There's one core VFS change which affects a couple of filesystems:
(1) Make the inode hash table RCU safe and providing some RCU-safe
accessor functions. The search can then be done without taking the
inode_hash_lock. Care must be taken because the object may be being
deleted and no wait is made.
(2) Allow iunique() to avoid taking the inode_hash_lock.
(3) Allow AFS's callback processing to avoid taking the inode_hash_lock
when using the inode table to find an inode to notify.
(4) Improve Ext4's time updating. Konstantin Khlebnikov said "For now,
I've plugged this issue with try-lock in ext4 lazy time update. This
solution is much better."
Then there's a set of changes to make a number of improvements to the AFS
driver:
(1) Improve callback (ie. third party change notification) processing by:
(a) Relying more on the fact we're doing this under RCU and by using
fewer locks. This makes use of the RCU-based inode searching
outlined above.
(b) Moving to keeping volumes in a tree indexed by volume ID rather
than a flat list.
(c) Making the server and volume records logically part of the cell.
This means that a server record now points directly at the cell
and the tree of volumes is there. This removes an N:M mapping
table, simplifying things.
(2) Improve keeping NAT or firewall channels open for the server callbacks
to reach the client by actively polling the fileserver on a timed
basis, instead of only doing it when we have an operation to process.
(3) Improving detection of delayed or lost callbacks by including the
parent directory in the list of file IDs to be queried when doing a
bulk status fetch from lookup. We can then check to see if our copy
of the directory has changed under us without us getting notified.
(4) Determine aliasing of cells (such as a cell that is pointed to be a
DNS alias). This allows us to avoid having ambiguity due to
apparently different cells using the same volume and file servers.
(5) Improve the fileserver rotation to do more probing when it detects
that all of the addresses to a server are listed as non-responsive.
It's possible that an address that previously stopped responding has
become responsive again.
Beyond that, lay some foundations for making some calls asynchronous:
(1) Turn the fileserver cursor struct into a general operation struct and
hang the parameters off of that rather than keeping them in local
variables and hang results off of that rather than the call struct.
(2) Implement some general operation handling code and simplify the
callers of operations that affect a volume or a volume component (such
as a file). Most of the operation is now done by core code.
(3) Operations are supplied with a table of operations to issue different
variants of RPCs and to manage the completion, where all the required
data is held in the operation object, thereby allowing these to be
called from a workqueue.
(4) Put the standard "if (begin), while(select), call op, end" sequence
into a canned function that just emulates the current behaviour for
now.
There are also some fixes interspersed:
(1) Don't let the EACCES from ICMP6 mapping reach the user as such, since
it's confusing as to whether it's a filesystem error. Convert it to
EHOSTUNREACH.
(2) Don't use the epoch value acquired through probing a server. If we
have two servers with the same UUID but in different cells, it's hard
to draw conclusions from them having different epoch values.
(3) Don't interpret the argument to the CB.ProbeUuid RPC as a fileserver
UUID and look up a fileserver from it.
(4) Deal with servers in different cells having the same UUIDs. In the
event that a CB.InitCallBackState3 RPC is received, we have to break
the callback promises for every server record matching that UUID.
(5) Don't let afs_statfs return values that go below 0.
(6) Don't use running fileserver probe state to make server selection and
address selection decisions on. Only make decisions on final state as
the running state is cleared at the start of probing.
Tested-by: Marc Dionne
Thanks,
David
---
The following changes since commit 9cb1fd0efd195590b828b9b865421ad345a4a145:
Linux 5.7-rc7 (2020-05-24 15:32:54 -0700)
are available in the Git
