do an actual link to detect if it breaks in future (#1517)

Co-authored-by: Noah Lev <camelidcamel@gmail.com>
This commit is contained in:
Tshepang Mbambo 2022-11-27 02:49:21 +02:00 committed by GitHub
parent 010ab13460
commit 276717e9e4
1 changed files with 5 additions and 5 deletions

View File

@ -175,11 +175,12 @@ fn try_mark_green(tcx, current_node) -> bool {
true true
} }
// Note: The actual implementation can be found in
// compiler/rustc_query_system/src/dep_graph/graph.rs
``` ```
> NOTE:
> The actual implementation can be found in
> [`compiler/rustc_query_system/src/dep_graph/graph.rs`][try_mark_green]
By using red-green marking we can avoid the devastating cumulative effect of By using red-green marking we can avoid the devastating cumulative effect of
having false positives during change detection. Whenever a query is executed having false positives during change detection. Whenever a query is executed
in incremental mode, we first check if its already green. If not, we run in incremental mode, we first check if its already green. If not, we run
@ -187,7 +188,6 @@ in incremental mode, we first check if its already green. If not, we run
invoke the query provider to re-compute the result. invoke the query provider to re-compute the result.
## The Real World: How Persistence Makes Everything Complicated ## The Real World: How Persistence Makes Everything Complicated
The sections above described the underlying algorithm for incremental The sections above described the underlying algorithm for incremental
@ -533,5 +533,5 @@ be reusable. See <https://github.com/rust-lang/rust/issues/47389> for more
information. information.
[query-model]: ./query-evaluation-model-in-detail.html [query-model]: ./query-evaluation-model-in-detail.html
[try_mark_green]: https://doc.rust-lang.org/nightly/nightly-rustc/src/rustc_query_system/dep_graph/graph.rs.html