Lines Matching refs:rb_left
390 node = &parent->rb_left; in bfq_insert()
436 bfq_update_min(entity, node->rb_left); in bfq_update_active_node()
460 if (node == parent->rb_left && parent->rb_right) in bfq_update_active_tree()
462 else if (parent->rb_left) in bfq_update_active_tree()
463 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()
548 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
551 deepest = node->rb_left; in bfq_find_deepest()
552 else if (!node->rb_left) in bfq_find_deepest()
1308 if (node->rb_left) { in bfq_first_active_entity()
1309 entry = rb_entry(node->rb_left, in bfq_first_active_entity()
1312 node = node->rb_left; in bfq_first_active_entity()