Re-exportsΒ§
use std::mem;πuse std::ops::ControlFlow;πuse rustc_type_ir::data_structures::HashSet;πuse rustc_type_ir::region_constraint::RegionConstraint;πuse rustc_type_ir::relate::Relate;πuse rustc_type_ir::relate::solver_relating::RelateExt;πuse rustc_type_ir::search_graph::CandidateHeadUsages;πuse rustc_type_ir::search_graph::LowerAvailableDepth;πuse rustc_type_ir::search_graph::PathKind;πuse rustc_type_ir::search_graph::RequiredDepth;πuse rustc_type_ir::solve::AccessedOpaques;πuse rustc_type_ir::solve::ExternalRegionConstraints;πuse rustc_type_ir::solve::FetchEligibleAssocItemResponse;πuse rustc_type_ir::solve::MaybeInfo;πuse rustc_type_ir::solve::NoSolutionOrRerunNonErased;πuse rustc_type_ir::solve::OpaqueTypesJank;πuse rustc_type_ir::solve::QueryResultOrRerunNonErased;πuse rustc_type_ir::solve::RerunCondition;πuse rustc_type_ir::solve::RerunNonErased;πuse rustc_type_ir::solve::RerunReason;πuse rustc_type_ir::solve::RerunResultExt;πuse rustc_type_ir::solve::SmallCopySet;πuse rustc_type_ir::solve::TyOrConstInferVar;πuse rustc_type_ir::transmute::Answer;πuse rustc_type_ir as ty;πuse rustc_type_ir::CanonicalQueryInput;πuse rustc_type_ir::ClauseKind;πuse rustc_type_ir::Const;πuse rustc_type_ir::InferCtxtLike;πuse rustc_type_ir::Interner;πuse rustc_type_ir::MayBeErased;πuse rustc_type_ir::OpaqueTypeKey;πuse rustc_type_ir::PredicateKind;πuse rustc_type_ir::PredicateProxy;πuse rustc_type_ir::Region;πuse rustc_type_ir::RegionVid;πuse rustc_type_ir::TypeFoldable;πuse rustc_type_ir::TypeSuperVisitable;πuse rustc_type_ir::TypeVisitable;πuse rustc_type_ir::TypeVisitableExt;πuse rustc_type_ir::TypeVisitor;πuse rustc_type_ir::TypingMode;πuse rustc_type_ir::TypingModeEqWrapper;πuse rustc_type_ir::max_universe;πuse thin_vec::ThinVec;πuse tracing::Level;πuse tracing::debug;πuse tracing::instrument;πuse tracing::instrument;πuse tracing::trace;πuse tracing::warn;πuse super::has_only_region_constraints;πuse crate::canonical::canonicalize_goal;πuse crate::canonical::canonicalize_response;πuse crate::canonical::instantiate_and_apply_query_response;πuse crate::canonical::response_no_constraints_raw;πuse crate::coherence;πuse crate::delegate::SolverDelegate;πuse crate::normalize::NormalizationFolder;πuse crate::normalize::NormalizationWasAmbiguous;πuse crate::placeholder::BoundVarReplacer;πuse crate::solve::eval_ctxt::fast_path::RerunStalled;πuse crate::solve::eval_ctxt::fast_path::compute_goal_fast_path;πuse crate::solve::eval_ctxt::fast_path::inlined_rerunning_stalled_goal_may_make_progress;πuse crate::solve::eval_ctxt::fast_path::rerunning_stalled_goal_may_make_progress;πuse crate::solve::fast_path::compute_goal_fast_path_cold;πuse crate::solve::search_graph::SearchGraph;πuse crate::solve::ty::may_use_unstable_feature;πuse crate::solve::CanonicalResponse;πuse crate::solve::Certainty;πuse crate::solve::ExternalConstraintsData;πuse crate::solve::FIXPOINT_STEP_LIMIT;πuse crate::solve::Goal;πuse crate::solve::GoalEvaluation;πuse crate::solve::GoalSource;πuse crate::solve::GoalStalledOn;πuse crate::solve::GoalStalledOnOpaques;πuse crate::solve::HasChanged;πuse crate::solve::IsIdentity;πuse crate::solve::MaybeCause;πuse crate::solve::NestedNormalizationGoals;πuse crate::solve::NoSolution;πuse crate::solve::QueryInput;πuse crate::solve::QueryResult;πuse crate::solve::Response;πuse crate::solve::SucceededInErased;πuse crate::solve::VisibleForLeakCheck;πuse crate::solve::inspect;πuse rustc_type_ir::inherent::*;π
ModulesΒ§
- fast_
path - This file contains a number of standalone functions useful for taking fast paths in the trait
solver. The exact place where we check for these fast paths changes, and matters a lot for
performance. Ideally weβd only check them in
evaluate_goal, but when evaluating root goals we can check them earlier and save some time creating anEvalCtxtin the first place. - probe π
- solver_
region_ πconstraints - Logic for
-Zassumptions-on-bindersstuff
StructsΒ§
EnumsΒ§
- Current
Goal πKind - The kind of goal weβre currently proving.
- Rerun
Decision π
TraitsΒ§
FunctionsΒ§
- evaluate_
root_ πgoal_ for_ proof_ tree - Evaluate a goal to build a proof tree.
- evaluate_
root_ goal_ for_ proof_ tree_ raw_ provider - Do not call this directly, use the
tcxquery instead. - filter_
irrelevant_ πregion_ constraints - maybe_
evaluate_ πroot_ goal_ for_ proof_ tree_ with_ higher_ recursion_ limit - The old solver doesnβt check depth requirement when looking up cache while the next solver does so. Thus the next solver is more prone to overflow. To mitigate breakages, we re-evaluate the overflowed goal with doubled recursion limit and emit a FCW if doing so prevents overflow.
- maybe_
evaluate_ πroot_ goal_ with_ higher_ recursion_ limit - The old solver doesnβt check depth requirement when looking up cache while the next solver does so. Thus the next solver is more prone to overflow. To mitigate breakages, we re-evaluate the overflowed goal with doubled recursion limit and emit a FCW if doing so prevents overflow.
- should_
rerun_ πafter_ erased_ canonicalization