5 use std::{cell::RefCell, fmt, iter};
7 use base_db::{FileId, FileRange};
10 resolver::{self, HasResolver, Resolver, TypeNs},
11 AsMacroCall, FunctionId, TraitId, VariantId,
13 use hir_expand::{name::AsName, ExpansionInfo, MacroCallId};
15 use itertools::Itertools;
16 use rustc_hash::{FxHashMap, FxHashSet};
17 use smallvec::{smallvec, SmallVec};
19 algo::skip_trivia_token,
20 ast::{self, HasAttrs as _, HasGenericParams, HasLoopBody},
21 match_ast, AstNode, Direction, SyntaxNode, SyntaxNodePtr, SyntaxToken, TextSize,
26 semantics::source_to_def::{ChildContainer, SourceToDefCache, SourceToDefCtx},
27 source_analyzer::{resolve_hir_path, SourceAnalyzer},
28 Access, AssocItem, BuiltinAttr, Callable, ConstParam, Crate, Field, Function, HasSource,
29 HirFileId, Impl, InFile, Label, LifetimeParam, Local, MacroDef, Module, ModuleDef, Name, Path,
30 ScopeDef, ToolModule, Trait, Type, TypeAlias, TypeParam, VariantDef,
33 #[derive(Debug, Clone, PartialEq, Eq)]
34 pub enum PathResolution {
37 /// A local binding (only value namespace)
42 ConstParam(ConstParam),
46 BuiltinAttr(BuiltinAttr),
47 ToolModule(ToolModule),
51 pub(crate) fn in_type_ns(&self) -> Option<TypeNs> {
53 PathResolution::Def(ModuleDef::Adt(adt)) => Some(TypeNs::AdtId((*adt).into())),
54 PathResolution::Def(ModuleDef::BuiltinType(builtin)) => {
55 Some(TypeNs::BuiltinType((*builtin).into()))
59 | ModuleDef::Variant(_)
60 | ModuleDef::Function(_)
61 | ModuleDef::Module(_)
62 | ModuleDef::Static(_)
63 | ModuleDef::Trait(_),
65 PathResolution::Def(ModuleDef::TypeAlias(alias)) => {
66 Some(TypeNs::TypeAliasId((*alias).into()))
68 PathResolution::BuiltinAttr(_)
69 | PathResolution::ToolModule(_)
70 | PathResolution::Local(_)
71 | PathResolution::Macro(_)
72 | PathResolution::ConstParam(_) => None,
73 PathResolution::TypeParam(param) => Some(TypeNs::GenericParam((*param).into())),
74 PathResolution::SelfType(impl_def) => Some(TypeNs::SelfType((*impl_def).into())),
75 PathResolution::AssocItem(AssocItem::Const(_) | AssocItem::Function(_)) => None,
76 PathResolution::AssocItem(AssocItem::TypeAlias(alias)) => {
77 Some(TypeNs::TypeAliasId((*alias).into()))
85 /// The original type of the expression or pattern.
87 /// The adjusted type, if an adjustment happened.
88 pub adjusted: Option<Type>,
92 pub fn original(self) -> Type {
96 pub fn has_adjustment(&self) -> bool {
97 self.adjusted.is_some()
100 /// The adjusted type, or the original in case no adjustments occurred.
101 pub fn adjusted(self) -> Type {
102 self.adjusted.unwrap_or(self.original)
106 /// Primary API to get semantic information, like types, from syntax trees.
107 pub struct Semantics<'db, DB> {
109 imp: SemanticsImpl<'db>,
112 pub struct SemanticsImpl<'db> {
113 pub db: &'db dyn HirDatabase,
114 s2d_cache: RefCell<SourceToDefCache>,
115 expansion_info_cache: RefCell<FxHashMap<HirFileId, Option<ExpansionInfo>>>,
116 // Rootnode to HirFileId cache
117 cache: RefCell<FxHashMap<SyntaxNode, HirFileId>>,
118 // MacroCall to its expansion's HirFileId cache
119 macro_call_cache: RefCell<FxHashMap<InFile<ast::MacroCall>, HirFileId>>,
122 impl<DB> fmt::Debug for Semantics<'_, DB> {
123 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
124 write!(f, "Semantics {{ ... }}")
128 impl<'db, DB: HirDatabase> Semantics<'db, DB> {
129 pub fn new(db: &DB) -> Semantics<DB> {
130 let impl_ = SemanticsImpl::new(db);
131 Semantics { db, imp: impl_ }
134 pub fn parse(&self, file_id: FileId) -> ast::SourceFile {
135 self.imp.parse(file_id)
138 pub fn parse_or_expand(&self, file_id: HirFileId) -> Option<SyntaxNode> {
139 self.imp.parse_or_expand(file_id)
142 pub fn expand(&self, macro_call: &ast::MacroCall) -> Option<SyntaxNode> {
143 self.imp.expand(macro_call)
146 /// If `item` has an attribute macro attached to it, expands it.
147 pub fn expand_attr_macro(&self, item: &ast::Item) -> Option<SyntaxNode> {
148 self.imp.expand_attr_macro(item)
151 pub fn resolve_derive_macro(&self, derive: &ast::Attr) -> Option<Vec<Option<MacroDef>>> {
152 self.imp.resolve_derive_macro(derive)
155 pub fn expand_derive_macro(&self, derive: &ast::Attr) -> Option<Vec<SyntaxNode>> {
156 self.imp.expand_derive_macro(derive)
159 pub fn is_attr_macro_call(&self, item: &ast::Item) -> bool {
160 self.imp.is_attr_macro_call(item)
163 pub fn is_derive_annotated(&self, item: &ast::Adt) -> bool {
164 self.imp.is_derive_annotated(item)
167 pub fn speculative_expand(
169 actual_macro_call: &ast::MacroCall,
170 speculative_args: &ast::TokenTree,
171 token_to_map: SyntaxToken,
172 ) -> Option<(SyntaxNode, SyntaxToken)> {
173 self.imp.speculative_expand(actual_macro_call, speculative_args, token_to_map)
176 pub fn speculative_expand_attr_macro(
178 actual_macro_call: &ast::Item,
179 speculative_args: &ast::Item,
180 token_to_map: SyntaxToken,
181 ) -> Option<(SyntaxNode, SyntaxToken)> {
182 self.imp.speculative_expand_attr(actual_macro_call, speculative_args, token_to_map)
185 /// Descend the token into macrocalls to its first mapped counterpart.
186 pub fn descend_into_macros_single(&self, token: SyntaxToken) -> SyntaxToken {
187 self.imp.descend_into_macros_single(token)
190 /// Descend the token into macrocalls to all its mapped counterparts.
191 pub fn descend_into_macros(&self, token: SyntaxToken) -> SmallVec<[SyntaxToken; 1]> {
192 self.imp.descend_into_macros(token)
195 /// Maps a node down by mapping its first and last token down.
196 pub fn descend_node_into_attributes<N: AstNode>(&self, node: N) -> SmallVec<[N; 1]> {
197 self.imp.descend_node_into_attributes(node)
200 /// Search for a definition's source and cache its syntax tree
201 pub fn source<Def: HasSource>(&self, def: Def) -> Option<InFile<Def::Ast>>
208 pub fn hir_file_for(&self, syntax_node: &SyntaxNode) -> HirFileId {
209 self.imp.find_file(syntax_node).file_id
212 /// Attempts to map the node out of macro expanded files returning the original file range.
213 /// If upmapping is not possible, this will fall back to the range of the macro call of the
214 /// macro file the node resides in.
215 pub fn original_range(&self, node: &SyntaxNode) -> FileRange {
216 self.imp.original_range(node)
219 /// Attempts to map the node out of macro expanded files returning the original file range.
220 pub fn original_range_opt(&self, node: &SyntaxNode) -> Option<FileRange> {
221 self.imp.original_range_opt(node)
224 /// Attempts to map the node out of macro expanded files.
225 /// This only work for attribute expansions, as other ones do not have nodes as input.
226 pub fn original_ast_node<N: AstNode>(&self, node: N) -> Option<N> {
227 self.imp.original_ast_node(node)
230 pub fn diagnostics_display_range(&self, diagnostics: InFile<SyntaxNodePtr>) -> FileRange {
231 self.imp.diagnostics_display_range(diagnostics)
234 pub fn token_ancestors_with_macros(
237 ) -> impl Iterator<Item = SyntaxNode> + '_ {
238 token.parent().into_iter().flat_map(move |it| self.ancestors_with_macros(it))
241 /// Iterates the ancestors of the given node, climbing up macro expansions while doing so.
242 pub fn ancestors_with_macros(&self, node: SyntaxNode) -> impl Iterator<Item = SyntaxNode> + '_ {
243 self.imp.ancestors_with_macros(node)
246 pub fn ancestors_at_offset_with_macros(
250 ) -> impl Iterator<Item = SyntaxNode> + '_ {
251 self.imp.ancestors_at_offset_with_macros(node, offset)
254 /// Find an AstNode by offset inside SyntaxNode, if it is inside *Macrofile*,
255 /// search up until it is of the target AstNode type
256 pub fn find_node_at_offset_with_macros<N: AstNode>(
261 self.imp.ancestors_at_offset_with_macros(node, offset).find_map(N::cast)
264 /// Find an AstNode by offset inside SyntaxNode, if it is inside *MacroCall*,
265 /// descend it and find again
266 pub fn find_node_at_offset_with_descend<N: AstNode>(
271 self.imp.descend_node_at_offset(node, offset).flatten().find_map(N::cast)
274 /// Find an AstNode by offset inside SyntaxNode, if it is inside *MacroCall*,
275 /// descend it and find again
276 pub fn find_nodes_at_offset_with_descend<'slf, N: AstNode + 'slf>(
280 ) -> impl Iterator<Item = N> + 'slf {
281 self.imp.descend_node_at_offset(node, offset).filter_map(|mut it| it.find_map(N::cast))
284 pub fn resolve_lifetime_param(&self, lifetime: &ast::Lifetime) -> Option<LifetimeParam> {
285 self.imp.resolve_lifetime_param(lifetime)
288 pub fn resolve_label(&self, lifetime: &ast::Lifetime) -> Option<Label> {
289 self.imp.resolve_label(lifetime)
292 pub fn resolve_type(&self, ty: &ast::Type) -> Option<Type> {
293 self.imp.resolve_type(ty)
296 pub fn type_of_expr(&self, expr: &ast::Expr) -> Option<TypeInfo> {
297 self.imp.type_of_expr(expr)
300 pub fn type_of_pat(&self, pat: &ast::Pat) -> Option<TypeInfo> {
301 self.imp.type_of_pat(pat)
304 pub fn type_of_self(&self, param: &ast::SelfParam) -> Option<Type> {
305 self.imp.type_of_self(param)
308 pub fn resolve_method_call(&self, call: &ast::MethodCallExpr) -> Option<Function> {
309 self.imp.resolve_method_call(call).map(Function::from)
312 pub fn resolve_method_call_as_callable(&self, call: &ast::MethodCallExpr) -> Option<Callable> {
313 self.imp.resolve_method_call_as_callable(call)
316 pub fn resolve_field(&self, field: &ast::FieldExpr) -> Option<Field> {
317 self.imp.resolve_field(field)
320 pub fn resolve_record_field(
322 field: &ast::RecordExprField,
323 ) -> Option<(Field, Option<Local>, Type)> {
324 self.imp.resolve_record_field(field)
327 pub fn resolve_record_pat_field(&self, field: &ast::RecordPatField) -> Option<Field> {
328 self.imp.resolve_record_pat_field(field)
331 pub fn resolve_macro_call(&self, macro_call: &ast::MacroCall) -> Option<MacroDef> {
332 self.imp.resolve_macro_call(macro_call)
335 pub fn resolve_attr_macro_call(&self, item: &ast::Item) -> Option<MacroDef> {
336 self.imp.resolve_attr_macro_call(item)
339 pub fn resolve_path(&self, path: &ast::Path) -> Option<PathResolution> {
340 self.imp.resolve_path(path)
343 pub fn resolve_extern_crate(&self, extern_crate: &ast::ExternCrate) -> Option<Crate> {
344 self.imp.resolve_extern_crate(extern_crate)
347 pub fn resolve_variant(&self, record_lit: ast::RecordExpr) -> Option<VariantDef> {
348 self.imp.resolve_variant(record_lit).map(VariantDef::from)
351 pub fn resolve_bind_pat_to_const(&self, pat: &ast::IdentPat) -> Option<ModuleDef> {
352 self.imp.resolve_bind_pat_to_const(pat)
355 pub fn record_literal_missing_fields(&self, literal: &ast::RecordExpr) -> Vec<(Field, Type)> {
356 self.imp.record_literal_missing_fields(literal)
359 pub fn record_pattern_missing_fields(&self, pattern: &ast::RecordPat) -> Vec<(Field, Type)> {
360 self.imp.record_pattern_missing_fields(pattern)
363 pub fn to_def<T: ToDef>(&self, src: &T) -> Option<T::Def> {
364 let src = self.imp.find_file(src.syntax()).with_value(src).cloned();
365 T::to_def(&self.imp, src)
368 pub fn to_module_def(&self, file: FileId) -> Option<Module> {
369 self.imp.to_module_def(file).next()
372 pub fn to_module_defs(&self, file: FileId) -> impl Iterator<Item = Module> {
373 self.imp.to_module_def(file)
376 pub fn scope(&self, node: &SyntaxNode) -> SemanticsScope<'db> {
380 pub fn scope_at_offset(&self, node: &SyntaxNode, offset: TextSize) -> SemanticsScope<'db> {
381 self.imp.scope_at_offset(&node, offset)
384 pub fn scope_for_def(&self, def: Trait) -> SemanticsScope<'db> {
385 self.imp.scope_for_def(def)
388 pub fn assert_contains_node(&self, node: &SyntaxNode) {
389 self.imp.assert_contains_node(node)
392 pub fn is_unsafe_method_call(&self, method_call_expr: &ast::MethodCallExpr) -> bool {
393 self.imp.is_unsafe_method_call(method_call_expr)
396 pub fn is_unsafe_ref_expr(&self, ref_expr: &ast::RefExpr) -> bool {
397 self.imp.is_unsafe_ref_expr(ref_expr)
400 pub fn is_unsafe_ident_pat(&self, ident_pat: &ast::IdentPat) -> bool {
401 self.imp.is_unsafe_ident_pat(ident_pat)
405 impl<'db> SemanticsImpl<'db> {
406 fn new(db: &'db dyn HirDatabase) -> Self {
409 s2d_cache: Default::default(),
410 cache: Default::default(),
411 expansion_info_cache: Default::default(),
412 macro_call_cache: Default::default(),
416 fn parse(&self, file_id: FileId) -> ast::SourceFile {
417 let tree = self.db.parse(file_id).tree();
418 self.cache(tree.syntax().clone(), file_id.into());
422 fn parse_or_expand(&self, file_id: HirFileId) -> Option<SyntaxNode> {
423 let node = self.db.parse_or_expand(file_id)?;
424 self.cache(node.clone(), file_id);
428 fn expand(&self, macro_call: &ast::MacroCall) -> Option<SyntaxNode> {
429 let sa = self.analyze_no_infer(macro_call.syntax());
430 let file_id = sa.expand(self.db, InFile::new(sa.file_id, macro_call))?;
431 let node = self.parse_or_expand(file_id)?;
435 fn expand_attr_macro(&self, item: &ast::Item) -> Option<SyntaxNode> {
436 let src = self.wrap_node_infile(item.clone());
437 let macro_call_id = self.with_ctx(|ctx| ctx.item_to_macro_call(src))?;
438 let file_id = macro_call_id.as_file();
439 let node = self.parse_or_expand(file_id)?;
443 fn resolve_derive_macro(&self, attr: &ast::Attr) -> Option<Vec<Option<MacroDef>>> {
445 .derive_macro_calls(attr)?
447 .map(|call| Some(MacroDef { id: self.db.lookup_intern_macro_call(call?).def }))
452 fn expand_derive_macro(&self, attr: &ast::Attr) -> Option<Vec<SyntaxNode>> {
453 let res: Vec<_> = self
454 .derive_macro_calls(attr)?
457 let file_id = call?.as_file();
458 let node = self.db.parse_or_expand(file_id)?;
459 self.cache(node.clone(), file_id);
466 fn derive_macro_calls(&self, attr: &ast::Attr) -> Option<Vec<Option<MacroCallId>>> {
467 let adt = attr.syntax().parent().and_then(ast::Adt::cast)?;
468 let file_id = self.find_file(adt.syntax()).file_id;
469 let adt = InFile::new(file_id, &adt);
470 let src = InFile::new(file_id, attr.clone());
471 self.with_ctx(|ctx| {
472 let (.., res) = ctx.attr_to_derive_macro_call(adt, src)?;
477 fn is_derive_annotated(&self, adt: &ast::Adt) -> bool {
478 let file_id = self.find_file(adt.syntax()).file_id;
479 let adt = InFile::new(file_id, adt);
480 self.with_ctx(|ctx| ctx.has_derives(adt))
483 fn is_attr_macro_call(&self, item: &ast::Item) -> bool {
484 let file_id = self.find_file(item.syntax()).file_id;
485 let src = InFile::new(file_id, item.clone());
486 self.with_ctx(|ctx| ctx.item_to_macro_call(src).is_some())
489 fn speculative_expand(
491 actual_macro_call: &ast::MacroCall,
492 speculative_args: &ast::TokenTree,
493 token_to_map: SyntaxToken,
494 ) -> Option<(SyntaxNode, SyntaxToken)> {
495 let SourceAnalyzer { file_id, resolver, .. } =
496 self.analyze_no_infer(actual_macro_call.syntax());
497 let macro_call = InFile::new(file_id, actual_macro_call);
498 let krate = resolver.krate()?;
499 let macro_call_id = macro_call.as_call_id(self.db.upcast(), krate, |path| {
500 resolver.resolve_path_as_macro(self.db.upcast(), &path)
502 hir_expand::db::expand_speculative(
505 speculative_args.syntax(),
510 fn speculative_expand_attr(
512 actual_macro_call: &ast::Item,
513 speculative_args: &ast::Item,
514 token_to_map: SyntaxToken,
515 ) -> Option<(SyntaxNode, SyntaxToken)> {
516 let macro_call = self.wrap_node_infile(actual_macro_call.clone());
517 let macro_call_id = self.with_ctx(|ctx| ctx.item_to_macro_call(macro_call))?;
518 hir_expand::db::expand_speculative(
521 speculative_args.syntax(),
526 // This might not be the correct way to do this, but it works for now
527 fn descend_node_into_attributes<N: AstNode>(&self, node: N) -> SmallVec<[N; 1]> {
528 let mut res = smallvec![];
530 let first = skip_trivia_token(node.syntax().first_token()?, Direction::Next)?;
531 let last = skip_trivia_token(node.syntax().last_token()?, Direction::Prev)?;
534 let (first, last) = match tokens {
540 self.descend_into_macros_impl(
542 &mut |InFile { value, .. }| {
543 if let Some(node) = value.ancestors().find_map(N::cast) {
550 // Descend first and last token, then zip them to look for the node they belong to
551 let mut scratch: SmallVec<[_; 1]> = smallvec![];
552 self.descend_into_macros_impl(
560 let mut scratch = scratch.into_iter();
561 self.descend_into_macros_impl(
563 &mut |InFile { value: last, file_id: last_fid }| {
564 if let Some(InFile { value: first, file_id: first_fid }) = scratch.next() {
565 if first_fid == last_fid {
566 if let Some(p) = first.parent() {
567 let range = first.text_range().cover(last.text_range());
568 let node = find_root(&p)
569 .covering_element(range)
571 .take_while(|it| it.text_range() == range)
573 if let Some(node) = node {
586 fn descend_into_macros(&self, token: SyntaxToken) -> SmallVec<[SyntaxToken; 1]> {
587 let mut res = smallvec![];
588 self.descend_into_macros_impl(token, &mut |InFile { value, .. }| res.push(value), false);
592 fn descend_into_macros_single(&self, token: SyntaxToken) -> SyntaxToken {
593 let mut res = token.clone();
594 self.descend_into_macros_impl(token, &mut |InFile { value, .. }| res = value, true);
598 fn descend_into_macros_impl(
601 f: &mut dyn FnMut(InFile<SyntaxToken>),
604 let _p = profile::span("descend_into_macros");
605 let parent = match token.parent() {
609 let sa = self.analyze_no_infer(&parent);
610 let mut stack: SmallVec<[_; 4]> = smallvec![InFile::new(sa.file_id, token)];
611 let mut cache = self.expansion_info_cache.borrow_mut();
612 let mut mcache = self.macro_call_cache.borrow_mut();
614 let mut process_expansion_for_token =
615 |stack: &mut SmallVec<_>, macro_file, item, token: InFile<&_>| {
616 let expansion_info = cache
618 .or_insert_with(|| macro_file.expansion_info(self.db.upcast()))
622 let InFile { file_id, value } = expansion_info.expanded();
623 self.cache(value, file_id);
626 let mut mapped_tokens =
627 expansion_info.map_token_down(self.db.upcast(), item, token)?;
629 let len = stack.len();
630 // requeue the tokens we got from mapping our current token down
632 stack.extend(mapped_tokens.next());
634 stack.extend(mapped_tokens);
636 // if the length changed we have found a mapping for the token
637 (stack.len() != len).then(|| ())
640 // Remap the next token in the queue into a macro call its in, if it is not being remapped
641 // either due to not being in a macro-call or because its unused push it into the result vec,
642 // otherwise push the remapped tokens back into the queue as they can potentially be remapped again.
643 while let Some(token) = stack.pop() {
644 self.db.unwind_if_cancelled();
645 let was_not_remapped = (|| {
646 // are we inside an attribute macro call
647 let containing_attribute_macro_call = self.with_ctx(|ctx| {
648 token.value.ancestors().filter_map(ast::Item::cast).find_map(|item| {
649 if item.attrs().next().is_none() {
650 // Don't force populate the dyn cache for items that don't have an attribute anyways
653 Some((ctx.item_to_macro_call(token.with_value(item.clone()))?, item))
656 if let Some((call_id, item)) = containing_attribute_macro_call {
657 let file_id = call_id.as_file();
658 return process_expansion_for_token(
666 // or are we inside a function-like macro call
668 // FIXME replace map.while_some with take_while once stable
669 token.value.ancestors().map(ast::TokenTree::cast).while_some().last()
671 let parent = tt.syntax().parent()?;
672 // check for derive attribute here
673 let macro_call = match_ast! {
675 ast::MacroCall(mcall) => mcall,
676 // attribute we failed expansion for earlier, this might be a derive invocation
677 // so try downmapping the token into the pseudo derive expansion
679 let attr = meta.parent_attr()?;
680 let adt = attr.syntax().parent().and_then(ast::Adt::cast)?;
681 let call_id = self.with_ctx(|ctx| {
682 let (_, call_id, _) = ctx.attr_to_derive_macro_call(token.with_value(&adt), token.with_value(attr))?;
685 let file_id = call_id.as_file();
686 return process_expansion_for_token(&mut stack,file_id,Some(adt.into()),token.as_ref(),);
692 if tt.left_delimiter_token().map_or(false, |it| it == token.value) {
695 if tt.right_delimiter_token().map_or(false, |it| it == token.value) {
699 let mcall = token.with_value(macro_call);
700 let file_id = match mcache.get(&mcall) {
703 let it = sa.expand(self.db, mcall.as_ref())?;
704 mcache.insert(mcall, it);
708 return process_expansion_for_token(&mut stack, file_id, None, token.as_ref());
711 // outside of a macro invocation so this is a "final" token
716 if was_not_remapped {
722 // Note this return type is deliberate as [`find_nodes_at_offset_with_descend`] wants to stop
723 // traversing the inner iterator when it finds a node.
724 // The outer iterator is over the tokens descendants
725 // The inner iterator is the ancestors of a descendant
726 fn descend_node_at_offset(
730 ) -> impl Iterator<Item = impl Iterator<Item = SyntaxNode> + '_> + '_ {
731 node.token_at_offset(offset)
732 .map(move |token| self.descend_into_macros(token))
734 descendants.into_iter().map(move |it| self.token_ancestors_with_macros(it))
736 // re-order the tokens from token_at_offset by returning the ancestors with the smaller first nodes first
737 // See algo::ancestors_at_offset, which uses the same approach
738 .kmerge_by(|left, right| {
740 .map(|node| node.text_range().len())
741 .lt(right.clone().map(|node| node.text_range().len()))
745 fn original_range(&self, node: &SyntaxNode) -> FileRange {
746 let node = self.find_file(node);
747 node.original_file_range(self.db.upcast())
750 fn original_range_opt(&self, node: &SyntaxNode) -> Option<FileRange> {
751 let node = self.find_file(node);
752 node.original_file_range_opt(self.db.upcast())
755 fn original_ast_node<N: AstNode>(&self, node: N) -> Option<N> {
756 self.wrap_node_infile(node).original_ast_node(self.db.upcast()).map(|it| it.value)
759 fn diagnostics_display_range(&self, src: InFile<SyntaxNodePtr>) -> FileRange {
760 let root = self.parse_or_expand(src.file_id).unwrap();
761 let node = src.map(|it| it.to_node(&root));
762 node.as_ref().original_file_range(self.db.upcast())
765 fn token_ancestors_with_macros(
768 ) -> impl Iterator<Item = SyntaxNode> + Clone + '_ {
769 token.parent().into_iter().flat_map(move |parent| self.ancestors_with_macros(parent))
772 fn ancestors_with_macros(
775 ) -> impl Iterator<Item = SyntaxNode> + Clone + '_ {
776 let node = self.find_file(&node);
777 let db = self.db.upcast();
778 iter::successors(Some(node.cloned()), move |&InFile { file_id, ref value }| {
779 match value.parent() {
780 Some(parent) => Some(InFile::new(file_id, parent)),
782 self.cache(value.clone(), file_id);
783 file_id.call_node(db)
790 fn ancestors_at_offset_with_macros(
794 ) -> impl Iterator<Item = SyntaxNode> + '_ {
795 node.token_at_offset(offset)
796 .map(|token| self.token_ancestors_with_macros(token))
797 .kmerge_by(|node1, node2| node1.text_range().len() < node2.text_range().len())
800 fn resolve_lifetime_param(&self, lifetime: &ast::Lifetime) -> Option<LifetimeParam> {
801 let text = lifetime.text();
802 let lifetime_param = lifetime.syntax().ancestors().find_map(|syn| {
803 let gpl = ast::AnyHasGenericParams::cast(syn)?.generic_param_list()?;
804 gpl.lifetime_params()
805 .find(|tp| tp.lifetime().as_ref().map(|lt| lt.text()).as_ref() == Some(&text))
807 let src = self.wrap_node_infile(lifetime_param);
808 ToDef::to_def(self, src)
811 fn resolve_label(&self, lifetime: &ast::Lifetime) -> Option<Label> {
812 let text = lifetime.text();
813 let label = lifetime.syntax().ancestors().find_map(|syn| {
814 let label = match_ast! {
816 ast::ForExpr(it) => it.label(),
817 ast::WhileExpr(it) => it.label(),
818 ast::LoopExpr(it) => it.label(),
819 ast::BlockExpr(it) => it.label(),
825 .and_then(|lt| lt.lifetime_ident_token())
826 .map_or(false, |lt| lt.text() == text)
829 let src = self.wrap_node_infile(label);
830 ToDef::to_def(self, src)
833 fn resolve_type(&self, ty: &ast::Type) -> Option<Type> {
834 let scope = self.scope(ty.syntax());
835 let ctx = body::LowerCtx::new(self.db.upcast(), scope.file_id);
836 let ty = hir_ty::TyLoweringContext::new(self.db, &scope.resolver)
837 .lower_ty(&crate::TypeRef::from_ast(&ctx, ty.clone()));
838 Type::new_with_resolver(self.db, &scope.resolver, ty)
841 fn type_of_expr(&self, expr: &ast::Expr) -> Option<TypeInfo> {
842 self.analyze(expr.syntax())
843 .type_of_expr(self.db, expr)
844 .map(|(ty, coerced)| TypeInfo { original: ty, adjusted: coerced })
847 fn type_of_pat(&self, pat: &ast::Pat) -> Option<TypeInfo> {
848 self.analyze(pat.syntax())
849 .type_of_pat(self.db, pat)
850 .map(|(ty, coerced)| TypeInfo { original: ty, adjusted: coerced })
853 fn type_of_self(&self, param: &ast::SelfParam) -> Option<Type> {
854 self.analyze(param.syntax()).type_of_self(self.db, param)
857 fn resolve_method_call(&self, call: &ast::MethodCallExpr) -> Option<FunctionId> {
858 self.analyze(call.syntax()).resolve_method_call(self.db, call).map(|(id, _)| id)
861 fn resolve_method_call_as_callable(&self, call: &ast::MethodCallExpr) -> Option<Callable> {
862 let (func, subst) = self.analyze(call.syntax()).resolve_method_call(self.db, call)?;
863 let ty = self.db.value_ty(func.into()).substitute(Interner, &subst);
864 let resolver = self.analyze(call.syntax()).resolver;
865 let ty = Type::new_with_resolver(self.db, &resolver, ty)?;
866 let mut res = ty.as_callable(self.db)?;
867 res.is_bound_method = true;
871 fn resolve_field(&self, field: &ast::FieldExpr) -> Option<Field> {
872 self.analyze(field.syntax()).resolve_field(self.db, field)
875 fn resolve_record_field(
877 field: &ast::RecordExprField,
878 ) -> Option<(Field, Option<Local>, Type)> {
879 self.analyze(field.syntax()).resolve_record_field(self.db, field)
882 fn resolve_record_pat_field(&self, field: &ast::RecordPatField) -> Option<Field> {
883 self.analyze(field.syntax()).resolve_record_pat_field(self.db, field)
886 fn resolve_macro_call(&self, macro_call: &ast::MacroCall) -> Option<MacroDef> {
887 let sa = self.analyze(macro_call.syntax());
888 let macro_call = self.find_file(macro_call.syntax()).with_value(macro_call);
889 sa.resolve_macro_call(self.db, macro_call)
892 fn resolve_attr_macro_call(&self, item: &ast::Item) -> Option<MacroDef> {
893 let item_in_file = self.wrap_node_infile(item.clone());
894 let macro_call_id = self.with_ctx(|ctx| ctx.item_to_macro_call(item_in_file))?;
895 Some(MacroDef { id: self.db.lookup_intern_macro_call(macro_call_id).def })
898 fn resolve_path(&self, path: &ast::Path) -> Option<PathResolution> {
899 self.analyze(path.syntax()).resolve_path(self.db, path)
902 fn resolve_extern_crate(&self, extern_crate: &ast::ExternCrate) -> Option<Crate> {
903 let krate = self.scope(extern_crate.syntax()).krate()?;
904 krate.dependencies(self.db).into_iter().find_map(|dep| {
905 if dep.name == extern_crate.name_ref()?.as_name() {
913 fn resolve_variant(&self, record_lit: ast::RecordExpr) -> Option<VariantId> {
914 self.analyze(record_lit.syntax()).resolve_variant(self.db, record_lit)
917 fn resolve_bind_pat_to_const(&self, pat: &ast::IdentPat) -> Option<ModuleDef> {
918 self.analyze(pat.syntax()).resolve_bind_pat_to_const(self.db, pat)
921 fn record_literal_missing_fields(&self, literal: &ast::RecordExpr) -> Vec<(Field, Type)> {
922 self.analyze(literal.syntax())
923 .record_literal_missing_fields(self.db, literal)
927 fn record_pattern_missing_fields(&self, pattern: &ast::RecordPat) -> Vec<(Field, Type)> {
928 self.analyze(pattern.syntax())
929 .record_pattern_missing_fields(self.db, pattern)
933 fn with_ctx<F: FnOnce(&mut SourceToDefCtx) -> T, T>(&self, f: F) -> T {
934 let mut cache = self.s2d_cache.borrow_mut();
935 let mut ctx = SourceToDefCtx { db: self.db, cache: &mut *cache };
939 fn to_module_def(&self, file: FileId) -> impl Iterator<Item = Module> {
940 self.with_ctx(|ctx| ctx.file_to_def(file)).into_iter().map(Module::from)
943 fn scope(&self, node: &SyntaxNode) -> SemanticsScope<'db> {
944 let SourceAnalyzer { file_id, resolver, .. } = self.analyze_no_infer(node);
945 SemanticsScope { db: self.db, file_id, resolver }
948 fn scope_at_offset(&self, node: &SyntaxNode, offset: TextSize) -> SemanticsScope<'db> {
949 let SourceAnalyzer { file_id, resolver, .. } =
950 self.analyze_with_offset_no_infer(node, offset);
951 SemanticsScope { db: self.db, file_id, resolver }
954 fn scope_for_def(&self, def: Trait) -> SemanticsScope<'db> {
955 let file_id = self.db.lookup_intern_trait(def.id).id.file_id();
956 let resolver = def.id.resolver(self.db.upcast());
957 SemanticsScope { db: self.db, file_id, resolver }
960 fn source<Def: HasSource>(&self, def: Def) -> Option<InFile<Def::Ast>>
964 let res = def.source(self.db)?;
965 self.cache(find_root(res.value.syntax()), res.file_id);
969 fn analyze(&self, node: &SyntaxNode) -> SourceAnalyzer {
970 self.analyze_impl(node, None, true)
973 fn analyze_no_infer(&self, node: &SyntaxNode) -> SourceAnalyzer {
974 self.analyze_impl(node, None, false)
977 fn analyze_with_offset_no_infer(&self, node: &SyntaxNode, offset: TextSize) -> SourceAnalyzer {
978 self.analyze_impl(node, Some(offset), false)
984 offset: Option<TextSize>,
986 ) -> SourceAnalyzer {
987 let _p = profile::span("Semantics::analyze_impl");
988 let node = self.find_file(node);
990 let container = match self.with_ctx(|ctx| ctx.find_container(node)) {
992 None => return SourceAnalyzer::new_for_resolver(Resolver::default(), node),
995 let resolver = match container {
996 ChildContainer::DefWithBodyId(def) => {
997 return if infer_body {
998 SourceAnalyzer::new_for_body(self.db, def, node, offset)
1000 SourceAnalyzer::new_for_body_no_infer(self.db, def, node, offset)
1003 ChildContainer::TraitId(it) => it.resolver(self.db.upcast()),
1004 ChildContainer::ImplId(it) => it.resolver(self.db.upcast()),
1005 ChildContainer::ModuleId(it) => it.resolver(self.db.upcast()),
1006 ChildContainer::EnumId(it) => it.resolver(self.db.upcast()),
1007 ChildContainer::VariantId(it) => it.resolver(self.db.upcast()),
1008 ChildContainer::TypeAliasId(it) => it.resolver(self.db.upcast()),
1009 ChildContainer::GenericDefId(it) => it.resolver(self.db.upcast()),
1011 SourceAnalyzer::new_for_resolver(resolver, node)
1014 fn cache(&self, root_node: SyntaxNode, file_id: HirFileId) {
1015 assert!(root_node.parent().is_none());
1016 let mut cache = self.cache.borrow_mut();
1017 let prev = cache.insert(root_node, file_id);
1018 assert!(prev == None || prev == Some(file_id))
1021 fn assert_contains_node(&self, node: &SyntaxNode) {
1022 self.find_file(node);
1025 fn lookup(&self, root_node: &SyntaxNode) -> Option<HirFileId> {
1026 let cache = self.cache.borrow();
1027 cache.get(root_node).copied()
1030 fn wrap_node_infile<N: AstNode>(&self, node: N) -> InFile<N> {
1031 let InFile { file_id, .. } = self.find_file(node.syntax());
1032 InFile::new(file_id, node)
1035 fn find_file<'node>(&self, node: &'node SyntaxNode) -> InFile<&'node SyntaxNode> {
1036 let root_node = find_root(node);
1037 let file_id = self.lookup(&root_node).unwrap_or_else(|| {
1039 "\n\nFailed to lookup {:?} in this Semantics.\n\
1040 Make sure to use only query nodes, derived from this instance of Semantics.\n\
1042 known nodes: {}\n\n",
1048 .map(|it| format!("{:?}", it))
1049 .collect::<Vec<_>>()
1053 InFile::new(file_id, node)
1056 fn is_unsafe_method_call(&self, method_call_expr: &ast::MethodCallExpr) -> bool {
1060 let field_expr = match expr {
1061 ast::Expr::FieldExpr(field_expr) => field_expr,
1064 let ty = self.type_of_expr(&field_expr.expr()?)?.original;
1065 if !ty.is_packed(self.db) {
1069 let func = self.resolve_method_call(method_call_expr).map(Function::from)?;
1070 let res = match func.self_param(self.db)?.access(self.db) {
1071 Access::Shared | Access::Exclusive => true,
1072 Access::Owned => false,
1079 fn is_unsafe_ref_expr(&self, ref_expr: &ast::RefExpr) -> bool {
1083 let field_expr = match expr {
1084 ast::Expr::FieldExpr(field_expr) => field_expr,
1087 let expr = field_expr.expr()?;
1088 self.type_of_expr(&expr)
1090 // Binding a reference to a packed type is possibly unsafe.
1091 .map(|ty| ty.original.is_packed(self.db))
1094 // FIXME This needs layout computation to be correct. It will highlight
1095 // more than it should with the current implementation.
1098 fn is_unsafe_ident_pat(&self, ident_pat: &ast::IdentPat) -> bool {
1099 if ident_pat.ref_token().is_none() {
1106 .and_then(|parent| {
1107 // `IdentPat` can live under `RecordPat` directly under `RecordPatField` or
1108 // `RecordPatFieldList`. `RecordPatField` also lives under `RecordPatFieldList`,
1109 // so this tries to lookup the `IdentPat` anywhere along that structure to the
1110 // `RecordPat` so we can get the containing type.
1111 let record_pat = ast::RecordPatField::cast(parent.clone())
1112 .and_then(|record_pat| record_pat.syntax().parent())
1113 .or_else(|| Some(parent.clone()))
1114 .and_then(|parent| {
1115 ast::RecordPatFieldList::cast(parent)?
1118 .and_then(ast::RecordPat::cast)
1121 // If this doesn't match a `RecordPat`, fallback to a `LetStmt` to see if
1122 // this is initialized from a `FieldExpr`.
1123 if let Some(record_pat) = record_pat {
1124 self.type_of_pat(&ast::Pat::RecordPat(record_pat))
1125 } else if let Some(let_stmt) = ast::LetStmt::cast(parent) {
1126 let field_expr = match let_stmt.initializer()? {
1127 ast::Expr::FieldExpr(field_expr) => field_expr,
1131 self.type_of_expr(&field_expr.expr()?)
1136 // Binding a reference to a packed type is possibly unsafe.
1137 .map(|ty| ty.original.is_packed(self.db))
1142 pub trait ToDef: AstNode + Clone {
1145 fn to_def(sema: &SemanticsImpl, src: InFile<Self>) -> Option<Self::Def>;
1148 macro_rules! to_def_impls {
1149 ($(($def:path, $ast:path, $meth:ident)),* ,) => {$(
1150 impl ToDef for $ast {
1152 fn to_def(sema: &SemanticsImpl, src: InFile<Self>) -> Option<Self::Def> {
1153 sema.with_ctx(|ctx| ctx.$meth(src)).map(<$def>::from)
1160 (crate::Module, ast::Module, module_to_def),
1161 (crate::Module, ast::SourceFile, source_file_to_def),
1162 (crate::Struct, ast::Struct, struct_to_def),
1163 (crate::Enum, ast::Enum, enum_to_def),
1164 (crate::Union, ast::Union, union_to_def),
1165 (crate::Trait, ast::Trait, trait_to_def),
1166 (crate::Impl, ast::Impl, impl_to_def),
1167 (crate::TypeAlias, ast::TypeAlias, type_alias_to_def),
1168 (crate::Const, ast::Const, const_to_def),
1169 (crate::Static, ast::Static, static_to_def),
1170 (crate::Function, ast::Fn, fn_to_def),
1171 (crate::Field, ast::RecordField, record_field_to_def),
1172 (crate::Field, ast::TupleField, tuple_field_to_def),
1173 (crate::Variant, ast::Variant, enum_variant_to_def),
1174 (crate::TypeParam, ast::TypeParam, type_param_to_def),
1175 (crate::LifetimeParam, ast::LifetimeParam, lifetime_param_to_def),
1176 (crate::ConstParam, ast::ConstParam, const_param_to_def),
1177 (crate::GenericParam, ast::GenericParam, generic_param_to_def),
1178 (crate::MacroDef, ast::Macro, macro_to_def),
1179 (crate::Local, ast::IdentPat, bind_pat_to_def),
1180 (crate::Local, ast::SelfParam, self_param_to_def),
1181 (crate::Label, ast::Label, label_to_def),
1182 (crate::Adt, ast::Adt, adt_to_def),
1185 fn find_root(node: &SyntaxNode) -> SyntaxNode {
1186 node.ancestors().last().unwrap()
1189 /// `SemanticScope` encapsulates the notion of a scope (the set of visible
1190 /// names) at a particular program point.
1192 /// It is a bit tricky, as scopes do not really exist inside the compiler.
1193 /// Rather, the compiler directly computes for each reference the definition it
1194 /// refers to. It might transiently compute the explicit scope map while doing
1195 /// so, but, generally, this is not something left after the analysis.
1197 /// However, we do very much need explicit scopes for IDE purposes --
1198 /// completion, at its core, lists the contents of the current scope. The notion
1199 /// of scope is also useful to answer questions like "what would be the meaning
1200 /// of this piece of code if we inserted it into this position?".
1202 /// So `SemanticsScope` is constructed from a specific program point (a syntax
1203 /// node or just a raw offset) and provides access to the set of visible names
1204 /// on a somewhat best-effort basis.
1206 /// Note that if you are wondering "what does this specific existing name mean?",
1207 /// you'd better use the `resolve_` family of methods.
1209 pub struct SemanticsScope<'a> {
1210 pub db: &'a dyn HirDatabase,
1215 impl<'a> SemanticsScope<'a> {
1216 pub fn module(&self) -> Option<Module> {
1217 Some(Module { id: self.resolver.module()? })
1220 pub fn krate(&self) -> Option<Crate> {
1221 Some(Crate { id: self.resolver.krate()? })
1224 /// Note: `FxHashSet<TraitId>` should be treated as an opaque type, passed into `Type
1225 pub fn visible_traits(&self) -> FxHashSet<TraitId> {
1226 let resolver = &self.resolver;
1227 resolver.traits_in_scope(self.db.upcast())
1230 pub fn process_all_names(&self, f: &mut dyn FnMut(Name, ScopeDef)) {
1231 let scope = self.resolver.names_in_scope(self.db.upcast());
1232 for (name, entries) in scope {
1233 for entry in entries {
1234 let def = match entry {
1235 resolver::ScopeDef::ModuleDef(it) => ScopeDef::ModuleDef(it.into()),
1236 resolver::ScopeDef::MacroDef(it) => ScopeDef::MacroDef(it.into()),
1237 resolver::ScopeDef::Unknown => ScopeDef::Unknown,
1238 resolver::ScopeDef::ImplSelfType(it) => ScopeDef::ImplSelfType(it.into()),
1239 resolver::ScopeDef::AdtSelfType(it) => ScopeDef::AdtSelfType(it.into()),
1240 resolver::ScopeDef::GenericParam(id) => ScopeDef::GenericParam(id.into()),
1241 resolver::ScopeDef::Local(pat_id) => {
1242 let parent = self.resolver.body_owner().unwrap();
1243 ScopeDef::Local(Local { parent, pat_id })
1245 resolver::ScopeDef::Label(label_id) => {
1246 let parent = self.resolver.body_owner().unwrap();
1247 ScopeDef::Label(Label { parent, label_id })
1250 f(name.clone(), def)
1255 /// Resolve a path as-if it was written at the given scope. This is
1256 /// necessary a heuristic, as it doesn't take hygiene into account.
1257 pub fn speculative_resolve(&self, path: &ast::Path) -> Option<PathResolution> {
1258 let ctx = body::LowerCtx::new(self.db.upcast(), self.file_id);
1259 let path = Path::from_src(path.clone(), &ctx)?;
1260 resolve_hir_path(self.db, &self.resolver, &path)
1263 /// Iterates over associated types that may be specified after the given path (using
1264 /// `Ty::Assoc` syntax).
1265 pub fn assoc_type_shorthand_candidates<R>(
1267 resolution: &PathResolution,
1268 mut cb: impl FnMut(&Name, TypeAlias) -> Option<R>,
1270 let def = self.resolver.generic_def()?;
1271 hir_ty::associated_type_shorthand_candidates(
1274 resolution.in_type_ns()?,
1275 |name, _, id| cb(name, id.into()),