rust-analyzer/crates/ide_completion/src/context.rs

970 lines
34 KiB
Rust
Raw Normal View History

//! See `CompletionContext` structure.
2020-09-02 18:38:08 +00:00
use hir::{Local, ScopeDef, Semantics, SemanticsScope, Type};
2021-05-26 19:09:27 +00:00
use ide_db::{
base_db::{FilePosition, SourceDatabase},
call_info::ActiveParameter,
RootDatabase,
};
2020-08-12 16:26:51 +00:00
use syntax::{
algo::find_node_at_offset,
ast::{self, NameOrNameRef, NameOwner},
match_ast, AstNode, NodeOrToken,
2021-05-26 19:09:27 +00:00
SyntaxKind::{self, *},
SyntaxNode, SyntaxToken, TextRange, TextSize, T,
2019-01-08 19:33:36 +00:00
};
2020-08-12 15:03:06 +00:00
use text_edit::Indel;
2019-01-08 19:33:36 +00:00
2020-08-13 16:06:14 +00:00
use crate::{
patterns::{
2021-05-26 19:09:27 +00:00
for_is_prev2, has_bind_pat_parent, has_block_expr_parent, has_field_list_parent,
has_impl_as_prev_sibling, has_impl_parent, has_item_list_or_source_file_parent,
has_ref_parent, has_trait_as_prev_sibling, has_trait_parent, inside_impl_trait_block,
is_in_loop_body, is_match_arm, previous_token,
2020-08-13 16:06:14 +00:00
},
CompletionConfig,
2020-06-11 12:16:35 +00:00
};
2019-01-08 19:33:36 +00:00
/// `CompletionContext` is created early during completion to figure out, where
/// exactly is the cursor, syntax-wise.
#[derive(Debug)]
pub(crate) struct CompletionContext<'a> {
pub(super) sema: Semantics<'a, RootDatabase>,
2020-07-10 23:26:24 +00:00
pub(super) scope: SemanticsScope<'a>,
2020-02-06 11:52:32 +00:00
pub(super) db: &'a RootDatabase,
2020-03-31 14:02:55 +00:00
pub(super) config: &'a CompletionConfig,
2020-08-11 06:54:33 +00:00
pub(super) position: FilePosition,
2020-03-07 14:27:03 +00:00
/// The token before the cursor, in the original file.
pub(super) original_token: SyntaxToken,
/// The token before the cursor, in the macro-expanded file.
2019-07-19 09:56:47 +00:00
pub(super) token: SyntaxToken,
pub(super) krate: Option<hir::Crate>,
pub(super) expected_name: Option<NameOrNameRef>,
pub(super) expected_type: Option<Type>,
2019-12-21 14:17:10 +00:00
pub(super) name_ref_syntax: Option<ast::NameRef>,
2021-03-20 21:43:42 +00:00
pub(super) lifetime_syntax: Option<ast::Lifetime>,
pub(super) lifetime_param_syntax: Option<ast::LifetimeParam>,
2020-07-30 12:51:08 +00:00
pub(super) function_syntax: Option<ast::Fn>,
2020-07-30 12:12:04 +00:00
pub(super) use_item_syntax: Option<ast::Use>,
2020-07-30 14:21:30 +00:00
pub(super) record_lit_syntax: Option<ast::RecordExpr>,
pub(super) record_pat_syntax: Option<ast::RecordPat>,
2020-07-30 14:21:30 +00:00
pub(super) record_field_syntax: Option<ast::RecordExprField>,
2020-07-30 16:28:28 +00:00
pub(super) impl_def: Option<ast::Impl>,
2021-03-20 21:43:42 +00:00
pub(super) lifetime_allowed: bool,
2020-05-14 13:15:52 +00:00
/// FIXME: `ActiveParameter` is string-based, which is very very wrong
2020-04-23 23:46:00 +00:00
pub(super) active_parameter: Option<ActiveParameter>,
2019-01-08 19:33:36 +00:00
pub(super) is_param: bool,
2021-03-21 00:00:09 +00:00
pub(super) is_label_ref: bool,
2019-02-24 20:49:47 +00:00
/// If a name-binding or reference to a const in a pattern.
/// Irrefutable patterns (like let) are excluded.
pub(super) is_pat_binding_or_const: bool,
2020-12-20 17:19:23 +00:00
pub(super) is_irrefutable_pat_binding: bool,
2019-01-23 05:21:29 +00:00
/// A single-indent path, like `foo`. `::foo` should not be considered a trivial path.
2019-01-08 19:33:36 +00:00
pub(super) is_trivial_path: bool,
/// If not a trivial path, the prefix (qualifier).
2020-08-13 20:41:55 +00:00
pub(super) path_qual: Option<ast::Path>,
2019-01-08 19:33:36 +00:00
pub(super) after_if: bool,
/// `true` if we are a statement or a last expr in the block.
pub(super) can_be_stmt: bool,
2020-07-10 15:41:43 +00:00
/// `true` if we expect an expression at the cursor position.
2020-07-10 15:56:55 +00:00
pub(super) is_expr: bool,
2019-01-08 19:33:36 +00:00
/// Something is typed at the "top" level, in module or impl/trait.
pub(super) is_new_item: bool,
2021-01-06 20:15:48 +00:00
/// The receiver if this is a field or method access, i.e. writing something.$0
2019-07-19 09:56:47 +00:00
pub(super) dot_receiver: Option<ast::Expr>,
pub(super) dot_receiver_is_ambiguous_float_literal: bool,
/// If this is a call (method or function) in particular, i.e. the () are already there.
pub(super) is_call: bool,
2020-07-14 11:51:43 +00:00
/// Like `is_call`, but for tuple patterns.
pub(super) is_pattern_call: bool,
/// If this is a macro call, i.e. the () are already there.
pub(super) is_macro_call: bool,
2019-10-08 18:14:52 +00:00
pub(super) is_path_type: bool,
pub(super) has_type_args: bool,
2020-05-01 00:46:17 +00:00
pub(super) attribute_under_caret: Option<ast::Attr>,
2021-05-26 19:09:27 +00:00
pub(super) locals: Vec<(String, Local)>,
2020-09-07 23:34:11 +00:00
pub(super) mod_declaration_under_caret: Option<ast::Module>,
2021-05-26 19:09:27 +00:00
pub(super) has_trait_parent: bool,
pub(super) has_impl_parent: bool,
// keyword patterns
pub(super) previous_token: Option<SyntaxToken>,
2020-06-11 12:16:35 +00:00
pub(super) block_expr_parent: bool,
pub(super) bind_pat_parent: bool,
pub(super) ref_pat_parent: bool,
pub(super) in_loop_body: bool,
2020-08-25 15:20:29 +00:00
pub(super) has_field_list_parent: bool,
2020-06-11 21:25:58 +00:00
pub(super) trait_as_prev_sibling: bool,
pub(super) impl_as_prev_sibling: bool,
pub(super) is_match_arm: bool,
pub(super) has_item_list_or_source_file_parent: bool,
pub(super) incomplete_let: bool,
2021-05-26 19:09:27 +00:00
no_completion_required: bool,
2019-01-08 19:33:36 +00:00
}
impl<'a> CompletionContext<'a> {
pub(super) fn new(
2020-02-06 11:52:32 +00:00
db: &'a RootDatabase,
2019-01-08 19:33:36 +00:00
position: FilePosition,
2020-03-31 14:02:55 +00:00
config: &'a CompletionConfig,
) -> Option<CompletionContext<'a>> {
let sema = Semantics::new(db);
let original_file = sema.parse(position.file_id);
// Insert a fake ident to get a valid parse tree. We will use this file
// to determine context, though the original_file will be used for
// actual completion.
let file_with_fake_ident = {
let parse = db.parse(position.file_id);
2020-05-05 21:15:49 +00:00
let edit = Indel::insert(position.offset, "intellijRulezz".to_string());
parse.reparse(&edit).tree()
};
2020-03-07 14:27:03 +00:00
let fake_ident_token =
file_with_fake_ident.syntax().token_at_offset(position.offset).right_biased().unwrap();
let krate = sema.to_module_def(position.file_id).map(|m| m.krate());
2020-03-07 14:27:03 +00:00
let original_token =
original_file.syntax().token_at_offset(position.offset).left_biased()?;
let token = sema.descend_into_macros(original_token.clone());
let scope = sema.scope_at_offset(&token, position.offset);
2020-09-02 18:38:08 +00:00
let mut locals = vec![];
scope.process_all_names(&mut |name, scope| {
if let ScopeDef::Local(local) = scope {
locals.push((name.to_string(), local));
}
});
2019-01-08 19:33:36 +00:00
let mut ctx = CompletionContext {
sema,
2020-07-10 23:26:24 +00:00
scope,
2019-01-08 19:33:36 +00:00
db,
2020-03-31 14:02:55 +00:00
config,
position,
2020-03-07 14:27:03 +00:00
original_token,
2019-03-30 10:25:53 +00:00
token,
krate,
2021-03-20 21:43:42 +00:00
lifetime_allowed: false,
expected_name: None,
expected_type: None,
2019-12-21 14:17:10 +00:00
name_ref_syntax: None,
2021-03-20 21:43:42 +00:00
lifetime_syntax: None,
lifetime_param_syntax: None,
2019-01-08 19:33:36 +00:00
function_syntax: None,
use_item_syntax: None,
2019-08-23 12:55:21 +00:00
record_lit_syntax: None,
record_pat_syntax: None,
record_field_syntax: None,
2020-02-29 20:24:40 +00:00
impl_def: None,
2020-04-23 23:46:00 +00:00
active_parameter: ActiveParameter::at(db, position),
2021-03-21 00:00:09 +00:00
is_label_ref: false,
2019-01-08 19:33:36 +00:00
is_param: false,
is_pat_binding_or_const: false,
2020-12-20 17:19:23 +00:00
is_irrefutable_pat_binding: false,
2019-01-08 19:33:36 +00:00
is_trivial_path: false,
2020-08-13 20:41:55 +00:00
path_qual: None,
2019-01-08 19:33:36 +00:00
after_if: false,
can_be_stmt: false,
2020-07-10 15:56:55 +00:00
is_expr: false,
2019-01-08 19:33:36 +00:00
is_new_item: false,
dot_receiver: None,
dot_receiver_is_ambiguous_float_literal: false,
is_call: false,
2020-07-14 11:51:43 +00:00
is_pattern_call: false,
is_macro_call: false,
2019-10-08 18:14:52 +00:00
is_path_type: false,
has_type_args: false,
2020-05-01 00:46:17 +00:00
attribute_under_caret: None,
2020-09-07 23:34:11 +00:00
mod_declaration_under_caret: None,
2021-05-26 19:09:27 +00:00
previous_token: None,
2020-06-11 12:16:35 +00:00
block_expr_parent: false,
bind_pat_parent: false,
ref_pat_parent: false,
in_loop_body: false,
has_trait_parent: false,
has_impl_parent: false,
2020-08-25 15:20:29 +00:00
has_field_list_parent: false,
2020-06-11 21:25:58 +00:00
trait_as_prev_sibling: false,
impl_as_prev_sibling: false,
is_match_arm: false,
has_item_list_or_source_file_parent: false,
2021-05-26 19:09:27 +00:00
no_completion_required: false,
incomplete_let: false,
2020-09-02 18:38:08 +00:00
locals,
2019-01-08 19:33:36 +00:00
};
2020-03-07 14:27:03 +00:00
let mut original_file = original_file.syntax().clone();
let mut speculative_file = file_with_fake_ident.syntax().clone();
2020-03-07 14:27:03 +00:00
let mut offset = position.offset;
let mut fake_ident_token = fake_ident_token;
// Are we inside a macro call?
while let (Some(actual_macro_call), Some(macro_call_with_fake_ident)) = (
find_node_at_offset::<ast::MacroCall>(&original_file, offset),
find_node_at_offset::<ast::MacroCall>(&speculative_file, offset),
2020-03-07 14:27:03 +00:00
) {
2020-03-07 16:47:49 +00:00
if actual_macro_call.path().as_ref().map(|s| s.syntax().text())
!= macro_call_with_fake_ident.path().as_ref().map(|s| s.syntax().text())
{
break;
}
let speculative_args = match macro_call_with_fake_ident.token_tree() {
Some(tt) => tt,
None => break,
};
if let (Some(actual_expansion), Some(speculative_expansion)) = (
2020-03-07 14:27:03 +00:00
ctx.sema.expand(&actual_macro_call),
2020-08-14 13:23:27 +00:00
ctx.sema.speculative_expand(
2020-03-07 14:27:03 +00:00
&actual_macro_call,
&speculative_args,
2020-03-07 14:27:03 +00:00
fake_ident_token,
),
) {
let new_offset = speculative_expansion.1.text_range().start();
2020-03-15 10:17:13 +00:00
if new_offset > actual_expansion.text_range().end() {
2020-03-07 16:47:49 +00:00
break;
}
2020-03-07 14:27:03 +00:00
original_file = actual_expansion;
speculative_file = speculative_expansion.0;
fake_ident_token = speculative_expansion.1;
2020-03-07 16:47:49 +00:00
offset = new_offset;
2020-03-07 14:27:03 +00:00
} else {
break;
}
}
ctx.fill_keyword_patterns(&speculative_file, offset);
ctx.fill(&original_file, speculative_file, offset);
Some(ctx)
2019-01-08 19:33:36 +00:00
}
2020-10-12 07:59:15 +00:00
/// Checks whether completions in that particular case don't make much sense.
/// Examples:
2021-01-06 20:15:48 +00:00
/// - `fn $0` -- we expect function name, it's unlikely that "hint" will be helpful.
/// Exception for this case is `impl Trait for Foo`, where we would like to hint trait method names.
2021-01-06 20:15:48 +00:00
/// - `for _ i$0` -- obviously, it'll be "in" keyword.
2020-10-12 07:59:15 +00:00
pub(crate) fn no_completion_required(&self) -> bool {
2021-05-26 19:09:27 +00:00
self.no_completion_required
2020-10-12 07:59:15 +00:00
}
/// The range of the identifier that is being completed.
pub(crate) fn source_range(&self) -> TextRange {
2020-03-07 14:27:03 +00:00
// check kind of macro-expanded token, but use range of original token
let kind = self.token.kind();
2021-03-20 21:43:42 +00:00
if kind == IDENT || kind == LIFETIME_IDENT || kind == UNDERSCORE || kind.is_keyword() {
2021-03-08 20:19:44 +00:00
cov_mark::hit!(completes_if_prefix_is_keyword);
self.original_token.text_range()
} else if kind == CHAR {
// assume we are completing a lifetime but the user has only typed the '
cov_mark::hit!(completes_if_lifetime_without_idents);
TextRange::at(self.original_token.text_range().start(), TextSize::from(1))
} else {
2020-08-11 06:54:33 +00:00
TextRange::empty(self.position.offset)
2019-01-20 05:34:16 +00:00
}
}
2021-05-26 19:09:27 +00:00
pub(crate) fn previous_token_is(&self, kind: SyntaxKind) -> bool {
self.previous_token.as_ref().map_or(false, |tok| tok.kind() == kind)
}
2020-06-11 12:16:35 +00:00
fn fill_keyword_patterns(&mut self, file_with_fake_ident: &SyntaxNode, offset: TextSize) {
let fake_ident_token = file_with_fake_ident.token_at_offset(offset).right_biased().unwrap();
2020-07-19 18:26:24 +00:00
let syntax_element = NodeOrToken::Token(fake_ident_token);
2021-05-26 19:09:27 +00:00
self.previous_token = previous_token(syntax_element.clone());
2020-06-11 12:16:35 +00:00
self.block_expr_parent = has_block_expr_parent(syntax_element.clone());
self.bind_pat_parent = has_bind_pat_parent(syntax_element.clone());
self.ref_pat_parent = has_ref_parent(syntax_element.clone());
2020-06-11 12:16:35 +00:00
self.in_loop_body = is_in_loop_body(syntax_element.clone());
self.has_trait_parent = has_trait_parent(syntax_element.clone());
self.has_impl_parent = has_impl_parent(syntax_element.clone());
2020-08-25 15:20:29 +00:00
self.has_field_list_parent = has_field_list_parent(syntax_element.clone());
2020-06-11 21:25:58 +00:00
self.impl_as_prev_sibling = has_impl_as_prev_sibling(syntax_element.clone());
self.trait_as_prev_sibling = has_trait_as_prev_sibling(syntax_element.clone());
self.is_match_arm = is_match_arm(syntax_element.clone());
2021-05-26 19:09:27 +00:00
self.has_item_list_or_source_file_parent =
2020-09-07 21:54:58 +00:00
has_item_list_or_source_file_parent(syntax_element.clone());
2020-09-07 23:34:11 +00:00
self.mod_declaration_under_caret =
find_node_at_offset::<ast::Module>(&file_with_fake_ident, offset)
.filter(|module| module.item_list().is_none());
self.incomplete_let =
syntax_element.ancestors().take(6).find_map(ast::LetStmt::cast).map_or(false, |it| {
it.syntax().text_range().end() == syntax_element.text_range().end()
});
2021-05-26 19:09:27 +00:00
let inside_impl_trait_block = inside_impl_trait_block(syntax_element.clone());
let fn_is_prev = self.previous_token_is(T![fn]);
let for_is_prev2 = for_is_prev2(syntax_element.clone());
self.no_completion_required = (fn_is_prev && !inside_impl_trait_block) || for_is_prev2;
2020-06-11 12:16:35 +00:00
}
fn fill_impl_def(&mut self) {
self.impl_def = self
.sema
.token_ancestors_with_macros(self.token.clone())
.take_while(|it| it.kind() != SOURCE_FILE && it.kind() != MODULE)
.find_map(ast::Impl::cast);
}
fn expected_type_and_name(&self) -> (Option<Type>, Option<NameOrNameRef>) {
let mut node = match self.token.parent() {
Some(it) => it,
None => return (None, None),
};
loop {
break match_ast! {
match node {
ast::LetStmt(it) => {
cov_mark::hit!(expected_type_let_with_leading_char);
cov_mark::hit!(expected_type_let_without_leading_char);
let ty = it.pat()
2021-05-08 21:14:08 +00:00
.and_then(|pat| self.sema.type_of_pat(&pat))
.or_else(|| it.initializer().and_then(|it| self.sema.type_of_expr(&it)));
let name = if let Some(ast::Pat::IdentPat(ident)) = it.pat() {
ident.name().map(NameOrNameRef::Name)
} else {
None
};
(ty, name)
},
ast::ArgList(_it) => {
cov_mark::hit!(expected_type_fn_param_with_leading_char);
cov_mark::hit!(expected_type_fn_param_without_leading_char);
ActiveParameter::at_token(
&self.sema,
self.token.clone(),
).map(|ap| {
let name = ap.ident().map(NameOrNameRef::Name);
(Some(ap.ty), name)
})
.unwrap_or((None, None))
},
ast::RecordExprFieldList(_it) => {
cov_mark::hit!(expected_type_struct_field_without_leading_char);
// wouldn't try {} be nice...
(|| {
let expr_field = self.token.prev_sibling_or_token()?
2021-05-23 21:54:35 +00:00
.into_node()
.and_then(|node| ast::RecordExprField::cast(node))?;
2021-05-23 21:54:35 +00:00
let (_, _, ty) = self.sema.resolve_record_field(&expr_field)?;
Some((
2021-05-23 21:54:35 +00:00
Some(ty),
expr_field.field_name().map(NameOrNameRef::NameRef),
))
})().unwrap_or((None, None))
},
ast::RecordExprField(it) => {
cov_mark::hit!(expected_type_struct_field_with_leading_char);
(
it.expr().as_ref().and_then(|e| self.sema.type_of_expr(e)),
it.field_name().map(NameOrNameRef::NameRef),
)
},
ast::MatchExpr(it) => {
cov_mark::hit!(expected_type_match_arm_without_leading_char);
let ty = it.expr()
.and_then(|e| self.sema.type_of_expr(&e));
(ty, None)
},
ast::IfExpr(it) => {
cov_mark::hit!(expected_type_if_let_without_leading_char);
let ty = it.condition()
.and_then(|cond| cond.expr())
.and_then(|e| self.sema.type_of_expr(&e));
(ty, None)
},
ast::IdentPat(it) => {
cov_mark::hit!(expected_type_if_let_with_leading_char);
cov_mark::hit!(expected_type_match_arm_with_leading_char);
let ty = self.sema.type_of_pat(&ast::Pat::from(it));
(ty, None)
},
ast::Fn(it) => {
cov_mark::hit!(expected_type_fn_ret_with_leading_char);
cov_mark::hit!(expected_type_fn_ret_without_leading_char);
let def = self.sema.to_def(&it);
(def.map(|def| def.ret_type(self.db)), None)
},
ast::ClosureExpr(it) => {
let ty = self.sema.type_of_expr(&it.into());
ty.and_then(|ty| ty.as_callable(self.db))
.map(|c| (Some(c.return_type()), None))
.unwrap_or((None, None))
},
2021-05-06 17:12:30 +00:00
ast::Stmt(_it) => (None, None),
_ => {
match node.parent() {
Some(n) => {
node = n;
continue;
},
None => (None, None),
}
},
}
};
}
}
fn fill(
&mut self,
2020-03-07 14:27:03 +00:00
original_file: &SyntaxNode,
file_with_fake_ident: SyntaxNode,
2020-04-24 21:40:41 +00:00
offset: TextSize,
) {
let (expected_type, expected_name) = self.expected_type_and_name();
self.expected_type = expected_type;
self.expected_name = expected_name;
2020-05-01 00:46:17 +00:00
self.attribute_under_caret = find_node_at_offset(&file_with_fake_ident, offset);
2021-03-20 21:43:42 +00:00
if let Some(lifetime) = find_node_at_offset::<ast::Lifetime>(&file_with_fake_ident, offset)
{
self.classify_lifetime(original_file, lifetime, offset);
}
2019-01-08 19:33:36 +00:00
// First, let's try to complete a reference to some declaration.
2020-03-07 14:27:03 +00:00
if let Some(name_ref) = find_node_at_offset::<ast::NameRef>(&file_with_fake_ident, offset) {
2019-01-08 19:33:36 +00:00
// Special case, `trait T { fn foo(i_am_a_name_ref) {} }`.
// See RFC#1685.
if is_node::<ast::Param>(name_ref.syntax()) {
self.is_param = true;
return;
}
// FIXME: remove this (V) duplication and make the check more precise
2020-07-31 17:54:16 +00:00
if name_ref.syntax().ancestors().find_map(ast::RecordPatFieldList::cast).is_some() {
self.record_pat_syntax =
self.sema.find_node_at_offset_with_macros(&original_file, offset);
}
2020-03-07 15:48:39 +00:00
self.classify_name_ref(original_file, name_ref, offset);
2019-01-08 19:33:36 +00:00
}
// Otherwise, see if this is a declaration. We can use heuristics to
// suggest declaration names, see `CompletionKind::Magic`.
2020-03-07 14:27:03 +00:00
if let Some(name) = find_node_at_offset::<ast::Name>(&file_with_fake_ident, offset) {
2020-07-31 18:09:09 +00:00
if let Some(bind_pat) = name.syntax().ancestors().find_map(ast::IdentPat::cast) {
self.is_pat_binding_or_const = true;
2020-04-09 16:40:43 +00:00
if bind_pat.at_token().is_some()
2020-04-09 21:35:05 +00:00
|| bind_pat.ref_token().is_some()
|| bind_pat.mut_token().is_some()
2020-04-09 16:40:43 +00:00
{
self.is_pat_binding_or_const = false;
2019-02-24 20:49:47 +00:00
}
2020-07-31 17:54:16 +00:00
if bind_pat.syntax().parent().and_then(ast::RecordPatFieldList::cast).is_some() {
self.is_pat_binding_or_const = false;
}
2020-12-20 17:19:23 +00:00
if let Some(Some(pat)) = bind_pat.syntax().ancestors().find_map(|node| {
match_ast! {
match node {
ast::LetStmt(it) => Some(it.pat()),
ast::Param(it) => Some(it.pat()),
_ => None,
}
}
2020-12-20 17:19:23 +00:00
}) {
if pat.syntax().text_range().contains_range(bind_pat.syntax().text_range()) {
self.is_pat_binding_or_const = false;
self.is_irrefutable_pat_binding = true;
}
}
self.fill_impl_def();
2019-02-24 20:49:47 +00:00
}
2019-01-08 19:33:36 +00:00
if is_node::<ast::Param>(name.syntax()) {
self.is_param = true;
return;
}
// FIXME: remove this (^) duplication and make the check more precise
2020-07-31 17:54:16 +00:00
if name.syntax().ancestors().find_map(ast::RecordPatFieldList::cast).is_some() {
self.record_pat_syntax =
2020-03-07 15:50:30 +00:00
self.sema.find_node_at_offset_with_macros(&original_file, offset);
2019-07-21 11:11:45 +00:00
}
2019-01-08 19:33:36 +00:00
}
}
2019-02-24 20:49:47 +00:00
2021-03-20 21:43:42 +00:00
fn classify_lifetime(
&mut self,
original_file: &SyntaxNode,
lifetime: ast::Lifetime,
offset: TextSize,
) {
self.lifetime_syntax =
find_node_at_offset(original_file, lifetime.syntax().text_range().start());
2021-03-21 00:00:09 +00:00
if let Some(parent) = lifetime.syntax().parent() {
if parent.kind() == ERROR {
2021-03-21 00:00:09 +00:00
return;
}
match_ast! {
match parent {
ast::LifetimeParam(_it) => {
self.lifetime_allowed = true;
self.lifetime_param_syntax =
self.sema.find_node_at_offset_with_macros(original_file, offset);
},
ast::BreakExpr(_it) => self.is_label_ref = true,
ast::ContinueExpr(_it) => self.is_label_ref = true,
ast::Label(_it) => (),
_ => self.lifetime_allowed = true,
2021-03-21 00:00:09 +00:00
}
}
2021-03-20 21:43:42 +00:00
}
}
2020-03-07 15:48:39 +00:00
fn classify_name_ref(
&mut self,
original_file: &SyntaxNode,
name_ref: ast::NameRef,
2020-04-24 21:40:41 +00:00
offset: TextSize,
2020-03-07 15:48:39 +00:00
) {
2019-12-21 14:17:10 +00:00
self.name_ref_syntax =
2021-03-20 21:43:42 +00:00
find_node_at_offset(original_file, name_ref.syntax().text_range().start());
2019-07-20 09:58:27 +00:00
let name_range = name_ref.syntax().text_range();
2020-07-30 14:21:30 +00:00
if ast::RecordExprField::for_field_name(&name_ref).is_some() {
2020-03-07 14:27:03 +00:00
self.record_lit_syntax =
2021-03-20 21:43:42 +00:00
self.sema.find_node_at_offset_with_macros(original_file, offset);
2019-02-24 14:01:56 +00:00
}
self.fill_impl_def();
2020-02-08 17:28:39 +00:00
2019-07-20 09:58:27 +00:00
let top_node = name_ref
.syntax()
.ancestors()
.take_while(|it| it.text_range() == name_range)
.last()
.unwrap();
2019-01-08 19:33:36 +00:00
match top_node.parent().map(|it| it.kind()) {
Some(SOURCE_FILE) | Some(ITEM_LIST) => {
self.is_new_item = true;
return;
}
_ => (),
}
2020-03-07 14:27:03 +00:00
self.use_item_syntax =
self.sema.token_ancestors_with_macros(self.token.clone()).find_map(ast::Use::cast);
2019-01-08 19:33:36 +00:00
self.function_syntax = self
2020-03-07 14:27:03 +00:00
.sema
.token_ancestors_with_macros(self.token.clone())
2019-01-08 19:33:36 +00:00
.take_while(|it| it.kind() != SOURCE_FILE && it.kind() != MODULE)
2020-07-30 12:51:08 +00:00
.find_map(ast::Fn::cast);
2019-01-08 19:33:36 +00:00
self.record_field_syntax = self
.sema
.token_ancestors_with_macros(self.token.clone())
.take_while(|it| {
it.kind() != SOURCE_FILE && it.kind() != MODULE && it.kind() != CALL_EXPR
})
2020-07-30 14:21:30 +00:00
.find_map(ast::RecordExprField::cast);
2019-01-08 19:33:36 +00:00
let parent = match name_ref.syntax().parent() {
Some(it) => it,
None => return,
};
2019-07-19 09:56:47 +00:00
if let Some(segment) = ast::PathSegment::cast(parent.clone()) {
2019-01-08 19:33:36 +00:00
let path = segment.parent_path();
self.is_call = path
.syntax()
.parent()
.and_then(ast::PathExpr::cast)
.and_then(|it| it.syntax().parent().and_then(ast::CallExpr::cast))
.is_some();
self.is_macro_call = path.syntax().parent().and_then(ast::MacroCall::cast).is_some();
2020-07-14 11:51:43 +00:00
self.is_pattern_call =
path.syntax().parent().and_then(ast::TupleStructPat::cast).is_some();
2019-10-08 18:14:52 +00:00
self.is_path_type = path.syntax().parent().and_then(ast::PathType::cast).is_some();
2020-07-31 16:29:29 +00:00
self.has_type_args = segment.generic_arg_list().is_some();
2019-10-08 18:14:52 +00:00
2020-08-13 20:41:55 +00:00
if let Some(path) = path_or_use_tree_qualifier(&path) {
self.path_qual = path
.segment()
.and_then(|it| {
find_node_with_range::<ast::PathSegment>(
original_file,
it.syntax().text_range(),
)
})
.map(|it| it.parent_path());
return;
}
if let Some(segment) = path.segment() {
if segment.coloncolon_token().is_some() {
2019-01-08 19:33:36 +00:00
return;
}
}
2020-08-13 20:41:55 +00:00
self.is_trivial_path = true;
2019-01-08 19:33:36 +00:00
2020-08-13 20:41:55 +00:00
// Find either enclosing expr statement (thing with `;`) or a
// block. If block, check that we are the last expr.
self.can_be_stmt = name_ref
.syntax()
.ancestors()
.find_map(|node| {
if let Some(stmt) = ast::ExprStmt::cast(node.clone()) {
return Some(stmt.syntax().text_range() == name_ref.syntax().text_range());
}
if let Some(block) = ast::BlockExpr::cast(node) {
return Some(
2021-01-05 12:45:46 +00:00
block.tail_expr().map(|e| e.syntax().text_range())
2020-08-13 20:41:55 +00:00
== Some(name_ref.syntax().text_range()),
);
}
None
})
.unwrap_or(false);
self.is_expr = path.syntax().parent().and_then(ast::PathExpr::cast).is_some();
if let Some(off) = name_ref.syntax().text_range().start().checked_sub(2.into()) {
if let Some(if_expr) =
self.sema.find_node_at_offset_with_macros::<ast::IfExpr>(original_file, off)
{
if if_expr.syntax().text_range().end() < name_ref.syntax().text_range().start()
2019-01-08 19:33:36 +00:00
{
2020-08-13 20:41:55 +00:00
self.after_if = true;
2019-01-08 19:33:36 +00:00
}
}
}
}
2019-07-19 09:56:47 +00:00
if let Some(field_expr) = ast::FieldExpr::cast(parent.clone()) {
2019-01-08 19:33:36 +00:00
// The receiver comes before the point of insertion of the fake
// ident, so it should have the same range in the non-modified file
self.dot_receiver = field_expr
.expr()
2019-07-20 09:58:27 +00:00
.map(|e| e.syntax().text_range())
2020-03-07 14:27:03 +00:00
.and_then(|r| find_node_with_range(original_file, r));
2019-12-20 20:14:30 +00:00
self.dot_receiver_is_ambiguous_float_literal =
if let Some(ast::Expr::Literal(l)) = &self.dot_receiver {
match l.kind() {
ast::LiteralKind::FloatNumber { .. } => l.token().text().ends_with('.'),
_ => false,
}
} else {
false
};
2019-01-08 19:33:36 +00:00
}
if let Some(method_call_expr) = ast::MethodCallExpr::cast(parent) {
// As above
self.dot_receiver = method_call_expr
2020-08-21 17:12:38 +00:00
.receiver()
2019-07-20 09:58:27 +00:00
.map(|e| e.syntax().text_range())
2020-03-07 14:27:03 +00:00
.and_then(|r| find_node_with_range(original_file, r));
self.is_call = true;
2019-01-08 19:33:36 +00:00
}
}
}
2019-07-19 09:56:47 +00:00
fn find_node_with_range<N: AstNode>(syntax: &SyntaxNode, range: TextRange) -> Option<N> {
2021-01-15 17:15:33 +00:00
syntax.covering_element(range).ancestors().find_map(N::cast)
2019-01-08 19:33:36 +00:00
}
fn is_node<N: AstNode>(node: &SyntaxNode) -> bool {
2019-07-21 11:11:45 +00:00
match node.ancestors().find_map(N::cast) {
2019-01-08 19:33:36 +00:00
None => false,
2019-07-20 09:58:27 +00:00
Some(n) => n.syntax().text_range() == node.text_range(),
2019-01-08 19:33:36 +00:00
}
}
2020-08-13 20:41:55 +00:00
fn path_or_use_tree_qualifier(path: &ast::Path) -> Option<ast::Path> {
if let Some(qual) = path.qualifier() {
return Some(qual);
}
let use_tree_list = path.syntax().ancestors().find_map(ast::UseTreeList::cast)?;
let use_tree = use_tree_list.syntax().parent().and_then(ast::UseTree::cast)?;
use_tree.path()
}
#[cfg(test)]
mod tests {
use expect_test::{expect, Expect};
use hir::HirDisplay;
use crate::test_utils::{position, TEST_CONFIG};
use super::CompletionContext;
fn check_expected_type_and_name(ra_fixture: &str, expect: Expect) {
let (db, pos) = position(ra_fixture);
let completion_context = CompletionContext::new(&db, pos, &TEST_CONFIG).unwrap();
let ty = completion_context
.expected_type
.map(|t| t.display_test(&db).to_string())
.unwrap_or("?".to_owned());
let name = completion_context
.expected_name
.map_or_else(|| "?".to_owned(), |name| name.to_string());
expect.assert_eq(&format!("ty: {}, name: {}", ty, name));
}
#[test]
fn expected_type_let_without_leading_char() {
cov_mark::check!(expected_type_let_without_leading_char);
check_expected_type_and_name(
r#"
fn foo() {
let x: u32 = $0;
}
"#,
expect![[r#"ty: u32, name: x"#]],
);
}
#[test]
fn expected_type_let_with_leading_char() {
cov_mark::check!(expected_type_let_with_leading_char);
check_expected_type_and_name(
r#"
fn foo() {
let x: u32 = c$0;
}
"#,
expect![[r#"ty: u32, name: x"#]],
);
}
2021-05-08 21:14:08 +00:00
#[test]
fn expected_type_let_pat() {
check_expected_type_and_name(
r#"
fn foo() {
let x$0 = 0u32;
}
"#,
expect![[r#"ty: u32, name: ?"#]],
);
check_expected_type_and_name(
r#"
fn foo() {
let $0 = 0u32;
}
"#,
expect![[r#"ty: u32, name: ?"#]],
);
}
#[test]
fn expected_type_fn_param_without_leading_char() {
cov_mark::check!(expected_type_fn_param_without_leading_char);
check_expected_type_and_name(
r#"
fn foo() {
bar($0);
}
fn bar(x: u32) {}
"#,
expect![[r#"ty: u32, name: x"#]],
);
}
#[test]
fn expected_type_fn_param_with_leading_char() {
cov_mark::check!(expected_type_fn_param_with_leading_char);
check_expected_type_and_name(
r#"
fn foo() {
bar(c$0);
}
fn bar(x: u32) {}
"#,
expect![[r#"ty: u32, name: x"#]],
);
}
#[test]
fn expected_type_struct_field_without_leading_char() {
cov_mark::check!(expected_type_struct_field_without_leading_char);
check_expected_type_and_name(
r#"
struct Foo { a: u32 }
fn foo() {
Foo { a: $0 };
}
"#,
expect![[r#"ty: u32, name: a"#]],
)
}
#[test]
fn expected_type_generic_struct_field() {
check_expected_type_and_name(
r#"
struct Foo<T> { a: T }
fn foo() -> Foo<u32> {
Foo { a: $0 }
}
"#,
expect![[r#"ty: u32, name: a"#]],
)
}
#[test]
fn expected_type_struct_field_with_leading_char() {
cov_mark::check!(expected_type_struct_field_with_leading_char);
check_expected_type_and_name(
r#"
struct Foo { a: u32 }
fn foo() {
Foo { a: c$0 };
}
"#,
expect![[r#"ty: u32, name: a"#]],
);
}
#[test]
fn expected_type_match_arm_without_leading_char() {
cov_mark::check!(expected_type_match_arm_without_leading_char);
check_expected_type_and_name(
r#"
enum E { X }
fn foo() {
match E::X { $0 }
}
"#,
expect![[r#"ty: E, name: ?"#]],
);
}
#[test]
fn expected_type_match_arm_with_leading_char() {
cov_mark::check!(expected_type_match_arm_with_leading_char);
check_expected_type_and_name(
r#"
enum E { X }
fn foo() {
match E::X { c$0 }
}
"#,
expect![[r#"ty: E, name: ?"#]],
);
}
#[test]
fn expected_type_if_let_without_leading_char() {
cov_mark::check!(expected_type_if_let_without_leading_char);
check_expected_type_and_name(
r#"
enum Foo { Bar, Baz, Quux }
fn foo() {
let f = Foo::Quux;
if let $0 = f { }
}
"#,
expect![[r#"ty: Foo, name: ?"#]],
)
}
#[test]
fn expected_type_if_let_with_leading_char() {
cov_mark::check!(expected_type_if_let_with_leading_char);
check_expected_type_and_name(
r#"
enum Foo { Bar, Baz, Quux }
fn foo() {
let f = Foo::Quux;
if let c$0 = f { }
}
"#,
expect![[r#"ty: Foo, name: ?"#]],
)
}
#[test]
fn expected_type_fn_ret_without_leading_char() {
cov_mark::check!(expected_type_fn_ret_without_leading_char);
check_expected_type_and_name(
r#"
fn foo() -> u32 {
$0
}
"#,
expect![[r#"ty: u32, name: ?"#]],
)
}
#[test]
fn expected_type_fn_ret_with_leading_char() {
cov_mark::check!(expected_type_fn_ret_with_leading_char);
check_expected_type_and_name(
r#"
fn foo() -> u32 {
c$0
}
"#,
expect![[r#"ty: u32, name: ?"#]],
)
}
#[test]
fn expected_type_fn_ret_fn_ref_fully_typed() {
check_expected_type_and_name(
r#"
fn foo() -> u32 {
foo$0
}
"#,
expect![[r#"ty: u32, name: ?"#]],
)
}
#[test]
fn expected_type_closure_param_return() {
// FIXME: make this work with `|| $0`
check_expected_type_and_name(
r#"
fn foo() {
bar(|| a$0);
}
fn bar(f: impl FnOnce() -> u32) {}
#[lang = "fn_once"]
trait FnOnce { type Output; }
"#,
expect![[r#"ty: u32, name: ?"#]],
);
}
#[test]
fn expected_type_generic_function() {
check_expected_type_and_name(
r#"
fn foo() {
bar::<u32>($0);
}
fn bar<T>(t: T) {}
"#,
expect![[r#"ty: u32, name: t"#]],
);
}
#[test]
fn expected_type_generic_method() {
check_expected_type_and_name(
r#"
fn foo() {
S(1u32).bar($0);
}
struct S<T>(T);
impl<T> S<T> {
fn bar(self, t: T) {}
}
"#,
expect![[r#"ty: u32, name: t"#]],
);
}
}