lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  linux-hardening  PHC 
Open Source and information security mailing list archives
Hash Suite: Windows password security audit tool. GUI, reports in PDF.
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date:   Mon, 2 Jan 2017 16:48:41 +0100
From:   Jan Kara <>
To:     Minchan Kim <>
Cc:     Tim Chen <>,
        Andrew Morton <>,
        Ying Huang <>,,,,,, Hugh Dickins <>,
        Shaohua Li <>, Rik van Riel <>,
        Andrea Arcangeli <>,
        "Kirill A . Shutemov" <>,
        Vladimir Davydov <>,
        Johannes Weiner <>,
        Michal Hocko <>,
        Hillf Danton <>,
        Christian Borntraeger <>,
        Jonathan Corbet <>,
Subject: Re: [PATCH v4 0/9] mm/swap: Regular page swap optimizations


On Tue 27-12-16 16:45:03, Minchan Kim wrote:
> > Patch 3 splits the swap cache radix tree into 64MB chunks, reducing
> >         the rate that we have to contende for the radix tree.
> To me, it's rather hacky. I think it might be common problem for page cache
> so can we think another generalized way like range_lock? Ccing Jan.

I agree on the hackyness of the patch and that page cache would suffer with
the same contention (although the files are usually smaller than swap so it
would not be that visible I guess). But I don't see how range lock would
help here - we need to serialize modifications of the tree structure itself
and that is difficult to achieve with the range lock. So what you would
need is either a different data structure for tracking swap cache entries
or a finer grained locking of the radix tree.

Jan Kara <>

Powered by blists - more mailing lists