Add supertrait item shadowing for type-level path resolution

Author: Amanieu

compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs

@@ -24,6 +24,7 @@ use std::slice;
 use rustc_ast::LitKind;
 use rustc_data_structures::assert_matches;
 use rustc_data_structures::fx::{FxHashSet, FxIndexMap, FxIndexSet};
+use rustc_data_structures::sso::SsoHashSet;
 use rustc_errors::codes::*;
 use rustc_errors::{
     Applicability, Diag, DiagCtxtHandle, ErrorGuaranteed, FatalError, struct_span_code_err,
@@ -1176,6 +1177,69 @@ impl<'tcx> dyn HirTyLowerer<'tcx> + '_ {
         )
     }
 
+    /// When there are multiple traits which contain an identically named
+    /// associated item, this function eliminates any traits which are a
+    /// supertrait of another candidate trait.
+    ///
+    /// This implements RFC #3624.
+    fn collapse_candidates_to_subtrait_pick(
+        &self,
+        matching_candidates: &[ty::PolyTraitRef<'tcx>],
+    ) -> Option<ty::PolyTraitRef<'tcx>> {
+        if !self.tcx().features().supertrait_item_shadowing() {
+            return None;
+        }
+
+        let mut child_trait = matching_candidates[0];
+        let mut supertraits: SsoHashSet<_> =
+            traits::supertrait_def_ids(self.tcx(), child_trait.def_id()).collect();
+
+        let mut remaining_candidates: Vec<_> = matching_candidates[1..].iter().copied().collect();
+        while !remaining_candidates.is_empty() {
+            let mut made_progress = false;
+            let mut next_round = vec![];
+
+            for remaining_trait in remaining_candidates {
+                if supertraits.contains(&remaining_trait.def_id()) {
+                    made_progress = true;
+                    continue;
+                }
+
+                // This pick is not a supertrait of the `child_pick`.
+                // Check if it's a subtrait of the `child_pick`, instead.
+                // If it is, then it must have been a subtrait of every
+                // other pick we've eliminated at this point. It will
+                // take over at this point.
+                let remaining_trait_supertraits: SsoHashSet<_> =
+                    traits::supertrait_def_ids(self.tcx(), remaining_trait.def_id()).collect();
+                if remaining_trait_supertraits.contains(&child_trait.def_id()) {
+                    child_trait = remaining_trait;
+                    supertraits = remaining_trait_supertraits;
+                    made_progress = true;
+                    continue;
+                }
+
+                // `child_pick` is not a supertrait of this pick.
+                // Don't bail here, since we may be comparing two supertraits
+                // of a common subtrait. These two supertraits won't be related
+                // at all, but we will pick them up next round when we find their
+                // child as we continue iterating in this round.
+                next_round.push(remaining_trait);
+            }
+
+            if made_progress {
+                // If we've made progress, iterate again.
+                remaining_candidates = next_round;
+            } else {
+                // Otherwise, we must have at least two candidates which
+                // are not related to each other at all.;
+                return None;
+            }
+        }
+
+        Some(child_trait)
+    }
+
     /// Search for a single trait bound whose trait defines the associated item given by
     /// `assoc_ident`.
     ///
@@ -1215,6 +1279,14 @@ impl<'tcx> dyn HirTyLowerer<'tcx> + '_ {
         if let Some(bound2) = matching_candidates.next() {
             debug!(?bound2);
 
+            // If the other matching candidates are all from supertraits of one
+            // trait, pick the subtrait.
+            let matching_candidates: Vec<_> =
+                [bound, bound2].into_iter().chain(matching_candidates).collect();
+            if let Some(bound) = self.collapse_candidates_to_subtrait_pick(&matching_candidates) {
+                return Ok(bound);
+            }
+
             let assoc_kind_str = errors::assoc_tag_str(assoc_tag);
             let qself_str = qself.to_string(tcx);
             let mut err = self.dcx().create_err(crate::errors::AmbiguousAssocItem {
@@ -1238,7 +1310,7 @@ impl<'tcx> dyn HirTyLowerer<'tcx> + '_ {
             // predicates!).
             // FIXME: Turn this into a structured, translatable & more actionable suggestion.
             let mut where_bounds = vec![];
-            for bound in [bound, bound2].into_iter().chain(matching_candidates) {
+            for bound in matching_candidates {
                 let bound_id = bound.def_id();
                 let assoc_item = tcx.associated_items(bound_id).find_by_ident_and_kind(
                     tcx,

tests/ui/methods/supertrait-shadowing/assoc-const2.rs

@@ -0,0 +1,34 @@
+//@ run-pass
+//@ check-run-results
+
+#![feature(supertrait_item_shadowing)]
+#![feature(min_generic_const_args)]
+#![allow(dead_code, incomplete_features)]
+
+trait A {
+    const CONST: i32;
+}
+impl<T> A for T {
+    const CONST: i32 = 1;
+}
+
+trait B: A {
+    #[type_const]
+    const CONST: i32;
+}
+impl<T> B for T {
+    #[type_const]
+    const CONST: i32 = 2;
+}
+
+trait C: B {}
+impl<T> C for T {}
+
+fn main() {
+    println!("{}", i32::CONST);
+    generic::<u32>();
+}
+
+fn generic<T: C<CONST = 2>>() {
+    println!("{}", T::CONST);
+}

tests/ui/methods/supertrait-shadowing/assoc-const2.run.stdout

@@ -0,0 +1,2 @@
+2
+2

tests/ui/methods/supertrait-shadowing/assoc-type.rs

@@ -0,0 +1,37 @@
+//@ run-pass
+//@ check-run-results
+
+#![feature(supertrait_item_shadowing)]
+#![allow(dead_code)]
+
+use std::mem::size_of;
+
+trait A {
+    type T;
+}
+impl<T> A for T {
+    type T = i8;
+}
+
+trait B: A {
+    type T;
+}
+impl<T> B for T {
+    type T = i16;
+}
+
+trait C: B {}
+impl<T> C for T {}
+
+fn main() {
+    generic::<u32>();
+    generic2::<u32>();
+}
+
+fn generic<T: B>() {
+    println!("{}", size_of::<T::T>());
+}
+
+fn generic2<T: C<T = i16>>() {
+    println!("{}", size_of::<T::T>());
+}

tests/ui/methods/supertrait-shadowing/assoc-type.run.stdout

@@ -0,0 +1,2 @@
+2
+2