Lines Matching refs:rb_left
385 node = &parent->rb_left; in bfq_insert()
431 bfq_update_min(entity, node->rb_left); in bfq_update_active_node()
455 if (node == parent->rb_left && parent->rb_right) in bfq_update_active_tree()
457 else if (parent->rb_left) in bfq_update_active_tree()
458 bfq_update_active_node(parent->rb_left); in bfq_update_active_tree()
488 if (node->rb_left) in bfq_active_insert()
489 node = node->rb_left; in bfq_active_insert()
555 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
558 deepest = node->rb_left; in bfq_find_deepest()
559 else if (!node->rb_left) in bfq_find_deepest()
1362 if (node->rb_left) { in bfq_first_active_entity()
1363 entry = rb_entry(node->rb_left, in bfq_first_active_entity()
1366 node = node->rb_left; in bfq_first_active_entity()