pub fn list_schedule(g: &DepGraph, latencies: &[u8]) -> Vec<usize>Expand description
LIST SCHEDULER — the scheduler engine. Given the sound dependency DAG and per-instruction latencies, produce a new instruction order that respects every hazard while placing latency-critical work early so its result is ready by the time a consumer needs it (classic critical-path list scheduling). Returns the new order as original-instruction indices. This is what a re-emitter writes back to close the gap ptxas’s schedule leaves.