user0/rust
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
rust/compiler/rustc_middle
History
Jonathan Brouwer 3f3c6fda3d
Rollup merge of #152590 - petrochenkov:skipedge, r=mati865 
DepGraphQuery: correctly skip adding edges with not-yet-added nodes

Fixes https://github.com/rust-lang/rust/issues/142152.

The current logic already skips some edges, so I'm not sure how critical it is to have *all* the edges recorded, the logic seems to only be used for debug dumping.
Recording all edges requires supporting holes in the `LinkedGraph` data structure, to add nodes and edges out of order, https://github.com/rust-lang/rust/pull/151821 implements that at cost of complicating the data structure.
2026-02-14 18:55:38 +01:00
..
src Rollup merge of #152590 - petrochenkov:skipedge, r=mati865 2026-02-14 18:55:38 +01:00
Cargo.toml Move rustc_query_system::query::job to rustc_middle. 2026-02-14 18:33:13 +11:00
README.md mv compiler to compiler/ 2020-08-30 18:45:07 +03:00

README.md

For more information about how rustc works, see the rustc dev guide.