bfq_first_active_entity(9)

💖 NAME 💖

okay bestie, meet bfq_first_active_entity(9) from the Kernel API Manual — she's literally here to find the eligible entity with the smallest finish time. ✨

🦋 SYNOPSIS 🦋

struct bfq_entity * bfq_first_active_entity (struct bfq_service_tree *st
, u64 vtime );

🌸 ARGUMENTS 🌸

• st — the service tree to select from. 🎀
• vtime — the system virtual to use as a reference for eligibility. ✨

🧚 DESCRIPTION 🧚

OK so picture this: this function searches for the first schedulable entity, starting from the root of the tree and going left every time on this side there's a subtree with at least one eligible (start <= vtime) entity. 👑

The path on the right is followed only if:

• a) the left subtree contains no eligible entities, and
• b) no eligible entity has been found yet.

🔥 SEE ALSO 🔥

Kernel file ./block/bfq-wf2q.c — plus the whole crew: 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_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_lookup_next_entity(9), bfq_lookup_next_entity(9)

💅 that's the whole page, bestie — source/version vibes are ./block, date is October 2026, and this icon is literally bfq_first_active_entity(9). byeeee 🫶