1 //! # Minimal Specialization
3 //! This module contains the checks for sound specialization used when the
4 //! `min_specialization` feature is enabled. This requires that the impl is
5 //! *always applicable*.
7 //! If `impl1` specializes `impl2` then `impl1` is always applicable if we know
8 //! that all the bounds of `impl2` are satisfied, and all of the bounds of
9 //! `impl1` are satisfied for some choice of lifetimes then we know that
10 //! `impl1` applies for any choice of lifetimes.
14 //! To enforce this requirement on specializations we take the following
17 //! 1. Match up the substs for `impl2` so that the implemented trait and
18 //! self-type match those for `impl1`.
19 //! 2. Check for any direct use of `'static` in the substs of `impl2`.
20 //! 3. Check that all of the generic parameters of `impl1` occur at most once
21 //! in the *unconstrained* substs for `impl2`. A parameter is constrained if
22 //! its value is completely determined by an associated type projection
24 //! 4. Check that all predicates on `impl1` either exist on `impl2` (after
25 //! matching substs), or are well-formed predicates for the trait's type
30 //! Suppose we have the following always applicable impl:
32 //! ```ignore (illustrative)
33 //! impl<T> SpecExtend<T> for std::vec::IntoIter<T> { /* specialized impl */ }
34 //! impl<T, I: Iterator<Item=T>> SpecExtend<T> for I { /* default impl */ }
37 //! We get that the subst for `impl2` are `[T, std::vec::IntoIter<T>]`. `T` is
38 //! constrained to be `<I as Iterator>::Item`, so we check only
39 //! `std::vec::IntoIter<T>` for repeated parameters, which it doesn't have. The
40 //! predicates of `impl1` are only `T: Sized`, which is also a predicate of
41 //! `impl2`. So this specialization is sound.
45 //! Unfortunately not all specializations in the standard library are allowed
46 //! by this. So there are two extensions to these rules that allow specializing
47 //! on some traits: that is, using them as bounds on the specializing impl,
48 //! even when they don't occur in the base impl.
50 //! ### rustc_specialization_trait
52 //! If a trait is always applicable, then it's sound to specialize on it. We
53 //! check trait is always applicable in the same way as impls, except that step
54 //! 4 is now "all predicates on `impl1` are always applicable". We require that
55 //! `specialization` or `min_specialization` is enabled to implement these
58 //! ### rustc_unsafe_specialization_marker
60 //! There are also some specialization on traits with no methods, including the
61 //! stable `FusedIterator` trait. We allow marking marker traits with an
62 //! unstable attribute that means we ignore them in point 3 of the checks
63 //! above. This is unsound, in the sense that the specialized impl may be used
64 //! when it doesn't apply, but we allow it in the short term since it can't
65 //! cause use after frees with purely safe code in the same way as specializing
66 //! on traits with methods can.
68 use crate::constrained_generic_params as cgp;
69 use crate::errors::SubstsOnOverriddenImpl;
71 use rustc_data_structures::fx::FxHashSet;
72 use rustc_hir::def_id::{DefId, LocalDefId};
73 use rustc_infer::infer::outlives::env::OutlivesEnvironment;
74 use rustc_infer::infer::TyCtxtInferExt;
75 use rustc_infer::traits::specialization_graph::Node;
76 use rustc_middle::ty::subst::{GenericArg, InternalSubsts, SubstsRef};
77 use rustc_middle::ty::trait_def::TraitSpecializationKind;
78 use rustc_middle::ty::{self, TyCtxt, TypeVisitable};
80 use rustc_trait_selection::traits::error_reporting::InferCtxtExt;
81 use rustc_trait_selection::traits::outlives_bounds::InferCtxtExt as _;
82 use rustc_trait_selection::traits::{self, translate_substs, wf, ObligationCtxt};
84 pub(super) fn check_min_specialization(tcx: TyCtxt<'_>, impl_def_id: LocalDefId) {
85 if let Some(node) = parent_specialization_node(tcx, impl_def_id) {
86 check_always_applicable(tcx, impl_def_id, node);
90 fn parent_specialization_node(tcx: TyCtxt<'_>, impl1_def_id: LocalDefId) -> Option<Node> {
91 let trait_ref = tcx.impl_trait_ref(impl1_def_id)?;
92 let trait_def = tcx.trait_def(trait_ref.def_id);
94 let impl2_node = trait_def.ancestors(tcx, impl1_def_id.to_def_id()).ok()?.nth(1)?;
96 let always_applicable_trait =
97 matches!(trait_def.specialization_kind, TraitSpecializationKind::AlwaysApplicable);
98 if impl2_node.is_from_trait() && !always_applicable_trait {
99 // Implementing a normal trait isn't a specialization.
105 /// Check that `impl1` is a sound specialization
106 fn check_always_applicable(tcx: TyCtxt<'_>, impl1_def_id: LocalDefId, impl2_node: Node) {
107 if let Some((impl1_substs, impl2_substs)) = get_impl_substs(tcx, impl1_def_id, impl2_node) {
108 let impl2_def_id = impl2_node.def_id();
110 "check_always_applicable(\nimpl1_def_id={:?},\nimpl2_def_id={:?},\nimpl2_substs={:?}\n)",
111 impl1_def_id, impl2_def_id, impl2_substs
114 let parent_substs = if impl2_node.is_from_trait() {
115 impl2_substs.to_vec()
117 unconstrained_parent_impl_substs(tcx, impl2_def_id, impl2_substs)
120 let span = tcx.def_span(impl1_def_id);
121 check_static_lifetimes(tcx, &parent_substs, span);
122 check_duplicate_params(tcx, impl1_substs, &parent_substs, span);
123 check_predicates(tcx, impl1_def_id, impl1_substs, impl2_node, impl2_substs, span);
127 /// Given a specializing impl `impl1`, and the base impl `impl2`, returns two
128 /// substitutions `(S1, S2)` that equate their trait references. The returned
129 /// types are expressed in terms of the generics of `impl1`.
133 /// impl<A, B> Foo<A> for B { /* impl2 */ }
134 /// impl<C> Foo<Vec<C>> for C { /* impl1 */ }
136 /// Would return `S1 = [C]` and `S2 = [Vec<C>, C]`.
137 fn get_impl_substs<'tcx>(
139 impl1_def_id: LocalDefId,
141 ) -> Option<(SubstsRef<'tcx>, SubstsRef<'tcx>)> {
142 tcx.infer_ctxt().enter(|ref infcx| {
143 let ocx = ObligationCtxt::new(infcx);
144 let param_env = tcx.param_env(impl1_def_id);
145 let impl1_hir_id = tcx.hir().local_def_id_to_hir_id(impl1_def_id);
147 let assumed_wf_types =
148 ocx.assumed_wf_types(param_env, tcx.def_span(impl1_def_id), impl1_def_id);
150 let impl1_substs = InternalSubsts::identity_for_item(tcx, impl1_def_id.to_def_id());
152 translate_substs(infcx, param_env, impl1_def_id.to_def_id(), impl1_substs, impl2_node);
154 let errors = ocx.select_all_or_error();
155 if !errors.is_empty() {
156 ocx.infcx.report_fulfillment_errors(&errors, None, false);
160 let implied_bounds = infcx.implied_bounds_tys(param_env, impl1_hir_id, assumed_wf_types);
161 let outlives_env = OutlivesEnvironment::with_bounds(param_env, Some(infcx), implied_bounds);
162 infcx.check_region_obligations_and_report_errors(impl1_def_id, &outlives_env);
163 let Ok(impl2_substs) = infcx.fully_resolve(impl2_substs) else {
164 let span = tcx.def_span(impl1_def_id);
165 tcx.sess.emit_err(SubstsOnOverriddenImpl { span });
168 Some((impl1_substs, impl2_substs))
172 /// Returns a list of all of the unconstrained subst of the given impl.
174 /// For example given the impl:
176 /// impl<'a, T, I> ... where &'a I: IntoIterator<Item=&'a T>
178 /// This would return the substs corresponding to `['a, I]`, because knowing
179 /// `'a` and `I` determines the value of `T`.
180 fn unconstrained_parent_impl_substs<'tcx>(
183 impl_substs: SubstsRef<'tcx>,
184 ) -> Vec<GenericArg<'tcx>> {
185 let impl_generic_predicates = tcx.predicates_of(impl_def_id);
186 let mut unconstrained_parameters = FxHashSet::default();
187 let mut constrained_params = FxHashSet::default();
188 let impl_trait_ref = tcx.impl_trait_ref(impl_def_id);
190 // Unfortunately the functions in `constrained_generic_parameters` don't do
191 // what we want here. We want only a list of constrained parameters while
192 // the functions in `cgp` add the constrained parameters to a list of
193 // unconstrained parameters.
194 for (predicate, _) in impl_generic_predicates.predicates.iter() {
195 if let ty::PredicateKind::Projection(proj) = predicate.kind().skip_binder() {
196 let projection_ty = proj.projection_ty;
197 let projected_ty = proj.term;
199 let unbound_trait_ref = projection_ty.trait_ref(tcx);
200 if Some(unbound_trait_ref) == impl_trait_ref {
204 unconstrained_parameters.extend(cgp::parameters_for(&projection_ty, true));
206 for param in cgp::parameters_for(&projected_ty, false) {
207 if !unconstrained_parameters.contains(¶m) {
208 constrained_params.insert(param.0);
212 unconstrained_parameters.extend(cgp::parameters_for(&projected_ty, true));
219 .filter(|&(idx, _)| !constrained_params.contains(&(idx as u32)))
224 /// Check that parameters of the derived impl don't occur more than once in the
225 /// equated substs of the base impl.
227 /// For example forbid the following:
229 /// impl<A> Tr for A { }
230 /// impl<B> Tr for (B, B) { }
232 /// Note that only consider the unconstrained parameters of the base impl:
234 /// impl<S, I: IntoIterator<Item = S>> Tr<S> for I { }
235 /// impl<T> Tr<T> for Vec<T> { }
237 /// The substs for the parent impl here are `[T, Vec<T>]`, which repeats `T`,
238 /// but `S` is constrained in the parent impl, so `parent_substs` is only
239 /// `[Vec<T>]`. This means we allow this impl.
240 fn check_duplicate_params<'tcx>(
242 impl1_substs: SubstsRef<'tcx>,
243 parent_substs: &Vec<GenericArg<'tcx>>,
246 let mut base_params = cgp::parameters_for(parent_substs, true);
247 base_params.sort_by_key(|param| param.0);
248 if let (_, [duplicate, ..]) = base_params.partition_dedup() {
249 let param = impl1_substs[duplicate.0 as usize];
251 .struct_span_err(span, &format!("specializing impl repeats parameter `{}`", param))
256 /// Check that `'static` lifetimes are not introduced by the specializing impl.
258 /// For example forbid the following:
260 /// impl<A> Tr for A { }
261 /// impl Tr for &'static i32 { }
262 fn check_static_lifetimes<'tcx>(
264 parent_substs: &Vec<GenericArg<'tcx>>,
267 if tcx.any_free_region_meets(parent_substs, |r| r.is_static()) {
268 tcx.sess.struct_span_err(span, "cannot specialize on `'static` lifetime").emit();
272 /// Check whether predicates on the specializing impl (`impl1`) are allowed.
274 /// Each predicate `P` must be:
276 /// * global (not reference any parameters)
277 /// * `T: Tr` predicate where `Tr` is an always-applicable trait
278 /// * on the base `impl impl2`
279 /// * Currently this check is done using syntactic equality, which is
280 /// conservative but generally sufficient.
281 /// * a well-formed predicate of a type argument of the trait being implemented,
282 /// including the `Self`-type.
283 fn check_predicates<'tcx>(
285 impl1_def_id: LocalDefId,
286 impl1_substs: SubstsRef<'tcx>,
288 impl2_substs: SubstsRef<'tcx>,
291 let instantiated = tcx.predicates_of(impl1_def_id).instantiate(tcx, impl1_substs);
292 let impl1_predicates: Vec<_> = traits::elaborate_predicates_with_span(
295 instantiated.predicates,
296 // Don't drop predicates (unsound!) because `spans` is too short
297 instantiated.spans.into_iter().chain(std::iter::repeat(span)),
300 .map(|obligation| (obligation.predicate, obligation.cause.span))
303 let mut impl2_predicates = if impl2_node.is_from_trait() {
304 // Always applicable traits have to be always applicable without any
308 traits::elaborate_predicates(
310 tcx.predicates_of(impl2_node.def_id())
311 .instantiate(tcx, impl2_substs)
315 .map(|obligation| obligation.predicate)
319 "check_always_applicable(\nimpl1_predicates={:?},\nimpl2_predicates={:?}\n)",
320 impl1_predicates, impl2_predicates,
323 // Since impls of always applicable traits don't get to assume anything, we
324 // can also assume their supertraits apply.
326 // For example, we allow:
328 // #[rustc_specialization_trait]
329 // trait AlwaysApplicable: Debug { }
331 // impl<T> Tr for T { }
332 // impl<T: AlwaysApplicable> Tr for T { }
334 // Specializing on `AlwaysApplicable` allows also specializing on `Debug`
335 // which is sound because we forbid impls like the following
337 // impl<D: Debug> AlwaysApplicable for D { }
338 let always_applicable_traits = impl1_predicates.iter().copied().filter(|&(predicate, _)| {
340 trait_predicate_kind(tcx, predicate),
341 Some(TraitSpecializationKind::AlwaysApplicable)
345 // Include the well-formed predicates of the type parameters of the impl.
346 for arg in tcx.impl_trait_ref(impl1_def_id).unwrap().substs {
347 tcx.infer_ctxt().enter(|ref infcx| {
348 let obligations = wf::obligations(
350 tcx.param_env(impl1_def_id),
351 tcx.hir().local_def_id_to_hir_id(impl1_def_id),
358 assert!(!obligations.needs_infer());
359 impl2_predicates.extend(
360 traits::elaborate_obligations(tcx, obligations)
361 .map(|obligation| obligation.predicate),
365 impl2_predicates.extend(
366 traits::elaborate_predicates_with_span(tcx, always_applicable_traits)
367 .map(|obligation| obligation.predicate),
370 for (predicate, span) in impl1_predicates {
371 if !impl2_predicates.contains(&predicate) {
372 check_specialization_on(tcx, predicate, span)
377 fn check_specialization_on<'tcx>(tcx: TyCtxt<'tcx>, predicate: ty::Predicate<'tcx>, span: Span) {
378 debug!("can_specialize_on(predicate = {:?})", predicate);
379 match predicate.kind().skip_binder() {
380 // Global predicates are either always true or always false, so we
381 // are fine to specialize on.
382 _ if predicate.is_global() => (),
383 // We allow specializing on explicitly marked traits with no associated
385 ty::PredicateKind::Trait(ty::TraitPredicate {
387 constness: ty::BoundConstness::NotConst,
391 trait_predicate_kind(tcx, predicate),
392 Some(TraitSpecializationKind::Marker)
398 "cannot specialize on trait `{}`",
399 tcx.def_path_str(trait_ref.def_id),
405 ty::PredicateKind::Projection(ty::ProjectionPredicate { projection_ty, term }) => {
409 &format!("cannot specialize on associated type `{projection_ty} == {term}`",),
415 .struct_span_err(span, &format!("cannot specialize on predicate `{}`", predicate))
421 fn trait_predicate_kind<'tcx>(
423 predicate: ty::Predicate<'tcx>,
424 ) -> Option<TraitSpecializationKind> {
425 match predicate.kind().skip_binder() {
426 ty::PredicateKind::Trait(ty::TraitPredicate { trait_ref, constness: _, polarity: _ }) => {
427 Some(tcx.trait_def(trait_ref.def_id).specialization_kind)
429 ty::PredicateKind::RegionOutlives(_)
430 | ty::PredicateKind::TypeOutlives(_)
431 | ty::PredicateKind::Projection(_)
432 | ty::PredicateKind::WellFormed(_)
433 | ty::PredicateKind::Subtype(_)
434 | ty::PredicateKind::Coerce(_)
435 | ty::PredicateKind::ObjectSafe(_)
436 | ty::PredicateKind::ClosureKind(..)
437 | ty::PredicateKind::ConstEvaluatable(..)
438 | ty::PredicateKind::ConstEquate(..)
439 | ty::PredicateKind::TypeWellFormedFromEnv(..) => None,