rust/compiler/rustc_next_trait_solver, branch autohttps://github.com/rust-lang/rust
http://git.dreamy.place/mirrors/rust/atom?h=auto2025-10-02T08:09:33+00:00Auto merge of #147138 - jackh726:split-canonical-bound, r=lcnr2025-10-02T08:09:33+00:00borsbors@rust-lang.org2025-10-02T08:09:33+00:00urn:sha1:4b9c62b4da3e17cee99d3d2052f1c576b188e2a8
Split Bound index into Canonical and Bound
See [#t-types/trait-system-refactor > perf `async-closures/post-mono-higher-ranked-hang.rs`](https://rust-lang.zulipchat.com/#narrow/channel/364551-t-types.2Ftrait-system-refactor/topic/perf.20.60async-closures.2Fpost-mono-higher-ranked-hang.2Ers.60/with/541535613) for context
Things compile and tests pass, but not sure if this actually solves the perf issue (edit: it does). Opening up this to do a perf (and maybe crater) run.
r? lcnr
Split Bound into Canonical and Bound2025-09-30T16:58:28+00:00jackh726git@jackhuey.me2025-09-28T23:04:55+00:00urn:sha1:d1bbd39c59523d7a5499816a9da200a5910f8b7fadd tests2025-09-30T10:02:43+00:00lcnrrust@lcnr.de2025-09-30T10:02:43+00:00urn:sha1:5139facb365c40e5b0ddedf221cd62347a2a4504cleanup `try_evaluate_added_goals`2025-09-29T13:28:33+00:00lcnrrust@lcnr.de2025-09-29T11:57:51+00:00urn:sha1:07806a1132f156ffad8c9edaed08825cd09fbce5Fn-trait goals, eagerly instantiate binder2025-09-29T13:28:33+00:00lcnrrust@lcnr.de2025-09-29T11:52:33+00:00urn:sha1:098a56890f25eaca5063988b0b0840fad83db250
to avoid overflow from proving `for<'a> opaque<'a>: Sized`
Rollup merge of #147061 - lcnr:provisional-cache-woops, r=BoxyUwU2025-09-28T07:15:25+00:00Matthias Krüger476013+matthiaskrgr@users.noreply.github.com2025-09-28T07:15:25+00:00urn:sha1:cb4c3ad41c87082111c9aaa443b66365e9a5db04
fix rebasing cycle heads when not reaching a fixpoint
fixes https://github.com/rust-lang/trait-system-refactor-initiative/issues/232
annoyingly subtle, imagine the following proof tree
- A (no cycle head usages, final result Y)
- *ignored* B (depends on A with provisional result X)
- A (cycle, provisional result X)
- B (using the cache entry here incorrectly assumes A has final result X)
r? ``@BoxyUwU``
allow method calls on opaques2025-09-26T14:33:15+00:00lcnrrust@lcnr.de2025-09-23T15:33:24+00:00urn:sha1:148fd9ad3c434c26a952e01e37c35aa26cb8315cpredefined opaques use `List`2025-09-26T14:33:15+00:00lcnrrust@lcnr.de2025-09-22T12:09:03+00:00urn:sha1:1acd65cd6dffb34a2c8576ebc3874527a9f601e0rename `search_graph::Delegate` fns2025-09-26T13:29:01+00:00lcnrrust@lcnr.de2025-09-26T12:51:13+00:00urn:sha1:4e44d58bbc199ff7c17a98b283621a6df327d60ffix cycle head usages tracking2025-09-26T13:29:01+00:00lcnrrust@lcnr.de2025-09-26T11:48:22+00:00urn:sha1:4a0c7cc730a5434574c41a6073d9efb92141af1a