[lkml]   [2017]   [Jan]   [11]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [PATCH v4 0/4] Application Data Integrity feature introduced by SPARC M7
On 01/11/2017 09:33 AM, Dave Hansen wrote:
> On 01/11/2017 08:12 AM, Khalid Aziz wrote:
>> A userspace task enables ADI through mprotect(). This patch series adds
>> a page protection bit PROT_ADI and a corresponding VMA flag
>> VM_SPARC_ADI. VM_SPARC_ADI is used to trigger setting bit in the
>> sparc pte that enables ADI checking on the corresponding page.
> Is there a cost in the hardware associated with doing this "ADI
> checking"? For instance, instead of having this new mprotect()
> interface, why not just always set on all PTEs?

There is no performance penalty in the MMU to check tags, but if bit is set and TTE.mcde is set, the tag in VA must match what
was set on the physical page for all memory accesses. Potential for side
effects is too high in such case and would require kernel to either
track tags for every page as they are re-allocated or migrated, or scrub
pages constantly to ensure we do not get spurious tag mismatches. Unless
there is a very strong reason to blindly set on every PTE, I
think the risk of instability is too high without lot of extra code.

> Also, should this be a privileged interface in some way? The hardware
> is storing these tags *somewhere* and that storage is consuming
> resources *somewhere*. What stops a crafty attacker from mmap()'ing a
> 128TB chunk of the zero pages and storing ADI tags for all of it?
> That'll be 128TB/64*4bits = 1TB worth of 4-bit tags. Page tables, for
> instance, consume a comparable amount of storage, but the OS *knows*
> about those and can factor them into OOM decisions.

Hardware resources used to store tags are managed entirely by MMU and
invisible to the kernel. Tags are stored in spare bits in memory. The
only tag resource consumption visible to OS will be the space it
allocates to store tags as pages are swapped in/out or migrated. If we
choose to implement subpage granularity for tags in future, resource
consumption will be a concern. You are right, each n pages of tagged
memory requires n/128 pages to store tags. Since each tag is just 4
bits, there are good possibilities to compress this data but that is for


 \ /
  Last update: 2017-01-11 17:58    [W:0.126 / U:10.852 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site