Re: [PATCH 0/3] mm: Randomize free memory

From: Andrew Morton
Date: Mon Sep 17 2018 - 19:18:32 EST


On Sat, 15 Sep 2018 09:23:02 -0700 Dan Williams <dan.j.williams@xxxxxxxxx> wrote:

> Data exfiltration attacks via speculative execution and
> return-oriented-programming attacks rely on the ability to infer the
> location of sensitive data objects. The kernel page allocator, has
> predictable first-in-first-out behavior for physical pages. Pages are
> freed in physical address order when first onlined. There are also
> mechanisms like CMA that can free large contiguous areas at once
> increasing the predictability of allocations in physical memory.
>
> In addition to the security implications this randomization also
> stabilizes the average performance of direct-mapped memory-side caches.
> This includes memory-side caches like the one on the Knights Landing
> processor and those generally described by the ACPI HMAT (Heterogeneous
> Memory Attributes Table [1]). Cache conflicts are spread over a random
> distribution rather than localized.
>
> Given the performance sensitivity of the page allocator this
> randomization is only performed for MAX_ORDER (4MB by default) pages. A
> kernel parameter, page_alloc.shuffle_page_order, is included to change
> the page size where randomization occurs.
>
> [1]: See ACPI 6.2 Section 5.2.27.5 Memory Side Cache Information Structure

I'm struggling to understand the justification of all of this. Are
such attacks known to exist? Or reasonably expected to exist in the
future? What is the likelihood and what is their cost? Or is this all
academic and speculative and possibly pointless?

ie, something must have motivated you to do this work rather than
<something-else>. Please spell out that motivation.


The new module parameter should be documented, please. Let's try to
help people understand why they might ever want to alter the default
and if so, what settings they should be trying.


How come we aren't also shuffling at memory hot-add time?