Check const Drop impls considering ConstIfConst bounds
This commit is contained in:
parent
f9eb0b3b7b
commit
6ed42a7ca4
7 changed files with 227 additions and 167 deletions
|
@ -4,11 +4,12 @@
|
||||||
|
|
||||||
use rustc_errors::ErrorReported;
|
use rustc_errors::ErrorReported;
|
||||||
use rustc_infer::infer::TyCtxtInferExt;
|
use rustc_infer::infer::TyCtxtInferExt;
|
||||||
|
use rustc_infer::traits::TraitEngine;
|
||||||
use rustc_middle::mir::*;
|
use rustc_middle::mir::*;
|
||||||
use rustc_middle::ty::{self, subst::SubstsRef, AdtDef, Ty};
|
use rustc_middle::ty::{self, subst::SubstsRef, AdtDef, Ty};
|
||||||
use rustc_span::DUMMY_SP;
|
use rustc_span::DUMMY_SP;
|
||||||
use rustc_trait_selection::traits::{
|
use rustc_trait_selection::traits::{
|
||||||
self, ImplSource, Obligation, ObligationCause, SelectionContext,
|
self, FulfillmentContext, ImplSource, Obligation, ObligationCause, SelectionContext,
|
||||||
};
|
};
|
||||||
|
|
||||||
use super::ConstCx;
|
use super::ConstCx;
|
||||||
|
@ -161,28 +162,46 @@ impl Qualif for NeedsNonConstDrop {
|
||||||
// without having the lang item present.
|
// without having the lang item present.
|
||||||
return false;
|
return false;
|
||||||
};
|
};
|
||||||
let trait_ref =
|
|
||||||
ty::TraitRef { def_id: drop_trait, substs: cx.tcx.mk_substs_trait(ty, &[]) };
|
|
||||||
let obligation = Obligation::new(
|
let obligation = Obligation::new(
|
||||||
ObligationCause::dummy(),
|
ObligationCause::dummy(),
|
||||||
cx.param_env,
|
cx.param_env,
|
||||||
ty::Binder::dummy(ty::TraitPredicate {
|
ty::Binder::dummy(ty::TraitPredicate {
|
||||||
trait_ref,
|
trait_ref: ty::TraitRef {
|
||||||
|
def_id: drop_trait,
|
||||||
|
substs: cx.tcx.mk_substs_trait(ty, &[]),
|
||||||
|
},
|
||||||
constness: ty::BoundConstness::ConstIfConst,
|
constness: ty::BoundConstness::ConstIfConst,
|
||||||
polarity: ty::ImplPolarity::Positive,
|
polarity: ty::ImplPolarity::Positive,
|
||||||
}),
|
}),
|
||||||
);
|
);
|
||||||
|
|
||||||
let implsrc = cx.tcx.infer_ctxt().enter(|infcx| {
|
cx.tcx.infer_ctxt().enter(|infcx| {
|
||||||
let mut selcx = SelectionContext::new(&infcx);
|
let mut selcx = SelectionContext::new(&infcx);
|
||||||
selcx.select(&obligation)
|
let Some(impl_src) = selcx.select(&obligation).ok().flatten() else {
|
||||||
});
|
// If we couldn't select a const drop candidate, then it's bad
|
||||||
!matches!(
|
return true;
|
||||||
implsrc,
|
};
|
||||||
Ok(Some(
|
|
||||||
|
if !matches!(
|
||||||
|
impl_src,
|
||||||
ImplSource::ConstDrop(_) | ImplSource::Param(_, ty::BoundConstness::ConstIfConst)
|
ImplSource::ConstDrop(_) | ImplSource::Param(_, ty::BoundConstness::ConstIfConst)
|
||||||
))
|
) {
|
||||||
)
|
// If our const drop candidate is not ConstDrop or implied by param,
|
||||||
|
// then it's bad
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
// If we successfully found one, then select all of the predicates
|
||||||
|
// implied by our const drop impl.
|
||||||
|
let mut fcx = FulfillmentContext::new();
|
||||||
|
for nested in impl_src.nested_obligations() {
|
||||||
|
fcx.register_predicate_obligation(&infcx, nested);
|
||||||
|
}
|
||||||
|
|
||||||
|
// If we had any errors, then it's bad
|
||||||
|
!fcx.select_all_or_error(&infcx).is_empty()
|
||||||
|
})
|
||||||
}
|
}
|
||||||
|
|
||||||
fn in_adt_inherently<'tcx>(
|
fn in_adt_inherently<'tcx>(
|
||||||
|
|
|
@ -566,7 +566,7 @@ pub enum ImplSource<'tcx, N> {
|
||||||
TraitAlias(ImplSourceTraitAliasData<'tcx, N>),
|
TraitAlias(ImplSourceTraitAliasData<'tcx, N>),
|
||||||
|
|
||||||
/// ImplSource for a `const Drop` implementation.
|
/// ImplSource for a `const Drop` implementation.
|
||||||
ConstDrop(ImplSourceConstDropData),
|
ConstDrop(ImplSourceConstDropData<N>),
|
||||||
}
|
}
|
||||||
|
|
||||||
impl<'tcx, N> ImplSource<'tcx, N> {
|
impl<'tcx, N> ImplSource<'tcx, N> {
|
||||||
|
@ -581,10 +581,10 @@ impl<'tcx, N> ImplSource<'tcx, N> {
|
||||||
ImplSource::Object(d) => d.nested,
|
ImplSource::Object(d) => d.nested,
|
||||||
ImplSource::FnPointer(d) => d.nested,
|
ImplSource::FnPointer(d) => d.nested,
|
||||||
ImplSource::DiscriminantKind(ImplSourceDiscriminantKindData)
|
ImplSource::DiscriminantKind(ImplSourceDiscriminantKindData)
|
||||||
| ImplSource::Pointee(ImplSourcePointeeData)
|
| ImplSource::Pointee(ImplSourcePointeeData) => Vec::new(),
|
||||||
| ImplSource::ConstDrop(ImplSourceConstDropData) => Vec::new(),
|
|
||||||
ImplSource::TraitAlias(d) => d.nested,
|
ImplSource::TraitAlias(d) => d.nested,
|
||||||
ImplSource::TraitUpcasting(d) => d.nested,
|
ImplSource::TraitUpcasting(d) => d.nested,
|
||||||
|
ImplSource::ConstDrop(i) => i.nested,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -599,10 +599,10 @@ impl<'tcx, N> ImplSource<'tcx, N> {
|
||||||
ImplSource::Object(d) => &d.nested,
|
ImplSource::Object(d) => &d.nested,
|
||||||
ImplSource::FnPointer(d) => &d.nested,
|
ImplSource::FnPointer(d) => &d.nested,
|
||||||
ImplSource::DiscriminantKind(ImplSourceDiscriminantKindData)
|
ImplSource::DiscriminantKind(ImplSourceDiscriminantKindData)
|
||||||
| ImplSource::Pointee(ImplSourcePointeeData)
|
| ImplSource::Pointee(ImplSourcePointeeData) => &[],
|
||||||
| ImplSource::ConstDrop(ImplSourceConstDropData) => &[],
|
|
||||||
ImplSource::TraitAlias(d) => &d.nested,
|
ImplSource::TraitAlias(d) => &d.nested,
|
||||||
ImplSource::TraitUpcasting(d) => &d.nested,
|
ImplSource::TraitUpcasting(d) => &d.nested,
|
||||||
|
ImplSource::ConstDrop(i) => &i.nested,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -661,9 +661,9 @@ impl<'tcx, N> ImplSource<'tcx, N> {
|
||||||
nested: d.nested.into_iter().map(f).collect(),
|
nested: d.nested.into_iter().map(f).collect(),
|
||||||
})
|
})
|
||||||
}
|
}
|
||||||
ImplSource::ConstDrop(ImplSourceConstDropData) => {
|
ImplSource::ConstDrop(i) => ImplSource::ConstDrop(ImplSourceConstDropData {
|
||||||
ImplSource::ConstDrop(ImplSourceConstDropData)
|
nested: i.nested.into_iter().map(f).collect(),
|
||||||
}
|
}),
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -755,8 +755,10 @@ pub struct ImplSourceDiscriminantKindData;
|
||||||
#[derive(Clone, Debug, PartialEq, Eq, TyEncodable, TyDecodable, HashStable)]
|
#[derive(Clone, Debug, PartialEq, Eq, TyEncodable, TyDecodable, HashStable)]
|
||||||
pub struct ImplSourcePointeeData;
|
pub struct ImplSourcePointeeData;
|
||||||
|
|
||||||
#[derive(Clone, Debug, PartialEq, Eq, TyEncodable, TyDecodable, HashStable)]
|
#[derive(Clone, PartialEq, Eq, TyEncodable, TyDecodable, HashStable, TypeFoldable, Lift)]
|
||||||
pub struct ImplSourceConstDropData;
|
pub struct ImplSourceConstDropData<N> {
|
||||||
|
pub nested: Vec<N>,
|
||||||
|
}
|
||||||
|
|
||||||
#[derive(Clone, PartialEq, Eq, TyEncodable, TyDecodable, HashStable, TypeFoldable, Lift)]
|
#[derive(Clone, PartialEq, Eq, TyEncodable, TyDecodable, HashStable, TypeFoldable, Lift)]
|
||||||
pub struct ImplSourceTraitAliasData<'tcx, N> {
|
pub struct ImplSourceTraitAliasData<'tcx, N> {
|
||||||
|
|
|
@ -146,8 +146,8 @@ pub enum SelectionCandidate<'tcx> {
|
||||||
|
|
||||||
BuiltinUnsizeCandidate,
|
BuiltinUnsizeCandidate,
|
||||||
|
|
||||||
/// Implementation of `const Drop`.
|
/// Implementation of `const Drop`, optionally from a custom `impl const Drop`.
|
||||||
ConstDropCandidate,
|
ConstDropCandidate(Option<DefId>),
|
||||||
}
|
}
|
||||||
|
|
||||||
/// The result of trait evaluation. The order is important
|
/// The result of trait evaluation. The order is important
|
||||||
|
|
|
@ -120,6 +120,12 @@ impl<'tcx, N: fmt::Debug> fmt::Debug for traits::ImplSourceTraitAliasData<'tcx,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
impl<N: fmt::Debug> fmt::Debug for traits::ImplSourceConstDropData<N> {
|
||||||
|
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||||
|
write!(f, "ImplSourceConstDropData(nested={:?})", self.nested)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////
|
///////////////////////////////////////////////////////////////////////////
|
||||||
// Lift implementations
|
// Lift implementations
|
||||||
|
|
||||||
|
@ -127,5 +133,4 @@ TrivialTypeFoldableAndLiftImpls! {
|
||||||
super::IfExpressionCause,
|
super::IfExpressionCause,
|
||||||
super::ImplSourceDiscriminantKindData,
|
super::ImplSourceDiscriminantKindData,
|
||||||
super::ImplSourcePointeeData,
|
super::ImplSourcePointeeData,
|
||||||
super::ImplSourceConstDropData,
|
|
||||||
}
|
}
|
||||||
|
|
|
@ -307,13 +307,7 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
|
||||||
} else if lang_items.drop_trait() == Some(def_id)
|
} else if lang_items.drop_trait() == Some(def_id)
|
||||||
&& obligation.predicate.skip_binder().constness == ty::BoundConstness::ConstIfConst
|
&& obligation.predicate.skip_binder().constness == ty::BoundConstness::ConstIfConst
|
||||||
{
|
{
|
||||||
if obligation.param_env.constness() == hir::Constness::Const {
|
self.assemble_const_drop_candidates(obligation, &mut candidates);
|
||||||
self.assemble_const_drop_candidates(obligation, stack, &mut candidates)?;
|
|
||||||
} else {
|
|
||||||
debug!("passing ~const Drop bound; in non-const context");
|
|
||||||
// `~const Drop` when we are not in a const context has no effect.
|
|
||||||
candidates.vec.push(ConstDropCandidate)
|
|
||||||
}
|
|
||||||
} else {
|
} else {
|
||||||
if lang_items.clone_trait() == Some(def_id) {
|
if lang_items.clone_trait() == Some(def_id) {
|
||||||
// Same builtin conditions as `Copy`, i.e., every type which has builtin support
|
// Same builtin conditions as `Copy`, i.e., every type which has builtin support
|
||||||
|
@ -918,139 +912,77 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
fn assemble_const_drop_candidates<'a>(
|
fn assemble_const_drop_candidates(
|
||||||
&mut self,
|
&mut self,
|
||||||
obligation: &TraitObligation<'tcx>,
|
obligation: &TraitObligation<'tcx>,
|
||||||
obligation_stack: &TraitObligationStack<'a, 'tcx>,
|
|
||||||
candidates: &mut SelectionCandidateSet<'tcx>,
|
candidates: &mut SelectionCandidateSet<'tcx>,
|
||||||
) -> Result<(), SelectionError<'tcx>> {
|
) {
|
||||||
let mut stack: Vec<(Ty<'tcx>, usize)> = vec![(obligation.self_ty().skip_binder(), 0)];
|
// If the predicate is `~const Drop` in a non-const environment, we don't actually need
|
||||||
|
// to check anything. We'll short-circuit checking any obligations in confirmation, too.
|
||||||
while let Some((ty, depth)) = stack.pop() {
|
if obligation.param_env.constness() == hir::Constness::NotConst {
|
||||||
let mut noreturn = false;
|
candidates.vec.push(ConstDropCandidate(None));
|
||||||
|
return;
|
||||||
self.check_recursion_depth(depth, obligation)?;
|
|
||||||
let mut new_candidates = SelectionCandidateSet { vec: Vec::new(), ambiguous: false };
|
|
||||||
let mut copy_obligation =
|
|
||||||
obligation.with(obligation.predicate.rebind(ty::TraitPredicate {
|
|
||||||
trait_ref: ty::TraitRef {
|
|
||||||
def_id: self.tcx().require_lang_item(hir::LangItem::Copy, None),
|
|
||||||
substs: self.tcx().mk_substs_trait(ty, &[]),
|
|
||||||
},
|
|
||||||
constness: ty::BoundConstness::NotConst,
|
|
||||||
polarity: ty::ImplPolarity::Positive,
|
|
||||||
}));
|
|
||||||
copy_obligation.recursion_depth = depth + 1;
|
|
||||||
self.assemble_candidates_from_impls(©_obligation, &mut new_candidates);
|
|
||||||
let copy_conditions = self.copy_clone_conditions(©_obligation);
|
|
||||||
self.assemble_builtin_bound_candidates(copy_conditions, &mut new_candidates);
|
|
||||||
let copy_stack = self.push_stack(obligation_stack.list(), ©_obligation);
|
|
||||||
self.assemble_candidates_from_caller_bounds(©_stack, &mut new_candidates)?;
|
|
||||||
|
|
||||||
let const_drop_obligation =
|
|
||||||
obligation.with(obligation.predicate.rebind(ty::TraitPredicate {
|
|
||||||
trait_ref: ty::TraitRef {
|
|
||||||
def_id: self.tcx().require_lang_item(hir::LangItem::Drop, None),
|
|
||||||
substs: self.tcx().mk_substs_trait(ty, &[]),
|
|
||||||
},
|
|
||||||
constness: ty::BoundConstness::ConstIfConst,
|
|
||||||
polarity: ty::ImplPolarity::Positive,
|
|
||||||
}));
|
|
||||||
|
|
||||||
let const_drop_stack = self.push_stack(obligation_stack.list(), &const_drop_obligation);
|
|
||||||
self.assemble_candidates_from_caller_bounds(&const_drop_stack, &mut new_candidates)?;
|
|
||||||
|
|
||||||
if !new_candidates.vec.is_empty() {
|
|
||||||
noreturn = true;
|
|
||||||
}
|
|
||||||
debug!(?new_candidates.vec, "assemble_const_drop_candidates");
|
|
||||||
|
|
||||||
match ty.kind() {
|
|
||||||
ty::Int(_)
|
|
||||||
| ty::Uint(_)
|
|
||||||
| ty::Float(_)
|
|
||||||
| ty::Infer(ty::IntVar(_))
|
|
||||||
| ty::Infer(ty::FloatVar(_))
|
|
||||||
| ty::FnPtr(_)
|
|
||||||
| ty::Never
|
|
||||||
| ty::Ref(..)
|
|
||||||
| ty::FnDef(..)
|
|
||||||
| ty::RawPtr(_)
|
|
||||||
| ty::Bool
|
|
||||||
| ty::Char
|
|
||||||
| ty::Str
|
|
||||||
| ty::Foreign(_) => {} // Do nothing. These types satisfy `const Drop`.
|
|
||||||
|
|
||||||
ty::Adt(def, subst) => {
|
|
||||||
let mut set = SelectionCandidateSet { vec: Vec::new(), ambiguous: false };
|
|
||||||
self.assemble_candidates_from_impls(
|
|
||||||
&obligation.with(obligation.predicate.map_bound(|mut pred| {
|
|
||||||
pred.trait_ref.substs = self.tcx().mk_substs_trait(ty, &[]);
|
|
||||||
pred
|
|
||||||
})),
|
|
||||||
&mut set,
|
|
||||||
);
|
|
||||||
stack.extend(def.all_fields().map(|f| (f.ty(self.tcx(), subst), depth + 1)));
|
|
||||||
|
|
||||||
debug!(?set.vec, "assemble_const_drop_candidates - ty::Adt");
|
|
||||||
if set.vec.into_iter().any(|candidate| {
|
|
||||||
if let SelectionCandidate::ImplCandidate(did) = candidate {
|
|
||||||
matches!(self.tcx().impl_constness(did), hir::Constness::NotConst)
|
|
||||||
} else {
|
|
||||||
false
|
|
||||||
}
|
|
||||||
}) {
|
|
||||||
if !noreturn {
|
|
||||||
// has non-const Drop
|
|
||||||
return Ok(());
|
|
||||||
}
|
|
||||||
debug!("not returning");
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
ty::Array(ty, _) => stack.push((ty, depth + 1)),
|
let self_ty = self.infcx().shallow_resolve(obligation.self_ty());
|
||||||
|
match self_ty.skip_binder().kind() {
|
||||||
ty::Tuple(_) => stack.extend(ty.tuple_fields().map(|t| (t, depth + 1))),
|
|
||||||
|
|
||||||
ty::Closure(_, substs) => {
|
|
||||||
let substs = substs.as_closure();
|
|
||||||
let ty = self.infcx.shallow_resolve(substs.tupled_upvars_ty());
|
|
||||||
stack.push((ty, depth + 1));
|
|
||||||
}
|
|
||||||
|
|
||||||
ty::Generator(_, substs, _) => {
|
|
||||||
let substs = substs.as_generator();
|
|
||||||
let ty = self.infcx.shallow_resolve(substs.tupled_upvars_ty());
|
|
||||||
|
|
||||||
stack.push((ty, depth + 1));
|
|
||||||
stack.push((substs.witness(), depth + 1));
|
|
||||||
}
|
|
||||||
|
|
||||||
ty::GeneratorWitness(tys) => stack.extend(
|
|
||||||
self.tcx().erase_late_bound_regions(*tys).iter().map(|t| (t, depth + 1)),
|
|
||||||
),
|
|
||||||
|
|
||||||
ty::Slice(ty) => stack.push((ty, depth + 1)),
|
|
||||||
|
|
||||||
ty::Opaque(..)
|
ty::Opaque(..)
|
||||||
| ty::Dynamic(..)
|
| ty::Dynamic(..)
|
||||||
| ty::Error(_)
|
| ty::Error(_)
|
||||||
| ty::Bound(..)
|
| ty::Bound(..)
|
||||||
| ty::Infer(_)
|
| ty::Param(_)
|
||||||
| ty::Placeholder(_)
|
| ty::Placeholder(_)
|
||||||
| ty::Projection(..)
|
| ty::Never
|
||||||
| ty::Param(..) => {
|
| ty::Foreign(_)
|
||||||
if !noreturn {
|
| ty::Projection(_) => {
|
||||||
return Ok(());
|
// We don't know if these are `~const Drop`, at least
|
||||||
|
// not structurally... so don't push a candidate.
|
||||||
}
|
}
|
||||||
debug!("not returning");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
debug!(?stack, "assemble_const_drop_candidates - in loop");
|
|
||||||
}
|
|
||||||
// all types have passed.
|
|
||||||
candidates.vec.push(ConstDropCandidate);
|
|
||||||
|
|
||||||
Ok(())
|
ty::Bool
|
||||||
|
| ty::Char
|
||||||
|
| ty::Int(_)
|
||||||
|
| ty::Uint(_)
|
||||||
|
| ty::Float(_)
|
||||||
|
| ty::Infer(ty::IntVar(_))
|
||||||
|
| ty::Infer(ty::FloatVar(_))
|
||||||
|
| ty::Str
|
||||||
|
| ty::RawPtr(_)
|
||||||
|
| ty::Ref(..)
|
||||||
|
| ty::FnDef(..)
|
||||||
|
| ty::FnPtr(_)
|
||||||
|
| ty::Array(..)
|
||||||
|
| ty::Slice(_)
|
||||||
|
| ty::Closure(..)
|
||||||
|
| ty::Generator(..)
|
||||||
|
| ty::Tuple(_)
|
||||||
|
| ty::GeneratorWitness(_) => {
|
||||||
|
// These are built-in, and cannot have a custom `impl const Drop`.
|
||||||
|
candidates.vec.push(ConstDropCandidate(None));
|
||||||
|
}
|
||||||
|
|
||||||
|
ty::Adt(..) => {
|
||||||
|
// Find a custom `impl Drop` impl, if it exists
|
||||||
|
let relevant_impl = self.tcx().find_map_relevant_impl(
|
||||||
|
obligation.predicate.def_id(),
|
||||||
|
obligation.predicate.skip_binder().trait_ref.self_ty(),
|
||||||
|
Some,
|
||||||
|
);
|
||||||
|
|
||||||
|
if let Some(impl_def_id) = relevant_impl {
|
||||||
|
// Check that `impl Drop` is actually const, if there is a custom impl
|
||||||
|
if self.tcx().impl_constness(impl_def_id) == hir::Constness::Const {
|
||||||
|
candidates.vec.push(ConstDropCandidate(Some(impl_def_id)));
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
// Otherwise check the ADT like a built-in type (structurally)
|
||||||
|
candidates.vec.push(ConstDropCandidate(None));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
ty::Infer(_) => {
|
||||||
|
candidates.ambiguous = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -80,7 +80,6 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
|
||||||
param_env: obligation.param_env.without_const(),
|
param_env: obligation.param_env.without_const(),
|
||||||
..*obligation
|
..*obligation
|
||||||
};
|
};
|
||||||
|
|
||||||
obligation = &new_obligation;
|
obligation = &new_obligation;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -159,7 +158,10 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
|
||||||
Ok(ImplSource::TraitUpcasting(data))
|
Ok(ImplSource::TraitUpcasting(data))
|
||||||
}
|
}
|
||||||
|
|
||||||
ConstDropCandidate => Ok(ImplSource::ConstDrop(ImplSourceConstDropData)),
|
ConstDropCandidate(def_id) => {
|
||||||
|
let data = self.confirm_const_drop_candidate(obligation, def_id)?;
|
||||||
|
Ok(ImplSource::ConstDrop(data))
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -1087,4 +1089,104 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
|
||||||
|
|
||||||
Ok(ImplSourceBuiltinData { nested })
|
Ok(ImplSourceBuiltinData { nested })
|
||||||
}
|
}
|
||||||
|
|
||||||
|
fn confirm_const_drop_candidate(
|
||||||
|
&mut self,
|
||||||
|
obligation: &TraitObligation<'tcx>,
|
||||||
|
impl_def_id: Option<DefId>,
|
||||||
|
) -> Result<ImplSourceConstDropData<PredicateObligation<'tcx>>, SelectionError<'tcx>> {
|
||||||
|
// `~const Drop` in a non-const environment is always trivially true, since our type is `Drop`
|
||||||
|
if obligation.param_env.constness() == Constness::NotConst {
|
||||||
|
return Ok(ImplSourceConstDropData { nested: vec![] });
|
||||||
|
}
|
||||||
|
|
||||||
|
let tcx = self.tcx();
|
||||||
|
let self_ty = self.infcx.shallow_resolve(obligation.self_ty());
|
||||||
|
|
||||||
|
let nested_tys = match *self_ty.skip_binder().kind() {
|
||||||
|
ty::Bool
|
||||||
|
| ty::Char
|
||||||
|
| ty::Int(_)
|
||||||
|
| ty::Uint(_)
|
||||||
|
| ty::Float(_)
|
||||||
|
| ty::Infer(ty::IntVar(_))
|
||||||
|
| ty::Infer(ty::FloatVar(_))
|
||||||
|
| ty::Str
|
||||||
|
| ty::RawPtr(_)
|
||||||
|
| ty::Ref(..)
|
||||||
|
| ty::FnDef(..)
|
||||||
|
| ty::FnPtr(_)
|
||||||
|
| ty::Projection(_) => vec![],
|
||||||
|
|
||||||
|
ty::Adt(def, substs) => def.all_fields().map(|f| f.ty(tcx, substs)).collect(),
|
||||||
|
|
||||||
|
ty::Array(ty, _) | ty::Slice(ty) => vec![ty],
|
||||||
|
|
||||||
|
ty::Tuple(tys) => tys.iter().map(|ty| ty.expect_ty()).collect(),
|
||||||
|
|
||||||
|
ty::Closure(_, substs) => vec![substs.as_closure().tupled_upvars_ty()],
|
||||||
|
|
||||||
|
ty::Generator(_, substs, _) => {
|
||||||
|
vec![substs.as_generator().tupled_upvars_ty(), substs.as_generator().witness()]
|
||||||
|
}
|
||||||
|
|
||||||
|
ty::GeneratorWitness(tys) => tcx.erase_late_bound_regions(tys).to_vec(),
|
||||||
|
|
||||||
|
ty::Opaque(_, _)
|
||||||
|
| ty::Dynamic(_, _)
|
||||||
|
| ty::Error(_)
|
||||||
|
| ty::Bound(_, _)
|
||||||
|
| ty::Param(_)
|
||||||
|
| ty::Placeholder(_)
|
||||||
|
| ty::Never
|
||||||
|
| ty::Foreign(_)
|
||||||
|
| ty::Infer(_) => {
|
||||||
|
unreachable!();
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
info!(
|
||||||
|
"confirm_const_drop_candidate: self_ty={:?}, nested_tys={:?} impl_def_id={:?}",
|
||||||
|
self_ty, nested_tys, impl_def_id
|
||||||
|
);
|
||||||
|
|
||||||
|
let cause = obligation.derived_cause(BuiltinDerivedObligation);
|
||||||
|
let mut nested = vec![];
|
||||||
|
|
||||||
|
// If we have a custom `impl const Drop`, then check it like a regular impl candidate.
|
||||||
|
if let Some(impl_def_id) = impl_def_id {
|
||||||
|
nested.extend(self.confirm_impl_candidate(obligation, impl_def_id).nested);
|
||||||
|
}
|
||||||
|
|
||||||
|
for ty in nested_tys {
|
||||||
|
let predicate = self.infcx.commit_unconditionally(|_| {
|
||||||
|
normalize_with_depth_to(
|
||||||
|
self,
|
||||||
|
obligation.param_env,
|
||||||
|
cause.clone(),
|
||||||
|
obligation.recursion_depth + 1,
|
||||||
|
self_ty
|
||||||
|
.rebind(ty::TraitPredicate {
|
||||||
|
trait_ref: ty::TraitRef {
|
||||||
|
def_id: self.tcx().require_lang_item(LangItem::Drop, None),
|
||||||
|
substs: self.tcx().mk_substs_trait(ty, &[]),
|
||||||
|
},
|
||||||
|
constness: ty::BoundConstness::ConstIfConst,
|
||||||
|
polarity: ty::ImplPolarity::Positive,
|
||||||
|
})
|
||||||
|
.to_predicate(tcx),
|
||||||
|
&mut nested,
|
||||||
|
)
|
||||||
|
});
|
||||||
|
|
||||||
|
nested.push(Obligation::with_depth(
|
||||||
|
cause.clone(),
|
||||||
|
obligation.recursion_depth + 1,
|
||||||
|
obligation.param_env,
|
||||||
|
predicate,
|
||||||
|
));
|
||||||
|
}
|
||||||
|
|
||||||
|
Ok(ImplSourceConstDropData { nested })
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -1153,7 +1153,7 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
|
||||||
GeneratorCandidate => {}
|
GeneratorCandidate => {}
|
||||||
// FnDef where the function is const
|
// FnDef where the function is const
|
||||||
FnPointerCandidate { is_const: true } => {}
|
FnPointerCandidate { is_const: true } => {}
|
||||||
ConstDropCandidate => {}
|
ConstDropCandidate(_) => {}
|
||||||
_ => {
|
_ => {
|
||||||
// reject all other types of candidates
|
// reject all other types of candidates
|
||||||
continue;
|
continue;
|
||||||
|
@ -1537,7 +1537,7 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
|
||||||
};
|
};
|
||||||
|
|
||||||
// (*) Prefer `BuiltinCandidate { has_nested: false }`, `PointeeCandidate`,
|
// (*) Prefer `BuiltinCandidate { has_nested: false }`, `PointeeCandidate`,
|
||||||
// and `DiscriminantKindCandidate` to anything else.
|
// `DiscriminantKindCandidate`, and `ConstDropCandidate` to anything else.
|
||||||
//
|
//
|
||||||
// This is a fix for #53123 and prevents winnowing from accidentally extending the
|
// This is a fix for #53123 and prevents winnowing from accidentally extending the
|
||||||
// lifetime of a variable.
|
// lifetime of a variable.
|
||||||
|
@ -1554,7 +1554,7 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
|
||||||
BuiltinCandidate { has_nested: false }
|
BuiltinCandidate { has_nested: false }
|
||||||
| DiscriminantKindCandidate
|
| DiscriminantKindCandidate
|
||||||
| PointeeCandidate
|
| PointeeCandidate
|
||||||
| ConstDropCandidate,
|
| ConstDropCandidate(_),
|
||||||
_,
|
_,
|
||||||
) => true,
|
) => true,
|
||||||
(
|
(
|
||||||
|
@ -1562,7 +1562,7 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
|
||||||
BuiltinCandidate { has_nested: false }
|
BuiltinCandidate { has_nested: false }
|
||||||
| DiscriminantKindCandidate
|
| DiscriminantKindCandidate
|
||||||
| PointeeCandidate
|
| PointeeCandidate
|
||||||
| ConstDropCandidate,
|
| ConstDropCandidate(_),
|
||||||
) => false,
|
) => false,
|
||||||
|
|
||||||
(ParamCandidate(other), ParamCandidate(victim)) => {
|
(ParamCandidate(other), ParamCandidate(victim)) => {
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue