mirror
/
rustc-dev-guide
mirror of https://github.com/rust-lang/rustc-dev-guide.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Link ref to edge concept in graph theory

This commit is contained in:
Lzu Tao 2020-08-17 19:51:38 +07:00 committed by Joshua Nelson
parent 369ec46a1b
commit 8effbe65b6
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
src/queries/incremental-compilation.md
View File

@ -12,7 +12,7 @@ called the **red-green** algorithm[^salsa]. The high-level idea is
that, after each run of the compiler, we will save the results of all that, after each run of the compiler, we will save the results of all
the queries that we do, as well as the **query DAG**. The the queries that we do, as well as the **query DAG**. The
**query DAG** is a [DAG] that indexes which queries executed which **query DAG** is a [DAG] that indexes which queries executed which
other queries. So, for example, there would be an edge from a query Q1 other queries. So, for example, there would be an [edge] from a query Q1
to another query Q2 if computing Q1 required computing Q2 (note that to another query Q2 if computing Q1 required computing Q2 (note that
because queries cannot depend on themselves, this results in a DAG and because queries cannot depend on themselves, this results in a DAG and
not a general graph). not a general graph).
@ -145,4 +145,5 @@ for this system.
[^salsa]: I have long wanted to rename it to the Salsa algorithm, but it never caught on. -@nikomatsakis [^salsa]: I have long wanted to rename it to the Salsa algorithm, but it never caught on. -@nikomatsakis
[edge]: https://en.wikipedia.org/wiki/Glossary_of_graph_theory_terms#edge
[initial-design]: https://github.com/nikomatsakis/rustc-on-demand-incremental-design-doc/blob/master/0000-rustc-on-demand-and-incremental.md [initial-design]: https://github.com/nikomatsakis/rustc-on-demand-incremental-design-doc/blob/master/0000-rustc-on-demand-and-incremental.md