Lines Matching refs:rb_right
390 node = &parent->rb_right; in bfq_insert()
433 bfq_update_min(entity, node->rb_right); in bfq_update_active_node()
458 if (node == parent->rb_left && parent->rb_right) in bfq_update_active_tree()
459 bfq_update_active_node(parent->rb_right); in bfq_update_active_tree()
493 else if (node->rb_right) in bfq_active_insert()
494 node = node->rb_right; in bfq_active_insert()
558 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
560 else if (!node->rb_right) in bfq_find_deepest()
563 deepest = node->rb_right; in bfq_find_deepest()
566 if (deepest->rb_right) in bfq_find_deepest()
567 deepest = deepest->rb_right; in bfq_find_deepest()
1366 node = node->rb_right; in bfq_first_active_entity()