Lines Matching defs:state
22 * idle state with target residency within the (known) time till the closest
36 * an idle state for it accordingly.
42 * the second idle state (idle state 1), the second bin spans from the target
43 * residency of idle state 1 up to, but not including, the target residency of
44 * idle state 2, the third bin spans from the target residency of idle state 2
45 * up to, but not including, the target residency of idle state 3 and so on.
46 * The last bin spans from the target residency of the deepest idle state
50 * They are updated every time before selecting an idle state for the given CPU
58 * sleep length that the bin it falls into corresponds to an idle state
66 * In order to select an idle state for a CPU, the governor takes the following
70 * 1. Find the deepest CPU idle state whose target residency does not exceed
71 * the current sleep length (the candidate idle state) and compute 3 sums as
74 * - The sum of the "hits" and "intercepts" metrics for the candidate state
89 * for an alternative idle state to select.
102 * 1 (which means that the target residency of the state in question had
104 * select the given idle state instead of the candidate one.
106 * 3. By default, select the candidate state.
112 * state selection - utilized and not utilized.
118 * be woken up to do more work soon and so a shallower idle state should be
121 * available idle state should be preferred to take advantage of the power
129 * Before selecting the next idle state, the governor compares the current CPU
131 * TEO metrics mechanism. If it's above, the closest shallower idle state will
132 * be selected instead, as long as is not a polling state.
184 * @time_span_ns: Time between idle state selection and post-wakeup update.
186 * @state_bins: Idle state data bins for this CPU.
225 * @drv: cpuidle driver containing state data.
238 * enough to the closest timer event expected at the idle state
297 * If the deepest state's target residency is below the tick length,
300 * beyond the last state-related one.
342 * teo_find_shallower_state - Find shallower idle state matching given duration.
343 * @drv: cpuidle driver containing state data.
345 * @state_idx: Index of the capping idle state.
368 * teo_select - Selects the next idle state to enter.
369 * @drv: cpuidle driver containing state data.
418 * the shallowest non-polling state and exit.
422 * If state 0 is enabled and it is not a polling one, select it
425 * enough state in case it is not woken up any time soon after
426 * all. If state 1 is disabled, though, state 0 must be used
434 /* Assume that state 1 is not a polling one and use it. */
446 * Update the sums of idle state mertics for all of the states
457 idx0 = i; /* first enabled state */
464 /* Save the sums for the current state. */
478 * Only one idle state is enabled, so use it, but do not
491 * sum of the intercepts and hits metrics for the candidate state and
495 * account, a shallower idle state is likely to be a better choice.
503 * Look for the deepest idle state whose target residency had
524 * Use the current state unless it is too
526 * first enabled state that is deep enough.
542 * The current state is too shallow, but if an
543 * alternative candidate state has been found,
558 * idle state shallower than the current candidate one.
565 * non-polling state to improve latency, unless the scheduler tick has
566 * been stopped already and the shallower state's target residency is
576 * Skip the timers check if state 0 is the current candidate one,
583 * If state 0 is a polling one, check if the target residency of
584 * the current candidate state is low enough and skip the timers
596 * candidate state, a shallower one needs to be found.
605 * If the selected state's target residency is below the tick length
615 * Allow the tick to be stopped unless the selected state is a polling
625 * the state to be returned is not within the time till the closest
640 * @state: Entered state.
642 static void teo_reflect(struct cpuidle_device *dev, int state)
646 dev->last_state_idx = state;