No Queue At All: rustc's Dataflow Engine Uses a Bitset and a Rank
The rustc dataflow framework replaces the classic worklist with a min-rank dirty bitset over reverse postorder, guaranteeing that loop-free code is analysed in exactly one pass.
The rustc dataflow framework replaces the classic worklist with a min-rank dirty bitset over reverse postorder, guaranteeing that loop-free code is analysed in exactly one pass.