Lines Matching refs:rb_left
364 node = &parent->rb_left; in bfq_insert()
410 bfq_update_min(entity, node->rb_left); in bfq_update_active_node()
434 if (node == parent->rb_left && parent->rb_right) in bfq_update_active_tree()
436 else if (parent->rb_left) in bfq_update_active_tree()
437 bfq_update_active_node(parent->rb_left); in bfq_update_active_tree()
467 if (node->rb_left) in bfq_active_insert()
468 node = node->rb_left; in bfq_active_insert()
534 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
537 deepest = node->rb_left; in bfq_find_deepest()
538 else if (!node->rb_left) in bfq_find_deepest()
1344 if (node->rb_left) { in bfq_first_active_entity()
1345 entry = rb_entry(node->rb_left, in bfq_first_active_entity()
1348 node = node->rb_left; in bfq_first_active_entity()