have on_completion record subcycles
Rework `on_completion` method so that it removes all
provisional cache entries that are "below" a completed
node (while leaving those entries that are not below
the node).
This corrects an imprecise result that could in turn lead
to an incremental compilation failure. Under the old
scheme, if you had:
* A depends on...
* B depends on A
* C depends on...
* D depends on C
* T: 'static
then the provisional results for A, B, C, and D would all
be entangled. Thus, if A was `EvaluatedToOkModuloRegions`
(because of that final condition), then the result for C and
D would also be demoted to "ok modulo regions".
In reality, though, the result for C depends only on C and itself,
and is not dependent on regions. If we happen to evaluate the
cycle starting from C, we would never reach A, and hence the
result would be "ok".
Under the new scheme, the provisional results for C and D
are moved to the permanent cache immediately and are not affected
by the result of A.
2021-05-11 09:40:42 +00:00
|
|
|
#![feature(rustc_attrs)]
|
|
|
|
|
|
|
|
// Test for a particular corner case where the evaluation
|
|
|
|
// cache can get out of date. The problem here is that
|
|
|
|
// when we cache C, we have observed that it reaches
|
|
|
|
// to depth 2 (the node for B), but we later realize
|
|
|
|
// that B itself depends on A (reached depth 0). We
|
|
|
|
// failed to update the depth for C transitively, which
|
|
|
|
// resulted in an assertion failure when it was referenced
|
|
|
|
// from D.
|
|
|
|
//
|
|
|
|
// A (reached depth 0)
|
|
|
|
// E
|
|
|
|
// B // depth 2 -- reached depth = 0
|
|
|
|
// C // depth 3 -- reached depth = 2 (should be 0)
|
|
|
|
// B
|
|
|
|
// A // depth 0
|
|
|
|
// D (depth 1)
|
|
|
|
// C (cache -- reached depth = 2)
|
|
|
|
|
|
|
|
struct A {
|
|
|
|
e: E,
|
|
|
|
d: C,
|
|
|
|
}
|
|
|
|
|
|
|
|
struct E {
|
|
|
|
b: B,
|
|
|
|
}
|
|
|
|
|
|
|
|
struct B {
|
|
|
|
a: Option<Box<A>>,
|
|
|
|
c: C,
|
|
|
|
}
|
|
|
|
|
|
|
|
struct C {
|
|
|
|
b: Option<Box<B>>,
|
|
|
|
}
|
|
|
|
|
|
|
|
#[rustc_evaluate_where_clauses]
|
|
|
|
fn test<X: ?Sized + Send>() {}
|
|
|
|
|
|
|
|
fn main() {
|
|
|
|
test::<A>();
|
2023-06-19 13:39:55 +00:00
|
|
|
//~^ ERROR evaluate(Binder { value: TraitPredicate(<A as std::marker::Send>, polarity:Positive), bound_vars: [] }) = Ok(EvaluatedToOk)
|
have on_completion record subcycles
Rework `on_completion` method so that it removes all
provisional cache entries that are "below" a completed
node (while leaving those entries that are not below
the node).
This corrects an imprecise result that could in turn lead
to an incremental compilation failure. Under the old
scheme, if you had:
* A depends on...
* B depends on A
* C depends on...
* D depends on C
* T: 'static
then the provisional results for A, B, C, and D would all
be entangled. Thus, if A was `EvaluatedToOkModuloRegions`
(because of that final condition), then the result for C and
D would also be demoted to "ok modulo regions".
In reality, though, the result for C depends only on C and itself,
and is not dependent on regions. If we happen to evaluate the
cycle starting from C, we would never reach A, and hence the
result would be "ok".
Under the new scheme, the provisional results for C and D
are moved to the permanent cache immediately and are not affected
by the result of A.
2021-05-11 09:40:42 +00:00
|
|
|
}
|