Lines Matching defs:deepest
435 * @node must be the deepest modified node after an update. This function
540 * bfq_find_deepest - find the deepest node that an extraction can modify.
544 * node that will replace @node, and returning the deepest node that
550 struct rb_node *deepest;
553 deepest = rb_parent(node);
555 deepest = node->rb_left;
557 deepest = node->rb_right;
559 deepest = rb_next(node);
560 if (deepest->rb_right)
561 deepest = deepest->rb_right;
562 else if (rb_parent(deepest) != node)
563 deepest = rb_parent(deepest);
566 return deepest;