rust/compiler/rustc_data_structures/src/graph, branch 1.86.0https://github.com/rust-lang/rust
http://git.dreamy.place/mirrors/rust/atom?h=1.86.02025-02-08T22:12:13+00:00Rustfmt2025-02-08T22:12:13+00:00bjorn317426603+bjorn3@users.noreply.github.com2025-02-08T22:12:13+00:00urn:sha1:1fcae03369abb4c2cc180cd5a49e1f4440a81300Incorporate `iter_nodes` into `graph::DirectedGraph`2025-01-26T03:08:42+00:00ZalatharZalathar@users.noreply.github.com2025-01-26T03:00:46+00:00urn:sha1:d36e2b88d643b3d712c6e2d22b4b0d77fea07209
This assumes that the set of valid node IDs is exactly `0..num_nodes`.
In practice, we have a lot of graph-algorithm code that already assumes that
nodes are densely numbered, by using `num_nodes` to allocate per-node indexed
data structures.
coverage: Completely overhaul counter assignment, using node-flow graphs2025-01-16T11:07:18+00:00ZalatharZalathar@users.noreply.github.com2025-01-12T10:36:07+00:00urn:sha1:f1300c860e6ff4e024f0a347b87f94e36785ce49Add wrapper type `ReversedGraph` for swapping successors/predecessors2025-01-14T12:49:10+00:00ZalatharZalathar@users.noreply.github.com2025-01-12T01:40:03+00:00urn:sha1:1a23a6fd8b27943ffdbac2d5e4eb088cdecb06ffrename `BitSet` to `DenseBitSet`2025-01-11T11:34:01+00:00Rémy Rakicremy.rakic+github@gmail.com2025-01-07T15:19:05+00:00urn:sha1:a13354bea05968799a5be5521691322274fa6a9e
This should make it clearer that this bitset is dense, with the
advantages and disadvantages that it entails.
Replace an FTP link in comments with an equivalent HTTPS link2024-10-24T06:02:11+00:00ZalatharZalathar@users.noreply.github.com2024-10-24T05:59:59+00:00urn:sha1:3dfc35214509e969cfeec76380af427881a36aa9Move `cmp_in_dominator_order` out of graph dominator computation2024-10-22T09:44:09+00:00ZalatharZalathar@users.noreply.github.com2024-10-22T02:31:54+00:00urn:sha1:7f4dd9bb815182a1b60242d82890f9b0b3273c4b
Dominator-order information is only needed for coverage graphs, and is easy
enough to collect by just traversing the graph again.
This avoids wasted work when computing graph dominators for any other purpose.
Reformat using the new identifier sorting from rustfmt2024-09-22T23:11:29+00:00Michael Gouletmichael@errs.io2024-09-22T23:05:04+00:00urn:sha1:c682aa162b0d41e21cc6748f4fecfe01efb69d1fchore: Fix typos in 'compiler' (batch 1)2024-09-02T05:42:38+00:00Alexander Cyonalex.cyon@gmail.com2024-09-02T05:42:38+00:00urn:sha1:ac69544a175d692dd623fb854261ca64b1b9b802Use assert_matches around the compiler2024-08-11T16:25:39+00:00Michael Gouletmichael@errs.io2024-08-11T16:10:36+00:00urn:sha1:c361c924a08c2e34c705ec3ee1ad2099315338d8