diff options
Diffstat (limited to 'crates')
66 files changed, 2539 insertions, 1529 deletions
diff --git a/crates/ra_db/Cargo.toml b/crates/ra_db/Cargo.toml index 3394ae8ce..bf1f7920c 100644 --- a/crates/ra_db/Cargo.toml +++ b/crates/ra_db/Cargo.toml | |||
@@ -12,3 +12,4 @@ rustc-hash = "1.0" | |||
12 | ra_syntax = { path = "../ra_syntax" } | 12 | ra_syntax = { path = "../ra_syntax" } |
13 | ra_cfg = { path = "../ra_cfg" } | 13 | ra_cfg = { path = "../ra_cfg" } |
14 | ra_prof = { path = "../ra_prof" } | 14 | ra_prof = { path = "../ra_prof" } |
15 | test_utils = { path = "../test_utils" } | ||
diff --git a/crates/ra_db/src/fixture.rs b/crates/ra_db/src/fixture.rs new file mode 100644 index 000000000..f5dd59f84 --- /dev/null +++ b/crates/ra_db/src/fixture.rs | |||
@@ -0,0 +1,186 @@ | |||
1 | //! FIXME: write short doc here | ||
2 | |||
3 | use std::sync::Arc; | ||
4 | |||
5 | use ra_cfg::CfgOptions; | ||
6 | use rustc_hash::FxHashMap; | ||
7 | use test_utils::{extract_offset, parse_fixture, CURSOR_MARKER}; | ||
8 | |||
9 | use crate::{ | ||
10 | CrateGraph, Edition, FileId, FilePosition, RelativePathBuf, SourceDatabaseExt, SourceRoot, | ||
11 | SourceRootId, | ||
12 | }; | ||
13 | |||
14 | pub const WORKSPACE: SourceRootId = SourceRootId(0); | ||
15 | |||
16 | pub trait WithFixture: Default + SourceDatabaseExt + 'static { | ||
17 | fn with_single_file(text: &str) -> (Self, FileId) { | ||
18 | let mut db = Self::default(); | ||
19 | let file_id = with_single_file(&mut db, text); | ||
20 | (db, file_id) | ||
21 | } | ||
22 | |||
23 | fn with_files(fixture: &str) -> Self { | ||
24 | let mut db = Self::default(); | ||
25 | let pos = with_files(&mut db, fixture); | ||
26 | assert!(pos.is_none()); | ||
27 | db | ||
28 | } | ||
29 | |||
30 | fn with_position(fixture: &str) -> (Self, FilePosition) { | ||
31 | let mut db = Self::default(); | ||
32 | let pos = with_files(&mut db, fixture); | ||
33 | (db, pos.unwrap()) | ||
34 | } | ||
35 | } | ||
36 | |||
37 | impl<DB: SourceDatabaseExt + Default + 'static> WithFixture for DB {} | ||
38 | |||
39 | fn with_single_file(db: &mut dyn SourceDatabaseExt, text: &str) -> FileId { | ||
40 | let file_id = FileId(0); | ||
41 | let rel_path: RelativePathBuf = "/main.rs".into(); | ||
42 | |||
43 | let mut source_root = SourceRoot::default(); | ||
44 | source_root.insert_file(rel_path.clone(), file_id); | ||
45 | |||
46 | let mut crate_graph = CrateGraph::default(); | ||
47 | crate_graph.add_crate_root(file_id, Edition::Edition2018, CfgOptions::default()); | ||
48 | |||
49 | db.set_file_text(file_id, Arc::new(text.to_string())); | ||
50 | db.set_file_relative_path(file_id, rel_path); | ||
51 | db.set_file_source_root(file_id, WORKSPACE); | ||
52 | db.set_source_root(WORKSPACE, Arc::new(source_root)); | ||
53 | db.set_crate_graph(Arc::new(crate_graph)); | ||
54 | |||
55 | file_id | ||
56 | } | ||
57 | |||
58 | fn with_files(db: &mut dyn SourceDatabaseExt, fixture: &str) -> Option<FilePosition> { | ||
59 | let fixture = parse_fixture(fixture); | ||
60 | |||
61 | let mut crate_graph = CrateGraph::default(); | ||
62 | let mut crates = FxHashMap::default(); | ||
63 | let mut crate_deps = Vec::new(); | ||
64 | let mut default_crate_root: Option<FileId> = None; | ||
65 | |||
66 | let mut source_root = SourceRoot::default(); | ||
67 | let mut source_root_id = WORKSPACE; | ||
68 | let mut source_root_prefix: RelativePathBuf = "/".into(); | ||
69 | let mut file_id = FileId(0); | ||
70 | |||
71 | let mut file_position = None; | ||
72 | |||
73 | for entry in fixture.iter() { | ||
74 | let meta = match parse_meta(&entry.meta) { | ||
75 | ParsedMeta::Root { path } => { | ||
76 | let source_root = std::mem::replace(&mut source_root, SourceRoot::default()); | ||
77 | db.set_source_root(source_root_id, Arc::new(source_root)); | ||
78 | source_root_id.0 += 1; | ||
79 | source_root_prefix = path; | ||
80 | continue; | ||
81 | } | ||
82 | ParsedMeta::File(it) => it, | ||
83 | }; | ||
84 | assert!(meta.path.starts_with(&source_root_prefix)); | ||
85 | |||
86 | if let Some(krate) = meta.krate { | ||
87 | let crate_id = crate_graph.add_crate_root(file_id, meta.edition, meta.cfg); | ||
88 | let prev = crates.insert(krate.clone(), crate_id); | ||
89 | assert!(prev.is_none()); | ||
90 | for dep in meta.deps { | ||
91 | crate_deps.push((krate.clone(), dep)) | ||
92 | } | ||
93 | } else if meta.path == "/main.rs" || meta.path == "/lib.rs" { | ||
94 | assert!(default_crate_root.is_none()); | ||
95 | default_crate_root = Some(file_id); | ||
96 | } | ||
97 | |||
98 | let text = if entry.text.contains(CURSOR_MARKER) { | ||
99 | let (offset, text) = extract_offset(&entry.text); | ||
100 | assert!(file_position.is_none()); | ||
101 | file_position = Some(FilePosition { file_id, offset }); | ||
102 | text.to_string() | ||
103 | } else { | ||
104 | entry.text.to_string() | ||
105 | }; | ||
106 | |||
107 | db.set_file_text(file_id, Arc::new(text)); | ||
108 | db.set_file_relative_path(file_id, meta.path.clone()); | ||
109 | db.set_file_source_root(file_id, source_root_id); | ||
110 | source_root.insert_file(meta.path, file_id); | ||
111 | |||
112 | file_id.0 += 1; | ||
113 | } | ||
114 | |||
115 | if crates.is_empty() { | ||
116 | let crate_root = default_crate_root.unwrap(); | ||
117 | crate_graph.add_crate_root(crate_root, Edition::Edition2018, CfgOptions::default()); | ||
118 | } else { | ||
119 | for (from, to) in crate_deps { | ||
120 | let from_id = crates[&from]; | ||
121 | let to_id = crates[&to]; | ||
122 | crate_graph.add_dep(from_id, to.into(), to_id).unwrap(); | ||
123 | } | ||
124 | } | ||
125 | |||
126 | db.set_source_root(source_root_id, Arc::new(source_root)); | ||
127 | db.set_crate_graph(Arc::new(crate_graph)); | ||
128 | |||
129 | file_position | ||
130 | } | ||
131 | |||
132 | enum ParsedMeta { | ||
133 | Root { path: RelativePathBuf }, | ||
134 | File(FileMeta), | ||
135 | } | ||
136 | |||
137 | struct FileMeta { | ||
138 | path: RelativePathBuf, | ||
139 | krate: Option<String>, | ||
140 | deps: Vec<String>, | ||
141 | cfg: CfgOptions, | ||
142 | edition: Edition, | ||
143 | } | ||
144 | |||
145 | //- /lib.rs crate:foo deps:bar,baz | ||
146 | fn parse_meta(meta: &str) -> ParsedMeta { | ||
147 | let components = meta.split_ascii_whitespace().collect::<Vec<_>>(); | ||
148 | |||
149 | if components[0] == "root" { | ||
150 | let path: RelativePathBuf = components[1].into(); | ||
151 | assert!(path.starts_with("/") && path.ends_with("/")); | ||
152 | return ParsedMeta::Root { path }; | ||
153 | } | ||
154 | |||
155 | let path: RelativePathBuf = components[0].into(); | ||
156 | assert!(path.starts_with("/")); | ||
157 | |||
158 | let mut krate = None; | ||
159 | let mut deps = Vec::new(); | ||
160 | let mut edition = Edition::Edition2018; | ||
161 | let mut cfg = CfgOptions::default(); | ||
162 | for component in components[1..].iter() { | ||
163 | let (key, value) = split1(component, ':').unwrap(); | ||
164 | match key { | ||
165 | "crate" => krate = Some(value.to_string()), | ||
166 | "deps" => deps = value.split(',').map(|it| it.to_string()).collect(), | ||
167 | "edition" => edition = Edition::from_string(&value), | ||
168 | "cfg" => { | ||
169 | for key in value.split(',') { | ||
170 | match split1(key, '=') { | ||
171 | None => cfg.insert_atom(key.into()), | ||
172 | Some((k, v)) => cfg.insert_key_value(k.into(), v.into()), | ||
173 | } | ||
174 | } | ||
175 | } | ||
176 | _ => panic!("bad component: {:?}", component), | ||
177 | } | ||
178 | } | ||
179 | |||
180 | ParsedMeta::File(FileMeta { path, krate, deps, edition, cfg }) | ||
181 | } | ||
182 | |||
183 | fn split1(haystack: &str, delim: char) -> Option<(&str, &str)> { | ||
184 | let idx = haystack.find(delim)?; | ||
185 | Some((&haystack[..idx], &haystack[idx + delim.len_utf8()..])) | ||
186 | } | ||
diff --git a/crates/ra_db/src/input.rs b/crates/ra_db/src/input.rs index eafa95921..60f7dc881 100644 --- a/crates/ra_db/src/input.rs +++ b/crates/ra_db/src/input.rs | |||
@@ -6,13 +6,14 @@ | |||
6 | //! actual IO. See `vfs` and `project_model` in the `ra_lsp_server` crate for how | 6 | //! actual IO. See `vfs` and `project_model` in the `ra_lsp_server` crate for how |
7 | //! actual IO is done and lowered to input. | 7 | //! actual IO is done and lowered to input. |
8 | 8 | ||
9 | use relative_path::{RelativePath, RelativePathBuf}; | ||
10 | use rustc_hash::FxHashMap; | 9 | use rustc_hash::FxHashMap; |
11 | 10 | ||
12 | use ra_cfg::CfgOptions; | 11 | use ra_cfg::CfgOptions; |
13 | use ra_syntax::SmolStr; | 12 | use ra_syntax::SmolStr; |
14 | use rustc_hash::FxHashSet; | 13 | use rustc_hash::FxHashSet; |
15 | 14 | ||
15 | use crate::{RelativePath, RelativePathBuf}; | ||
16 | |||
16 | /// `FileId` is an integer which uniquely identifies a file. File paths are | 17 | /// `FileId` is an integer which uniquely identifies a file. File paths are |
17 | /// messy and system-dependent, so most of the code should work directly with | 18 | /// messy and system-dependent, so most of the code should work directly with |
18 | /// `FileId`, without inspecting the path. The mapping between `FileId` and path | 19 | /// `FileId`, without inspecting the path. The mapping between `FileId` and path |
@@ -97,6 +98,7 @@ pub enum Edition { | |||
97 | } | 98 | } |
98 | 99 | ||
99 | impl Edition { | 100 | impl Edition { |
101 | //FIXME: replace with FromStr with proper error handling | ||
100 | pub fn from_string(s: &str) -> Edition { | 102 | pub fn from_string(s: &str) -> Edition { |
101 | match s { | 103 | match s { |
102 | "2015" => Edition::Edition2015, | 104 | "2015" => Edition::Edition2015, |
diff --git a/crates/ra_db/src/lib.rs b/crates/ra_db/src/lib.rs index 0d1ab4843..b6bfd531d 100644 --- a/crates/ra_db/src/lib.rs +++ b/crates/ra_db/src/lib.rs | |||
@@ -1,17 +1,18 @@ | |||
1 | //! ra_db defines basic database traits. The concrete DB is defined by ra_ide_api. | 1 | //! ra_db defines basic database traits. The concrete DB is defined by ra_ide_api. |
2 | mod cancellation; | 2 | mod cancellation; |
3 | mod input; | 3 | mod input; |
4 | pub mod fixture; | ||
4 | 5 | ||
5 | use std::{panic, sync::Arc}; | 6 | use std::{panic, sync::Arc}; |
6 | 7 | ||
7 | use ra_prof::profile; | 8 | use ra_prof::profile; |
8 | use ra_syntax::{ast, Parse, SourceFile, TextRange, TextUnit}; | 9 | use ra_syntax::{ast, Parse, SourceFile, TextRange, TextUnit}; |
9 | use relative_path::{RelativePath, RelativePathBuf}; | ||
10 | 10 | ||
11 | pub use crate::{ | 11 | pub use crate::{ |
12 | cancellation::Canceled, | 12 | cancellation::Canceled, |
13 | input::{CrateGraph, CrateId, Dependency, Edition, FileId, SourceRoot, SourceRootId}, | 13 | input::{CrateGraph, CrateId, Dependency, Edition, FileId, SourceRoot, SourceRootId}, |
14 | }; | 14 | }; |
15 | pub use relative_path::{RelativePath, RelativePathBuf}; | ||
15 | pub use salsa; | 16 | pub use salsa; |
16 | 17 | ||
17 | pub trait CheckCanceled { | 18 | pub trait CheckCanceled { |
diff --git a/crates/ra_hir/Cargo.toml b/crates/ra_hir/Cargo.toml index 5df371bc0..324961328 100644 --- a/crates/ra_hir/Cargo.toml +++ b/crates/ra_hir/Cargo.toml | |||
@@ -7,7 +7,6 @@ authors = ["rust-analyzer developers"] | |||
7 | [dependencies] | 7 | [dependencies] |
8 | arrayvec = "0.5.1" | 8 | arrayvec = "0.5.1" |
9 | log = "0.4.5" | 9 | log = "0.4.5" |
10 | relative-path = "1.0.0" | ||
11 | rustc-hash = "1.0" | 10 | rustc-hash = "1.0" |
12 | parking_lot = "0.9.0" | 11 | parking_lot = "0.9.0" |
13 | ena = "0.13" | 12 | ena = "0.13" |
@@ -24,9 +23,9 @@ hir_def = { path = "../ra_hir_def", package = "ra_hir_def" } | |||
24 | test_utils = { path = "../test_utils" } | 23 | test_utils = { path = "../test_utils" } |
25 | ra_prof = { path = "../ra_prof" } | 24 | ra_prof = { path = "../ra_prof" } |
26 | 25 | ||
27 | chalk-solve = { git = "https://github.com/rust-lang/chalk.git", rev = "8314f2fcec8582a58c24b638f1a259d4145a0809" } | 26 | chalk-solve = { git = "https://github.com/rust-lang/chalk.git", rev = "50f9f636123bd88d0cc1b958749981d6702e4d05" } |
28 | chalk-rust-ir = { git = "https://github.com/rust-lang/chalk.git", rev = "8314f2fcec8582a58c24b638f1a259d4145a0809" } | 27 | chalk-rust-ir = { git = "https://github.com/rust-lang/chalk.git", rev = "50f9f636123bd88d0cc1b958749981d6702e4d05" } |
29 | chalk-ir = { git = "https://github.com/rust-lang/chalk.git", rev = "8314f2fcec8582a58c24b638f1a259d4145a0809" } | 28 | chalk-ir = { git = "https://github.com/rust-lang/chalk.git", rev = "50f9f636123bd88d0cc1b958749981d6702e4d05" } |
30 | lalrpop-intern = "0.15.1" | 29 | lalrpop-intern = "0.15.1" |
31 | 30 | ||
32 | [dev-dependencies] | 31 | [dev-dependencies] |
diff --git a/crates/ra_hir/src/adt.rs b/crates/ra_hir/src/adt.rs index 97424b39e..0436d20b7 100644 --- a/crates/ra_hir/src/adt.rs +++ b/crates/ra_hir/src/adt.rs | |||
@@ -3,156 +3,16 @@ | |||
3 | 3 | ||
4 | use std::sync::Arc; | 4 | use std::sync::Arc; |
5 | 5 | ||
6 | use hir_def::type_ref::TypeRef; | 6 | use hir_def::adt::VariantData; |
7 | use hir_expand::name::AsName; | ||
8 | use ra_arena::{impl_arena_id, Arena, RawId}; | ||
9 | use ra_syntax::ast::{self, NameOwner, StructKind, TypeAscriptionOwner}; | ||
10 | 7 | ||
11 | use crate::{ | 8 | use crate::{ |
12 | db::{AstDatabase, DefDatabase, HirDatabase}, | 9 | db::{DefDatabase, HirDatabase}, |
13 | Enum, EnumVariant, FieldSource, HasSource, Module, Name, Source, Struct, StructField, | 10 | EnumVariant, Module, Name, Struct, StructField, |
14 | }; | 11 | }; |
15 | 12 | ||
16 | impl Struct { | 13 | impl Struct { |
17 | pub(crate) fn variant_data(self, db: &impl DefDatabase) -> Arc<VariantData> { | 14 | pub(crate) fn variant_data(self, db: &impl DefDatabase) -> Arc<VariantData> { |
18 | db.struct_data(self).variant_data.clone() | 15 | db.struct_data(self.id).variant_data.clone() |
19 | } | ||
20 | } | ||
21 | |||
22 | /// Note that we use `StructData` for unions as well! | ||
23 | #[derive(Debug, Clone, PartialEq, Eq)] | ||
24 | pub struct StructData { | ||
25 | pub(crate) name: Option<Name>, | ||
26 | pub(crate) variant_data: Arc<VariantData>, | ||
27 | } | ||
28 | |||
29 | impl StructData { | ||
30 | fn new(struct_def: &ast::StructDef) -> StructData { | ||
31 | let name = struct_def.name().map(|n| n.as_name()); | ||
32 | let variant_data = VariantData::new(struct_def.kind()); | ||
33 | let variant_data = Arc::new(variant_data); | ||
34 | StructData { name, variant_data } | ||
35 | } | ||
36 | |||
37 | pub(crate) fn struct_data_query( | ||
38 | db: &(impl DefDatabase + AstDatabase), | ||
39 | struct_: Struct, | ||
40 | ) -> Arc<StructData> { | ||
41 | let src = struct_.source(db); | ||
42 | Arc::new(StructData::new(&src.ast)) | ||
43 | } | ||
44 | } | ||
45 | |||
46 | fn variants(enum_def: &ast::EnumDef) -> impl Iterator<Item = ast::EnumVariant> { | ||
47 | enum_def.variant_list().into_iter().flat_map(|it| it.variants()) | ||
48 | } | ||
49 | |||
50 | impl EnumVariant { | ||
51 | pub(crate) fn source_impl( | ||
52 | self, | ||
53 | db: &(impl DefDatabase + AstDatabase), | ||
54 | ) -> Source<ast::EnumVariant> { | ||
55 | let src = self.parent.source(db); | ||
56 | let ast = variants(&src.ast) | ||
57 | .zip(db.enum_data(self.parent).variants.iter()) | ||
58 | .find(|(_syntax, (id, _))| *id == self.id) | ||
59 | .unwrap() | ||
60 | .0; | ||
61 | Source { file_id: src.file_id, ast } | ||
62 | } | ||
63 | pub(crate) fn variant_data(self, db: &impl DefDatabase) -> Arc<VariantData> { | ||
64 | db.enum_data(self.parent).variants[self.id].variant_data.clone() | ||
65 | } | ||
66 | } | ||
67 | |||
68 | #[derive(Debug, Clone, PartialEq, Eq)] | ||
69 | pub struct EnumData { | ||
70 | pub(crate) name: Option<Name>, | ||
71 | pub(crate) variants: Arena<EnumVariantId, EnumVariantData>, | ||
72 | } | ||
73 | |||
74 | impl EnumData { | ||
75 | pub(crate) fn enum_data_query(db: &(impl DefDatabase + AstDatabase), e: Enum) -> Arc<EnumData> { | ||
76 | let src = e.source(db); | ||
77 | let name = src.ast.name().map(|n| n.as_name()); | ||
78 | let variants = variants(&src.ast) | ||
79 | .map(|var| EnumVariantData { | ||
80 | name: var.name().map(|it| it.as_name()), | ||
81 | variant_data: Arc::new(VariantData::new(var.kind())), | ||
82 | }) | ||
83 | .collect(); | ||
84 | Arc::new(EnumData { name, variants }) | ||
85 | } | ||
86 | } | ||
87 | |||
88 | #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)] | ||
89 | pub(crate) struct EnumVariantId(RawId); | ||
90 | impl_arena_id!(EnumVariantId); | ||
91 | |||
92 | #[derive(Debug, Clone, PartialEq, Eq)] | ||
93 | pub(crate) struct EnumVariantData { | ||
94 | pub(crate) name: Option<Name>, | ||
95 | variant_data: Arc<VariantData>, | ||
96 | } | ||
97 | |||
98 | #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)] | ||
99 | pub(crate) struct StructFieldId(RawId); | ||
100 | impl_arena_id!(StructFieldId); | ||
101 | |||
102 | /// A single field of an enum variant or struct | ||
103 | #[derive(Debug, Clone, PartialEq, Eq)] | ||
104 | pub struct StructFieldData { | ||
105 | pub(crate) name: Name, | ||
106 | pub(crate) type_ref: TypeRef, | ||
107 | } | ||
108 | |||
109 | /// Fields of an enum variant or struct | ||
110 | #[derive(Debug, Clone, PartialEq, Eq)] | ||
111 | pub(crate) struct VariantData(VariantDataInner); | ||
112 | |||
113 | #[derive(Debug, Clone, PartialEq, Eq)] | ||
114 | enum VariantDataInner { | ||
115 | Struct(Arena<StructFieldId, StructFieldData>), | ||
116 | Tuple(Arena<StructFieldId, StructFieldData>), | ||
117 | Unit, | ||
118 | } | ||
119 | |||
120 | impl VariantData { | ||
121 | pub(crate) fn fields(&self) -> Option<&Arena<StructFieldId, StructFieldData>> { | ||
122 | match &self.0 { | ||
123 | VariantDataInner::Struct(fields) | VariantDataInner::Tuple(fields) => Some(fields), | ||
124 | _ => None, | ||
125 | } | ||
126 | } | ||
127 | } | ||
128 | |||
129 | impl VariantData { | ||
130 | fn new(flavor: StructKind) -> Self { | ||
131 | let inner = match flavor { | ||
132 | ast::StructKind::Tuple(fl) => { | ||
133 | let fields = fl | ||
134 | .fields() | ||
135 | .enumerate() | ||
136 | .map(|(i, fd)| StructFieldData { | ||
137 | name: Name::new_tuple_field(i), | ||
138 | type_ref: TypeRef::from_ast_opt(fd.type_ref()), | ||
139 | }) | ||
140 | .collect(); | ||
141 | VariantDataInner::Tuple(fields) | ||
142 | } | ||
143 | ast::StructKind::Named(fl) => { | ||
144 | let fields = fl | ||
145 | .fields() | ||
146 | .map(|fd| StructFieldData { | ||
147 | name: fd.name().map(|n| n.as_name()).unwrap_or_else(Name::missing), | ||
148 | type_ref: TypeRef::from_ast_opt(fd.ascribed_type()), | ||
149 | }) | ||
150 | .collect(); | ||
151 | VariantDataInner::Struct(fields) | ||
152 | } | ||
153 | ast::StructKind::Unit => VariantDataInner::Unit, | ||
154 | }; | ||
155 | VariantData(inner) | ||
156 | } | 16 | } |
157 | } | 17 | } |
158 | 18 | ||
@@ -192,35 +52,3 @@ impl VariantDef { | |||
192 | } | 52 | } |
193 | } | 53 | } |
194 | } | 54 | } |
195 | |||
196 | impl StructField { | ||
197 | pub(crate) fn source_impl(&self, db: &(impl DefDatabase + AstDatabase)) -> Source<FieldSource> { | ||
198 | let var_data = self.parent.variant_data(db); | ||
199 | let fields = var_data.fields().unwrap(); | ||
200 | let ss; | ||
201 | let es; | ||
202 | let (file_id, struct_kind) = match self.parent { | ||
203 | VariantDef::Struct(s) => { | ||
204 | ss = s.source(db); | ||
205 | (ss.file_id, ss.ast.kind()) | ||
206 | } | ||
207 | VariantDef::EnumVariant(e) => { | ||
208 | es = e.source(db); | ||
209 | (es.file_id, es.ast.kind()) | ||
210 | } | ||
211 | }; | ||
212 | |||
213 | let field_sources = match struct_kind { | ||
214 | ast::StructKind::Tuple(fl) => fl.fields().map(|it| FieldSource::Pos(it)).collect(), | ||
215 | ast::StructKind::Named(fl) => fl.fields().map(|it| FieldSource::Named(it)).collect(), | ||
216 | ast::StructKind::Unit => Vec::new(), | ||
217 | }; | ||
218 | let ast = field_sources | ||
219 | .into_iter() | ||
220 | .zip(fields.iter()) | ||
221 | .find(|(_syntax, (id, _))| *id == self.id) | ||
222 | .unwrap() | ||
223 | .0; | ||
224 | Source { file_id, ast } | ||
225 | } | ||
226 | } | ||
diff --git a/crates/ra_hir/src/code_model.rs b/crates/ra_hir/src/code_model.rs index a6ce23dd1..181c5d47a 100644 --- a/crates/ra_hir/src/code_model.rs +++ b/crates/ra_hir/src/code_model.rs | |||
@@ -6,20 +6,21 @@ pub(crate) mod docs; | |||
6 | use std::sync::Arc; | 6 | use std::sync::Arc; |
7 | 7 | ||
8 | use hir_def::{ | 8 | use hir_def::{ |
9 | adt::VariantData, | ||
10 | builtin_type::BuiltinType, | ||
9 | type_ref::{Mutability, TypeRef}, | 11 | type_ref::{Mutability, TypeRef}, |
10 | CrateModuleId, ModuleId, | 12 | CrateModuleId, LocalEnumVariantId, LocalStructFieldId, ModuleId, UnionId, |
11 | }; | 13 | }; |
12 | use hir_expand::name::{ | 14 | use hir_expand::{ |
13 | self, AsName, BOOL, CHAR, F32, F64, I128, I16, I32, I64, I8, ISIZE, SELF_TYPE, STR, U128, U16, | 15 | diagnostics::DiagnosticSink, |
14 | U32, U64, U8, USIZE, | 16 | name::{self, AsName}, |
15 | }; | 17 | }; |
16 | use ra_db::{CrateId, Edition}; | 18 | use ra_db::{CrateId, Edition}; |
17 | use ra_syntax::ast::{self, NameOwner, TypeAscriptionOwner}; | 19 | use ra_syntax::ast::{self, NameOwner, TypeAscriptionOwner}; |
18 | 20 | ||
19 | use crate::{ | 21 | use crate::{ |
20 | adt::{EnumVariantId, StructFieldId, VariantDef}, | 22 | adt::VariantDef, |
21 | db::{AstDatabase, DefDatabase, HirDatabase}, | 23 | db::{AstDatabase, DefDatabase, HirDatabase}, |
22 | diagnostics::DiagnosticSink, | ||
23 | expr::{validation::ExprValidator, Body, BodySourceMap}, | 24 | expr::{validation::ExprValidator, Body, BodySourceMap}, |
24 | generics::HasGenericParams, | 25 | generics::HasGenericParams, |
25 | ids::{ | 26 | ids::{ |
@@ -27,14 +28,10 @@ use crate::{ | |||
27 | TypeAliasId, | 28 | TypeAliasId, |
28 | }, | 29 | }, |
29 | impl_block::ImplBlock, | 30 | impl_block::ImplBlock, |
30 | nameres::{ImportId, ModuleScope, Namespace}, | ||
31 | resolve::{Resolver, Scope, TypeNs}, | 31 | resolve::{Resolver, Scope, TypeNs}, |
32 | traits::TraitData, | 32 | traits::TraitData, |
33 | ty::{ | 33 | ty::{InferenceResult, TraitRef}, |
34 | primitive::{FloatBitness, FloatTy, IntBitness, IntTy, Signedness}, | 34 | Either, HasSource, Name, ScopeDef, Ty, {ImportId, Namespace}, |
35 | InferenceResult, TraitRef, | ||
36 | }, | ||
37 | Either, HasSource, Name, Ty, | ||
38 | }; | 35 | }; |
39 | 36 | ||
40 | /// hir::Crate describes a single crate. It's the main interface with which | 37 | /// hir::Crate describes a single crate. It's the main interface with which |
@@ -68,7 +65,7 @@ impl Crate { | |||
68 | } | 65 | } |
69 | 66 | ||
70 | pub fn root_module(self, db: &impl DefDatabase) -> Option<Module> { | 67 | pub fn root_module(self, db: &impl DefDatabase) -> Option<Module> { |
71 | let module_id = db.crate_def_map(self).root(); | 68 | let module_id = db.crate_def_map(self.crate_id).root(); |
72 | Some(Module::new(self, module_id)) | 69 | Some(Module::new(self, module_id)) |
73 | } | 70 | } |
74 | 71 | ||
@@ -87,41 +84,6 @@ pub struct Module { | |||
87 | pub(crate) id: ModuleId, | 84 | pub(crate) id: ModuleId, |
88 | } | 85 | } |
89 | 86 | ||
90 | #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)] | ||
91 | pub enum BuiltinType { | ||
92 | Char, | ||
93 | Bool, | ||
94 | Str, | ||
95 | Int(IntTy), | ||
96 | Float(FloatTy), | ||
97 | } | ||
98 | |||
99 | impl BuiltinType { | ||
100 | #[rustfmt::skip] | ||
101 | pub(crate) const ALL: &'static [(Name, BuiltinType)] = &[ | ||
102 | (CHAR, BuiltinType::Char), | ||
103 | (BOOL, BuiltinType::Bool), | ||
104 | (STR, BuiltinType::Str), | ||
105 | |||
106 | (ISIZE, BuiltinType::Int(IntTy { signedness: Signedness::Signed, bitness: IntBitness::Xsize })), | ||
107 | (I8, BuiltinType::Int(IntTy { signedness: Signedness::Signed, bitness: IntBitness::X8 })), | ||
108 | (I16, BuiltinType::Int(IntTy { signedness: Signedness::Signed, bitness: IntBitness::X16 })), | ||
109 | (I32, BuiltinType::Int(IntTy { signedness: Signedness::Signed, bitness: IntBitness::X32 })), | ||
110 | (I64, BuiltinType::Int(IntTy { signedness: Signedness::Signed, bitness: IntBitness::X64 })), | ||
111 | (I128, BuiltinType::Int(IntTy { signedness: Signedness::Signed, bitness: IntBitness::X128 })), | ||
112 | |||
113 | (USIZE, BuiltinType::Int(IntTy { signedness: Signedness::Unsigned, bitness: IntBitness::Xsize })), | ||
114 | (U8, BuiltinType::Int(IntTy { signedness: Signedness::Unsigned, bitness: IntBitness::X8 })), | ||
115 | (U16, BuiltinType::Int(IntTy { signedness: Signedness::Unsigned, bitness: IntBitness::X16 })), | ||
116 | (U32, BuiltinType::Int(IntTy { signedness: Signedness::Unsigned, bitness: IntBitness::X32 })), | ||
117 | (U64, BuiltinType::Int(IntTy { signedness: Signedness::Unsigned, bitness: IntBitness::X64 })), | ||
118 | (U128, BuiltinType::Int(IntTy { signedness: Signedness::Unsigned, bitness: IntBitness::X128 })), | ||
119 | |||
120 | (F32, BuiltinType::Float(FloatTy { bitness: FloatBitness::X32 })), | ||
121 | (F64, BuiltinType::Float(FloatTy { bitness: FloatBitness::X64 })), | ||
122 | ]; | ||
123 | } | ||
124 | |||
125 | /// The defs which can be visible in the module. | 87 | /// The defs which can be visible in the module. |
126 | #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)] | 88 | #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)] |
127 | pub enum ModuleDef { | 89 | pub enum ModuleDef { |
@@ -157,7 +119,7 @@ impl Module { | |||
157 | 119 | ||
158 | /// Name of this module. | 120 | /// Name of this module. |
159 | pub fn name(self, db: &impl DefDatabase) -> Option<Name> { | 121 | pub fn name(self, db: &impl DefDatabase) -> Option<Name> { |
160 | let def_map = db.crate_def_map(self.krate()); | 122 | let def_map = db.crate_def_map(self.id.krate); |
161 | let parent = def_map[self.id.module_id].parent?; | 123 | let parent = def_map[self.id.module_id].parent?; |
162 | def_map[parent].children.iter().find_map(|(name, module_id)| { | 124 | def_map[parent].children.iter().find_map(|(name, module_id)| { |
163 | if *module_id == self.id.module_id { | 125 | if *module_id == self.id.module_id { |
@@ -188,20 +150,20 @@ impl Module { | |||
188 | /// might be missing `krate`. This can happen if a module's file is not included | 150 | /// might be missing `krate`. This can happen if a module's file is not included |
189 | /// in the module tree of any target in `Cargo.toml`. | 151 | /// in the module tree of any target in `Cargo.toml`. |
190 | pub fn crate_root(self, db: &impl DefDatabase) -> Module { | 152 | pub fn crate_root(self, db: &impl DefDatabase) -> Module { |
191 | let def_map = db.crate_def_map(self.krate()); | 153 | let def_map = db.crate_def_map(self.id.krate); |
192 | self.with_module_id(def_map.root()) | 154 | self.with_module_id(def_map.root()) |
193 | } | 155 | } |
194 | 156 | ||
195 | /// Finds a child module with the specified name. | 157 | /// Finds a child module with the specified name. |
196 | pub fn child(self, db: &impl HirDatabase, name: &Name) -> Option<Module> { | 158 | pub fn child(self, db: &impl HirDatabase, name: &Name) -> Option<Module> { |
197 | let def_map = db.crate_def_map(self.krate()); | 159 | let def_map = db.crate_def_map(self.id.krate); |
198 | let child_id = def_map[self.id.module_id].children.get(name)?; | 160 | let child_id = def_map[self.id.module_id].children.get(name)?; |
199 | Some(self.with_module_id(*child_id)) | 161 | Some(self.with_module_id(*child_id)) |
200 | } | 162 | } |
201 | 163 | ||
202 | /// Iterates over all child modules. | 164 | /// Iterates over all child modules. |
203 | pub fn children(self, db: &impl DefDatabase) -> impl Iterator<Item = Module> { | 165 | pub fn children(self, db: &impl DefDatabase) -> impl Iterator<Item = Module> { |
204 | let def_map = db.crate_def_map(self.krate()); | 166 | let def_map = db.crate_def_map(self.id.krate); |
205 | let children = def_map[self.id.module_id] | 167 | let children = def_map[self.id.module_id] |
206 | .children | 168 | .children |
207 | .iter() | 169 | .iter() |
@@ -212,7 +174,7 @@ impl Module { | |||
212 | 174 | ||
213 | /// Finds a parent module. | 175 | /// Finds a parent module. |
214 | pub fn parent(self, db: &impl DefDatabase) -> Option<Module> { | 176 | pub fn parent(self, db: &impl DefDatabase) -> Option<Module> { |
215 | let def_map = db.crate_def_map(self.krate()); | 177 | let def_map = db.crate_def_map(self.id.krate); |
216 | let parent_id = def_map[self.id.module_id].parent?; | 178 | let parent_id = def_map[self.id.module_id].parent?; |
217 | Some(self.with_module_id(parent_id)) | 179 | Some(self.with_module_id(parent_id)) |
218 | } | 180 | } |
@@ -228,12 +190,16 @@ impl Module { | |||
228 | } | 190 | } |
229 | 191 | ||
230 | /// Returns a `ModuleScope`: a set of items, visible in this module. | 192 | /// Returns a `ModuleScope`: a set of items, visible in this module. |
231 | pub fn scope(self, db: &impl HirDatabase) -> ModuleScope { | 193 | pub fn scope(self, db: &impl HirDatabase) -> Vec<(Name, ScopeDef, Option<ImportId>)> { |
232 | db.crate_def_map(self.krate())[self.id.module_id].scope.clone() | 194 | db.crate_def_map(self.id.krate)[self.id.module_id] |
195 | .scope | ||
196 | .entries() | ||
197 | .map(|(name, res)| (name.clone(), res.def.into(), res.import)) | ||
198 | .collect() | ||
233 | } | 199 | } |
234 | 200 | ||
235 | pub fn diagnostics(self, db: &impl HirDatabase, sink: &mut DiagnosticSink) { | 201 | pub fn diagnostics(self, db: &impl HirDatabase, sink: &mut DiagnosticSink) { |
236 | db.crate_def_map(self.krate()).add_diagnostics(db, self.id.module_id, sink); | 202 | db.crate_def_map(self.id.krate).add_diagnostics(db, self.id.module_id, sink); |
237 | for decl in self.declarations(db) { | 203 | for decl in self.declarations(db) { |
238 | match decl { | 204 | match decl { |
239 | crate::ModuleDef::Function(f) => f.diagnostics(db, sink), | 205 | crate::ModuleDef::Function(f) => f.diagnostics(db, sink), |
@@ -257,12 +223,12 @@ impl Module { | |||
257 | } | 223 | } |
258 | 224 | ||
259 | pub(crate) fn resolver(self, db: &impl DefDatabase) -> Resolver { | 225 | pub(crate) fn resolver(self, db: &impl DefDatabase) -> Resolver { |
260 | let def_map = db.crate_def_map(self.krate()); | 226 | let def_map = db.crate_def_map(self.id.krate); |
261 | Resolver::default().push_module_scope(def_map, self.id.module_id) | 227 | Resolver::default().push_module_scope(def_map, self.id.module_id) |
262 | } | 228 | } |
263 | 229 | ||
264 | pub fn declarations(self, db: &impl DefDatabase) -> Vec<ModuleDef> { | 230 | pub fn declarations(self, db: &impl DefDatabase) -> Vec<ModuleDef> { |
265 | let def_map = db.crate_def_map(self.krate()); | 231 | let def_map = db.crate_def_map(self.id.krate); |
266 | def_map[self.id.module_id] | 232 | def_map[self.id.module_id] |
267 | .scope | 233 | .scope |
268 | .entries() | 234 | .entries() |
@@ -270,6 +236,7 @@ impl Module { | |||
270 | .flat_map(|per_ns| { | 236 | .flat_map(|per_ns| { |
271 | per_ns.take_types().into_iter().chain(per_ns.take_values().into_iter()) | 237 | per_ns.take_types().into_iter().chain(per_ns.take_values().into_iter()) |
272 | }) | 238 | }) |
239 | .map(ModuleDef::from) | ||
273 | .collect() | 240 | .collect() |
274 | } | 241 | } |
275 | 242 | ||
@@ -290,7 +257,7 @@ impl Module { | |||
290 | #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)] | 257 | #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)] |
291 | pub struct StructField { | 258 | pub struct StructField { |
292 | pub(crate) parent: VariantDef, | 259 | pub(crate) parent: VariantDef, |
293 | pub(crate) id: StructFieldId, | 260 | pub(crate) id: LocalStructFieldId, |
294 | } | 261 | } |
295 | 262 | ||
296 | #[derive(Debug, PartialEq, Eq)] | 263 | #[derive(Debug, PartialEq, Eq)] |
@@ -328,11 +295,11 @@ impl Struct { | |||
328 | } | 295 | } |
329 | 296 | ||
330 | pub fn name(self, db: &impl DefDatabase) -> Option<Name> { | 297 | pub fn name(self, db: &impl DefDatabase) -> Option<Name> { |
331 | db.struct_data(self).name.clone() | 298 | db.struct_data(self.id).name.clone() |
332 | } | 299 | } |
333 | 300 | ||
334 | pub fn fields(self, db: &impl HirDatabase) -> Vec<StructField> { | 301 | pub fn fields(self, db: &impl HirDatabase) -> Vec<StructField> { |
335 | db.struct_data(self) | 302 | db.struct_data(self.id) |
336 | .variant_data | 303 | .variant_data |
337 | .fields() | 304 | .fields() |
338 | .into_iter() | 305 | .into_iter() |
@@ -342,7 +309,7 @@ impl Struct { | |||
342 | } | 309 | } |
343 | 310 | ||
344 | pub fn field(self, db: &impl HirDatabase, name: &Name) -> Option<StructField> { | 311 | pub fn field(self, db: &impl HirDatabase, name: &Name) -> Option<StructField> { |
345 | db.struct_data(self) | 312 | db.struct_data(self.id) |
346 | .variant_data | 313 | .variant_data |
347 | .fields() | 314 | .fields() |
348 | .into_iter() | 315 | .into_iter() |
@@ -373,12 +340,12 @@ impl Struct { | |||
373 | 340 | ||
374 | #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)] | 341 | #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)] |
375 | pub struct Union { | 342 | pub struct Union { |
376 | pub(crate) id: StructId, | 343 | pub(crate) id: UnionId, |
377 | } | 344 | } |
378 | 345 | ||
379 | impl Union { | 346 | impl Union { |
380 | pub fn name(self, db: &impl DefDatabase) -> Option<Name> { | 347 | pub fn name(self, db: &impl DefDatabase) -> Option<Name> { |
381 | db.struct_data(Struct { id: self.id }).name.clone() | 348 | db.union_data(self.id).name.clone() |
382 | } | 349 | } |
383 | 350 | ||
384 | pub fn module(self, db: &impl HirDatabase) -> Module { | 351 | pub fn module(self, db: &impl HirDatabase) -> Module { |
@@ -416,15 +383,19 @@ impl Enum { | |||
416 | } | 383 | } |
417 | 384 | ||
418 | pub fn name(self, db: &impl DefDatabase) -> Option<Name> { | 385 | pub fn name(self, db: &impl DefDatabase) -> Option<Name> { |
419 | db.enum_data(self).name.clone() | 386 | db.enum_data(self.id).name.clone() |
420 | } | 387 | } |
421 | 388 | ||
422 | pub fn variants(self, db: &impl DefDatabase) -> Vec<EnumVariant> { | 389 | pub fn variants(self, db: &impl DefDatabase) -> Vec<EnumVariant> { |
423 | db.enum_data(self).variants.iter().map(|(id, _)| EnumVariant { parent: self, id }).collect() | 390 | db.enum_data(self.id) |
391 | .variants | ||
392 | .iter() | ||
393 | .map(|(id, _)| EnumVariant { parent: self, id }) | ||
394 | .collect() | ||
424 | } | 395 | } |
425 | 396 | ||
426 | pub fn variant(self, db: &impl DefDatabase, name: &Name) -> Option<EnumVariant> { | 397 | pub fn variant(self, db: &impl DefDatabase, name: &Name) -> Option<EnumVariant> { |
427 | db.enum_data(self) | 398 | db.enum_data(self.id) |
428 | .variants | 399 | .variants |
429 | .iter() | 400 | .iter() |
430 | .find(|(_id, data)| data.name.as_ref() == Some(name)) | 401 | .find(|(_id, data)| data.name.as_ref() == Some(name)) |
@@ -450,7 +421,7 @@ impl Enum { | |||
450 | #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)] | 421 | #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)] |
451 | pub struct EnumVariant { | 422 | pub struct EnumVariant { |
452 | pub(crate) parent: Enum, | 423 | pub(crate) parent: Enum, |
453 | pub(crate) id: EnumVariantId, | 424 | pub(crate) id: LocalEnumVariantId, |
454 | } | 425 | } |
455 | 426 | ||
456 | impl EnumVariant { | 427 | impl EnumVariant { |
@@ -462,7 +433,7 @@ impl EnumVariant { | |||
462 | } | 433 | } |
463 | 434 | ||
464 | pub fn name(self, db: &impl DefDatabase) -> Option<Name> { | 435 | pub fn name(self, db: &impl DefDatabase) -> Option<Name> { |
465 | db.enum_data(self.parent).variants[self.id].name.clone() | 436 | db.enum_data(self.parent.id).variants[self.id].name.clone() |
466 | } | 437 | } |
467 | 438 | ||
468 | pub fn fields(self, db: &impl HirDatabase) -> Vec<StructField> { | 439 | pub fn fields(self, db: &impl HirDatabase) -> Vec<StructField> { |
@@ -482,6 +453,10 @@ impl EnumVariant { | |||
482 | .find(|(_id, data)| data.name == *name) | 453 | .find(|(_id, data)| data.name == *name) |
483 | .map(|(id, _)| StructField { parent: self.into(), id }) | 454 | .map(|(id, _)| StructField { parent: self.into(), id }) |
484 | } | 455 | } |
456 | |||
457 | pub(crate) fn variant_data(self, db: &impl DefDatabase) -> Arc<VariantData> { | ||
458 | db.enum_data(self.parent.id).variants[self.id].variant_data.clone() | ||
459 | } | ||
485 | } | 460 | } |
486 | 461 | ||
487 | /// A Data Type | 462 | /// A Data Type |
@@ -625,7 +600,7 @@ impl FnData { | |||
625 | let self_type = if let Some(type_ref) = self_param.ascribed_type() { | 600 | let self_type = if let Some(type_ref) = self_param.ascribed_type() { |
626 | TypeRef::from_ast(type_ref) | 601 | TypeRef::from_ast(type_ref) |
627 | } else { | 602 | } else { |
628 | let self_type = TypeRef::Path(SELF_TYPE.into()); | 603 | let self_type = TypeRef::Path(name::SELF_TYPE.into()); |
629 | match self_param.kind() { | 604 | match self_param.kind() { |
630 | ast::SelfParamKind::Owned => self_type, | 605 | ast::SelfParamKind::Owned => self_type, |
631 | ast::SelfParamKind::Ref => { | 606 | ast::SelfParamKind::Ref => { |
@@ -1084,4 +1059,13 @@ impl AssocItem { | |||
1084 | AssocItem::TypeAlias(t) => t.module(db), | 1059 | AssocItem::TypeAlias(t) => t.module(db), |
1085 | } | 1060 | } |
1086 | } | 1061 | } |
1062 | |||
1063 | pub fn container(self, db: &impl DefDatabase) -> Container { | ||
1064 | match self { | ||
1065 | AssocItem::Function(f) => f.container(db), | ||
1066 | AssocItem::Const(c) => c.container(db), | ||
1067 | AssocItem::TypeAlias(t) => t.container(db), | ||
1068 | } | ||
1069 | .expect("AssocItem without container") | ||
1070 | } | ||
1087 | } | 1071 | } |
diff --git a/crates/ra_hir/src/code_model/src.rs b/crates/ra_hir/src/code_model/src.rs index 5c7f61eef..6d116ee75 100644 --- a/crates/ra_hir/src/code_model/src.rs +++ b/crates/ra_hir/src/code_model/src.rs | |||
@@ -3,13 +3,14 @@ | |||
3 | use ra_syntax::ast::{self, AstNode}; | 3 | use ra_syntax::ast::{self, AstNode}; |
4 | 4 | ||
5 | use crate::{ | 5 | use crate::{ |
6 | adt::VariantDef, | ||
6 | db::{AstDatabase, DefDatabase, HirDatabase}, | 7 | db::{AstDatabase, DefDatabase, HirDatabase}, |
7 | ids::AstItemDef, | 8 | ids::AstItemDef, |
8 | Const, Either, Enum, EnumVariant, FieldSource, Function, HasBody, HirFileId, MacroDef, Module, | 9 | Const, Either, Enum, EnumVariant, FieldSource, Function, HasBody, HirFileId, MacroDef, Module, |
9 | ModuleSource, Static, Struct, StructField, Trait, TypeAlias, Union, | 10 | ModuleSource, Static, Struct, StructField, Trait, TypeAlias, Union, |
10 | }; | 11 | }; |
11 | 12 | ||
12 | pub use hir_def::Source; | 13 | pub use hir_expand::Source; |
13 | 14 | ||
14 | pub trait HasSource { | 15 | pub trait HasSource { |
15 | type Ast; | 16 | type Ast; |
@@ -21,7 +22,7 @@ pub trait HasSource { | |||
21 | impl Module { | 22 | impl Module { |
22 | /// Returns a node which defines this module. That is, a file or a `mod foo {}` with items. | 23 | /// Returns a node which defines this module. That is, a file or a `mod foo {}` with items. |
23 | pub fn definition_source(self, db: &(impl DefDatabase + AstDatabase)) -> Source<ModuleSource> { | 24 | pub fn definition_source(self, db: &(impl DefDatabase + AstDatabase)) -> Source<ModuleSource> { |
24 | let def_map = db.crate_def_map(self.krate()); | 25 | let def_map = db.crate_def_map(self.id.krate); |
25 | let decl_id = def_map[self.id.module_id].declaration; | 26 | let decl_id = def_map[self.id.module_id].declaration; |
26 | let file_id = def_map[self.id.module_id].definition; | 27 | let file_id = def_map[self.id.module_id].definition; |
27 | let ast = ModuleSource::new(db, file_id, decl_id); | 28 | let ast = ModuleSource::new(db, file_id, decl_id); |
@@ -35,7 +36,7 @@ impl Module { | |||
35 | self, | 36 | self, |
36 | db: &(impl DefDatabase + AstDatabase), | 37 | db: &(impl DefDatabase + AstDatabase), |
37 | ) -> Option<Source<ast::Module>> { | 38 | ) -> Option<Source<ast::Module>> { |
38 | let def_map = db.crate_def_map(self.krate()); | 39 | let def_map = db.crate_def_map(self.id.krate); |
39 | let decl = def_map[self.id.module_id].declaration?; | 40 | let decl = def_map[self.id.module_id].declaration?; |
40 | let ast = decl.to_node(db); | 41 | let ast = decl.to_node(db); |
41 | Some(Source { file_id: decl.file_id(), ast }) | 42 | Some(Source { file_id: decl.file_id(), ast }) |
@@ -45,7 +46,33 @@ impl Module { | |||
45 | impl HasSource for StructField { | 46 | impl HasSource for StructField { |
46 | type Ast = FieldSource; | 47 | type Ast = FieldSource; |
47 | fn source(self, db: &(impl DefDatabase + AstDatabase)) -> Source<FieldSource> { | 48 | fn source(self, db: &(impl DefDatabase + AstDatabase)) -> Source<FieldSource> { |
48 | self.source_impl(db) | 49 | let var_data = self.parent.variant_data(db); |
50 | let fields = var_data.fields().unwrap(); | ||
51 | let ss; | ||
52 | let es; | ||
53 | let (file_id, struct_kind) = match self.parent { | ||
54 | VariantDef::Struct(s) => { | ||
55 | ss = s.source(db); | ||
56 | (ss.file_id, ss.ast.kind()) | ||
57 | } | ||
58 | VariantDef::EnumVariant(e) => { | ||
59 | es = e.source(db); | ||
60 | (es.file_id, es.ast.kind()) | ||
61 | } | ||
62 | }; | ||
63 | |||
64 | let field_sources = match struct_kind { | ||
65 | ast::StructKind::Tuple(fl) => fl.fields().map(|it| FieldSource::Pos(it)).collect(), | ||
66 | ast::StructKind::Named(fl) => fl.fields().map(|it| FieldSource::Named(it)).collect(), | ||
67 | ast::StructKind::Unit => Vec::new(), | ||
68 | }; | ||
69 | let ast = field_sources | ||
70 | .into_iter() | ||
71 | .zip(fields.iter()) | ||
72 | .find(|(_syntax, (id, _))| *id == self.id) | ||
73 | .unwrap() | ||
74 | .0; | ||
75 | Source { file_id, ast } | ||
49 | } | 76 | } |
50 | } | 77 | } |
51 | impl HasSource for Struct { | 78 | impl HasSource for Struct { |
@@ -69,7 +96,18 @@ impl HasSource for Enum { | |||
69 | impl HasSource for EnumVariant { | 96 | impl HasSource for EnumVariant { |
70 | type Ast = ast::EnumVariant; | 97 | type Ast = ast::EnumVariant; |
71 | fn source(self, db: &(impl DefDatabase + AstDatabase)) -> Source<ast::EnumVariant> { | 98 | fn source(self, db: &(impl DefDatabase + AstDatabase)) -> Source<ast::EnumVariant> { |
72 | self.source_impl(db) | 99 | let enum_data = db.enum_data(self.parent.id); |
100 | let src = self.parent.id.source(db); | ||
101 | let ast = src | ||
102 | .ast | ||
103 | .variant_list() | ||
104 | .into_iter() | ||
105 | .flat_map(|it| it.variants()) | ||
106 | .zip(enum_data.variants.iter()) | ||
107 | .find(|(_syntax, (id, _))| *id == self.id) | ||
108 | .unwrap() | ||
109 | .0; | ||
110 | Source { file_id: src.file_id, ast } | ||
73 | } | 111 | } |
74 | } | 112 | } |
75 | impl HasSource for Function { | 113 | impl HasSource for Function { |
diff --git a/crates/ra_hir/src/db.rs b/crates/ra_hir/src/db.rs index ebfd970eb..eb66325f7 100644 --- a/crates/ra_hir/src/db.rs +++ b/crates/ra_hir/src/db.rs | |||
@@ -6,26 +6,24 @@ use ra_db::salsa; | |||
6 | use ra_syntax::SmolStr; | 6 | use ra_syntax::SmolStr; |
7 | 7 | ||
8 | use crate::{ | 8 | use crate::{ |
9 | adt::{EnumData, StructData}, | ||
10 | debug::HirDebugDatabase, | 9 | debug::HirDebugDatabase, |
11 | generics::{GenericDef, GenericParams}, | 10 | generics::{GenericDef, GenericParams}, |
12 | ids, | 11 | ids, |
13 | impl_block::{ImplBlock, ImplSourceMap, ModuleImplBlocks}, | 12 | impl_block::{ImplBlock, ImplSourceMap, ModuleImplBlocks}, |
14 | lang_item::{LangItemTarget, LangItems}, | 13 | lang_item::{LangItemTarget, LangItems}, |
15 | nameres::{CrateDefMap, Namespace}, | ||
16 | traits::TraitData, | 14 | traits::TraitData, |
17 | ty::{ | 15 | ty::{ |
18 | method_resolution::CrateImplBlocks, traits::Impl, CallableDef, FnSig, GenericPredicate, | 16 | method_resolution::CrateImplBlocks, traits::Impl, CallableDef, FnSig, GenericPredicate, |
19 | InferenceResult, Substs, Ty, TypableDef, TypeCtor, | 17 | InferenceResult, Substs, Ty, TypableDef, TypeCtor, |
20 | }, | 18 | }, |
21 | type_alias::TypeAliasData, | 19 | type_alias::TypeAliasData, |
22 | Const, ConstData, Crate, DefWithBody, Enum, ExprScopes, FnData, Function, Module, Static, | 20 | Const, ConstData, Crate, DefWithBody, ExprScopes, FnData, Function, Module, Namespace, Static, |
23 | Struct, StructField, Trait, TypeAlias, | 21 | StructField, Trait, TypeAlias, |
24 | }; | 22 | }; |
25 | 23 | ||
26 | pub use hir_def::db::{ | 24 | pub use hir_def::db::{ |
27 | DefDatabase2, DefDatabase2Storage, InternDatabase, InternDatabaseStorage, RawItemsQuery, | 25 | CrateDefMapQuery, DefDatabase2, DefDatabase2Storage, EnumDataQuery, InternDatabase, |
28 | RawItemsWithSourceMapQuery, | 26 | InternDatabaseStorage, RawItemsQuery, RawItemsWithSourceMapQuery, StructDataQuery, |
29 | }; | 27 | }; |
30 | pub use hir_expand::db::{ | 28 | pub use hir_expand::db::{ |
31 | AstDatabase, AstDatabaseStorage, AstIdMapQuery, MacroArgQuery, MacroDefQuery, MacroExpandQuery, | 29 | AstDatabase, AstDatabaseStorage, AstIdMapQuery, MacroArgQuery, MacroDefQuery, MacroExpandQuery, |
@@ -36,21 +34,12 @@ pub use hir_expand::db::{ | |||
36 | #[salsa::query_group(DefDatabaseStorage)] | 34 | #[salsa::query_group(DefDatabaseStorage)] |
37 | #[salsa::requires(AstDatabase)] | 35 | #[salsa::requires(AstDatabase)] |
38 | pub trait DefDatabase: HirDebugDatabase + DefDatabase2 { | 36 | pub trait DefDatabase: HirDebugDatabase + DefDatabase2 { |
39 | #[salsa::invoke(crate::adt::StructData::struct_data_query)] | ||
40 | fn struct_data(&self, s: Struct) -> Arc<StructData>; | ||
41 | |||
42 | #[salsa::invoke(crate::adt::EnumData::enum_data_query)] | ||
43 | fn enum_data(&self, e: Enum) -> Arc<EnumData>; | ||
44 | |||
45 | #[salsa::invoke(crate::traits::TraitData::trait_data_query)] | 37 | #[salsa::invoke(crate::traits::TraitData::trait_data_query)] |
46 | fn trait_data(&self, t: Trait) -> Arc<TraitData>; | 38 | fn trait_data(&self, t: Trait) -> Arc<TraitData>; |
47 | 39 | ||
48 | #[salsa::invoke(crate::traits::TraitItemsIndex::trait_items_index)] | 40 | #[salsa::invoke(crate::traits::TraitItemsIndex::trait_items_index)] |
49 | fn trait_items_index(&self, module: Module) -> crate::traits::TraitItemsIndex; | 41 | fn trait_items_index(&self, module: Module) -> crate::traits::TraitItemsIndex; |
50 | 42 | ||
51 | #[salsa::invoke(CrateDefMap::crate_def_map_query)] | ||
52 | fn crate_def_map(&self, krate: Crate) -> Arc<CrateDefMap>; | ||
53 | |||
54 | #[salsa::invoke(ModuleImplBlocks::impls_in_module_with_source_map_query)] | 43 | #[salsa::invoke(ModuleImplBlocks::impls_in_module_with_source_map_query)] |
55 | fn impls_in_module_with_source_map( | 44 | fn impls_in_module_with_source_map( |
56 | &self, | 45 | &self, |
diff --git a/crates/ra_hir/src/diagnostics.rs b/crates/ra_hir/src/diagnostics.rs index 9acdaf8ed..1751e7be3 100644 --- a/crates/ra_hir/src/diagnostics.rs +++ b/crates/ra_hir/src/diagnostics.rs | |||
@@ -1,82 +1,13 @@ | |||
1 | //! FIXME: write short doc here | 1 | //! FIXME: write short doc here |
2 | 2 | ||
3 | use std::{any::Any, fmt}; | 3 | use std::any::Any; |
4 | |||
5 | use ra_syntax::{ast, AstNode, AstPtr, SyntaxNode, SyntaxNodePtr, TextRange}; | ||
6 | use relative_path::RelativePathBuf; | ||
7 | |||
8 | use crate::{db::HirDatabase, HirFileId, Name, Source}; | ||
9 | |||
10 | /// Diagnostic defines hir API for errors and warnings. | ||
11 | /// | ||
12 | /// It is used as a `dyn` object, which you can downcast to a concrete | ||
13 | /// diagnostic. DiagnosticSink are structured, meaning that they include rich | ||
14 | /// information which can be used by IDE to create fixes. DiagnosticSink are | ||
15 | /// expressed in terms of macro-expanded syntax tree nodes (so, it's a bad idea | ||
16 | /// to diagnostic in a salsa value). | ||
17 | /// | ||
18 | /// Internally, various subsystems of hir produce diagnostics specific to a | ||
19 | /// subsystem (typically, an `enum`), which are safe to store in salsa but do not | ||
20 | /// include source locations. Such internal diagnostic are transformed into an | ||
21 | /// instance of `Diagnostic` on demand. | ||
22 | pub trait Diagnostic: Any + Send + Sync + fmt::Debug + 'static { | ||
23 | fn message(&self) -> String; | ||
24 | fn source(&self) -> Source<SyntaxNodePtr>; | ||
25 | fn highlight_range(&self) -> TextRange { | ||
26 | self.source().ast.range() | ||
27 | } | ||
28 | fn as_any(&self) -> &(dyn Any + Send + 'static); | ||
29 | } | ||
30 | |||
31 | pub trait AstDiagnostic { | ||
32 | type AST; | ||
33 | fn ast(&self, db: &impl HirDatabase) -> Self::AST; | ||
34 | } | ||
35 | 4 | ||
36 | impl dyn Diagnostic { | 5 | use ra_syntax::{ast, AstNode, AstPtr, SyntaxNodePtr}; |
37 | pub fn syntax_node(&self, db: &impl HirDatabase) -> SyntaxNode { | ||
38 | let node = db.parse_or_expand(self.source().file_id).unwrap(); | ||
39 | self.source().ast.to_node(&node) | ||
40 | } | ||
41 | 6 | ||
42 | pub fn downcast_ref<D: Diagnostic>(&self) -> Option<&D> { | 7 | use crate::{db::AstDatabase, HirFileId, Name, Source}; |
43 | self.as_any().downcast_ref() | ||
44 | } | ||
45 | } | ||
46 | 8 | ||
47 | pub struct DiagnosticSink<'a> { | 9 | pub use hir_def::diagnostics::UnresolvedModule; |
48 | callbacks: Vec<Box<dyn FnMut(&dyn Diagnostic) -> Result<(), ()> + 'a>>, | 10 | pub use hir_expand::diagnostics::{AstDiagnostic, Diagnostic, DiagnosticSink}; |
49 | default_callback: Box<dyn FnMut(&dyn Diagnostic) + 'a>, | ||
50 | } | ||
51 | |||
52 | impl<'a> DiagnosticSink<'a> { | ||
53 | pub fn new(cb: impl FnMut(&dyn Diagnostic) + 'a) -> DiagnosticSink<'a> { | ||
54 | DiagnosticSink { callbacks: Vec::new(), default_callback: Box::new(cb) } | ||
55 | } | ||
56 | |||
57 | pub fn on<D: Diagnostic, F: FnMut(&D) + 'a>(mut self, mut cb: F) -> DiagnosticSink<'a> { | ||
58 | let cb = move |diag: &dyn Diagnostic| match diag.downcast_ref::<D>() { | ||
59 | Some(d) => { | ||
60 | cb(d); | ||
61 | Ok(()) | ||
62 | } | ||
63 | None => Err(()), | ||
64 | }; | ||
65 | self.callbacks.push(Box::new(cb)); | ||
66 | self | ||
67 | } | ||
68 | |||
69 | pub(crate) fn push(&mut self, d: impl Diagnostic) { | ||
70 | let d: &dyn Diagnostic = &d; | ||
71 | for cb in self.callbacks.iter_mut() { | ||
72 | match cb(d) { | ||
73 | Ok(()) => return, | ||
74 | Err(()) => (), | ||
75 | } | ||
76 | } | ||
77 | (self.default_callback)(d) | ||
78 | } | ||
79 | } | ||
80 | 11 | ||
81 | #[derive(Debug)] | 12 | #[derive(Debug)] |
82 | pub struct NoSuchField { | 13 | pub struct NoSuchField { |
@@ -99,25 +30,6 @@ impl Diagnostic for NoSuchField { | |||
99 | } | 30 | } |
100 | 31 | ||
101 | #[derive(Debug)] | 32 | #[derive(Debug)] |
102 | pub struct UnresolvedModule { | ||
103 | pub file: HirFileId, | ||
104 | pub decl: AstPtr<ast::Module>, | ||
105 | pub candidate: RelativePathBuf, | ||
106 | } | ||
107 | |||
108 | impl Diagnostic for UnresolvedModule { | ||
109 | fn message(&self) -> String { | ||
110 | "unresolved module".to_string() | ||
111 | } | ||
112 | fn source(&self) -> Source<SyntaxNodePtr> { | ||
113 | Source { file_id: self.file, ast: self.decl.into() } | ||
114 | } | ||
115 | fn as_any(&self) -> &(dyn Any + Send + 'static) { | ||
116 | self | ||
117 | } | ||
118 | } | ||
119 | |||
120 | #[derive(Debug)] | ||
121 | pub struct MissingFields { | 33 | pub struct MissingFields { |
122 | pub file: HirFileId, | 34 | pub file: HirFileId, |
123 | pub field_list: AstPtr<ast::RecordFieldList>, | 35 | pub field_list: AstPtr<ast::RecordFieldList>, |
@@ -139,7 +51,7 @@ impl Diagnostic for MissingFields { | |||
139 | impl AstDiagnostic for MissingFields { | 51 | impl AstDiagnostic for MissingFields { |
140 | type AST = ast::RecordFieldList; | 52 | type AST = ast::RecordFieldList; |
141 | 53 | ||
142 | fn ast(&self, db: &impl HirDatabase) -> Self::AST { | 54 | fn ast(&self, db: &impl AstDatabase) -> Self::AST { |
143 | let root = db.parse_or_expand(self.source().file_id).unwrap(); | 55 | let root = db.parse_or_expand(self.source().file_id).unwrap(); |
144 | let node = self.source().ast.to_node(&root); | 56 | let node = self.source().ast.to_node(&root); |
145 | ast::RecordFieldList::cast(node).unwrap() | 57 | ast::RecordFieldList::cast(node).unwrap() |
@@ -167,7 +79,7 @@ impl Diagnostic for MissingOkInTailExpr { | |||
167 | impl AstDiagnostic for MissingOkInTailExpr { | 79 | impl AstDiagnostic for MissingOkInTailExpr { |
168 | type AST = ast::Expr; | 80 | type AST = ast::Expr; |
169 | 81 | ||
170 | fn ast(&self, db: &impl HirDatabase) -> Self::AST { | 82 | fn ast(&self, db: &impl AstDatabase) -> Self::AST { |
171 | let root = db.parse_or_expand(self.file).unwrap(); | 83 | let root = db.parse_or_expand(self.file).unwrap(); |
172 | let node = self.source().ast.to_node(&root); | 84 | let node = self.source().ast.to_node(&root); |
173 | ast::Expr::cast(node).unwrap() | 85 | ast::Expr::cast(node).unwrap() |
diff --git a/crates/ra_hir/src/expr/validation.rs b/crates/ra_hir/src/expr/validation.rs index c685edda1..3054f1dce 100644 --- a/crates/ra_hir/src/expr/validation.rs +++ b/crates/ra_hir/src/expr/validation.rs | |||
@@ -3,12 +3,13 @@ | |||
3 | use std::sync::Arc; | 3 | use std::sync::Arc; |
4 | 4 | ||
5 | use hir_def::path::known; | 5 | use hir_def::path::known; |
6 | use hir_expand::diagnostics::DiagnosticSink; | ||
6 | use ra_syntax::ast; | 7 | use ra_syntax::ast; |
7 | use rustc_hash::FxHashSet; | 8 | use rustc_hash::FxHashSet; |
8 | 9 | ||
9 | use crate::{ | 10 | use crate::{ |
10 | db::HirDatabase, | 11 | db::HirDatabase, |
11 | diagnostics::{DiagnosticSink, MissingFields, MissingOkInTailExpr}, | 12 | diagnostics::{MissingFields, MissingOkInTailExpr}, |
12 | expr::AstPtr, | 13 | expr::AstPtr, |
13 | ty::{ApplicationTy, InferenceResult, Ty, TypeCtor}, | 14 | ty::{ApplicationTy, InferenceResult, Ty, TypeCtor}, |
14 | Adt, Function, Name, Path, | 15 | Adt, Function, Name, Path, |
diff --git a/crates/ra_hir/src/from_id.rs b/crates/ra_hir/src/from_id.rs new file mode 100644 index 000000000..089dbc908 --- /dev/null +++ b/crates/ra_hir/src/from_id.rs | |||
@@ -0,0 +1,63 @@ | |||
1 | //! Utility module for converting between hir_def ids and code_model wrappers. | ||
2 | //! | ||
3 | //! It's unclear if we need this long-term, but it's definitelly useful while we | ||
4 | //! are splitting the hir. | ||
5 | |||
6 | use hir_def::{AdtId, EnumVariantId, ModuleDefId}; | ||
7 | |||
8 | use crate::{Adt, EnumVariant, ModuleDef}; | ||
9 | |||
10 | macro_rules! from_id { | ||
11 | ($(($id:path, $ty:path)),*) => {$( | ||
12 | impl From<$id> for $ty { | ||
13 | fn from(id: $id) -> $ty { | ||
14 | $ty { id } | ||
15 | } | ||
16 | } | ||
17 | )*} | ||
18 | } | ||
19 | |||
20 | from_id![ | ||
21 | (hir_def::ModuleId, crate::Module), | ||
22 | (hir_def::StructId, crate::Struct), | ||
23 | (hir_def::UnionId, crate::Union), | ||
24 | (hir_def::EnumId, crate::Enum), | ||
25 | (hir_def::TypeAliasId, crate::TypeAlias), | ||
26 | (hir_def::TraitId, crate::Trait), | ||
27 | (hir_def::StaticId, crate::Static), | ||
28 | (hir_def::ConstId, crate::Const), | ||
29 | (hir_def::FunctionId, crate::Function), | ||
30 | (hir_expand::MacroDefId, crate::MacroDef) | ||
31 | ]; | ||
32 | |||
33 | impl From<AdtId> for Adt { | ||
34 | fn from(id: AdtId) -> Self { | ||
35 | match id { | ||
36 | AdtId::StructId(it) => Adt::Struct(it.into()), | ||
37 | AdtId::UnionId(it) => Adt::Union(it.into()), | ||
38 | AdtId::EnumId(it) => Adt::Enum(it.into()), | ||
39 | } | ||
40 | } | ||
41 | } | ||
42 | |||
43 | impl From<EnumVariantId> for EnumVariant { | ||
44 | fn from(id: EnumVariantId) -> Self { | ||
45 | EnumVariant { parent: id.parent.into(), id: id.local_id } | ||
46 | } | ||
47 | } | ||
48 | |||
49 | impl From<ModuleDefId> for ModuleDef { | ||
50 | fn from(id: ModuleDefId) -> Self { | ||
51 | match id { | ||
52 | ModuleDefId::ModuleId(it) => ModuleDef::Module(it.into()), | ||
53 | ModuleDefId::FunctionId(it) => ModuleDef::Function(it.into()), | ||
54 | ModuleDefId::AdtId(it) => ModuleDef::Adt(it.into()), | ||
55 | ModuleDefId::EnumVariantId(it) => ModuleDef::EnumVariant(it.into()), | ||
56 | ModuleDefId::ConstId(it) => ModuleDef::Const(it.into()), | ||
57 | ModuleDefId::StaticId(it) => ModuleDef::Static(it.into()), | ||
58 | ModuleDefId::TraitId(it) => ModuleDef::Trait(it.into()), | ||
59 | ModuleDefId::TypeAliasId(it) => ModuleDef::TypeAlias(it.into()), | ||
60 | ModuleDefId::BuiltinType(it) => ModuleDef::BuiltinType(it), | ||
61 | } | ||
62 | } | ||
63 | } | ||
diff --git a/crates/ra_hir/src/from_source.rs b/crates/ra_hir/src/from_source.rs index a9de01455..9899bdbbc 100644 --- a/crates/ra_hir/src/from_source.rs +++ b/crates/ra_hir/src/from_source.rs | |||
@@ -149,14 +149,20 @@ impl Module { | |||
149 | ModuleSource::SourceFile(_) => None, | 149 | ModuleSource::SourceFile(_) => None, |
150 | }; | 150 | }; |
151 | 151 | ||
152 | db.relevant_crates(src.file_id.original_file(db)) | 152 | db.relevant_crates(src.file_id.original_file(db)).iter().find_map(|&crate_id| { |
153 | .iter() | 153 | let def_map = db.crate_def_map(crate_id); |
154 | .map(|&crate_id| Crate { crate_id }) | 154 | |
155 | .find_map(|krate| { | 155 | let (module_id, _module_data) = |
156 | let def_map = db.crate_def_map(krate); | 156 | def_map.modules.iter().find(|(_module_id, module_data)| { |
157 | let module_id = def_map.find_module_by_source(src.file_id, decl_id)?; | 157 | if decl_id.is_some() { |
158 | Some(Module::new(krate, module_id)) | 158 | module_data.declaration == decl_id |
159 | }) | 159 | } else { |
160 | module_data.definition.map(|it| it.into()) == Some(src.file_id) | ||
161 | } | ||
162 | })?; | ||
163 | |||
164 | Some(Module::new(Crate { crate_id }, module_id)) | ||
165 | }) | ||
160 | } | 166 | } |
161 | } | 167 | } |
162 | 168 | ||
diff --git a/crates/ra_hir/src/generics.rs b/crates/ra_hir/src/generics.rs index 52e1fbf29..9c261eda9 100644 --- a/crates/ra_hir/src/generics.rs +++ b/crates/ra_hir/src/generics.rs | |||
@@ -77,9 +77,10 @@ impl GenericParams { | |||
77 | let parent = match def { | 77 | let parent = match def { |
78 | GenericDef::Function(it) => it.container(db).map(GenericDef::from), | 78 | GenericDef::Function(it) => it.container(db).map(GenericDef::from), |
79 | GenericDef::TypeAlias(it) => it.container(db).map(GenericDef::from), | 79 | GenericDef::TypeAlias(it) => it.container(db).map(GenericDef::from), |
80 | GenericDef::Const(it) => it.container(db).map(GenericDef::from), | ||
80 | GenericDef::EnumVariant(it) => Some(it.parent_enum(db).into()), | 81 | GenericDef::EnumVariant(it) => Some(it.parent_enum(db).into()), |
81 | GenericDef::Adt(_) | GenericDef::Trait(_) => None, | 82 | GenericDef::Adt(_) | GenericDef::Trait(_) => None, |
82 | GenericDef::ImplBlock(_) | GenericDef::Const(_) => None, | 83 | GenericDef::ImplBlock(_) => None, |
83 | }; | 84 | }; |
84 | let mut generics = GenericParams { | 85 | let mut generics = GenericParams { |
85 | def, | 86 | def, |
diff --git a/crates/ra_hir/src/lib.rs b/crates/ra_hir/src/lib.rs index 603b0c3dc..3ba99d92d 100644 --- a/crates/ra_hir/src/lib.rs +++ b/crates/ra_hir/src/lib.rs | |||
@@ -34,7 +34,6 @@ pub mod mock; | |||
34 | pub mod source_binder; | 34 | pub mod source_binder; |
35 | 35 | ||
36 | mod ids; | 36 | mod ids; |
37 | mod nameres; | ||
38 | mod adt; | 37 | mod adt; |
39 | mod traits; | 38 | mod traits; |
40 | mod type_alias; | 39 | mod type_alias; |
@@ -47,6 +46,7 @@ mod resolve; | |||
47 | pub mod diagnostics; | 46 | pub mod diagnostics; |
48 | mod util; | 47 | mod util; |
49 | 48 | ||
49 | mod from_id; | ||
50 | mod code_model; | 50 | mod code_model; |
51 | 51 | ||
52 | pub mod from_source; | 52 | pub mod from_source; |
@@ -62,17 +62,16 @@ pub use crate::{ | |||
62 | adt::VariantDef, | 62 | adt::VariantDef, |
63 | code_model::{ | 63 | code_model::{ |
64 | docs::{DocDef, Docs, Documentation}, | 64 | docs::{DocDef, Docs, Documentation}, |
65 | src::{HasBodySource, HasSource, Source}, | 65 | src::{HasBodySource, HasSource}, |
66 | Adt, AssocItem, BuiltinType, Const, ConstData, Container, Crate, CrateDependency, | 66 | Adt, AssocItem, Const, ConstData, Container, Crate, CrateDependency, DefWithBody, Enum, |
67 | DefWithBody, Enum, EnumVariant, FieldSource, FnData, Function, HasBody, MacroDef, Module, | 67 | EnumVariant, FieldSource, FnData, Function, HasBody, MacroDef, Module, ModuleDef, |
68 | ModuleDef, ModuleSource, Static, Struct, StructField, Trait, TypeAlias, Union, | 68 | ModuleSource, Static, Struct, StructField, Trait, TypeAlias, Union, |
69 | }, | 69 | }, |
70 | expr::ExprScopes, | 70 | expr::ExprScopes, |
71 | from_source::FromSource, | 71 | from_source::FromSource, |
72 | generics::{GenericDef, GenericParam, GenericParams, HasGenericParams}, | 72 | generics::{GenericDef, GenericParam, GenericParams, HasGenericParams}, |
73 | ids::{HirFileId, MacroCallId, MacroCallLoc, MacroDefId, MacroFile}, | 73 | ids::{HirFileId, MacroCallId, MacroCallLoc, MacroDefId, MacroFile}, |
74 | impl_block::ImplBlock, | 74 | impl_block::ImplBlock, |
75 | nameres::{ImportId, Namespace, PerNs}, | ||
76 | resolve::ScopeDef, | 75 | resolve::ScopeDef, |
77 | source_binder::{PathResolution, ScopeEntryWithSyntax, SourceAnalyzer}, | 76 | source_binder::{PathResolution, ScopeEntryWithSyntax, SourceAnalyzer}, |
78 | ty::{ | 77 | ty::{ |
@@ -81,7 +80,12 @@ pub use crate::{ | |||
81 | }; | 80 | }; |
82 | 81 | ||
83 | pub use hir_def::{ | 82 | pub use hir_def::{ |
83 | builtin_type::BuiltinType, | ||
84 | nameres::{ | ||
85 | per_ns::{Namespace, PerNs}, | ||
86 | raw::ImportId, | ||
87 | }, | ||
84 | path::{Path, PathKind}, | 88 | path::{Path, PathKind}, |
85 | type_ref::Mutability, | 89 | type_ref::Mutability, |
86 | }; | 90 | }; |
87 | pub use hir_expand::{either::Either, name::Name}; | 91 | pub use hir_expand::{either::Either, name::Name, Source}; |
diff --git a/crates/ra_hir/src/mock.rs b/crates/ra_hir/src/mock.rs index 35dfaf3ba..8d98f88ce 100644 --- a/crates/ra_hir/src/mock.rs +++ b/crates/ra_hir/src/mock.rs | |||
@@ -2,17 +2,17 @@ | |||
2 | 2 | ||
3 | use std::{panic, sync::Arc}; | 3 | use std::{panic, sync::Arc}; |
4 | 4 | ||
5 | use hir_expand::diagnostics::DiagnosticSink; | ||
5 | use parking_lot::Mutex; | 6 | use parking_lot::Mutex; |
6 | use ra_cfg::CfgOptions; | 7 | use ra_cfg::CfgOptions; |
7 | use ra_db::{ | 8 | use ra_db::{ |
8 | salsa, CrateGraph, CrateId, Edition, FileId, FileLoader, FileLoaderDelegate, FilePosition, | 9 | salsa, CrateGraph, CrateId, Edition, FileId, FileLoader, FileLoaderDelegate, FilePosition, |
9 | SourceDatabase, SourceDatabaseExt, SourceRoot, SourceRootId, | 10 | RelativePath, RelativePathBuf, SourceDatabase, SourceDatabaseExt, SourceRoot, SourceRootId, |
10 | }; | 11 | }; |
11 | use relative_path::{RelativePath, RelativePathBuf}; | ||
12 | use rustc_hash::FxHashMap; | 12 | use rustc_hash::FxHashMap; |
13 | use test_utils::{extract_offset, parse_fixture, CURSOR_MARKER}; | 13 | use test_utils::{extract_offset, parse_fixture, CURSOR_MARKER}; |
14 | 14 | ||
15 | use crate::{db, debug::HirDebugHelper, diagnostics::DiagnosticSink}; | 15 | use crate::{db, debug::HirDebugHelper}; |
16 | 16 | ||
17 | pub const WORKSPACE: SourceRootId = SourceRootId(0); | 17 | pub const WORKSPACE: SourceRootId = SourceRootId(0); |
18 | 18 | ||
diff --git a/crates/ra_hir/src/nameres.rs b/crates/ra_hir/src/nameres.rs deleted file mode 100644 index 39f585b44..000000000 --- a/crates/ra_hir/src/nameres.rs +++ /dev/null | |||
@@ -1,559 +0,0 @@ | |||
1 | //! This module implements import-resolution/macro expansion algorithm. | ||
2 | //! | ||
3 | //! The result of this module is `CrateDefMap`: a data structure which contains: | ||
4 | //! | ||
5 | //! * a tree of modules for the crate | ||
6 | //! * for each module, a set of items visible in the module (directly declared | ||
7 | //! or imported) | ||
8 | //! | ||
9 | //! Note that `CrateDefMap` contains fully macro expanded code. | ||
10 | //! | ||
11 | //! Computing `CrateDefMap` can be partitioned into several logically | ||
12 | //! independent "phases". The phases are mutually recursive though, there's no | ||
13 | //! strict ordering. | ||
14 | //! | ||
15 | //! ## Collecting RawItems | ||
16 | //! | ||
17 | //! This happens in the `raw` module, which parses a single source file into a | ||
18 | //! set of top-level items. Nested imports are desugared to flat imports in | ||
19 | //! this phase. Macro calls are represented as a triple of (Path, Option<Name>, | ||
20 | //! TokenTree). | ||
21 | //! | ||
22 | //! ## Collecting Modules | ||
23 | //! | ||
24 | //! This happens in the `collector` module. In this phase, we recursively walk | ||
25 | //! tree of modules, collect raw items from submodules, populate module scopes | ||
26 | //! with defined items (so, we assign item ids in this phase) and record the set | ||
27 | //! of unresolved imports and macros. | ||
28 | //! | ||
29 | //! While we walk tree of modules, we also record macro_rules definitions and | ||
30 | //! expand calls to macro_rules defined macros. | ||
31 | //! | ||
32 | //! ## Resolving Imports | ||
33 | //! | ||
34 | //! We maintain a list of currently unresolved imports. On every iteration, we | ||
35 | //! try to resolve some imports from this list. If the import is resolved, we | ||
36 | //! record it, by adding an item to current module scope and, if necessary, by | ||
37 | //! recursively populating glob imports. | ||
38 | //! | ||
39 | //! ## Resolving Macros | ||
40 | //! | ||
41 | //! macro_rules from the same crate use a global mutable namespace. We expand | ||
42 | //! them immediately, when we collect modules. | ||
43 | //! | ||
44 | //! Macros from other crates (including proc-macros) can be used with | ||
45 | //! `foo::bar!` syntax. We handle them similarly to imports. There's a list of | ||
46 | //! unexpanded macros. On every iteration, we try to resolve each macro call | ||
47 | //! path and, upon success, we run macro expansion and "collect module" phase | ||
48 | //! on the result | ||
49 | |||
50 | mod per_ns; | ||
51 | mod collector; | ||
52 | mod mod_resolution; | ||
53 | #[cfg(test)] | ||
54 | mod tests; | ||
55 | |||
56 | use std::sync::Arc; | ||
57 | |||
58 | use hir_def::CrateModuleId; | ||
59 | use once_cell::sync::Lazy; | ||
60 | use ra_arena::Arena; | ||
61 | use ra_db::{Edition, FileId}; | ||
62 | use ra_prof::profile; | ||
63 | use ra_syntax::ast; | ||
64 | use rustc_hash::{FxHashMap, FxHashSet}; | ||
65 | use test_utils::tested_by; | ||
66 | |||
67 | use crate::{ | ||
68 | db::{AstDatabase, DefDatabase}, | ||
69 | diagnostics::DiagnosticSink, | ||
70 | ids::MacroDefId, | ||
71 | nameres::diagnostics::DefDiagnostic, | ||
72 | Adt, AstId, BuiltinType, Crate, HirFileId, MacroDef, Module, ModuleDef, Name, Path, PathKind, | ||
73 | Trait, | ||
74 | }; | ||
75 | |||
76 | pub use self::per_ns::{Namespace, PerNs}; | ||
77 | |||
78 | pub use hir_def::nameres::raw::ImportId; | ||
79 | |||
80 | /// Contains all top-level defs from a macro-expanded crate | ||
81 | #[derive(Debug, PartialEq, Eq)] | ||
82 | pub struct CrateDefMap { | ||
83 | krate: Crate, | ||
84 | edition: Edition, | ||
85 | /// The prelude module for this crate. This either comes from an import | ||
86 | /// marked with the `prelude_import` attribute, or (in the normal case) from | ||
87 | /// a dependency (`std` or `core`). | ||
88 | prelude: Option<Module>, | ||
89 | extern_prelude: FxHashMap<Name, ModuleDef>, | ||
90 | root: CrateModuleId, | ||
91 | modules: Arena<CrateModuleId, ModuleData>, | ||
92 | |||
93 | /// Some macros are not well-behavior, which leads to infinite loop | ||
94 | /// e.g. macro_rules! foo { ($ty:ty) => { foo!($ty); } } | ||
95 | /// We mark it down and skip it in collector | ||
96 | /// | ||
97 | /// FIXME: | ||
98 | /// Right now it only handle a poison macro in a single crate, | ||
99 | /// such that if other crate try to call that macro, | ||
100 | /// the whole process will do again until it became poisoned in that crate. | ||
101 | /// We should handle this macro set globally | ||
102 | /// However, do we want to put it as a global variable? | ||
103 | poison_macros: FxHashSet<MacroDefId>, | ||
104 | |||
105 | diagnostics: Vec<DefDiagnostic>, | ||
106 | } | ||
107 | |||
108 | impl std::ops::Index<CrateModuleId> for CrateDefMap { | ||
109 | type Output = ModuleData; | ||
110 | fn index(&self, id: CrateModuleId) -> &ModuleData { | ||
111 | &self.modules[id] | ||
112 | } | ||
113 | } | ||
114 | |||
115 | #[derive(Default, Debug, PartialEq, Eq)] | ||
116 | pub struct ModuleData { | ||
117 | pub(crate) parent: Option<CrateModuleId>, | ||
118 | pub(crate) children: FxHashMap<Name, CrateModuleId>, | ||
119 | pub(crate) scope: ModuleScope, | ||
120 | /// None for root | ||
121 | pub(crate) declaration: Option<AstId<ast::Module>>, | ||
122 | /// None for inline modules. | ||
123 | /// | ||
124 | /// Note that non-inline modules, by definition, live inside non-macro file. | ||
125 | pub(crate) definition: Option<FileId>, | ||
126 | } | ||
127 | |||
128 | #[derive(Debug, Default, PartialEq, Eq, Clone)] | ||
129 | pub struct ModuleScope { | ||
130 | items: FxHashMap<Name, Resolution>, | ||
131 | /// Macros visable in current module in legacy textual scope | ||
132 | /// | ||
133 | /// For macros invoked by an unquatified identifier like `bar!()`, `legacy_macros` will be searched in first. | ||
134 | /// If it yields no result, then it turns to module scoped `macros`. | ||
135 | /// It macros with name quatified with a path like `crate::foo::bar!()`, `legacy_macros` will be skipped, | ||
136 | /// and only normal scoped `macros` will be searched in. | ||
137 | /// | ||
138 | /// Note that this automatically inherit macros defined textually before the definition of module itself. | ||
139 | /// | ||
140 | /// Module scoped macros will be inserted into `items` instead of here. | ||
141 | // FIXME: Macro shadowing in one module is not properly handled. Non-item place macros will | ||
142 | // be all resolved to the last one defined if shadowing happens. | ||
143 | legacy_macros: FxHashMap<Name, MacroDef>, | ||
144 | } | ||
145 | |||
146 | static BUILTIN_SCOPE: Lazy<FxHashMap<Name, Resolution>> = Lazy::new(|| { | ||
147 | BuiltinType::ALL | ||
148 | .iter() | ||
149 | .map(|(name, ty)| { | ||
150 | (name.clone(), Resolution { def: PerNs::types(ty.clone().into()), import: None }) | ||
151 | }) | ||
152 | .collect() | ||
153 | }); | ||
154 | |||
155 | /// Legacy macros can only be accessed through special methods like `get_legacy_macros`. | ||
156 | /// Other methods will only resolve values, types and module scoped macros only. | ||
157 | impl ModuleScope { | ||
158 | pub fn entries<'a>(&'a self) -> impl Iterator<Item = (&'a Name, &'a Resolution)> + 'a { | ||
159 | //FIXME: shadowing | ||
160 | self.items.iter().chain(BUILTIN_SCOPE.iter()) | ||
161 | } | ||
162 | |||
163 | /// Iterate over all module scoped macros | ||
164 | pub fn macros<'a>(&'a self) -> impl Iterator<Item = (&'a Name, MacroDef)> + 'a { | ||
165 | self.items | ||
166 | .iter() | ||
167 | .filter_map(|(name, res)| res.def.get_macros().map(|macro_| (name, macro_))) | ||
168 | } | ||
169 | |||
170 | /// Iterate over all legacy textual scoped macros visable at the end of the module | ||
171 | pub fn legacy_macros<'a>(&'a self) -> impl Iterator<Item = (&'a Name, MacroDef)> + 'a { | ||
172 | self.legacy_macros.iter().map(|(name, def)| (name, *def)) | ||
173 | } | ||
174 | |||
175 | /// Get a name from current module scope, legacy macros are not included | ||
176 | pub fn get(&self, name: &Name) -> Option<&Resolution> { | ||
177 | self.items.get(name).or_else(|| BUILTIN_SCOPE.get(name)) | ||
178 | } | ||
179 | |||
180 | pub fn traits<'a>(&'a self) -> impl Iterator<Item = Trait> + 'a { | ||
181 | self.items.values().filter_map(|r| match r.def.take_types() { | ||
182 | Some(ModuleDef::Trait(t)) => Some(t), | ||
183 | _ => None, | ||
184 | }) | ||
185 | } | ||
186 | |||
187 | fn get_legacy_macro(&self, name: &Name) -> Option<MacroDef> { | ||
188 | self.legacy_macros.get(name).copied() | ||
189 | } | ||
190 | } | ||
191 | |||
192 | #[derive(Debug, Clone, PartialEq, Eq, Default)] | ||
193 | pub struct Resolution { | ||
194 | /// None for unresolved | ||
195 | pub def: PerNs, | ||
196 | /// ident by which this is imported into local scope. | ||
197 | pub import: Option<ImportId>, | ||
198 | } | ||
199 | |||
200 | impl Resolution { | ||
201 | pub(crate) fn from_macro(macro_: MacroDef) -> Self { | ||
202 | Resolution { def: PerNs::macros(macro_), import: None } | ||
203 | } | ||
204 | } | ||
205 | |||
206 | #[derive(Debug, Clone)] | ||
207 | struct ResolvePathResult { | ||
208 | resolved_def: PerNs, | ||
209 | segment_index: Option<usize>, | ||
210 | reached_fixedpoint: ReachedFixedPoint, | ||
211 | } | ||
212 | |||
213 | impl ResolvePathResult { | ||
214 | fn empty(reached_fixedpoint: ReachedFixedPoint) -> ResolvePathResult { | ||
215 | ResolvePathResult::with(PerNs::none(), reached_fixedpoint, None) | ||
216 | } | ||
217 | |||
218 | fn with( | ||
219 | resolved_def: PerNs, | ||
220 | reached_fixedpoint: ReachedFixedPoint, | ||
221 | segment_index: Option<usize>, | ||
222 | ) -> ResolvePathResult { | ||
223 | ResolvePathResult { resolved_def, reached_fixedpoint, segment_index } | ||
224 | } | ||
225 | } | ||
226 | |||
227 | #[derive(Debug, Clone, Copy, PartialEq, Eq)] | ||
228 | enum ResolveMode { | ||
229 | Import, | ||
230 | Other, | ||
231 | } | ||
232 | |||
233 | #[derive(Debug, Clone, Copy, PartialEq, Eq)] | ||
234 | enum ReachedFixedPoint { | ||
235 | Yes, | ||
236 | No, | ||
237 | } | ||
238 | |||
239 | impl CrateDefMap { | ||
240 | pub(crate) fn crate_def_map_query( | ||
241 | // Note that this doesn't have `+ AstDatabase`! | ||
242 | // This gurantess that `CrateDefMap` is stable across reparses. | ||
243 | db: &impl DefDatabase, | ||
244 | krate: Crate, | ||
245 | ) -> Arc<CrateDefMap> { | ||
246 | let _p = profile("crate_def_map_query"); | ||
247 | let def_map = { | ||
248 | let edition = krate.edition(db); | ||
249 | let mut modules: Arena<CrateModuleId, ModuleData> = Arena::default(); | ||
250 | let root = modules.alloc(ModuleData::default()); | ||
251 | CrateDefMap { | ||
252 | krate, | ||
253 | edition, | ||
254 | extern_prelude: FxHashMap::default(), | ||
255 | prelude: None, | ||
256 | root, | ||
257 | modules, | ||
258 | poison_macros: FxHashSet::default(), | ||
259 | diagnostics: Vec::new(), | ||
260 | } | ||
261 | }; | ||
262 | let def_map = collector::collect_defs(db, def_map); | ||
263 | Arc::new(def_map) | ||
264 | } | ||
265 | |||
266 | pub(crate) fn krate(&self) -> Crate { | ||
267 | self.krate | ||
268 | } | ||
269 | |||
270 | pub(crate) fn root(&self) -> CrateModuleId { | ||
271 | self.root | ||
272 | } | ||
273 | |||
274 | pub(crate) fn prelude(&self) -> Option<Module> { | ||
275 | self.prelude | ||
276 | } | ||
277 | |||
278 | pub(crate) fn extern_prelude(&self) -> &FxHashMap<Name, ModuleDef> { | ||
279 | &self.extern_prelude | ||
280 | } | ||
281 | |||
282 | pub(crate) fn add_diagnostics( | ||
283 | &self, | ||
284 | db: &(impl DefDatabase + AstDatabase), | ||
285 | module: CrateModuleId, | ||
286 | sink: &mut DiagnosticSink, | ||
287 | ) { | ||
288 | self.diagnostics.iter().for_each(|it| it.add_to(db, module, sink)) | ||
289 | } | ||
290 | |||
291 | pub(crate) fn find_module_by_source( | ||
292 | &self, | ||
293 | file_id: HirFileId, | ||
294 | decl_id: Option<AstId<ast::Module>>, | ||
295 | ) -> Option<CrateModuleId> { | ||
296 | let (module_id, _module_data) = self.modules.iter().find(|(_module_id, module_data)| { | ||
297 | if decl_id.is_some() { | ||
298 | module_data.declaration == decl_id | ||
299 | } else { | ||
300 | module_data.definition.map(|it| it.into()) == Some(file_id) | ||
301 | } | ||
302 | })?; | ||
303 | Some(module_id) | ||
304 | } | ||
305 | |||
306 | pub(crate) fn resolve_path( | ||
307 | &self, | ||
308 | db: &impl DefDatabase, | ||
309 | original_module: CrateModuleId, | ||
310 | path: &Path, | ||
311 | ) -> (PerNs, Option<usize>) { | ||
312 | let res = self.resolve_path_fp_with_macro(db, ResolveMode::Other, original_module, path); | ||
313 | (res.resolved_def, res.segment_index) | ||
314 | } | ||
315 | |||
316 | // Returns Yes if we are sure that additions to `ItemMap` wouldn't change | ||
317 | // the result. | ||
318 | fn resolve_path_fp_with_macro( | ||
319 | &self, | ||
320 | db: &impl DefDatabase, | ||
321 | mode: ResolveMode, | ||
322 | original_module: CrateModuleId, | ||
323 | path: &Path, | ||
324 | ) -> ResolvePathResult { | ||
325 | let mut segments = path.segments.iter().enumerate(); | ||
326 | let mut curr_per_ns: PerNs = match path.kind { | ||
327 | PathKind::DollarCrate(crate_id) => { | ||
328 | let krate = Crate { crate_id }; | ||
329 | if krate == self.krate { | ||
330 | tested_by!(macro_dollar_crate_self); | ||
331 | PerNs::types(Module::new(self.krate, self.root).into()) | ||
332 | } else { | ||
333 | match krate.root_module(db) { | ||
334 | Some(module) => { | ||
335 | tested_by!(macro_dollar_crate_other); | ||
336 | PerNs::types(module.into()) | ||
337 | } | ||
338 | None => return ResolvePathResult::empty(ReachedFixedPoint::Yes), | ||
339 | } | ||
340 | } | ||
341 | } | ||
342 | PathKind::Crate => PerNs::types(Module::new(self.krate, self.root).into()), | ||
343 | PathKind::Self_ => PerNs::types(Module::new(self.krate, original_module).into()), | ||
344 | // plain import or absolute path in 2015: crate-relative with | ||
345 | // fallback to extern prelude (with the simplification in | ||
346 | // rust-lang/rust#57745) | ||
347 | // FIXME there must be a nicer way to write this condition | ||
348 | PathKind::Plain | PathKind::Abs | ||
349 | if self.edition == Edition::Edition2015 | ||
350 | && (path.kind == PathKind::Abs || mode == ResolveMode::Import) => | ||
351 | { | ||
352 | let segment = match segments.next() { | ||
353 | Some((_, segment)) => segment, | ||
354 | None => return ResolvePathResult::empty(ReachedFixedPoint::Yes), | ||
355 | }; | ||
356 | log::debug!("resolving {:?} in crate root (+ extern prelude)", segment); | ||
357 | self.resolve_name_in_crate_root_or_extern_prelude(&segment.name) | ||
358 | } | ||
359 | PathKind::Plain => { | ||
360 | let segment = match segments.next() { | ||
361 | Some((_, segment)) => segment, | ||
362 | None => return ResolvePathResult::empty(ReachedFixedPoint::Yes), | ||
363 | }; | ||
364 | log::debug!("resolving {:?} in module", segment); | ||
365 | self.resolve_name_in_module(db, original_module, &segment.name) | ||
366 | } | ||
367 | PathKind::Super => { | ||
368 | if let Some(p) = self.modules[original_module].parent { | ||
369 | PerNs::types(Module::new(self.krate, p).into()) | ||
370 | } else { | ||
371 | log::debug!("super path in root module"); | ||
372 | return ResolvePathResult::empty(ReachedFixedPoint::Yes); | ||
373 | } | ||
374 | } | ||
375 | PathKind::Abs => { | ||
376 | // 2018-style absolute path -- only extern prelude | ||
377 | let segment = match segments.next() { | ||
378 | Some((_, segment)) => segment, | ||
379 | None => return ResolvePathResult::empty(ReachedFixedPoint::Yes), | ||
380 | }; | ||
381 | if let Some(def) = self.extern_prelude.get(&segment.name) { | ||
382 | log::debug!("absolute path {:?} resolved to crate {:?}", path, def); | ||
383 | PerNs::types(*def) | ||
384 | } else { | ||
385 | return ResolvePathResult::empty(ReachedFixedPoint::No); // extern crate declarations can add to the extern prelude | ||
386 | } | ||
387 | } | ||
388 | PathKind::Type(_) => { | ||
389 | // This is handled in `infer::infer_path_expr` | ||
390 | // The result returned here does not matter | ||
391 | return ResolvePathResult::empty(ReachedFixedPoint::Yes); | ||
392 | } | ||
393 | }; | ||
394 | |||
395 | for (i, segment) in segments { | ||
396 | let curr = match curr_per_ns.take_types() { | ||
397 | Some(r) => r, | ||
398 | None => { | ||
399 | // we still have path segments left, but the path so far | ||
400 | // didn't resolve in the types namespace => no resolution | ||
401 | // (don't break here because `curr_per_ns` might contain | ||
402 | // something in the value namespace, and it would be wrong | ||
403 | // to return that) | ||
404 | return ResolvePathResult::empty(ReachedFixedPoint::No); | ||
405 | } | ||
406 | }; | ||
407 | // resolve segment in curr | ||
408 | |||
409 | curr_per_ns = match curr { | ||
410 | ModuleDef::Module(module) => { | ||
411 | if module.krate() != self.krate { | ||
412 | let path = | ||
413 | Path { segments: path.segments[i..].to_vec(), kind: PathKind::Self_ }; | ||
414 | log::debug!("resolving {:?} in other crate", path); | ||
415 | let defp_map = db.crate_def_map(module.krate()); | ||
416 | let (def, s) = defp_map.resolve_path(db, module.id.module_id, &path); | ||
417 | return ResolvePathResult::with( | ||
418 | def, | ||
419 | ReachedFixedPoint::Yes, | ||
420 | s.map(|s| s + i), | ||
421 | ); | ||
422 | } | ||
423 | |||
424 | // Since it is a qualified path here, it should not contains legacy macros | ||
425 | match self[module.id.module_id].scope.get(&segment.name) { | ||
426 | Some(res) => res.def, | ||
427 | _ => { | ||
428 | log::debug!("path segment {:?} not found", segment.name); | ||
429 | return ResolvePathResult::empty(ReachedFixedPoint::No); | ||
430 | } | ||
431 | } | ||
432 | } | ||
433 | ModuleDef::Adt(Adt::Enum(e)) => { | ||
434 | // enum variant | ||
435 | tested_by!(can_import_enum_variant); | ||
436 | match e.variant(db, &segment.name) { | ||
437 | Some(variant) => PerNs::both(variant.into(), variant.into()), | ||
438 | None => { | ||
439 | return ResolvePathResult::with( | ||
440 | PerNs::types(e.into()), | ||
441 | ReachedFixedPoint::Yes, | ||
442 | Some(i), | ||
443 | ); | ||
444 | } | ||
445 | } | ||
446 | } | ||
447 | s => { | ||
448 | // could be an inherent method call in UFCS form | ||
449 | // (`Struct::method`), or some other kind of associated item | ||
450 | log::debug!( | ||
451 | "path segment {:?} resolved to non-module {:?}, but is not last", | ||
452 | segment.name, | ||
453 | curr, | ||
454 | ); | ||
455 | |||
456 | return ResolvePathResult::with( | ||
457 | PerNs::types(s), | ||
458 | ReachedFixedPoint::Yes, | ||
459 | Some(i), | ||
460 | ); | ||
461 | } | ||
462 | }; | ||
463 | } | ||
464 | ResolvePathResult::with(curr_per_ns, ReachedFixedPoint::Yes, None) | ||
465 | } | ||
466 | |||
467 | fn resolve_name_in_crate_root_or_extern_prelude(&self, name: &Name) -> PerNs { | ||
468 | let from_crate_root = | ||
469 | self[self.root].scope.get(name).map_or_else(PerNs::none, |res| res.def); | ||
470 | let from_extern_prelude = self.resolve_name_in_extern_prelude(name); | ||
471 | |||
472 | from_crate_root.or(from_extern_prelude) | ||
473 | } | ||
474 | |||
475 | pub(crate) fn resolve_name_in_module( | ||
476 | &self, | ||
477 | db: &impl DefDatabase, | ||
478 | module: CrateModuleId, | ||
479 | name: &Name, | ||
480 | ) -> PerNs { | ||
481 | // Resolve in: | ||
482 | // - legacy scope of macro | ||
483 | // - current module / scope | ||
484 | // - extern prelude | ||
485 | // - std prelude | ||
486 | let from_legacy_macro = | ||
487 | self[module].scope.get_legacy_macro(name).map_or_else(PerNs::none, PerNs::macros); | ||
488 | let from_scope = self[module].scope.get(name).map_or_else(PerNs::none, |res| res.def); | ||
489 | let from_extern_prelude = | ||
490 | self.extern_prelude.get(name).map_or(PerNs::none(), |&it| PerNs::types(it)); | ||
491 | let from_prelude = self.resolve_in_prelude(db, name); | ||
492 | |||
493 | from_legacy_macro.or(from_scope).or(from_extern_prelude).or(from_prelude) | ||
494 | } | ||
495 | |||
496 | fn resolve_name_in_extern_prelude(&self, name: &Name) -> PerNs { | ||
497 | self.extern_prelude.get(name).map_or(PerNs::none(), |&it| PerNs::types(it)) | ||
498 | } | ||
499 | |||
500 | fn resolve_in_prelude(&self, db: &impl DefDatabase, name: &Name) -> PerNs { | ||
501 | if let Some(prelude) = self.prelude { | ||
502 | let keep; | ||
503 | let def_map = if prelude.krate() == self.krate { | ||
504 | self | ||
505 | } else { | ||
506 | // Extend lifetime | ||
507 | keep = db.crate_def_map(prelude.krate()); | ||
508 | &keep | ||
509 | }; | ||
510 | def_map[prelude.id.module_id].scope.get(name).map_or_else(PerNs::none, |res| res.def) | ||
511 | } else { | ||
512 | PerNs::none() | ||
513 | } | ||
514 | } | ||
515 | } | ||
516 | |||
517 | mod diagnostics { | ||
518 | use ra_syntax::{ast, AstPtr}; | ||
519 | use relative_path::RelativePathBuf; | ||
520 | |||
521 | use crate::{ | ||
522 | db::{AstDatabase, DefDatabase}, | ||
523 | diagnostics::{DiagnosticSink, UnresolvedModule}, | ||
524 | nameres::CrateModuleId, | ||
525 | AstId, | ||
526 | }; | ||
527 | |||
528 | #[derive(Debug, PartialEq, Eq)] | ||
529 | pub(super) enum DefDiagnostic { | ||
530 | UnresolvedModule { | ||
531 | module: CrateModuleId, | ||
532 | declaration: AstId<ast::Module>, | ||
533 | candidate: RelativePathBuf, | ||
534 | }, | ||
535 | } | ||
536 | |||
537 | impl DefDiagnostic { | ||
538 | pub(super) fn add_to( | ||
539 | &self, | ||
540 | db: &(impl DefDatabase + AstDatabase), | ||
541 | target_module: CrateModuleId, | ||
542 | sink: &mut DiagnosticSink, | ||
543 | ) { | ||
544 | match self { | ||
545 | DefDiagnostic::UnresolvedModule { module, declaration, candidate } => { | ||
546 | if *module != target_module { | ||
547 | return; | ||
548 | } | ||
549 | let decl = declaration.to_node(db); | ||
550 | sink.push(UnresolvedModule { | ||
551 | file: declaration.file_id(), | ||
552 | decl: AstPtr::new(&decl), | ||
553 | candidate: candidate.clone(), | ||
554 | }) | ||
555 | } | ||
556 | } | ||
557 | } | ||
558 | } | ||
559 | } | ||
diff --git a/crates/ra_hir/src/resolve.rs b/crates/ra_hir/src/resolve.rs index f77c9df9f..b932b0c8c 100644 --- a/crates/ra_hir/src/resolve.rs +++ b/crates/ra_hir/src/resolve.rs | |||
@@ -2,8 +2,10 @@ | |||
2 | use std::sync::Arc; | 2 | use std::sync::Arc; |
3 | 3 | ||
4 | use hir_def::{ | 4 | use hir_def::{ |
5 | builtin_type::BuiltinType, | ||
6 | nameres::CrateDefMap, | ||
5 | path::{Path, PathKind}, | 7 | path::{Path, PathKind}, |
6 | CrateModuleId, | 8 | AdtId, CrateModuleId, ModuleDefId, |
7 | }; | 9 | }; |
8 | use hir_expand::name::{self, Name}; | 10 | use hir_expand::name::{self, Name}; |
9 | use rustc_hash::FxHashSet; | 11 | use rustc_hash::FxHashSet; |
@@ -17,9 +19,8 @@ use crate::{ | |||
17 | }, | 19 | }, |
18 | generics::GenericParams, | 20 | generics::GenericParams, |
19 | impl_block::ImplBlock, | 21 | impl_block::ImplBlock, |
20 | nameres::{CrateDefMap, PerNs}, | 22 | Adt, Const, Enum, EnumVariant, Function, MacroDef, ModuleDef, PerNs, Static, Struct, Trait, |
21 | Adt, BuiltinType, Const, Enum, EnumVariant, Function, MacroDef, ModuleDef, Static, Struct, | 23 | TypeAlias, |
22 | Trait, TypeAlias, | ||
23 | }; | 24 | }; |
24 | 25 | ||
25 | #[derive(Debug, Clone, Default)] | 26 | #[derive(Debug, Clone, Default)] |
@@ -90,7 +91,7 @@ impl Resolver { | |||
90 | pub(crate) fn resolve_known_trait(&self, db: &impl HirDatabase, path: &Path) -> Option<Trait> { | 91 | pub(crate) fn resolve_known_trait(&self, db: &impl HirDatabase, path: &Path) -> Option<Trait> { |
91 | let res = self.resolve_module_path(db, path).take_types()?; | 92 | let res = self.resolve_module_path(db, path).take_types()?; |
92 | match res { | 93 | match res { |
93 | ModuleDef::Trait(it) => Some(it), | 94 | ModuleDefId::TraitId(it) => Some(it.into()), |
94 | _ => None, | 95 | _ => None, |
95 | } | 96 | } |
96 | } | 97 | } |
@@ -103,7 +104,7 @@ impl Resolver { | |||
103 | ) -> Option<Struct> { | 104 | ) -> Option<Struct> { |
104 | let res = self.resolve_module_path(db, path).take_types()?; | 105 | let res = self.resolve_module_path(db, path).take_types()?; |
105 | match res { | 106 | match res { |
106 | ModuleDef::Adt(Adt::Struct(it)) => Some(it), | 107 | ModuleDefId::AdtId(AdtId::StructId(it)) => Some(it.into()), |
107 | _ => None, | 108 | _ => None, |
108 | } | 109 | } |
109 | } | 110 | } |
@@ -112,7 +113,7 @@ impl Resolver { | |||
112 | pub(crate) fn resolve_known_enum(&self, db: &impl HirDatabase, path: &Path) -> Option<Enum> { | 113 | pub(crate) fn resolve_known_enum(&self, db: &impl HirDatabase, path: &Path) -> Option<Enum> { |
113 | let res = self.resolve_module_path(db, path).take_types()?; | 114 | let res = self.resolve_module_path(db, path).take_types()?; |
114 | match res { | 115 | match res { |
115 | ModuleDef::Adt(Adt::Enum(it)) => Some(it), | 116 | ModuleDefId::AdtId(AdtId::EnumId(it)) => Some(it.into()), |
116 | _ => None, | 117 | _ => None, |
117 | } | 118 | } |
118 | } | 119 | } |
@@ -166,18 +167,18 @@ impl Resolver { | |||
166 | Scope::ModuleScope(m) => { | 167 | Scope::ModuleScope(m) => { |
167 | let (module_def, idx) = m.crate_def_map.resolve_path(db, m.module_id, path); | 168 | let (module_def, idx) = m.crate_def_map.resolve_path(db, m.module_id, path); |
168 | let res = match module_def.take_types()? { | 169 | let res = match module_def.take_types()? { |
169 | ModuleDef::Adt(it) => TypeNs::Adt(it), | 170 | ModuleDefId::AdtId(it) => TypeNs::Adt(it.into()), |
170 | ModuleDef::EnumVariant(it) => TypeNs::EnumVariant(it), | 171 | ModuleDefId::EnumVariantId(it) => TypeNs::EnumVariant(it.into()), |
171 | 172 | ||
172 | ModuleDef::TypeAlias(it) => TypeNs::TypeAlias(it), | 173 | ModuleDefId::TypeAliasId(it) => TypeNs::TypeAlias(it.into()), |
173 | ModuleDef::BuiltinType(it) => TypeNs::BuiltinType(it), | 174 | ModuleDefId::BuiltinType(it) => TypeNs::BuiltinType(it), |
174 | 175 | ||
175 | ModuleDef::Trait(it) => TypeNs::Trait(it), | 176 | ModuleDefId::TraitId(it) => TypeNs::Trait(it.into()), |
176 | 177 | ||
177 | ModuleDef::Function(_) | 178 | ModuleDefId::FunctionId(_) |
178 | | ModuleDef::Const(_) | 179 | | ModuleDefId::ConstId(_) |
179 | | ModuleDef::Static(_) | 180 | | ModuleDefId::StaticId(_) |
180 | | ModuleDef::Module(_) => return None, | 181 | | ModuleDefId::ModuleId(_) => return None, |
181 | }; | 182 | }; |
182 | return Some((res, idx)); | 183 | return Some((res, idx)); |
183 | } | 184 | } |
@@ -261,33 +262,35 @@ impl Resolver { | |||
261 | return match idx { | 262 | return match idx { |
262 | None => { | 263 | None => { |
263 | let value = match module_def.take_values()? { | 264 | let value = match module_def.take_values()? { |
264 | ModuleDef::Function(it) => ValueNs::Function(it), | 265 | ModuleDefId::FunctionId(it) => ValueNs::Function(it.into()), |
265 | ModuleDef::Adt(Adt::Struct(it)) => ValueNs::Struct(it), | 266 | ModuleDefId::AdtId(AdtId::StructId(it)) => { |
266 | ModuleDef::EnumVariant(it) => ValueNs::EnumVariant(it), | 267 | ValueNs::Struct(it.into()) |
267 | ModuleDef::Const(it) => ValueNs::Const(it), | 268 | } |
268 | ModuleDef::Static(it) => ValueNs::Static(it), | 269 | ModuleDefId::EnumVariantId(it) => ValueNs::EnumVariant(it.into()), |
269 | 270 | ModuleDefId::ConstId(it) => ValueNs::Const(it.into()), | |
270 | ModuleDef::Adt(Adt::Enum(_)) | 271 | ModuleDefId::StaticId(it) => ValueNs::Static(it.into()), |
271 | | ModuleDef::Adt(Adt::Union(_)) | 272 | |
272 | | ModuleDef::Trait(_) | 273 | ModuleDefId::AdtId(AdtId::EnumId(_)) |
273 | | ModuleDef::TypeAlias(_) | 274 | | ModuleDefId::AdtId(AdtId::UnionId(_)) |
274 | | ModuleDef::BuiltinType(_) | 275 | | ModuleDefId::TraitId(_) |
275 | | ModuleDef::Module(_) => return None, | 276 | | ModuleDefId::TypeAliasId(_) |
277 | | ModuleDefId::BuiltinType(_) | ||
278 | | ModuleDefId::ModuleId(_) => return None, | ||
276 | }; | 279 | }; |
277 | Some(ResolveValueResult::ValueNs(value)) | 280 | Some(ResolveValueResult::ValueNs(value)) |
278 | } | 281 | } |
279 | Some(idx) => { | 282 | Some(idx) => { |
280 | let ty = match module_def.take_types()? { | 283 | let ty = match module_def.take_types()? { |
281 | ModuleDef::Adt(it) => TypeNs::Adt(it), | 284 | ModuleDefId::AdtId(it) => TypeNs::Adt(it.into()), |
282 | ModuleDef::Trait(it) => TypeNs::Trait(it), | 285 | ModuleDefId::TraitId(it) => TypeNs::Trait(it.into()), |
283 | ModuleDef::TypeAlias(it) => TypeNs::TypeAlias(it), | 286 | ModuleDefId::TypeAliasId(it) => TypeNs::TypeAlias(it.into()), |
284 | ModuleDef::BuiltinType(it) => TypeNs::BuiltinType(it), | 287 | ModuleDefId::BuiltinType(it) => TypeNs::BuiltinType(it), |
285 | 288 | ||
286 | ModuleDef::Module(_) | 289 | ModuleDefId::ModuleId(_) |
287 | | ModuleDef::Function(_) | 290 | | ModuleDefId::FunctionId(_) |
288 | | ModuleDef::EnumVariant(_) | 291 | | ModuleDefId::EnumVariantId(_) |
289 | | ModuleDef::Const(_) | 292 | | ModuleDefId::ConstId(_) |
290 | | ModuleDef::Static(_) => return None, | 293 | | ModuleDefId::StaticId(_) => return None, |
291 | }; | 294 | }; |
292 | Some(ResolveValueResult::Partial(ty, idx)) | 295 | Some(ResolveValueResult::Partial(ty, idx)) |
293 | } | 296 | } |
@@ -315,7 +318,7 @@ impl Resolver { | |||
315 | path: &Path, | 318 | path: &Path, |
316 | ) -> Option<MacroDef> { | 319 | ) -> Option<MacroDef> { |
317 | let (item_map, module) = self.module()?; | 320 | let (item_map, module) = self.module()?; |
318 | item_map.resolve_path(db, module, path).0.get_macros() | 321 | item_map.resolve_path(db, module, path).0.get_macros().map(MacroDef::from) |
319 | } | 322 | } |
320 | 323 | ||
321 | pub(crate) fn process_all_names( | 324 | pub(crate) fn process_all_names( |
@@ -333,10 +336,11 @@ impl Resolver { | |||
333 | for scope in &self.scopes { | 336 | for scope in &self.scopes { |
334 | if let Scope::ModuleScope(m) = scope { | 337 | if let Scope::ModuleScope(m) = scope { |
335 | if let Some(prelude) = m.crate_def_map.prelude() { | 338 | if let Some(prelude) = m.crate_def_map.prelude() { |
336 | let prelude_def_map = db.crate_def_map(prelude.krate()); | 339 | let prelude_def_map = db.crate_def_map(prelude.krate); |
337 | traits.extend(prelude_def_map[prelude.id.module_id].scope.traits()); | 340 | traits |
341 | .extend(prelude_def_map[prelude.module_id].scope.traits().map(Trait::from)); | ||
338 | } | 342 | } |
339 | traits.extend(m.crate_def_map[m.module_id].scope.traits()); | 343 | traits.extend(m.crate_def_map[m.module_id].scope.traits().map(Trait::from)); |
340 | } | 344 | } |
341 | } | 345 | } |
342 | traits | 346 | traits |
@@ -351,7 +355,7 @@ impl Resolver { | |||
351 | } | 355 | } |
352 | 356 | ||
353 | pub(crate) fn krate(&self) -> Option<Crate> { | 357 | pub(crate) fn krate(&self) -> Option<Crate> { |
354 | self.module().map(|t| t.0.krate()) | 358 | self.module().map(|t| Crate { crate_id: t.0.krate() }) |
355 | } | 359 | } |
356 | 360 | ||
357 | pub(crate) fn where_predicates_in_scope<'a>( | 361 | pub(crate) fn where_predicates_in_scope<'a>( |
@@ -420,8 +424,10 @@ impl From<PerNs> for ScopeDef { | |||
420 | fn from(def: PerNs) -> Self { | 424 | fn from(def: PerNs) -> Self { |
421 | def.take_types() | 425 | def.take_types() |
422 | .or_else(|| def.take_values()) | 426 | .or_else(|| def.take_values()) |
423 | .map(ScopeDef::ModuleDef) | 427 | .map(|module_def_id| ScopeDef::ModuleDef(module_def_id.into())) |
424 | .or_else(|| def.get_macros().map(ScopeDef::MacroDef)) | 428 | .or_else(|| { |
429 | def.get_macros().map(|macro_def_id| ScopeDef::MacroDef(macro_def_id.into())) | ||
430 | }) | ||
425 | .unwrap_or(ScopeDef::Unknown) | 431 | .unwrap_or(ScopeDef::Unknown) |
426 | } | 432 | } |
427 | } | 433 | } |
@@ -441,18 +447,16 @@ impl Scope { | |||
441 | f(name.clone(), res.def.into()); | 447 | f(name.clone(), res.def.into()); |
442 | }); | 448 | }); |
443 | m.crate_def_map[m.module_id].scope.legacy_macros().for_each(|(name, macro_)| { | 449 | m.crate_def_map[m.module_id].scope.legacy_macros().for_each(|(name, macro_)| { |
444 | f(name.clone(), ScopeDef::MacroDef(macro_)); | 450 | f(name.clone(), ScopeDef::MacroDef(macro_.into())); |
445 | }); | 451 | }); |
446 | m.crate_def_map.extern_prelude().iter().for_each(|(name, def)| { | 452 | m.crate_def_map.extern_prelude().iter().for_each(|(name, &def)| { |
447 | f(name.clone(), ScopeDef::ModuleDef(*def)); | 453 | f(name.clone(), ScopeDef::ModuleDef(def.into())); |
448 | }); | 454 | }); |
449 | if let Some(prelude) = m.crate_def_map.prelude() { | 455 | if let Some(prelude) = m.crate_def_map.prelude() { |
450 | let prelude_def_map = db.crate_def_map(prelude.krate()); | 456 | let prelude_def_map = db.crate_def_map(prelude.krate); |
451 | prelude_def_map[prelude.id.module_id].scope.entries().for_each( | 457 | prelude_def_map[prelude.module_id].scope.entries().for_each(|(name, res)| { |
452 | |(name, res)| { | 458 | f(name.clone(), res.def.into()); |
453 | f(name.clone(), res.def.into()); | 459 | }); |
454 | }, | ||
455 | ); | ||
456 | } | 460 | } |
457 | } | 461 | } |
458 | Scope::GenericParams(gp) => { | 462 | Scope::GenericParams(gp) => { |
diff --git a/crates/ra_hir/src/source_binder.rs b/crates/ra_hir/src/source_binder.rs index 01f51ba5d..66cb4b357 100644 --- a/crates/ra_hir/src/source_binder.rs +++ b/crates/ra_hir/src/source_binder.rs | |||
@@ -12,7 +12,7 @@ use hir_expand::name::AsName; | |||
12 | use ra_db::FileId; | 12 | use ra_db::FileId; |
13 | use ra_syntax::{ | 13 | use ra_syntax::{ |
14 | ast::{self, AstNode}, | 14 | ast::{self, AstNode}, |
15 | AstPtr, | 15 | match_ast, AstPtr, |
16 | SyntaxKind::*, | 16 | SyntaxKind::*, |
17 | SyntaxNode, SyntaxNodePtr, TextRange, TextUnit, | 17 | SyntaxNode, SyntaxNodePtr, TextRange, TextUnit, |
18 | }; | 18 | }; |
@@ -27,9 +27,9 @@ use crate::{ | |||
27 | }, | 27 | }, |
28 | ids::LocationCtx, | 28 | ids::LocationCtx, |
29 | resolve::{ScopeDef, TypeNs, ValueNs}, | 29 | resolve::{ScopeDef, TypeNs, ValueNs}, |
30 | ty::method_resolution::implements_trait, | 30 | ty::method_resolution::{self, implements_trait}, |
31 | Const, DefWithBody, Either, Enum, FromSource, Function, HasBody, HirFileId, MacroDef, Module, | 31 | AssocItem, Const, DefWithBody, Either, Enum, FromSource, Function, HasBody, HirFileId, |
32 | Name, Path, Resolver, Static, Struct, Ty, | 32 | MacroDef, Module, Name, Path, Resolver, Static, Struct, Ty, |
33 | }; | 33 | }; |
34 | 34 | ||
35 | fn try_get_resolver_for_node( | 35 | fn try_get_resolver_for_node( |
@@ -37,24 +37,34 @@ fn try_get_resolver_for_node( | |||
37 | file_id: FileId, | 37 | file_id: FileId, |
38 | node: &SyntaxNode, | 38 | node: &SyntaxNode, |
39 | ) -> Option<Resolver> { | 39 | ) -> Option<Resolver> { |
40 | if let Some(module) = ast::Module::cast(node.clone()) { | 40 | match_ast! { |
41 | let src = crate::Source { file_id: file_id.into(), ast: module }; | 41 | match node { |
42 | Some(crate::Module::from_declaration(db, src)?.resolver(db)) | 42 | ast::Module(it) => { |
43 | } else if let Some(file) = ast::SourceFile::cast(node.clone()) { | 43 | let src = crate::Source { file_id: file_id.into(), ast: it }; |
44 | let src = | 44 | Some(crate::Module::from_declaration(db, src)?.resolver(db)) |
45 | crate::Source { file_id: file_id.into(), ast: crate::ModuleSource::SourceFile(file) }; | 45 | }, |
46 | Some(crate::Module::from_definition(db, src)?.resolver(db)) | 46 | ast::SourceFile(it) => { |
47 | } else if let Some(s) = ast::StructDef::cast(node.clone()) { | 47 | let src = |
48 | let src = crate::Source { file_id: file_id.into(), ast: s }; | 48 | crate::Source { file_id: file_id.into(), ast: crate::ModuleSource::SourceFile(it) }; |
49 | Some(Struct::from_source(db, src)?.resolver(db)) | 49 | Some(crate::Module::from_definition(db, src)?.resolver(db)) |
50 | } else if let Some(e) = ast::EnumDef::cast(node.clone()) { | 50 | }, |
51 | let src = crate::Source { file_id: file_id.into(), ast: e }; | 51 | ast::StructDef(it) => { |
52 | Some(Enum::from_source(db, src)?.resolver(db)) | 52 | let src = crate::Source { file_id: file_id.into(), ast: it }; |
53 | } else if node.kind() == FN_DEF || node.kind() == CONST_DEF || node.kind() == STATIC_DEF { | 53 | Some(Struct::from_source(db, src)?.resolver(db)) |
54 | Some(def_with_body_from_child_node(db, file_id, node)?.resolver(db)) | 54 | }, |
55 | } else { | 55 | ast::EnumDef(it) => { |
56 | // FIXME add missing cases | 56 | let src = crate::Source { file_id: file_id.into(), ast: it }; |
57 | None | 57 | Some(Enum::from_source(db, src)?.resolver(db)) |
58 | }, | ||
59 | _ => { | ||
60 | if node.kind() == FN_DEF || node.kind() == CONST_DEF || node.kind() == STATIC_DEF { | ||
61 | Some(def_with_body_from_child_node(db, file_id, node)?.resolver(db)) | ||
62 | } else { | ||
63 | // FIXME add missing cases | ||
64 | None | ||
65 | } | ||
66 | }, | ||
67 | } | ||
58 | } | 68 | } |
59 | } | 69 | } |
60 | 70 | ||
@@ -68,16 +78,14 @@ fn def_with_body_from_child_node( | |||
68 | let ctx = LocationCtx::new(db, module.id, file_id.into()); | 78 | let ctx = LocationCtx::new(db, module.id, file_id.into()); |
69 | 79 | ||
70 | node.ancestors().find_map(|node| { | 80 | node.ancestors().find_map(|node| { |
71 | if let Some(def) = ast::FnDef::cast(node.clone()) { | 81 | match_ast! { |
72 | return Some(Function { id: ctx.to_def(&def) }.into()); | 82 | match node { |
73 | } | 83 | ast::FnDef(def) => { Some(Function {id: ctx.to_def(&def) }.into()) }, |
74 | if let Some(def) = ast::ConstDef::cast(node.clone()) { | 84 | ast::ConstDef(def) => { Some(Const { id: ctx.to_def(&def) }.into()) }, |
75 | return Some(Const { id: ctx.to_def(&def) }.into()); | 85 | ast::StaticDef(def) => { Some(Static { id: ctx.to_def(&def) }.into()) }, |
76 | } | 86 | _ => { None }, |
77 | if let Some(def) = ast::StaticDef::cast(node) { | 87 | } |
78 | return Some(Static { id: ctx.to_def(&def) }.into()); | ||
79 | } | 88 | } |
80 | None | ||
81 | }) | 89 | }) |
82 | } | 90 | } |
83 | 91 | ||
@@ -245,9 +253,14 @@ impl SourceAnalyzer { | |||
245 | Some(res) | 253 | Some(res) |
246 | }); | 254 | }); |
247 | 255 | ||
248 | let items = | 256 | let items = self |
249 | self.resolver.resolve_module_path(db, &path).take_types().map(PathResolution::Def); | 257 | .resolver |
250 | types.or(values).or(items) | 258 | .resolve_module_path(db, &path) |
259 | .take_types() | ||
260 | .map(|it| PathResolution::Def(it.into())); | ||
261 | types.or(values).or(items).or_else(|| { | ||
262 | self.resolver.resolve_path_as_macro(db, &path).map(|def| PathResolution::Macro(def)) | ||
263 | }) | ||
251 | } | 264 | } |
252 | 265 | ||
253 | pub fn resolve_path(&self, db: &impl HirDatabase, path: &ast::Path) -> Option<PathResolution> { | 266 | pub fn resolve_path(&self, db: &impl HirDatabase, path: &ast::Path) -> Option<PathResolution> { |
@@ -317,16 +330,42 @@ impl SourceAnalyzer { | |||
317 | db: &impl HirDatabase, | 330 | db: &impl HirDatabase, |
318 | ty: Ty, | 331 | ty: Ty, |
319 | name: Option<&Name>, | 332 | name: Option<&Name>, |
320 | callback: impl FnMut(&Ty, Function) -> Option<T>, | 333 | mut callback: impl FnMut(&Ty, Function) -> Option<T>, |
334 | ) -> Option<T> { | ||
335 | // There should be no inference vars in types passed here | ||
336 | // FIXME check that? | ||
337 | // FIXME replace Unknown by bound vars here | ||
338 | let canonical = crate::ty::Canonical { value: ty, num_vars: 0 }; | ||
339 | method_resolution::iterate_method_candidates( | ||
340 | &canonical, | ||
341 | db, | ||
342 | &self.resolver, | ||
343 | name, | ||
344 | method_resolution::LookupMode::MethodCall, | ||
345 | |ty, it| match it { | ||
346 | AssocItem::Function(f) => callback(ty, f), | ||
347 | _ => None, | ||
348 | }, | ||
349 | ) | ||
350 | } | ||
351 | |||
352 | pub fn iterate_path_candidates<T>( | ||
353 | &self, | ||
354 | db: &impl HirDatabase, | ||
355 | ty: Ty, | ||
356 | name: Option<&Name>, | ||
357 | callback: impl FnMut(&Ty, AssocItem) -> Option<T>, | ||
321 | ) -> Option<T> { | 358 | ) -> Option<T> { |
322 | // There should be no inference vars in types passed here | 359 | // There should be no inference vars in types passed here |
323 | // FIXME check that? | 360 | // FIXME check that? |
361 | // FIXME replace Unknown by bound vars here | ||
324 | let canonical = crate::ty::Canonical { value: ty, num_vars: 0 }; | 362 | let canonical = crate::ty::Canonical { value: ty, num_vars: 0 }; |
325 | crate::ty::method_resolution::iterate_method_candidates( | 363 | method_resolution::iterate_method_candidates( |
326 | &canonical, | 364 | &canonical, |
327 | db, | 365 | db, |
328 | &self.resolver, | 366 | &self.resolver, |
329 | name, | 367 | name, |
368 | method_resolution::LookupMode::Path, | ||
330 | callback, | 369 | callback, |
331 | ) | 370 | ) |
332 | } | 371 | } |
diff --git a/crates/ra_hir/src/ty.rs b/crates/ra_hir/src/ty.rs index d2bfcdc7d..d1a9d7411 100644 --- a/crates/ra_hir/src/ty.rs +++ b/crates/ra_hir/src/ty.rs | |||
@@ -385,13 +385,22 @@ impl SubstsBuilder { | |||
385 | self.param_count - self.vec.len() | 385 | self.param_count - self.vec.len() |
386 | } | 386 | } |
387 | 387 | ||
388 | pub fn fill_with_bound_vars(mut self, starting_from: u32) -> Self { | 388 | pub fn fill_with_bound_vars(self, starting_from: u32) -> Self { |
389 | self.vec.extend((starting_from..starting_from + self.remaining() as u32).map(Ty::Bound)); | 389 | self.fill((starting_from..).map(Ty::Bound)) |
390 | self | 390 | } |
391 | |||
392 | pub fn fill_with_params(self) -> Self { | ||
393 | let start = self.vec.len() as u32; | ||
394 | self.fill((start..).map(|idx| Ty::Param { idx, name: Name::missing() })) | ||
395 | } | ||
396 | |||
397 | pub fn fill_with_unknown(self) -> Self { | ||
398 | self.fill(iter::repeat(Ty::Unknown)) | ||
391 | } | 399 | } |
392 | 400 | ||
393 | pub fn fill_with_unknown(mut self) -> Self { | 401 | pub fn fill(mut self, filler: impl Iterator<Item = Ty>) -> Self { |
394 | self.vec.extend(iter::repeat(Ty::Unknown).take(self.remaining())); | 402 | self.vec.extend(filler.take(self.remaining())); |
403 | assert_eq!(self.remaining(), 0); | ||
395 | self | 404 | self |
396 | } | 405 | } |
397 | 406 | ||
diff --git a/crates/ra_hir/src/ty/infer.rs b/crates/ra_hir/src/ty/infer.rs index 6694467a3..2370e8d4f 100644 --- a/crates/ra_hir/src/ty/infer.rs +++ b/crates/ra_hir/src/ty/infer.rs | |||
@@ -25,7 +25,7 @@ use hir_def::{ | |||
25 | path::known, | 25 | path::known, |
26 | type_ref::{Mutability, TypeRef}, | 26 | type_ref::{Mutability, TypeRef}, |
27 | }; | 27 | }; |
28 | use hir_expand::name; | 28 | use hir_expand::{diagnostics::DiagnosticSink, name}; |
29 | use ra_arena::map::ArenaMap; | 29 | use ra_arena::map::ArenaMap; |
30 | use ra_prof::profile; | 30 | use ra_prof::profile; |
31 | use test_utils::tested_by; | 31 | use test_utils::tested_by; |
@@ -40,7 +40,6 @@ use crate::{ | |||
40 | adt::VariantDef, | 40 | adt::VariantDef, |
41 | code_model::TypeAlias, | 41 | code_model::TypeAlias, |
42 | db::HirDatabase, | 42 | db::HirDatabase, |
43 | diagnostics::DiagnosticSink, | ||
44 | expr::{BindingAnnotation, Body, ExprId, PatId}, | 43 | expr::{BindingAnnotation, Body, ExprId, PatId}, |
45 | resolve::{Resolver, TypeNs}, | 44 | resolve::{Resolver, TypeNs}, |
46 | ty::infer::diagnostics::InferenceDiagnostic, | 45 | ty::infer::diagnostics::InferenceDiagnostic, |
@@ -719,12 +718,9 @@ impl Expectation { | |||
719 | } | 718 | } |
720 | 719 | ||
721 | mod diagnostics { | 720 | mod diagnostics { |
722 | use crate::{ | 721 | use hir_expand::diagnostics::DiagnosticSink; |
723 | db::HirDatabase, | 722 | |
724 | diagnostics::{DiagnosticSink, NoSuchField}, | 723 | use crate::{db::HirDatabase, diagnostics::NoSuchField, expr::ExprId, Function, HasSource}; |
725 | expr::ExprId, | ||
726 | Function, HasSource, | ||
727 | }; | ||
728 | 724 | ||
729 | #[derive(Debug, PartialEq, Eq, Clone)] | 725 | #[derive(Debug, PartialEq, Eq, Clone)] |
730 | pub(super) enum InferenceDiagnostic { | 726 | pub(super) enum InferenceDiagnostic { |
diff --git a/crates/ra_hir/src/ty/infer/expr.rs b/crates/ra_hir/src/ty/infer/expr.rs index fed52df39..a09ef5c5d 100644 --- a/crates/ra_hir/src/ty/infer/expr.rs +++ b/crates/ra_hir/src/ty/infer/expr.rs | |||
@@ -11,12 +11,11 @@ use crate::{ | |||
11 | db::HirDatabase, | 11 | db::HirDatabase, |
12 | expr::{self, Array, BinaryOp, Expr, ExprId, Literal, Statement, UnaryOp}, | 12 | expr::{self, Array, BinaryOp, Expr, ExprId, Literal, Statement, UnaryOp}, |
13 | generics::{GenericParams, HasGenericParams}, | 13 | generics::{GenericParams, HasGenericParams}, |
14 | nameres::Namespace, | ||
15 | ty::{ | 14 | ty::{ |
16 | autoderef, method_resolution, op, primitive, CallableDef, InferTy, Mutability, Obligation, | 15 | autoderef, method_resolution, op, primitive, CallableDef, InferTy, Mutability, Obligation, |
17 | ProjectionPredicate, ProjectionTy, Substs, TraitRef, Ty, TypeCtor, TypeWalk, | 16 | ProjectionPredicate, ProjectionTy, Substs, TraitRef, Ty, TypeCtor, TypeWalk, |
18 | }, | 17 | }, |
19 | Adt, Name, | 18 | Adt, Name, Namespace, |
20 | }; | 19 | }; |
21 | 20 | ||
22 | impl<'a, D: HirDatabase> InferenceContext<'a, D> { | 21 | impl<'a, D: HirDatabase> InferenceContext<'a, D> { |
diff --git a/crates/ra_hir/src/ty/infer/path.rs b/crates/ra_hir/src/ty/infer/path.rs index 77aa35ce1..59b7f7eb6 100644 --- a/crates/ra_hir/src/ty/infer/path.rs +++ b/crates/ra_hir/src/ty/infer/path.rs | |||
@@ -6,8 +6,8 @@ use super::{ExprOrPatId, InferenceContext, TraitRef}; | |||
6 | use crate::{ | 6 | use crate::{ |
7 | db::HirDatabase, | 7 | db::HirDatabase, |
8 | resolve::{ResolveValueResult, Resolver, TypeNs, ValueNs}, | 8 | resolve::{ResolveValueResult, Resolver, TypeNs, ValueNs}, |
9 | ty::{Substs, Ty, TypableDef, TypeWalk}, | 9 | ty::{method_resolution, Substs, Ty, TypableDef, TypeWalk}, |
10 | AssocItem, HasGenericParams, Namespace, Path, | 10 | AssocItem, Container, HasGenericParams, Name, Namespace, Path, |
11 | }; | 11 | }; |
12 | 12 | ||
13 | impl<'a, D: HirDatabase> InferenceContext<'a, D> { | 13 | impl<'a, D: HirDatabase> InferenceContext<'a, D> { |
@@ -39,7 +39,7 @@ impl<'a, D: HirDatabase> InferenceContext<'a, D> { | |||
39 | let ty = Ty::from_type_relative_path(self.db, resolver, ty, remaining_segments_for_ty); | 39 | let ty = Ty::from_type_relative_path(self.db, resolver, ty, remaining_segments_for_ty); |
40 | self.resolve_ty_assoc_item( | 40 | self.resolve_ty_assoc_item( |
41 | ty, | 41 | ty, |
42 | path.segments.last().expect("path had at least one segment"), | 42 | &path.segments.last().expect("path had at least one segment").name, |
43 | id, | 43 | id, |
44 | )? | 44 | )? |
45 | } else { | 45 | } else { |
@@ -122,10 +122,13 @@ impl<'a, D: HirDatabase> InferenceContext<'a, D> { | |||
122 | return None; | 122 | return None; |
123 | } | 123 | } |
124 | 124 | ||
125 | let ty = self.insert_type_vars(ty); | ||
126 | let ty = self.normalize_associated_types_in(ty); | ||
127 | |||
125 | let segment = | 128 | let segment = |
126 | remaining_segments.last().expect("there should be at least one segment here"); | 129 | remaining_segments.last().expect("there should be at least one segment here"); |
127 | 130 | ||
128 | self.resolve_ty_assoc_item(ty, segment, id) | 131 | self.resolve_ty_assoc_item(ty, &segment.name, id) |
129 | } | 132 | } |
130 | } | 133 | } |
131 | } | 134 | } |
@@ -162,7 +165,7 @@ impl<'a, D: HirDatabase> InferenceContext<'a, D> { | |||
162 | }; | 165 | }; |
163 | let substs = Substs::build_for_def(self.db, item) | 166 | let substs = Substs::build_for_def(self.db, item) |
164 | .use_parent_substs(&trait_ref.substs) | 167 | .use_parent_substs(&trait_ref.substs) |
165 | .fill_with_unknown() | 168 | .fill_with_params() |
166 | .build(); | 169 | .build(); |
167 | 170 | ||
168 | self.write_assoc_resolution(id, item); | 171 | self.write_assoc_resolution(id, item); |
@@ -172,44 +175,51 @@ impl<'a, D: HirDatabase> InferenceContext<'a, D> { | |||
172 | fn resolve_ty_assoc_item( | 175 | fn resolve_ty_assoc_item( |
173 | &mut self, | 176 | &mut self, |
174 | ty: Ty, | 177 | ty: Ty, |
175 | segment: &PathSegment, | 178 | name: &Name, |
176 | id: ExprOrPatId, | 179 | id: ExprOrPatId, |
177 | ) -> Option<(ValueNs, Option<Substs>)> { | 180 | ) -> Option<(ValueNs, Option<Substs>)> { |
178 | if let Ty::Unknown = ty { | 181 | if let Ty::Unknown = ty { |
179 | return None; | 182 | return None; |
180 | } | 183 | } |
181 | 184 | ||
182 | let krate = self.resolver.krate()?; | 185 | let canonical_ty = self.canonicalizer().canonicalize_ty(ty.clone()); |
183 | 186 | ||
184 | // Find impl | 187 | method_resolution::iterate_method_candidates( |
185 | // FIXME: consider trait candidates | 188 | &canonical_ty.value, |
186 | let item = ty.clone().iterate_impl_items(self.db, krate, |item| match item { | 189 | self.db, |
187 | AssocItem::Function(func) => { | 190 | &self.resolver.clone(), |
188 | if segment.name == func.name(self.db) { | 191 | Some(name), |
189 | Some(AssocItem::Function(func)) | 192 | method_resolution::LookupMode::Path, |
190 | } else { | 193 | move |_ty, item| { |
191 | None | 194 | let def = match item { |
192 | } | 195 | AssocItem::Function(f) => ValueNs::Function(f), |
193 | } | 196 | AssocItem::Const(c) => ValueNs::Const(c), |
194 | 197 | AssocItem::TypeAlias(_) => unreachable!(), | |
195 | AssocItem::Const(konst) => { | 198 | }; |
196 | if konst.name(self.db).map_or(false, |n| n == segment.name) { | 199 | let substs = match item.container(self.db) { |
197 | Some(AssocItem::Const(konst)) | 200 | Container::ImplBlock(_) => self.find_self_types(&def, ty.clone()), |
198 | } else { | 201 | Container::Trait(t) => { |
199 | None | 202 | // we're picking this method |
200 | } | 203 | let trait_substs = Substs::build_for_def(self.db, t) |
201 | } | 204 | .push(ty.clone()) |
202 | AssocItem::TypeAlias(_) => None, | 205 | .fill(std::iter::repeat_with(|| self.new_type_var())) |
203 | })?; | 206 | .build(); |
204 | let def = match item { | 207 | let substs = Substs::build_for_def(self.db, item) |
205 | AssocItem::Function(f) => ValueNs::Function(f), | 208 | .use_parent_substs(&trait_substs) |
206 | AssocItem::Const(c) => ValueNs::Const(c), | 209 | .fill_with_params() |
207 | AssocItem::TypeAlias(_) => unreachable!(), | 210 | .build(); |
208 | }; | 211 | self.obligations.push(super::Obligation::Trait(TraitRef { |
209 | let substs = self.find_self_types(&def, ty); | 212 | trait_: t, |
213 | substs: trait_substs, | ||
214 | })); | ||
215 | Some(substs) | ||
216 | } | ||
217 | }; | ||
210 | 218 | ||
211 | self.write_assoc_resolution(id, item); | 219 | self.write_assoc_resolution(id, item); |
212 | Some((def, substs)) | 220 | Some((def, substs)) |
221 | }, | ||
222 | ) | ||
213 | } | 223 | } |
214 | 224 | ||
215 | fn find_self_types(&self, def: &ValueNs, actual_def_ty: Ty) -> Option<Substs> { | 225 | fn find_self_types(&self, def: &ValueNs, actual_def_ty: Ty) -> Option<Substs> { |
diff --git a/crates/ra_hir/src/ty/lower.rs b/crates/ra_hir/src/ty/lower.rs index 0f49a0e54..e29ab8492 100644 --- a/crates/ra_hir/src/ty/lower.rs +++ b/crates/ra_hir/src/ty/lower.rs | |||
@@ -9,6 +9,7 @@ use std::iter; | |||
9 | use std::sync::Arc; | 9 | use std::sync::Arc; |
10 | 10 | ||
11 | use hir_def::{ | 11 | use hir_def::{ |
12 | builtin_type::BuiltinType, | ||
12 | path::{GenericArg, PathSegment}, | 13 | path::{GenericArg, PathSegment}, |
13 | type_ref::{TypeBound, TypeRef}, | 14 | type_ref::{TypeBound, TypeRef}, |
14 | }; | 15 | }; |
@@ -22,11 +23,13 @@ use crate::{ | |||
22 | db::HirDatabase, | 23 | db::HirDatabase, |
23 | generics::HasGenericParams, | 24 | generics::HasGenericParams, |
24 | generics::{GenericDef, WherePredicate}, | 25 | generics::{GenericDef, WherePredicate}, |
25 | nameres::Namespace, | ||
26 | resolve::{Resolver, TypeNs}, | 26 | resolve::{Resolver, TypeNs}, |
27 | ty::Adt, | 27 | ty::{ |
28 | primitive::{FloatTy, IntTy}, | ||
29 | Adt, | ||
30 | }, | ||
28 | util::make_mut_slice, | 31 | util::make_mut_slice, |
29 | BuiltinType, Const, Enum, EnumVariant, Function, ModuleDef, Path, Static, Struct, StructField, | 32 | Const, Enum, EnumVariant, Function, ModuleDef, Namespace, Path, Static, Struct, StructField, |
30 | Trait, TypeAlias, Union, | 33 | Trait, TypeAlias, Union, |
31 | }; | 34 | }; |
32 | 35 | ||
@@ -643,14 +646,16 @@ fn type_for_builtin(def: BuiltinType) -> Ty { | |||
643 | BuiltinType::Char => TypeCtor::Char, | 646 | BuiltinType::Char => TypeCtor::Char, |
644 | BuiltinType::Bool => TypeCtor::Bool, | 647 | BuiltinType::Bool => TypeCtor::Bool, |
645 | BuiltinType::Str => TypeCtor::Str, | 648 | BuiltinType::Str => TypeCtor::Str, |
646 | BuiltinType::Int(ty) => TypeCtor::Int(ty.into()), | 649 | BuiltinType::Int { signedness, bitness } => { |
647 | BuiltinType::Float(ty) => TypeCtor::Float(ty.into()), | 650 | TypeCtor::Int(IntTy { signedness, bitness }.into()) |
651 | } | ||
652 | BuiltinType::Float { bitness } => TypeCtor::Float(FloatTy { bitness }.into()), | ||
648 | }) | 653 | }) |
649 | } | 654 | } |
650 | 655 | ||
651 | fn fn_sig_for_struct_constructor(db: &impl HirDatabase, def: Struct) -> FnSig { | 656 | fn fn_sig_for_struct_constructor(db: &impl HirDatabase, def: Struct) -> FnSig { |
652 | let var_data = def.variant_data(db); | 657 | let struct_data = db.struct_data(def.id); |
653 | let fields = match var_data.fields() { | 658 | let fields = match struct_data.variant_data.fields() { |
654 | Some(fields) => fields, | 659 | Some(fields) => fields, |
655 | None => panic!("fn_sig_for_struct_constructor called on unit struct"), | 660 | None => panic!("fn_sig_for_struct_constructor called on unit struct"), |
656 | }; | 661 | }; |
@@ -665,8 +670,8 @@ fn fn_sig_for_struct_constructor(db: &impl HirDatabase, def: Struct) -> FnSig { | |||
665 | 670 | ||
666 | /// Build the type of a tuple struct constructor. | 671 | /// Build the type of a tuple struct constructor. |
667 | fn type_for_struct_constructor(db: &impl HirDatabase, def: Struct) -> Ty { | 672 | fn type_for_struct_constructor(db: &impl HirDatabase, def: Struct) -> Ty { |
668 | let var_data = def.variant_data(db); | 673 | let struct_data = db.struct_data(def.id); |
669 | if var_data.fields().is_none() { | 674 | if struct_data.variant_data.fields().is_none() { |
670 | return type_for_adt(db, def); // Unit struct | 675 | return type_for_adt(db, def); // Unit struct |
671 | } | 676 | } |
672 | let generics = def.generic_params(db); | 677 | let generics = def.generic_params(db); |
diff --git a/crates/ra_hir/src/ty/method_resolution.rs b/crates/ra_hir/src/ty/method_resolution.rs index eb69344f6..8c3d32d09 100644 --- a/crates/ra_hir/src/ty/method_resolution.rs +++ b/crates/ra_hir/src/ty/method_resolution.rs | |||
@@ -166,37 +166,78 @@ pub(crate) fn lookup_method( | |||
166 | name: &Name, | 166 | name: &Name, |
167 | resolver: &Resolver, | 167 | resolver: &Resolver, |
168 | ) -> Option<(Ty, Function)> { | 168 | ) -> Option<(Ty, Function)> { |
169 | iterate_method_candidates(ty, db, resolver, Some(name), |ty, f| Some((ty.clone(), f))) | 169 | iterate_method_candidates(ty, db, resolver, Some(name), LookupMode::MethodCall, |ty, f| match f |
170 | { | ||
171 | AssocItem::Function(f) => Some((ty.clone(), f)), | ||
172 | _ => None, | ||
173 | }) | ||
174 | } | ||
175 | |||
176 | /// Whether we're looking up a dotted method call (like `v.len()`) or a path | ||
177 | /// (like `Vec::new`). | ||
178 | #[derive(Copy, Clone, Debug, PartialEq, Eq)] | ||
179 | pub enum LookupMode { | ||
180 | /// Looking up a method call like `v.len()`: We only consider candidates | ||
181 | /// that have a `self` parameter, and do autoderef. | ||
182 | MethodCall, | ||
183 | /// Looking up a path like `Vec::new` or `Vec::default`: We consider all | ||
184 | /// candidates including associated constants, but don't do autoderef. | ||
185 | Path, | ||
170 | } | 186 | } |
171 | 187 | ||
172 | // This would be nicer if it just returned an iterator, but that runs into | 188 | // This would be nicer if it just returned an iterator, but that runs into |
173 | // lifetime problems, because we need to borrow temp `CrateImplBlocks`. | 189 | // lifetime problems, because we need to borrow temp `CrateImplBlocks`. |
190 | // FIXME add a context type here? | ||
174 | pub(crate) fn iterate_method_candidates<T>( | 191 | pub(crate) fn iterate_method_candidates<T>( |
175 | ty: &Canonical<Ty>, | 192 | ty: &Canonical<Ty>, |
176 | db: &impl HirDatabase, | 193 | db: &impl HirDatabase, |
177 | resolver: &Resolver, | 194 | resolver: &Resolver, |
178 | name: Option<&Name>, | 195 | name: Option<&Name>, |
179 | mut callback: impl FnMut(&Ty, Function) -> Option<T>, | 196 | mode: LookupMode, |
197 | mut callback: impl FnMut(&Ty, AssocItem) -> Option<T>, | ||
180 | ) -> Option<T> { | 198 | ) -> Option<T> { |
181 | // For method calls, rust first does any number of autoderef, and then one | 199 | let krate = resolver.krate()?; |
182 | // autoref (i.e. when the method takes &self or &mut self). We just ignore | 200 | match mode { |
183 | // the autoref currently -- when we find a method matching the given name, | 201 | LookupMode::MethodCall => { |
184 | // we assume it fits. | 202 | // For method calls, rust first does any number of autoderef, and then one |
203 | // autoref (i.e. when the method takes &self or &mut self). We just ignore | ||
204 | // the autoref currently -- when we find a method matching the given name, | ||
205 | // we assume it fits. | ||
185 | 206 | ||
186 | // Also note that when we've got a receiver like &S, even if the method we | 207 | // Also note that when we've got a receiver like &S, even if the method we |
187 | // find in the end takes &self, we still do the autoderef step (just as | 208 | // find in the end takes &self, we still do the autoderef step (just as |
188 | // rustc does an autoderef and then autoref again). | 209 | // rustc does an autoderef and then autoref again). |
189 | 210 | ||
190 | let krate = resolver.krate()?; | 211 | for derefed_ty in autoderef::autoderef(db, resolver, ty.clone()) { |
191 | for derefed_ty in autoderef::autoderef(db, resolver, ty.clone()) { | 212 | if let Some(result) = |
192 | if let Some(result) = iterate_inherent_methods(&derefed_ty, db, name, krate, &mut callback) | 213 | iterate_inherent_methods(&derefed_ty, db, name, mode, krate, &mut callback) |
193 | { | 214 | { |
194 | return Some(result); | 215 | return Some(result); |
216 | } | ||
217 | if let Some(result) = iterate_trait_method_candidates( | ||
218 | &derefed_ty, | ||
219 | db, | ||
220 | resolver, | ||
221 | name, | ||
222 | mode, | ||
223 | &mut callback, | ||
224 | ) { | ||
225 | return Some(result); | ||
226 | } | ||
227 | } | ||
195 | } | 228 | } |
196 | if let Some(result) = | 229 | LookupMode::Path => { |
197 | iterate_trait_method_candidates(&derefed_ty, db, resolver, name, &mut callback) | 230 | // No autoderef for path lookups |
198 | { | 231 | if let Some(result) = |
199 | return Some(result); | 232 | iterate_inherent_methods(&ty, db, name, mode, krate, &mut callback) |
233 | { | ||
234 | return Some(result); | ||
235 | } | ||
236 | if let Some(result) = | ||
237 | iterate_trait_method_candidates(&ty, db, resolver, name, mode, &mut callback) | ||
238 | { | ||
239 | return Some(result); | ||
240 | } | ||
200 | } | 241 | } |
201 | } | 242 | } |
202 | None | 243 | None |
@@ -207,7 +248,8 @@ fn iterate_trait_method_candidates<T>( | |||
207 | db: &impl HirDatabase, | 248 | db: &impl HirDatabase, |
208 | resolver: &Resolver, | 249 | resolver: &Resolver, |
209 | name: Option<&Name>, | 250 | name: Option<&Name>, |
210 | mut callback: impl FnMut(&Ty, Function) -> Option<T>, | 251 | mode: LookupMode, |
252 | mut callback: impl FnMut(&Ty, AssocItem) -> Option<T>, | ||
211 | ) -> Option<T> { | 253 | ) -> Option<T> { |
212 | let krate = resolver.krate()?; | 254 | let krate = resolver.krate()?; |
213 | // FIXME: maybe put the trait_env behind a query (need to figure out good input parameters for that) | 255 | // FIXME: maybe put the trait_env behind a query (need to figure out good input parameters for that) |
@@ -231,22 +273,20 @@ fn iterate_trait_method_candidates<T>( | |||
231 | // trait, but if we find out it doesn't, we'll skip the rest of the | 273 | // trait, but if we find out it doesn't, we'll skip the rest of the |
232 | // iteration | 274 | // iteration |
233 | let mut known_implemented = inherently_implemented; | 275 | let mut known_implemented = inherently_implemented; |
234 | for item in data.items() { | 276 | for &item in data.items() { |
235 | if let AssocItem::Function(m) = *item { | 277 | if !is_valid_candidate(db, name, mode, item) { |
236 | let data = m.data(db); | 278 | continue; |
237 | if name.map_or(true, |name| data.name() == name) && data.has_self_param() { | 279 | } |
238 | if !known_implemented { | 280 | if !known_implemented { |
239 | let goal = generic_implements_goal(db, env.clone(), t, ty.clone()); | 281 | let goal = generic_implements_goal(db, env.clone(), t, ty.clone()); |
240 | if db.trait_solve(krate, goal).is_none() { | 282 | if db.trait_solve(krate, goal).is_none() { |
241 | continue 'traits; | 283 | continue 'traits; |
242 | } | ||
243 | } | ||
244 | known_implemented = true; | ||
245 | if let Some(result) = callback(&ty.value, m) { | ||
246 | return Some(result); | ||
247 | } | ||
248 | } | 284 | } |
249 | } | 285 | } |
286 | known_implemented = true; | ||
287 | if let Some(result) = callback(&ty.value, item) { | ||
288 | return Some(result); | ||
289 | } | ||
250 | } | 290 | } |
251 | } | 291 | } |
252 | None | 292 | None |
@@ -256,21 +296,20 @@ fn iterate_inherent_methods<T>( | |||
256 | ty: &Canonical<Ty>, | 296 | ty: &Canonical<Ty>, |
257 | db: &impl HirDatabase, | 297 | db: &impl HirDatabase, |
258 | name: Option<&Name>, | 298 | name: Option<&Name>, |
299 | mode: LookupMode, | ||
259 | krate: Crate, | 300 | krate: Crate, |
260 | mut callback: impl FnMut(&Ty, Function) -> Option<T>, | 301 | mut callback: impl FnMut(&Ty, AssocItem) -> Option<T>, |
261 | ) -> Option<T> { | 302 | ) -> Option<T> { |
262 | for krate in def_crates(db, krate, &ty.value)? { | 303 | for krate in def_crates(db, krate, &ty.value)? { |
263 | let impls = db.impls_in_crate(krate); | 304 | let impls = db.impls_in_crate(krate); |
264 | 305 | ||
265 | for impl_block in impls.lookup_impl_blocks(&ty.value) { | 306 | for impl_block in impls.lookup_impl_blocks(&ty.value) { |
266 | for item in impl_block.items(db) { | 307 | for item in impl_block.items(db) { |
267 | if let AssocItem::Function(f) = item { | 308 | if !is_valid_candidate(db, name, mode, item) { |
268 | let data = f.data(db); | 309 | continue; |
269 | if name.map_or(true, |name| data.name() == name) && data.has_self_param() { | 310 | } |
270 | if let Some(result) = callback(&ty.value, f) { | 311 | if let Some(result) = callback(&ty.value, item) { |
271 | return Some(result); | 312 | return Some(result); |
272 | } | ||
273 | } | ||
274 | } | 313 | } |
275 | } | 314 | } |
276 | } | 315 | } |
@@ -278,6 +317,26 @@ fn iterate_inherent_methods<T>( | |||
278 | None | 317 | None |
279 | } | 318 | } |
280 | 319 | ||
320 | fn is_valid_candidate( | ||
321 | db: &impl HirDatabase, | ||
322 | name: Option<&Name>, | ||
323 | mode: LookupMode, | ||
324 | item: AssocItem, | ||
325 | ) -> bool { | ||
326 | match item { | ||
327 | AssocItem::Function(m) => { | ||
328 | let data = m.data(db); | ||
329 | name.map_or(true, |name| data.name() == name) | ||
330 | && (data.has_self_param() || mode == LookupMode::Path) | ||
331 | } | ||
332 | AssocItem::Const(c) => { | ||
333 | name.map_or(true, |name| Some(name) == c.name(db).as_ref()) | ||
334 | && (mode == LookupMode::Path) | ||
335 | } | ||
336 | _ => false, | ||
337 | } | ||
338 | } | ||
339 | |||
281 | pub(crate) fn implements_trait( | 340 | pub(crate) fn implements_trait( |
282 | ty: &Canonical<Ty>, | 341 | ty: &Canonical<Ty>, |
283 | db: &impl HirDatabase, | 342 | db: &impl HirDatabase, |
diff --git a/crates/ra_hir/src/ty/primitive.rs b/crates/ra_hir/src/ty/primitive.rs index 8966f9d1d..1749752f1 100644 --- a/crates/ra_hir/src/ty/primitive.rs +++ b/crates/ra_hir/src/ty/primitive.rs | |||
@@ -2,27 +2,7 @@ | |||
2 | 2 | ||
3 | use std::fmt; | 3 | use std::fmt; |
4 | 4 | ||
5 | #[derive(Debug, Copy, Clone, Eq, PartialEq, Hash)] | 5 | pub use hir_def::builtin_type::{FloatBitness, IntBitness, Signedness}; |
6 | pub enum Signedness { | ||
7 | Signed, | ||
8 | Unsigned, | ||
9 | } | ||
10 | |||
11 | #[derive(Debug, Copy, Clone, Eq, PartialEq, Hash)] | ||
12 | pub enum IntBitness { | ||
13 | Xsize, | ||
14 | X8, | ||
15 | X16, | ||
16 | X32, | ||
17 | X64, | ||
18 | X128, | ||
19 | } | ||
20 | |||
21 | #[derive(Debug, Copy, Clone, Eq, PartialEq, Hash)] | ||
22 | pub enum FloatBitness { | ||
23 | X32, | ||
24 | X64, | ||
25 | } | ||
26 | 6 | ||
27 | #[derive(Debug, Copy, Clone, Eq, PartialEq, Hash)] | 7 | #[derive(Debug, Copy, Clone, Eq, PartialEq, Hash)] |
28 | pub enum UncertainIntTy { | 8 | pub enum UncertainIntTy { |
diff --git a/crates/ra_hir/src/ty/tests.rs b/crates/ra_hir/src/ty/tests.rs index c12326643..f27155737 100644 --- a/crates/ra_hir/src/ty/tests.rs +++ b/crates/ra_hir/src/ty/tests.rs | |||
@@ -1841,8 +1841,8 @@ fn test() { | |||
1841 | [243; 254) 'Struct::FOO': u32 | 1841 | [243; 254) 'Struct::FOO': u32 |
1842 | [264; 265) 'y': u32 | 1842 | [264; 265) 'y': u32 |
1843 | [268; 277) 'Enum::BAR': u32 | 1843 | [268; 277) 'Enum::BAR': u32 |
1844 | [287; 288) 'z': {unknown} | 1844 | [287; 288) 'z': u32 |
1845 | [291; 304) 'TraitTest::ID': {unknown} | 1845 | [291; 304) 'TraitTest::ID': u32 |
1846 | "### | 1846 | "### |
1847 | ); | 1847 | ); |
1848 | } | 1848 | } |
@@ -2782,9 +2782,9 @@ fn test() { | |||
2782 | [97; 99) 's1': S | 2782 | [97; 99) 's1': S |
2783 | [105; 121) 'Defaul...efault': fn default<S>() -> Self | 2783 | [105; 121) 'Defaul...efault': fn default<S>() -> Self |
2784 | [105; 123) 'Defaul...ault()': S | 2784 | [105; 123) 'Defaul...ault()': S |
2785 | [133; 135) 's2': {unknown} | 2785 | [133; 135) 's2': S |
2786 | [138; 148) 'S::default': {unknown} | 2786 | [138; 148) 'S::default': fn default<S>() -> Self |
2787 | [138; 150) 'S::default()': {unknown} | 2787 | [138; 150) 'S::default()': S |
2788 | [160; 162) 's3': S | 2788 | [160; 162) 's3': S |
2789 | [165; 188) '<S as ...efault': fn default<S>() -> Self | 2789 | [165; 188) '<S as ...efault': fn default<S>() -> Self |
2790 | [165; 190) '<S as ...ault()': S | 2790 | [165; 190) '<S as ...ault()': S |
@@ -2793,6 +2793,153 @@ fn test() { | |||
2793 | } | 2793 | } |
2794 | 2794 | ||
2795 | #[test] | 2795 | #[test] |
2796 | fn infer_trait_assoc_method_generics_1() { | ||
2797 | assert_snapshot!( | ||
2798 | infer(r#" | ||
2799 | trait Trait<T> { | ||
2800 | fn make() -> T; | ||
2801 | } | ||
2802 | struct S; | ||
2803 | impl Trait<u32> for S {} | ||
2804 | struct G<T>; | ||
2805 | impl<T> Trait<T> for G<T> {} | ||
2806 | fn test() { | ||
2807 | let a = S::make(); | ||
2808 | let b = G::<u64>::make(); | ||
2809 | let c: f64 = G::make(); | ||
2810 | } | ||
2811 | "#), | ||
2812 | @r###" | ||
2813 | [127; 211) '{ ...e(); }': () | ||
2814 | [137; 138) 'a': u32 | ||
2815 | [141; 148) 'S::make': fn make<S, u32>() -> T | ||
2816 | [141; 150) 'S::make()': u32 | ||
2817 | [160; 161) 'b': u64 | ||
2818 | [164; 178) 'G::<u64>::make': fn make<G<u64>, u64>() -> T | ||
2819 | [164; 180) 'G::<u6...make()': u64 | ||
2820 | [190; 191) 'c': f64 | ||
2821 | [199; 206) 'G::make': fn make<G<f64>, f64>() -> T | ||
2822 | [199; 208) 'G::make()': f64 | ||
2823 | "### | ||
2824 | ); | ||
2825 | } | ||
2826 | |||
2827 | #[test] | ||
2828 | fn infer_trait_assoc_method_generics_2() { | ||
2829 | assert_snapshot!( | ||
2830 | infer(r#" | ||
2831 | trait Trait<T> { | ||
2832 | fn make<U>() -> (T, U); | ||
2833 | } | ||
2834 | struct S; | ||
2835 | impl Trait<u32> for S {} | ||
2836 | struct G<T>; | ||
2837 | impl<T> Trait<T> for G<T> {} | ||
2838 | fn test() { | ||
2839 | let a = S::make::<i64>(); | ||
2840 | let b: (_, i64) = S::make(); | ||
2841 | let c = G::<u32>::make::<i64>(); | ||
2842 | let d: (u32, _) = G::make::<i64>(); | ||
2843 | let e: (u32, i64) = G::make(); | ||
2844 | } | ||
2845 | "#), | ||
2846 | @r###" | ||
2847 | [135; 313) '{ ...e(); }': () | ||
2848 | [145; 146) 'a': (u32, i64) | ||
2849 | [149; 163) 'S::make::<i64>': fn make<S, u32, i64>() -> (T, U) | ||
2850 | [149; 165) 'S::mak...i64>()': (u32, i64) | ||
2851 | [175; 176) 'b': (u32, i64) | ||
2852 | [189; 196) 'S::make': fn make<S, u32, i64>() -> (T, U) | ||
2853 | [189; 198) 'S::make()': (u32, i64) | ||
2854 | [208; 209) 'c': (u32, i64) | ||
2855 | [212; 233) 'G::<u3...:<i64>': fn make<G<u32>, u32, i64>() -> (T, U) | ||
2856 | [212; 235) 'G::<u3...i64>()': (u32, i64) | ||
2857 | [245; 246) 'd': (u32, i64) | ||
2858 | [259; 273) 'G::make::<i64>': fn make<G<u32>, u32, i64>() -> (T, U) | ||
2859 | [259; 275) 'G::mak...i64>()': (u32, i64) | ||
2860 | [285; 286) 'e': (u32, i64) | ||
2861 | [301; 308) 'G::make': fn make<G<u32>, u32, i64>() -> (T, U) | ||
2862 | [301; 310) 'G::make()': (u32, i64) | ||
2863 | "### | ||
2864 | ); | ||
2865 | } | ||
2866 | |||
2867 | #[test] | ||
2868 | fn infer_trait_assoc_method_generics_3() { | ||
2869 | assert_snapshot!( | ||
2870 | infer(r#" | ||
2871 | trait Trait<T> { | ||
2872 | fn make() -> (Self, T); | ||
2873 | } | ||
2874 | struct S<T>; | ||
2875 | impl Trait<i64> for S<i32> {} | ||
2876 | fn test() { | ||
2877 | let a = S::make(); | ||
2878 | } | ||
2879 | "#), | ||
2880 | @r###" | ||
2881 | [101; 127) '{ ...e(); }': () | ||
2882 | [111; 112) 'a': (S<i32>, i64) | ||
2883 | [115; 122) 'S::make': fn make<S<i32>, i64>() -> (Self, T) | ||
2884 | [115; 124) 'S::make()': (S<i32>, i64) | ||
2885 | "### | ||
2886 | ); | ||
2887 | } | ||
2888 | |||
2889 | #[test] | ||
2890 | fn infer_trait_assoc_method_generics_4() { | ||
2891 | assert_snapshot!( | ||
2892 | infer(r#" | ||
2893 | trait Trait<T> { | ||
2894 | fn make() -> (Self, T); | ||
2895 | } | ||
2896 | struct S<T>; | ||
2897 | impl Trait<i64> for S<u64> {} | ||
2898 | impl Trait<i32> for S<u32> {} | ||
2899 | fn test() { | ||
2900 | let a: (S<u64>, _) = S::make(); | ||
2901 | let b: (_, i32) = S::make(); | ||
2902 | } | ||
2903 | "#), | ||
2904 | @r###" | ||
2905 | [131; 203) '{ ...e(); }': () | ||
2906 | [141; 142) 'a': (S<u64>, i64) | ||
2907 | [158; 165) 'S::make': fn make<S<u64>, i64>() -> (Self, T) | ||
2908 | [158; 167) 'S::make()': (S<u64>, i64) | ||
2909 | [177; 178) 'b': (S<u32>, i32) | ||
2910 | [191; 198) 'S::make': fn make<S<u32>, i32>() -> (Self, T) | ||
2911 | [191; 200) 'S::make()': (S<u32>, i32) | ||
2912 | "### | ||
2913 | ); | ||
2914 | } | ||
2915 | |||
2916 | #[test] | ||
2917 | fn infer_trait_assoc_method_generics_5() { | ||
2918 | assert_snapshot!( | ||
2919 | infer(r#" | ||
2920 | trait Trait<T> { | ||
2921 | fn make<U>() -> (Self, T, U); | ||
2922 | } | ||
2923 | struct S<T>; | ||
2924 | impl Trait<i64> for S<u64> {} | ||
2925 | fn test() { | ||
2926 | let a = <S as Trait<i64>>::make::<u8>(); | ||
2927 | let b: (S<u64>, _, _) = Trait::<i64>::make::<u8>(); | ||
2928 | } | ||
2929 | "#), | ||
2930 | @r###" | ||
2931 | [107; 211) '{ ...>(); }': () | ||
2932 | [117; 118) 'a': (S<u64>, i64, u8) | ||
2933 | [121; 150) '<S as ...::<u8>': fn make<S<u64>, i64, u8>() -> (Self, T, U) | ||
2934 | [121; 152) '<S as ...<u8>()': (S<u64>, i64, u8) | ||
2935 | [162; 163) 'b': (S<u64>, i64, u8) | ||
2936 | [182; 206) 'Trait:...::<u8>': fn make<S<u64>, i64, u8>() -> (Self, T, U) | ||
2937 | [182; 208) 'Trait:...<u8>()': (S<u64>, i64, u8) | ||
2938 | "### | ||
2939 | ); | ||
2940 | } | ||
2941 | |||
2942 | #[test] | ||
2796 | fn infer_from_bound_1() { | 2943 | fn infer_from_bound_1() { |
2797 | assert_snapshot!( | 2944 | assert_snapshot!( |
2798 | infer(r#" | 2945 | infer(r#" |
@@ -3256,7 +3403,7 @@ fn test() { S.foo()<|>; } | |||
3256 | 3403 | ||
3257 | #[test] | 3404 | #[test] |
3258 | fn infer_macro_with_dollar_crate_is_correct_in_expr() { | 3405 | fn infer_macro_with_dollar_crate_is_correct_in_expr() { |
3259 | covers!(macro_dollar_crate_other); | 3406 | // covers!(macro_dollar_crate_other); |
3260 | let (mut db, pos) = MockDatabase::with_position( | 3407 | let (mut db, pos) = MockDatabase::with_position( |
3261 | r#" | 3408 | r#" |
3262 | //- /main.rs | 3409 | //- /main.rs |
@@ -3303,6 +3450,22 @@ fn test() { S.foo()<|>; } | |||
3303 | assert_eq!(t, "u128"); | 3450 | assert_eq!(t, "u128"); |
3304 | } | 3451 | } |
3305 | 3452 | ||
3453 | #[ignore] | ||
3454 | #[test] | ||
3455 | fn method_resolution_by_value_before_autoref() { | ||
3456 | let t = type_at( | ||
3457 | r#" | ||
3458 | //- /main.rs | ||
3459 | trait Clone { fn clone(&self) -> Self; } | ||
3460 | struct S; | ||
3461 | impl Clone for S {} | ||
3462 | impl Clone for &S {} | ||
3463 | fn test() { (S.clone(), (&S).clone(), (&&S).clone())<|>; } | ||
3464 | "#, | ||
3465 | ); | ||
3466 | assert_eq!(t, "(S, S, &S)"); | ||
3467 | } | ||
3468 | |||
3306 | #[test] | 3469 | #[test] |
3307 | fn method_resolution_trait_before_autoderef() { | 3470 | fn method_resolution_trait_before_autoderef() { |
3308 | let t = type_at( | 3471 | let t = type_at( |
diff --git a/crates/ra_hir_def/Cargo.toml b/crates/ra_hir_def/Cargo.toml index 746c907e8..21262be79 100644 --- a/crates/ra_hir_def/Cargo.toml +++ b/crates/ra_hir_def/Cargo.toml | |||
@@ -7,7 +7,6 @@ authors = ["rust-analyzer developers"] | |||
7 | [dependencies] | 7 | [dependencies] |
8 | log = "0.4.5" | 8 | log = "0.4.5" |
9 | once_cell = "1.0.1" | 9 | once_cell = "1.0.1" |
10 | relative-path = "1.0.0" | ||
11 | rustc-hash = "1.0" | 10 | rustc-hash = "1.0" |
12 | 11 | ||
13 | ra_arena = { path = "../ra_arena" } | 12 | ra_arena = { path = "../ra_arena" } |
@@ -19,3 +18,6 @@ test_utils = { path = "../test_utils" } | |||
19 | mbe = { path = "../ra_mbe", package = "ra_mbe" } | 18 | mbe = { path = "../ra_mbe", package = "ra_mbe" } |
20 | ra_cfg = { path = "../ra_cfg" } | 19 | ra_cfg = { path = "../ra_cfg" } |
21 | tt = { path = "../ra_tt", package = "ra_tt" } | 20 | tt = { path = "../ra_tt", package = "ra_tt" } |
21 | |||
22 | [dev-dependencies] | ||
23 | insta = "0.12.0" | ||
diff --git a/crates/ra_hir_def/src/adt.rs b/crates/ra_hir_def/src/adt.rs new file mode 100644 index 000000000..8f41e55d2 --- /dev/null +++ b/crates/ra_hir_def/src/adt.rs | |||
@@ -0,0 +1,126 @@ | |||
1 | //! Defines hir-level representation of structs, enums and unions | ||
2 | |||
3 | use std::sync::Arc; | ||
4 | |||
5 | use hir_expand::name::{AsName, Name}; | ||
6 | use ra_arena::Arena; | ||
7 | use ra_syntax::ast::{self, NameOwner, TypeAscriptionOwner}; | ||
8 | |||
9 | use crate::{ | ||
10 | db::DefDatabase2, type_ref::TypeRef, AstItemDef, EnumId, LocalEnumVariantId, | ||
11 | LocalStructFieldId, StructId, UnionId, | ||
12 | }; | ||
13 | |||
14 | /// Note that we use `StructData` for unions as well! | ||
15 | #[derive(Debug, Clone, PartialEq, Eq)] | ||
16 | pub struct StructData { | ||
17 | pub name: Option<Name>, | ||
18 | pub variant_data: Arc<VariantData>, | ||
19 | } | ||
20 | |||
21 | #[derive(Debug, Clone, PartialEq, Eq)] | ||
22 | pub struct EnumData { | ||
23 | pub name: Option<Name>, | ||
24 | pub variants: Arena<LocalEnumVariantId, EnumVariantData>, | ||
25 | } | ||
26 | |||
27 | #[derive(Debug, Clone, PartialEq, Eq)] | ||
28 | pub struct EnumVariantData { | ||
29 | pub name: Option<Name>, | ||
30 | pub variant_data: Arc<VariantData>, | ||
31 | } | ||
32 | |||
33 | /// Fields of an enum variant or struct | ||
34 | #[derive(Debug, Clone, PartialEq, Eq)] | ||
35 | pub struct VariantData(VariantDataInner); | ||
36 | |||
37 | #[derive(Debug, Clone, PartialEq, Eq)] | ||
38 | enum VariantDataInner { | ||
39 | Struct(Arena<LocalStructFieldId, StructFieldData>), | ||
40 | Tuple(Arena<LocalStructFieldId, StructFieldData>), | ||
41 | Unit, | ||
42 | } | ||
43 | |||
44 | /// A single field of an enum variant or struct | ||
45 | #[derive(Debug, Clone, PartialEq, Eq)] | ||
46 | pub struct StructFieldData { | ||
47 | pub name: Name, | ||
48 | pub type_ref: TypeRef, | ||
49 | } | ||
50 | |||
51 | impl StructData { | ||
52 | pub(crate) fn struct_data_query(db: &impl DefDatabase2, struct_: StructId) -> Arc<StructData> { | ||
53 | let src = struct_.source(db); | ||
54 | let name = src.ast.name().map(|n| n.as_name()); | ||
55 | let variant_data = VariantData::new(src.ast.kind()); | ||
56 | <