diff options
Diffstat (limited to 'crates/ra_hir_ty/src/method_resolution.rs')
-rw-r--r-- | crates/ra_hir_ty/src/method_resolution.rs | 203 |
1 files changed, 99 insertions, 104 deletions
diff --git a/crates/ra_hir_ty/src/method_resolution.rs b/crates/ra_hir_ty/src/method_resolution.rs index c3edd6885..a45febbf7 100644 --- a/crates/ra_hir_ty/src/method_resolution.rs +++ b/crates/ra_hir_ty/src/method_resolution.rs | |||
@@ -39,136 +39,131 @@ impl TyFingerprint { | |||
39 | } | 39 | } |
40 | } | 40 | } |
41 | 41 | ||
42 | /// A queryable and mergeable collection of impls. | 42 | /// Trait impls defined or available in some crate. |
43 | #[derive(Debug, PartialEq, Eq)] | 43 | #[derive(Debug, Eq, PartialEq)] |
44 | pub struct CrateImplDefs { | 44 | pub struct TraitImpls { |
45 | inherent_impls: FxHashMap<TyFingerprint, Vec<ImplId>>, | 45 | // If the `Option<TyFingerprint>` is `None`, the impl may apply to any self type. |
46 | impls_by_trait: FxHashMap<TraitId, FxHashMap<Option<TyFingerprint>, Vec<ImplId>>>, | 46 | map: FxHashMap<TraitId, FxHashMap<Option<TyFingerprint>, Vec<ImplId>>>, |
47 | } | 47 | } |
48 | 48 | ||
49 | impl CrateImplDefs { | 49 | impl TraitImpls { |
50 | pub(crate) fn impls_in_crate_query(db: &dyn HirDatabase, krate: CrateId) -> Arc<CrateImplDefs> { | 50 | pub(crate) fn trait_impls_in_crate_query(db: &dyn HirDatabase, krate: CrateId) -> Arc<Self> { |
51 | let _p = profile("impls_in_crate_query"); | 51 | let _p = profile("trait_impls_in_crate_query"); |
52 | let mut res = CrateImplDefs { | 52 | let mut impls = Self { map: FxHashMap::default() }; |
53 | inherent_impls: FxHashMap::default(), | ||
54 | impls_by_trait: FxHashMap::default(), | ||
55 | }; | ||
56 | res.fill(db, krate); | ||
57 | 53 | ||
58 | Arc::new(res) | 54 | let crate_def_map = db.crate_def_map(krate); |
55 | for (_module_id, module_data) in crate_def_map.modules.iter() { | ||
56 | for impl_id in module_data.scope.impls() { | ||
57 | let target_trait = match db.impl_trait(impl_id) { | ||
58 | Some(tr) => tr.value.trait_, | ||
59 | None => continue, | ||
60 | }; | ||
61 | let self_ty = db.impl_self_ty(impl_id); | ||
62 | let self_ty_fp = TyFingerprint::for_impl(&self_ty.value); | ||
63 | impls | ||
64 | .map | ||
65 | .entry(target_trait) | ||
66 | .or_default() | ||
67 | .entry(self_ty_fp) | ||
68 | .or_default() | ||
69 | .push(impl_id); | ||
70 | } | ||
71 | } | ||
72 | |||
73 | Arc::new(impls) | ||
59 | } | 74 | } |
60 | 75 | ||
61 | /// Collects all impls from transitive dependencies of `krate` that may be used by `krate`. | 76 | pub(crate) fn trait_impls_in_deps_query(db: &dyn HirDatabase, krate: CrateId) -> Arc<Self> { |
62 | /// | 77 | let _p = profile("trait_impls_in_deps_query"); |
63 | /// The full set of impls that can be used by `krate` is the returned map plus all the impls | ||
64 | /// from `krate` itself. | ||
65 | pub(crate) fn impls_from_deps_query( | ||
66 | db: &dyn HirDatabase, | ||
67 | krate: CrateId, | ||
68 | ) -> Arc<CrateImplDefs> { | ||
69 | let _p = profile("impls_from_deps_query"); | ||
70 | let crate_graph = db.crate_graph(); | 78 | let crate_graph = db.crate_graph(); |
71 | let mut res = CrateImplDefs { | 79 | let mut res = Self { map: FxHashMap::default() }; |
72 | inherent_impls: FxHashMap::default(), | ||
73 | impls_by_trait: FxHashMap::default(), | ||
74 | }; | ||
75 | 80 | ||
76 | // For each dependency, calculate `impls_from_deps` recursively, then add its own | 81 | for krate in crate_graph.transitive_deps(krate) { |
77 | // `impls_in_crate`. | 82 | res.merge(&db.trait_impls_in_crate(krate)); |
78 | // As we might visit crates multiple times, `merge` has to deduplicate impls to avoid | ||
79 | // wasting memory. | ||
80 | for dep in &crate_graph[krate].dependencies { | ||
81 | res.merge(&db.impls_from_deps(dep.crate_id)); | ||
82 | res.merge(&db.impls_in_crate(dep.crate_id)); | ||
83 | } | 83 | } |
84 | 84 | ||
85 | Arc::new(res) | 85 | Arc::new(res) |
86 | } | 86 | } |
87 | 87 | ||
88 | fn fill(&mut self, db: &dyn HirDatabase, krate: CrateId) { | ||
89 | let crate_def_map = db.crate_def_map(krate); | ||
90 | for (_module_id, module_data) in crate_def_map.modules.iter() { | ||
91 | for impl_id in module_data.scope.impls() { | ||
92 | match db.impl_trait(impl_id) { | ||
93 | Some(tr) => { | ||
94 | let self_ty = db.impl_self_ty(impl_id); | ||
95 | let self_ty_fp = TyFingerprint::for_impl(&self_ty.value); | ||
96 | self.impls_by_trait | ||
97 | .entry(tr.value.trait_) | ||
98 | .or_default() | ||
99 | .entry(self_ty_fp) | ||
100 | .or_default() | ||
101 | .push(impl_id); | ||
102 | } | ||
103 | None => { | ||
104 | let self_ty = db.impl_self_ty(impl_id); | ||
105 | if let Some(self_ty_fp) = TyFingerprint::for_impl(&self_ty.value) { | ||
106 | self.inherent_impls.entry(self_ty_fp).or_default().push(impl_id); | ||
107 | } | ||
108 | } | ||
109 | } | ||
110 | } | ||
111 | } | ||
112 | } | ||
113 | |||
114 | fn merge(&mut self, other: &Self) { | 88 | fn merge(&mut self, other: &Self) { |
115 | for (fp, impls) in &other.inherent_impls { | 89 | for (trait_, other_map) in &other.map { |
116 | let vec = self.inherent_impls.entry(*fp).or_default(); | 90 | let map = self.map.entry(*trait_).or_default(); |
117 | vec.extend(impls); | ||
118 | vec.sort(); | ||
119 | vec.dedup(); | ||
120 | } | ||
121 | |||
122 | for (trait_, other_map) in &other.impls_by_trait { | ||
123 | let map = self.impls_by_trait.entry(*trait_).or_default(); | ||
124 | for (fp, impls) in other_map { | 91 | for (fp, impls) in other_map { |
125 | let vec = map.entry(*fp).or_default(); | 92 | let vec = map.entry(*fp).or_default(); |
126 | vec.extend(impls); | 93 | vec.extend(impls); |
127 | vec.sort(); | ||
128 | vec.dedup(); | ||
129 | } | 94 | } |
130 | } | 95 | } |
131 | } | 96 | } |
132 | 97 | ||
133 | pub fn lookup_impl_defs(&self, ty: &Ty) -> impl Iterator<Item = ImplId> + '_ { | 98 | /// Queries all impls of the given trait. |
134 | let fingerprint = TyFingerprint::for_impl(ty); | 99 | pub fn for_trait(&self, trait_: TraitId) -> impl Iterator<Item = ImplId> + '_ { |
135 | fingerprint.and_then(|f| self.inherent_impls.get(&f)).into_iter().flatten().copied() | 100 | self.map |
136 | } | 101 | .get(&trait_) |
137 | |||
138 | pub fn lookup_impl_defs_for_trait(&self, tr: TraitId) -> impl Iterator<Item = ImplId> + '_ { | ||
139 | self.impls_by_trait | ||
140 | .get(&tr) | ||
141 | .into_iter() | 102 | .into_iter() |
142 | .flat_map(|m| m.values().flat_map(|v| v.iter().copied())) | 103 | .flat_map(|map| map.values().flat_map(|v| v.iter().copied())) |
143 | } | 104 | } |
144 | 105 | ||
145 | pub fn lookup_impl_defs_for_trait_and_ty( | 106 | /// Queries all impls of `trait_` that may apply to `self_ty`. |
107 | pub fn for_trait_and_self_ty( | ||
146 | &self, | 108 | &self, |
147 | tr: TraitId, | 109 | trait_: TraitId, |
148 | fp: TyFingerprint, | 110 | self_ty: TyFingerprint, |
149 | ) -> impl Iterator<Item = ImplId> + '_ { | 111 | ) -> impl Iterator<Item = ImplId> + '_ { |
150 | self.impls_by_trait | 112 | self.map |
151 | .get(&tr) | 113 | .get(&trait_) |
152 | .and_then(|m| m.get(&Some(fp))) | ||
153 | .into_iter() | 114 | .into_iter() |
154 | .flatten() | 115 | .flat_map(move |map| map.get(&None).into_iter().chain(map.get(&Some(self_ty)))) |
155 | .copied() | 116 | .flat_map(|v| v.iter().copied()) |
156 | .chain( | 117 | } |
157 | self.impls_by_trait | 118 | |
158 | .get(&tr) | 119 | pub fn all_impls(&self) -> impl Iterator<Item = ImplId> + '_ { |
159 | .and_then(|m| m.get(&None)) | 120 | self.map.values().flat_map(|map| map.values().flat_map(|v| v.iter().copied())) |
160 | .into_iter() | 121 | } |
161 | .flatten() | 122 | } |
162 | .copied(), | 123 | |
163 | ) | 124 | /// Inherent impls defined in some crate. |
125 | /// | ||
126 | /// Inherent impls can only be defined in the crate that also defines the self type of the impl | ||
127 | /// (note that some primitives are considered to be defined by both libcore and liballoc). | ||
128 | /// | ||
129 | /// This makes inherent impl lookup easier than trait impl lookup since we only have to consider a | ||
130 | /// single crate. | ||
131 | #[derive(Debug, Eq, PartialEq)] | ||
132 | pub struct InherentImpls { | ||
133 | map: FxHashMap<TyFingerprint, Vec<ImplId>>, | ||
134 | } | ||
135 | |||
136 | impl InherentImpls { | ||
137 | pub(crate) fn inherent_impls_in_crate_query(db: &dyn HirDatabase, krate: CrateId) -> Arc<Self> { | ||
138 | let mut map: FxHashMap<_, Vec<_>> = FxHashMap::default(); | ||
139 | |||
140 | let crate_def_map = db.crate_def_map(krate); | ||
141 | for (_module_id, module_data) in crate_def_map.modules.iter() { | ||
142 | for impl_id in module_data.scope.impls() { | ||
143 | let data = db.impl_data(impl_id); | ||
144 | if data.target_trait.is_some() { | ||
145 | continue; | ||
146 | } | ||
147 | |||
148 | let self_ty = db.impl_self_ty(impl_id); | ||
149 | if let Some(fp) = TyFingerprint::for_impl(&self_ty.value) { | ||
150 | map.entry(fp).or_default().push(impl_id); | ||
151 | } | ||
152 | } | ||
153 | } | ||
154 | |||
155 | Arc::new(Self { map }) | ||
156 | } | ||
157 | |||
158 | pub fn for_self_ty(&self, self_ty: &Ty) -> &[ImplId] { | ||
159 | match TyFingerprint::for_impl(self_ty) { | ||
160 | Some(fp) => self.map.get(&fp).map(|vec| vec.as_ref()).unwrap_or(&[]), | ||
161 | None => &[], | ||
162 | } | ||
164 | } | 163 | } |
165 | 164 | ||
166 | pub fn all_impls<'a>(&'a self) -> impl Iterator<Item = ImplId> + 'a { | 165 | pub fn all_impls(&self) -> impl Iterator<Item = ImplId> + '_ { |
167 | self.inherent_impls | 166 | self.map.values().flat_map(|v| v.iter().copied()) |
168 | .values() | ||
169 | .chain(self.impls_by_trait.values().flat_map(|m| m.values())) | ||
170 | .flatten() | ||
171 | .copied() | ||
172 | } | 167 | } |
173 | } | 168 | } |
174 | 169 | ||
@@ -525,9 +520,9 @@ fn iterate_inherent_methods( | |||
525 | None => return false, | 520 | None => return false, |
526 | }; | 521 | }; |
527 | for krate in def_crates { | 522 | for krate in def_crates { |
528 | let impls = db.impls_in_crate(krate); | 523 | let impls = db.inherent_impls_in_crate(krate); |
529 | 524 | ||
530 | for impl_def in impls.lookup_impl_defs(&self_ty.value) { | 525 | for &impl_def in impls.for_self_ty(&self_ty.value) { |
531 | for &item in db.impl_data(impl_def).items.iter() { | 526 | for &item in db.impl_data(impl_def).items.iter() { |
532 | if !is_valid_candidate(db, name, receiver_ty, item, self_ty) { | 527 | if !is_valid_candidate(db, name, receiver_ty, item, self_ty) { |
533 | continue; | 528 | continue; |