Lines Matching +full:idle +full:- +full:state
1 .. SPDX-License-Identifier: GPL-2.0
8 CPU Idle Time Management
21 memory or executed. Those states are the *idle* states of the processor.
23 Since part of the processor hardware is not used in idle states, entering them
27 CPU idle time management is an energy-efficiency feature concerned about using
28 the idle states of processors for this purpose.
31 ------------
33 CPU idle time management operates on CPUs as seen by the *CPU scheduler* (that
37 software as individual single-core processors. In other words, a CPU is an
44 enter an idle state, that applies to the processor as a whole.
46 Second, if the processor is multi-core, each core in it is able to follow at
52 enter an idle state, that applies to the core that asked for it in the first
56 except for one have been put into idle states at the "core level" and the
57 remaining core asks the processor to enter an idle state, that may trigger it
58 to put the whole larger unit into an idle state which also will affect the
61 Finally, each core in a multi-core processor may be able to follow more than one
66 multiple individual single-core "processors", referred to as *hardware threads*
67 (or hyper-threads specifically on Intel hardware), that each can follow one
68 sequence of instructions. Then, the hardware threads are CPUs from the CPU idle
69 time management perspective and if the processor is asked to enter an idle state
72 core also have asked the processor to enter an idle state. In that situation,
73 the core may be put into an idle state individually or a larger unit containing
74 it may be put into an idle state as a whole (if the other cores within the
75 larger unit are in idle states already).
77 Idle CPUs
78 ---------
81 *idle* by the Linux kernel when there are no tasks to run on them except for the
82 special "idle" task.
101 The special "idle" task becomes runnable if there are no other runnable tasks
102 assigned to the given CPU and the CPU is then regarded as idle. In other words,
103 in Linux idle CPUs run the code of the "idle" task called *the idle loop*. That
104 code may cause the processor to be put into one of its idle states, if they are
106 idle states, or there is not enough time to spend in an idle state before the
108 available idle states from being used, the CPU will simply execute more or less
112 .. _idle-loop:
114 The Idle Loop
117 The idle loop code takes two major steps in every iteration of it. First, it
119 idle time management subsystem called ``CPUIdle`` to select an idle state for
122 processor hardware to enter the idle state selected by the governor.
124 The role of the governor is to find an idle state most suitable for the
125 conditions at hand. For this purpose, idle states that the hardware can be
127 the platform or the processor architecture and organized in a one-dimensional
133 Each idle state present in that array is characterized by two parameters to be
134 taken into account by the governor, the *target residency* and the (worst-case)
136 spend in the given state, including the time needed to enter it (which may be
138 the shallower idle states instead. [The "depth" of an idle state roughly
139 corresponds to the power drawn by the processor in that state.] The exit
141 hardware to enter an idle state to start executing the first instruction after a
142 wakeup from that state. Note that in general the exit latency also must cover
143 the time needed to enter the given state in case the wakeup occurs when the
151 CPU depends on can spend in an idle state, including the time necessary to enter
152 and exit it. However, the CPU may be woken up by a non-timer event at any time
155 was idle after it has been woken up (that time will be referred to as the *idle
157 time until the closest timer to estimate the idle duration in future. How the
162 There are four ``CPUIdle`` governors available, ``menu``, `TEO <teo-gov_>`_,
165 tick can be `stopped by the idle loop <idle-cpus-and-tick_>`_. Available
176 hardcoded idle states information and the other able to read that information
186 .. _idle-cpus-and-tick:
188 Idle CPUs and The Scheduler Tick
203 The scheduler tick is problematic from the CPU idle time management perspective,
206 Thus, if the tick is allowed to trigger on idle CPUs, it will not make sense
207 for them to ask the hardware to enter idle states with target residencies above
208 the tick period length. Moreover, in that case the idle duration of any CPU
210 exiting idle states due to the tick wakeups on idle CPUs will be wasted.
212 Fortunately, it is not really necessary to allow the tick to trigger on idle
214 "idle" one. In other words, from the CPU scheduler perspective, the only user
215 of the CPU time on them is the idle loop. Since the time of an idle CPU need
217 tick goes away if the given CPU is idle. Consequently, it is possible to stop
218 the scheduler tick entirely on idle CPUs in principle, even though that may not
221 Whether or not it makes sense to stop the scheduler tick in the idle loop
223 (non-tick) timer due to trigger within the tick range, stopping the tick clearly
225 reprogrammed in that case. Second, if the governor is expecting a non-timer
227 be harmful. Namely, in that case the governor will select an idle state with
228 the target residency within the time until the expected wakeup, so that state is
229 going to be relatively shallow. The governor really cannot select a deep idle
230 state then, as that would contradict its own expectation of a wakeup in short
235 in the shallow idle state selected by the governor, which will be a waste of
238 governor will select a relatively deep idle state, so the tick should be stopped
246 The kernel can be configured to disable stopping the scheduler tick in the idle
247 loop altogether. That can be done through the build-time configuration of it
251 ignored by the idle loop code and the tick is never stopped.
254 stopped on idle CPUs are referred to as *tickless* systems and they are
255 generally regarded as more energy-efficient than the systems running kernels in
261 .. _menu-gov:
268 Namely, when invoked to select an idle state for a CPU (i.e. an idle state that
270 idle duration and uses the predicted value for idle state selection.
273 idle duration prediction. Namely, it saves the last 8 observed idle duration
274 values and, when predicting the idle duration next time, it computes the average
278 interval" value. Otherwise, the longest of the saved observed idle duration
299 selecting the idle state for the CPU) is updated after the CPU has been woken
300 up and the closer the sleep length is to the observed idle duration, the closer
303 falls into to obtain an approximation of the predicted idle duration that is
305 the two is taken as the idle duration prediction.
309 be costly and the idle duration is simply predicted to equal the "typical
312 Now, the governor is ready to walk the list of idle states and choose one of
313 them. For this purpose, it compares the target residency of each state with
314 the predicted idle duration and the exit latency of it with the with the latency
315 limit coming from the power management quality of service, or `PM QoS <cpu-pm-qos_>`_,
316 framework. It selects the state with the target residency closest to the predicted
317 idle duration, but still below it, and exit latency that does not exceed the
320 In the final step the governor may still need to refine the idle state selection
321 if it has not decided to `stop the scheduler tick <idle-cpus-and-tick_>`_. That
322 happens if the idle duration predicted by it is less than the tick period and
323 the tick has not been stopped already (in a previous iteration of the idle
326 that time, the governor may need to select a shallower state with a suitable
330 .. _teo-gov:
337 <menu-gov_>`_: it always tries to find the deepest idle state suitable for the
340 .. kernel-doc:: drivers/cpuidle/governors/teo.c
341 :doc: teo-description
343 .. _idle-states-representation:
345 Representation of Idle States
348 For the CPU idle time management purposes all of the physical idle states
349 supported by the processor have to be represented as a one-dimensional array of
351 the processor hardware to enter an idle state of certain properties. If there
353 cover a combination of idle states supported by the units at different levels of
355 of it <idle-loop_>`_, must reflect the properties of the idle state at the
356 deepest level (i.e. the idle state of the unit containing all of the other
360 a "module" and suppose that asking the hardware to enter a specific idle state
362 enter a specific idle state of its own (say "MX") if the other core is in idle
363 state "X" already. In other words, asking for idle state "X" at the "core"
364 level gives the hardware a license to go as deep as to idle state "MX" at the
366 asking for idle state "X" may just end up in that state by itself instead).
368 idle state "X" must reflect the minimum time to spend in idle state "MX" of
370 time the CPU needs to be idle to save any energy in case the hardware enters
371 that state. Analogously, the exit latency parameter of that object must cover
372 the exit time of idle state "MX" of the module (and usually its entry time too),
379 hierarchy of units inside them, however. In those cases asking for an idle
380 state at the "core" level does not automatically affect the "module" level, for
382 handling of the hierarchy. Then, the definition of the idle state objects is
383 entirely up to the driver, but still the physical properties of the idle state
385 used by the governor for idle state selection (for instance, the actual exit
386 latency of that idle state must not exceed the exit latency parameter of the
387 idle state object selected by the governor).
389 In addition to the target residency and exit latency idle state parameters
390 discussed above, the objects representing idle states each contain a few other
391 parameters describing the idle state and a pointer to the function to run in
392 order to ask the hardware to enter that state. Also, for each
395 statistics of the given idle state. That information is exposed by the kernel
401 called :file:`state0`, :file:`state1` and so on, up to the number of idle state
403 corresponds to one idle state object and the larger the number in its name, the
404 deeper the (effective) idle state represented by it. Each of them contains
405 a number of files (attributes) representing the properties of the idle state
409 Total number of times this idle state had been asked for, but the
410 observed idle duration was certainly too short to match its target
414 Total number of times this idle state had been asked for, but certainly
415 a deeper idle state would have been a better match for the observed idle
419 Description of the idle state.
422 Whether or not this idle state is disabled.
425 The default status of this state, "enabled" or "disabled".
428 Exit latency of the idle state in microseconds.
431 Name of the idle state.
434 Power drawn by hardware in this idle state in milliwatts (if specified,
438 Target residency of the idle state in microseconds.
441 Total time spent in this idle state by the given CPU (as measured by the
446 enter this idle state.
449 Total number of times a request to enter this idle state on the given
458 given idle state is disabled for this particular CPU, which means that the
461 However, disabling an idle state for one CPU does not prevent it from being
464 governor is implemented, disabling an idle state prevents that governor from
465 selecting any idle states deeper than the disabled one too.]
467 If the :file:`disable` attribute contains 0, the given idle state is enabled for
469 CPUs in the system at the same time. Writing 1 to it causes the idle state to
472 unless that state was disabled globally in the driver (in which case it cannot
475 The :file:`power` attribute is not defined very well, especially for idle state
476 objects representing combinations of idle states at different levels of the
477 hierarchy of units in the processor, and it generally is hard to obtain idle
478 state power numbers for complex hardware, so :file:`power` often contains 0 (not
483 really spent by the given CPU in the given idle state, because it is measured by
485 this idle state and entered a shallower one instead of it (or even it did not
486 enter any idle state at all). The kernel can only measure the time span between
487 asking the hardware to enter an idle state and the subsequent wakeup of the CPU
489 Moreover, if the idle state object in question represents a combination of idle
493 much time has been spent by the hardware in different idle states supported by
494 it is to use idle state residency counters in the hardware, if available.
496 Generally, an interrupt received when trying to enter an idle state causes the
497 idle state entry request to be rejected, in which case the ``CPUIdle`` driver
499 and :file:`rejected` files report the number of times the given idle state
502 .. _cpu-pm-qos:
509 energy-efficiency features of the kernel to prevent performance from dropping
512 CPU idle time management can be affected by PM QoS in two ways, through the
518 signed 32-bit integer) to it. In turn, the resume latency constraint for a CPU
520 32-bit integer) to the :file:`power/pm_qos_resume_latency_us` file under
572 CPU idle time governors are expected to regard the minimum of the global
574 the given CPU as the upper limit for the exit latency of the idle states that
575 they are allowed to select for that CPU. They should never select any idle
579 Idle States Control Via Kernel Command Line
582 In addition to the ``sysfs`` interface allowing individual idle states to be
583 `disabled for individual CPUs <idle-states-representation_>`_, there are kernel
584 command line parameters affecting CPU idle time management.
587 CPU idle time management entirely. It does not prevent the idle loop from
588 running on idle CPUs, but it prevents the CPU idle time governors and drivers
589 from being invoked. If it is added to the kernel command line, the idle loop
590 will ask the hardware to enter idle states on idle CPUs via the CPU architecture
594 however, so it is rather crude and not very energy-efficient. For this reason,
604 The other kernel command line parameters controlling CPU idle time management
609 options related to CPU idle time management: ``idle=poll``, ``idle=halt``,
610 and ``idle=nomwait``. The first two of them disable the ``acpi_idle`` and
612 ``CPUIdle`` subsystem to be disabled and makes the idle loop invoke the
613 architecture support code to deal with idle CPUs. How it does that depends on
615 ``idle=halt`` case, the architecture support code will use the ``HLT``
617 and causes the hardware to attempt to enter the shallowest available idle state)
618 for this purpose, and if ``idle=poll`` is used, idle CPUs will execute a
620 that using ``idle=poll`` is somewhat drastic in many cases, as preventing idle
623 P-states (see |cpufreq|) that require any number of CPUs in a package to be
624 idle, so it very well may hurt single-thread computations performance as well as
625 energy-efficiency. Thus using it for performance reasons may not be a good idea
628 The ``idle=nomwait`` option prevents the use of ``MWAIT`` instruction of
629 the CPU to enter idle states. When this option is used, the ``acpi_idle``
636 In addition to the architecture-level kernel command line options affecting CPU
637 idle time management, there are parameters affecting individual ``CPUIdle``
640 where ``<n>`` is an idle state index also used in the name of the given
641 state's directory in ``sysfs`` (see
642 `Representation of Idle States <idle-states-representation_>`_), causes the
644 idle states deeper than idle state ``<n>``. In that case, they will never ask
645 for any of those idle states or expose them to the governor. [The behavior of