Push the asynchronous function call concept a little further
Get series with b4
b4 am [email protected]Versions newest first
- v1 Latest2 patches 0 repliesNew
Patches in v1 No applies recorded yet
| # | Subject and files | Size | Replies | Applied |
|---|---|---|---|---|
| 1/2 | async: allow for multiple independent synchronization domainsinclude/ kernel/ | +39 | 0 replies | |
| 2/2 | async: make the final inode deletion an asynchronous eventfs/ fs/ include/ | +28 | 0 replies |
Reviews trailers per patch
No Reviewed-by, Acked-by or Tested-by trailers for v1 yet.
Cover letter [PATCH 0/2] Push the asynchronous function call concept a little further
Hi,
the 2 patches in this series try to push the asynchronous function call concept a little further;
the first patch allows for creating multiple queues so that you can do synchronization on your own queue without creating congestion in the one global queue (for example, as used in the 2nd patch, a per superblock queue).
the second patch uses a per superblock queue to make the last part of file deletion (the actual removal of the file content from disk) using the async function call concept.
The cut is done after the inode is removed from the VFS (and where the code can and does sleep), but before calling into the filesystem to do the actual removal. The locking etc around this should be safe due to the sleep-ability and the fact that the inode is already out of the VFS namespaces (eg it's in I_FREEING).
On my testbox, rm -rf of a kernel tree went from 11.6 to 8.6 seconds with this; with smaller rm's I expect the gain to be more (to the point where applications that only occasionally delete files no longer will stutter around this as much).
Signature · 3 lines
Arjan van de Ven Intel Open Source Technology Centre For development, discussion and tips for power savings, visit http://www.lesswatts.org