Lines Matching refs:rb_right
384 node = &parent->rb_right; in bfq_insert()
427 bfq_update_min(entity, node->rb_right); in bfq_update_active_node()
452 if (node == parent->rb_left && parent->rb_right) in bfq_update_active_tree()
453 bfq_update_active_node(parent->rb_right); in bfq_update_active_tree()
487 else if (node->rb_right) in bfq_active_insert()
488 node = node->rb_right; in bfq_active_insert()
552 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
554 else if (!node->rb_right) in bfq_find_deepest()
557 deepest = node->rb_right; in bfq_find_deepest()
560 if (deepest->rb_right) in bfq_find_deepest()
561 deepest = deepest->rb_right; in bfq_find_deepest()
1372 node = node->rb_right; in bfq_first_active_entity()