Allow more cases to match ~const Drop.
This commit is contained in:
parent
3b25e92a8f
commit
e0c2ff7ccc
2 changed files with 68 additions and 32 deletions
|
@ -304,7 +304,7 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
|
||||||
&& obligation.predicate.skip_binder().constness == ty::BoundConstness::ConstIfConst
|
&& obligation.predicate.skip_binder().constness == ty::BoundConstness::ConstIfConst
|
||||||
{
|
{
|
||||||
if self.is_in_const_context {
|
if self.is_in_const_context {
|
||||||
self.assemble_const_drop_candidates(obligation, &mut candidates)?;
|
self.assemble_const_drop_candidates(obligation, stack, &mut candidates)?;
|
||||||
} else {
|
} else {
|
||||||
debug!("passing ~const Drop bound; in non-const context");
|
debug!("passing ~const Drop bound; in non-const context");
|
||||||
// `~const Drop` when we are not in a const context has no effect.
|
// `~const Drop` when we are not in a const context has no effect.
|
||||||
|
@ -911,9 +911,10 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
fn assemble_const_drop_candidates(
|
fn assemble_const_drop_candidates<'a>(
|
||||||
&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>> {
|
) -> Result<(), SelectionError<'tcx>> {
|
||||||
let mut stack: Vec<(Ty<'tcx>, usize)> = vec![(obligation.self_ty().skip_binder(), 0)];
|
let mut stack: Vec<(Ty<'tcx>, usize)> = vec![(obligation.self_ty().skip_binder(), 0)];
|
||||||
|
@ -922,7 +923,7 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
|
||||||
let mut noreturn = false;
|
let mut noreturn = false;
|
||||||
|
|
||||||
self.check_recursion_depth(depth, obligation)?;
|
self.check_recursion_depth(depth, obligation)?;
|
||||||
let mut copy_candidates = SelectionCandidateSet { vec: Vec::new(), ambiguous: false };
|
let mut new_candidates = SelectionCandidateSet { vec: Vec::new(), ambiguous: false };
|
||||||
let mut copy_obligation =
|
let mut copy_obligation =
|
||||||
obligation.with(obligation.predicate.rebind(ty::TraitPredicate {
|
obligation.with(obligation.predicate.rebind(ty::TraitPredicate {
|
||||||
trait_ref: ty::TraitRef {
|
trait_ref: ty::TraitRef {
|
||||||
|
@ -933,13 +934,28 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
|
||||||
polarity: ty::ImplPolarity::Positive,
|
polarity: ty::ImplPolarity::Positive,
|
||||||
}));
|
}));
|
||||||
copy_obligation.recursion_depth = depth + 1;
|
copy_obligation.recursion_depth = depth + 1;
|
||||||
self.assemble_candidates_from_impls(©_obligation, &mut copy_candidates);
|
self.assemble_candidates_from_impls(©_obligation, &mut new_candidates);
|
||||||
let copy_conditions = self.copy_clone_conditions(©_obligation);
|
let copy_conditions = self.copy_clone_conditions(©_obligation);
|
||||||
self.assemble_builtin_bound_candidates(copy_conditions, &mut copy_candidates);
|
self.assemble_builtin_bound_candidates(copy_conditions, &mut new_candidates);
|
||||||
if !copy_candidates.vec.is_empty() {
|
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,
|
||||||
|
}));
|
||||||
|
|
||||||
|
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;
|
noreturn = true;
|
||||||
}
|
}
|
||||||
debug!(?copy_candidates.vec, "assemble_const_drop_candidates - copy");
|
debug!(?new_candidates.vec, "assemble_const_drop_candidates");
|
||||||
|
|
||||||
match ty.kind() {
|
match ty.kind() {
|
||||||
ty::Int(_)
|
ty::Int(_)
|
||||||
|
|
20
src/test/ui/rfc-2632-const-trait-impl/const-drop-bound.rs
Normal file
20
src/test/ui/rfc-2632-const-trait-impl/const-drop-bound.rs
Normal file
|
@ -0,0 +1,20 @@
|
||||||
|
// check-pass
|
||||||
|
|
||||||
|
#![feature(const_trait_impl)]
|
||||||
|
#![feature(const_fn_trait_bound)]
|
||||||
|
#![feature(const_precise_live_drops)]
|
||||||
|
|
||||||
|
const fn foo<T, E>(res: Result<T, E>) -> Option<T> where E: ~const Drop {
|
||||||
|
match res {
|
||||||
|
Ok(t) => Some(t),
|
||||||
|
Err(_e) => None,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
pub struct Foo<T>(T);
|
||||||
|
|
||||||
|
const fn baz<T: ~const Drop, E: ~const Drop>(res: Result<Foo<T>, Foo<E>>) -> Option<Foo<T>> {
|
||||||
|
foo(res)
|
||||||
|
}
|
||||||
|
|
||||||
|
fn main() {}
|
Loading…
Add table
Add a link
Reference in a new issue