linux-kernel - [RFC/RFT][PATCH 0/7] sched/cpuidle: Idle loop rework

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [thread-next>] [day] [month] [year] [list]

Message-ID: <1657351.s4RTvEoqBQ@aspire.rjw.lan>
Date:   Sun, 04 Mar 2018 23:21:30 +0100
From:   "Rafael J. Wysocki" <rjw@...ysocki.net>
To:     Peter Zijlstra <peterz@...radead.org>,
        Thomas Gleixner <tglx@...utronix.de>,
        Frederic Weisbecker <fweisbec@...il.com>
Cc:     Paul McKenney <paulmck@...ux.vnet.ibm.com>,
        Thomas Ilsche <thomas.ilsche@...dresden.de>,
        Doug Smythies <dsmythies@...us.net>,
        Rik van Riel <riel@...riel.com>,
        Aubrey Li <aubrey.li@...ux.intel.com>,
        Mike Galbraith <mgalbraith@...e.de>,
        LKML <linux-kernel@...r.kernel.org>,
        Linux PM <linux-pm@...r.kernel.org>
Subject: [RFC/RFT][PATCH 0/7] sched/cpuidle: Idle loop rework

Hi All,

The problem is that if we stop the sched tick in
tick_nohz_idle_enter() and then the idle governor predicts short idle
duration, we lose regardless of whether or not it is right.

If it is right, we've lost already, because we stopped the tick
unnecessarily.  If it is not right, we'll lose going forward, because
the idle state selected by the governor is going to be too shallow and
we'll draw too much power (that has been reported recently to actually
happen often enough for people to care).

This patch series is an attempt to improve the situation and the idea
here is to make the decision whether or not to stop the tick deeper in
the idle loop and in particular after running the idle state selection
in the path where the idle governor is invoked.  This way the problem
can be avoided, because the idle duration predicted by the idle governor
can be used to decide whether or not to stop the tick so that the tick
is only stopped if that value is large enough (and, consequently, the
idle state selected by the governor is deep enough).

The series tires to avoid adding too much new code, rather reorder the
existing code and make it more fine-grained.

Patch 1 prepares the tick-sched code for the subsequent modifications and it
doesn't change the code's functionality (at least not intentionally).

Patch 2 starts pushing the tick stopping decision deeper into the idle
loop, but it is limited to do_idle() and tick_nohz_irq_exit().

Patch 3 makes cpuidle_idle_call() decide whether or not to stop the tick
and sets the stage for the changes in patch 6.

Patch 4 splits menu_select() into idle duration prediction and idle state
selection parts.

Patch 5 adds the ->predict callback to struct cpuidle_governor and hooks
it up to the menu governor's idle duration prediction routine introduced
by patch 4.  It also changes cpuidle_select() to return the expected idle
duration in addition to the target state index.

Patch 6 reorders idle duration prediction by the governor and idle state
selection with respect to the stopping of the tick and causes the predicted
idle duration to be used for deciding whether or not to stop the tick.

Patch 7 cleans up the code to avoid running one piece of it twice in a row
in some cases.

I have tested these patches on a couple of machines, including the very laptop
I'm sending them from, without any obvious issues, but please give them a go
if you can, especially if you have an easy way to reproduce the problem they
are targeting.  The patches are on top of 4.16-rc3 (if you need a git branch
with them for easier testing, please let me know).

The above said, this is just RFC, so no pets close to the machines running it,
please, and I'm kind of expecting Peter and Thomas to tear it into pieces. :-)

Thanks,
Rafael