Lines Matching defs:index
130 * Return: the index of the deepest available idle state.
141 struct cpuidle_device *dev, int index)
143 struct cpuidle_state *target_state = &drv->states[index];
162 target_state->enter_s2idle(dev, drv, index);
174 dev->states_usage[index].s2idle_time += ktime_us_delta(time_end, time_start);
175 dev->states_usage[index].s2idle_usage++;
189 int index;
196 index = find_deepest_state(drv, dev, U64_MAX, 0, true);
197 if (index > 0) {
198 enter_s2idle_proper(drv, dev, index);
201 return index;
209 * @index: index into the states table in @drv of the state to enter
213 int index)
217 struct cpuidle_state *target_state = &drv->states[index];
229 index = find_deepest_state(drv, dev, target_state->exit_latency_ns,
231 if (index < 0) {
235 target_state = &drv->states[index];
245 trace_cpu_idle(index, dev->cpu);
267 entered_state = target_state->enter(dev, drv, index);
288 if (!cpuidle_state_is_coupled(drv, index))
335 dev->states_usage[index].rejected++;
350 * Returns the index of the idle state. The return value must not be negative.
367 * @index: the index in the idle state table
369 * Returns the index in the idle state, < 0 in case of error.
373 int index)
385 if (cpuidle_state_is_coupled(drv, index))
386 ret = cpuidle_enter_state_coupled(dev, drv, index);
388 ret = cpuidle_enter_state(dev, drv, index);
399 * @index: the index in the idle state table
402 void cpuidle_reflect(struct cpuidle_device *dev, int index)
404 if (cpuidle_curr_governor->reflect && index >= 0)
405 cpuidle_curr_governor->reflect(dev, index);