Struct Scheduler 

pub(crate) struct Scheduler<'a> {
    pub(crate) skel: BpfSkel<'a>,
    pub(crate) struct_ops: Option<Link>,
    pub(crate) _irq_links: Vec<Link>,
    pub(crate) probe_on: bool,
    pub(crate) frame_bucket: Option<u32>,
    pub(crate) frame_period: u64,
    pub(crate) slow_polls: u32,
    pub(crate) frame_floor: u64,
    pub(crate) verbose: bool,
    pub(crate) sinks: SinkMonitor,
    pub(crate) sinks_logged: bool,
}

Fields

skel: BpfSkel<'a>

struct_ops: Option<Link>

_irq_links: Vec<Link>

Handler-edge tracepoint links (§G35); dropped on exit with the rest.

probe_on: bool

Diagnostics on (–toggle probe=1): census, hold attribution, black box.

frame_bucket: Option<u32>

Frame-clock incumbent bucket, held against near-ties (§R.22).

frame_period: u64

Last published period; the reference for slow-direction hysteresis.

slow_polls: u32

Consecutive polls a slower candidate has won; slow switches need agreement, fast ones are instant (§G27.1).

frame_floor: u64

Pessimistic frame estimate: fast down, slow up. Feeds the slice cap, which must not widen when the mode wobbles (§G18).

verbose: bool

Print runtime diagnostics. Off by default: a release run is not a measurement session, and a scheduler logging into a game is noise.

sinks: SinkMonitor

Live IRQ-sink tracking state (§G30, §G33).

sinks_logged: bool

The first live sink set completes the startup banner at INFO; later changes are diagnostics and follow –verbose.

Implementations

impl<'a> Scheduler<'a>

pub(crate) fn init( opts: &Opts, open_object: &'a mut MaybeUninit<OpenObject>, ) -> Result<Self>

pub(crate) fn exited(&mut self) -> bool

pub(crate) fn run(&mut self, shutdown: Arc<AtomicBool>) -> Result<UserExitInfo>

pub(crate) fn publish_sinks(&mut self, set: &[bool])

Push a changed sink set live: rewrite the per-CPU flags, then bump the generation so the next ranked pick rebuilds the nonsink mask (§G30). Flags settle before the bump; a torn read costs at most one extra rebuild.

pub(crate) fn publish_frame_clock(&mut self) -> u64

Publish the binding cadence from the vote histogram.

Every crowd near the biggest is a REAL cadence (a game plus the desktop coexist legitimately), so no argmax: the FASTEST real crowd is published, because every consumer of the clock is a bound and the fastest cadence is the one that binds. The clock moves faster the moment a faster crowd qualifies; it moves slower only when the fast crowd actually fades — one noisy poll cannot drag it slower (§G27.1). Buckets are cleared as read; sum/count keeps the value exact. Returns the published period, 0 when there are no votes.