Searched refs:deepest (Results 1 – 7 of 7) sorted by relevance
546 struct rb_node *deepest; in bfq_find_deepest() local549 deepest = rb_parent(node); in bfq_find_deepest()551 deepest = node->rb_left; in bfq_find_deepest()553 deepest = node->rb_right; in bfq_find_deepest()555 deepest = rb_next(node); in bfq_find_deepest()556 if (deepest->rb_right) in bfq_find_deepest()557 deepest = deepest->rb_right; in bfq_find_deepest()558 else if (rb_parent(deepest) != node) in bfq_find_deepest()559 deepest = rb_parent(deepest); in bfq_find_deepest()562 return deepest; in bfq_find_deepest()
17 the deepest idle states you will need to ensure that you are
14 - libcpupower (optional, for --deepest-idle-state)
60 $(info libcpupower is missing, building without --deepest-idle-state support.)
117 self.deepest = 0
102 into the deepest available idle state. While doing that, each of them
35 working state), such that the processors can spend time in their deepest idle