[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <20190128120429.17819bd348753c2d7ed3a7b9@linux-foundation.org>
Date: Mon, 28 Jan 2019 12:04:29 -0800
From: Andrew Morton <akpm@...ux-foundation.org>
To: "Uladzislau Rezki (Sony)" <urezki@...il.com>
Cc: Michal Hocko <mhocko@...e.com>,
Matthew Wilcox <willy@...radead.org>, linux-mm@...ck.org,
LKML <linux-kernel@...r.kernel.org>,
Thomas Garnier <thgarnie@...gle.com>,
Oleksiy Avramchenko <oleksiy.avramchenko@...ymobile.com>,
Steven Rostedt <rostedt@...dmis.org>,
Joel Fernandes <joelaf@...gle.com>,
Thomas Gleixner <tglx@...utronix.de>,
Ingo Molnar <mingo@...e.hu>, Tejun Heo <tj@...nel.org>
Subject: Re: [PATCH v1 2/2] mm: add priority threshold to
__purge_vmap_area_lazy()
On Thu, 24 Jan 2019 12:56:48 +0100 "Uladzislau Rezki (Sony)" <urezki@...il.com> wrote:
> commit 763b218ddfaf ("mm: add preempt points into
> __purge_vmap_area_lazy()")
>
> introduced some preempt points, one of those is making an
> allocation more prioritized over lazy free of vmap areas.
>
> Prioritizing an allocation over freeing does not work well
> all the time, i.e. it should be rather a compromise.
>
> 1) Number of lazy pages directly influence on busy list length
> thus on operations like: allocation, lookup, unmap, remove, etc.
>
> 2) Under heavy stress of vmalloc subsystem i run into a situation
> when memory usage gets increased hitting out_of_memory -> panic
> state due to completely blocking of logic that frees vmap areas
> in the __purge_vmap_area_lazy() function.
>
> Establish a threshold passing which the freeing is prioritized
> back over allocation creating a balance between each other.
It would be useful to credit the vmalloc test driver for this
discovery, and perhaps to identify specifically which test triggered
the kernel misbehaviour. Please send along suitable words and I'll add
them.
> --- a/mm/vmalloc.c
> +++ b/mm/vmalloc.c
> @@ -661,23 +661,27 @@ static bool __purge_vmap_area_lazy(unsigned long start, unsigned long end)
> struct llist_node *valist;
> struct vmap_area *va;
> struct vmap_area *n_va;
> - bool do_free = false;
> + int resched_threshold;
>
> lockdep_assert_held(&vmap_purge_lock);
>
> valist = llist_del_all(&vmap_purge_list);
> + if (unlikely(valist == NULL))
> + return false;
Why this change?
> + /*
> + * TODO: to calculate a flush range without looping.
> + * The list can be up to lazy_max_pages() elements.
> + */
How important is this?
> llist_for_each_entry(va, valist, purge_list) {
> if (va->va_start < start)
> start = va->va_start;
> if (va->va_end > end)
> end = va->va_end;
> - do_free = true;
> }
>
> - if (!do_free)
> - return false;
> -
> flush_tlb_kernel_range(start, end);
> + resched_threshold = (int) lazy_max_pages() << 1;
Is the typecast really needed?
Perhaps resched_threshold shiould have unsigned long type and perhaps
vmap_lazy_nr should be atomic_long_t?
> spin_lock(&vmap_area_lock);
> llist_for_each_entry_safe(va, n_va, valist, purge_list) {
> @@ -685,7 +689,9 @@ static bool __purge_vmap_area_lazy(unsigned long start, unsigned long end)
>
> __free_vmap_area(va);
> atomic_sub(nr, &vmap_lazy_nr);
> - cond_resched_lock(&vmap_area_lock);
> +
> + if (atomic_read(&vmap_lazy_nr) < resched_threshold)
> + cond_resched_lock(&vmap_area_lock);
> }
> spin_unlock(&vmap_area_lock);
> return true;
Powered by blists - more mailing lists