rust/compiler/rustc_query_system/src/dep_graph/query.rs, branch 1.88.0

Rename `graph::implementation::Graph` to `LinkedGraph`

2025-05-06T04:35:06+00:00

Reformat using the new identifier sorting from rustfmt

2024-09-22T23:11:29+00:00

Move `DepKind` to `rustc_query_system` and define it as `u16`

2023-09-21T15:06:14+00:00

Split `{Idx, IndexVec, IndexSlice}` into their own modules

2023-04-24T13:53:35+00:00

Various minor Idx-related tweaks

2023-04-16T09:42:50+00:00

Nothing particularly exciting here, but a couple of things I noticed as I was looking for more index conversions to simplify.

Address review.

2021-03-30T16:10:08+00:00

Fix tests.

2021-03-30T16:10:06+00:00

Avoid invoking queries inside `check_paths`, since we are holding a lock to the reconstructed graph.

Stream the dep-graph to a file.

2021-03-30T16:09:59+00:00

Remove (lots of) dead code

2021-03-28T02:16:33+00:00

Found with https://github.com/est31/warnalyzer. Dubious changes: - Is anyone else using rustc_apfloat? I feel weird completely deleting x87 support. - Maybe some of the dead code in rustc_data_structures, in case someone wants to use it in the future? - Don't change rustc_serialize I plan to scrap most of the json module in the near future (see https://github.com/rust-lang/compiler-team/issues/418) and fixing the tests needed more work than I expected. TODO: check if any of the comments on the deleted code should be kept.

rustc_query_system: use more space-efficient edges representation

2020-12-22T22:12:57+00:00

Use single vector of edges rather than per-node vector. There is a small hit to instruction counts (< 0.5%), but the memory savings make up for it.