-
Notifications
You must be signed in to change notification settings - Fork 12.9k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Auto merge of #118787 - GuillaumeGomez:rollup-fj5wr3q, r=GuillaumeGomez
Rollup of 5 pull requests Successful merges: - #117966 (add safe compilation options) - #118747 (Remove extra check cfg handled by libc directly) - #118774 (add test for inductive cycle hangs) - #118775 (chore: add test case for type with generic) - #118782 (use `&` instead of start-process in x.ps1) r? `@ghost` `@rustbot` modify labels: rollup
- Loading branch information
Showing
12 changed files
with
152 additions
and
25 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
4 changes: 2 additions & 2 deletions
4
tests/ui/traits/new-solver/cycles/coinduction/fixpoint-exponential-growth.stderr
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
33 changes: 33 additions & 0 deletions
33
tests/ui/traits/new-solver/cycles/inductive-fixpoint-hang.rs
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,33 @@ | ||
// compile-flags: -Ztrait-solver=next | ||
|
||
// This currently hangs if we do not erase constraints from | ||
// overflow. | ||
// | ||
// We set the provisional result of `W<?0>` to `?0 := W<_>`. | ||
// The next iteration does not simply result in a `?0 := W<W<_>` constraint as | ||
// one might expect, but instead each time we evaluate the nested `W<T>` goal we | ||
// apply the previously returned constraints: the first fixpoint iteration goes | ||
// as follows: `W<?1>: Trait` constrains `?1` to `W<?2>`, we then evaluate | ||
// `W<W<?2>>: Trait` the next time we try to prove the nested goal. This results | ||
// inn `W<W<W<?3>>>` and so on. This goes on until we reach overflow in | ||
// `try_evaluate_added_goals`. This means the provisional result after the | ||
// second fixpoint iteration is already `W<W<W<...>>>` with a size proportional | ||
// to the number of steps in `try_evaluate_added_goals`. The size then continues | ||
// to grow. The exponential blowup from having 2 nested goals per impl causes | ||
// the solver to hang without hitting the recursion limit. | ||
trait Trait {} | ||
|
||
struct W<T: ?Sized>(*const T); | ||
|
||
impl<T: ?Sized> Trait for W<W<T>> | ||
where | ||
W<T>: Trait, | ||
W<T>: Trait, | ||
{} | ||
|
||
fn impls_trait<T: Trait>() {} | ||
|
||
fn main() { | ||
impls_trait::<W<_>>(); | ||
//~^ ERROR overflow evaluating the requirement | ||
} |
16 changes: 16 additions & 0 deletions
16
tests/ui/traits/new-solver/cycles/inductive-fixpoint-hang.stderr
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,16 @@ | ||
error[E0275]: overflow evaluating the requirement `W<_>: Trait` | ||
--> $DIR/inductive-fixpoint-hang.rs:31:19 | ||
| | ||
LL | impls_trait::<W<_>>(); | ||
| ^^^^ | ||
| | ||
= help: consider increasing the recursion limit by adding a `#![recursion_limit = "256"]` attribute to your crate (`inductive_fixpoint_hang`) | ||
note: required by a bound in `impls_trait` | ||
--> $DIR/inductive-fixpoint-hang.rs:28:19 | ||
| | ||
LL | fn impls_trait<T: Trait>() {} | ||
| ^^^^^ required by this bound in `impls_trait` | ||
|
||
error: aborting due to 1 previous error | ||
|
||
For more information about this error, try `rustc --explain E0275`. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters