Rollup merge of #67148 - Centril:ty-polish, r=estebank

Refactor type & bounds parsing thoroughly

PR is based on https://github.com/rust-lang/rust/pull/67131 with first one from this PR being ` extract parse_ty_tuple_or_parens`.

Also fixes #67146.

r? @estebank
This commit is contained in:
Mazdak Farrokhzad 2019-12-22 02:40:00 +01:00 committed by GitHub
commit 616373e668
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
11 changed files with 377 additions and 292 deletions

View File

@ -90,6 +90,10 @@ pub fn parse_expr(&mut self) -> PResult<'a, P<Expr>> {
self.parse_expr_res(Restrictions::empty(), None) self.parse_expr_res(Restrictions::empty(), None)
} }
pub(super) fn parse_anon_const_expr(&mut self) -> PResult<'a, AnonConst> {
self.parse_expr().map(|value| AnonConst { id: DUMMY_NODE_ID, value })
}
fn parse_expr_catch_underscore(&mut self) -> PResult<'a, P<Expr>> { fn parse_expr_catch_underscore(&mut self) -> PResult<'a, P<Expr>> {
match self.parse_expr() { match self.parse_expr() {
Ok(expr) => Ok(expr), Ok(expr) => Ok(expr),
@ -109,7 +113,7 @@ fn parse_expr_catch_underscore(&mut self) -> PResult<'a, P<Expr>> {
} }
} }
/// Parses a sequence of expressions bounded by parentheses. /// Parses a sequence of expressions delimited by parentheses.
fn parse_paren_expr_seq(&mut self) -> PResult<'a, Vec<P<Expr>>> { fn parse_paren_expr_seq(&mut self) -> PResult<'a, Vec<P<Expr>>> {
self.parse_paren_comma_seq(|p| { self.parse_paren_comma_seq(|p| {
p.parse_expr_catch_underscore() p.parse_expr_catch_underscore()
@ -955,10 +959,7 @@ fn parse_array_or_repeat_expr(&mut self, mut attrs: AttrVec) -> PResult<'a, P<Ex
let first_expr = self.parse_expr()?; let first_expr = self.parse_expr()?;
if self.eat(&token::Semi) { if self.eat(&token::Semi) {
// Repeating array syntax: `[ 0; 512 ]` // Repeating array syntax: `[ 0; 512 ]`
let count = AnonConst { let count = self.parse_anon_const_expr()?;
id: DUMMY_NODE_ID,
value: self.parse_expr()?,
};
self.expect(close)?; self.expect(close)?;
ExprKind::Repeat(first_expr, count) ExprKind::Repeat(first_expr, count)
} else if self.eat(&token::Comma) { } else if self.eat(&token::Comma) {

View File

@ -5,7 +5,7 @@
use rustc_errors::{PResult, Applicability, DiagnosticBuilder, StashKey}; use rustc_errors::{PResult, Applicability, DiagnosticBuilder, StashKey};
use rustc_error_codes::*; use rustc_error_codes::*;
use syntax::ast::{self, DUMMY_NODE_ID, Ident, AttrVec, Attribute, AttrKind, AttrStyle, AnonConst}; use syntax::ast::{self, DUMMY_NODE_ID, Ident, AttrVec, Attribute, AttrKind, AttrStyle};
use syntax::ast::{AssocItem, AssocItemKind, Item, ItemKind, UseTree, UseTreeKind}; use syntax::ast::{AssocItem, AssocItemKind, Item, ItemKind, UseTree, UseTreeKind};
use syntax::ast::{PathSegment, IsAuto, Constness, IsAsync, Unsafety, Defaultness, Extern, StrLit}; use syntax::ast::{PathSegment, IsAuto, Constness, IsAsync, Unsafety, Defaultness, Extern, StrLit};
use syntax::ast::{Visibility, VisibilityKind, Mutability, FnHeader, ForeignItem, ForeignItemKind}; use syntax::ast::{Visibility, VisibilityKind, Mutability, FnHeader, ForeignItem, ForeignItemKind};
@ -1317,10 +1317,7 @@ fn parse_enum_variant(&mut self) -> PResult<'a, Option<Variant>> {
}; };
let disr_expr = if self.eat(&token::Eq) { let disr_expr = if self.eat(&token::Eq) {
Some(AnonConst { Some(self.parse_anon_const_expr()?)
id: DUMMY_NODE_ID,
value: self.parse_expr()?,
})
} else { } else {
None None
}; };

View File

@ -8,7 +8,7 @@
use syntax::ptr::P; use syntax::ptr::P;
use syntax::ast::{self, Ty, TyKind, MutTy, BareFnTy, FunctionRetTy, GenericParam, Lifetime, Ident}; use syntax::ast::{self, Ty, TyKind, MutTy, BareFnTy, FunctionRetTy, GenericParam, Lifetime, Ident};
use syntax::ast::{TraitBoundModifier, TraitObjectSyntax, GenericBound, GenericBounds, PolyTraitRef}; use syntax::ast::{TraitBoundModifier, TraitObjectSyntax, GenericBound, GenericBounds, PolyTraitRef};
use syntax::ast::{Mutability, AnonConst, Mac}; use syntax::ast::{Mutability, Mac};
use syntax::token::{self, Token}; use syntax::token::{self, Token};
use syntax::struct_span_err; use syntax::struct_span_err;
use syntax_pos::source_map::Span; use syntax_pos::source_map::Span;
@ -73,78 +73,21 @@ fn parse_ty_common(
let lo = self.token.span; let lo = self.token.span;
let mut impl_dyn_multi = false; let mut impl_dyn_multi = false;
let kind = if self.eat(&token::OpenDelim(token::Paren)) { let kind = if self.check(&token::OpenDelim(token::Paren)) {
// `(TYPE)` is a parenthesized type. self.parse_ty_tuple_or_parens(lo, allow_plus)?
// `(TYPE,)` is a tuple with a single field of type TYPE.
let mut ts = vec![];
let mut last_comma = false;
while self.token != token::CloseDelim(token::Paren) {
ts.push(self.parse_ty()?);
if self.eat(&token::Comma) {
last_comma = true;
} else {
last_comma = false;
break;
}
}
let trailing_plus = self.prev_token_kind == PrevTokenKind::Plus;
self.expect(&token::CloseDelim(token::Paren))?;
if ts.len() == 1 && !last_comma {
let ty = ts.into_iter().nth(0).unwrap().into_inner();
let maybe_bounds = allow_plus && self.token.is_like_plus();
match ty.kind {
// `(TY_BOUND_NOPAREN) + BOUND + ...`.
TyKind::Path(None, ref path) if maybe_bounds => {
self.parse_remaining_bounds(Vec::new(), path.clone(), lo, true)?
}
TyKind::TraitObject(ref bounds, TraitObjectSyntax::None)
if maybe_bounds && bounds.len() == 1 && !trailing_plus => {
let path = match bounds[0] {
GenericBound::Trait(ref pt, ..) => pt.trait_ref.path.clone(),
GenericBound::Outlives(..) => self.bug("unexpected lifetime bound"),
};
self.parse_remaining_bounds(Vec::new(), path, lo, true)?
}
// `(TYPE)`
_ => TyKind::Paren(P(ty))
}
} else {
TyKind::Tup(ts)
}
} else if self.eat(&token::Not) { } else if self.eat(&token::Not) {
// Never type `!` // Never type `!`
TyKind::Never TyKind::Never
} else if self.eat(&token::BinOp(token::Star)) { } else if self.eat(&token::BinOp(token::Star)) {
// Raw pointer self.parse_ty_ptr()?
TyKind::Ptr(self.parse_ptr()?)
} else if self.eat(&token::OpenDelim(token::Bracket)) { } else if self.eat(&token::OpenDelim(token::Bracket)) {
// Array or slice self.parse_array_or_slice_ty()?
let t = self.parse_ty()?;
// Parse optional `; EXPR` in `[TYPE; EXPR]`
let t = match self.maybe_parse_fixed_length_of_vec()? {
None => TyKind::Slice(t),
Some(length) => TyKind::Array(t, AnonConst {
id: ast::DUMMY_NODE_ID,
value: length,
}),
};
self.expect(&token::CloseDelim(token::Bracket))?;
t
} else if self.check(&token::BinOp(token::And)) || self.check(&token::AndAnd) { } else if self.check(&token::BinOp(token::And)) || self.check(&token::AndAnd) {
// Reference // Reference
self.expect_and()?; self.expect_and()?;
self.parse_borrowed_pointee()? self.parse_borrowed_pointee()?
} else if self.eat_keyword_noexpect(kw::Typeof) { } else if self.eat_keyword_noexpect(kw::Typeof) {
// `typeof(EXPR)` self.parse_typeof_ty()?
// In order to not be ambiguous, the type must be surrounded by parens.
self.expect(&token::OpenDelim(token::Paren))?;
let e = AnonConst {
id: ast::DUMMY_NODE_ID,
value: self.parse_expr()?,
};
self.expect(&token::CloseDelim(token::Paren))?;
TyKind::Typeof(e)
} else if self.eat_keyword(kw::Underscore) { } else if self.eat_keyword(kw::Underscore) {
// A type to be inferred `_` // A type to be inferred `_`
TyKind::Infer TyKind::Infer
@ -155,7 +98,6 @@ fn parse_ty_common(
// Function pointer type or bound list (trait object type) starting with a poly-trait. // 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> [unsafe] [extern "ABI"] fn (&'lt S) -> T`
// `for<'lt> Trait1<'lt> + Trait2 + 'a` // `for<'lt> Trait1<'lt> + Trait2 + 'a`
let lo = self.token.span;
let lifetime_defs = self.parse_late_bound_lifetime_defs()?; let lifetime_defs = self.parse_late_bound_lifetime_defs()?;
if self.token_is_bare_fn_keyword() { if self.token_is_bare_fn_keyword() {
self.parse_ty_bare_fn(lifetime_defs)? self.parse_ty_bare_fn(lifetime_defs)?
@ -165,69 +107,33 @@ fn parse_ty_common(
self.parse_remaining_bounds(lifetime_defs, path, lo, parse_plus)? self.parse_remaining_bounds(lifetime_defs, path, lo, parse_plus)?
} }
} else if self.eat_keyword(kw::Impl) { } else if self.eat_keyword(kw::Impl) {
// Always parse bounds greedily for better error recovery. self.parse_impl_ty(&mut impl_dyn_multi)?
let bounds = self.parse_generic_bounds(None)?; } else if self.is_explicit_dyn_type() {
impl_dyn_multi = bounds.len() > 1 || self.prev_token_kind == PrevTokenKind::Plus; self.parse_dyn_ty(&mut impl_dyn_multi)?
TyKind::ImplTrait(ast::DUMMY_NODE_ID, bounds) } else if self.check(&token::Question)
} else if self.check_keyword(kw::Dyn) && || self.check_lifetime() && self.look_ahead(1, |t| t.is_like_plus())
(self.token.span.rust_2018() || {
self.look_ahead(1, |t| t.can_begin_bound() &&
!can_continue_type_after_non_fn_ident(t))) {
self.bump(); // `dyn`
// Always parse bounds greedily for better error recovery.
let bounds = self.parse_generic_bounds(None)?;
impl_dyn_multi = bounds.len() > 1 || self.prev_token_kind == PrevTokenKind::Plus;
TyKind::TraitObject(bounds, TraitObjectSyntax::Dyn)
} else if self.check(&token::Question) ||
self.check_lifetime() && self.look_ahead(1, |t| t.is_like_plus()) {
// Bound list (trait object type) // Bound list (trait object type)
TyKind::TraitObject(self.parse_generic_bounds_common(allow_plus, None)?, let bounds = self.parse_generic_bounds_common(allow_plus, None)?;
TraitObjectSyntax::None) TyKind::TraitObject(bounds, TraitObjectSyntax::None)
} else if self.eat_lt() { } else if self.eat_lt() {
// Qualified path // Qualified path
let (qself, path) = self.parse_qpath(PathStyle::Type)?; let (qself, path) = self.parse_qpath(PathStyle::Type)?;
TyKind::Path(Some(qself), path) TyKind::Path(Some(qself), path)
} else if self.token.is_path_start() { } else if self.token.is_path_start() {
// Simple path self.parse_path_start_ty(lo, allow_plus)?
let path = self.parse_path(PathStyle::Type)?;
if self.eat(&token::Not) {
// Macro invocation in type position
let args = self.parse_mac_args()?;
let mac = Mac {
path,
args,
prior_type_ascription: self.last_type_ascription,
};
TyKind::Mac(mac)
} else {
// Just a type path or bound list (trait object type) starting with a trait.
// `Type`
// `Trait1 + Trait2 + 'a`
if allow_plus && self.check_plus() {
self.parse_remaining_bounds(Vec::new(), path, lo, true)?
} else {
TyKind::Path(None, path)
}
}
} else if self.eat(&token::DotDotDot) { } else if self.eat(&token::DotDotDot) {
if allow_c_variadic { if allow_c_variadic {
TyKind::CVarArgs TyKind::CVarArgs
} else { } else {
// FIXME(Centril): Should we just allow `...` syntactically // FIXME(Centril): Should we just allow `...` syntactically
// anywhere in a type and use semantic restrictions instead? // anywhere in a type and use semantic restrictions instead?
struct_span_err!( self.error_illegal_c_varadic_ty(lo);
self.sess.span_diagnostic,
lo.to(self.prev_span),
E0743,
"C-variadic type `...` may not be nested inside another type",
)
.emit();
TyKind::Err TyKind::Err
} }
} else { } else {
let msg = format!("expected type, found {}", self.this_token_descr()); let msg = format!("expected type, found {}", self.this_token_descr());
let mut err = self.fatal(&msg); let mut err = self.struct_span_err(self.token.span, &msg);
err.span_label(self.token.span, "expected type"); err.span_label(self.token.span, "expected type");
self.maybe_annotate_with_ascription(&mut err, true); self.maybe_annotate_with_ascription(&mut err, true);
return Err(err); return Err(err);
@ -242,8 +148,48 @@ fn parse_ty_common(
self.maybe_recover_from_bad_qpath(ty, allow_qpath_recovery) self.maybe_recover_from_bad_qpath(ty, allow_qpath_recovery)
} }
fn parse_remaining_bounds(&mut self, generic_params: Vec<GenericParam>, path: ast::Path, /// Parses either:
lo: Span, parse_plus: bool) -> PResult<'a, TyKind> { /// - `(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: bool) -> 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 == PrevTokenKind::Plus;
Ok(ty)
})?;
if ts.len() == 1 && !trailing {
let ty = ts.into_iter().nth(0).unwrap().into_inner();
let maybe_bounds = allow_plus && self.token.is_like_plus();
match ty.kind {
// `(TY_BOUND_NOPAREN) + BOUND + ...`.
TyKind::Path(None, path) if maybe_bounds => {
self.parse_remaining_bounds(Vec::new(), path, lo, true)
}
TyKind::TraitObject(mut bounds, TraitObjectSyntax::None)
if maybe_bounds && bounds.len() == 1 && !trailing_plus => {
let path = match bounds.remove(0) {
GenericBound::Trait(pt, ..) => pt.trait_ref.path,
GenericBound::Outlives(..) => self.bug("unexpected lifetime bound"),
};
self.parse_remaining_bounds(Vec::new(), path, lo, true)
}
// `(TYPE)`
_ => Ok(TyKind::Paren(P(ty)))
}
} else {
Ok(TyKind::Tup(ts))
}
}
fn parse_remaining_bounds(
&mut self,
generic_params: Vec<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_span)); let poly_trait_ref = PolyTraitRef::new(generic_params, path, lo.to(self.prev_span));
let mut bounds = vec![GenericBound::Trait(poly_trait_ref, TraitBoundModifier::None)]; let mut bounds = vec![GenericBound::Trait(poly_trait_ref, TraitBoundModifier::None)];
if parse_plus { if parse_plus {
@ -253,7 +199,8 @@ fn parse_remaining_bounds(&mut self, generic_params: Vec<GenericParam>, path: as
Ok(TyKind::TraitObject(bounds, TraitObjectSyntax::None)) Ok(TyKind::TraitObject(bounds, TraitObjectSyntax::None))
} }
fn parse_ptr(&mut self) -> PResult<'a, MutTy> { /// 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 mutbl = self.parse_const_or_mut().unwrap_or_else(|| {
let span = self.prev_span; let span = self.prev_span;
let msg = "expected mut or const in raw pointer type"; let msg = "expected mut or const in raw pointer type";
@ -263,23 +210,37 @@ fn parse_ptr(&mut self) -> PResult<'a, MutTy> {
.emit(); .emit();
Mutability::Not Mutability::Not
}); });
let t = self.parse_ty_no_plus()?; let ty = self.parse_ty_no_plus()?;
Ok(MutTy { ty: t, mutbl }) Ok(TyKind::Ptr(MutTy { ty, mutbl }))
} }
fn maybe_parse_fixed_length_of_vec(&mut self) -> PResult<'a, Option<P<ast::Expr>>> { /// Parses an array (`[TYPE; EXPR]`) or slice (`[TYPE]`) type.
if self.eat(&token::Semi) { /// The opening `[` bracket is already eaten.
Ok(Some(self.parse_expr()?)) fn parse_array_or_slice_ty(&mut self) -> PResult<'a, TyKind> {
let elt_ty = self.parse_ty()?;
let ty = if self.eat(&token::Semi) {
TyKind::Array(elt_ty, self.parse_anon_const_expr()?)
} else { } else {
Ok(None) TyKind::Slice(elt_ty)
} };
self.expect(&token::CloseDelim(token::Bracket))?;
Ok(ty)
} }
fn parse_borrowed_pointee(&mut self) -> PResult<'a, TyKind> { fn parse_borrowed_pointee(&mut self) -> PResult<'a, TyKind> {
let opt_lifetime = if self.check_lifetime() { Some(self.expect_lifetime()) } else { None }; let opt_lifetime = if self.check_lifetime() { Some(self.expect_lifetime()) } else { None };
let mutbl = self.parse_mutability(); let mutbl = self.parse_mutability();
let ty = self.parse_ty_no_plus()?; let ty = self.parse_ty_no_plus()?;
return Ok(TyKind::Rptr(opt_lifetime, MutTy { ty, mutbl })); Ok(TyKind::Rptr(opt_lifetime, MutTy { ty, mutbl }))
}
// Parses the `typeof(EXPR)`.
// To avoid ambiguity, the type is surrounded by parenthesis.
fn parse_typeof_ty(&mut self) -> PResult<'a, TyKind> {
self.expect(&token::OpenDelim(token::Paren))?;
let expr = self.parse_anon_const_expr()?;
self.expect(&token::CloseDelim(token::Paren))?;
Ok(TyKind::Typeof(expr))
} }
/// Is the current token one of the keywords that signals a bare function type? /// Is the current token one of the keywords that signals a bare function type?
@ -289,20 +250,15 @@ fn token_is_bare_fn_keyword(&mut self) -> bool {
self.check_keyword(kw::Extern) self.check_keyword(kw::Extern)
} }
/// Parses a `TyKind::BareFn` type. /// Parses a function pointer type (`TyKind::BareFn`).
/// ```
/// [unsafe] [extern "ABI"] fn (S) -> T
/// ^~~~~^ ^~~~^ ^~^ ^
/// | | | |
/// | | | Return type
/// Function Style ABI Parameter types
/// ```
fn parse_ty_bare_fn(&mut self, generic_params: Vec<GenericParam>) -> PResult<'a, TyKind> { fn parse_ty_bare_fn(&mut self, generic_params: Vec<GenericParam>) -> PResult<'a, TyKind> {
/*
[unsafe] [extern "ABI"] fn (S) -> T
^~~~^ ^~~~^ ^~^ ^
| | | |
| | | Return type
| | Argument types
| |
| ABI
Function Style
*/
let unsafety = self.parse_unsafety(); let unsafety = self.parse_unsafety();
let ext = self.parse_extern()?; let ext = self.parse_extern()?;
self.expect_keyword(kw::Fn)?; self.expect_keyword(kw::Fn)?;
@ -319,130 +275,241 @@ fn parse_ty_bare_fn(&mut self, generic_params: Vec<GenericParam>) -> PResult<'a,
}))) })))
} }
pub(super) fn parse_generic_bounds(&mut self, /// Parses an `impl B0 + ... + Bn` type.
colon_span: Option<Span>) -> PResult<'a, GenericBounds> { fn parse_impl_ty(&mut self, impl_dyn_multi: &mut bool) -> PResult<'a, TyKind> {
// Always parse bounds greedily for better error recovery.
let bounds = self.parse_generic_bounds(None)?;
*impl_dyn_multi = bounds.len() > 1 || self.prev_token_kind == PrevTokenKind::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.span.rust_2018()
|| self.look_ahead(1, |t| {
t.can_begin_bound() && !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> {
self.bump(); // `dyn`
// Always parse bounds greedily for better error recovery.
let bounds = self.parse_generic_bounds(None)?;
*impl_dyn_multi = bounds.len() > 1 || self.prev_token_kind == PrevTokenKind::Plus;
Ok(TyKind::TraitObject(bounds, TraitObjectSyntax::Dyn))
}
/// 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: bool) -> PResult<'a, TyKind> {
// Simple path
let path = self.parse_path(PathStyle::Type)?;
if self.eat(&token::Not) {
// Macro invocation in type position
Ok(TyKind::Mac(Mac {
path,
args: self.parse_mac_args()?,
prior_type_ascription: self.last_type_ascription,
}))
} else if allow_plus && self.check_plus() {
// `Trait1 + Trait2 + 'a`
self.parse_remaining_bounds(Vec::new(), path, lo, true)
} else {
// Just a type path.
Ok(TyKind::Path(None, path))
}
}
fn error_illegal_c_varadic_ty(&self, lo: Span) {
struct_span_err!(
self.sess.span_diagnostic,
lo.to(self.prev_span),
E0743,
"C-variadic type `...` may not be nested inside another type",
)
.emit();
}
pub(super) fn parse_generic_bounds(
&mut self,
colon_span: Option<Span>,
) -> PResult<'a, GenericBounds> {
self.parse_generic_bounds_common(true, colon_span) self.parse_generic_bounds_common(true, colon_span)
} }
/// Parses bounds of a type parameter `BOUND + BOUND + ...`, possibly with trailing `+`. /// 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: bool,
colon_span: Option<Span>,
) -> PResult<'a, GenericBounds> {
let mut bounds = Vec::new();
let mut negative_bounds = Vec::new();
while self.can_begin_bound() {
match self.parse_generic_bound()? {
Ok(bound) => bounds.push(bound),
Err(neg_sp) => negative_bounds.push(neg_sp),
}
if !allow_plus || !self.eat_plus() {
break
}
}
if !negative_bounds.is_empty() {
self.error_negative_bounds(colon_span, &bounds, negative_bounds);
}
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) // Used for error reporting only.
|| self.check(&token::Question)
|| self.check_keyword(kw::For)
|| self.check(&token::OpenDelim(token::Paren))
}
fn error_negative_bounds(
&self,
colon_span: Option<Span>,
bounds: &[GenericBound],
negative_bounds: Vec<Span>,
) {
let negative_bounds_len = negative_bounds.len();
let last_span = *negative_bounds.last().expect("no negative bounds, but still error?");
let mut err = self.struct_span_err(
negative_bounds,
"negative bounds are not supported",
);
err.span_label(last_span, "negative bounds are not supported");
if let Some(bound_list) = colon_span {
let bound_list = bound_list.to(self.prev_span);
let mut new_bound_list = String::new();
if !bounds.is_empty() {
let mut snippets = bounds.iter().map(|bound| self.span_to_snippet(bound.span()));
while let Some(Ok(snippet)) = snippets.next() {
new_bound_list.push_str(" + ");
new_bound_list.push_str(&snippet);
}
new_bound_list = new_bound_list.replacen(" +", ":", 1);
}
err.tool_only_span_suggestion(
bound_list,
&format!("remove the bound{}", pluralize!(negative_bounds_len)),
new_bound_list,
Applicability::MachineApplicable,
);
}
err.emit();
}
/// Parses a bound according to the grammar:
/// ``` /// ```
/// BOUND = TY_BOUND | LT_BOUND /// BOUND = TY_BOUND | LT_BOUND
/// LT_BOUND = LIFETIME (e.g., `'a`) /// ```
fn parse_generic_bound(&mut self) -> PResult<'a, Result<GenericBound, Span>> {
let anchor_lo = self.prev_span;
let lo = self.token.span;
let has_parens = self.eat(&token::OpenDelim(token::Paren));
let inner_lo = self.token.span;
let is_negative = self.eat(&token::Not);
let question = self.eat(&token::Question).then_some(self.prev_span);
let bound = if self.token.is_lifetime() {
self.parse_generic_lt_bound(lo, inner_lo, has_parens, question)?
} else {
self.parse_generic_ty_bound(lo, has_parens, question)?
};
Ok(if is_negative {
Err(anchor_lo.to(self.prev_span))
} else {
Ok(bound)
})
}
/// Parses a lifetime ("outlives") bound, e.g. `'a`, according to:
/// ```
/// LT_BOUND = LIFETIME
/// ```
fn parse_generic_lt_bound(
&mut self,
lo: Span,
inner_lo: Span,
has_parens: bool,
question: Option<Span>,
) -> PResult<'a, GenericBound> {
self.error_opt_out_lifetime(question);
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)
}
fn error_opt_out_lifetime(&self, question: Option<Span>) {
if let Some(span) = question {
self.struct_span_err(span, "`?` may only modify trait bounds, not lifetime bounds")
.emit();
}
}
/// 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_span);
self.expect(&token::CloseDelim(token::Paren))?;
let mut err = self.struct_span_err(
lo.to(self.prev_span),
"parenthesized lifetime bounds are not supported"
);
if let Ok(snippet) = self.span_to_snippet(inner_span) {
err.span_suggestion_short(
lo.to(self.prev_span),
"remove the parentheses",
snippet.to_owned(),
Applicability::MachineApplicable
);
}
err.emit();
Ok(())
}
/// Parses a type bound according to:
/// ```
/// TY_BOUND = TY_BOUND_NOPAREN | (TY_BOUND_NOPAREN) /// TY_BOUND = TY_BOUND_NOPAREN | (TY_BOUND_NOPAREN)
/// TY_BOUND_NOPAREN = [?] [for<LT_PARAM_DEFS>] SIMPLE_PATH (e.g., `?for<'a: 'b> m::Trait<'a>`) /// TY_BOUND_NOPAREN = [?] [for<LT_PARAM_DEFS>] SIMPLE_PATH (e.g., `?for<'a: 'b> m::Trait<'a>`)
/// ``` /// ```
fn parse_generic_bounds_common(&mut self, fn parse_generic_ty_bound(
allow_plus: bool, &mut self,
colon_span: Option<Span>) -> PResult<'a, GenericBounds> { lo: Span,
let mut bounds = Vec::new(); has_parens: bool,
let mut negative_bounds = Vec::new(); question: Option<Span>,
let mut last_plus_span = None; ) -> PResult<'a, GenericBound> {
let mut was_negative = false; let lifetime_defs = self.parse_late_bound_lifetime_defs()?;
loop { let path = self.parse_path(PathStyle::Type)?;
// This needs to be synchronized with `TokenKind::can_begin_bound`. if has_parens {
let is_bound_start = self.check_path() || self.check_lifetime() || self.expect(&token::CloseDelim(token::Paren))?;
self.check(&token::Not) || // used for error reporting only
self.check(&token::Question) ||
self.check_keyword(kw::For) ||
self.check(&token::OpenDelim(token::Paren));
if is_bound_start {
let lo = self.token.span;
let has_parens = self.eat(&token::OpenDelim(token::Paren));
let inner_lo = self.token.span;
let is_negative = self.eat(&token::Not);
let question = if self.eat(&token::Question) { Some(self.prev_span) } else { None };
if self.token.is_lifetime() {
if let Some(question_span) = question {
self.span_err(question_span,
"`?` may only modify trait bounds, not lifetime bounds");
}
bounds.push(GenericBound::Outlives(self.expect_lifetime()));
if has_parens {
let inner_span = inner_lo.to(self.prev_span);
self.expect(&token::CloseDelim(token::Paren))?;
let mut err = self.struct_span_err(
lo.to(self.prev_span),
"parenthesized lifetime bounds are not supported"
);
if let Ok(snippet) = self.span_to_snippet(inner_span) {
err.span_suggestion_short(
lo.to(self.prev_span),
"remove the parentheses",
snippet.to_owned(),
Applicability::MachineApplicable
);
}
err.emit();
}
} else {
let lifetime_defs = self.parse_late_bound_lifetime_defs()?;
let path = self.parse_path(PathStyle::Type)?;
if has_parens {
self.expect(&token::CloseDelim(token::Paren))?;
}
let poly_span = lo.to(self.prev_span);
if is_negative {
was_negative = true;
if let Some(sp) = last_plus_span.or(colon_span) {
negative_bounds.push(sp.to(poly_span));
}
} else {
let poly_trait = PolyTraitRef::new(lifetime_defs, path, poly_span);
let modifier = if question.is_some() {
TraitBoundModifier::Maybe
} else {
TraitBoundModifier::None
};
bounds.push(GenericBound::Trait(poly_trait, modifier));
}
}
} else {
break
}
if !allow_plus || !self.eat_plus() {
break
} else {
last_plus_span = Some(self.prev_span);
}
} }
let poly_trait = PolyTraitRef::new(lifetime_defs, path, lo.to(self.prev_span));
if !negative_bounds.is_empty() || was_negative { let modifier = question.map_or(TraitBoundModifier::None, |_| TraitBoundModifier::Maybe);
let negative_bounds_len = negative_bounds.len(); Ok(GenericBound::Trait(poly_trait, modifier))
let last_span = negative_bounds.last().map(|sp| *sp);
let mut err = self.struct_span_err(
negative_bounds,
"negative trait bounds are not supported",
);
if let Some(sp) = last_span {
err.span_label(sp, "negative trait bounds are not supported");
}
if let Some(bound_list) = colon_span {
let bound_list = bound_list.to(self.prev_span);
let mut new_bound_list = String::new();
if !bounds.is_empty() {
let mut snippets = bounds.iter().map(|bound| bound.span())
.map(|span| self.span_to_snippet(span));
while let Some(Ok(snippet)) = snippets.next() {
new_bound_list.push_str(" + ");
new_bound_list.push_str(&snippet);
}
new_bound_list = new_bound_list.replacen(" +", ":", 1);
}
err.span_suggestion_hidden(
bound_list,
&format!("remove the trait bound{}", pluralize!(negative_bounds_len)),
new_bound_list,
Applicability::MachineApplicable,
);
}
err.emit();
}
return Ok(bounds);
} }
/// Optionally parses `for<$generic_params>`.
pub(super) fn parse_late_bound_lifetime_defs(&mut self) -> PResult<'a, Vec<GenericParam>> { pub(super) fn parse_late_bound_lifetime_defs(&mut self) -> PResult<'a, Vec<GenericParam>> {
if self.eat_keyword(kw::For) { if self.eat_keyword(kw::For) {
self.expect_lt()?; self.expect_lt()?;

View File

@ -2,6 +2,6 @@ struct Conj<A> {a : A}
trait Valid {} trait Valid {}
impl<A: !Valid> Conj<A>{} impl<A: !Valid> Conj<A>{}
//~^ ERROR negative trait bounds are not supported //~^ ERROR negative bounds are not supported
fn main() {} fn main() {}

View File

@ -1,10 +1,8 @@
error: negative trait bounds are not supported error: negative bounds are not supported
--> $DIR/issue-58857.rs:4:7 --> $DIR/issue-58857.rs:4:7
| |
LL | impl<A: !Valid> Conj<A>{} LL | impl<A: !Valid> Conj<A>{}
| ^^^^^^^^ negative trait bounds are not supported | ^^^^^^^^ negative bounds are not supported
|
= help: remove the trait bound
error: aborting due to previous error error: aborting due to previous error

View File

@ -1,15 +1,15 @@
// run-rustfix // run-rustfix
trait Tr {} trait Tr {}
//~^ ERROR negative trait bounds are not supported //~^ ERROR negative bounds are not supported
trait Tr2: SuperA {} trait Tr2: SuperA {}
//~^ ERROR negative trait bounds are not supported //~^ ERROR negative bounds are not supported
trait Tr3: SuperB {} trait Tr3: SuperB {}
//~^ ERROR negative trait bounds are not supported //~^ ERROR negative bounds are not supported
trait Tr4: SuperB + SuperD {} trait Tr4: SuperB + SuperD {}
//~^ ERROR negative trait bounds are not supported //~^ ERROR negative bounds are not supported
trait Tr5 {} trait Tr5 {}
//~^ ERROR negative trait bounds are not supported //~^ ERROR negative bounds are not supported
trait SuperA {} trait SuperA {}
trait SuperB {} trait SuperB {}

View File

@ -1,17 +1,17 @@
// run-rustfix // run-rustfix
trait Tr: !SuperA {} trait Tr: !SuperA {}
//~^ ERROR negative trait bounds are not supported //~^ ERROR negative bounds are not supported
trait Tr2: SuperA + !SuperB {} trait Tr2: SuperA + !SuperB {}
//~^ ERROR negative trait bounds are not supported //~^ ERROR negative bounds are not supported
trait Tr3: !SuperA + SuperB {} trait Tr3: !SuperA + SuperB {}
//~^ ERROR negative trait bounds are not supported //~^ ERROR negative bounds are not supported
trait Tr4: !SuperA + SuperB trait Tr4: !SuperA + SuperB
+ !SuperC + SuperD {} + !SuperC + SuperD {}
//~^ ERROR negative trait bounds are not supported //~^ ERROR negative bounds are not supported
trait Tr5: !SuperA trait Tr5: !SuperA
+ !SuperB {} + !SuperB {}
//~^ ERROR negative trait bounds are not supported //~^ ERROR negative bounds are not supported
trait SuperA {} trait SuperA {}
trait SuperB {} trait SuperB {}

View File

@ -1,46 +1,36 @@
error: negative trait bounds are not supported error: negative bounds are not supported
--> $DIR/issue-33418.rs:3:9 --> $DIR/issue-33418.rs:3:9
| |
LL | trait Tr: !SuperA {} LL | trait Tr: !SuperA {}
| ^^^^^^^^^ negative trait bounds are not supported | ^^^^^^^^^ negative bounds are not supported
|
= help: remove the trait bound
error: negative trait bounds are not supported error: negative bounds are not supported
--> $DIR/issue-33418.rs:5:19 --> $DIR/issue-33418.rs:5:19
| |
LL | trait Tr2: SuperA + !SuperB {} LL | trait Tr2: SuperA + !SuperB {}
| ^^^^^^^^^ negative trait bounds are not supported | ^^^^^^^^^ negative bounds are not supported
|
= help: remove the trait bound
error: negative trait bounds are not supported error: negative bounds are not supported
--> $DIR/issue-33418.rs:7:10 --> $DIR/issue-33418.rs:7:10
| |
LL | trait Tr3: !SuperA + SuperB {} LL | trait Tr3: !SuperA + SuperB {}
| ^^^^^^^^^ negative trait bounds are not supported | ^^^^^^^^^ negative bounds are not supported
|
= help: remove the trait bound
error: negative trait bounds are not supported error: negative bounds are not supported
--> $DIR/issue-33418.rs:9:10 --> $DIR/issue-33418.rs:9:10
| |
LL | trait Tr4: !SuperA + SuperB LL | trait Tr4: !SuperA + SuperB
| ^^^^^^^^^ | ^^^^^^^^^
LL | + !SuperC + SuperD {} LL | + !SuperC + SuperD {}
| ^^^^^^^^^ negative trait bounds are not supported | ^^^^^^^^^ negative bounds are not supported
|
= help: remove the trait bounds
error: negative trait bounds are not supported error: negative bounds are not supported
--> $DIR/issue-33418.rs:12:10 --> $DIR/issue-33418.rs:12:10
| |
LL | trait Tr5: !SuperA LL | trait Tr5: !SuperA
| ^^^^^^^^^ | ^^^^^^^^^
LL | + !SuperB {} LL | + !SuperB {}
| ^^^^^^^^^ negative trait bounds are not supported | ^^^^^^^^^ negative bounds are not supported
|
= help: remove the trait bounds
error: aborting due to 5 previous errors error: aborting due to 5 previous errors

View File

@ -0,0 +1,12 @@
// In this regression test for #67146, we check that the
// negative outlives bound `!'a` is rejected by the parser.
// This regression was first introduced in PR #57364.
fn main() {}
fn f1<T: !'static>() {}
//~^ ERROR negative bounds are not supported
fn f2<'a, T: Ord + !'a>() {}
//~^ ERROR negative bounds are not supported
fn f3<'a, T: !'a + Ord>() {}
//~^ ERROR negative bounds are not supported

View File

@ -0,0 +1,20 @@
error: negative bounds are not supported
--> $DIR/issue-67146-negative-outlives-bound-syntactic-fail.rs:7:8
|
LL | fn f1<T: !'static>() {}
| ^^^^^^^^^^ negative bounds are not supported
error: negative bounds are not supported
--> $DIR/issue-67146-negative-outlives-bound-syntactic-fail.rs:9:18
|
LL | fn f2<'a, T: Ord + !'a>() {}
| ^^^^^ negative bounds are not supported
error: negative bounds are not supported
--> $DIR/issue-67146-negative-outlives-bound-syntactic-fail.rs:11:12
|
LL | fn f3<'a, T: !'a + Ord>() {}
| ^^^^^ negative bounds are not supported
error: aborting due to 3 previous errors

View File

@ -11,7 +11,7 @@ LL | let _ = Option:Some(vec![0, 1]);
| |
= note: `#![feature(type_ascription)]` lets you annotate an expression with a type: `<expr>: <type>` = note: `#![feature(type_ascription)]` lets you annotate an expression with a type: `<expr>: <type>`
= note: for more information, see https://github.com/rust-lang/rust/issues/23416 = note: for more information, see https://github.com/rust-lang/rust/issues/23416
= note: this warning originates in a macro outside of the current crate (in Nightly builds, run with -Z external-macro-backtrace for more info) = note: this error originates in a macro outside of the current crate (in Nightly builds, run with -Z external-macro-backtrace for more info)
error: aborting due to previous error error: aborting due to previous error