rust/compiler/rustc_middle/src/query, branch automation/bors/tryhttps://github.com/rust-lang/rust
http://git.dreamy.place/mirrors/rust/atom?h=automation/bors/try2025-09-29T15:06:25+00:00more rename2025-09-29T15:06:25+00:00Boxy Uwurust@boxyuwu.dev2025-09-29T15:05:44+00:00urn:sha1:66b664c9961e54282fbaccef72f90dfa7dd1418fRename various "concrete opaque type" terminology to say "hidden type"2025-09-27T21:58:02+00:00Boxy Uwurust@boxyuwu.dev2025-09-27T21:58:02+00:00urn:sha1:4d411775139e1bc39c2752d78e40f2bcecb5304bpredefined opaques to `method_autoderef_steps`2025-09-26T14:33:15+00:00lcnrrust@lcnr.de2025-09-22T12:26:08+00:00urn:sha1:b70a15f5f62f17f1bea1a0260fe629143cf55316Don't store defaultness for inherent impl items2025-09-12T20:14:15+00:00Cameron Steffencam.steffen94@gmail.com2025-08-13T19:36:13+00:00urn:sha1:b995a55cafcbcafec51aba6c567b32161fa9c2f1Rename AssocItemContainer -> AssocContainer2025-09-12T20:10:30+00:00Cameron Steffencam.steffen94@gmail.com2025-08-13T19:14:37+00:00urn:sha1:5590e55b03722fb7da2d965478deb4b5d62bf97aerase_regions to erase_and_anonymize_regions2025-09-09T12:49:16+00:00Boxyrust@boxyuwu.dev2025-08-21T15:50:54+00:00urn:sha1:e379c7758667f900aaf5551c4553c7d4c121e3e1Move `describe_as_module` from `rustc_middle::print` to `rustc:middle::query`.2025-09-07T20:34:39+00:00Nicholas Nethercoten.nethercote@gmail.com2025-07-31T06:46:21+00:00urn:sha1:a171ec3cf04be09b7889223caa1e9a7768d82de4
That way it doesn't need to be exported.
Auto merge of #145951 - lcnr:proof-tree-as-query, r=compiler-errors2025-09-02T13:13:17+00:00borsbors@rust-lang.org2025-09-02T13:13:17+00:00urn:sha1:a2c8b0b92c14b02f0b3f96a0d5296f1090dc286b
cleanup and cache proof tree building
There's some cruft left over from when we had deep proof trees. We never encounter overflow when evaluating proof trees. Even if the recursion limit is `0`, we still only hit the overflow limit when evaluating nested goals of the root. The root goal simply inherits the `root_depth` of the `SearchGraph`.
Split `evaluate_root_goal_for_proof_tree` from the rest of the trait solver. This enables us to simplify the implementation of `evaluate_goal_raw` and the `ProofTreeBuilder` as we no longer need to manually track the state of the builder and can instead use separate types for that. It does require making a few internal methods into associated functions taking a `delegate` and a `span` instead of the `EvalCtxt` itself.
I've also split `SearchGraph::evaluate_goal` and `SearchGraph::evaluate_root_goal_for_proof_tree` for the same reason. Both functions don't actually share too much code, so by splitting them each version gets significantly easier to read.
Add a `query evaluate_root_goal_for_proof_tree_raw` to cache proof tree building. This requires arena allocating `inspect::Probe`. I've added a new type alias `I::ProbeRef` for this. We may need to adapt this for rust-analyzer? It would definitely be easy to remove the `Copy` bound here :thinking:
cleanup proof tree implementation and add cache2025-08-29T07:35:37+00:00lcnrrust@lcnr.de2025-08-28T07:57:36+00:00urn:sha1:0edb22cdbf8f25bede8d46e706b181457e27003achange order of `nested_bodies_within`2025-08-27T12:11:07+00:00lcnrrust@lcnr.de2025-08-27T12:10:34+00:00urn:sha1:a3993c5416d69591b45d2dad4c56ce2d3a971384