| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2024-06-06 | Uplift TypeError | Michael Goulet | -7/+0 | |
| 2024-06-06 | Make middle not rely on next_trait_solver | Michael Goulet | -4/+4 | |
| 2024-06-05 | Fully implement `ConstArgHasType` | Boxy | -0/+2 | |
| 2024-05-24 | remove proof tree formatter, make em shallow | lcnr | -3/+3 | |
| 2024-05-20 | move global cache lookup into fn | lcnr | -16/+18 | |
| 2024-05-18 | Uplift inspect into rustc_type_ir | Michael Goulet | -516/+14 | |
| 2024-05-18 | Uplift GenericArgKind, CanonicalVarValues, QueryInput | Michael Goulet | -31/+5 | |
| and make NestedGoals generic | ||||
| 2024-05-16 | Uplift Goal to rustc_type_ir | Michael Goulet | -27/+2 | |
| 2024-05-16 | Rename ToPredicate for Upcast | Michael Goulet | -8/+8 | |
| 2024-05-13 | Use a proper probe for shadowing impl | Michael Goulet | -0/+5 | |
| 2024-05-11 | Consolidate obligation cause codes for where clauses | Michael Goulet | -16/+9 | |
| 2024-05-10 | Name tweaks | Michael Goulet | -7/+7 | |
| 2024-05-10 | More rename fallout | Michael Goulet | -18/+19 | |
| 2024-05-10 | Rename some ObligationCauseCode variants | Michael Goulet | -27/+20 | |
| 2024-05-10 | Remove glob imports for ObligationCauseCode | Michael Goulet | -11/+12 | |
| 2024-05-06 | Record impl args in the InsepctCandiate rather than rematching during select | Michael Goulet | -0/+5 | |
| 2024-05-02 | Higher ranked goal source, do overflow handling less badly | Michael Goulet | -0/+3 | |
| 2024-04-30 | Rollup merge of #124511 - nnethercote:rm-extern-crates, r=fee1-dead | Matthias Krüger | -2/+11 | |
| Remove many `#[macro_use] extern crate foo` items This requires the addition of more `use` items, which often make the code more verbose. But they also make the code easier to read, because `#[macro_use]` obscures where macros are defined. r? `@fee1-dead` | ||||
| 2024-04-29 | Take proof trees by value in inspect goal | Michael Goulet | -3/+3 | |
| 2024-04-29 | Only register candidate if it is associated w a shallow certainty | Michael Goulet | -4/+4 | |
| 2024-04-29 | Actually use probes when needed and stop relying on existing outer probes | Michael Goulet | -6/+9 | |
| 2024-04-29 | Remove `extern crate smallvec` from a couple of crates. | Nicholas Nethercote | -1/+1 | |
| 2024-04-29 | Remove `extern crate rustc_data_structures` from numerous crates. | Nicholas Nethercote | -1/+1 | |
| 2024-04-29 | Remove `extern crate rustc_macros` from `rustc_middle`. | Nicholas Nethercote | -0/+9 | |
| 2024-04-27 | Record certainty of evaluate_added_goals_and_make_canonical_response call in ↵ | Michael Goulet | -0/+9 | |
| candidate | ||||
| 2024-04-26 | Auto merge of #122385 - lcnr:analyze-obligations-for-infer, r=compiler-errors | bors | -0/+1 | |
| `obligations_for_self_ty`: use `ProofTreeVisitor` for nested goals As always, dealing with proof trees continues to be a hacked together mess. After this PR and #124380 the only remaining blocker for core is https://github.com/rust-lang/trait-system-refactor-initiative/issues/90. There is also a `ProofTreeVisitor` issue causing an ICE when compiling `alloc` which I will handle in a separate PR. This issue likely affects coherence diagnostics more generally. The core idea is to extend the proof tree visitor to support visiting nested candidates without using a `probe`. We then simply recurse into nested candidates if they are the only potentially applicable candidate for a given goal and check whether the self type matches the expected one. For that to work, we need to improve `CanonicalState` to also handle unconstrained inference variables created inside of the trait solver. This is done by extending the `var_values` of `CanoncalState` with each fresh inference variables. Furthermore, we also store the state of all inference variables at the end of each probe. When recursing into `InspectCandidates` we then unify the values of all these states. r? `@compiler-errors` | ||||
| 2024-04-25 | Rollup merge of #124381 - compiler-errors:derived-for-wf, r=lcnr | Michael Goulet | -2/+7 | |
| Renamed `DerivedObligation` to `WellFormedDeriveObligation` It's used when computing `WellFormed` obligations, so let's give it a less ambiguous name. | ||||
| 2024-04-25 | Renamed DerivedObligation to WellFormedDeriveObligation | Michael Goulet | -2/+7 | |
| 2024-04-25 | hir typeck: look into nested goals | lcnr | -0/+1 | |
| uses a `ProofTreeVisitor` to look into nested goals when looking at the pending obligations during hir typeck. Used by closure signature inference, coercion, and for async functions. | ||||
| 2024-04-25 | Check closure args and returns are WF | Michael Goulet | -1/+1 | |
| 2024-04-18 | Auto merge of #124008 - nnethercote:simpler-static_assert_size, r=Nilstrieb | bors | -1/+1 | |
| Simplify `static_assert_size`s. We want to run them on all 64-bit platforms. r? `@ghost` | ||||
| 2024-04-18 | Simplify `static_assert_size`s. | Nicholas Nethercote | -1/+1 | |
| We want to run them on all 64-bit platforms. | ||||
| 2024-04-16 | Avoid lots of `hir::HirId{,Map,Set}` qualifiers. | Nicholas Nethercote | -15/+16 | |
| Because they're a bit redundant. | ||||
| 2024-04-15 | Stop using PolyTraitRef for closure/coroutine predicates already ↵ | Michael Goulet | -3/+2 | |
| instantiated w placeholders | ||||
| 2024-04-08 | Eliminate `DefiningAnchor` now that is just a single-variant enum | Oli Scherer | -30/+1 | |
| 2024-04-08 | Pass list of defineable opaque types into canonical queries | Oli Scherer | -10/+8 | |
| 2024-04-05 | Fix typo | Waffle Maybe | -1/+1 | |
| 2024-04-04 | normalizes-to change from '1' to '0 to inf' steps | lcnr | -10/+5 | |
| 2024-04-03 | Check `x86_64` size assertions on `aarch64`, too | Zalathar | -1/+1 | |
| This makes it easier for contributors on aarch64 workstations (e.g. Macs) to notice when these assertions have been violated. | ||||
| 2024-03-31 | Remove EvaluatedToErrStackDependent | Michael Goulet | -48/+4 | |
| 2024-03-27 | Stop doing expensive work in opt_suggest_box_span eagerly | Michael Goulet | -2/+4 | |
| 2024-03-18 | cleanup + review | lcnr | -13/+4 | |
| 2024-03-18 | `NormalizesTo` return nested goals | lcnr | -2/+21 | |
| 2024-03-14 | eagerly instantiate binders to avoid relying on `sub` | lcnr | -0/+1 | |
| 2024-03-11 | Eliminate `DefiningAnchor::Error`, it is indistinguishable from ↵ | Oli Scherer | -4/+4 | |
| `DefiningAnchor::Bind` with an empty list | ||||
| 2024-03-11 | Make `DefiningAnchor::Bind` only store the opaque types that may be ↵ | Oli Scherer | -6/+12 | |
| constrained, instead of the current infcx root item. This makes `Bind` almost always be empty, so we can start forwarding it to queries, allowing us to remove `Bubble` entirely | ||||
| 2024-03-08 | inspect formatter: add braces | lcnr | -17/+30 | |
| 2024-03-05 | Convert `TypeVisitor` and `DefIdVisitor` to use `VisitorResult` | Jason Newcomb | -14/+6 | |
| 2024-02-29 | distinguish recursion limit based overflow for diagnostics | lcnr | -10/+20 | |
| also change the number of allowed fixpoint steps to be fixed instead of using the `log` of the total recursion depth. | ||||
| 2024-02-28 | Rename `DiagnosticBuilder` as `Diag`. | Nicholas Nethercote | -2/+2 | |
| Much better! Note that this involves renaming (and updating the value of) `DIAGNOSTIC_BUILDER` in clippy. | ||||
 |
index : rust | |
| https://github.com/rust-lang/rust |
| summary refs log tree commit diff |