Lines Matching refs:rb_left
382 node = &parent->rb_left; in bfq_insert()
428 bfq_update_min(entity, node->rb_left); in bfq_update_active_node()
452 if (node == parent->rb_left && parent->rb_right) in bfq_update_active_tree()
454 else if (parent->rb_left) in bfq_update_active_tree()
455 bfq_update_active_node(parent->rb_left); in bfq_update_active_tree()
485 if (node->rb_left) in bfq_active_insert()
486 node = node->rb_left; in bfq_active_insert()
552 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
555 deepest = node->rb_left; in bfq_find_deepest()
556 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()