rust/compiler/rustc_data_structures/src/graph at 505dabc2a06f70708e2cd825afe9e5e215cfd699 - rust

mirror of https://github.com/rust-lang/rust.git synced 2026-04-28 03:07:24 +03:00

Files

T

Stuart Cook 76b769c8ad Rollup merge of #152621 - petrochenkov:graph2, r=Zalathar

LinkedGraph: support adding nodes and edges in arbitrary order

If an edge uses some not-yet-known node, we just leave the node's data empty, that data can be added later.

Use this support to avoid skipping edges in RetainedDepGraph.

This is continuation of https://github.com/rust-lang/rust/pull/152590, that PR just fixes the ICE, this PR also preserves all the edges in debug dumps.
This is also a minimized version of https://github.com/rust-lang/rust/pull/151821 with a smaller amount of data structure hacks.

2026-03-14 17:30:22 +11:00

dominators

Rustfmt

2025-02-08 22:12:13 +00:00

iterate

coverage: Completely overhaul counter assignment, using node-flow graphs

2025-01-16 22:07:18 +11:00

linked_graph

LinkedGraph: support adding nodes and edges in arbitrary order

2026-02-22 10:53:56 +03:00

scc

Remove the rustc_data_structures::assert_matches! re-exports