| use super::{Parser, PathStyle, TokenType}; |
| |
| use crate::errors::{ |
| self, DynAfterMut, ExpectedFnPathFoundFnKeyword, ExpectedMutOrConstInRawPointerType, |
| FnPointerCannotBeAsync, FnPointerCannotBeConst, FnPtrWithGenerics, FnPtrWithGenericsSugg, |
| InvalidDynKeyword, LifetimeAfterMut, NeedPlusAfterTraitObjectLifetime, NestedCVariadicType, |
| ReturnTypesUseThinArrow, |
| }; |
| use crate::{maybe_recover_from_interpolated_ty_qpath, maybe_whole}; |
| |
| use ast::DUMMY_NODE_ID; |
| use rustc_ast::ptr::P; |
| use rustc_ast::token::{self, Delimiter, Token, TokenKind}; |
| use rustc_ast::util::case::Case; |
| use rustc_ast::{ |
| self as ast, BareFnTy, BoundPolarity, FnRetTy, GenericBound, GenericBounds, GenericParam, |
| Generics, Lifetime, MacCall, MutTy, Mutability, PolyTraitRef, TraitBoundModifier, |
| TraitObjectSyntax, Ty, TyKind, |
| }; |
| use rustc_errors::{Applicability, PResult}; |
| use rustc_span::source_map::Span; |
| use rustc_span::symbol::{kw, sym, Ident}; |
| use rustc_span::Symbol; |
| use thin_vec::{thin_vec, ThinVec}; |
| |
| /// Any `?`, `!`, or `~const` modifiers that appear at the start of a bound. |
| struct BoundModifiers { |
| /// `?Trait`. |
| bound_polarity: BoundPolarity, |
| |
| /// `~const Trait`. |
| maybe_const: Option<Span>, |
| } |
| |
| impl BoundModifiers { |
| fn to_trait_bound_modifier(&self) -> TraitBoundModifier { |
| match (self.bound_polarity, self.maybe_const) { |
| (BoundPolarity::Positive, None) => TraitBoundModifier::None, |
| (BoundPolarity::Negative(_), None) => TraitBoundModifier::Negative, |
| (BoundPolarity::Maybe(_), None) => TraitBoundModifier::Maybe, |
| (BoundPolarity::Positive, Some(_)) => TraitBoundModifier::MaybeConst, |
| (BoundPolarity::Negative(_), Some(_)) => TraitBoundModifier::MaybeConstNegative, |
| (BoundPolarity::Maybe(_), Some(_)) => TraitBoundModifier::MaybeConstMaybe, |
| } |
| } |
| } |
| |
| #[derive(Copy, Clone, PartialEq)] |
| pub(super) enum AllowPlus { |
| Yes, |
| No, |
| } |
| |
| #[derive(PartialEq)] |
| pub(super) enum RecoverQPath { |
| Yes, |
| No, |
| } |
| |
| pub(super) enum RecoverQuestionMark { |
| Yes, |
| No, |
| } |
| |
| /// Signals whether parsing a type should recover `->`. |
| /// |
| /// More specifically, when parsing a function like: |
| /// ```compile_fail |
| /// fn foo() => u8 { 0 } |
| /// fn bar(): u8 { 0 } |
| /// ``` |
| /// The compiler will try to recover interpreting `foo() => u8` as `foo() -> u8` when calling |
| /// `parse_ty` with anything except `RecoverReturnSign::No`, and it will try to recover `bar(): u8` |
| /// as `bar() -> u8` when passing `RecoverReturnSign::Yes` to `parse_ty` |
| #[derive(Copy, Clone, PartialEq)] |
| pub(super) enum RecoverReturnSign { |
| Yes, |
| OnlyFatArrow, |
| No, |
| } |
| |
| impl RecoverReturnSign { |
| /// [RecoverReturnSign::Yes] allows for recovering `fn foo() => u8` and `fn foo(): u8`, |
| /// [RecoverReturnSign::OnlyFatArrow] allows for recovering only `fn foo() => u8` (recovering |
| /// colons can cause problems when parsing where clauses), and |
| /// [RecoverReturnSign::No] doesn't allow for any recovery of the return type arrow |
| fn can_recover(self, token: &TokenKind) -> bool { |
| match self { |
| Self::Yes => matches!(token, token::FatArrow | token::Colon), |
| Self::OnlyFatArrow => matches!(token, token::FatArrow), |
| Self::No => false, |
| } |
| } |
| } |
| |
| // Is `...` (`CVarArgs`) legal at this level of type parsing? |
| #[derive(PartialEq)] |
| enum AllowCVariadic { |
| Yes, |
| No, |
| } |
| |
| /// Returns `true` if `IDENT t` can start a type -- `IDENT::a::b`, `IDENT<u8, u8>`, |
| /// `IDENT<<u8 as Trait>::AssocTy>`. |
| /// |
| /// Types can also be of the form `IDENT(u8, u8) -> u8`, however this assumes |
| /// that `IDENT` is not the ident of a fn trait. |
| fn can_continue_type_after_non_fn_ident(t: &Token) -> bool { |
| t == &token::ModSep || t == &token::Lt || t == &token::BinOp(token::Shl) |
| } |
| |
| impl<'a> Parser<'a> { |
| /// Parses a type. |
| pub fn parse_ty(&mut self) -> PResult<'a, P<Ty>> { |
| self.parse_ty_common( |
| AllowPlus::Yes, |
| AllowCVariadic::No, |
| RecoverQPath::Yes, |
| RecoverReturnSign::Yes, |
| None, |
| RecoverQuestionMark::Yes, |
| ) |
| } |
| |
| pub(super) fn parse_ty_with_generics_recovery( |
| &mut self, |
| ty_params: &Generics, |
| ) -> PResult<'a, P<Ty>> { |
| self.parse_ty_common( |
| AllowPlus::Yes, |
| AllowCVariadic::No, |
| RecoverQPath::Yes, |
| RecoverReturnSign::Yes, |
| Some(ty_params), |
| RecoverQuestionMark::Yes, |
| ) |
| } |
| |
| /// Parse a type suitable for a function or function pointer parameter. |
| /// The difference from `parse_ty` is that this version allows `...` |
| /// (`CVarArgs`) at the top level of the type. |
| pub(super) fn parse_ty_for_param(&mut self) -> PResult<'a, P<Ty>> { |
| self.parse_ty_common( |
| AllowPlus::Yes, |
| AllowCVariadic::Yes, |
| RecoverQPath::Yes, |
| RecoverReturnSign::Yes, |
| None, |
| RecoverQuestionMark::Yes, |
| ) |
| } |
| |
| /// Parses a type in restricted contexts where `+` is not permitted. |
| /// |
| /// Example 1: `&'a TYPE` |
| /// `+` is prohibited to maintain operator priority (P(+) < P(&)). |
| /// Example 2: `value1 as TYPE + value2` |
| /// `+` is prohibited to avoid interactions with expression grammar. |
| pub(super) fn parse_ty_no_plus(&mut self) -> PResult<'a, P<Ty>> { |
| self.parse_ty_common( |
| AllowPlus::No, |
| AllowCVariadic::No, |
| RecoverQPath::Yes, |
| RecoverReturnSign::Yes, |
| None, |
| RecoverQuestionMark::Yes, |
| ) |
| } |
| |
| /// Parses a type following an `as` cast. Similar to `parse_ty_no_plus`, but signaling origin |
| /// for better diagnostics involving `?`. |
| pub(super) fn parse_as_cast_ty(&mut self) -> PResult<'a, P<Ty>> { |
| self.parse_ty_common( |
| AllowPlus::No, |
| AllowCVariadic::No, |
| RecoverQPath::Yes, |
| RecoverReturnSign::Yes, |
| None, |
| RecoverQuestionMark::No, |
| ) |
| } |
| |
| pub(super) fn parse_no_question_mark_recover(&mut self) -> PResult<'a, P<Ty>> { |
| self.parse_ty_common( |
| AllowPlus::Yes, |
| AllowCVariadic::No, |
| RecoverQPath::Yes, |
| RecoverReturnSign::Yes, |
| None, |
| RecoverQuestionMark::No, |
| ) |
| } |
| |
| /// Parse a type without recovering `:` as `->` to avoid breaking code such as `where fn() : for<'a>` |
| pub(super) fn parse_ty_for_where_clause(&mut self) -> PResult<'a, P<Ty>> { |
| self.parse_ty_common( |
| AllowPlus::Yes, |
| AllowCVariadic::Yes, |
| RecoverQPath::Yes, |
| RecoverReturnSign::OnlyFatArrow, |
| None, |
| RecoverQuestionMark::Yes, |
| ) |
| } |
| |
| /// Parses an optional return type `[ -> TY ]` in a function declaration. |
| pub(super) fn parse_ret_ty( |
| &mut self, |
| allow_plus: AllowPlus, |
| recover_qpath: RecoverQPath, |
| recover_return_sign: RecoverReturnSign, |
| ) -> PResult<'a, FnRetTy> { |
| Ok(if self.eat(&token::RArrow) { |
| // FIXME(Centril): Can we unconditionally `allow_plus`? |
| let ty = self.parse_ty_common( |
| allow_plus, |
| AllowCVariadic::No, |
| recover_qpath, |
| recover_return_sign, |
| None, |
| RecoverQuestionMark::Yes, |
| )?; |
| FnRetTy::Ty(ty) |
| } else if recover_return_sign.can_recover(&self.token.kind) { |
| // Don't `eat` to prevent `=>` from being added as an expected token which isn't |
| // actually expected and could only confuse users |
| self.bump(); |
| self.sess.emit_err(ReturnTypesUseThinArrow { span: self.prev_token.span }); |
| let ty = self.parse_ty_common( |
| allow_plus, |
| AllowCVariadic::No, |
| recover_qpath, |
| recover_return_sign, |
| None, |
| RecoverQuestionMark::Yes, |
| )?; |
| FnRetTy::Ty(ty) |
| } else { |
| FnRetTy::Default(self.token.span.shrink_to_lo()) |
| }) |
| } |
| |
| fn parse_ty_common( |
| &mut self, |
| allow_plus: AllowPlus, |
| allow_c_variadic: AllowCVariadic, |
| recover_qpath: RecoverQPath, |
| recover_return_sign: RecoverReturnSign, |
| ty_generics: Option<&Generics>, |
| recover_question_mark: RecoverQuestionMark, |
| ) -> PResult<'a, P<Ty>> { |
| let allow_qpath_recovery = recover_qpath == RecoverQPath::Yes; |
| maybe_recover_from_interpolated_ty_qpath!(self, allow_qpath_recovery); |
| maybe_whole!(self, NtTy, |x| x); |
| |
| let lo = self.token.span; |
| let mut impl_dyn_multi = false; |
| let kind = if self.check(&token::OpenDelim(Delimiter::Parenthesis)) { |
| self.parse_ty_tuple_or_parens(lo, allow_plus)? |
| } else if self.eat(&token::Not) { |
| // Never type `!` |
| TyKind::Never |
| } else if self.eat(&token::BinOp(token::Star)) { |
| self.parse_ty_ptr()? |
| } else if self.eat(&token::OpenDelim(Delimiter::Bracket)) { |
| self.parse_array_or_slice_ty()? |
| } else if self.check(&token::BinOp(token::And)) || self.check(&token::AndAnd) { |
| // Reference |
| self.expect_and()?; |
| self.parse_borrowed_pointee()? |
| } else if self.eat_keyword_noexpect(kw::Typeof) { |
| self.parse_typeof_ty()? |
| } else if self.eat_keyword(kw::Underscore) { |
| // A type to be inferred `_` |
| TyKind::Infer |
| } else if self.check_fn_front_matter(false, Case::Sensitive) { |
| // Function pointer type |
| self.parse_ty_bare_fn(lo, ThinVec::new(), None, recover_return_sign)? |
| } else if self.check_keyword(kw::For) { |
| // Function pointer type or bound list (trait object type) starting with a poly-trait. |
| // `for<'lt> [unsafe] [extern "ABI"] fn (&'lt S) -> T` |
| // `for<'lt> Trait1<'lt> + Trait2 + 'a` |
| let lifetime_defs = self.parse_late_bound_lifetime_defs()?; |
| if self.check_fn_front_matter(false, Case::Sensitive) { |
| self.parse_ty_bare_fn( |
| lo, |
| lifetime_defs, |
| Some(self.prev_token.span.shrink_to_lo()), |
| recover_return_sign, |
| )? |
| } else { |
| let path = self.parse_path(PathStyle::Type)?; |
| let parse_plus = allow_plus == AllowPlus::Yes && self.check_plus(); |
| self.parse_remaining_bounds_path(lifetime_defs, path, lo, parse_plus)? |
| } |
| } else if self.eat_keyword(kw::Impl) { |
| self.parse_impl_ty(&mut impl_dyn_multi)? |
| } else if self.is_explicit_dyn_type() { |
| self.parse_dyn_ty(&mut impl_dyn_multi)? |
| } else if self.eat_lt() { |
| // Qualified path |
| let (qself, path) = self.parse_qpath(PathStyle::Type)?; |
| TyKind::Path(Some(qself), path) |
| } else if self.check_path() { |
| self.parse_path_start_ty(lo, allow_plus, ty_generics)? |
| } else if self.can_begin_bound() { |
| self.parse_bare_trait_object(lo, allow_plus)? |
| } else if self.eat(&token::DotDotDot) { |
| match allow_c_variadic { |
| AllowCVariadic::Yes => TyKind::CVarArgs, |
| AllowCVariadic::No => { |
| // FIXME(Centril): Should we just allow `...` syntactically |
| // anywhere in a type and use semantic restrictions instead? |
| self.sess.emit_err(NestedCVariadicType { span: lo.to(self.prev_token.span) }); |
| TyKind::Err |
| } |
| } |
| } else { |
| let msg = format!("expected type, found {}", super::token_descr(&self.token)); |
| let mut err = self.struct_span_err(self.token.span, msg); |
| err.span_label(self.token.span, "expected type"); |
| return Err(err); |
| }; |
| |
| let span = lo.to(self.prev_token.span); |
| let mut ty = self.mk_ty(span, kind); |
| |
| // Try to recover from use of `+` with incorrect priority. |
| match allow_plus { |
| AllowPlus::Yes => self.maybe_recover_from_bad_type_plus(&ty)?, |
| AllowPlus::No => self.maybe_report_ambiguous_plus(impl_dyn_multi, &ty), |
| } |
| if let RecoverQuestionMark::Yes = recover_question_mark { |
| ty = self.maybe_recover_from_question_mark(ty); |
| } |
| if allow_qpath_recovery { self.maybe_recover_from_bad_qpath(ty) } else { Ok(ty) } |
| } |
| |
| /// Parses either: |
| /// - `(TYPE)`, a parenthesized type. |
| /// - `(TYPE,)`, a tuple with a single field of type TYPE. |
| fn parse_ty_tuple_or_parens(&mut self, lo: Span, allow_plus: AllowPlus) -> PResult<'a, TyKind> { |
| let mut trailing_plus = false; |
| let (ts, trailing) = self.parse_paren_comma_seq(|p| { |
| let ty = p.parse_ty()?; |
| trailing_plus = p.prev_token.kind == TokenKind::BinOp(token::Plus); |
| Ok(ty) |
| })?; |
| |
| if ts.len() == 1 && !trailing { |
| let ty = ts.into_iter().next().unwrap().into_inner(); |
| let maybe_bounds = allow_plus == AllowPlus::Yes && self.token.is_like_plus(); |
| match ty.kind { |
| // `(TY_BOUND_NOPAREN) + BOUND + ...`. |
| TyKind::Path(None, path) if maybe_bounds => { |
| self.parse_remaining_bounds_path(ThinVec::new(), path, lo, true) |
| } |
| TyKind::TraitObject(bounds, TraitObjectSyntax::None) |
| if maybe_bounds && bounds.len() == 1 && !trailing_plus => |
| { |
| self.parse_remaining_bounds(bounds, true) |
| } |
| // `(TYPE)` |
| _ => Ok(TyKind::Paren(P(ty))), |
| } |
| } else { |
| Ok(TyKind::Tup(ts)) |
| } |
| } |
| |
| fn parse_bare_trait_object(&mut self, lo: Span, allow_plus: AllowPlus) -> PResult<'a, TyKind> { |
| let lt_no_plus = self.check_lifetime() && !self.look_ahead(1, |t| t.is_like_plus()); |
| let bounds = self.parse_generic_bounds_common(allow_plus)?; |
| if lt_no_plus { |
| self.sess.emit_err(NeedPlusAfterTraitObjectLifetime { span: lo }); |
| } |
| Ok(TyKind::TraitObject(bounds, TraitObjectSyntax::None)) |
| } |
| |
| fn parse_remaining_bounds_path( |
| &mut self, |
| generic_params: ThinVec<GenericParam>, |
| path: ast::Path, |
| lo: Span, |
| parse_plus: bool, |
| ) -> PResult<'a, TyKind> { |
| let poly_trait_ref = PolyTraitRef::new(generic_params, path, lo.to(self.prev_token.span)); |
| let bounds = vec![GenericBound::Trait(poly_trait_ref, TraitBoundModifier::None)]; |
| self.parse_remaining_bounds(bounds, parse_plus) |
| } |
| |
| /// Parse the remainder of a bare trait object type given an already parsed list. |
| fn parse_remaining_bounds( |
| &mut self, |
| mut bounds: GenericBounds, |
| plus: bool, |
| ) -> PResult<'a, TyKind> { |
| if plus { |
| self.eat_plus(); // `+`, or `+=` gets split and `+` is discarded |
| bounds.append(&mut self.parse_generic_bounds()?); |
| } |
| Ok(TyKind::TraitObject(bounds, TraitObjectSyntax::None)) |
| } |
| |
| /// Parses a raw pointer type: `*[const | mut] $type`. |
| fn parse_ty_ptr(&mut self) -> PResult<'a, TyKind> { |
| let mutbl = self.parse_const_or_mut().unwrap_or_else(|| { |
| let span = self.prev_token.span; |
| self.sess.emit_err(ExpectedMutOrConstInRawPointerType { |
| span, |
| after_asterisk: span.shrink_to_hi(), |
| }); |
| Mutability::Not |
| }); |
| let ty = self.parse_ty_no_plus()?; |
| Ok(TyKind::Ptr(MutTy { ty, mutbl })) |
| } |
| |
| /// Parses an array (`[TYPE; EXPR]`) or slice (`[TYPE]`) type. |
| /// The opening `[` bracket is already eaten. |
| fn parse_array_or_slice_ty(&mut self) -> PResult<'a, TyKind> { |
| let elt_ty = match self.parse_ty() { |
| Ok(ty) => ty, |
| Err(mut err) |
| if self.look_ahead(1, |t| t.kind == token::CloseDelim(Delimiter::Bracket)) |
| | self.look_ahead(1, |t| t.kind == token::Semi) => |
| { |
| // Recover from `[LIT; EXPR]` and `[LIT]` |
| self.bump(); |
| err.emit(); |
| self.mk_ty(self.prev_token.span, TyKind::Err) |
| } |
| Err(err) => return Err(err), |
| }; |
| |
| let ty = if self.eat(&token::Semi) { |
| let mut length = self.parse_expr_anon_const()?; |
| if let Err(e) = self.expect(&token::CloseDelim(Delimiter::Bracket)) { |
| // Try to recover from `X<Y, ...>` when `X::<Y, ...>` works |
| self.check_mistyped_turbofish_with_multiple_type_params(e, &mut length.value)?; |
| self.expect(&token::CloseDelim(Delimiter::Bracket))?; |
| } |
| TyKind::Array(elt_ty, length) |
| } else { |
| self.expect(&token::CloseDelim(Delimiter::Bracket))?; |
| TyKind::Slice(elt_ty) |
| }; |
| |
| Ok(ty) |
| } |
| |
| fn parse_borrowed_pointee(&mut self) -> PResult<'a, TyKind> { |
| let and_span = self.prev_token.span; |
| let mut opt_lifetime = self.check_lifetime().then(|| self.expect_lifetime()); |
| let mut mutbl = self.parse_mutability(); |
| if self.token.is_lifetime() && mutbl == Mutability::Mut && opt_lifetime.is_none() { |
| // A lifetime is invalid here: it would be part of a bare trait bound, which requires |
| // it to be followed by a plus, but we disallow plus in the pointee type. |
| // So we can handle this case as an error here, and suggest `'a mut`. |
| // If there *is* a plus next though, handling the error later provides better suggestions |
| // (like adding parentheses) |
| if !self.look_ahead(1, |t| t.is_like_plus()) { |
| let lifetime_span = self.token.span; |
| let span = and_span.to(lifetime_span); |
| |
| let (suggest_lifetime, snippet) = |
| if let Ok(lifetime_src) = self.span_to_snippet(lifetime_span) { |
| (Some(span), lifetime_src) |
| } else { |
| (None, String::new()) |
| }; |
| self.sess.emit_err(LifetimeAfterMut { span, suggest_lifetime, snippet }); |
| |
| opt_lifetime = Some(self.expect_lifetime()); |
| } |
| } else if self.token.is_keyword(kw::Dyn) |
| && mutbl == Mutability::Not |
| && self.look_ahead(1, |t| t.is_keyword(kw::Mut)) |
| { |
| // We have `&dyn mut ...`, which is invalid and should be `&mut dyn ...`. |
| let span = and_span.to(self.look_ahead(1, |t| t.span)); |
| self.sess.emit_err(DynAfterMut { span }); |
| |
| // Recovery |
| mutbl = Mutability::Mut; |
| let (dyn_tok, dyn_tok_sp) = (self.token.clone(), self.token_spacing); |
| self.bump(); |
| self.bump_with((dyn_tok, dyn_tok_sp)); |
| } |
| let ty = self.parse_ty_no_plus()?; |
| Ok(TyKind::Ref(opt_lifetime, MutTy { ty, mutbl })) |
| } |
| |
| // Parses the `typeof(EXPR)`. |
| // To avoid ambiguity, the type is surrounded by parentheses. |
| fn parse_typeof_ty(&mut self) -> PResult<'a, TyKind> { |
| self.expect(&token::OpenDelim(Delimiter::Parenthesis))?; |
| let expr = self.parse_expr_anon_const()?; |
| self.expect(&token::CloseDelim(Delimiter::Parenthesis))?; |
| Ok(TyKind::Typeof(expr)) |
| } |
| |
| /// Parses a function pointer type (`TyKind::BareFn`). |
| /// ```ignore (illustrative) |
| /// [unsafe] [extern "ABI"] fn (S) -> T |
| /// // ^~~~~^ ^~~~^ ^~^ ^ |
| /// // | | | | |
| /// // | | | Return type |
| /// // Function Style ABI Parameter types |
| /// ``` |
| /// We actually parse `FnHeader FnDecl`, but we error on `const` and `async` qualifiers. |
| fn parse_ty_bare_fn( |
| &mut self, |
| lo: Span, |
| mut params: ThinVec<GenericParam>, |
| param_insertion_point: Option<Span>, |
| recover_return_sign: RecoverReturnSign, |
| ) -> PResult<'a, TyKind> { |
| let inherited_vis = rustc_ast::Visibility { |
| span: rustc_span::DUMMY_SP, |
| kind: rustc_ast::VisibilityKind::Inherited, |
| tokens: None, |
| }; |
| let span_start = self.token.span; |
| let ast::FnHeader { ext, unsafety, constness, asyncness } = |
| self.parse_fn_front_matter(&inherited_vis, Case::Sensitive)?; |
| if self.may_recover() && self.token.kind == TokenKind::Lt { |
| self.recover_fn_ptr_with_generics(lo, &mut params, param_insertion_point)?; |
| } |
| let decl = self.parse_fn_decl(|_| false, AllowPlus::No, recover_return_sign)?; |
| let whole_span = lo.to(self.prev_token.span); |
| if let ast::Const::Yes(span) = constness { |
| // If we ever start to allow `const fn()`, then update |
| // feature gating for `#![feature(const_extern_fn)]` to |
| // cover it. |
| self.sess.emit_err(FnPointerCannotBeConst { span: whole_span, qualifier: span }); |
| } |
| if let ast::Async::Yes { span, .. } = asyncness { |
| self.sess.emit_err(FnPointerCannotBeAsync { span: whole_span, qualifier: span }); |
| } |
| let decl_span = span_start.to(self.token.span); |
| Ok(TyKind::BareFn(P(BareFnTy { ext, unsafety, generic_params: params, decl, decl_span }))) |
| } |
| |
| /// Recover from function pointer types with a generic parameter list (e.g. `fn<'a>(&'a str)`). |
| fn recover_fn_ptr_with_generics( |
| &mut self, |
| lo: Span, |
| params: &mut ThinVec<GenericParam>, |
| param_insertion_point: Option<Span>, |
| ) -> PResult<'a, ()> { |
| let generics = self.parse_generics()?; |
| let arity = generics.params.len(); |
| |
| let mut lifetimes: ThinVec<_> = generics |
| .params |
| .into_iter() |
| .filter(|param| matches!(param.kind, ast::GenericParamKind::Lifetime)) |
| .collect(); |
| |
| let sugg = if !lifetimes.is_empty() { |
| let snippet = |
| lifetimes.iter().map(|param| param.ident.as_str()).intersperse(", ").collect(); |
| |
| let (left, snippet) = if let Some(span) = param_insertion_point { |
| (span, if params.is_empty() { snippet } else { format!(", {snippet}") }) |
| } else { |
| (lo.shrink_to_lo(), format!("for<{snippet}> ")) |
| }; |
| |
| Some(FnPtrWithGenericsSugg { |
| left, |
| snippet, |
| right: generics.span, |
| arity, |
| for_param_list_exists: param_insertion_point.is_some(), |
| }) |
| } else { |
| None |
| }; |
| |
| self.sess.emit_err(FnPtrWithGenerics { span: generics.span, sugg }); |
| params.append(&mut lifetimes); |
| Ok(()) |
| } |
| |
| /// Parses an `impl B0 + ... + Bn` type. |
| fn parse_impl_ty(&mut self, impl_dyn_multi: &mut bool) -> PResult<'a, TyKind> { |
| // Always parse bounds greedily for better error recovery. |
| if self.token.is_lifetime() { |
| self.look_ahead(1, |t| { |
| if let token::Ident(sym, _) = t.kind { |
| // parse pattern with "'a Sized" we're supposed to give suggestion like |
| // "'a + Sized" |
| self.sess.emit_err(errors::MissingPlusBounds { |
| span: self.token.span, |
| hi: self.token.span.shrink_to_hi(), |
| sym, |
| }); |
| } |
| }) |
| } |
| let bounds = self.parse_generic_bounds()?; |
| *impl_dyn_multi = bounds.len() > 1 || self.prev_token.kind == TokenKind::BinOp(token::Plus); |
| Ok(TyKind::ImplTrait(ast::DUMMY_NODE_ID, bounds)) |
| } |
| |
| /// Is a `dyn B0 + ... + Bn` type allowed here? |
| fn is_explicit_dyn_type(&mut self) -> bool { |
| self.check_keyword(kw::Dyn) |
| && (self.token.uninterpolated_span().rust_2018() |
| || self.look_ahead(1, |t| { |
| (t.can_begin_bound() || t.kind == TokenKind::BinOp(token::Star)) |
| && !can_continue_type_after_non_fn_ident(t) |
| })) |
| } |
| |
| /// Parses a `dyn B0 + ... + Bn` type. |
| /// |
| /// Note that this does *not* parse bare trait objects. |
| fn parse_dyn_ty(&mut self, impl_dyn_multi: &mut bool) -> PResult<'a, TyKind> { |
| let lo = self.token.span; |
| self.bump(); // `dyn` |
| |
| // parse dyn* types |
| let syntax = if self.eat(&TokenKind::BinOp(token::Star)) { |
| self.sess.gated_spans.gate(sym::dyn_star, lo.to(self.prev_token.span)); |
| TraitObjectSyntax::DynStar |
| } else { |
| TraitObjectSyntax::Dyn |
| }; |
| |
| // Always parse bounds greedily for better error recovery. |
| let bounds = self.parse_generic_bounds()?; |
| *impl_dyn_multi = bounds.len() > 1 || self.prev_token.kind == TokenKind::BinOp(token::Plus); |
| Ok(TyKind::TraitObject(bounds, syntax)) |
| } |
| |
| /// Parses a type starting with a path. |
| /// |
| /// This can be: |
| /// 1. a type macro, `mac!(...)`, |
| /// 2. a bare trait object, `B0 + ... + Bn`, |
| /// 3. or a path, `path::to::MyType`. |
| fn parse_path_start_ty( |
| &mut self, |
| lo: Span, |
| allow_plus: AllowPlus, |
| ty_generics: Option<&Generics>, |
| ) -> PResult<'a, TyKind> { |
| // Simple path |
| let path = self.parse_path_inner(PathStyle::Type, ty_generics)?; |
| if self.eat(&token::Not) { |
| // Macro invocation in type position |
| Ok(TyKind::MacCall(P(MacCall { path, args: self.parse_delim_args()? }))) |
| } else if allow_plus == AllowPlus::Yes && self.check_plus() { |
| // `Trait1 + Trait2 + 'a` |
| self.parse_remaining_bounds_path(ThinVec::new(), path, lo, true) |
| } else { |
| // Just a type path. |
| Ok(TyKind::Path(None, path)) |
| } |
| } |
| |
| pub(super) fn parse_generic_bounds(&mut self) -> PResult<'a, GenericBounds> { |
| self.parse_generic_bounds_common(AllowPlus::Yes) |
| } |
| |
| /// Parses bounds of a type parameter `BOUND + BOUND + ...`, possibly with trailing `+`. |
| /// |
| /// See `parse_generic_bound` for the `BOUND` grammar. |
| fn parse_generic_bounds_common(&mut self, allow_plus: AllowPlus) -> PResult<'a, GenericBounds> { |
| let mut bounds = Vec::new(); |
| |
| // In addition to looping while we find generic bounds: |
| // We continue even if we find a keyword. This is necessary for error recovery on, |
| // for example, `impl fn()`. The only keyword that can go after generic bounds is |
| // `where`, so stop if it's it. |
| // We also continue if we find types (not traits), again for error recovery. |
| while self.can_begin_bound() |
| || (self.may_recover() |
| && (self.token.can_begin_type() |
| || (self.token.is_reserved_ident() && !self.token.is_keyword(kw::Where)))) |
| { |
| if self.token.is_keyword(kw::Dyn) { |
| // Account for `&dyn Trait + dyn Other`. |
| self.sess.emit_err(InvalidDynKeyword { span: self.token.span }); |
| self.bump(); |
| } |
| bounds.push(self.parse_generic_bound()?); |
| if allow_plus == AllowPlus::No || !self.eat_plus() { |
| break; |
| } |
| } |
| |
| Ok(bounds) |
| } |
| |
| /// Can the current token begin a bound? |
| fn can_begin_bound(&mut self) -> bool { |
| // This needs to be synchronized with `TokenKind::can_begin_bound`. |
| self.check_path() |
| || self.check_lifetime() |
| || self.check(&token::Not) |
| || self.check(&token::Question) |
| || self.check(&token::Tilde) |
| || self.check_keyword(kw::For) |
| || self.check(&token::OpenDelim(Delimiter::Parenthesis)) |
| } |
| |
| /// Parses a bound according to the grammar: |
| /// ```ebnf |
| /// BOUND = TY_BOUND | LT_BOUND |
| /// ``` |
| fn parse_generic_bound(&mut self) -> PResult<'a, GenericBound> { |
| let lo = self.token.span; |
| let has_parens = self.eat(&token::OpenDelim(Delimiter::Parenthesis)); |
| let inner_lo = self.token.span; |
| |
| let modifiers = self.parse_ty_bound_modifiers()?; |
| let bound = if self.token.is_lifetime() { |
| self.error_lt_bound_with_modifiers(modifiers); |
| self.parse_generic_lt_bound(lo, inner_lo, has_parens)? |
| } else { |
| self.parse_generic_ty_bound(lo, has_parens, modifiers)? |
| }; |
| |
| Ok(bound) |
| } |
| |
| /// Parses a lifetime ("outlives") bound, e.g. `'a`, according to: |
| /// ```ebnf |
| /// LT_BOUND = LIFETIME |
| /// ``` |
| fn parse_generic_lt_bound( |
| &mut self, |
| lo: Span, |
| inner_lo: Span, |
| has_parens: bool, |
| ) -> PResult<'a, GenericBound> { |
| let bound = GenericBound::Outlives(self.expect_lifetime()); |
| if has_parens { |
| // FIXME(Centril): Consider not erroring here and accepting `('lt)` instead, |
| // possibly introducing `GenericBound::Paren(P<GenericBound>)`? |
| self.recover_paren_lifetime(lo, inner_lo)?; |
| } |
| Ok(bound) |
| } |
| |
| /// Emits an error if any trait bound modifiers were present. |
| fn error_lt_bound_with_modifiers(&self, modifiers: BoundModifiers) { |
| if let Some(span) = modifiers.maybe_const { |
| self.sess.emit_err(errors::TildeConstLifetime { span }); |
| } |
| |
| match modifiers.bound_polarity { |
| BoundPolarity::Positive => {} |
| BoundPolarity::Negative(span) => { |
| self.sess.emit_err(errors::ModifierLifetime { span, sigil: "!" }); |
| } |
| BoundPolarity::Maybe(span) => { |
| self.sess.emit_err(errors::ModifierLifetime { span, sigil: "?" }); |
| } |
| } |
| } |
| |
| /// Recover on `('lifetime)` with `(` already eaten. |
| fn recover_paren_lifetime(&mut self, lo: Span, inner_lo: Span) -> PResult<'a, ()> { |
| let inner_span = inner_lo.to(self.prev_token.span); |
| self.expect(&token::CloseDelim(Delimiter::Parenthesis))?; |
| let span = lo.to(self.prev_token.span); |
| let (sugg, snippet) = if let Ok(snippet) = self.span_to_snippet(inner_span) { |
| (Some(span), snippet) |
| } else { |
| (None, String::new()) |
| }; |
| |
| self.sess.emit_err(errors::ParenthesizedLifetime { span, sugg, snippet }); |
| Ok(()) |
| } |
| |
| /// Parses the modifiers that may precede a trait in a bound, e.g. `?Trait` or `~const Trait`. |
| /// |
| /// If no modifiers are present, this does not consume any tokens. |
| /// |
| /// ```ebnf |
| /// TY_BOUND_MODIFIERS = ["~const"] ["?"] |
| /// ``` |
| fn parse_ty_bound_modifiers(&mut self) -> PResult<'a, BoundModifiers> { |
| let maybe_const = if self.eat(&token::Tilde) { |
| let tilde = self.prev_token.span; |
| self.expect_keyword(kw::Const)?; |
| let span = tilde.to(self.prev_token.span); |
| self.sess.gated_spans.gate(sym::const_trait_impl, span); |
| Some(span) |
| } else if self.eat_keyword(kw::Const) { |
| let span = self.prev_token.span; |
| self.sess.gated_spans.gate(sym::const_trait_impl, span); |
| self.sess.emit_err(errors::ConstMissingTilde { span, start: span.shrink_to_lo() }); |
| |
| Some(span) |
| } else { |
| None |
| }; |
| |
| let bound_polarity = if self.eat(&token::Question) { |
| BoundPolarity::Maybe(self.prev_token.span) |
| } else if self.eat(&token::Not) { |
| self.sess.gated_spans.gate(sym::negative_bounds, self.prev_token.span); |
| BoundPolarity::Negative(self.prev_token.span) |
| } else { |
| BoundPolarity::Positive |
| }; |
| |
| Ok(BoundModifiers { bound_polarity, maybe_const }) |
| } |
| |
| /// Parses a type bound according to: |
| /// ```ebnf |
| /// TY_BOUND = TY_BOUND_NOPAREN | (TY_BOUND_NOPAREN) |
| /// TY_BOUND_NOPAREN = [TY_BOUND_MODIFIERS] [for<LT_PARAM_DEFS>] SIMPLE_PATH |
| /// ``` |
| /// |
| /// For example, this grammar accepts `~const ?for<'a: 'b> m::Trait<'a>`. |
| fn parse_generic_ty_bound( |
| &mut self, |
| lo: Span, |
| has_parens: bool, |
| modifiers: BoundModifiers, |
| ) -> PResult<'a, GenericBound> { |
| let mut lifetime_defs = self.parse_late_bound_lifetime_defs()?; |
| let mut path = if self.token.is_keyword(kw::Fn) |
| && self.look_ahead(1, |tok| tok.kind == TokenKind::OpenDelim(Delimiter::Parenthesis)) |
| && let Some(path) = self.recover_path_from_fn() |
| { |
| path |
| } else if !self.token.is_path_start() && self.token.can_begin_type() { |
| let ty = self.parse_ty_no_plus()?; |
| // Instead of finding a path (a trait), we found a type. |
| let mut err = self.struct_span_err(ty.span, "expected a trait, found type"); |
| |
| // If we can recover, try to extract a path from the type. Note |
| // that we do not use the try operator when parsing the type because |
| // if it fails then we get a parser error which we don't want (we're trying |
| // to recover from errors, not make more). |
| let path = if self.may_recover() |
| && matches!(ty.kind, TyKind::Ptr(..) | TyKind::Ref(..)) |
| && let TyKind::Path(_, path) = &ty.peel_refs().kind { |
| // Just get the indirection part of the type. |
| let span = ty.span.until(path.span); |
| |
| err.span_suggestion_verbose( |
| span, |
| "consider removing the indirection", |
| "", |
| Applicability::MaybeIncorrect, |
| ); |
| |
| path.clone() |
| } else { |
| return Err(err); |
| }; |
| |
| err.emit(); |
| |
| path |
| } else { |
| self.parse_path(PathStyle::Type)? |
| }; |
| |
| if self.may_recover() && self.token == TokenKind::OpenDelim(Delimiter::Parenthesis) { |
| self.recover_fn_trait_with_lifetime_params(&mut path, &mut lifetime_defs)?; |
| } |
| |
| if has_parens { |
| if self.token.is_like_plus() { |
| // Someone has written something like `&dyn (Trait + Other)`. The correct code |
| // would be `&(dyn Trait + Other)`, but we don't have access to the appropriate |
| // span to suggest that. When written as `&dyn Trait + Other`, an appropriate |
| // suggestion is given. |
| let bounds = vec![]; |
| self.parse_remaining_bounds(bounds, true)?; |
| self.expect(&token::CloseDelim(Delimiter::Parenthesis))?; |
| let sp = vec![lo, self.prev_token.span]; |
| self.sess.emit_err(errors::IncorrectBracesTraitBounds { |
| span: sp, |
| sugg: errors::IncorrectBracesTraitBoundsSugg { l: lo, r: self.prev_token.span }, |
| }); |
| } else { |
| self.expect(&token::CloseDelim(Delimiter::Parenthesis))?; |
| } |
| } |
| |
| let modifier = modifiers.to_trait_bound_modifier(); |
| let poly_trait = PolyTraitRef::new(lifetime_defs, path, lo.to(self.prev_token.span)); |
| Ok(GenericBound::Trait(poly_trait, modifier)) |
| } |
| |
| // recovers a `Fn(..)` parenthesized-style path from `fn(..)` |
| fn recover_path_from_fn(&mut self) -> Option<ast::Path> { |
| let fn_token_span = self.token.span; |
| self.bump(); |
| let args_lo = self.token.span; |
| let snapshot = self.create_snapshot_for_diagnostic(); |
| match self.parse_fn_decl(|_| false, AllowPlus::No, RecoverReturnSign::OnlyFatArrow) { |
| Ok(decl) => { |
| self.sess.emit_err(ExpectedFnPathFoundFnKeyword { fn_token_span }); |
| Some(ast::Path { |
| span: fn_token_span.to(self.prev_token.span), |
| segments: thin_vec![ast::PathSegment { |
| ident: Ident::new(Symbol::intern("Fn"), fn_token_span), |
| id: DUMMY_NODE_ID, |
| args: Some(P(ast::GenericArgs::Parenthesized(ast::ParenthesizedArgs { |
| span: args_lo.to(self.prev_token.span), |
| inputs: decl.inputs.iter().map(|a| a.ty.clone()).collect(), |
| inputs_span: args_lo.until(decl.output.span()), |
| output: decl.output.clone(), |
| }))), |
| }], |
| tokens: None, |
| }) |
| } |
| Err(diag) => { |
| diag.cancel(); |
| self.restore_snapshot(snapshot); |
| None |
| } |
| } |
| } |
| |
| /// Optionally parses `for<$generic_params>`. |
| pub(super) fn parse_late_bound_lifetime_defs(&mut self) -> PResult<'a, ThinVec<GenericParam>> { |
| if self.eat_keyword(kw::For) { |
| self.expect_lt()?; |
| let params = self.parse_generic_params()?; |
| self.expect_gt()?; |
| // We rely on AST validation to rule out invalid cases: There must not be type |
| // parameters, and the lifetime parameters must not have bounds. |
| Ok(params) |
| } else { |
| Ok(ThinVec::new()) |
| } |
| } |
| |
| /// Recover from `Fn`-family traits (Fn, FnMut, FnOnce) with lifetime arguments |
| /// (e.g. `FnOnce<'a>(&'a str) -> bool`). Up to generic arguments have already |
| /// been eaten. |
| fn recover_fn_trait_with_lifetime_params( |
| &mut self, |
| fn_path: &mut ast::Path, |
| lifetime_defs: &mut ThinVec<GenericParam>, |
| ) -> PResult<'a, ()> { |
| let fn_path_segment = fn_path.segments.last_mut().unwrap(); |
| let generic_args = if let Some(p_args) = &fn_path_segment.args { |
| p_args.clone().into_inner() |
| } else { |
| // Normally it wouldn't come here because the upstream should have parsed |
| // generic parameters (otherwise it's impossible to call this function). |
| return Ok(()); |
| }; |
| let lifetimes = |
| if let ast::GenericArgs::AngleBracketed(ast::AngleBracketedArgs { span: _, args }) = |
| &generic_args |
| { |
| args.into_iter() |
| .filter_map(|arg| { |
| if let ast::AngleBracketedArg::Arg(generic_arg) = arg |
| && let ast::GenericArg::Lifetime(lifetime) = generic_arg { |
| Some(lifetime) |
| } else { |
| None |
| } |
| }) |
| .collect() |
| } else { |
| Vec::new() |
| }; |
| // Only try to recover if the trait has lifetime params. |
| if lifetimes.is_empty() { |
| return Ok(()); |
| } |
| |
| // Parse `(T, U) -> R`. |
| let inputs_lo = self.token.span; |
| let inputs: ThinVec<_> = |
| self.parse_fn_params(|_| false)?.into_iter().map(|input| input.ty).collect(); |
| let inputs_span = inputs_lo.to(self.prev_token.span); |
| let output = self.parse_ret_ty(AllowPlus::No, RecoverQPath::No, RecoverReturnSign::No)?; |
| let args = ast::ParenthesizedArgs { |
| span: fn_path_segment.span().to(self.prev_token.span), |
| inputs, |
| inputs_span, |
| output, |
| } |
| .into(); |
| *fn_path_segment = ast::PathSegment { |
| ident: fn_path_segment.ident, |
| args: Some(args), |
| id: ast::DUMMY_NODE_ID, |
| }; |
| |
| // Convert parsed `<'a>` in `Fn<'a>` into `for<'a>`. |
| let mut generic_params = lifetimes |
| .iter() |
| .map(|lt| GenericParam { |
| id: lt.id, |
| ident: lt.ident, |
| attrs: ast::AttrVec::new(), |
| bounds: Vec::new(), |
| is_placeholder: false, |
| kind: ast::GenericParamKind::Lifetime, |
| colon_span: None, |
| }) |
| .collect::<ThinVec<GenericParam>>(); |
| lifetime_defs.append(&mut generic_params); |
| |
| let generic_args_span = generic_args.span(); |
| let mut err = |
| self.struct_span_err(generic_args_span, "`Fn` traits cannot take lifetime parameters"); |
| let snippet = format!( |
| "for<{}> ", |
| lifetimes.iter().map(|lt| lt.ident.as_str()).intersperse(", ").collect::<String>(), |
| ); |
| let before_fn_path = fn_path.span.shrink_to_lo(); |
| err.multipart_suggestion( |
| "consider using a higher-ranked trait bound instead", |
| vec![(generic_args_span, "".to_owned()), (before_fn_path, snippet)], |
| Applicability::MaybeIncorrect, |
| ) |
| .emit(); |
| Ok(()) |
| } |
| |
| pub(super) fn check_lifetime(&mut self) -> bool { |
| self.expected_tokens.push(TokenType::Lifetime); |
| self.token.is_lifetime() |
| } |
| |
| /// Parses a single lifetime `'a` or panics. |
| pub(super) fn expect_lifetime(&mut self) -> Lifetime { |
| if let Some(ident) = self.token.lifetime() { |
| self.bump(); |
| Lifetime { ident, id: ast::DUMMY_NODE_ID } |
| } else { |
| self.span_bug(self.token.span, "not a lifetime") |
| } |
| } |
| |
| pub(super) fn mk_ty(&self, span: Span, kind: TyKind) -> P<Ty> { |
| P(Ty { kind, span, id: ast::DUMMY_NODE_ID, tokens: None }) |
| } |
| } |
