bfq_active_insert(9)

bfq_active_insert(9) — Kernel API Manual, bestie ✨

Okay so this is the Kernel API Manual page for bfq_active_insert, and we're inserting an entity into the active tree of its group/device. Very demure, very tree-core. 🎀

---

🌸 NAME 🌸

bfq_active_insert — insert an entity in the active tree of its group/device. That's the whole assignment, and it ate. 💅

---

✨ SYNOPSIS ✨

void bfq_active_insert (struct bfq_service_tree *st , struct bfq_entity
*entity );

---

🫶 ARGUMENTS 🫶

• st — the service tree of the entity. Like, the tree it belongs to. 🌳
• entity — the entity being inserted. The main character of this function call, fr fr. 👑

---

💅 DESCRIPTION 💅

Okay so the active tree is ordered by finish time, but an extra key is kept per each node. That key contains the minimum value for the start times of its children (and the node itself), so it's possible to search for the eligible node with the lowest finish time in logarithmic time. Iconic little data-structure moment, no cap. 🔥

---

👑 SEE ALSO 👑

Kernel file ./block/bfq-wf2q.c, plus all these related besties:

• 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_ioprio_to_weight(9)
• bfq_weight_to_ioprio(9)
• bfq_find_deepest(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)

---

💖 annnnd that's the page, bestie — source ./block, dated October 2026, and the manual name is bfq_active_insert(9). Go forth and insert responsibly. Mwah! 💅✨