On Thu, Jan 31, 2019 at 03:18:40PM -0800, Darrick J. Wong wrote: > From: Darrick J. Wong <darrick.wong@xxxxxxxxxx> > > Use a rhashtable to cache the unlinked list incore. This should speed > up unlinked processing considerably when there are a lot of inodes on > the unlinked list because iunlink_remove no longer has to traverse an > entire bucket list to find which inode points to the one being removed. This sounds pretty reasonable and a real review will follow. But can you quantify the considerably speedups for real life workloads?
