2022-12-04 03:19:10 +00:00
|
|
|
use std::mem;
|
|
|
|
|
|
2023-01-24 23:57:26 +00:00
|
|
|
use rustc_infer::infer::InferCtxt;
|
|
|
|
|
use rustc_infer::traits::{
|
|
|
|
|
query::NoSolution, FulfillmentError, FulfillmentErrorCode, MismatchedProjectionTypes,
|
|
|
|
|
PredicateObligation, SelectionError, TraitEngine,
|
2022-12-04 03:19:10 +00:00
|
|
|
};
|
2023-01-24 23:57:26 +00:00
|
|
|
use rustc_middle::ty;
|
|
|
|
|
use rustc_middle::ty::error::{ExpectedFound, TypeError};
|
|
|
|
|
|
|
|
|
|
use super::{Certainty, InferCtxtEvalExt};
|
2022-12-04 03:19:10 +00:00
|
|
|
|
|
|
|
|
/// A trait engine using the new trait solver.
|
|
|
|
|
///
|
|
|
|
|
/// This is mostly identical to how `evaluate_all` works inside of the
|
|
|
|
|
/// solver, except that the requirements are slightly different.
|
|
|
|
|
///
|
|
|
|
|
/// Unlike `evaluate_all` it is possible to add new obligations later on
|
|
|
|
|
/// and we also have to track diagnostics information by using `Obligation`
|
|
|
|
|
/// instead of `Goal`.
|
|
|
|
|
///
|
|
|
|
|
/// It is also likely that we want to use slightly different datastructures
|
|
|
|
|
/// here as this will have to deal with far more root goals than `evaluate_all`.
|
|
|
|
|
pub struct FulfillmentCtxt<'tcx> {
|
|
|
|
|
obligations: Vec<PredicateObligation<'tcx>>,
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl<'tcx> FulfillmentCtxt<'tcx> {
|
|
|
|
|
pub fn new() -> FulfillmentCtxt<'tcx> {
|
|
|
|
|
FulfillmentCtxt { obligations: Vec::new() }
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl<'tcx> TraitEngine<'tcx> for FulfillmentCtxt<'tcx> {
|
|
|
|
|
fn register_predicate_obligation(
|
|
|
|
|
&mut self,
|
|
|
|
|
_infcx: &InferCtxt<'tcx>,
|
|
|
|
|
obligation: PredicateObligation<'tcx>,
|
|
|
|
|
) {
|
|
|
|
|
self.obligations.push(obligation);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fn select_all_or_error(&mut self, infcx: &InferCtxt<'tcx>) -> Vec<FulfillmentError<'tcx>> {
|
|
|
|
|
let errors = self.select_where_possible(infcx);
|
|
|
|
|
if !errors.is_empty() {
|
|
|
|
|
return errors;
|
|
|
|
|
}
|
|
|
|
|
|
2023-01-11 03:54:46 +00:00
|
|
|
self.obligations
|
|
|
|
|
.drain(..)
|
|
|
|
|
.map(|obligation| FulfillmentError {
|
|
|
|
|
obligation: obligation.clone(),
|
2023-01-19 04:50:14 +00:00
|
|
|
code: FulfillmentErrorCode::CodeAmbiguity,
|
2023-01-11 03:54:46 +00:00
|
|
|
root_obligation: obligation,
|
|
|
|
|
})
|
|
|
|
|
.collect()
|
2022-12-04 03:19:10 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fn select_where_possible(&mut self, infcx: &InferCtxt<'tcx>) -> Vec<FulfillmentError<'tcx>> {
|
2023-01-11 03:54:46 +00:00
|
|
|
let mut errors = Vec::new();
|
2022-12-04 03:19:10 +00:00
|
|
|
for i in 0.. {
|
|
|
|
|
if !infcx.tcx.recursion_limit().value_within_limit(i) {
|
2023-01-10 20:24:10 +00:00
|
|
|
unimplemented!("overflowed on pending obligations: {:?}", self.obligations);
|
2022-12-04 03:19:10 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
let mut has_changed = false;
|
2023-01-11 03:54:46 +00:00
|
|
|
for obligation in mem::take(&mut self.obligations) {
|
2023-01-17 10:21:30 +01:00
|
|
|
let goal = obligation.clone().into();
|
2023-01-23 15:34:11 +01:00
|
|
|
let (changed, certainty) = match infcx.evaluate_root_goal(goal) {
|
2023-01-17 11:47:47 +01:00
|
|
|
Ok(result) => result,
|
2023-01-11 03:54:46 +00:00
|
|
|
Err(NoSolution) => {
|
|
|
|
|
errors.push(FulfillmentError {
|
|
|
|
|
obligation: obligation.clone(),
|
2023-01-24 23:57:26 +00:00
|
|
|
code: match goal.predicate.kind().skip_binder() {
|
|
|
|
|
ty::PredicateKind::Clause(ty::Clause::Projection(_)) => {
|
|
|
|
|
FulfillmentErrorCode::CodeProjectionError(
|
|
|
|
|
// FIXME: This could be a `Sorts` if the term is a type
|
|
|
|
|
MismatchedProjectionTypes { err: TypeError::Mismatch },
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
ty::PredicateKind::Subtype(pred) => {
|
|
|
|
|
let (a, b) = infcx.replace_bound_vars_with_placeholders(
|
|
|
|
|
goal.predicate.kind().rebind((pred.a, pred.b)),
|
|
|
|
|
);
|
|
|
|
|
let expected_found = ExpectedFound::new(true, a, b);
|
|
|
|
|
FulfillmentErrorCode::CodeSubtypeError(
|
|
|
|
|
expected_found,
|
|
|
|
|
TypeError::Sorts(expected_found),
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
ty::PredicateKind::Coerce(pred) => {
|
|
|
|
|
let (a, b) = infcx.replace_bound_vars_with_placeholders(
|
|
|
|
|
goal.predicate.kind().rebind((pred.a, pred.b)),
|
|
|
|
|
);
|
|
|
|
|
let expected_found = ExpectedFound::new(false, a, b);
|
|
|
|
|
FulfillmentErrorCode::CodeSubtypeError(
|
|
|
|
|
expected_found,
|
|
|
|
|
TypeError::Sorts(expected_found),
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
ty::PredicateKind::ConstEquate(a, b) => {
|
|
|
|
|
let (a, b) = infcx.replace_bound_vars_with_placeholders(
|
|
|
|
|
goal.predicate.kind().rebind((a, b)),
|
|
|
|
|
);
|
|
|
|
|
let expected_found = ExpectedFound::new(true, a, b);
|
|
|
|
|
FulfillmentErrorCode::CodeConstEquateError(
|
|
|
|
|
expected_found,
|
|
|
|
|
TypeError::ConstMismatch(expected_found),
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
ty::PredicateKind::Clause(_)
|
|
|
|
|
| ty::PredicateKind::WellFormed(_)
|
|
|
|
|
| ty::PredicateKind::ObjectSafe(_)
|
|
|
|
|
| ty::PredicateKind::ClosureKind(_, _, _)
|
|
|
|
|
| ty::PredicateKind::ConstEvaluatable(_)
|
|
|
|
|
| ty::PredicateKind::TypeWellFormedFromEnv(_)
|
|
|
|
|
| ty::PredicateKind::Ambiguous => {
|
|
|
|
|
FulfillmentErrorCode::CodeSelectionError(
|
|
|
|
|
SelectionError::Unimplemented,
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
},
|
2023-01-11 03:54:46 +00:00
|
|
|
root_obligation: obligation,
|
|
|
|
|
});
|
|
|
|
|
continue;
|
|
|
|
|
}
|
2022-12-04 03:19:10 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
has_changed |= changed;
|
|
|
|
|
match certainty {
|
|
|
|
|
Certainty::Yes => {}
|
2023-01-11 03:54:46 +00:00
|
|
|
Certainty::Maybe(_) => self.obligations.push(obligation),
|
2022-12-04 03:19:10 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if !has_changed {
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
errors
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fn pending_obligations(&self) -> Vec<PredicateObligation<'tcx>> {
|
|
|
|
|
self.obligations.clone()
|
|
|
|
|
}
|
|
|
|
|
}
|