Lines Matching refs:rb_left
388 node = &parent->rb_left; in bfq_insert()
434 bfq_update_min(entity, node->rb_left); in bfq_update_active_node()
458 if (node == parent->rb_left && parent->rb_right) in bfq_update_active_tree()
460 else if (parent->rb_left) in bfq_update_active_tree()
461 bfq_update_active_node(parent->rb_left); in bfq_update_active_tree()
491 if (node->rb_left) in bfq_active_insert()
492 node = node->rb_left; in bfq_active_insert()
558 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
561 deepest = node->rb_left; in bfq_find_deepest()
562 else if (!node->rb_left) in bfq_find_deepest()
1356 if (node->rb_left) { in bfq_first_active_entity()
1357 entry = rb_entry(node->rb_left, in bfq_first_active_entity()
1360 node = node->rb_left; in bfq_first_active_entity()