aboutsummaryrefslogtreecommitdiff
path: root/crates/ra_hir/src/semantics.rs
diff options
context:
space:
mode:
Diffstat (limited to 'crates/ra_hir/src/semantics.rs')
-rw-r--r--crates/ra_hir/src/semantics.rs840
1 files changed, 0 insertions, 840 deletions
diff --git a/crates/ra_hir/src/semantics.rs b/crates/ra_hir/src/semantics.rs
deleted file mode 100644
index 1467d825d..000000000
--- a/crates/ra_hir/src/semantics.rs
+++ /dev/null
@@ -1,840 +0,0 @@
1//! See `Semantics`.
2
3mod source_to_def;
4
5use std::{cell::RefCell, fmt, iter::successors};
6
7use base_db::{FileId, FileRange};
8use hir_def::{
9 resolver::{self, HasResolver, Resolver},
10 AsMacroCall, FunctionId, TraitId, VariantId,
11};
12use hir_expand::{hygiene::Hygiene, name::AsName, ExpansionInfo};
13use hir_ty::associated_type_shorthand_candidates;
14use itertools::Itertools;
15use rustc_hash::{FxHashMap, FxHashSet};
16use syntax::{
17 algo::{find_node_at_offset, skip_trivia_token},
18 ast, AstNode, Direction, SyntaxNode, SyntaxToken, TextRange, TextSize,
19};
20
21use crate::{
22 db::HirDatabase,
23 diagnostics::Diagnostic,
24 semantics::source_to_def::{ChildContainer, SourceToDefCache, SourceToDefCtx},
25 source_analyzer::{resolve_hir_path, resolve_hir_path_qualifier, SourceAnalyzer},
26 AssocItem, Callable, Crate, Field, Function, HirFileId, ImplDef, InFile, Local, MacroDef,
27 Module, ModuleDef, Name, Origin, Path, ScopeDef, Trait, Type, TypeAlias, TypeParam, TypeRef,
28 VariantDef,
29};
30use resolver::TypeNs;
31
32#[derive(Debug, Clone, PartialEq, Eq)]
33pub enum PathResolution {
34 /// An item
35 Def(ModuleDef),
36 /// A local binding (only value namespace)
37 Local(Local),
38 /// A generic parameter
39 TypeParam(TypeParam),
40 SelfType(ImplDef),
41 Macro(MacroDef),
42 AssocItem(AssocItem),
43}
44
45impl PathResolution {
46 fn in_type_ns(&self) -> Option<TypeNs> {
47 match self {
48 PathResolution::Def(ModuleDef::Adt(adt)) => Some(TypeNs::AdtId((*adt).into())),
49 PathResolution::Def(ModuleDef::BuiltinType(builtin)) => {
50 Some(TypeNs::BuiltinType(*builtin))
51 }
52 PathResolution::Def(ModuleDef::Const(_))
53 | PathResolution::Def(ModuleDef::EnumVariant(_))
54 | PathResolution::Def(ModuleDef::Function(_))
55 | PathResolution::Def(ModuleDef::Module(_))
56 | PathResolution::Def(ModuleDef::Static(_))
57 | PathResolution::Def(ModuleDef::Trait(_)) => None,
58 PathResolution::Def(ModuleDef::TypeAlias(alias)) => {
59 Some(TypeNs::TypeAliasId((*alias).into()))
60 }
61 PathResolution::Local(_) | PathResolution::Macro(_) => None,
62 PathResolution::TypeParam(param) => Some(TypeNs::GenericParam((*param).into())),
63 PathResolution::SelfType(impl_def) => Some(TypeNs::SelfType((*impl_def).into())),
64 PathResolution::AssocItem(AssocItem::Const(_))
65 | PathResolution::AssocItem(AssocItem::Function(_)) => None,
66 PathResolution::AssocItem(AssocItem::TypeAlias(alias)) => {
67 Some(TypeNs::TypeAliasId((*alias).into()))
68 }
69 }
70 }
71
72 /// Returns an iterator over associated types that may be specified after this path (using
73 /// `Ty::Assoc` syntax).
74 pub fn assoc_type_shorthand_candidates<R>(
75 &self,
76 db: &dyn HirDatabase,
77 mut cb: impl FnMut(TypeAlias) -> Option<R>,
78 ) -> Option<R> {
79 associated_type_shorthand_candidates(db, self.in_type_ns()?, |_, _, id| cb(id.into()))
80 }
81}
82
83/// Primary API to get semantic information, like types, from syntax trees.
84pub struct Semantics<'db, DB> {
85 pub db: &'db DB,
86 imp: SemanticsImpl<'db>,
87}
88
89pub struct SemanticsImpl<'db> {
90 pub db: &'db dyn HirDatabase,
91 s2d_cache: RefCell<SourceToDefCache>,
92 expansion_info_cache: RefCell<FxHashMap<HirFileId, Option<ExpansionInfo>>>,
93 cache: RefCell<FxHashMap<SyntaxNode, HirFileId>>,
94}
95
96impl<DB> fmt::Debug for Semantics<'_, DB> {
97 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
98 write!(f, "Semantics {{ ... }}")
99 }
100}
101
102impl<'db, DB: HirDatabase> Semantics<'db, DB> {
103 pub fn new(db: &DB) -> Semantics<DB> {
104 let impl_ = SemanticsImpl::new(db);
105 Semantics { db, imp: impl_ }
106 }
107
108 pub fn parse(&self, file_id: FileId) -> ast::SourceFile {
109 self.imp.parse(file_id)
110 }
111
112 pub fn expand(&self, macro_call: &ast::MacroCall) -> Option<SyntaxNode> {
113 self.imp.expand(macro_call)
114 }
115
116 pub fn expand_hypothetical(
117 &self,
118 actual_macro_call: &ast::MacroCall,
119 hypothetical_args: &ast::TokenTree,
120 token_to_map: SyntaxToken,
121 ) -> Option<(SyntaxNode, SyntaxToken)> {
122 self.imp.expand_hypothetical(actual_macro_call, hypothetical_args, token_to_map)
123 }
124
125 pub fn descend_into_macros(&self, token: SyntaxToken) -> SyntaxToken {
126 self.imp.descend_into_macros(token)
127 }
128
129 pub fn descend_node_at_offset<N: ast::AstNode>(
130 &self,
131 node: &SyntaxNode,
132 offset: TextSize,
133 ) -> Option<N> {
134 self.imp.descend_node_at_offset(node, offset).find_map(N::cast)
135 }
136
137 pub fn original_range(&self, node: &SyntaxNode) -> FileRange {
138 self.imp.original_range(node)
139 }
140
141 pub fn diagnostics_display_range(&self, diagnostics: &dyn Diagnostic) -> FileRange {
142 self.imp.diagnostics_display_range(diagnostics)
143 }
144
145 pub fn ancestors_with_macros(&self, node: SyntaxNode) -> impl Iterator<Item = SyntaxNode> + '_ {
146 self.imp.ancestors_with_macros(node)
147 }
148
149 pub fn ancestors_at_offset_with_macros(
150 &self,
151 node: &SyntaxNode,
152 offset: TextSize,
153 ) -> impl Iterator<Item = SyntaxNode> + '_ {
154 self.imp.ancestors_at_offset_with_macros(node, offset)
155 }
156
157 /// Find a AstNode by offset inside SyntaxNode, if it is inside *Macrofile*,
158 /// search up until it is of the target AstNode type
159 pub fn find_node_at_offset_with_macros<N: AstNode>(
160 &self,
161 node: &SyntaxNode,
162 offset: TextSize,
163 ) -> Option<N> {
164 self.imp.ancestors_at_offset_with_macros(node, offset).find_map(N::cast)
165 }
166
167 /// Find a AstNode by offset inside SyntaxNode, if it is inside *MacroCall*,
168 /// descend it and find again
169 pub fn find_node_at_offset_with_descend<N: AstNode>(
170 &self,
171 node: &SyntaxNode,
172 offset: TextSize,
173 ) -> Option<N> {
174 if let Some(it) = find_node_at_offset(&node, offset) {
175 return Some(it);
176 }
177
178 self.imp.descend_node_at_offset(node, offset).find_map(N::cast)
179 }
180
181 pub fn type_of_expr(&self, expr: &ast::Expr) -> Option<Type> {
182 self.imp.type_of_expr(expr)
183 }
184
185 pub fn type_of_pat(&self, pat: &ast::Pat) -> Option<Type> {
186 self.imp.type_of_pat(pat)
187 }
188
189 pub fn type_of_self(&self, param: &ast::SelfParam) -> Option<Type> {
190 self.imp.type_of_self(param)
191 }
192
193 pub fn resolve_method_call(&self, call: &ast::MethodCallExpr) -> Option<Function> {
194 self.imp.resolve_method_call(call).map(Function::from)
195 }
196
197 pub fn resolve_method_call_as_callable(&self, call: &ast::MethodCallExpr) -> Option<Callable> {
198 self.imp.resolve_method_call_as_callable(call)
199 }
200
201 pub fn resolve_field(&self, field: &ast::FieldExpr) -> Option<Field> {
202 self.imp.resolve_field(field)
203 }
204
205 pub fn resolve_record_field(
206 &self,
207 field: &ast::RecordExprField,
208 ) -> Option<(Field, Option<Local>)> {
209 self.imp.resolve_record_field(field)
210 }
211
212 pub fn resolve_record_field_pat(&self, field: &ast::RecordPatField) -> Option<Field> {
213 self.imp.resolve_record_field_pat(field)
214 }
215
216 pub fn resolve_macro_call(&self, macro_call: &ast::MacroCall) -> Option<MacroDef> {
217 self.imp.resolve_macro_call(macro_call)
218 }
219
220 pub fn resolve_path(&self, path: &ast::Path) -> Option<PathResolution> {
221 self.imp.resolve_path(path)
222 }
223
224 pub fn resolve_extern_crate(&self, extern_crate: &ast::ExternCrate) -> Option<Crate> {
225 self.imp.resolve_extern_crate(extern_crate)
226 }
227
228 pub fn resolve_variant(&self, record_lit: ast::RecordExpr) -> Option<VariantDef> {
229 self.imp.resolve_variant(record_lit).map(VariantDef::from)
230 }
231
232 pub fn lower_path(&self, path: &ast::Path) -> Option<Path> {
233 self.imp.lower_path(path)
234 }
235
236 pub fn resolve_bind_pat_to_const(&self, pat: &ast::IdentPat) -> Option<ModuleDef> {
237 self.imp.resolve_bind_pat_to_const(pat)
238 }
239
240 // FIXME: use this instead?
241 // pub fn resolve_name_ref(&self, name_ref: &ast::NameRef) -> Option<???>;
242
243 pub fn record_literal_missing_fields(&self, literal: &ast::RecordExpr) -> Vec<(Field, Type)> {
244 self.imp.record_literal_missing_fields(literal)
245 }
246
247 pub fn record_pattern_missing_fields(&self, pattern: &ast::RecordPat) -> Vec<(Field, Type)> {
248 self.imp.record_pattern_missing_fields(pattern)
249 }
250
251 pub fn to_def<T: ToDef>(&self, src: &T) -> Option<T::Def> {
252 let src = self.imp.find_file(src.syntax().clone()).with_value(src).cloned();
253 T::to_def(&self.imp, src)
254 }
255
256 pub fn to_module_def(&self, file: FileId) -> Option<Module> {
257 self.imp.to_module_def(file)
258 }
259
260 pub fn scope(&self, node: &SyntaxNode) -> SemanticsScope<'db> {
261 self.imp.scope(node)
262 }
263
264 pub fn scope_at_offset(&self, node: &SyntaxNode, offset: TextSize) -> SemanticsScope<'db> {
265 self.imp.scope_at_offset(node, offset)
266 }
267
268 pub fn scope_for_def(&self, def: Trait) -> SemanticsScope<'db> {
269 self.imp.scope_for_def(def)
270 }
271
272 pub fn assert_contains_node(&self, node: &SyntaxNode) {
273 self.imp.assert_contains_node(node)
274 }
275
276 pub fn is_unsafe_method_call(&self, method_call_expr: ast::MethodCallExpr) -> bool {
277 self.imp.is_unsafe_method_call(method_call_expr)
278 }
279
280 pub fn is_unsafe_ref_expr(&self, ref_expr: &ast::RefExpr) -> bool {
281 self.imp.is_unsafe_ref_expr(ref_expr)
282 }
283
284 pub fn is_unsafe_ident_pat(&self, ident_pat: &ast::IdentPat) -> bool {
285 self.imp.is_unsafe_ident_pat(ident_pat)
286 }
287}
288
289impl<'db> SemanticsImpl<'db> {
290 fn new(db: &'db dyn HirDatabase) -> Self {
291 SemanticsImpl {
292 db,
293 s2d_cache: Default::default(),
294 cache: Default::default(),
295 expansion_info_cache: Default::default(),
296 }
297 }
298
299 fn parse(&self, file_id: FileId) -> ast::SourceFile {
300 let tree = self.db.parse(file_id).tree();
301 self.cache(tree.syntax().clone(), file_id.into());
302 tree
303 }
304
305 fn expand(&self, macro_call: &ast::MacroCall) -> Option<SyntaxNode> {
306 let macro_call = self.find_file(macro_call.syntax().clone()).with_value(macro_call);
307 let sa = self.analyze2(macro_call.map(|it| it.syntax()), None);
308 let file_id = sa.expand(self.db, macro_call)?;
309 let node = self.db.parse_or_expand(file_id)?;
310 self.cache(node.clone(), file_id);
311 Some(node)
312 }
313
314 fn expand_hypothetical(
315 &self,
316 actual_macro_call: &ast::MacroCall,
317 hypothetical_args: &ast::TokenTree,
318 token_to_map: SyntaxToken,
319 ) -> Option<(SyntaxNode, SyntaxToken)> {
320 let macro_call =
321 self.find_file(actual_macro_call.syntax().clone()).with_value(actual_macro_call);
322 let sa = self.analyze2(macro_call.map(|it| it.syntax()), None);
323 let krate = sa.resolver.krate()?;
324 let macro_call_id = macro_call.as_call_id(self.db.upcast(), krate, |path| {
325 sa.resolver.resolve_path_as_macro(self.db.upcast(), &path)
326 })?;
327 hir_expand::db::expand_hypothetical(
328 self.db.upcast(),
329 macro_call_id,
330 hypothetical_args,
331 token_to_map,
332 )
333 }
334
335 fn descend_into_macros(&self, token: SyntaxToken) -> SyntaxToken {
336 let _p = profile::span("descend_into_macros");
337 let parent = token.parent();
338 let parent = self.find_file(parent);
339 let sa = self.analyze2(parent.as_ref(), None);
340
341 let token = successors(Some(parent.with_value(token)), |token| {
342 self.db.check_canceled();
343 let macro_call = token.value.ancestors().find_map(ast::MacroCall::cast)?;
344 let tt = macro_call.token_tree()?;
345 if !tt.syntax().text_range().contains_range(token.value.text_range()) {
346 return None;
347 }
348 let file_id = sa.expand(self.db, token.with_value(&macro_call))?;
349 let token = self
350 .expansion_info_cache
351 .borrow_mut()
352 .entry(file_id)
353 .or_insert_with(|| file_id.expansion_info(self.db.upcast()))
354 .as_ref()?
355 .map_token_down(token.as_ref())?;
356
357 self.cache(find_root(&token.value.parent()), token.file_id);
358
359 Some(token)
360 })
361 .last()
362 .unwrap();
363
364 token.value
365 }
366
367 fn descend_node_at_offset(
368 &self,
369 node: &SyntaxNode,
370 offset: TextSize,
371 ) -> impl Iterator<Item = SyntaxNode> + '_ {
372 // Handle macro token cases
373 node.token_at_offset(offset)
374 .map(|token| self.descend_into_macros(token))
375 .map(|it| self.ancestors_with_macros(it.parent()))
376 .flatten()
377 }
378
379 fn original_range(&self, node: &SyntaxNode) -> FileRange {
380 let node = self.find_file(node.clone());
381 original_range(self.db, node.as_ref())
382 }
383
384 fn diagnostics_display_range(&self, diagnostics: &dyn Diagnostic) -> FileRange {
385 let src = diagnostics.display_source();
386 let root = self.db.parse_or_expand(src.file_id).unwrap();
387 let node = src.value.to_node(&root);
388 self.cache(root, src.file_id);
389 original_range(self.db, src.with_value(&node))
390 }
391
392 fn ancestors_with_macros(&self, node: SyntaxNode) -> impl Iterator<Item = SyntaxNode> + '_ {
393 let node = self.find_file(node);
394 node.ancestors_with_macros(self.db.upcast()).map(|it| it.value)
395 }
396
397 fn ancestors_at_offset_with_macros(
398 &self,
399 node: &SyntaxNode,
400 offset: TextSize,
401 ) -> impl Iterator<Item = SyntaxNode> + '_ {
402 node.token_at_offset(offset)
403 .map(|token| self.ancestors_with_macros(token.parent()))
404 .kmerge_by(|node1, node2| node1.text_range().len() < node2.text_range().len())
405 }
406
407 fn type_of_expr(&self, expr: &ast::Expr) -> Option<Type> {
408 self.analyze(expr.syntax()).type_of_expr(self.db, &expr)
409 }
410
411 fn type_of_pat(&self, pat: &ast::Pat) -> Option<Type> {
412 self.analyze(pat.syntax()).type_of_pat(self.db, &pat)
413 }
414
415 fn type_of_self(&self, param: &ast::SelfParam) -> Option<Type> {
416 self.analyze(param.syntax()).type_of_self(self.db, &param)
417 }
418
419 fn resolve_method_call(&self, call: &ast::MethodCallExpr) -> Option<FunctionId> {
420 self.analyze(call.syntax()).resolve_method_call(self.db, call)
421 }
422
423 fn resolve_method_call_as_callable(&self, call: &ast::MethodCallExpr) -> Option<Callable> {
424 // FIXME: this erases Substs
425 let func = self.resolve_method_call(call)?;
426 let ty = self.db.value_ty(func.into());
427 let resolver = self.analyze(call.syntax()).resolver;
428 let ty = Type::new_with_resolver(self.db, &resolver, ty.value)?;
429 let mut res = ty.as_callable(self.db)?;
430 res.is_bound_method = true;
431 Some(res)
432 }
433
434 fn resolve_field(&self, field: &ast::FieldExpr) -> Option<Field> {
435 self.analyze(field.syntax()).resolve_field(self.db, field)
436 }
437
438 fn resolve_record_field(&self, field: &ast::RecordExprField) -> Option<(Field, Option<Local>)> {
439 self.analyze(field.syntax()).resolve_record_field(self.db, field)
440 }
441
442 fn resolve_record_field_pat(&self, field: &ast::RecordPatField) -> Option<Field> {
443 self.analyze(field.syntax()).resolve_record_field_pat(self.db, field)
444 }
445
446 fn resolve_macro_call(&self, macro_call: &ast::MacroCall) -> Option<MacroDef> {
447 let sa = self.analyze(macro_call.syntax());
448 let macro_call = self.find_file(macro_call.syntax().clone()).with_value(macro_call);
449 sa.resolve_macro_call(self.db, macro_call)
450 }
451
452 fn resolve_path(&self, path: &ast::Path) -> Option<PathResolution> {
453 self.analyze(path.syntax()).resolve_path(self.db, path)
454 }
455
456 fn resolve_extern_crate(&self, extern_crate: &ast::ExternCrate) -> Option<Crate> {
457 let krate = self.scope(extern_crate.syntax()).krate()?;
458 krate.dependencies(self.db).into_iter().find_map(|dep| {
459 if dep.name == extern_crate.name_ref()?.as_name() {
460 Some(dep.krate)
461 } else {
462 None
463 }
464 })
465 }
466
467 fn resolve_variant(&self, record_lit: ast::RecordExpr) -> Option<VariantId> {
468 self.analyze(record_lit.syntax()).resolve_variant(self.db, record_lit)
469 }
470
471 fn lower_path(&self, path: &ast::Path) -> Option<Path> {
472 let src = self.find_file(path.syntax().clone());
473 Path::from_src(path.clone(), &Hygiene::new(self.db.upcast(), src.file_id.into()))
474 }
475
476 fn resolve_bind_pat_to_const(&self, pat: &ast::IdentPat) -> Option<ModuleDef> {
477 self.analyze(pat.syntax()).resolve_bind_pat_to_const(self.db, pat)
478 }
479
480 fn record_literal_missing_fields(&self, literal: &ast::RecordExpr) -> Vec<(Field, Type)> {
481 self.analyze(literal.syntax())
482 .record_literal_missing_fields(self.db, literal)
483 .unwrap_or_default()
484 }
485
486 fn record_pattern_missing_fields(&self, pattern: &ast::RecordPat) -> Vec<(Field, Type)> {
487 self.analyze(pattern.syntax())
488 .record_pattern_missing_fields(self.db, pattern)
489 .unwrap_or_default()
490 }
491
492 fn with_ctx<F: FnOnce(&mut SourceToDefCtx) -> T, T>(&self, f: F) -> T {
493 let mut cache = self.s2d_cache.borrow_mut();
494 let mut ctx = SourceToDefCtx { db: self.db, cache: &mut *cache };
495 f(&mut ctx)
496 }
497
498 fn to_module_def(&self, file: FileId) -> Option<Module> {
499 self.with_ctx(|ctx| ctx.file_to_def(file)).map(Module::from)
500 }
501
502 fn scope(&self, node: &SyntaxNode) -> SemanticsScope<'db> {
503 let node = self.find_file(node.clone());
504 let resolver = self.analyze2(node.as_ref(), None).resolver;
505 SemanticsScope { db: self.db, resolver }
506 }
507
508 fn scope_at_offset(&self, node: &SyntaxNode, offset: TextSize) -> SemanticsScope<'db> {
509 let node = self.find_file(node.clone());
510 let resolver = self.analyze2(node.as_ref(), Some(offset)).resolver;
511 SemanticsScope { db: self.db, resolver }
512 }
513
514 fn scope_for_def(&self, def: Trait) -> SemanticsScope<'db> {
515 let resolver = def.id.resolver(self.db.upcast());
516 SemanticsScope { db: self.db, resolver }
517 }
518
519 fn analyze(&self, node: &SyntaxNode) -> SourceAnalyzer {
520 let src = self.find_file(node.clone());
521 self.analyze2(src.as_ref(), None)
522 }
523
524 fn analyze2(&self, src: InFile<&SyntaxNode>, offset: Option<TextSize>) -> SourceAnalyzer {
525 let _p = profile::span("Semantics::analyze2");
526
527 let container = match self.with_ctx(|ctx| ctx.find_container(src)) {
528 Some(it) => it,
529 None => return SourceAnalyzer::new_for_resolver(Resolver::default(), src),
530 };
531
532 let resolver = match container {
533 ChildContainer::DefWithBodyId(def) => {
534 return SourceAnalyzer::new_for_body(self.db, def, src, offset)
535 }
536 ChildContainer::TraitId(it) => it.resolver(self.db.upcast()),
537 ChildContainer::ImplId(it) => it.resolver(self.db.upcast()),
538 ChildContainer::ModuleId(it) => it.resolver(self.db.upcast()),
539 ChildContainer::EnumId(it) => it.resolver(self.db.upcast()),
540 ChildContainer::VariantId(it) => it.resolver(self.db.upcast()),
541 ChildContainer::TypeAliasId(it) => it.resolver(self.db.upcast()),
542 ChildContainer::GenericDefId(it) => it.resolver(self.db.upcast()),
543 };
544 SourceAnalyzer::new_for_resolver(resolver, src)
545 }
546
547 fn cache(&self, root_node: SyntaxNode, file_id: HirFileId) {
548 assert!(root_node.parent().is_none());
549 let mut cache = self.cache.borrow_mut();
550 let prev = cache.insert(root_node, file_id);
551 assert!(prev == None || prev == Some(file_id))
552 }
553
554 fn assert_contains_node(&self, node: &SyntaxNode) {
555 self.find_file(node.clone());
556 }
557
558 fn lookup(&self, root_node: &SyntaxNode) -> Option<HirFileId> {
559 let cache = self.cache.borrow();
560 cache.get(root_node).copied()
561 }
562
563 fn find_file(&self, node: SyntaxNode) -> InFile<SyntaxNode> {
564 let root_node = find_root(&node);
565 let file_id = self.lookup(&root_node).unwrap_or_else(|| {
566 panic!(
567 "\n\nFailed to lookup {:?} in this Semantics.\n\
568 Make sure to use only query nodes, derived from this instance of Semantics.\n\
569 root node: {:?}\n\
570 known nodes: {}\n\n",
571 node,
572 root_node,
573 self.cache
574 .borrow()
575 .keys()
576 .map(|it| format!("{:?}", it))
577 .collect::<Vec<_>>()
578 .join(", ")
579 )
580 });
581 InFile::new(file_id, node)
582 }
583
584 pub fn is_unsafe_method_call(&self, method_call_expr: ast::MethodCallExpr) -> bool {
585 method_call_expr
586 .expr()
587 .and_then(|expr| {
588 let field_expr = if let ast::Expr::FieldExpr(field_expr) = expr {
589 field_expr
590 } else {
591 return None;
592 };
593 let ty = self.type_of_expr(&field_expr.expr()?)?;
594 if !ty.is_packed(self.db) {
595 return None;
596 }
597
598 let func = self.resolve_method_call(&method_call_expr).map(Function::from)?;
599 let is_unsafe = func.has_self_param(self.db)
600 && matches!(func.params(self.db).first(), Some(TypeRef::Reference(..)));
601 Some(is_unsafe)
602 })
603 .unwrap_or(false)
604 }
605
606 pub fn is_unsafe_ref_expr(&self, ref_expr: &ast::RefExpr) -> bool {
607 ref_expr
608 .expr()
609 .and_then(|expr| {
610 let field_expr = match expr {
611 ast::Expr::FieldExpr(field_expr) => field_expr,
612 _ => return None,
613 };
614 let expr = field_expr.expr()?;
615 self.type_of_expr(&expr)
616 })
617 // Binding a reference to a packed type is possibly unsafe.
618 .map(|ty| ty.is_packed(self.db))
619 .unwrap_or(false)
620
621 // FIXME This needs layout computation to be correct. It will highlight
622 // more than it should with the current implementation.
623 }
624
625 pub fn is_unsafe_ident_pat(&self, ident_pat: &ast::IdentPat) -> bool {
626 if !ident_pat.ref_token().is_some() {
627 return false;
628 }
629
630 ident_pat
631 .syntax()
632 .parent()
633 .and_then(|parent| {
634 // `IdentPat` can live under `RecordPat` directly under `RecordPatField` or
635 // `RecordPatFieldList`. `RecordPatField` also lives under `RecordPatFieldList`,
636 // so this tries to lookup the `IdentPat` anywhere along that structure to the
637 // `RecordPat` so we can get the containing type.
638 let record_pat = ast::RecordPatField::cast(parent.clone())
639 .and_then(|record_pat| record_pat.syntax().parent())
640 .or_else(|| Some(parent.clone()))
641 .and_then(|parent| {
642 ast::RecordPatFieldList::cast(parent)?
643 .syntax()
644 .parent()
645 .and_then(ast::RecordPat::cast)
646 });
647
648 // If this doesn't match a `RecordPat`, fallback to a `LetStmt` to see if
649 // this is initialized from a `FieldExpr`.
650 if let Some(record_pat) = record_pat {
651 self.type_of_pat(&ast::Pat::RecordPat(record_pat))
652 } else if let Some(let_stmt) = ast::LetStmt::cast(parent) {
653 let field_expr = match let_stmt.initializer()? {
654 ast::Expr::FieldExpr(field_expr) => field_expr,
655 _ => return None,
656 };
657
658 self.type_of_expr(&field_expr.expr()?)
659 } else {
660 None
661 }
662 })
663 // Binding a reference to a packed type is possibly unsafe.
664 .map(|ty| ty.is_packed(self.db))
665 .unwrap_or(false)
666 }
667}
668
669pub trait ToDef: AstNode + Clone {
670 type Def;
671
672 fn to_def(sema: &SemanticsImpl, src: InFile<Self>) -> Option<Self::Def>;
673}
674
675macro_rules! to_def_impls {
676 ($(($def:path, $ast:path, $meth:ident)),* ,) => {$(
677 impl ToDef for $ast {
678 type Def = $def;
679 fn to_def(sema: &SemanticsImpl, src: InFile<Self>) -> Option<Self::Def> {
680 sema.with_ctx(|ctx| ctx.$meth(src)).map(<$def>::from)
681 }
682 }
683 )*}
684}
685
686to_def_impls![
687 (crate::Module, ast::Module, module_to_def),
688 (crate::Struct, ast::Struct, struct_to_def),
689 (crate::Enum, ast::Enum, enum_to_def),
690 (crate::Union, ast::Union, union_to_def),
691 (crate::Trait, ast::Trait, trait_to_def),
692 (crate::ImplDef, ast::Impl, impl_to_def),
693 (crate::TypeAlias, ast::TypeAlias, type_alias_to_def),
694 (crate::Const, ast::Const, const_to_def),
695 (crate::Static, ast::Static, static_to_def),
696 (crate::Function, ast::Fn, fn_to_def),
697 (crate::Field, ast::RecordField, record_field_to_def),
698 (crate::Field, ast::TupleField, tuple_field_to_def),
699 (crate::EnumVariant, ast::Variant, enum_variant_to_def),
700 (crate::TypeParam, ast::TypeParam, type_param_to_def),
701 (crate::MacroDef, ast::MacroCall, macro_call_to_def), // this one is dubious, not all calls are macros
702 (crate::Local, ast::IdentPat, bind_pat_to_def),
703];
704
705fn find_root(node: &SyntaxNode) -> SyntaxNode {
706 node.ancestors().last().unwrap()
707}
708
709#[derive(Debug)]
710pub struct SemanticsScope<'a> {
711 pub db: &'a dyn HirDatabase,
712 resolver: Resolver,
713}
714
715impl<'a> SemanticsScope<'a> {
716 pub fn module(&self) -> Option<Module> {
717 Some(Module { id: self.resolver.module()? })
718 }
719
720 pub fn krate(&self) -> Option<Crate> {
721 Some(Crate { id: self.resolver.krate()? })
722 }
723
724 /// Note: `FxHashSet<TraitId>` should be treated as an opaque type, passed into `Type
725 // FIXME: rename to visible_traits to not repeat scope?
726 pub fn traits_in_scope(&self) -> FxHashSet<TraitId> {
727 let resolver = &self.resolver;
728 resolver.traits_in_scope(self.db.upcast())
729 }
730
731 pub fn process_all_names(&self, f: &mut dyn FnMut(Name, ScopeDef)) {
732 let resolver = &self.resolver;
733
734 resolver.process_all_names(self.db.upcast(), &mut |name, def| {
735 let def = match def {
736 resolver::ScopeDef::PerNs(it) => {
737 let items = ScopeDef::all_items(it);
738 for item in items {
739 f(name.clone(), item);
740 }
741 return;
742 }
743 resolver::ScopeDef::ImplSelfType(it) => ScopeDef::ImplSelfType(it.into()),
744 resolver::ScopeDef::AdtSelfType(it) => ScopeDef::AdtSelfType(it.into()),
745 resolver::ScopeDef::GenericParam(id) => ScopeDef::GenericParam(TypeParam { id }),
746 resolver::ScopeDef::Local(pat_id) => {
747 let parent = resolver.body_owner().unwrap().into();
748 ScopeDef::Local(Local { parent, pat_id })
749 }
750 };
751 f(name, def)
752 })
753 }
754
755 pub fn resolve_hir_path(&self, path: &Path) -> Option<PathResolution> {
756 resolve_hir_path(self.db, &self.resolver, path)
757 }
758
759 /// Resolves a path where we know it is a qualifier of another path.
760 ///
761 /// For example, if we have:
762 /// ```
763 /// mod my {
764 /// pub mod foo {
765 /// struct Bar;
766 /// }
767 ///
768 /// pub fn foo() {}
769 /// }
770 /// ```
771 /// then we know that `foo` in `my::foo::Bar` refers to the module, not the function.
772 pub fn resolve_hir_path_qualifier(&self, path: &Path) -> Option<PathResolution> {
773 resolve_hir_path_qualifier(self.db, &self.resolver, path)
774 }
775}
776
777// FIXME: Change `HasSource` trait to work with `Semantics` and remove this?
778pub fn original_range(db: &dyn HirDatabase, node: InFile<&SyntaxNode>) -> FileRange {
779 if let Some(range) = original_range_opt(db, node) {
780 let original_file = range.file_id.original_file(db.upcast());
781 if range.file_id == original_file.into() {
782 return FileRange { file_id: original_file, range: range.value };
783 }
784
785 log::error!("Fail to mapping up more for {:?}", range);
786 return FileRange { file_id: range.file_id.original_file(db.upcast()), range: range.value };
787 }
788
789 // Fall back to whole macro call
790 if let Some(expansion) = node.file_id.expansion_info(db.upcast()) {
791 if let Some(call_node) = expansion.call_node() {
792 return FileRange {
793 file_id: call_node.file_id.original_file(db.upcast()),
794 range: call_node.value.text_range(),
795 };
796 }
797 }
798
799 FileRange { file_id: node.file_id.original_file(db.upcast()), range: node.value.text_range() }
800}
801
802fn original_range_opt(
803 db: &dyn HirDatabase,
804 node: InFile<&SyntaxNode>,
805) -> Option<InFile<TextRange>> {
806 let expansion = node.file_id.expansion_info(db.upcast())?;
807
808 // the input node has only one token ?
809 let single = skip_trivia_token(node.value.first_token()?, Direction::Next)?
810 == skip_trivia_token(node.value.last_token()?, Direction::Prev)?;
811
812 Some(node.value.descendants().find_map(|it| {
813 let first = skip_trivia_token(it.first_token()?, Direction::Next)?;
814 let first = ascend_call_token(db, &expansion, node.with_value(first))?;
815
816 let last = skip_trivia_token(it.last_token()?, Direction::Prev)?;
817 let last = ascend_call_token(db, &expansion, node.with_value(last))?;
818
819 if (!single && first == last) || (first.file_id != last.file_id) {
820 return None;
821 }
822
823 Some(first.with_value(first.value.text_range().cover(last.value.text_range())))
824 })?)
825}
826
827fn ascend_call_token(
828 db: &dyn HirDatabase,
829 expansion: &ExpansionInfo,
830 token: InFile<SyntaxToken>,
831) -> Option<InFile<SyntaxToken>> {
832 let (mapped, origin) = expansion.map_token_up(token.as_ref())?;
833 if origin != Origin::Call {
834 return None;
835 }
836 if let Some(info) = mapped.file_id.expansion_info(db.upcast()) {
837 return ascend_call_token(db, &info, mapped);
838 }
839 Some(mapped)
840}
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-20 04:19:41 +0000