linux-kernel - Re: Discontiguous folios/pagesets

lists.openwall.net		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 linux-cve-announce 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:   Sat, 28 Aug 2021 13:27:29 -0600
From:   Andreas Dilger <adilger@...ger.ca>
To:     Matthew Wilcox <willy@...radead.org>
Cc:     Johannes Weiner <hannes@...xchg.org>,
        "Darrick J. Wong" <darrick.wong@...cle.com>,
        linux-fsdevel@...r.kernel.org, linux-mm@...ck.org,
        linux-kernel@...r.kernel.org
Subject: Re: Discontiguous folios/pagesets

On Aug 28, 2021, at 1:04 PM, Matthew Wilcox <willy@...radead.org> wrote:
> 
> The current folio work is focused on permitting the VM to use
> physically contiguous chunks of memory.  Both Darrick and Johannes
> have pointed out the advantages of supporting logically-contiguous,
> physically-discontiguous chunks of memory.  Johannes wants to be able to
> use order-0 allocations to allocate larger folios, getting the benefit
> of managing the memory in larger chunks without requiring the memory
> allocator to be able to find contiguous chunks.  Darrick wants to support
> non-power-of-two block sizes.

What is the use case for non-power-of-two block sizes?  The main question
is whether that use case is important enough to add the complexity and
overhead in order to support it?

Cheers, Andreas






Download attachment "signature.asc" of type "application/pgp-signature" (874 bytes)