1 //! Candidate assembly.
3 //! The selection process begins by examining all in-scope impls,
4 //! caller obligations, and so forth and assembling a list of
5 //! candidates. See the [rustc dev guide] for more details.
7 //! [rustc dev guide]:https://rustc-dev-guide.rust-lang.org/traits/resolution.html#candidate-assembly
10 use rustc_infer::traits::ObligationCause;
11 use rustc_infer::traits::{Obligation, SelectionError, TraitObligation};
12 use rustc_middle::ty::{self, Ty, TypeVisitable};
13 use rustc_target::spec::abi::Abi;
16 use crate::traits::query::evaluate_obligation::InferCtxtExt;
17 use crate::traits::util;
19 use super::BuiltinImplConditions;
20 use super::SelectionCandidate::*;
21 use super::{SelectionCandidateSet, SelectionContext, TraitObligationStack};
23 impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
24 #[instrument(skip(self, stack), level = "debug")]
25 pub(super) fn assemble_candidates<'o>(
27 stack: &TraitObligationStack<'o, 'tcx>,
28 ) -> Result<SelectionCandidateSet<'tcx>, SelectionError<'tcx>> {
29 let TraitObligationStack { obligation, .. } = *stack;
30 let obligation = &Obligation {
31 param_env: obligation.param_env,
32 cause: obligation.cause.clone(),
33 recursion_depth: obligation.recursion_depth,
34 predicate: self.infcx.resolve_vars_if_possible(obligation.predicate),
37 if obligation.predicate.skip_binder().self_ty().is_ty_var() {
38 debug!(ty = ?obligation.predicate.skip_binder().self_ty(), "ambiguous inference var or opaque type");
39 // Self is a type variable (e.g., `_: AsRef<str>`).
41 // This is somewhat problematic, as the current scheme can't really
42 // handle it turning to be a projection. This does end up as truly
43 // ambiguous in most cases anyway.
45 // Take the fast path out - this also improves
46 // performance by preventing assemble_candidates_from_impls from
47 // matching every impl for this trait.
48 return Ok(SelectionCandidateSet { vec: vec![], ambiguous: true });
51 let mut candidates = SelectionCandidateSet { vec: Vec::new(), ambiguous: false };
53 // The only way to prove a NotImplemented(T: Foo) predicate is via a negative impl.
54 // There are no compiler built-in rules for this.
55 if obligation.polarity() == ty::ImplPolarity::Negative {
56 self.assemble_candidates_for_trait_alias(obligation, &mut candidates);
57 self.assemble_candidates_from_impls(obligation, &mut candidates);
59 self.assemble_candidates_for_trait_alias(obligation, &mut candidates);
61 // Other bounds. Consider both in-scope bounds from fn decl
62 // and applicable impls. There is a certain set of precedence rules here.
63 let def_id = obligation.predicate.def_id();
64 let lang_items = self.tcx().lang_items();
66 if lang_items.copy_trait() == Some(def_id) {
67 debug!(obligation_self_ty = ?obligation.predicate.skip_binder().self_ty());
69 // User-defined copy impls are permitted, but only for
71 self.assemble_candidates_from_impls(obligation, &mut candidates);
73 // For other types, we'll use the builtin rules.
74 let copy_conditions = self.copy_clone_conditions(obligation);
75 self.assemble_builtin_bound_candidates(copy_conditions, &mut candidates);
76 } else if lang_items.discriminant_kind_trait() == Some(def_id) {
77 // `DiscriminantKind` is automatically implemented for every type.
78 candidates.vec.push(BuiltinCandidate { has_nested: false });
79 } else if lang_items.pointee_trait() == Some(def_id) {
80 // `Pointee` is automatically implemented for every type.
81 candidates.vec.push(BuiltinCandidate { has_nested: false });
82 } else if lang_items.sized_trait() == Some(def_id) {
83 // Sized is never implementable by end-users, it is
84 // always automatically computed.
85 let sized_conditions = self.sized_conditions(obligation);
86 self.assemble_builtin_bound_candidates(sized_conditions, &mut candidates);
87 } else if lang_items.unsize_trait() == Some(def_id) {
88 self.assemble_candidates_for_unsizing(obligation, &mut candidates);
89 } else if lang_items.destruct_trait() == Some(def_id) {
90 self.assemble_const_destruct_candidates(obligation, &mut candidates);
91 } else if lang_items.transmute_trait() == Some(def_id) {
92 // User-defined transmutability impls are permitted.
93 self.assemble_candidates_from_impls(obligation, &mut candidates);
94 self.assemble_candidates_for_transmutability(obligation, &mut candidates);
95 } else if lang_items.tuple_trait() == Some(def_id) {
96 self.assemble_candidate_for_tuple(obligation, &mut candidates);
97 } else if lang_items.pointer_sized() == Some(def_id) {
98 self.assemble_candidate_for_ptr_sized(obligation, &mut candidates);
100 if lang_items.clone_trait() == Some(def_id) {
101 // Same builtin conditions as `Copy`, i.e., every type which has builtin support
102 // for `Copy` also has builtin support for `Clone`, and tuples/arrays of `Clone`
103 // types have builtin support for `Clone`.
104 let clone_conditions = self.copy_clone_conditions(obligation);
105 self.assemble_builtin_bound_candidates(clone_conditions, &mut candidates);
108 if lang_items.gen_trait() == Some(def_id) {
109 self.assemble_generator_candidates(obligation, &mut candidates);
110 } else if lang_items.future_trait() == Some(def_id) {
111 self.assemble_future_candidates(obligation, &mut candidates);
114 self.assemble_closure_candidates(obligation, &mut candidates);
115 self.assemble_fn_pointer_candidates(obligation, &mut candidates);
116 self.assemble_candidates_from_impls(obligation, &mut candidates);
117 self.assemble_candidates_from_object_ty(obligation, &mut candidates);
120 self.assemble_candidates_from_projected_tys(obligation, &mut candidates);
121 self.assemble_candidates_from_caller_bounds(stack, &mut candidates)?;
122 // Auto implementations have lower priority, so we only
123 // consider triggering a default if there is no other impl that can apply.
124 if candidates.vec.is_empty() {
125 self.assemble_candidates_from_auto_impls(obligation, &mut candidates);
128 debug!("candidate list size: {}", candidates.vec.len());
132 #[instrument(level = "debug", skip(self, candidates))]
133 fn assemble_candidates_from_projected_tys(
135 obligation: &TraitObligation<'tcx>,
136 candidates: &mut SelectionCandidateSet<'tcx>,
138 // Before we go into the whole placeholder thing, just
139 // quickly check if the self-type is a projection at all.
140 match obligation.predicate.skip_binder().trait_ref.self_ty().kind() {
141 ty::Projection(_) | ty::Opaque(..) => {}
142 ty::Infer(ty::TyVar(_)) => {
144 obligation.cause.span,
145 "Self=_ should have been handled by assemble_candidates"
153 .probe(|_| self.match_projection_obligation_against_definition_bounds(obligation));
157 .extend(result.into_iter().map(|(idx, constness)| ProjectionCandidate(idx, constness)));
160 /// Given an obligation like `<SomeTrait for T>`, searches the obligations that the caller
161 /// supplied to find out whether it is listed among them.
163 /// Never affects the inference environment.
164 #[instrument(level = "debug", skip(self, stack, candidates))]
165 fn assemble_candidates_from_caller_bounds<'o>(
167 stack: &TraitObligationStack<'o, 'tcx>,
168 candidates: &mut SelectionCandidateSet<'tcx>,
169 ) -> Result<(), SelectionError<'tcx>> {
170 debug!(?stack.obligation);
172 let all_bounds = stack
177 .filter_map(|o| o.to_opt_poly_trait_pred());
179 // Micro-optimization: filter out predicates relating to different traits.
180 let matching_bounds =
181 all_bounds.filter(|p| p.def_id() == stack.obligation.predicate.def_id());
183 // Keep only those bounds which may apply, and propagate overflow if it occurs.
184 for bound in matching_bounds {
185 // FIXME(oli-obk): it is suspicious that we are dropping the constness and
187 let wc = self.where_clause_may_apply(stack, bound.map_bound(|t| t.trait_ref))?;
189 candidates.vec.push(ParamCandidate(bound));
196 fn assemble_generator_candidates(
198 obligation: &TraitObligation<'tcx>,
199 candidates: &mut SelectionCandidateSet<'tcx>,
201 // Okay to skip binder because the substs on generator types never
202 // touch bound regions, they just capture the in-scope
203 // type/region parameters.
204 let self_ty = obligation.self_ty().skip_binder();
205 match self_ty.kind() {
206 // async constructs get lowered to a special kind of generator that
207 // should *not* `impl Generator`.
208 ty::Generator(did, ..) if !self.tcx().generator_is_async(*did) => {
209 debug!(?self_ty, ?obligation, "assemble_generator_candidates",);
211 candidates.vec.push(GeneratorCandidate);
213 ty::Infer(ty::TyVar(_)) => {
214 debug!("assemble_generator_candidates: ambiguous self-type");
215 candidates.ambiguous = true;
221 fn assemble_future_candidates(
223 obligation: &TraitObligation<'tcx>,
224 candidates: &mut SelectionCandidateSet<'tcx>,
226 let self_ty = obligation.self_ty().skip_binder();
227 if let ty::Generator(did, ..) = self_ty.kind() {
228 // async constructs get lowered to a special kind of generator that
229 // should directly `impl Future`.
230 if self.tcx().generator_is_async(*did) {
231 debug!(?self_ty, ?obligation, "assemble_future_candidates",);
233 candidates.vec.push(FutureCandidate);
238 /// Checks for the artificial impl that the compiler will create for an obligation like `X :
239 /// FnMut<..>` where `X` is a closure type.
241 /// Note: the type parameters on a closure candidate are modeled as *output* type
242 /// parameters and hence do not affect whether this trait is a match or not. They will be
243 /// unified during the confirmation step.
244 fn assemble_closure_candidates(
246 obligation: &TraitObligation<'tcx>,
247 candidates: &mut SelectionCandidateSet<'tcx>,
249 let Some(kind) = self.tcx().fn_trait_kind_from_def_id(obligation.predicate.def_id()) else {
253 // Okay to skip binder because the substs on closure types never
254 // touch bound regions, they just capture the in-scope
255 // type/region parameters
256 match *obligation.self_ty().skip_binder().kind() {
257 ty::Closure(_, closure_substs) => {
258 debug!(?kind, ?obligation, "assemble_unboxed_candidates");
259 match self.infcx.closure_kind(closure_substs) {
260 Some(closure_kind) => {
261 debug!(?closure_kind, "assemble_unboxed_candidates");
262 if closure_kind.extends(kind) {
263 candidates.vec.push(ClosureCandidate);
267 debug!("assemble_unboxed_candidates: closure_kind not yet known");
268 candidates.vec.push(ClosureCandidate);
272 ty::Infer(ty::TyVar(_)) => {
273 debug!("assemble_unboxed_closure_candidates: ambiguous self-type");
274 candidates.ambiguous = true;
280 /// Implements one of the `Fn()` family for a fn pointer.
281 fn assemble_fn_pointer_candidates(
283 obligation: &TraitObligation<'tcx>,
284 candidates: &mut SelectionCandidateSet<'tcx>,
286 // We provide impl of all fn traits for fn pointers.
287 if !self.tcx().is_fn_trait(obligation.predicate.def_id()) {
291 // Okay to skip binder because what we are inspecting doesn't involve bound regions.
292 let self_ty = obligation.self_ty().skip_binder();
293 match *self_ty.kind() {
294 ty::Infer(ty::TyVar(_)) => {
295 debug!("assemble_fn_pointer_candidates: ambiguous self-type");
296 candidates.ambiguous = true; // Could wind up being a fn() type.
298 // Provide an impl, but only for suitable `fn` pointers.
301 unsafety: hir::Unsafety::Normal,
305 } = self_ty.fn_sig(self.tcx()).skip_binder()
307 candidates.vec.push(FnPointerCandidate { is_const: false });
310 // Provide an impl for suitable functions, rejecting `#[target_feature]` functions (RFC 2396).
311 ty::FnDef(def_id, _) => {
313 unsafety: hir::Unsafety::Normal,
317 } = self_ty.fn_sig(self.tcx()).skip_binder()
319 if self.tcx().codegen_fn_attrs(def_id).target_features.is_empty() {
322 .push(FnPointerCandidate { is_const: self.tcx().is_const_fn(def_id) });
330 /// Searches for impls that might apply to `obligation`.
331 fn assemble_candidates_from_impls(
333 obligation: &TraitObligation<'tcx>,
334 candidates: &mut SelectionCandidateSet<'tcx>,
336 debug!(?obligation, "assemble_candidates_from_impls");
338 // Essentially any user-written impl will match with an error type,
339 // so creating `ImplCandidates` isn't useful. However, we might
340 // end up finding a candidate elsewhere (e.g. a `BuiltinCandidate` for `Sized)
341 // This helps us avoid overflow: see issue #72839
342 // Since compilation is already guaranteed to fail, this is just
343 // to try to show the 'nicest' possible errors to the user.
344 // We don't check for errors in the `ParamEnv` - in practice,
345 // it seems to cause us to be overly aggressive in deciding
346 // to give up searching for candidates, leading to spurious errors.
347 if obligation.predicate.references_error() {
351 self.tcx().for_each_relevant_impl(
352 obligation.predicate.def_id(),
353 obligation.predicate.skip_binder().trait_ref.self_ty(),
355 // Before we create the substitutions and everything, first
356 // consider a "quick reject". This avoids creating more types
357 // and so forth that we need to.
358 let impl_trait_ref = self.tcx().bound_impl_trait_ref(impl_def_id).unwrap();
359 if self.fast_reject_trait_refs(obligation, &impl_trait_ref.0) {
363 self.infcx.probe(|_| {
364 if let Ok(_substs) = self.match_impl(impl_def_id, impl_trait_ref, obligation) {
365 candidates.vec.push(ImplCandidate(impl_def_id));
372 fn assemble_candidates_from_auto_impls(
374 obligation: &TraitObligation<'tcx>,
375 candidates: &mut SelectionCandidateSet<'tcx>,
377 // Okay to skip binder here because the tests we do below do not involve bound regions.
378 let self_ty = obligation.self_ty().skip_binder();
379 debug!(?self_ty, "assemble_candidates_from_auto_impls");
381 let def_id = obligation.predicate.def_id();
383 if self.tcx().trait_is_auto(def_id) {
384 match self_ty.kind() {
386 // For object types, we don't know what the closed
387 // over types are. This means we conservatively
388 // say nothing; a candidate may be added by
389 // `assemble_candidates_from_object_ty`.
392 // Since the contents of foreign types is unknown,
393 // we don't add any `..` impl. Default traits could
394 // still be provided by a manual implementation for
395 // this trait and type.
397 ty::Param(..) | ty::Projection(..) => {
398 // In these cases, we don't know what the actual
399 // type is. Therefore, we cannot break it down
400 // into its constituent types. So we don't
401 // consider the `..` impl but instead just add no
402 // candidates: this means that typeck will only
403 // succeed if there is another reason to believe
404 // that this obligation holds. That could be a
405 // where-clause or, in the case of an object type,
406 // it could be that the object type lists the
407 // trait (e.g., `Foo+Send : Send`). See
408 // `ui/typeck/typeck-default-trait-impl-send-param.rs`
409 // for an example of a test case that exercises
412 ty::Infer(ty::TyVar(_)) => {
413 // The auto impl might apply; we don't know.
414 candidates.ambiguous = true;
416 ty::Generator(_, _, movability)
417 if self.tcx().lang_items().unpin_trait() == Some(def_id) =>
420 hir::Movability::Static => {
421 // Immovable generators are never `Unpin`, so
422 // suppress the normal auto-impl candidate for it.
424 hir::Movability::Movable => {
425 // Movable generators are always `Unpin`, so add an
426 // unconditional builtin candidate.
427 candidates.vec.push(BuiltinCandidate { has_nested: false });
432 _ => candidates.vec.push(AutoImplCandidate),
437 /// Searches for impls that might apply to `obligation`.
438 fn assemble_candidates_from_object_ty(
440 obligation: &TraitObligation<'tcx>,
441 candidates: &mut SelectionCandidateSet<'tcx>,
444 self_ty = ?obligation.self_ty().skip_binder(),
445 "assemble_candidates_from_object_ty",
448 self.infcx.probe(|_snapshot| {
449 // The code below doesn't care about regions, and the
450 // self-ty here doesn't escape this probe, so just erase
452 let self_ty = self.tcx().erase_late_bound_regions(obligation.self_ty());
453 let poly_trait_ref = match self_ty.kind() {
454 ty::Dynamic(ref data, ..) => {
455 if data.auto_traits().any(|did| did == obligation.predicate.def_id()) {
457 "assemble_candidates_from_object_ty: matched builtin bound, \
460 candidates.vec.push(BuiltinObjectCandidate);
464 if let Some(principal) = data.principal() {
465 if !self.infcx.tcx.features().object_safe_for_dispatch {
466 principal.with_self_ty(self.tcx(), self_ty)
467 } else if self.tcx().is_object_safe(principal.def_id()) {
468 principal.with_self_ty(self.tcx(), self_ty)
473 // Only auto trait bounds exist.
477 ty::Infer(ty::TyVar(_)) => {
478 debug!("assemble_candidates_from_object_ty: ambiguous");
479 candidates.ambiguous = true; // could wind up being an object type
485 debug!(?poly_trait_ref, "assemble_candidates_from_object_ty");
487 let poly_trait_predicate = self.infcx.resolve_vars_if_possible(obligation.predicate);
488 let placeholder_trait_predicate =
489 self.infcx.replace_bound_vars_with_placeholders(poly_trait_predicate);
491 // Count only those upcast versions that match the trait-ref
492 // we are looking for. Specifically, do not only check for the
493 // correct trait, but also the correct type parameters.
494 // For example, we may be trying to upcast `Foo` to `Bar<i32>`,
495 // but `Foo` is declared as `trait Foo: Bar<u32>`.
496 let candidate_supertraits = util::supertraits(self.tcx(), poly_trait_ref)
498 .filter(|&(_, upcast_trait_ref)| {
499 self.infcx.probe(|_| {
500 self.match_normalize_trait_ref(
503 placeholder_trait_predicate.trait_ref,
508 .map(|(idx, _)| ObjectCandidate(idx));
510 candidates.vec.extend(candidate_supertraits);
514 /// Temporary migration for #89190
515 fn need_migrate_deref_output_trait_object(
518 param_env: ty::ParamEnv<'tcx>,
519 cause: &ObligationCause<'tcx>,
520 ) -> Option<ty::PolyExistentialTraitRef<'tcx>> {
521 let tcx = self.tcx();
522 if tcx.features().trait_upcasting {
527 let trait_ref = tcx.mk_trait_ref(tcx.lang_items().deref_trait()?, [ty]);
530 traits::Obligation::new(tcx, cause.clone(), param_env, ty::Binder::dummy(trait_ref));
531 if !self.infcx.predicate_may_hold(&obligation) {
535 self.infcx.probe(|_| {
536 let ty = traits::normalize_projection_type(
540 item_def_id: tcx.lang_items().deref_target()?,
541 substs: trait_ref.substs,
545 // We're *intentionally* throwing these away,
546 // since we don't actually use them.
552 if let ty::Dynamic(data, ..) = ty.kind() { data.principal() } else { None }
556 /// Searches for unsizing that might apply to `obligation`.
557 fn assemble_candidates_for_unsizing(
559 obligation: &TraitObligation<'tcx>,
560 candidates: &mut SelectionCandidateSet<'tcx>,
562 // We currently never consider higher-ranked obligations e.g.
563 // `for<'a> &'a T: Unsize<Trait+'a>` to be implemented. This is not
564 // because they are a priori invalid, and we could potentially add support
565 // for them later, it's just that there isn't really a strong need for it.
566 // A `T: Unsize<U>` obligation is always used as part of a `T: CoerceUnsize<U>`
567 // impl, and those are generally applied to concrete types.
569 // That said, one might try to write a fn with a where clause like
570 // for<'a> Foo<'a, T>: Unsize<Foo<'a, Trait>>
571 // where the `'a` is kind of orthogonal to the relevant part of the `Unsize`.
572 // Still, you'd be more likely to write that where clause as
574 // so it seems ok if we (conservatively) fail to accept that `Unsize`
575 // obligation above. Should be possible to extend this in the future.
576 let Some(source) = obligation.self_ty().no_bound_vars() else {
577 // Don't add any candidates if there are bound regions.
580 let target = obligation.predicate.skip_binder().trait_ref.substs.type_at(1);
582 debug!(?source, ?target, "assemble_candidates_for_unsizing");
584 match (source.kind(), target.kind()) {
585 // Trait+Kx+'a -> Trait+Ky+'b (upcasts).
586 (&ty::Dynamic(ref data_a, _, ty::Dyn), &ty::Dynamic(ref data_b, _, ty::Dyn)) => {
587 // Upcast coercions permit several things:
589 // 1. Dropping auto traits, e.g., `Foo + Send` to `Foo`
590 // 2. Tightening the region bound, e.g., `Foo + 'a` to `Foo + 'b` if `'a: 'b`
591 // 3. Tightening trait to its super traits, eg. `Foo` to `Bar` if `Foo: Bar`
593 // Note that neither of the first two of these changes requires any
594 // change at runtime. The third needs to change pointer metadata at runtime.
596 // We always perform upcasting coercions when we can because of reason
597 // #2 (region bounds).
598 let auto_traits_compatible = data_b
600 // All of a's auto traits need to be in b's auto traits.
601 .all(|b| data_a.auto_traits().any(|a| a == b));
602 if auto_traits_compatible {
603 let principal_def_id_a = data_a.principal_def_id();
604 let principal_def_id_b = data_b.principal_def_id();
605 if principal_def_id_a == principal_def_id_b {
607 candidates.vec.push(BuiltinUnsizeCandidate);
608 } else if principal_def_id_a.is_some() && principal_def_id_b.is_some() {
609 // not casual unsizing, now check whether this is trait upcasting coercion.
610 let principal_a = data_a.principal().unwrap();
611 let target_trait_did = principal_def_id_b.unwrap();
612 let source_trait_ref = principal_a.with_self_ty(self.tcx(), source);
613 if let Some(deref_trait_ref) = self.need_migrate_deref_output_trait_object(
615 obligation.param_env,
618 if deref_trait_ref.def_id() == target_trait_did {
623 for (idx, upcast_trait_ref) in
624 util::supertraits(self.tcx(), source_trait_ref).enumerate()
626 if upcast_trait_ref.def_id() == target_trait_did {
627 candidates.vec.push(TraitUpcastingUnsizeCandidate(idx));
635 (_, &ty::Dynamic(_, _, ty::Dyn)) => {
636 candidates.vec.push(BuiltinUnsizeCandidate);
639 // Ambiguous handling is below `T` -> `Trait`, because inference
640 // variables can still implement `Unsize<Trait>` and nested
641 // obligations will have the final say (likely deferred).
642 (&ty::Infer(ty::TyVar(_)), _) | (_, &ty::Infer(ty::TyVar(_))) => {
643 debug!("assemble_candidates_for_unsizing: ambiguous");
644 candidates.ambiguous = true;
648 (&ty::Array(..), &ty::Slice(_)) => {
649 candidates.vec.push(BuiltinUnsizeCandidate);
652 // `Struct<T>` -> `Struct<U>`
653 (&ty::Adt(def_id_a, _), &ty::Adt(def_id_b, _)) if def_id_a.is_struct() => {
654 if def_id_a == def_id_b {
655 candidates.vec.push(BuiltinUnsizeCandidate);
659 // `(.., T)` -> `(.., U)`
660 (&ty::Tuple(tys_a), &ty::Tuple(tys_b)) => {
661 if tys_a.len() == tys_b.len() {
662 candidates.vec.push(BuiltinUnsizeCandidate);
670 #[instrument(level = "debug", skip(self, obligation, candidates))]
671 fn assemble_candidates_for_transmutability(
673 obligation: &TraitObligation<'tcx>,
674 candidates: &mut SelectionCandidateSet<'tcx>,
676 if obligation.has_non_region_param() {
680 if obligation.has_non_region_infer() {
681 candidates.ambiguous = true;
685 candidates.vec.push(TransmutabilityCandidate);
688 #[instrument(level = "debug", skip(self, obligation, candidates))]
689 fn assemble_candidates_for_trait_alias(
691 obligation: &TraitObligation<'tcx>,
692 candidates: &mut SelectionCandidateSet<'tcx>,
694 // Okay to skip binder here because the tests we do below do not involve bound regions.
695 let self_ty = obligation.self_ty().skip_binder();
698 let def_id = obligation.predicate.def_id();
700 if self.tcx().is_trait_alias(def_id) {
701 candidates.vec.push(TraitAliasCandidate);
705 /// Assembles the trait which are built-in to the language itself:
706 /// `Copy`, `Clone` and `Sized`.
707 #[instrument(level = "debug", skip(self, candidates))]
708 fn assemble_builtin_bound_candidates(
710 conditions: BuiltinImplConditions<'tcx>,
711 candidates: &mut SelectionCandidateSet<'tcx>,
714 BuiltinImplConditions::Where(nested) => {
717 .push(BuiltinCandidate { has_nested: !nested.skip_binder().is_empty() });
719 BuiltinImplConditions::None => {}
720 BuiltinImplConditions::Ambiguous => {
721 candidates.ambiguous = true;
726 fn assemble_const_destruct_candidates(
728 obligation: &TraitObligation<'tcx>,
729 candidates: &mut SelectionCandidateSet<'tcx>,
731 // If the predicate is `~const Destruct` in a non-const environment, we don't actually need
732 // to check anything. We'll short-circuit checking any obligations in confirmation, too.
733 if !obligation.is_const() {
734 candidates.vec.push(ConstDestructCandidate(None));
738 let self_ty = self.infcx.shallow_resolve(obligation.self_ty());
739 match self_ty.skip_binder().kind() {
746 | ty::Projection(_) => {
747 // We don't know if these are `~const Destruct`, at least
748 // not structurally... so don't push a candidate.
756 | ty::Infer(ty::IntVar(_))
757 | ty::Infer(ty::FloatVar(_))
770 | ty::GeneratorWitness(_) => {
771 // These are built-in, and cannot have a custom `impl const Destruct`.
772 candidates.vec.push(ConstDestructCandidate(None));
776 // Find a custom `impl Drop` impl, if it exists
777 let relevant_impl = self.tcx().find_map_relevant_impl(
778 self.tcx().require_lang_item(LangItem::Drop, None),
779 obligation.predicate.skip_binder().trait_ref.self_ty(),
783 if let Some(impl_def_id) = relevant_impl {
784 // Check that `impl Drop` is actually const, if there is a custom impl
785 if self.tcx().constness(impl_def_id) == hir::Constness::Const {
786 candidates.vec.push(ConstDestructCandidate(Some(impl_def_id)));
789 // Otherwise check the ADT like a built-in type (structurally)
790 candidates.vec.push(ConstDestructCandidate(None));
795 candidates.ambiguous = true;
800 fn assemble_candidate_for_tuple(
802 obligation: &TraitObligation<'tcx>,
803 candidates: &mut SelectionCandidateSet<'tcx>,
805 let self_ty = self.infcx.shallow_resolve(obligation.self_ty().skip_binder());
806 match self_ty.kind() {
808 candidates.vec.push(BuiltinCandidate { has_nested: false });
810 ty::Infer(ty::TyVar(_)) => {
811 candidates.ambiguous = true;
827 | ty::Dynamic(_, _, _)
829 | ty::Generator(_, _, _)
830 | ty::GeneratorWitness(_)
838 | ty::Placeholder(_) => {}
842 fn assemble_candidate_for_ptr_sized(
844 obligation: &TraitObligation<'tcx>,
845 candidates: &mut SelectionCandidateSet<'tcx>,
847 // The regions of a type don't affect the size of the type
850 .erase_regions(self.tcx().erase_late_bound_regions(obligation.predicate.self_ty()));
852 // But if there are inference variables, we have to wait until it's resolved.
853 if self_ty.has_non_region_infer() {
854 candidates.ambiguous = true;
859 self.tcx().layout_of(ty::ParamEnv::empty().and(self.tcx().types.usize)).unwrap().layout;
860 if let Ok(layout) = self.tcx().layout_of(obligation.param_env.and(self_ty))
861 && layout.layout.size() == usize_layout.size()
862 && layout.layout.align().abi == usize_layout.align().abi
864 candidates.vec.push(BuiltinCandidate { has_nested: false });