[lkml]   [2018]   [Apr]   [9]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [PATCH v1] ringbuffer: Don't choose the process with adj equal OOM_SCORE_ADJ_MIN
On Tue, Apr 10, 2018 at 11:12 AM, Steven Rostedt <> wrote:
> On Tue, 10 Apr 2018 10:32:36 +0800
> Zhaoyang Huang <> wrote:
>> For bellowing scenario, process A have no intension to exhaust the
>> memory, but will be likely to be selected by OOM for we set
>> OOM_CORE_ADJ_MIN for it.
>> process A(-1000) process B
>> i = si_mem_available();
>> if (i < nr_pages)
>> return -ENOMEM;
>> schedule
>> --------------->
>> allocate huge memory
>> <-------------
>> if (user_thread)
>> set_current_oom_origin();
>> for (i = 0; i < nr_pages; i++) {
>> bpage = kzalloc_node
> Is this really an issue though?
> Seriously, do you think you will ever hit this?
> How often do you increase the size of the ftrace ring buffer? For this
> to be an issue, the system has to trigger an OOM at the exact moment
> you decide to increase the size of the ring buffer. That would be an
> impressive attack, with little to gain.
> Ask the memory management people. If they think this could be a
> problem, then I'll be happy to take your patch.
> -- Steve
add Michael for review.
Hi Michael,
I would like suggest Steve NOT to set OOM_CORE_ADJ_MIN for the process
with adj = -1000 when setting the user space process as potential
victim of OOM. Steve doubts about the possibility of the scenario. In
my opinion, we should NOT break the original concept of the OOM, that
is, OOM would not select -1000 process unless it config it itself.
With regard to the possibility, in memory thirsty system such as
android on mobile phones, there are different kinds of user behavior
or test script to attack or ensure the stability of the system. So I
suggest we'd better keep every corner case safe. Would you please give
a comment on that? thanks

 \ /
  Last update: 2018-04-10 05:42    [W:0.063 / U:0.676 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site