bfq_find_deepest(9)

🌸 NAME 🌸

Okay bestie, welcome to the bfq_find_deepest(9) page from the Kernel API Manual — yes, we're in kernel API land and it's lowkey iconic. This one is all about bfq_find_deepest — find the deepest node that an extraction can modify. ✨

🦋 SYNOPSIS 🦋

struct rb_node * bfq_find_deepest (struct rb_node *node );

🎀 ARGUMENTS 🎀

• node — the node being removed. That's the one we're looking at, bestie. 💅

💖 DESCRIPTION 💖

So here's the vibe: this function does the first step of an extraction in an rb tree. It's looking for the node that will replace node, and it returns the deepest node that the following modifications to the tree can touch. 👑

And if node is the last node in the tree? It returns NULL. That's it, that's the whole mood. No cap.

👀 SEE ALSO 👀

Kernel file: ./block/bfq-wf2q.c

• bfq_gt(9)
• bfq_update_next_in_service(9)
• bfq_delta(9)
• bfq_calc_finish(9)
• bfq_entity_of(9)
• bfq_extract(9)
• bfq_idle_extract(9)
• bfq_insert(9)
• bfq_update_min(9)
• bfq_update_active_node(9)
• bfq_update_active_tree(9)
• bfq_active_insert(9)
• bfq_ioprio_to_weight(9)
• bfq_weight_to_ioprio(9)
• bfq_active_extract(9)
• bfq_idle_insert(9)
• bfq_forget_entity(9)
• bfq_put_idle_entity(9)
• bfq_forget_idle(9)
• bfq_bfqq_served(9)
• bfq_bfqq_charge_time(9)
• __bfq_activate_entity(9)
• __bfq_requeue_entity(9)
• bfq_activate_requeue_entity(9)
• __bfq_deactivate_entity(9)
• bfq_deactivate_entity(9)
• bfq_calc_vtime_jump(9)
• bfq_first_active_entity(9)
• __bfq_lookup_next_entity(9)
• bfq_lookup_next_entity(9)

That's the whole page, bestie! Signing off from ./block, October 2026, on the bfq_find_deepest(9) page — stay deep, stay iconic 💅✨