mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2025-02-22 13:18:25 +07:00
69b491c214
Memory reclaim via shrinkers has a terrible habit of having N+M concurrent shrinker executions (N = num CPUs, M = num kswapds) all trying to shrink the same cache. When the cache they are all working on is protected by a single spinlock, massive contention an slowdowns occur. Wrap the per-ag inode caches with a reclaim mutex to serialise reclaim access to the AG. This will block concurrent reclaim in each AG but still allow reclaim to scan multiple AGs concurrently. Allow shrinkers to move on to the next AG if it can't get the lock, and if we can't get any AG, then start blocking on locks. To prevent reclaimers from continually scanning the same inodes in each AG, add a cursor that tracks where the last reclaim got up to and start from that point on the next reclaim. This should avoid only ever scanning a small number of inodes at the satart of each AG and not making progress. If we have a non-shrinker based reclaim pass, ignore the cursor and reset it to zero once we are done. Signed-off-by: Dave Chinner <dchinner@redhat.com> Reviewed-by: Alex Elder <aelder@sgi.com> |
||
|---|---|---|
| .. | ||
| kmem.c | ||
| kmem.h | ||
| mrlock.h | ||
| sv.h | ||
| time.h | ||
| xfs_acl.c | ||
| xfs_aops.c | ||
| xfs_aops.h | ||
| xfs_buf.c | ||
| xfs_buf.h | ||
| xfs_cred.h | ||
| xfs_export.c | ||
| xfs_export.h | ||
| xfs_file.c | ||
| xfs_fs_subr.c | ||
| xfs_globals.c | ||
| xfs_globals.h | ||
| xfs_ioctl32.c | ||
| xfs_ioctl32.h | ||
| xfs_ioctl.c | ||
| xfs_ioctl.h | ||
| xfs_iops.c | ||
| xfs_iops.h | ||
| xfs_linux.h | ||
| xfs_quotaops.c | ||
| xfs_stats.c | ||
| xfs_stats.h | ||
| xfs_super.c | ||
| xfs_super.h | ||
| xfs_sync.c | ||
| xfs_sync.h | ||
| xfs_sysctl.c | ||
| xfs_sysctl.h | ||
| xfs_trace.c | ||
| xfs_trace.h | ||
| xfs_version.h | ||
| xfs_vnode.h | ||
| xfs_xattr.c | ||