]>
Commit | Line | Data |
---|---|---|
74b04a01 | 1 | use super::{Parser, PathStyle, TokenType}; |
416331ca | 2 | |
dfeec247 | 3 | use crate::{maybe_recover_from_interpolated_ty_qpath, maybe_whole}; |
416331ca | 4 | |
74b04a01 XL |
5 | use rustc_ast::ptr::P; |
6 | use rustc_ast::token::{self, Token, TokenKind}; | |
3c0e092e XL |
7 | use rustc_ast::{ |
8 | self as ast, BareFnTy, FnRetTy, GenericBound, GenericBounds, GenericParam, Generics, Lifetime, | |
9 | MacCall, MutTy, Mutability, PolyTraitRef, TraitBoundModifier, TraitObjectSyntax, Ty, TyKind, | |
10 | }; | |
dfeec247 XL |
11 | use rustc_errors::{pluralize, struct_span_err, Applicability, PResult}; |
12 | use rustc_span::source_map::Span; | |
13 | use rustc_span::symbol::{kw, sym}; | |
dfeec247 | 14 | |
94222f64 | 15 | /// Any `?` or `~const` modifiers that appear at the start of a bound. |
dfeec247 XL |
16 | struct BoundModifiers { |
17 | /// `?Trait`. | |
18 | maybe: Option<Span>, | |
19 | ||
94222f64 | 20 | /// `~const Trait`. |
dfeec247 XL |
21 | maybe_const: Option<Span>, |
22 | } | |
23 | ||
24 | impl BoundModifiers { | |
25 | fn to_trait_bound_modifier(&self) -> TraitBoundModifier { | |
26 | match (self.maybe, self.maybe_const) { | |
27 | (None, None) => TraitBoundModifier::None, | |
28 | (Some(_), None) => TraitBoundModifier::Maybe, | |
29 | (None, Some(_)) => TraitBoundModifier::MaybeConst, | |
30 | (Some(_), Some(_)) => TraitBoundModifier::MaybeConstMaybe, | |
31 | } | |
32 | } | |
33 | } | |
416331ca | 34 | |
74b04a01 XL |
35 | #[derive(Copy, Clone, PartialEq)] |
36 | pub(super) enum AllowPlus { | |
37 | Yes, | |
38 | No, | |
39 | } | |
40 | ||
41 | #[derive(PartialEq)] | |
42 | pub(super) enum RecoverQPath { | |
43 | Yes, | |
44 | No, | |
45 | } | |
46 | ||
5099ac24 FG |
47 | pub(super) enum RecoverQuestionMark { |
48 | Yes, | |
49 | No, | |
50 | } | |
51 | ||
fc512014 XL |
52 | /// Signals whether parsing a type should recover `->`. |
53 | /// | |
54 | /// More specifically, when parsing a function like: | |
55 | /// ```rust | |
56 | /// fn foo() => u8 { 0 } | |
57 | /// fn bar(): u8 { 0 } | |
58 | /// ``` | |
59 | /// The compiler will try to recover interpreting `foo() => u8` as `foo() -> u8` when calling | |
60 | /// `parse_ty` with anything except `RecoverReturnSign::No`, and it will try to recover `bar(): u8` | |
61 | /// as `bar() -> u8` when passing `RecoverReturnSign::Yes` to `parse_ty` | |
62 | #[derive(Copy, Clone, PartialEq)] | |
63 | pub(super) enum RecoverReturnSign { | |
64 | Yes, | |
65 | OnlyFatArrow, | |
66 | No, | |
67 | } | |
68 | ||
69 | impl RecoverReturnSign { | |
70 | /// [RecoverReturnSign::Yes] allows for recovering `fn foo() => u8` and `fn foo(): u8`, | |
71 | /// [RecoverReturnSign::OnlyFatArrow] allows for recovering only `fn foo() => u8` (recovering | |
72 | /// colons can cause problems when parsing where clauses), and | |
73 | /// [RecoverReturnSign::No] doesn't allow for any recovery of the return type arrow | |
74 | fn can_recover(self, token: &TokenKind) -> bool { | |
75 | match self { | |
76 | Self::Yes => matches!(token, token::FatArrow | token::Colon), | |
77 | Self::OnlyFatArrow => matches!(token, token::FatArrow), | |
78 | Self::No => false, | |
79 | } | |
80 | } | |
81 | } | |
82 | ||
74b04a01 XL |
83 | // Is `...` (`CVarArgs`) legal at this level of type parsing? |
84 | #[derive(PartialEq)] | |
85 | enum AllowCVariadic { | |
86 | Yes, | |
87 | No, | |
88 | } | |
89 | ||
416331ca XL |
90 | /// Returns `true` if `IDENT t` can start a type -- `IDENT::a::b`, `IDENT<u8, u8>`, |
91 | /// `IDENT<<u8 as Trait>::AssocTy>`. | |
92 | /// | |
93 | /// Types can also be of the form `IDENT(u8, u8) -> u8`, however this assumes | |
94 | /// that `IDENT` is not the ident of a fn trait. | |
95 | fn can_continue_type_after_non_fn_ident(t: &Token) -> bool { | |
dfeec247 | 96 | t == &token::ModSep || t == &token::Lt || t == &token::BinOp(token::Shl) |
416331ca XL |
97 | } |
98 | ||
99 | impl<'a> Parser<'a> { | |
100 | /// Parses a type. | |
101 | pub fn parse_ty(&mut self) -> PResult<'a, P<Ty>> { | |
fc512014 XL |
102 | self.parse_ty_common( |
103 | AllowPlus::Yes, | |
104 | AllowCVariadic::No, | |
105 | RecoverQPath::Yes, | |
106 | RecoverReturnSign::Yes, | |
3c0e092e | 107 | None, |
5099ac24 | 108 | RecoverQuestionMark::Yes, |
3c0e092e XL |
109 | ) |
110 | } | |
111 | ||
112 | pub(super) fn parse_ty_with_generics_recovery( | |
113 | &mut self, | |
114 | ty_params: &Generics, | |
115 | ) -> PResult<'a, P<Ty>> { | |
116 | self.parse_ty_common( | |
117 | AllowPlus::Yes, | |
118 | AllowCVariadic::No, | |
119 | RecoverQPath::Yes, | |
120 | RecoverReturnSign::Yes, | |
121 | Some(ty_params), | |
5099ac24 | 122 | RecoverQuestionMark::Yes, |
fc512014 | 123 | ) |
416331ca XL |
124 | } |
125 | ||
dfeec247 XL |
126 | /// Parse a type suitable for a function or function pointer parameter. |
127 | /// The difference from `parse_ty` is that this version allows `...` | |
1b1a35ee | 128 | /// (`CVarArgs`) at the top level of the type. |
dfeec247 | 129 | pub(super) fn parse_ty_for_param(&mut self) -> PResult<'a, P<Ty>> { |
fc512014 XL |
130 | self.parse_ty_common( |
131 | AllowPlus::Yes, | |
132 | AllowCVariadic::Yes, | |
133 | RecoverQPath::Yes, | |
134 | RecoverReturnSign::Yes, | |
3c0e092e | 135 | None, |
5099ac24 | 136 | RecoverQuestionMark::Yes, |
fc512014 | 137 | ) |
dfeec247 XL |
138 | } |
139 | ||
416331ca XL |
140 | /// Parses a type in restricted contexts where `+` is not permitted. |
141 | /// | |
142 | /// Example 1: `&'a TYPE` | |
143 | /// `+` is prohibited to maintain operator priority (P(+) < P(&)). | |
144 | /// Example 2: `value1 as TYPE + value2` | |
145 | /// `+` is prohibited to avoid interactions with expression grammar. | |
146 | pub(super) fn parse_ty_no_plus(&mut self) -> PResult<'a, P<Ty>> { | |
fc512014 XL |
147 | self.parse_ty_common( |
148 | AllowPlus::No, | |
149 | AllowCVariadic::No, | |
150 | RecoverQPath::Yes, | |
151 | RecoverReturnSign::Yes, | |
3c0e092e | 152 | None, |
5099ac24 FG |
153 | RecoverQuestionMark::Yes, |
154 | ) | |
155 | } | |
156 | ||
157 | /// Parses a type following an `as` cast. Similar to `parse_ty_no_plus`, but signaling origin | |
158 | /// for better diagnostics involving `?`. | |
159 | pub(super) fn parse_as_cast_ty(&mut self) -> PResult<'a, P<Ty>> { | |
160 | self.parse_ty_common( | |
161 | AllowPlus::No, | |
162 | AllowCVariadic::No, | |
163 | RecoverQPath::Yes, | |
164 | RecoverReturnSign::Yes, | |
165 | None, | |
166 | RecoverQuestionMark::No, | |
167 | ) | |
168 | } | |
169 | ||
170 | pub(super) fn parse_no_question_mark_recover(&mut self) -> PResult<'a, P<Ty>> { | |
171 | self.parse_ty_common( | |
172 | AllowPlus::Yes, | |
173 | AllowCVariadic::No, | |
174 | RecoverQPath::Yes, | |
175 | RecoverReturnSign::Yes, | |
176 | None, | |
177 | RecoverQuestionMark::No, | |
fc512014 XL |
178 | ) |
179 | } | |
180 | ||
181 | /// Parse a type without recovering `:` as `->` to avoid breaking code such as `where fn() : for<'a>` | |
182 | pub(super) fn parse_ty_for_where_clause(&mut self) -> PResult<'a, P<Ty>> { | |
183 | self.parse_ty_common( | |
184 | AllowPlus::Yes, | |
185 | AllowCVariadic::Yes, | |
186 | RecoverQPath::Yes, | |
187 | RecoverReturnSign::OnlyFatArrow, | |
3c0e092e | 188 | None, |
5099ac24 | 189 | RecoverQuestionMark::Yes, |
fc512014 | 190 | ) |
416331ca XL |
191 | } |
192 | ||
193 | /// Parses an optional return type `[ -> TY ]` in a function declaration. | |
dfeec247 XL |
194 | pub(super) fn parse_ret_ty( |
195 | &mut self, | |
74b04a01 XL |
196 | allow_plus: AllowPlus, |
197 | recover_qpath: RecoverQPath, | |
fc512014 | 198 | recover_return_sign: RecoverReturnSign, |
74b04a01 | 199 | ) -> PResult<'a, FnRetTy> { |
dfeec247 XL |
200 | Ok(if self.eat(&token::RArrow) { |
201 | // FIXME(Centril): Can we unconditionally `allow_plus`? | |
fc512014 XL |
202 | let ty = self.parse_ty_common( |
203 | allow_plus, | |
204 | AllowCVariadic::No, | |
205 | recover_qpath, | |
206 | recover_return_sign, | |
3c0e092e | 207 | None, |
5099ac24 | 208 | RecoverQuestionMark::Yes, |
fc512014 XL |
209 | )?; |
210 | FnRetTy::Ty(ty) | |
211 | } else if recover_return_sign.can_recover(&self.token.kind) { | |
212 | // Don't `eat` to prevent `=>` from being added as an expected token which isn't | |
213 | // actually expected and could only confuse users | |
214 | self.bump(); | |
215 | self.struct_span_err(self.prev_token.span, "return types are denoted using `->`") | |
216 | .span_suggestion_short( | |
217 | self.prev_token.span, | |
218 | "use `->` instead", | |
219 | "->".to_string(), | |
220 | Applicability::MachineApplicable, | |
221 | ) | |
222 | .emit(); | |
223 | let ty = self.parse_ty_common( | |
224 | allow_plus, | |
225 | AllowCVariadic::No, | |
226 | recover_qpath, | |
227 | recover_return_sign, | |
3c0e092e | 228 | None, |
5099ac24 | 229 | RecoverQuestionMark::Yes, |
fc512014 | 230 | )?; |
74b04a01 | 231 | FnRetTy::Ty(ty) |
416331ca | 232 | } else { |
74b04a01 | 233 | FnRetTy::Default(self.token.span.shrink_to_lo()) |
dfeec247 | 234 | }) |
416331ca XL |
235 | } |
236 | ||
dfeec247 XL |
237 | fn parse_ty_common( |
238 | &mut self, | |
74b04a01 | 239 | allow_plus: AllowPlus, |
74b04a01 | 240 | allow_c_variadic: AllowCVariadic, |
fc512014 XL |
241 | recover_qpath: RecoverQPath, |
242 | recover_return_sign: RecoverReturnSign, | |
3c0e092e | 243 | ty_generics: Option<&Generics>, |
5099ac24 | 244 | recover_question_mark: RecoverQuestionMark, |
dfeec247 | 245 | ) -> PResult<'a, P<Ty>> { |
74b04a01 | 246 | let allow_qpath_recovery = recover_qpath == RecoverQPath::Yes; |
416331ca XL |
247 | maybe_recover_from_interpolated_ty_qpath!(self, allow_qpath_recovery); |
248 | maybe_whole!(self, NtTy, |x| x); | |
249 | ||
250 | let lo = self.token.span; | |
251 | let mut impl_dyn_multi = false; | |
dfeec247 XL |
252 | let kind = if self.check(&token::OpenDelim(token::Paren)) { |
253 | self.parse_ty_tuple_or_parens(lo, allow_plus)? | |
416331ca XL |
254 | } else if self.eat(&token::Not) { |
255 | // Never type `!` | |
256 | TyKind::Never | |
257 | } else if self.eat(&token::BinOp(token::Star)) { | |
dfeec247 | 258 | self.parse_ty_ptr()? |
416331ca | 259 | } else if self.eat(&token::OpenDelim(token::Bracket)) { |
dfeec247 | 260 | self.parse_array_or_slice_ty()? |
416331ca XL |
261 | } else if self.check(&token::BinOp(token::And)) || self.check(&token::AndAnd) { |
262 | // Reference | |
263 | self.expect_and()?; | |
264 | self.parse_borrowed_pointee()? | |
265 | } else if self.eat_keyword_noexpect(kw::Typeof) { | |
dfeec247 | 266 | self.parse_typeof_ty()? |
416331ca XL |
267 | } else if self.eat_keyword(kw::Underscore) { |
268 | // A type to be inferred `_` | |
269 | TyKind::Infer | |
6a06907d | 270 | } else if self.check_fn_front_matter(false) { |
416331ca | 271 | // Function pointer type |
fc512014 | 272 | self.parse_ty_bare_fn(lo, Vec::new(), recover_return_sign)? |
416331ca XL |
273 | } else if self.check_keyword(kw::For) { |
274 | // Function pointer type or bound list (trait object type) starting with a poly-trait. | |
275 | // `for<'lt> [unsafe] [extern "ABI"] fn (&'lt S) -> T` | |
276 | // `for<'lt> Trait1<'lt> + Trait2 + 'a` | |
416331ca | 277 | let lifetime_defs = self.parse_late_bound_lifetime_defs()?; |
6a06907d | 278 | if self.check_fn_front_matter(false) { |
fc512014 | 279 | self.parse_ty_bare_fn(lo, lifetime_defs, recover_return_sign)? |
416331ca XL |
280 | } else { |
281 | let path = self.parse_path(PathStyle::Type)?; | |
74b04a01 | 282 | let parse_plus = allow_plus == AllowPlus::Yes && self.check_plus(); |
ba9703b0 | 283 | self.parse_remaining_bounds_path(lifetime_defs, path, lo, parse_plus)? |
416331ca XL |
284 | } |
285 | } else if self.eat_keyword(kw::Impl) { | |
dfeec247 XL |
286 | self.parse_impl_ty(&mut impl_dyn_multi)? |
287 | } else if self.is_explicit_dyn_type() { | |
288 | self.parse_dyn_ty(&mut impl_dyn_multi)? | |
416331ca XL |
289 | } else if self.eat_lt() { |
290 | // Qualified path | |
291 | let (qself, path) = self.parse_qpath(PathStyle::Type)?; | |
292 | TyKind::Path(Some(qself), path) | |
ba9703b0 | 293 | } else if self.check_path() { |
3c0e092e | 294 | self.parse_path_start_ty(lo, allow_plus, ty_generics)? |
ba9703b0 XL |
295 | } else if self.can_begin_bound() { |
296 | self.parse_bare_trait_object(lo, allow_plus)? | |
dfeec247 | 297 | } else if self.eat(&token::DotDotDot) { |
74b04a01 | 298 | if allow_c_variadic == AllowCVariadic::Yes { |
416331ca XL |
299 | TyKind::CVarArgs |
300 | } else { | |
dfeec247 XL |
301 | // FIXME(Centril): Should we just allow `...` syntactically |
302 | // anywhere in a type and use semantic restrictions instead? | |
303 | self.error_illegal_c_varadic_ty(lo); | |
304 | TyKind::Err | |
416331ca XL |
305 | } |
306 | } else { | |
dfeec247 XL |
307 | let msg = format!("expected type, found {}", super::token_descr(&self.token)); |
308 | let mut err = self.struct_span_err(self.token.span, &msg); | |
416331ca XL |
309 | err.span_label(self.token.span, "expected type"); |
310 | self.maybe_annotate_with_ascription(&mut err, true); | |
311 | return Err(err); | |
312 | }; | |
313 | ||
74b04a01 | 314 | let span = lo.to(self.prev_token.span); |
e74abb32 | 315 | let ty = self.mk_ty(span, kind); |
416331ca XL |
316 | |
317 | // Try to recover from use of `+` with incorrect priority. | |
318 | self.maybe_report_ambiguous_plus(allow_plus, impl_dyn_multi, &ty); | |
319 | self.maybe_recover_from_bad_type_plus(allow_plus, &ty)?; | |
5099ac24 | 320 | let ty = self.maybe_recover_from_question_mark(ty, recover_question_mark); |
416331ca XL |
321 | self.maybe_recover_from_bad_qpath(ty, allow_qpath_recovery) |
322 | } | |
323 | ||
dfeec247 XL |
324 | /// Parses either: |
325 | /// - `(TYPE)`, a parenthesized type. | |
326 | /// - `(TYPE,)`, a tuple with a single field of type TYPE. | |
74b04a01 | 327 | fn parse_ty_tuple_or_parens(&mut self, lo: Span, allow_plus: AllowPlus) -> PResult<'a, TyKind> { |
dfeec247 XL |
328 | let mut trailing_plus = false; |
329 | let (ts, trailing) = self.parse_paren_comma_seq(|p| { | |
330 | let ty = p.parse_ty()?; | |
74b04a01 | 331 | trailing_plus = p.prev_token.kind == TokenKind::BinOp(token::Plus); |
dfeec247 XL |
332 | Ok(ty) |
333 | })?; | |
334 | ||
335 | if ts.len() == 1 && !trailing { | |
74b04a01 XL |
336 | let ty = ts.into_iter().next().unwrap().into_inner(); |
337 | let maybe_bounds = allow_plus == AllowPlus::Yes && self.token.is_like_plus(); | |
dfeec247 XL |
338 | match ty.kind { |
339 | // `(TY_BOUND_NOPAREN) + BOUND + ...`. | |
340 | TyKind::Path(None, path) if maybe_bounds => { | |
ba9703b0 | 341 | self.parse_remaining_bounds_path(Vec::new(), path, lo, true) |
dfeec247 | 342 | } |
ba9703b0 | 343 | TyKind::TraitObject(bounds, TraitObjectSyntax::None) |
dfeec247 XL |
344 | if maybe_bounds && bounds.len() == 1 && !trailing_plus => |
345 | { | |
ba9703b0 | 346 | self.parse_remaining_bounds(bounds, true) |
dfeec247 XL |
347 | } |
348 | // `(TYPE)` | |
349 | _ => Ok(TyKind::Paren(P(ty))), | |
350 | } | |
351 | } else { | |
352 | Ok(TyKind::Tup(ts)) | |
353 | } | |
354 | } | |
355 | ||
ba9703b0 XL |
356 | fn parse_bare_trait_object(&mut self, lo: Span, allow_plus: AllowPlus) -> PResult<'a, TyKind> { |
357 | let lt_no_plus = self.check_lifetime() && !self.look_ahead(1, |t| t.is_like_plus()); | |
358 | let bounds = self.parse_generic_bounds_common(allow_plus, None)?; | |
359 | if lt_no_plus { | |
5e7ed085 FG |
360 | self.struct_span_err(lo, "lifetime in trait object type must be followed by `+`") |
361 | .emit(); | |
ba9703b0 XL |
362 | } |
363 | Ok(TyKind::TraitObject(bounds, TraitObjectSyntax::None)) | |
364 | } | |
365 | ||
366 | fn parse_remaining_bounds_path( | |
dfeec247 XL |
367 | &mut self, |
368 | generic_params: Vec<GenericParam>, | |
369 | path: ast::Path, | |
370 | lo: Span, | |
371 | parse_plus: bool, | |
372 | ) -> PResult<'a, TyKind> { | |
74b04a01 | 373 | let poly_trait_ref = PolyTraitRef::new(generic_params, path, lo.to(self.prev_token.span)); |
ba9703b0 XL |
374 | let bounds = vec![GenericBound::Trait(poly_trait_ref, TraitBoundModifier::None)]; |
375 | self.parse_remaining_bounds(bounds, parse_plus) | |
376 | } | |
377 | ||
378 | /// Parse the remainder of a bare trait object type given an already parsed list. | |
379 | fn parse_remaining_bounds( | |
380 | &mut self, | |
381 | mut bounds: GenericBounds, | |
382 | plus: bool, | |
383 | ) -> PResult<'a, TyKind> { | |
ba9703b0 | 384 | if plus { |
416331ca | 385 | self.eat_plus(); // `+`, or `+=` gets split and `+` is discarded |
74b04a01 | 386 | bounds.append(&mut self.parse_generic_bounds(Some(self.prev_token.span))?); |
416331ca XL |
387 | } |
388 | Ok(TyKind::TraitObject(bounds, TraitObjectSyntax::None)) | |
389 | } | |
390 | ||
dfeec247 XL |
391 | /// Parses a raw pointer type: `*[const | mut] $type`. |
392 | fn parse_ty_ptr(&mut self) -> PResult<'a, TyKind> { | |
e74abb32 | 393 | let mutbl = self.parse_const_or_mut().unwrap_or_else(|| { |
74b04a01 | 394 | let span = self.prev_token.span; |
416331ca XL |
395 | let msg = "expected mut or const in raw pointer type"; |
396 | self.struct_span_err(span, msg) | |
397 | .span_label(span, msg) | |
398 | .help("use `*mut T` or `*const T` as appropriate") | |
399 | .emit(); | |
dfeec247 | 400 | Mutability::Not |
e74abb32 | 401 | }); |
dfeec247 XL |
402 | let ty = self.parse_ty_no_plus()?; |
403 | Ok(TyKind::Ptr(MutTy { ty, mutbl })) | |
416331ca XL |
404 | } |
405 | ||
dfeec247 XL |
406 | /// Parses an array (`[TYPE; EXPR]`) or slice (`[TYPE]`) type. |
407 | /// The opening `[` bracket is already eaten. | |
408 | fn parse_array_or_slice_ty(&mut self) -> PResult<'a, TyKind> { | |
29967ef6 XL |
409 | let elt_ty = match self.parse_ty() { |
410 | Ok(ty) => ty, | |
411 | Err(mut err) | |
412 | if self.look_ahead(1, |t| t.kind == token::CloseDelim(token::Bracket)) | |
413 | | self.look_ahead(1, |t| t.kind == token::Semi) => | |
414 | { | |
415 | // Recover from `[LIT; EXPR]` and `[LIT]` | |
416 | self.bump(); | |
417 | err.emit(); | |
418 | self.mk_ty(self.prev_token.span, TyKind::Err) | |
419 | } | |
420 | Err(err) => return Err(err), | |
421 | }; | |
6a06907d | 422 | |
dfeec247 | 423 | let ty = if self.eat(&token::Semi) { |
6a06907d XL |
424 | let mut length = self.parse_anon_const_expr()?; |
425 | if let Err(e) = self.expect(&token::CloseDelim(token::Bracket)) { | |
426 | // Try to recover from `X<Y, ...>` when `X::<Y, ...>` works | |
427 | self.check_mistyped_turbofish_with_multiple_type_params(e, &mut length.value)?; | |
428 | self.expect(&token::CloseDelim(token::Bracket))?; | |
429 | } | |
430 | TyKind::Array(elt_ty, length) | |
416331ca | 431 | } else { |
6a06907d | 432 | self.expect(&token::CloseDelim(token::Bracket))?; |
dfeec247 XL |
433 | TyKind::Slice(elt_ty) |
434 | }; | |
6a06907d | 435 | |
dfeec247 | 436 | Ok(ty) |
416331ca XL |
437 | } |
438 | ||
439 | fn parse_borrowed_pointee(&mut self) -> PResult<'a, TyKind> { | |
1b1a35ee XL |
440 | let and_span = self.prev_token.span; |
441 | let mut opt_lifetime = | |
442 | if self.check_lifetime() { Some(self.expect_lifetime()) } else { None }; | |
136023e0 | 443 | let mut mutbl = self.parse_mutability(); |
1b1a35ee XL |
444 | if self.token.is_lifetime() && mutbl == Mutability::Mut && opt_lifetime.is_none() { |
445 | // A lifetime is invalid here: it would be part of a bare trait bound, which requires | |
446 | // it to be followed by a plus, but we disallow plus in the pointee type. | |
447 | // So we can handle this case as an error here, and suggest `'a mut`. | |
448 | // If there *is* a plus next though, handling the error later provides better suggestions | |
449 | // (like adding parentheses) | |
450 | if !self.look_ahead(1, |t| t.is_like_plus()) { | |
451 | let lifetime_span = self.token.span; | |
452 | let span = and_span.to(lifetime_span); | |
453 | ||
454 | let mut err = self.struct_span_err(span, "lifetime must precede `mut`"); | |
455 | if let Ok(lifetime_src) = self.span_to_snippet(lifetime_span) { | |
456 | err.span_suggestion( | |
457 | span, | |
458 | "place the lifetime before `mut`", | |
459 | format!("&{} mut", lifetime_src), | |
460 | Applicability::MaybeIncorrect, | |
461 | ); | |
462 | } | |
463 | err.emit(); | |
464 | ||
465 | opt_lifetime = Some(self.expect_lifetime()); | |
466 | } | |
136023e0 XL |
467 | } else if self.token.is_keyword(kw::Dyn) |
468 | && mutbl == Mutability::Not | |
469 | && self.look_ahead(1, |t| t.is_keyword(kw::Mut)) | |
470 | { | |
471 | // We have `&dyn mut ...`, which is invalid and should be `&mut dyn ...`. | |
472 | let span = and_span.to(self.look_ahead(1, |t| t.span)); | |
473 | let mut err = self.struct_span_err(span, "`mut` must precede `dyn`"); | |
474 | err.span_suggestion( | |
475 | span, | |
476 | "place `mut` before `dyn`", | |
477 | "&mut dyn".to_string(), | |
478 | Applicability::MachineApplicable, | |
479 | ); | |
480 | err.emit(); | |
481 | ||
482 | // Recovery | |
483 | mutbl = Mutability::Mut; | |
484 | let (dyn_tok, dyn_tok_sp) = (self.token.clone(), self.token_spacing); | |
485 | self.bump(); | |
486 | self.bump_with((dyn_tok, dyn_tok_sp)); | |
1b1a35ee | 487 | } |
416331ca | 488 | let ty = self.parse_ty_no_plus()?; |
dfeec247 XL |
489 | Ok(TyKind::Rptr(opt_lifetime, MutTy { ty, mutbl })) |
490 | } | |
491 | ||
492 | // Parses the `typeof(EXPR)`. | |
3c0e092e | 493 | // To avoid ambiguity, the type is surrounded by parentheses. |
dfeec247 XL |
494 | fn parse_typeof_ty(&mut self) -> PResult<'a, TyKind> { |
495 | self.expect(&token::OpenDelim(token::Paren))?; | |
496 | let expr = self.parse_anon_const_expr()?; | |
497 | self.expect(&token::CloseDelim(token::Paren))?; | |
498 | Ok(TyKind::Typeof(expr)) | |
416331ca XL |
499 | } |
500 | ||
dfeec247 XL |
501 | /// Parses a function pointer type (`TyKind::BareFn`). |
502 | /// ``` | |
503 | /// [unsafe] [extern "ABI"] fn (S) -> T | |
504 | /// ^~~~~^ ^~~~^ ^~^ ^ | |
505 | /// | | | | | |
506 | /// | | | Return type | |
507 | /// Function Style ABI Parameter types | |
508 | /// ``` | |
ba9703b0 | 509 | /// We actually parse `FnHeader FnDecl`, but we error on `const` and `async` qualifiers. |
fc512014 XL |
510 | fn parse_ty_bare_fn( |
511 | &mut self, | |
512 | lo: Span, | |
513 | params: Vec<GenericParam>, | |
514 | recover_return_sign: RecoverReturnSign, | |
515 | ) -> PResult<'a, TyKind> { | |
a2a8927a XL |
516 | let inherited_vis = rustc_ast::Visibility { |
517 | span: rustc_span::DUMMY_SP, | |
518 | kind: rustc_ast::VisibilityKind::Inherited, | |
519 | tokens: None, | |
520 | }; | |
521 | let ast::FnHeader { ext, unsafety, constness, asyncness } = | |
522 | self.parse_fn_front_matter(&inherited_vis)?; | |
fc512014 | 523 | let decl = self.parse_fn_decl(|_| false, AllowPlus::No, recover_return_sign)?; |
ba9703b0 XL |
524 | let whole_span = lo.to(self.prev_token.span); |
525 | if let ast::Const::Yes(span) = constness { | |
526 | self.error_fn_ptr_bad_qualifier(whole_span, span, "const"); | |
527 | } | |
528 | if let ast::Async::Yes { span, .. } = asyncness { | |
529 | self.error_fn_ptr_bad_qualifier(whole_span, span, "async"); | |
530 | } | |
531 | Ok(TyKind::BareFn(P(BareFnTy { ext, unsafety, generic_params: params, decl }))) | |
532 | } | |
533 | ||
534 | /// Emit an error for the given bad function pointer qualifier. | |
535 | fn error_fn_ptr_bad_qualifier(&self, span: Span, qual_span: Span, qual: &str) { | |
536 | self.struct_span_err(span, &format!("an `fn` pointer type cannot be `{}`", qual)) | |
537 | .span_label(qual_span, format!("`{}` because of this", qual)) | |
538 | .span_suggestion_short( | |
539 | qual_span, | |
540 | &format!("remove the `{}` qualifier", qual), | |
541 | String::new(), | |
542 | Applicability::MaybeIncorrect, | |
543 | ) | |
544 | .emit(); | |
dfeec247 XL |
545 | } |
546 | ||
547 | /// Parses an `impl B0 + ... + Bn` type. | |
548 | fn parse_impl_ty(&mut self, impl_dyn_multi: &mut bool) -> PResult<'a, TyKind> { | |
549 | // Always parse bounds greedily for better error recovery. | |
550 | let bounds = self.parse_generic_bounds(None)?; | |
74b04a01 | 551 | *impl_dyn_multi = bounds.len() > 1 || self.prev_token.kind == TokenKind::BinOp(token::Plus); |
dfeec247 XL |
552 | Ok(TyKind::ImplTrait(ast::DUMMY_NODE_ID, bounds)) |
553 | } | |
554 | ||
555 | /// Is a `dyn B0 + ... + Bn` type allowed here? | |
556 | fn is_explicit_dyn_type(&mut self) -> bool { | |
557 | self.check_keyword(kw::Dyn) | |
17df50a5 | 558 | && (!self.token.uninterpolated_span().rust_2015() |
dfeec247 XL |
559 | || self.look_ahead(1, |t| { |
560 | t.can_begin_bound() && !can_continue_type_after_non_fn_ident(t) | |
561 | })) | |
562 | } | |
563 | ||
564 | /// Parses a `dyn B0 + ... + Bn` type. | |
565 | /// | |
566 | /// Note that this does *not* parse bare trait objects. | |
567 | fn parse_dyn_ty(&mut self, impl_dyn_multi: &mut bool) -> PResult<'a, TyKind> { | |
568 | self.bump(); // `dyn` | |
569 | // Always parse bounds greedily for better error recovery. | |
570 | let bounds = self.parse_generic_bounds(None)?; | |
74b04a01 | 571 | *impl_dyn_multi = bounds.len() > 1 || self.prev_token.kind == TokenKind::BinOp(token::Plus); |
dfeec247 | 572 | Ok(TyKind::TraitObject(bounds, TraitObjectSyntax::Dyn)) |
416331ca XL |
573 | } |
574 | ||
dfeec247 XL |
575 | /// Parses a type starting with a path. |
576 | /// | |
577 | /// This can be: | |
578 | /// 1. a type macro, `mac!(...)`, | |
579 | /// 2. a bare trait object, `B0 + ... + Bn`, | |
580 | /// 3. or a path, `path::to::MyType`. | |
3c0e092e XL |
581 | fn parse_path_start_ty( |
582 | &mut self, | |
583 | lo: Span, | |
584 | allow_plus: AllowPlus, | |
585 | ty_generics: Option<&Generics>, | |
586 | ) -> PResult<'a, TyKind> { | |
dfeec247 | 587 | // Simple path |
3c0e092e | 588 | let path = self.parse_path_inner(PathStyle::Type, ty_generics)?; |
dfeec247 XL |
589 | if self.eat(&token::Not) { |
590 | // Macro invocation in type position | |
ba9703b0 | 591 | Ok(TyKind::MacCall(MacCall { |
dfeec247 XL |
592 | path, |
593 | args: self.parse_mac_args()?, | |
594 | prior_type_ascription: self.last_type_ascription, | |
595 | })) | |
74b04a01 | 596 | } else if allow_plus == AllowPlus::Yes && self.check_plus() { |
dfeec247 | 597 | // `Trait1 + Trait2 + 'a` |
ba9703b0 | 598 | self.parse_remaining_bounds_path(Vec::new(), path, lo, true) |
dfeec247 XL |
599 | } else { |
600 | // Just a type path. | |
601 | Ok(TyKind::Path(None, path)) | |
602 | } | |
603 | } | |
604 | ||
605 | fn error_illegal_c_varadic_ty(&self, lo: Span) { | |
606 | struct_span_err!( | |
607 | self.sess.span_diagnostic, | |
74b04a01 | 608 | lo.to(self.prev_token.span), |
dfeec247 XL |
609 | E0743, |
610 | "C-variadic type `...` may not be nested inside another type", | |
611 | ) | |
612 | .emit(); | |
613 | } | |
614 | ||
615 | pub(super) fn parse_generic_bounds( | |
616 | &mut self, | |
617 | colon_span: Option<Span>, | |
618 | ) -> PResult<'a, GenericBounds> { | |
74b04a01 | 619 | self.parse_generic_bounds_common(AllowPlus::Yes, colon_span) |
416331ca XL |
620 | } |
621 | ||
622 | /// Parses bounds of a type parameter `BOUND + BOUND + ...`, possibly with trailing `+`. | |
623 | /// | |
dfeec247 XL |
624 | /// See `parse_generic_bound` for the `BOUND` grammar. |
625 | fn parse_generic_bounds_common( | |
626 | &mut self, | |
74b04a01 | 627 | allow_plus: AllowPlus, |
dfeec247 XL |
628 | colon_span: Option<Span>, |
629 | ) -> PResult<'a, GenericBounds> { | |
416331ca XL |
630 | let mut bounds = Vec::new(); |
631 | let mut negative_bounds = Vec::new(); | |
17df50a5 XL |
632 | |
633 | while self.can_begin_bound() || self.token.is_keyword(kw::Dyn) { | |
634 | if self.token.is_keyword(kw::Dyn) { | |
635 | // Account for `&dyn Trait + dyn Other`. | |
636 | self.struct_span_err(self.token.span, "invalid `dyn` keyword") | |
637 | .help("`dyn` is only needed at the start of a trait `+`-separated list") | |
638 | .span_suggestion( | |
639 | self.token.span, | |
640 | "remove this keyword", | |
641 | String::new(), | |
642 | Applicability::MachineApplicable, | |
643 | ) | |
644 | .emit(); | |
645 | self.bump(); | |
646 | } | |
dfeec247 XL |
647 | match self.parse_generic_bound()? { |
648 | Ok(bound) => bounds.push(bound), | |
649 | Err(neg_sp) => negative_bounds.push(neg_sp), | |
416331ca | 650 | } |
74b04a01 | 651 | if allow_plus == AllowPlus::No || !self.eat_plus() { |
dfeec247 | 652 | break; |
416331ca XL |
653 | } |
654 | } | |
655 | ||
dfeec247 XL |
656 | if !negative_bounds.is_empty() { |
657 | self.error_negative_bounds(colon_span, &bounds, negative_bounds); | |
658 | } | |
659 | ||
660 | Ok(bounds) | |
661 | } | |
662 | ||
663 | /// Can the current token begin a bound? | |
664 | fn can_begin_bound(&mut self) -> bool { | |
665 | // This needs to be synchronized with `TokenKind::can_begin_bound`. | |
666 | self.check_path() | |
667 | || self.check_lifetime() | |
668 | || self.check(&token::Not) // Used for error reporting only. | |
669 | || self.check(&token::Question) | |
94222f64 | 670 | || self.check(&token::Tilde) |
dfeec247 XL |
671 | || self.check_keyword(kw::For) |
672 | || self.check(&token::OpenDelim(token::Paren)) | |
673 | } | |
674 | ||
675 | fn error_negative_bounds( | |
676 | &self, | |
677 | colon_span: Option<Span>, | |
678 | bounds: &[GenericBound], | |
679 | negative_bounds: Vec<Span>, | |
680 | ) { | |
681 | let negative_bounds_len = negative_bounds.len(); | |
682 | let last_span = *negative_bounds.last().expect("no negative bounds, but still error?"); | |
683 | let mut err = self.struct_span_err(negative_bounds, "negative bounds are not supported"); | |
684 | err.span_label(last_span, "negative bounds are not supported"); | |
685 | if let Some(bound_list) = colon_span { | |
74b04a01 | 686 | let bound_list = bound_list.to(self.prev_token.span); |
dfeec247 XL |
687 | let mut new_bound_list = String::new(); |
688 | if !bounds.is_empty() { | |
689 | let mut snippets = bounds.iter().map(|bound| self.span_to_snippet(bound.span())); | |
690 | while let Some(Ok(snippet)) = snippets.next() { | |
691 | new_bound_list.push_str(" + "); | |
692 | new_bound_list.push_str(&snippet); | |
416331ca | 693 | } |
dfeec247 | 694 | new_bound_list = new_bound_list.replacen(" +", ":", 1); |
416331ca | 695 | } |
dfeec247 XL |
696 | err.tool_only_span_suggestion( |
697 | bound_list, | |
698 | &format!("remove the bound{}", pluralize!(negative_bounds_len)), | |
699 | new_bound_list, | |
700 | Applicability::MachineApplicable, | |
701 | ); | |
702 | } | |
703 | err.emit(); | |
704 | } | |
705 | ||
706 | /// Parses a bound according to the grammar: | |
707 | /// ``` | |
708 | /// BOUND = TY_BOUND | LT_BOUND | |
709 | /// ``` | |
710 | fn parse_generic_bound(&mut self) -> PResult<'a, Result<GenericBound, Span>> { | |
74b04a01 | 711 | let anchor_lo = self.prev_token.span; |
dfeec247 XL |
712 | let lo = self.token.span; |
713 | let has_parens = self.eat(&token::OpenDelim(token::Paren)); | |
714 | let inner_lo = self.token.span; | |
715 | let is_negative = self.eat(&token::Not); | |
716 | ||
94222f64 | 717 | let modifiers = self.parse_ty_bound_modifiers()?; |
dfeec247 XL |
718 | let bound = if self.token.is_lifetime() { |
719 | self.error_lt_bound_with_modifiers(modifiers); | |
720 | self.parse_generic_lt_bound(lo, inner_lo, has_parens)? | |
721 | } else { | |
722 | self.parse_generic_ty_bound(lo, has_parens, modifiers)? | |
723 | }; | |
724 | ||
74b04a01 | 725 | Ok(if is_negative { Err(anchor_lo.to(self.prev_token.span)) } else { Ok(bound) }) |
dfeec247 XL |
726 | } |
727 | ||
728 | /// Parses a lifetime ("outlives") bound, e.g. `'a`, according to: | |
729 | /// ``` | |
730 | /// LT_BOUND = LIFETIME | |
731 | /// ``` | |
732 | fn parse_generic_lt_bound( | |
733 | &mut self, | |
734 | lo: Span, | |
735 | inner_lo: Span, | |
736 | has_parens: bool, | |
737 | ) -> PResult<'a, GenericBound> { | |
738 | let bound = GenericBound::Outlives(self.expect_lifetime()); | |
739 | if has_parens { | |
740 | // FIXME(Centril): Consider not erroring here and accepting `('lt)` instead, | |
741 | // possibly introducing `GenericBound::Paren(P<GenericBound>)`? | |
742 | self.recover_paren_lifetime(lo, inner_lo)?; | |
743 | } | |
744 | Ok(bound) | |
745 | } | |
746 | ||
747 | /// Emits an error if any trait bound modifiers were present. | |
748 | fn error_lt_bound_with_modifiers(&self, modifiers: BoundModifiers) { | |
749 | if let Some(span) = modifiers.maybe_const { | |
750 | self.struct_span_err( | |
751 | span, | |
94222f64 | 752 | "`~const` may only modify trait bounds, not lifetime bounds", |
dfeec247 XL |
753 | ) |
754 | .emit(); | |
755 | } | |
756 | ||
757 | if let Some(span) = modifiers.maybe { | |
758 | self.struct_span_err(span, "`?` may only modify trait bounds, not lifetime bounds") | |
759 | .emit(); | |
760 | } | |
761 | } | |
762 | ||
763 | /// Recover on `('lifetime)` with `(` already eaten. | |
764 | fn recover_paren_lifetime(&mut self, lo: Span, inner_lo: Span) -> PResult<'a, ()> { | |
74b04a01 | 765 | let inner_span = inner_lo.to(self.prev_token.span); |
dfeec247 XL |
766 | self.expect(&token::CloseDelim(token::Paren))?; |
767 | let mut err = self.struct_span_err( | |
74b04a01 | 768 | lo.to(self.prev_token.span), |
dfeec247 XL |
769 | "parenthesized lifetime bounds are not supported", |
770 | ); | |
771 | if let Ok(snippet) = self.span_to_snippet(inner_span) { | |
772 | err.span_suggestion_short( | |
74b04a01 | 773 | lo.to(self.prev_token.span), |
dfeec247 XL |
774 | "remove the parentheses", |
775 | snippet, | |
776 | Applicability::MachineApplicable, | |
777 | ); | |
778 | } | |
779 | err.emit(); | |
780 | Ok(()) | |
781 | } | |
782 | ||
94222f64 | 783 | /// Parses the modifiers that may precede a trait in a bound, e.g. `?Trait` or `~const Trait`. |
dfeec247 XL |
784 | /// |
785 | /// If no modifiers are present, this does not consume any tokens. | |
786 | /// | |
787 | /// ``` | |
94222f64 | 788 | /// TY_BOUND_MODIFIERS = ["~const"] ["?"] |
dfeec247 | 789 | /// ``` |
94222f64 XL |
790 | fn parse_ty_bound_modifiers(&mut self) -> PResult<'a, BoundModifiers> { |
791 | let maybe_const = if self.eat(&token::Tilde) { | |
792 | let tilde = self.prev_token.span; | |
793 | self.expect_keyword(kw::Const)?; | |
794 | let span = tilde.to(self.prev_token.span); | |
795 | self.sess.gated_spans.gate(sym::const_trait_impl, span); | |
796 | Some(span) | |
797 | } else { | |
798 | None | |
799 | }; | |
dfeec247 | 800 | |
94222f64 | 801 | let maybe = if self.eat(&token::Question) { Some(self.prev_token.span) } else { None }; |
dfeec247 | 802 | |
94222f64 | 803 | Ok(BoundModifiers { maybe, maybe_const }) |
dfeec247 XL |
804 | } |
805 | ||
806 | /// Parses a type bound according to: | |
807 | /// ``` | |
808 | /// TY_BOUND = TY_BOUND_NOPAREN | (TY_BOUND_NOPAREN) | |
809 | /// TY_BOUND_NOPAREN = [TY_BOUND_MODIFIERS] [for<LT_PARAM_DEFS>] SIMPLE_PATH | |
810 | /// ``` | |
811 | /// | |
94222f64 | 812 | /// For example, this grammar accepts `~const ?for<'a: 'b> m::Trait<'a>`. |
dfeec247 XL |
813 | fn parse_generic_ty_bound( |
814 | &mut self, | |
815 | lo: Span, | |
816 | has_parens: bool, | |
817 | modifiers: BoundModifiers, | |
818 | ) -> PResult<'a, GenericBound> { | |
819 | let lifetime_defs = self.parse_late_bound_lifetime_defs()?; | |
820 | let path = self.parse_path(PathStyle::Type)?; | |
821 | if has_parens { | |
17df50a5 XL |
822 | if self.token.is_like_plus() { |
823 | // Someone has written something like `&dyn (Trait + Other)`. The correct code | |
824 | // would be `&(dyn Trait + Other)`, but we don't have access to the appropriate | |
825 | // span to suggest that. When written as `&dyn Trait + Other`, an appropriate | |
826 | // suggestion is given. | |
827 | let bounds = vec![]; | |
828 | self.parse_remaining_bounds(bounds, true)?; | |
829 | self.expect(&token::CloseDelim(token::Paren))?; | |
830 | let sp = vec![lo, self.prev_token.span]; | |
831 | let sugg: Vec<_> = sp.iter().map(|sp| (*sp, String::new())).collect(); | |
832 | self.struct_span_err(sp, "incorrect braces around trait bounds") | |
833 | .multipart_suggestion( | |
834 | "remove the parentheses", | |
835 | sugg, | |
836 | Applicability::MachineApplicable, | |
837 | ) | |
838 | .emit(); | |
839 | } else { | |
840 | self.expect(&token::CloseDelim(token::Paren))?; | |
841 | } | |
416331ca XL |
842 | } |
843 | ||
dfeec247 | 844 | let modifier = modifiers.to_trait_bound_modifier(); |
74b04a01 | 845 | let poly_trait = PolyTraitRef::new(lifetime_defs, path, lo.to(self.prev_token.span)); |
dfeec247 | 846 | Ok(GenericBound::Trait(poly_trait, modifier)) |
416331ca XL |
847 | } |
848 | ||
dfeec247 | 849 | /// Optionally parses `for<$generic_params>`. |
416331ca XL |
850 | pub(super) fn parse_late_bound_lifetime_defs(&mut self) -> PResult<'a, Vec<GenericParam>> { |
851 | if self.eat_keyword(kw::For) { | |
852 | self.expect_lt()?; | |
853 | let params = self.parse_generic_params()?; | |
854 | self.expect_gt()?; | |
855 | // We rely on AST validation to rule out invalid cases: There must not be type | |
856 | // parameters, and the lifetime parameters must not have bounds. | |
857 | Ok(params) | |
858 | } else { | |
859 | Ok(Vec::new()) | |
860 | } | |
861 | } | |
862 | ||
3dfed10e | 863 | pub(super) fn check_lifetime(&mut self) -> bool { |
416331ca XL |
864 | self.expected_tokens.push(TokenType::Lifetime); |
865 | self.token.is_lifetime() | |
866 | } | |
867 | ||
868 | /// Parses a single lifetime `'a` or panics. | |
3dfed10e | 869 | pub(super) fn expect_lifetime(&mut self) -> Lifetime { |
416331ca | 870 | if let Some(ident) = self.token.lifetime() { |
416331ca | 871 | self.bump(); |
74b04a01 | 872 | Lifetime { ident, id: ast::DUMMY_NODE_ID } |
416331ca XL |
873 | } else { |
874 | self.span_bug(self.token.span, "not a lifetime") | |
875 | } | |
876 | } | |
e74abb32 XL |
877 | |
878 | pub(super) fn mk_ty(&self, span: Span, kind: TyKind) -> P<Ty> { | |
1b1a35ee | 879 | P(Ty { kind, span, id: ast::DUMMY_NODE_ID, tokens: None }) |
e74abb32 | 880 | } |
416331ca | 881 | } |