1 //! See `CompletionContext` structure.
5 use base_db::SourceDatabaseExt;
7 HasAttrs, Local, Name, PathResolution, ScopeDef, Semantics, SemanticsScope, Type, TypeInfo,
10 active_parameter::ActiveParameter,
11 base_db::{FilePosition, SourceDatabase},
12 famous_defs::FamousDefs,
13 FxHashMap, FxHashSet, RootDatabase,
16 algo::{find_node_at_offset, non_trivia_sibling},
17 ast::{self, AttrKind, HasArgList, HasName, NameOrNameRef},
18 match_ast, AstNode, AstToken, NodeOrToken,
19 SyntaxKind::{self, *},
20 SyntaxNode, SyntaxToken, TextRange, TextSize, T,
26 determine_location, determine_prev_sibling, is_in_loop_body, is_in_token_of_for_loop,
27 previous_token, ImmediateLocation, ImmediatePrevSibling,
32 const COMPLETION_MARKER: &str = "intellijRulezz";
34 #[derive(Copy, Clone, Debug, PartialEq, Eq)]
35 pub(crate) enum PatternRefutability {
40 pub(crate) enum Visible {
46 #[derive(Copy, Clone, Debug, PartialEq, Eq)]
47 pub(super) enum PathKind {
51 in_functional_update: bool,
56 annotated_item_kind: Option<SyntaxKind>,
59 /// Path in item position, that is inside an (Assoc)ItemList
70 #[derive(Copy, Clone, Debug, PartialEq, Eq)]
71 pub(super) enum ItemListKind {
80 pub(crate) struct PathCompletionCtx {
81 /// If this is a call with () already there (or {} in case of record patterns)
82 pub(super) has_call_parens: bool,
83 /// If this has a macro call bang !
84 pub(super) has_macro_bang: bool,
85 /// Whether this path stars with a `::`.
86 pub(super) is_absolute_path: bool,
87 /// The qualifier of the current path if it exists.
88 pub(super) qualifier: Option<PathQualifierCtx>,
91 /// The parent of the path we are completing.
92 pub(super) parent: Option<ast::Path>,
93 pub(super) kind: PathKind,
94 /// Whether the path segment has type args or not.
95 pub(super) has_type_args: bool,
99 pub(crate) struct PathQualifierCtx {
100 pub(crate) path: ast::Path,
101 pub(crate) resolution: Option<PathResolution>,
102 /// Whether this path consists solely of `super` segments
103 pub(crate) is_super_chain: bool,
104 /// Whether the qualifier comes from a use tree parent or not
105 pub(crate) use_tree_parent: bool,
107 pub(crate) is_infer_qualifier: bool,
111 pub(super) struct PatternContext {
112 pub(super) refutability: PatternRefutability,
113 pub(super) param_ctx: Option<(ast::ParamList, ast::Param, ParamKind)>,
114 pub(super) has_type_ascription: bool,
115 pub(super) parent_pat: Option<ast::Pat>,
116 pub(super) ref_token: Option<SyntaxToken>,
117 pub(super) mut_token: Option<SyntaxToken>,
121 pub(super) struct LifetimeContext {
122 pub(super) lifetime: Option<ast::Lifetime>,
123 pub(super) kind: LifetimeKind,
127 pub(super) enum LifetimeKind {
128 LifetimeParam { is_decl: bool, param: ast::LifetimeParam },
135 pub(super) struct NameContext {
137 pub(super) name: Option<ast::Name>,
138 pub(super) kind: NameKind,
143 pub(super) enum NameKind {
166 pub(super) struct NameRefContext {
167 /// NameRef syntax in the original file
168 pub(super) nameref: Option<ast::NameRef>,
169 pub(super) dot_access: Option<DotAccess>,
170 pub(super) path_ctx: Option<PathCompletionCtx>,
174 pub(super) enum IdentContext {
176 NameRef(NameRefContext),
177 Lifetime(LifetimeContext),
178 /// Original token, fake token
180 original: ast::String,
181 expanded: Option<ast::String>,
184 fake_attribute_under_caret: Option<ast::Attr>,
189 pub(super) enum DotAccess {
191 receiver: Option<ast::Expr>,
192 /// True if the receiver is an integer and there is no ident in the original file after it yet
194 receiver_is_ambiguous_float_literal: bool,
197 receiver: Option<ast::Expr>,
202 #[derive(Clone, Debug, PartialEq, Eq)]
203 pub(crate) enum ParamKind {
205 Closure(ast::ClosureExpr),
208 /// `CompletionContext` is created early during completion to figure out, where
209 /// exactly is the cursor, syntax-wise.
211 pub(crate) struct CompletionContext<'a> {
212 pub(super) sema: Semantics<'a, RootDatabase>,
213 pub(super) scope: SemanticsScope<'a>,
214 pub(super) db: &'a RootDatabase,
215 pub(super) config: &'a CompletionConfig,
216 pub(super) position: FilePosition,
218 /// The token before the cursor, in the original file.
219 pub(super) original_token: SyntaxToken,
220 /// The token before the cursor, in the macro-expanded file.
221 pub(super) token: SyntaxToken,
222 /// The crate of the current file.
223 pub(super) krate: hir::Crate,
224 /// The module of the `scope`.
225 pub(super) module: hir::Module,
227 /// The expected name of what we are completing.
228 /// This is usually the parameter name of the function argument we are completing.
229 pub(super) expected_name: Option<NameOrNameRef>,
230 /// The expected type of what we are completing.
231 pub(super) expected_type: Option<Type>,
233 /// The parent function of the cursor position if it exists.
234 pub(super) function_def: Option<ast::Fn>,
235 /// The parent impl of the cursor position if it exists.
236 pub(super) impl_def: Option<ast::Impl>,
237 /// Are we completing inside a let statement with a missing semicolon?
238 pub(super) incomplete_let: bool,
240 pub(super) completion_location: Option<ImmediateLocation>,
241 pub(super) prev_sibling: Option<ImmediatePrevSibling>,
242 pub(super) previous_token: Option<SyntaxToken>,
244 pub(super) ident_ctx: IdentContext,
246 pub(super) pattern_ctx: Option<PatternContext>,
248 pub(super) existing_derives: FxHashSet<hir::Macro>,
250 pub(super) locals: FxHashMap<Name, Local>,
253 impl<'a> CompletionContext<'a> {
254 /// The range of the identifier that is being completed.
255 pub(crate) fn source_range(&self) -> TextRange {
256 // check kind of macro-expanded token, but use range of original token
257 let kind = self.token.kind();
260 // assume we are completing a lifetime but the user has only typed the '
261 cov_mark::hit!(completes_if_lifetime_without_idents);
262 TextRange::at(self.original_token.text_range().start(), TextSize::from(1))
264 IDENT | LIFETIME_IDENT | UNDERSCORE => self.original_token.text_range(),
265 _ if kind.is_keyword() => self.original_token.text_range(),
266 _ => TextRange::empty(self.position.offset),
270 pub(crate) fn previous_token_is(&self, kind: SyntaxKind) -> bool {
271 self.previous_token.as_ref().map_or(false, |tok| tok.kind() == kind)
274 pub(crate) fn famous_defs(&self) -> FamousDefs {
275 FamousDefs(&self.sema, self.krate)
278 pub(super) fn nameref_ctx(&self) -> Option<&NameRefContext> {
279 match &self.ident_ctx {
280 IdentContext::NameRef(it) => Some(it),
285 pub(super) fn name_ctx(&self) -> Option<&NameContext> {
286 match &self.ident_ctx {
287 IdentContext::Name(it) => Some(it),
292 pub(super) fn lifetime_ctx(&self) -> Option<&LifetimeContext> {
293 match &self.ident_ctx {
294 IdentContext::Lifetime(it) => Some(it),
299 pub(crate) fn dot_receiver(&self) -> Option<&ast::Expr> {
300 match self.nameref_ctx() {
301 Some(NameRefContext {
303 Some(DotAccess::Method { receiver, .. } | DotAccess::Field { receiver, .. }),
305 }) => receiver.as_ref(),
310 pub(crate) fn has_dot_receiver(&self) -> bool {
311 self.dot_receiver().is_some()
314 pub(crate) fn expects_assoc_item(&self) -> bool {
315 matches!(self.completion_location, Some(ImmediateLocation::Trait | ImmediateLocation::Impl))
318 pub(crate) fn expects_variant(&self) -> bool {
319 matches!(self.name_ctx(), Some(NameContext { kind: NameKind::Variant, .. }))
322 pub(crate) fn expects_non_trait_assoc_item(&self) -> bool {
323 matches!(self.completion_location, Some(ImmediateLocation::Impl))
326 pub(crate) fn expects_item(&self) -> bool {
327 matches!(self.completion_location, Some(ImmediateLocation::ItemList))
330 // FIXME: This shouldn't exist
331 pub(crate) fn expects_generic_arg(&self) -> bool {
332 matches!(self.completion_location, Some(ImmediateLocation::GenericArgList(_)))
335 pub(crate) fn has_block_expr_parent(&self) -> bool {
336 matches!(self.completion_location, Some(ImmediateLocation::StmtList))
339 pub(crate) fn expects_ident_ref_expr(&self) -> bool {
340 matches!(self.completion_location, Some(ImmediateLocation::RefExpr))
343 pub(crate) fn expect_field(&self) -> bool {
344 matches!(self.completion_location, Some(ImmediateLocation::TupleField))
345 || matches!(self.name_ctx(), Some(NameContext { kind: NameKind::RecordField, .. }))
348 /// Whether the cursor is right after a trait or impl header.
349 /// trait Foo ident$0
350 // FIXME: This probably shouldn't exist
351 pub(crate) fn has_unfinished_impl_or_trait_prev_sibling(&self) -> bool {
354 Some(ImmediatePrevSibling::ImplDefType | ImmediatePrevSibling::TraitDefName)
358 // FIXME: This probably shouldn't exist
359 pub(crate) fn has_impl_prev_sibling(&self) -> bool {
360 matches!(self.prev_sibling, Some(ImmediatePrevSibling::ImplDefType))
363 pub(crate) fn has_visibility_prev_sibling(&self) -> bool {
364 matches!(self.prev_sibling, Some(ImmediatePrevSibling::Visibility))
367 pub(crate) fn after_if(&self) -> bool {
368 matches!(self.prev_sibling, Some(ImmediatePrevSibling::IfExpr))
371 // FIXME: This shouldn't exist
372 pub(crate) fn is_path_disallowed(&self) -> bool {
373 self.previous_token_is(T![unsafe])
374 || matches!(self.prev_sibling, Some(ImmediatePrevSibling::Visibility))
376 self.completion_location,
377 Some(ImmediateLocation::RecordPat(_) | ImmediateLocation::RecordExpr(_))
381 Some(NameContext { kind: NameKind::Module(_) | NameKind::Rename, .. })
385 pub(crate) fn path_context(&self) -> Option<&PathCompletionCtx> {
386 self.nameref_ctx().and_then(|ctx| ctx.path_ctx.as_ref())
389 pub(crate) fn expects_expression(&self) -> bool {
390 matches!(self.path_context(), Some(PathCompletionCtx { kind: PathKind::Expr { .. }, .. }))
393 pub(crate) fn is_non_trivial_path(&self) -> bool {
397 PathCompletionCtx { is_absolute_path: true, .. }
398 | PathCompletionCtx { qualifier: Some(_), .. }
403 pub(crate) fn path_qual(&self) -> Option<&ast::Path> {
404 self.path_context().and_then(|it| it.qualifier.as_ref().map(|it| &it.path))
407 pub(crate) fn path_kind(&self) -> Option<PathKind> {
408 self.path_context().map(|it| it.kind)
411 /// Checks if an item is visible and not `doc(hidden)` at the completion site.
412 pub(crate) fn is_visible<I>(&self, item: &I) -> Visible
414 I: hir::HasVisibility + hir::HasAttrs + hir::HasCrate + Copy,
416 self.is_visible_impl(&item.visibility(self.db), &item.attrs(self.db), item.krate(self.db))
419 pub(crate) fn is_scope_def_hidden(&self, scope_def: ScopeDef) -> bool {
420 if let (Some(attrs), Some(krate)) = (scope_def.attrs(self.db), scope_def.krate(self.db)) {
421 return self.is_doc_hidden(&attrs, krate);
427 /// Check if an item is `#[doc(hidden)]`.
428 pub(crate) fn is_item_hidden(&self, item: &hir::ItemInNs) -> bool {
429 let attrs = item.attrs(self.db);
430 let krate = item.krate(self.db);
431 match (attrs, krate) {
432 (Some(attrs), Some(krate)) => self.is_doc_hidden(&attrs, krate),
436 /// Whether the given trait is an operator trait or not.
437 pub(crate) fn is_ops_trait(&self, trait_: hir::Trait) -> bool {
438 match trait_.attrs(self.db).lang() {
439 Some(lang) => OP_TRAIT_LANG_NAMES.contains(&lang.as_str()),
444 /// Returns the traits in scope, with the [`Drop`] trait removed.
445 pub(crate) fn traits_in_scope(&self) -> hir::VisibleTraits {
446 let mut traits_in_scope = self.scope.visible_traits();
447 if let Some(drop) = self.famous_defs().core_ops_Drop() {
448 traits_in_scope.0.remove(&drop.into());
453 /// A version of [`SemanticsScope::process_all_names`] that filters out `#[doc(hidden)]` items.
454 pub(crate) fn process_all_names(&self, f: &mut dyn FnMut(Name, ScopeDef)) {
455 let _p = profile::span("CompletionContext::process_all_names");
456 self.scope.process_all_names(&mut |name, def| {
457 if self.is_scope_def_hidden(def) {
465 pub(crate) fn process_all_names_raw(&self, f: &mut dyn FnMut(Name, ScopeDef)) {
466 let _p = profile::span("CompletionContext::process_all_names_raw");
467 self.scope.process_all_names(&mut |name, def| f(name, def));
472 vis: &hir::Visibility,
474 defining_crate: hir::Crate,
476 if !vis.is_visible_from(self.db, self.module.into()) {
477 if !self.config.enable_private_editable {
480 // If the definition location is editable, also show private items
481 let root_file = defining_crate.root_file(self.db);
482 let source_root_id = self.db.file_source_root(root_file);
483 let is_editable = !self.db.source_root(source_root_id).is_library;
484 return if is_editable { Visible::Editable } else { Visible::No };
487 if self.is_doc_hidden(attrs, defining_crate) {
494 fn is_doc_hidden(&self, attrs: &hir::Attrs, defining_crate: hir::Crate) -> bool {
495 // `doc(hidden)` items are only completed within the defining crate.
496 self.krate != defining_crate && attrs.has_doc_hidden()
500 // CompletionContext construction
501 impl<'a> CompletionContext<'a> {
503 db: &'a RootDatabase,
504 position @ FilePosition { file_id, offset }: FilePosition,
505 config: &'a CompletionConfig,
506 ) -> Option<CompletionContext<'a>> {
507 let _p = profile::span("CompletionContext::new");
508 let sema = Semantics::new(db);
510 let original_file = sema.parse(file_id);
512 // Insert a fake ident to get a valid parse tree. We will use this file
513 // to determine context, though the original_file will be used for
514 // actual completion.
515 let file_with_fake_ident = {
516 let parse = db.parse(file_id);
517 let edit = Indel::insert(offset, COMPLETION_MARKER.to_string());
518 parse.reparse(&edit).tree()
520 let fake_ident_token =
521 file_with_fake_ident.syntax().token_at_offset(offset).right_biased()?;
523 let original_token = original_file.syntax().token_at_offset(offset).left_biased()?;
524 let token = sema.descend_into_macros_single(original_token.clone());
525 let scope = sema.scope_at_offset(&token.parent()?, offset)?;
526 let krate = scope.krate();
527 let module = scope.module();
529 let mut locals = FxHashMap::default();
530 scope.process_all_names(&mut |name, scope| {
531 if let ScopeDef::Local(local) = scope {
532 locals.insert(name, local);
536 let mut ctx = CompletionContext {
550 incomplete_let: false,
551 completion_location: None,
553 previous_token: None,
554 // dummy value, will be overwritten
555 ident_ctx: IdentContext::UnexpandedAttrTT { fake_attribute_under_caret: None },
557 existing_derives: Default::default(),
561 original_file.syntax().clone(),
562 file_with_fake_ident.syntax().clone(),
569 /// Expand attributes and macro calls at the current cursor position for both the original file
570 /// and fake file repeatedly. As soon as one of the two expansions fail we stop so the original
571 /// and speculative states stay in sync.
574 mut original_file: SyntaxNode,
575 mut speculative_file: SyntaxNode,
576 mut offset: TextSize,
577 mut fake_ident_token: SyntaxToken,
579 let _p = profile::span("CompletionContext::expand_and_fill");
580 let mut derive_ctx = None;
584 |item: &ast::Item| item.syntax().ancestors().skip(1).find_map(ast::Item::cast);
585 let ancestor_items = iter::successors(
587 find_node_at_offset::<ast::Item>(&original_file, offset),
588 find_node_at_offset::<ast::Item>(&speculative_file, offset),
590 |(a, b)| parent_item(a).zip(parent_item(b)),
593 // first try to expand attributes as these are always the outermost macro calls
594 'ancestors: for (actual_item, item_with_fake_ident) in ancestor_items {
596 self.sema.expand_attr_macro(&actual_item),
597 self.sema.speculative_expand_attr_macro(
599 &item_with_fake_ident,
600 fake_ident_token.clone(),
603 // maybe parent items have attributes, so continue walking the ancestors
604 (None, None) => continue 'ancestors,
605 // successful expansions
606 (Some(actual_expansion), Some((fake_expansion, fake_mapped_token))) => {
607 let new_offset = fake_mapped_token.text_range().start();
608 if new_offset > actual_expansion.text_range().end() {
609 // offset outside of bounds from the original expansion,
610 // stop here to prevent problems from happening
613 original_file = actual_expansion;
614 speculative_file = fake_expansion;
615 fake_ident_token = fake_mapped_token;
619 // exactly one expansion failed, inconsistent state so stop expanding completely
620 _ => break 'expansion,
624 // No attributes have been expanded, so look for macro_call! token trees or derive token trees
625 let orig_tt = match find_node_at_offset::<ast::TokenTree>(&original_file, offset) {
627 None => break 'expansion,
629 let spec_tt = match find_node_at_offset::<ast::TokenTree>(&speculative_file, offset) {
631 None => break 'expansion,
634 // Expand pseudo-derive expansion
635 if let (Some(orig_attr), Some(spec_attr)) = (
636 orig_tt.syntax().parent().and_then(ast::Meta::cast).and_then(|it| it.parent_attr()),
637 spec_tt.syntax().parent().and_then(ast::Meta::cast).and_then(|it| it.parent_attr()),
639 if let (Some(actual_expansion), Some((fake_expansion, fake_mapped_token))) = (
640 self.sema.expand_derive_as_pseudo_attr_macro(&orig_attr),
641 self.sema.speculative_expand_derive_as_pseudo_attr_macro(
644 fake_ident_token.clone(),
650 fake_mapped_token.text_range().start(),
654 // at this point we won't have any more successful expansions, so stop
658 // Expand fn-like macro calls
659 if let (Some(actual_macro_call), Some(macro_call_with_fake_ident)) = (
660 orig_tt.syntax().ancestors().find_map(ast::MacroCall::cast),
661 spec_tt.syntax().ancestors().find_map(ast::MacroCall::cast),
663 let mac_call_path0 = actual_macro_call.path().as_ref().map(|s| s.syntax().text());
665 macro_call_with_fake_ident.path().as_ref().map(|s| s.syntax().text());
667 // inconsistent state, stop expanding
668 if mac_call_path0 != mac_call_path1 {
671 let speculative_args = match macro_call_with_fake_ident.token_tree() {
673 None => break 'expansion,
677 self.sema.expand(&actual_macro_call),
678 self.sema.speculative_expand(
681 fake_ident_token.clone(),
684 // successful expansions
685 (Some(actual_expansion), Some((fake_expansion, fake_mapped_token))) => {
686 let new_offset = fake_mapped_token.text_range().start();
687 if new_offset > actual_expansion.text_range().end() {
688 // offset outside of bounds from the original expansion,
689 // stop here to prevent problems from happening
692 original_file = actual_expansion;
693 speculative_file = fake_expansion;
694 fake_ident_token = fake_mapped_token;
698 // at least on expansion failed, we won't have anything to expand from this point
699 // onwards so break out
700 _ => break 'expansion,
704 // none of our states have changed so stop the loop
708 self.fill(&original_file, speculative_file, offset, derive_ctx)
711 /// Calculate the expected type and name of the cursor position.
712 fn expected_type_and_name(&self) -> (Option<Type>, Option<NameOrNameRef>) {
713 let mut node = match self.token.parent() {
715 None => return (None, None),
720 ast::LetStmt(it) => {
721 cov_mark::hit!(expected_type_let_with_leading_char);
722 cov_mark::hit!(expected_type_let_without_leading_char);
724 .and_then(|pat| self.sema.type_of_pat(&pat))
725 .or_else(|| it.initializer().and_then(|it| self.sema.type_of_expr(&it)))
726 .map(TypeInfo::original);
727 let name = match it.pat() {
728 Some(ast::Pat::IdentPat(ident)) => ident.name().map(NameOrNameRef::Name),
729 Some(_) | None => None,
734 ast::LetExpr(it) => {
735 cov_mark::hit!(expected_type_if_let_without_leading_char);
737 .and_then(|pat| self.sema.type_of_pat(&pat))
738 .or_else(|| it.expr().and_then(|it| self.sema.type_of_expr(&it)))
739 .map(TypeInfo::original);
743 cov_mark::hit!(expected_type_fn_param);
744 ActiveParameter::at_token(
748 let name = ap.ident().map(NameOrNameRef::Name);
749 let ty = if has_ref(&self.token) {
750 cov_mark::hit!(expected_type_fn_param_ref);
757 .unwrap_or((None, None))
759 ast::RecordExprFieldList(it) => {
760 // wouldn't try {} be nice...
762 if self.token.kind() == T![..]
763 || self.token.prev_token().map(|t| t.kind()) == Some(T![..])
765 cov_mark::hit!(expected_type_struct_func_update);
766 let record_expr = it.syntax().parent().and_then(ast::RecordExpr::cast)?;
767 let ty = self.sema.type_of_expr(&record_expr.into())?;
773 cov_mark::hit!(expected_type_struct_field_without_leading_char);
774 let expr_field = self.token.prev_sibling_or_token()?
776 .and_then(ast::RecordExprField::cast)?;
777 let (_, _, ty) = self.sema.resolve_record_field(&expr_field)?;
780 expr_field.field_name().map(NameOrNameRef::NameRef),
783 })().unwrap_or((None, None))
785 ast::RecordExprField(it) => {
786 if let Some(expr) = it.expr() {
787 cov_mark::hit!(expected_type_struct_field_with_leading_char);
789 self.sema.type_of_expr(&expr).map(TypeInfo::original),
790 it.field_name().map(NameOrNameRef::NameRef),
793 cov_mark::hit!(expected_type_struct_field_followed_by_comma);
794 let ty = self.sema.resolve_record_field(&it)
795 .map(|(_, _, ty)| ty);
798 it.field_name().map(NameOrNameRef::NameRef),
803 // match foo { ..., pat => $0 }
804 ast::MatchExpr(it) => {
805 let ty = if self.previous_token_is(T![=>]) {
806 // match foo { ..., pat => $0 }
807 cov_mark::hit!(expected_type_match_arm_body_without_leading_char);
808 cov_mark::hit!(expected_type_match_arm_body_with_leading_char);
809 self.sema.type_of_expr(&it.into())
812 cov_mark::hit!(expected_type_match_arm_without_leading_char);
813 it.expr().and_then(|e| self.sema.type_of_expr(&e))
814 }.map(TypeInfo::original);
818 let ty = it.condition()
819 .and_then(|e| self.sema.type_of_expr(&e))
820 .map(TypeInfo::original);
823 ast::IdentPat(it) => {
824 cov_mark::hit!(expected_type_if_let_with_leading_char);
825 cov_mark::hit!(expected_type_match_arm_with_leading_char);
826 let ty = self.sema.type_of_pat(&ast::Pat::from(it)).map(TypeInfo::original);
830 cov_mark::hit!(expected_type_fn_ret_with_leading_char);
831 cov_mark::hit!(expected_type_fn_ret_without_leading_char);
832 let def = self.sema.to_def(&it);
833 (def.map(|def| def.ret_type(self.db)), None)
835 ast::ClosureExpr(it) => {
836 let ty = self.sema.type_of_expr(&it.into());
837 ty.and_then(|ty| ty.original.as_callable(self.db))
838 .map(|c| (Some(c.return_type()), None))
839 .unwrap_or((None, None))
841 ast::ParamList(_) => (None, None),
842 ast::Stmt(_) => (None, None),
843 ast::Item(_) => (None, None),
845 match node.parent() {
850 None => (None, None),
858 /// Fill the completion context, this is what does semantic reasoning about the surrounding context
859 /// of the completion location.
862 original_file: &SyntaxNode,
863 file_with_fake_ident: SyntaxNode,
865 derive_ctx: Option<(SyntaxNode, SyntaxNode, TextSize, ast::Attr)>,
867 let fake_ident_token = file_with_fake_ident.token_at_offset(offset).right_biased().unwrap();
868 let syntax_element = NodeOrToken::Token(fake_ident_token);
869 if is_in_token_of_for_loop(syntax_element.clone()) {
871 // there is nothing to complete here except `in` keyword
872 // don't bother populating the context
873 // FIXME: the completion calculations should end up good enough
874 // such that this special case becomes unnecessary
878 self.previous_token = previous_token(syntax_element.clone());
880 self.incomplete_let =
881 syntax_element.ancestors().take(6).find_map(ast::LetStmt::cast).map_or(false, |it| {
882 it.syntax().text_range().end() == syntax_element.text_range().end()
885 (self.expected_type, self.expected_name) = self.expected_type_and_name();
887 // Overwrite the path kind for derives
888 if let Some((original_file, file_with_fake_ident, offset, origin_attr)) = derive_ctx {
889 self.existing_derives = self
891 .resolve_derive_macro(&origin_attr)
897 if let Some(ast::NameLike::NameRef(name_ref)) =
898 find_node_at_offset(&file_with_fake_ident, offset)
900 let parent = name_ref.syntax().parent()?;
901 let (mut nameref_ctx, _) =
902 Self::classify_name_ref(&self.sema, &original_file, name_ref, parent);
903 if let Some(path_ctx) = &mut nameref_ctx.path_ctx {
904 path_ctx.kind = PathKind::Derive;
906 self.ident_ctx = IdentContext::NameRef(nameref_ctx);
912 let name_like = match find_node_at_offset(&file_with_fake_ident, offset) {
915 if let Some(original) = ast::String::cast(self.original_token.clone()) {
916 self.ident_ctx = IdentContext::String {
918 expanded: ast::String::cast(self.token.clone()),
921 // Fix up trailing whitespace problem
923 let token = if self.token.kind() == SyntaxKind::WHITESPACE {
924 self.previous_token.as_ref()?
928 let p = token.parent()?;
929 if p.kind() == SyntaxKind::TOKEN_TREE
930 && p.ancestors().any(|it| it.kind() == SyntaxKind::META)
932 self.ident_ctx = IdentContext::UnexpandedAttrTT {
933 fake_attribute_under_caret: syntax_element
935 .find_map(ast::Attr::cast),
944 self.completion_location =
945 determine_location(&self.sema, original_file, offset, &name_like);
946 self.prev_sibling = determine_prev_sibling(&name_like);
949 .token_ancestors_with_macros(self.token.clone())
950 .take_while(|it| it.kind() != SOURCE_FILE && it.kind() != MODULE)
951 .find_map(ast::Impl::cast);
952 self.function_def = self
954 .token_ancestors_with_macros(self.token.clone())
955 .take_while(|it| it.kind() != SOURCE_FILE && it.kind() != MODULE)
956 .find_map(ast::Fn::cast);
959 ast::NameLike::Lifetime(lifetime) => {
960 self.ident_ctx = IdentContext::Lifetime(Self::classify_lifetime(
966 ast::NameLike::NameRef(name_ref) => {
967 let parent = name_ref.syntax().parent()?;
968 let (nameref_ctx, pat_ctx) =
969 Self::classify_name_ref(&self.sema, &original_file, name_ref, parent);
970 self.ident_ctx = IdentContext::NameRef(nameref_ctx);
971 self.pattern_ctx = pat_ctx;
973 ast::NameLike::Name(name) => {
974 let (name_ctx, pat_ctx) = Self::classify_name(&self.sema, original_file, name)?;
975 self.pattern_ctx = pat_ctx;
976 self.ident_ctx = IdentContext::Name(name_ctx);
982 fn classify_lifetime(
983 _sema: &Semantics<RootDatabase>,
984 original_file: &SyntaxNode,
985 lifetime: ast::Lifetime,
986 ) -> Option<LifetimeContext> {
987 let parent = lifetime.syntax().parent()?;
988 if parent.kind() == ERROR {
992 let kind = match_ast! {
994 ast::LifetimeParam(param) => LifetimeKind::LifetimeParam {
995 is_decl: param.lifetime().as_ref() == Some(&lifetime),
998 ast::BreakExpr(_) => LifetimeKind::LabelRef,
999 ast::ContinueExpr(_) => LifetimeKind::LabelRef,
1000 ast::Label(_) => LifetimeKind::LabelDef,
1001 _ => LifetimeKind::Lifetime,
1004 let lifetime = find_node_at_offset(&original_file, lifetime.syntax().text_range().start());
1006 Some(LifetimeContext { lifetime, kind })
1010 _sema: &Semantics<RootDatabase>,
1011 original_file: &SyntaxNode,
1013 ) -> Option<(NameContext, Option<PatternContext>)> {
1014 let parent = name.syntax().parent()?;
1015 let mut pat_ctx = None;
1016 let kind = match_ast! {
1018 ast::Const(_) => NameKind::Const,
1019 ast::ConstParam(_) => NameKind::ConstParam,
1020 ast::Enum(_) => NameKind::Enum,
1021 ast::Fn(_) => NameKind::Function,
1022 ast::IdentPat(bind_pat) => {
1023 let is_name_in_field_pat = bind_pat
1026 .and_then(ast::RecordPatField::cast)
1027 .map_or(false, |pat_field| pat_field.name_ref().is_none());
1028 if !is_name_in_field_pat {
1029 pat_ctx = Some(pattern_context_for(original_file, bind_pat.into()));
1034 ast::MacroDef(_) => NameKind::MacroDef,
1035 ast::MacroRules(_) => NameKind::MacroRules,
1036 ast::Module(module) => NameKind::Module(module),
1037 ast::RecordField(_) => NameKind::RecordField,
1038 ast::Rename(_) => NameKind::Rename,
1039 ast::SelfParam(_) => NameKind::SelfParam,
1040 ast::Static(_) => NameKind::Static,
1041 ast::Struct(_) => NameKind::Struct,
1042 ast::Trait(_) => NameKind::Trait,
1043 ast::TypeAlias(_) => NameKind::TypeAlias,
1044 ast::TypeParam(_) => NameKind::TypeParam,
1045 ast::Union(_) => NameKind::Union,
1046 ast::Variant(_) => NameKind::Variant,
1050 let name = find_node_at_offset(&original_file, name.syntax().text_range().start());
1051 Some((NameContext { name, kind }, pat_ctx))
1054 fn classify_name_ref(
1055 sema: &Semantics<RootDatabase>,
1056 original_file: &SyntaxNode,
1057 name_ref: ast::NameRef,
1059 ) -> (NameRefContext, Option<PatternContext>) {
1060 let nameref = find_node_at_offset(&original_file, name_ref.syntax().text_range().start());
1062 let mut nameref_ctx = NameRefContext { dot_access: None, path_ctx: None, nameref };
1064 let segment = match_ast! {
1066 ast::PathSegment(segment) => segment,
1067 ast::FieldExpr(field) => {
1068 let receiver = find_in_original_file(field.expr(), original_file);
1069 let receiver_is_ambiguous_float_literal = match &receiver {
1070 Some(ast::Expr::Literal(l)) => matches! {
1072 ast::LiteralKind::FloatNumber { .. } if l.syntax().last_token().map_or(false, |it| it.text().ends_with('.'))
1076 nameref_ctx.dot_access = Some(DotAccess::Field { receiver, receiver_is_ambiguous_float_literal });
1077 return (nameref_ctx, None);
1079 ast::MethodCallExpr(method) => {
1080 nameref_ctx.dot_access = Some(
1082 receiver: find_in_original_file(method.receiver(), original_file),
1083 has_parens: method.arg_list().map_or(false, |it| it.l_paren_token().is_some())
1086 return (nameref_ctx, None);
1088 _ => return (nameref_ctx, None),
1092 let path = segment.parent_path();
1093 let mut path_ctx = PathCompletionCtx {
1094 has_call_parens: false,
1095 has_macro_bang: false,
1096 is_absolute_path: false,
1098 parent: path.parent_path(),
1099 kind: PathKind::Item { kind: ItemListKind::SourceFile },
1100 has_type_args: false,
1102 let mut pat_ctx = None;
1104 let is_in_block = |it: &SyntaxNode| {
1107 ast::ExprStmt::can_cast(node.kind()) || ast::StmtList::can_cast(node.kind())
1111 let is_in_func_update = |it: &SyntaxNode| {
1112 it.parent().map_or(false, |it| ast::RecordExprFieldList::can_cast(it.kind()))
1115 let kind = path.syntax().ancestors().find_map(|it| {
1116 // using Option<Option<PathKind>> as extra controlflow
1117 let kind = match_ast! {
1119 ast::PathType(_) => Some(PathKind::Type),
1120 ast::PathExpr(it) => {
1121 path_ctx.has_call_parens = it.syntax().parent().map_or(false, |it| ast::CallExpr::can_cast(it.kind()));
1122 let in_block_expr = is_in_block(it.syntax());
1123 let in_loop_body = is_in_loop_body(it.syntax());
1124 let in_functional_update = is_in_func_update(it.syntax());
1125 Some(PathKind::Expr { in_block_expr, in_loop_body, in_functional_update })
1127 ast::TupleStructPat(it) => {
1128 path_ctx.has_call_parens = true;
1129 pat_ctx = Some(pattern_context_for(original_file, it.into()));
1132 ast::RecordPat(it) => {
1133 path_ctx.has_call_parens = true;
1134 pat_ctx = Some(pattern_context_for(original_file, it.into()));
1137 ast::PathPat(it) => {
1138 pat_ctx = Some(pattern_context_for(original_file, it.into()));
1141 ast::MacroCall(it) => {
1142 path_ctx.has_macro_bang = it.excl_token().is_some();
1143 let parent = it.syntax().parent();
1144 match parent.as_ref().map(|it| it.kind()) {
1145 Some(SyntaxKind::MACRO_PAT) => Some(PathKind::Pat),
1146 Some(SyntaxKind::MACRO_TYPE) => Some(PathKind::Type),
1147 Some(SyntaxKind::ITEM_LIST) => Some(PathKind::Item { kind: ItemListKind::Module }),
1148 Some(SyntaxKind::ASSOC_ITEM_LIST) => Some(PathKind::Item { kind: match parent.and_then(|it| it.parent()).map(|it| it.kind()) {
1149 Some(SyntaxKind::TRAIT) => ItemListKind::Trait,
1150 Some(SyntaxKind::IMPL) => ItemListKind::Impl,
1151 _ => return Some(None),
1153 Some(SyntaxKind::EXTERN_ITEM_LIST) => Some(PathKind::Item { kind: ItemListKind::ExternBlock }),
1154 Some(SyntaxKind::SOURCE_FILE) => Some(PathKind::Item { kind: ItemListKind::SourceFile }),
1156 return Some(parent.and_then(ast::MacroExpr::cast).map(|it| {
1157 let in_loop_body = is_in_loop_body(it.syntax());
1158 let in_block_expr = is_in_block(it.syntax());
1159 let in_functional_update = is_in_func_update(it.syntax());
1160 PathKind::Expr { in_block_expr, in_loop_body, in_functional_update }
1165 ast::Meta(meta) => (|| {
1166 let attr = meta.parent_attr()?;
1167 let kind = attr.kind();
1168 let attached = attr.syntax().parent()?;
1169 let is_trailing_outer_attr = kind != AttrKind::Inner
1170 && non_trivia_sibling(attr.syntax().clone().into(), syntax::Direction::Next).is_none();
1171 let annotated_item_kind = if is_trailing_outer_attr {
1174 Some(attached.kind())
1176 Some(PathKind::Attr {
1178 annotated_item_kind,
1181 ast::Visibility(it) => Some(PathKind::Vis { has_in_token: it.in_token().is_some() }),
1182 ast::UseTree(_) => Some(PathKind::Use),
1183 ast::ItemList(_) => Some(PathKind::Item { kind: ItemListKind::Module }),
1184 ast::AssocItemList(it) => Some(PathKind::Item { kind: {
1185 match it.syntax().parent()?.kind() {
1186 SyntaxKind::TRAIT => ItemListKind::Trait,
1187 SyntaxKind::IMPL => ItemListKind::Impl,
1191 ast::ExternItemList(_) => Some(PathKind::Item { kind: ItemListKind::ExternBlock }),
1192 ast::SourceFile(_) => Some(PathKind::Item { kind: ItemListKind::SourceFile }),
1199 Some(kind) => path_ctx.kind = kind,
1200 None => return (nameref_ctx, pat_ctx),
1202 path_ctx.has_type_args = segment.generic_arg_list().is_some();
1204 if let Some((path, use_tree_parent)) = path_or_use_tree_qualifier(&path) {
1205 if !use_tree_parent {
1206 path_ctx.is_absolute_path =
1207 path.top_path().segment().map_or(false, |it| it.coloncolon_token().is_some());
1212 .and_then(|it| find_node_in_file(original_file, &it))
1213 .map(|it| it.parent_path());
1214 path_ctx.qualifier = path.map(|path| {
1215 let res = sema.resolve_path(&path);
1216 let is_super_chain = iter::successors(Some(path.clone()), |p| p.qualifier())
1217 .all(|p| p.segment().and_then(|s| s.super_token()).is_some());
1220 let is_infer_qualifier = path.qualifier().is_none()
1222 path.segment().and_then(|it| it.kind()),
1223 Some(ast::PathSegmentKind::Type {
1224 type_ref: Some(ast::Type::InferType(_)),
1237 } else if let Some(segment) = path.segment() {
1238 if segment.coloncolon_token().is_some() {
1239 path_ctx.is_absolute_path = true;
1242 nameref_ctx.path_ctx = Some(path_ctx);
1243 (nameref_ctx, pat_ctx)
1247 fn pattern_context_for(original_file: &SyntaxNode, pat: ast::Pat) -> PatternContext {
1248 let mut is_param = None;
1249 let (refutability, has_type_ascription) =
1253 .skip_while(|it| ast::Pat::can_cast(it.kind()))
1255 .map_or((PatternRefutability::Irrefutable, false), |node| {
1256 let refutability = match_ast! {
1258 ast::LetStmt(let_) => return (PatternRefutability::Irrefutable, let_.ty().is_some()),
1259 ast::Param(param) => {
1260 let has_type_ascription = param.ty().is_some();
1262 let fake_param_list = param.syntax().parent().and_then(ast::ParamList::cast)?;
1263 let param_list = find_node_in_file_compensated(original_file, &fake_param_list)?;
1264 let param_list_owner = param_list.syntax().parent()?;
1265 let kind = match_ast! {
1266 match param_list_owner {
1267 ast::ClosureExpr(closure) => ParamKind::Closure(closure),
1268 ast::Fn(fn_) => ParamKind::Function(fn_),
1272 Some((param_list, param, kind))
1274 return (PatternRefutability::Irrefutable, has_type_ascription)
1276 ast::MatchArm(_) => PatternRefutability::Refutable,
1277 ast::LetExpr(_) => PatternRefutability::Refutable,
1278 ast::ForExpr(_) => PatternRefutability::Irrefutable,
1279 _ => PatternRefutability::Irrefutable,
1282 (refutability, false)
1284 let (ref_token, mut_token) = match &pat {
1285 ast::Pat::IdentPat(it) => (it.ref_token(), it.mut_token()),
1290 param_ctx: is_param,
1291 has_type_ascription,
1292 parent_pat: pat.syntax().parent().and_then(ast::Pat::cast),
1298 fn find_in_original_file<N: AstNode>(x: Option<N>, original_file: &SyntaxNode) -> Option<N> {
1299 fn find_node_with_range<N: AstNode>(syntax: &SyntaxNode, range: TextRange) -> Option<N> {
1300 let range = syntax.text_range().intersect(range)?;
1301 syntax.covering_element(range).ancestors().find_map(N::cast)
1303 x.map(|e| e.syntax().text_range()).and_then(|r| find_node_with_range(original_file, r))
1306 /// Attempts to find `node` inside `syntax` via `node`'s text range.
1307 fn find_node_in_file<N: AstNode>(syntax: &SyntaxNode, node: &N) -> Option<N> {
1308 let syntax_range = syntax.text_range();
1309 let range = node.syntax().text_range();
1310 let intersection = range.intersect(syntax_range)?;
1311 syntax.covering_element(intersection).ancestors().find_map(N::cast)
1314 /// Attempts to find `node` inside `syntax` via `node`'s text range while compensating
1315 /// for the offset introduced by the fake ident.
1316 /// This is wrong if `node` comes before the insertion point! Use `find_node_in_file` instead.
1317 fn find_node_in_file_compensated<N: AstNode>(syntax: &SyntaxNode, node: &N) -> Option<N> {
1318 let syntax_range = syntax.text_range();
1319 let range = node.syntax().text_range();
1320 let end = range.end().checked_sub(TextSize::try_from(COMPLETION_MARKER.len()).ok()?)?;
1321 if end < range.start() {
1324 let range = TextRange::new(range.start(), end);
1325 // our inserted ident could cause `range` to be go outside of the original syntax, so cap it
1326 let intersection = range.intersect(syntax_range)?;
1327 syntax.covering_element(intersection).ancestors().find_map(N::cast)
1330 fn path_or_use_tree_qualifier(path: &ast::Path) -> Option<(ast::Path, bool)> {
1331 if let Some(qual) = path.qualifier() {
1332 return Some((qual, false));
1334 let use_tree_list = path.syntax().ancestors().find_map(ast::UseTreeList::cast)?;
1335 let use_tree = use_tree_list.syntax().parent().and_then(ast::UseTree::cast)?;
1336 Some((use_tree.path()?, true))
1339 fn has_ref(token: &SyntaxToken) -> bool {
1340 let mut token = token.clone();
1341 for skip in [IDENT, WHITESPACE, T![mut]] {
1342 if token.kind() == skip {
1343 token = match token.prev_token() {
1345 None => return false,
1349 token.kind() == T![&]
1352 const OP_TRAIT_LANG_NAMES: &[&str] = &[
1387 use expect_test::{expect, Expect};
1388 use hir::HirDisplay;
1390 use crate::tests::{position, TEST_CONFIG};
1392 use super::CompletionContext;
1394 fn check_expected_type_and_name(ra_fixture: &str, expect: Expect) {
1395 let (db, pos) = position(ra_fixture);
1396 let config = TEST_CONFIG;
1397 let completion_context = CompletionContext::new(&db, pos, &config).unwrap();
1399 let ty = completion_context
1401 .map(|t| t.display_test(&db).to_string())
1402 .unwrap_or("?".to_owned());
1404 let name = completion_context
1406 .map_or_else(|| "?".to_owned(), |name| name.to_string());
1408 expect.assert_eq(&format!("ty: {}, name: {}", ty, name));
1412 fn expected_type_let_without_leading_char() {
1413 cov_mark::check!(expected_type_let_without_leading_char);
1414 check_expected_type_and_name(
1420 expect![[r#"ty: u32, name: x"#]],
1425 fn expected_type_let_with_leading_char() {
1426 cov_mark::check!(expected_type_let_with_leading_char);
1427 check_expected_type_and_name(
1433 expect![[r#"ty: u32, name: x"#]],
1438 fn expected_type_let_pat() {
1439 check_expected_type_and_name(
1445 expect![[r#"ty: u32, name: ?"#]],
1447 check_expected_type_and_name(
1453 expect![[r#"ty: u32, name: ?"#]],
1458 fn expected_type_fn_param() {
1459 cov_mark::check!(expected_type_fn_param);
1460 check_expected_type_and_name(
1462 fn foo() { bar($0); }
1465 expect![[r#"ty: u32, name: x"#]],
1467 check_expected_type_and_name(
1469 fn foo() { bar(c$0); }
1472 expect![[r#"ty: u32, name: x"#]],
1477 fn expected_type_fn_param_ref() {
1478 cov_mark::check!(expected_type_fn_param_ref);
1479 check_expected_type_and_name(
1481 fn foo() { bar(&$0); }
1484 expect![[r#"ty: u32, name: x"#]],
1486 check_expected_type_and_name(
1488 fn foo() { bar(&mut $0); }
1489 fn bar(x: &mut u32) {}
1491 expect![[r#"ty: u32, name: x"#]],
1493 check_expected_type_and_name(
1495 fn foo() { bar(& c$0); }
1498 expect![[r#"ty: u32, name: x"#]],
1500 check_expected_type_and_name(
1502 fn foo() { bar(&mut c$0); }
1503 fn bar(x: &mut u32) {}
1505 expect![[r#"ty: u32, name: x"#]],
1507 check_expected_type_and_name(
1509 fn foo() { bar(&c$0); }
1512 expect![[r#"ty: u32, name: x"#]],
1517 fn expected_type_struct_field_without_leading_char() {
1518 cov_mark::check!(expected_type_struct_field_without_leading_char);
1519 check_expected_type_and_name(
1521 struct Foo { a: u32 }
1526 expect![[r#"ty: u32, name: a"#]],
1531 fn expected_type_struct_field_followed_by_comma() {
1532 cov_mark::check!(expected_type_struct_field_followed_by_comma);
1533 check_expected_type_and_name(
1535 struct Foo { a: u32 }
1540 expect![[r#"ty: u32, name: a"#]],
1545 fn expected_type_generic_struct_field() {
1546 check_expected_type_and_name(
1548 struct Foo<T> { a: T }
1549 fn foo() -> Foo<u32> {
1553 expect![[r#"ty: u32, name: a"#]],
1558 fn expected_type_struct_field_with_leading_char() {
1559 cov_mark::check!(expected_type_struct_field_with_leading_char);
1560 check_expected_type_and_name(
1562 struct Foo { a: u32 }
1567 expect![[r#"ty: u32, name: a"#]],
1572 fn expected_type_match_arm_without_leading_char() {
1573 cov_mark::check!(expected_type_match_arm_without_leading_char);
1574 check_expected_type_and_name(
1581 expect![[r#"ty: E, name: ?"#]],
1586 fn expected_type_match_arm_with_leading_char() {
1587 cov_mark::check!(expected_type_match_arm_with_leading_char);
1588 check_expected_type_and_name(
1595 expect![[r#"ty: E, name: ?"#]],
1600 fn expected_type_match_arm_body_without_leading_char() {
1601 cov_mark::check!(expected_type_match_arm_body_without_leading_char);
1602 check_expected_type_and_name(
1607 match E::X { E::X => $0 }
1610 expect![[r#"ty: Foo, name: ?"#]],
1615 fn expected_type_match_body_arm_with_leading_char() {
1616 cov_mark::check!(expected_type_match_arm_body_with_leading_char);
1617 check_expected_type_and_name(
1622 match E::X { E::X => c$0 }
1625 expect![[r#"ty: Foo, name: ?"#]],
1630 fn expected_type_if_let_without_leading_char() {
1631 cov_mark::check!(expected_type_if_let_without_leading_char);
1632 check_expected_type_and_name(
1634 enum Foo { Bar, Baz, Quux }
1641 expect![[r#"ty: Foo, name: ?"#]],
1646 fn expected_type_if_let_with_leading_char() {
1647 cov_mark::check!(expected_type_if_let_with_leading_char);
1648 check_expected_type_and_name(
1650 enum Foo { Bar, Baz, Quux }
1657 expect![[r#"ty: Foo, name: ?"#]],
1662 fn expected_type_fn_ret_without_leading_char() {
1663 cov_mark::check!(expected_type_fn_ret_without_leading_char);
1664 check_expected_type_and_name(
1670 expect![[r#"ty: u32, name: ?"#]],
1675 fn expected_type_fn_ret_with_leading_char() {
1676 cov_mark::check!(expected_type_fn_ret_with_leading_char);
1677 check_expected_type_and_name(
1683 expect![[r#"ty: u32, name: ?"#]],
1688 fn expected_type_fn_ret_fn_ref_fully_typed() {
1689 check_expected_type_and_name(
1695 expect![[r#"ty: u32, name: ?"#]],
1700 fn expected_type_closure_param_return() {
1701 // FIXME: make this work with `|| $0`
1702 check_expected_type_and_name(
1709 fn bar(f: impl FnOnce() -> u32) {}
1711 expect![[r#"ty: u32, name: ?"#]],
1716 fn expected_type_generic_function() {
1717 check_expected_type_and_name(
1725 expect![[r#"ty: u32, name: t"#]],
1730 fn expected_type_generic_method() {
1731 check_expected_type_and_name(
1739 fn bar(self, t: T) {}
1742 expect![[r#"ty: u32, name: t"#]],
1747 fn expected_type_functional_update() {
1748 cov_mark::check!(expected_type_struct_func_update);
1749 check_expected_type_and_name(
1751 struct Foo { field: u32 }
1758 expect![[r#"ty: Foo, name: ?"#]],
1763 fn expected_type_param_pat() {
1764 check_expected_type_and_name(
1766 struct Foo { field: u32 }
1769 expect![[r#"ty: Foo, name: ?"#]],
1771 check_expected_type_and_name(
1773 struct Foo { field: u32 }
1776 // FIXME make this work, currently fails due to pattern recovery eating the `:`
1777 expect![[r#"ty: ?, name: ?"#]],