Messages in this thread | | | Date | Mon, 20 Oct 2014 14:59:47 -0400 | From | Johannes Weiner <> | Subject | Re: [PATCH] memcg: simplify unreclaimable groups handling in soft limit reclaim |
| |
On Mon, Oct 20, 2014 at 07:55:54PM +0400, Vladimir Davydov wrote: > If we fail to reclaim anything from a cgroup during a soft reclaim pass > we want to get the next largest cgroup exceeding its soft limit. To > achieve this, we should obviously remove the current group from the tree > and then pick the largest group. Currently we have a weird loop instead. > Let's simplify it. > > Signed-off-by: Vladimir Davydov <vdavydov@parallels.com>
I wonder if there will be anything left once we removed all that which is pointless and the unnecessary from the memcg code.
Acked-by: Johannes Weiner <hannes@cmpxchg.org>
| |