Skip to main content

Module eval_ctxt

Module eval_ctxt 

Source

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 an EvalCtxt in the first place.
probe πŸ”’
solver_region_constraints πŸ”’
Logic for -Zassumptions-on-binders stuff

StructsΒ§

EvalCtxt

EnumsΒ§

CurrentGoalKind πŸ”’
The kind of goal we’re currently proving.
RerunDecision πŸ”’

TraitsΒ§

SolverDelegateEvalExt

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 tcx query 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 πŸ”’