[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Message-ID: <1559181482.24427.18.camel@mtksdccf07>
Date: Thu, 30 May 2019 09:58:02 +0800
From: Walter Wu <walter-zh.wu@...iatek.com>
To: Dmitry Vyukov <dvyukov@...gle.com>
CC: Andrey Ryabinin <aryabinin@...tuozzo.com>,
Alexander Potapenko <glider@...gle.com>,
Christoph Lameter <cl@...ux.com>,
Pekka Enberg <penberg@...nel.org>,
David Rientjes <rientjes@...gle.com>,
Joonsoo Kim <iamjoonsoo.kim@....com>,
Matthias Brugger <matthias.bgg@...il.com>,
"Miles Chen" <miles.chen@...iatek.com>,
kasan-dev <kasan-dev@...glegroups.com>,
LKML <linux-kernel@...r.kernel.org>,
Linux-MM <linux-mm@...ck.org>,
"Linux ARM" <linux-arm-kernel@...ts.infradead.org>,
<linux-mediatek@...ts.infradead.org>, <wsd_upstream@...iatek.com>,
"Catalin Marinas" <catalin.marinas@....com>
Subject: Re: [PATCH] kasan: add memory corruption identification for
software tag-based mode
On Wed, 2019-05-29 at 12:00 +0200, Dmitry Vyukov wrote:
> > > There can be multiple qobjects in the quarantine associated with the
> > > address, right? If so, we need to find the last one rather then a
> > > random one.
> > >
> > The qobject includes the address which has tag and range, corruption
> > address must be satisfied with the same tag and within object address
> > range, then it is found in the quarantine.
> > It should not easy to get multiple qobjects have the same tag and within
> > object address range.
>
> Yes, using the tag for matching (which I missed) makes the match less likely.
>
> But I think we should at least try to find the newest object in
> best-effort manner.
We hope it, too.
> Consider, both slab and slub reallocate objects in LIFO manner and we
> don't have a quarantine for objects themselves. So if we have a loop
> that allocates and frees an object of same size a dozen of times.
> That's enough to get a duplicate pointer+tag qobject.
> This includes:
> 1. walking the global quarantine from quarantine_tail backwards.
It is ok.
> 2. walking per-cpu lists in the opposite direction: from tail rather
> then from head. I guess we don't have links, so we could change the
> order and prepend new objects from head.
> This way we significantly increase chances of finding the right
> object. This also deserves a comment mentioning that we can find a
> wrong objects.
>
The current walking per-cpu list direction is from head to trail. we
will modify the direction and find the newest object.
> > > Why don't we allocate qlist_object and qlist_node in a single
> > > allocation? Doing 2 allocations is both unnecessary slow and leads to
> > > more complex code. We need to allocate them with a single allocations.
> > > Also I think they should be allocated from a dedicated cache that opts
> > > out of quarantine?
> > >
> > Single allocation is good suggestion, if we only has one allocation.
> > then we need to move all member of qlist_object to qlist_node?
> >
> > struct qlist_object {
> > unsigned long addr;
> > unsigned int size;
> > struct kasan_alloc_meta free_track;
> > };
> > struct qlist_node {
> > struct qlist_object *qobject;
> > struct qlist_node *next;
> > };
>
> I see 2 options:
> 1. add addr/size/free_track to qlist_node under ifdef CONFIG_KASAN_SW_TAGS
> 2. or probably better would be to include qlist_node into qlist_object
> as first field, then allocate qlist_object and cast it to qlist_node
> when adding to quarantine, and then as we iterate quarantine, we cast
> qlist_node back to qlist_object and can access size/addr.
>
Choice 2 looks better, We first try it.
>
> > We call call ___cache_free() to free the qobject and qnode, it should be
> > out of quarantine?
>
> This should work.
Thanks your good suggestion.
We will implement those solution which you suggested to the second
edition.
Thanks,
Walter
Powered by blists - more mailing lists