mirror of
https://github.com/apple/swift.git
synced 2025-12-14 20:36:38 +01:00
8670 lines
300 KiB
C++
8670 lines
300 KiB
C++
//===--- ParseDecl.cpp - Swift Language Parser for Declarations -----------===//
|
|
//
|
|
// This source file is part of the Swift.org open source project
|
|
//
|
|
// Copyright (c) 2014 - 2019 Apple Inc. and the Swift project authors
|
|
// Licensed under Apache License v2.0 with Runtime Library Exception
|
|
//
|
|
// See https://swift.org/LICENSE.txt for license information
|
|
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Declaration Parsing and AST Building
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "swift/Parse/Parser.h"
|
|
#include "swift/Parse/CodeCompletionCallbacks.h"
|
|
#include "swift/Parse/ParsedSyntaxRecorder.h"
|
|
#include "swift/Parse/ParseSILSupport.h"
|
|
#include "swift/Parse/SyntaxParsingContext.h"
|
|
#include "swift/Syntax/SyntaxKind.h"
|
|
#include "swift/Subsystems.h"
|
|
#include "swift/AST/ASTWalker.h"
|
|
#include "swift/AST/Attr.h"
|
|
#include "swift/AST/GenericParamList.h"
|
|
#include "swift/AST/LazyResolver.h"
|
|
#include "swift/AST/DebuggerClient.h"
|
|
#include "swift/AST/DiagnosticsParse.h"
|
|
#include "swift/AST/Initializer.h"
|
|
#include "swift/AST/Module.h"
|
|
#include "swift/AST/ParameterList.h"
|
|
#include "swift/AST/ParseRequests.h"
|
|
#include "swift/AST/SourceFile.h"
|
|
#include "swift/Basic/Defer.h"
|
|
#include "swift/Basic/Statistic.h"
|
|
#include "swift/Basic/StringExtras.h"
|
|
#include "llvm/Support/Compiler.h"
|
|
#include "llvm/Support/MemoryBuffer.h"
|
|
#include "llvm/Support/Path.h"
|
|
#include "llvm/Support/SaveAndRestore.h"
|
|
#include "llvm/ADT/PointerUnion.h"
|
|
#include "llvm/ADT/StringSwitch.h"
|
|
#include "llvm/ADT/Twine.h"
|
|
#include <algorithm>
|
|
|
|
using namespace swift;
|
|
using namespace syntax;
|
|
|
|
namespace {
|
|
/// A RAII object for deciding whether this DeclKind needs special
|
|
/// treatment when parsing in the "debugger context", and implementing
|
|
/// that treatment. The problem arises because, when lldb
|
|
/// uses swift to parse expressions, it needs to emulate the current
|
|
/// frame's scope. We do that, for instance, by making a class extension
|
|
/// and running the code in a function in that extension.
|
|
///
|
|
/// This causes two kinds of issues:
|
|
/// 1) Some DeclKinds require to be parsed in TopLevel contexts only.
|
|
/// 2) Sometimes the debugger wants a Decl to live beyond the current
|
|
/// function invocation, in which case it should be parsed at the
|
|
/// file scope level so it will be set up correctly for this purpose.
|
|
///
|
|
/// Creating an instance of this object will cause it to figure out
|
|
/// whether we are in the debugger function, and whether it needs to swap
|
|
/// the Decl that is currently being parsed.
|
|
///
|
|
/// If you are making one of these objects to address issue 1, call
|
|
/// the constructor that only takes a DeclKind, and it will be moved
|
|
/// unconditionally. Otherwise pass in the Name and DeclKind and the
|
|
/// DebuggerClient will be asked whether to move it or not.
|
|
class DebuggerContextChange {
|
|
protected:
|
|
Parser &P;
|
|
Optional<Parser::ContextChange> CC;
|
|
SourceFile *SF;
|
|
public:
|
|
DebuggerContextChange(Parser &P) : P(P), SF(nullptr) {
|
|
if (!inDebuggerContext())
|
|
return;
|
|
|
|
switchContext();
|
|
}
|
|
|
|
DebuggerContextChange(Parser &P, Identifier Name, DeclKind Kind)
|
|
: P(P), SF(nullptr) {
|
|
if (!inDebuggerContext())
|
|
return;
|
|
|
|
if (auto *client = getDebuggerClient())
|
|
if (client->shouldGlobalize(Name, Kind))
|
|
switchContext();
|
|
}
|
|
|
|
bool movedToTopLevel() {
|
|
return CC.hasValue();
|
|
}
|
|
|
|
template <typename T>
|
|
ParserResult<T>
|
|
fixupParserResult(ParserResult<T> &Result) {
|
|
ParserStatus Status = Result;
|
|
return fixupParserResult(Status, Result.getPtrOrNull());
|
|
}
|
|
|
|
template <typename T>
|
|
ParserResult<T>
|
|
fixupParserResult(T *D) {
|
|
if (movedToTopLevel())
|
|
hoistDecl(D);
|
|
return ParserResult<T>(D);
|
|
}
|
|
|
|
template <typename T>
|
|
ParserResult<T>
|
|
fixupParserResult(ParserStatus Status, T *D) {
|
|
if (movedToTopLevel())
|
|
hoistDecl(D);
|
|
return makeParserResult(Status, D);
|
|
}
|
|
|
|
// The destructor doesn't need to do anything, the CC's destructor will
|
|
// pop the context if we set it.
|
|
~DebuggerContextChange () {}
|
|
|
|
private:
|
|
DebuggerClient *getDebuggerClient() {
|
|
ModuleDecl *M = P.CurDeclContext->getParentModule();
|
|
return M->getDebugClient();
|
|
}
|
|
|
|
bool inDebuggerContext() {
|
|
if (!P.Context.LangOpts.DebuggerSupport)
|
|
return false;
|
|
if (!P.CurDeclContext)
|
|
return false;
|
|
auto *func = dyn_cast<FuncDecl>(P.CurDeclContext);
|
|
if (!func)
|
|
return false;
|
|
|
|
if (!func->getAttrs().hasAttribute<LLDBDebuggerFunctionAttr>())
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
void switchContext() {
|
|
SF = P.CurDeclContext->getParentSourceFile();
|
|
CC.emplace(P, SF);
|
|
}
|
|
|
|
template<typename T>
|
|
void hoistDecl(T *D) {
|
|
D->setHoisted();
|
|
SF->addHoistedDecl(D);
|
|
getDebuggerClient()->didGlobalize(D);
|
|
}
|
|
};
|
|
} // end anonymous namespace
|
|
|
|
/// Main entrypoint for the parser.
|
|
///
|
|
/// \verbatim
|
|
/// top-level:
|
|
/// stmt-brace-item*
|
|
/// decl-sil [[only in SIL mode]
|
|
/// decl-sil-stage [[only in SIL mode]
|
|
/// \endverbatim
|
|
void Parser::parseTopLevel(SmallVectorImpl<Decl *> &decls) {
|
|
// Prime the lexer.
|
|
if (Tok.is(tok::NUM_TOKENS))
|
|
consumeTokenWithoutFeedingReceiver();
|
|
|
|
// Parse the body of the file.
|
|
SmallVector<ASTNode, 128> items;
|
|
while (!Tok.is(tok::eof)) {
|
|
// If we run into a SIL decl, skip over until the next Swift decl. We need
|
|
// to delay parsing these, as SIL parsing currently requires type checking
|
|
// Swift decls.
|
|
if (isStartOfSILDecl()) {
|
|
assert(!isStartOfSwiftDecl() && "Start of both a Swift and SIL decl?");
|
|
skipSILUntilSwiftDecl();
|
|
continue;
|
|
}
|
|
|
|
parseBraceItems(items, allowTopLevelCode()
|
|
? BraceItemListKind::TopLevelCode
|
|
: BraceItemListKind::TopLevelLibrary);
|
|
|
|
// In the case of a catastrophic parse error, consume any trailing
|
|
// #else, #elseif, or #endif and move on to the next statement or
|
|
// declaration block.
|
|
if (Tok.is(tok::pound_else) || Tok.is(tok::pound_elseif) ||
|
|
Tok.is(tok::pound_endif)) {
|
|
diagnose(Tok.getLoc(),
|
|
diag::unexpected_conditional_compilation_block_terminator);
|
|
// Create 'UnknownDecl' for orphan directives.
|
|
SyntaxParsingContext itemCtxt(SyntaxContext, SyntaxKind::CodeBlockItem);
|
|
SyntaxParsingContext declCtxt(SyntaxContext, SyntaxContextKind::Decl);
|
|
|
|
consumeToken();
|
|
}
|
|
}
|
|
|
|
// Then append the top-level decls we parsed.
|
|
for (auto item : items) {
|
|
auto *decl = item.get<Decl *>();
|
|
assert(!isa<AccessorDecl>(decl) && "accessors should not be added here");
|
|
decls.push_back(decl);
|
|
}
|
|
|
|
// Finalize the syntax context.
|
|
SyntaxContext->addToken(Tok, LeadingTrivia, TrailingTrivia);
|
|
}
|
|
|
|
bool Parser::parseTopLevelSIL() {
|
|
assert(SIL && isInSILMode());
|
|
|
|
// Prime the lexer.
|
|
if (Tok.is(tok::NUM_TOKENS))
|
|
consumeTokenWithoutFeedingReceiver();
|
|
|
|
auto skipToNextSILDecl = [&]() {
|
|
while (!Tok.is(tok::eof) && !isStartOfSILDecl())
|
|
skipSingle();
|
|
};
|
|
|
|
auto hadError = false;
|
|
while (!Tok.is(tok::eof)) {
|
|
// If we run into a Swift decl, skip over until we find the next SIL decl.
|
|
if (isStartOfSwiftDecl()) {
|
|
assert(!isStartOfSILDecl() && "Start of both a Swift and SIL decl?");
|
|
skipToNextSILDecl();
|
|
continue;
|
|
}
|
|
|
|
switch (Tok.getKind()) {
|
|
#define CASE_SIL(KW, NAME) \
|
|
case tok::kw_##KW: { \
|
|
/* If we failed to parse a SIL decl, move onto the next SIL decl to \
|
|
better help recovery. */ \
|
|
if (SIL->parse##NAME(*this)) { \
|
|
Lexer::SILBodyRAII sbr(*L); \
|
|
skipToNextSILDecl(); \
|
|
hadError = true; \
|
|
} \
|
|
break; \
|
|
}
|
|
CASE_SIL(sil, DeclSIL)
|
|
CASE_SIL(sil_stage, DeclSILStage)
|
|
CASE_SIL(sil_vtable, SILVTable)
|
|
CASE_SIL(sil_global, SILGlobal)
|
|
CASE_SIL(sil_witness_table, SILWitnessTable)
|
|
CASE_SIL(sil_default_witness_table, SILDefaultWitnessTable)
|
|
CASE_SIL(sil_differentiability_witness, SILDifferentiabilityWitness)
|
|
CASE_SIL(sil_coverage_map, SILCoverageMap)
|
|
CASE_SIL(sil_property, SILProperty)
|
|
CASE_SIL(sil_scope, SILScope)
|
|
#undef CASE_SIL
|
|
default:
|
|
// If we reached here, we have something malformed that isn't a Swift decl
|
|
// or a SIL decl. Emit an error and skip ahead to the next SIL decl.
|
|
diagnose(Tok, diag::expected_sil_keyword);
|
|
skipToNextSILDecl();
|
|
hadError = true;
|
|
break;
|
|
}
|
|
}
|
|
return hadError;
|
|
}
|
|
|
|
ParserResult<AvailableAttr> Parser::parseExtendedAvailabilitySpecList(
|
|
SourceLoc AtLoc, SourceLoc AttrLoc, StringRef AttrName) {
|
|
// Check 'Tok', return false if ':' or '=' cannot be found.
|
|
// Complain if '=' is found and suggest replacing it with ": ".
|
|
auto findAttrValueDelimiter = [&]() -> bool {
|
|
if (!Tok.is(tok::colon)) {
|
|
if (!Tok.is(tok::equal))
|
|
return false;
|
|
|
|
diagnose(Tok.getLoc(), diag::replace_equal_with_colon_for_value)
|
|
.fixItReplace(Tok.getLoc(), ": ");
|
|
}
|
|
return true;
|
|
};
|
|
|
|
struct VersionArg {
|
|
llvm::VersionTuple Version;
|
|
SourceRange Range;
|
|
SourceLoc DelimiterLoc;
|
|
bool empty() const {
|
|
return Version.empty();
|
|
}
|
|
};
|
|
|
|
StringRef Platform = Tok.getText();
|
|
|
|
StringRef Message, Renamed;
|
|
VersionArg Introduced, Deprecated, Obsoleted;
|
|
auto PlatformAgnostic = PlatformAgnosticAvailabilityKind::None;
|
|
|
|
SyntaxParsingContext AvailabilitySpecContext(
|
|
SyntaxContext, SyntaxKind::AvailabilitySpecList);
|
|
|
|
bool HasUpcomingEntry = false;
|
|
|
|
{
|
|
SyntaxParsingContext EntryContext(SyntaxContext,
|
|
SyntaxKind::AvailabilityArgument);
|
|
consumeToken();
|
|
if (consumeIf(tok::comma)) {
|
|
HasUpcomingEntry = true;
|
|
}
|
|
}
|
|
|
|
bool AnyAnnotations = false;
|
|
bool AnyArgumentInvalid = false;
|
|
int ParamIndex = 0;
|
|
|
|
while (HasUpcomingEntry) {
|
|
SyntaxParsingContext EntryContext(SyntaxContext,
|
|
SyntaxKind::AvailabilityArgument);
|
|
auto ArgumentLoc = Tok.getLoc();
|
|
AnyAnnotations = true;
|
|
StringRef ArgumentKindStr = Tok.getText();
|
|
++ParamIndex;
|
|
|
|
enum {
|
|
IsMessage, IsRenamed,
|
|
IsIntroduced, IsDeprecated, IsObsoleted,
|
|
IsUnavailable,
|
|
IsInvalid
|
|
} ArgumentKind = IsInvalid;
|
|
|
|
if (Tok.is(tok::identifier)) {
|
|
ArgumentKind =
|
|
llvm::StringSwitch<decltype(ArgumentKind)>(ArgumentKindStr)
|
|
.Case("message", IsMessage)
|
|
.Case("renamed", IsRenamed)
|
|
.Case("introduced", IsIntroduced)
|
|
.Case("deprecated", IsDeprecated)
|
|
.Case("obsoleted", IsObsoleted)
|
|
.Case("unavailable", IsUnavailable)
|
|
.Default(IsInvalid);
|
|
}
|
|
|
|
if (ArgumentKind == IsInvalid) {
|
|
diagnose(ArgumentLoc, diag::attr_availability_expected_option, AttrName)
|
|
.highlight(SourceRange(ArgumentLoc));
|
|
if (Tok.is(tok::code_complete) && CodeCompletion) {
|
|
CodeCompletion->completeDeclAttrParam(DAK_Available, ParamIndex);
|
|
consumeToken(tok::code_complete);
|
|
} else {
|
|
consumeIf(tok::identifier);
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
consumeToken();
|
|
|
|
auto diagnoseDuplicate = [&](bool WasEmpty) {
|
|
if (!WasEmpty) {
|
|
diagnose(ArgumentLoc, diag::attr_availability_invalid_duplicate,
|
|
ArgumentKindStr);
|
|
}
|
|
};
|
|
|
|
switch (ArgumentKind) {
|
|
case IsMessage:
|
|
case IsRenamed: {
|
|
// Items with string arguments.
|
|
if (findAttrValueDelimiter()) {
|
|
consumeToken();
|
|
} else {
|
|
diagnose(Tok, diag::attr_availability_expected_equal, AttrName,
|
|
ArgumentKindStr);
|
|
AnyArgumentInvalid = true;
|
|
if (peekToken().isAny(tok::r_paren, tok::comma))
|
|
consumeToken();
|
|
break;
|
|
}
|
|
|
|
if (!Tok.is(tok::string_literal)) {
|
|
diagnose(AttrLoc, diag::attr_expected_string_literal, AttrName);
|
|
AnyArgumentInvalid = true;
|
|
if (peekToken().isAny(tok::r_paren, tok::comma))
|
|
consumeToken();
|
|
break;
|
|
}
|
|
|
|
auto Value = getStringLiteralIfNotInterpolated(
|
|
AttrLoc, ("'" + ArgumentKindStr + "'").str());
|
|
consumeToken();
|
|
if (!Value) {
|
|
AnyArgumentInvalid = true;
|
|
break;
|
|
}
|
|
|
|
if (ArgumentKind == IsMessage) {
|
|
diagnoseDuplicate(Message.empty());
|
|
Message = Value.getValue();
|
|
} else {
|
|
ParsedDeclName parsedName = parseDeclName(Value.getValue());
|
|
if (!parsedName) {
|
|
diagnose(AttrLoc, diag::attr_availability_invalid_renamed, AttrName);
|
|
AnyArgumentInvalid = true;
|
|
break;
|
|
}
|
|
diagnoseDuplicate(Renamed.empty());
|
|
Renamed = Value.getValue();
|
|
}
|
|
|
|
SyntaxContext->createNodeInPlace(SyntaxKind::AvailabilityLabeledArgument);
|
|
|
|
break;
|
|
}
|
|
|
|
case IsDeprecated:
|
|
if (!findAttrValueDelimiter()) {
|
|
if (PlatformAgnostic != PlatformAgnosticAvailabilityKind::None) {
|
|
diagnose(Tok, diag::attr_availability_unavailable_deprecated,
|
|
AttrName);
|
|
}
|
|
|
|
PlatformAgnostic = PlatformAgnosticAvailabilityKind::Deprecated;
|
|
break;
|
|
}
|
|
LLVM_FALLTHROUGH;
|
|
|
|
case IsIntroduced:
|
|
case IsObsoleted: {
|
|
// Items with version arguments.
|
|
SourceLoc DelimiterLoc;
|
|
if (findAttrValueDelimiter()) {
|
|
DelimiterLoc = Tok.getLoc();
|
|
consumeToken();
|
|
} else {
|
|
diagnose(Tok, diag::attr_availability_expected_equal, AttrName,
|
|
ArgumentKindStr);
|
|
AnyArgumentInvalid = true;
|
|
if (peekToken().isAny(tok::r_paren, tok::comma))
|
|
consumeToken();
|
|
break;
|
|
}
|
|
|
|
auto &VerArg =
|
|
(ArgumentKind == IsIntroduced)
|
|
? Introduced
|
|
: (ArgumentKind == IsDeprecated) ? Deprecated : Obsoleted;
|
|
|
|
bool VerArgWasEmpty = VerArg.empty();
|
|
if (parseVersionTuple(
|
|
VerArg.Version, VerArg.Range,
|
|
Diagnostic(diag::attr_availability_expected_version, AttrName))) {
|
|
AnyArgumentInvalid = true;
|
|
if (peekToken().isAny(tok::r_paren, tok::comma))
|
|
consumeToken();
|
|
}
|
|
VerArg.DelimiterLoc = DelimiterLoc;
|
|
diagnoseDuplicate(VerArgWasEmpty);
|
|
|
|
SyntaxContext->createNodeInPlace(SyntaxKind::AvailabilityLabeledArgument);
|
|
|
|
break;
|
|
}
|
|
|
|
case IsUnavailable:
|
|
if (PlatformAgnostic != PlatformAgnosticAvailabilityKind::None) {
|
|
diagnose(Tok, diag::attr_availability_unavailable_deprecated, AttrName);
|
|
}
|
|
|
|
PlatformAgnostic = PlatformAgnosticAvailabilityKind::Unavailable;
|
|
break;
|
|
|
|
case IsInvalid:
|
|
llvm_unreachable("handled above");
|
|
}
|
|
|
|
// Parse the trailing comma
|
|
if (consumeIf(tok::comma)) {
|
|
HasUpcomingEntry = true;
|
|
} else {
|
|
HasUpcomingEntry = false;
|
|
}
|
|
}
|
|
|
|
if (!AnyAnnotations) {
|
|
diagnose(Tok.getLoc(), diag::attr_expected_comma, AttrName,
|
|
/*isDeclModifier*/ false);
|
|
}
|
|
|
|
auto PlatformKind = platformFromString(Platform);
|
|
|
|
// Treat 'swift' as a valid version-qualifying token, when
|
|
// at least some versions were mentioned and no other
|
|
// platform-agnostic availability spec has been provided.
|
|
bool SomeVersion = (!Introduced.empty() ||
|
|
!Deprecated.empty() ||
|
|
!Obsoleted.empty());
|
|
if (!PlatformKind.hasValue() &&
|
|
(Platform == "swift" || Platform == "_PackageDescription")) {
|
|
|
|
if (PlatformAgnostic == PlatformAgnosticAvailabilityKind::Deprecated) {
|
|
diagnose(AttrLoc,
|
|
diag::attr_availability_platform_agnostic_expected_deprecated_version,
|
|
AttrName, Platform);
|
|
return nullptr;
|
|
}
|
|
if (PlatformAgnostic == PlatformAgnosticAvailabilityKind::Unavailable) {
|
|
diagnose(AttrLoc, diag::attr_availability_platform_agnostic_infeasible_option,
|
|
"unavailable", AttrName, Platform);
|
|
return nullptr;
|
|
}
|
|
assert(PlatformAgnostic == PlatformAgnosticAvailabilityKind::None);
|
|
|
|
if (!SomeVersion) {
|
|
diagnose(AttrLoc, diag::attr_availability_platform_agnostic_expected_option,
|
|
AttrName, Platform);
|
|
return nullptr;
|
|
}
|
|
|
|
PlatformKind = PlatformKind::none;
|
|
PlatformAgnostic = (Platform == "swift") ?
|
|
PlatformAgnosticAvailabilityKind::SwiftVersionSpecific :
|
|
PlatformAgnosticAvailabilityKind::PackageDescriptionVersionSpecific;
|
|
}
|
|
|
|
|
|
if (AnyArgumentInvalid)
|
|
return nullptr;
|
|
if (!PlatformKind.hasValue()) {
|
|
diagnose(AttrLoc, diag::attr_availability_unknown_platform,
|
|
Platform, AttrName);
|
|
return nullptr;
|
|
}
|
|
|
|
// Warn if any version is specified for non-specific platform '*'.
|
|
if (Platform == "*" && SomeVersion) {
|
|
auto diag = diagnose(AttrLoc,
|
|
diag::attr_availability_nonspecific_platform_unexpected_version,
|
|
AttrName);
|
|
if (!Introduced.empty())
|
|
diag.fixItRemove(SourceRange(Introduced.DelimiterLoc,
|
|
Introduced.Range.End));
|
|
if (!Deprecated.empty())
|
|
diag.fixItRemove(SourceRange(Deprecated.DelimiterLoc,
|
|
Deprecated.Range.End));
|
|
if (!Obsoleted.empty())
|
|
diag.fixItRemove(SourceRange(Obsoleted.DelimiterLoc,
|
|
Obsoleted.Range.End));
|
|
return nullptr;
|
|
}
|
|
|
|
if (PlatformKind) {
|
|
if (!Introduced.empty())
|
|
Introduced.Version =
|
|
canonicalizePlatformVersion(*PlatformKind, Introduced.Version);
|
|
|
|
if (!Deprecated.empty())
|
|
Deprecated.Version =
|
|
canonicalizePlatformVersion(*PlatformKind, Deprecated.Version);
|
|
|
|
if (!Obsoleted.empty())
|
|
Obsoleted.Version =
|
|
canonicalizePlatformVersion(*PlatformKind, Obsoleted.Version);
|
|
}
|
|
|
|
auto Attr = new (Context)
|
|
AvailableAttr(AtLoc, SourceRange(AttrLoc, Tok.getLoc()),
|
|
PlatformKind.getValue(),
|
|
Message, Renamed, /*RenameDecl=*/nullptr,
|
|
Introduced.Version, Introduced.Range,
|
|
Deprecated.Version, Deprecated.Range,
|
|
Obsoleted.Version, Obsoleted.Range,
|
|
PlatformAgnostic,
|
|
/*Implicit=*/false);
|
|
return makeParserResult(Attr);
|
|
|
|
}
|
|
|
|
bool Parser::parseSpecializeAttributeArguments(
|
|
swift::tok ClosingBrace, bool &DiscardAttribute, Optional<bool> &Exported,
|
|
Optional<SpecializeAttr::SpecializationKind> &Kind,
|
|
swift::TrailingWhereClause *&TrailingWhereClause,
|
|
DeclNameRef &targetFunction, AvailabilityContext *SILAvailability, SmallVectorImpl<Identifier> &spiGroups,
|
|
SmallVectorImpl<AvailableAttr *> &availableAttrs,
|
|
llvm::function_ref<bool(Parser &)> parseSILTargetName,
|
|
llvm::function_ref<bool(Parser &)> parseSILSIPModule) {
|
|
bool isSIL = SILAvailability != nullptr;
|
|
SyntaxParsingContext ContentContext(SyntaxContext,
|
|
SyntaxKind::SpecializeAttributeSpecList);
|
|
// Parse optional "exported" and "kind" labeled parameters.
|
|
while (!Tok.is(tok::kw_where)) {
|
|
bool isAvailability = false;
|
|
if (Tok.is(tok::identifier)) {
|
|
auto ParamLabel = Tok.getText();
|
|
SyntaxParsingContext ArgumentContext(
|
|
SyntaxContext, ParamLabel == "target"
|
|
? SyntaxKind::TargetFunctionEntry :
|
|
(ParamLabel == "availability" ?
|
|
SyntaxKind::AvailabilityEntry
|
|
: SyntaxKind::LabeledSpecializeEntry));
|
|
if (ParamLabel != "exported" && ParamLabel != "kind" &&
|
|
ParamLabel != "target" && ParamLabel != "spi" &&
|
|
ParamLabel != "spiModule" && ParamLabel != "availability" &&
|
|
(!isSIL || ParamLabel != "available")) {
|
|
diagnose(Tok.getLoc(), diag::attr_specialize_unknown_parameter_name,
|
|
ParamLabel);
|
|
}
|
|
auto AtLoc = consumeToken();
|
|
if (!consumeIf(tok::colon)) {
|
|
diagnose(Tok.getLoc(), diag::attr_specialize_missing_colon, ParamLabel);
|
|
skipUntil(tok::comma, tok::kw_where);
|
|
if (Tok.is(ClosingBrace))
|
|
break;
|
|
if (Tok.is(tok::kw_where)) {
|
|
continue;
|
|
}
|
|
if (Tok.is(tok::comma)) {
|
|
consumeToken();
|
|
continue;
|
|
}
|
|
DiscardAttribute = true;
|
|
return false;
|
|
}
|
|
if ((ParamLabel == "exported" && Exported.hasValue()) ||
|
|
(ParamLabel == "kind" && Kind.hasValue()) ||
|
|
(ParamLabel == "spi" && !spiGroups.empty())) {
|
|
diagnose(Tok.getLoc(), diag::attr_specialize_parameter_already_defined,
|
|
ParamLabel);
|
|
}
|
|
if (ParamLabel == "available") {
|
|
SourceRange range;
|
|
llvm::VersionTuple version;
|
|
if (parseVersionTuple(version, range,
|
|
diag::sil_availability_expected_version))
|
|
return false;
|
|
|
|
*SILAvailability = AvailabilityContext(VersionRange::allGTE(version));
|
|
}
|
|
if (ParamLabel == "availability") {
|
|
SourceRange attrRange;
|
|
auto Loc = Tok.getLoc();
|
|
bool shouldDiscardAvailabilityAttr = false;
|
|
isAvailability = true;
|
|
if (!parseAvailability(true, ParamLabel, shouldDiscardAvailabilityAttr,
|
|
attrRange, AtLoc, Loc, [&](AvailableAttr *attr) {
|
|
availableAttrs.push_back(attr);
|
|
}))
|
|
return false;
|
|
}
|
|
if (ParamLabel == "exported") {
|
|
bool isTrue = consumeIf(tok::kw_true);
|
|
bool isFalse = consumeIf(tok::kw_false);
|
|
if (!isTrue && !isFalse) {
|
|
diagnose(Tok.getLoc(), diag::attr_specialize_expected_bool_value);
|
|
skipUntil(tok::comma, tok::kw_where);
|
|
if (Tok.is(ClosingBrace))
|
|
break;
|
|
if (Tok.is(tok::kw_where)) {
|
|
continue;
|
|
}
|
|
if (Tok.is(tok::comma)) {
|
|
consumeToken();
|
|
continue;
|
|
}
|
|
DiscardAttribute = true;
|
|
return false;
|
|
}
|
|
if (ParamLabel == "exported") {
|
|
Exported = isTrue;
|
|
}
|
|
}
|
|
if (ParamLabel == "kind") {
|
|
SourceLoc paramValueLoc;
|
|
if (Tok.is(tok::identifier)) {
|
|
if (Tok.getText() == "partial") {
|
|
Kind = SpecializeAttr::SpecializationKind::Partial;
|
|
} else if (Tok.getText() == "full") {
|
|
Kind = SpecializeAttr::SpecializationKind::Full;
|
|
} else {
|
|
diagnose(Tok.getLoc(),
|
|
diag::attr_specialize_expected_partial_or_full);
|
|
}
|
|
consumeToken();
|
|
} else if (consumeIf(tok::kw_true, paramValueLoc) ||
|
|
consumeIf(tok::kw_false, paramValueLoc)) {
|
|
diagnose(paramValueLoc,
|
|
diag::attr_specialize_expected_partial_or_full);
|
|
}
|
|
}
|
|
if (ParamLabel == "target") {
|
|
if (!parseSILTargetName(*this)) {
|
|
SyntaxParsingContext ContentContext(SyntaxContext,
|
|
SyntaxKind::DeclName);
|
|
DeclNameLoc loc;
|
|
targetFunction = parseDeclNameRef(
|
|
loc, diag::attr_specialize_expected_function,
|
|
DeclNameFlag::AllowZeroArgCompoundNames |
|
|
DeclNameFlag::AllowKeywordsUsingSpecialNames |
|
|
DeclNameFlag::AllowOperators);
|
|
}
|
|
}
|
|
if (ParamLabel == "spiModule") {
|
|
if (!parseSILSIPModule(*this)) {
|
|
diagnose(Tok.getLoc(), diag::attr_specialize_unknown_parameter_name,
|
|
ParamLabel);
|
|
return false;
|
|
}
|
|
}
|
|
if (ParamLabel == "spi") {
|
|
if (!Tok.is(tok::identifier)) {
|
|
diagnose(Tok.getLoc(), diag::attr_specialize_expected_spi_name);
|
|
consumeToken();
|
|
return false;
|
|
}
|
|
auto text = Tok.getText();
|
|
spiGroups.push_back(Context.getIdentifier(text));
|
|
consumeToken();
|
|
}
|
|
if (!isAvailability && !consumeIf(tok::comma)) {
|
|
diagnose(Tok.getLoc(), diag::attr_specialize_missing_comma);
|
|
skipUntil(tok::comma, tok::kw_where);
|
|
if (Tok.is(ClosingBrace))
|
|
break;
|
|
if (Tok.is(tok::kw_where)) {
|
|
continue;
|
|
}
|
|
if (Tok.is(tok::comma)) {
|
|
consumeToken();
|
|
continue;
|
|
}
|
|
DiscardAttribute = true;
|
|
return false;
|
|
}
|
|
continue;
|
|
}
|
|
diagnose(Tok.getLoc(),
|
|
diag::attr_specialize_missing_parameter_label_or_where_clause);
|
|
DiscardAttribute = true;
|
|
return false;
|
|
};
|
|
|
|
// Parse the where clause.
|
|
if (Tok.is(tok::kw_where)) {
|
|
SourceLoc whereLoc, endLoc;
|
|
SmallVector<RequirementRepr, 4> requirements;
|
|
parseGenericWhereClause(whereLoc, endLoc, requirements,
|
|
/* AllowLayoutConstraints */ true);
|
|
TrailingWhereClause =
|
|
TrailingWhereClause::create(Context, whereLoc, endLoc, requirements);
|
|
}
|
|
return true;
|
|
}
|
|
|
|
bool Parser::parseAvailability(
|
|
bool parseAsPartOfSpecializeAttr, StringRef AttrName,
|
|
bool &DiscardAttribute, SourceRange &attrRange, SourceLoc AtLoc,
|
|
SourceLoc Loc, llvm::function_ref<void(AvailableAttr *)> addAttribute) {
|
|
// platform:
|
|
// *
|
|
// identifier
|
|
if (!Tok.is(tok::identifier) &&
|
|
!(Tok.isAnyOperator() && Tok.getText() == "*")) {
|
|
if (Tok.is(tok::code_complete) && CodeCompletion) {
|
|
CodeCompletion->completeDeclAttrParam(DAK_Available, 0);
|
|
consumeToken(tok::code_complete);
|
|
}
|
|
diagnose(Tok.getLoc(), diag::attr_availability_platform, AttrName)
|
|
.highlight(SourceRange(Tok.getLoc()));
|
|
consumeIf(tok::r_paren);
|
|
return false;
|
|
}
|
|
// Delay processing of platform until later, after we have
|
|
// parsed more of the attribute.
|
|
StringRef Platform = Tok.getText();
|
|
|
|
if (Platform != "*" &&
|
|
(peekToken().isAny(tok::integer_literal, tok::floating_literal) ||
|
|
peekAvailabilityMacroName())) {
|
|
// We have the short form of available: @available(iOS 8.0.1, *)
|
|
SmallVector<AvailabilitySpec *, 5> Specs;
|
|
ParserStatus Status =
|
|
parseAvailabilitySpecList(Specs, AvailabilitySpecSource::Available);
|
|
|
|
if (Status.isErrorOrHasCompletion())
|
|
return false;
|
|
|
|
auto availTerminator =
|
|
parseAsPartOfSpecializeAttr ? tok::semi : tok::r_paren;
|
|
if (!consumeIf(availTerminator)) {
|
|
auto diagnostic = parseAsPartOfSpecializeAttr
|
|
? diag::attr_expected_semi
|
|
: diag::attr_expected_rparen;
|
|
diagnose(Tok.getLoc(), diagnostic, AttrName, parseAsPartOfSpecializeAttr);
|
|
return false;
|
|
}
|
|
|
|
attrRange = SourceRange(Loc, PreviousLoc);
|
|
// For each platform version spec in the spec list, create an
|
|
// implicit AvailableAttr for the platform with the introduced
|
|
// version from the spec. For example, if we have
|
|
// @available(iOS 8.0, OSX 10.10, *):
|
|
// we will synthesize:
|
|
// @available(iOS, introduced: 8.0)
|
|
// @available(OSX, introduced: 10.10)
|
|
//
|
|
// Similarly if we have a language version spec or PackageDescription
|
|
// version in the spec list, create an implicit AvailableAttr
|
|
// with the specified version as the introduced argument.
|
|
// For example, if we have
|
|
// @available(swift 3.1)
|
|
// we will synthesize
|
|
// @available(swift, introduced: 3.1)
|
|
// or, if we have
|
|
// @available(_PackageDescription 4.2)
|
|
// we will synthesize
|
|
// @available(_PackageDescription, introduced: 4.2)
|
|
|
|
for (auto *Spec : Specs) {
|
|
PlatformKind Platform;
|
|
llvm::VersionTuple Version;
|
|
SourceRange VersionRange;
|
|
PlatformAgnosticAvailabilityKind PlatformAgnostic;
|
|
|
|
if (auto *PlatformVersionSpec =
|
|
dyn_cast<PlatformVersionConstraintAvailabilitySpec>(Spec)) {
|
|
Platform = PlatformVersionSpec->getPlatform();
|
|
Version = PlatformVersionSpec->getVersion();
|
|
VersionRange = PlatformVersionSpec->getVersionSrcRange();
|
|
PlatformAgnostic = PlatformAgnosticAvailabilityKind::None;
|
|
|
|
} else if (auto *PlatformAgnosticVersionSpec = dyn_cast<
|
|
PlatformAgnosticVersionConstraintAvailabilitySpec>(Spec)) {
|
|
Platform = PlatformKind::none;
|
|
Version = PlatformAgnosticVersionSpec->getVersion();
|
|
VersionRange = PlatformAgnosticVersionSpec->getVersionSrcRange();
|
|
PlatformAgnostic =
|
|
PlatformAgnosticVersionSpec->isLanguageVersionSpecific()
|
|
? PlatformAgnosticAvailabilityKind::SwiftVersionSpecific
|
|
: PlatformAgnosticAvailabilityKind::
|
|
PackageDescriptionVersionSpecific;
|
|
|
|
} else {
|
|
continue;
|
|
}
|
|
|
|
Version = canonicalizePlatformVersion(Platform, Version);
|
|
|
|
addAttribute(new (Context) AvailableAttr(
|
|
AtLoc, attrRange, Platform,
|
|
/*Message=*/StringRef(),
|
|
/*Rename=*/StringRef(),
|
|
/*RenameDecl=*/nullptr,
|
|
/*Introduced=*/Version,
|
|
/*IntroducedRange=*/VersionRange,
|
|
/*Deprecated=*/llvm::VersionTuple(),
|
|
/*DeprecatedRange=*/SourceRange(),
|
|
/*Obsoleted=*/llvm::VersionTuple(),
|
|
/*ObsoletedRange=*/SourceRange(), PlatformAgnostic,
|
|
/*Implicit=*/false));
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
auto AvailabilityAttr =
|
|
parseExtendedAvailabilitySpecList(AtLoc, Loc, AttrName);
|
|
DiscardAttribute |= AvailabilityAttr.isParseErrorOrHasCompletion();
|
|
|
|
auto availTerminator = parseAsPartOfSpecializeAttr ? tok::semi : tok::r_paren;
|
|
if (!consumeIf(availTerminator)) {
|
|
if (!DiscardAttribute) {
|
|
auto diagnostic = parseAsPartOfSpecializeAttr ? diag::attr_expected_semi
|
|
: diag::attr_expected_rparen;
|
|
diagnose(Tok.getLoc(), diagnostic, AttrName, parseAsPartOfSpecializeAttr);
|
|
}
|
|
return false;
|
|
}
|
|
|
|
if (!DiscardAttribute) {
|
|
addAttribute(AvailabilityAttr.get());
|
|
} else {
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
bool Parser::parseSpecializeAttribute(
|
|
swift::tok ClosingBrace, SourceLoc AtLoc, SourceLoc Loc,
|
|
SpecializeAttr *&Attr, AvailabilityContext *SILAvailability,
|
|
llvm::function_ref<bool(Parser &)> parseSILTargetName,
|
|
llvm::function_ref<bool(Parser &)> parseSILSIPModule) {
|
|
assert(ClosingBrace == tok::r_paren || ClosingBrace == tok::r_square);
|
|
|
|
SourceLoc lParenLoc = consumeToken();
|
|
bool DiscardAttribute = false;
|
|
StringRef AttrName = "_specialize";
|
|
|
|
Optional<bool> exported;
|
|
Optional<SpecializeAttr::SpecializationKind> kind;
|
|
|
|
TrailingWhereClause *trailingWhereClause = nullptr;
|
|
|
|
DeclNameRef targetFunction;
|
|
SmallVector<Identifier, 4> spiGroups;
|
|
SmallVector<AvailableAttr *, 4> availableAttrs;
|
|
if (!parseSpecializeAttributeArguments(
|
|
ClosingBrace, DiscardAttribute, exported, kind, trailingWhereClause,
|
|
targetFunction, SILAvailability, spiGroups, availableAttrs, parseSILTargetName,
|
|
parseSILSIPModule)) {
|
|
return false;
|
|
}
|
|
|
|
// Parse the closing ')' or ']'.
|
|
SourceLoc rParenLoc;
|
|
if (!consumeIf(ClosingBrace, rParenLoc)) {
|
|
if (ClosingBrace == tok::r_paren)
|
|
diagnose(lParenLoc, diag::attr_expected_rparen, AttrName,
|
|
/*DeclModifier=*/false);
|
|
else if (ClosingBrace == tok::r_square)
|
|
diagnose(lParenLoc, diag::attr_expected_rparen, AttrName,
|
|
/*DeclModifier=*/false);
|
|
return false;
|
|
}
|
|
// Not exported by default.
|
|
if (!exported.hasValue())
|
|
exported = false;
|
|
// Full specialization by default.
|
|
if (!kind.hasValue())
|
|
kind = SpecializeAttr::SpecializationKind::Full;
|
|
|
|
if (DiscardAttribute) {
|
|
Attr = nullptr;
|
|
return false;
|
|
}
|
|
// Store the attribute.
|
|
Attr = SpecializeAttr::create(Context, AtLoc, SourceRange(Loc, rParenLoc),
|
|
trailingWhereClause, exported.getValue(),
|
|
kind.getValue(), targetFunction, spiGroups,
|
|
availableAttrs);
|
|
return true;
|
|
}
|
|
|
|
ParserResult<ImplementsAttr>
|
|
Parser::parseImplementsAttribute(SourceLoc AtLoc, SourceLoc Loc) {
|
|
StringRef AttrName = "_implements";
|
|
ParserStatus Status;
|
|
|
|
if (Tok.isNot(tok::l_paren)) {
|
|
diagnose(Loc, diag::attr_expected_lparen, AttrName,
|
|
/*DeclModifier=*/false);
|
|
Status.setIsParseError();
|
|
return Status;
|
|
}
|
|
|
|
SourceLoc lParenLoc = consumeToken();
|
|
|
|
DeclNameLoc MemberNameLoc;
|
|
DeclNameRef MemberName;
|
|
ParserResult<TypeRepr> ProtocolType;
|
|
{
|
|
SyntaxParsingContext ContentContext(
|
|
SyntaxContext, SyntaxKind::ImplementsAttributeArguments);
|
|
ProtocolType = parseType();
|
|
Status |= ProtocolType;
|
|
|
|
if (!(Status.isErrorOrHasCompletion() || consumeIf(tok::comma))) {
|
|
diagnose(Tok.getLoc(), diag::attr_expected_comma, AttrName,
|
|
/*DeclModifier=*/false);
|
|
Status.setIsParseError();
|
|
}
|
|
|
|
if (!Status.isErrorOrHasCompletion()) {
|
|
MemberName = parseDeclNameRef(MemberNameLoc,
|
|
diag::attr_implements_expected_member_name,
|
|
DeclNameFlag::AllowZeroArgCompoundNames |
|
|
DeclNameFlag::AllowOperators);
|
|
if (!MemberName) {
|
|
Status.setIsParseError();
|
|
}
|
|
}
|
|
}
|
|
|
|
if (Status.isErrorOrHasCompletion()) {
|
|
skipUntil(tok::r_paren);
|
|
}
|
|
|
|
SourceLoc rParenLoc;
|
|
if (!consumeIf(tok::r_paren, rParenLoc)) {
|
|
diagnose(lParenLoc, diag::attr_expected_rparen, AttrName,
|
|
/*DeclModifier=*/false);
|
|
Status.setIsParseError();
|
|
}
|
|
|
|
if (Status.isErrorOrHasCompletion()) {
|
|
return Status;
|
|
}
|
|
|
|
// FIXME(ModQual): Reject module qualification on MemberName.
|
|
auto *TE = new (Context) TypeExpr(ProtocolType.get());
|
|
return ParserResult<ImplementsAttr>(
|
|
ImplementsAttr::create(Context, AtLoc, SourceRange(Loc, rParenLoc),
|
|
TE, MemberName.getFullName(),
|
|
MemberNameLoc));
|
|
}
|
|
|
|
/// Parse a `@differentiable` attribute, returning true on error.
|
|
///
|
|
/// \verbatim
|
|
/// differentiable-attribute-arguments:
|
|
/// '(' (differentiability-params-clause ',')?
|
|
/// where-clause?
|
|
/// ')'
|
|
/// \endverbatim
|
|
ParserResult<DifferentiableAttr>
|
|
Parser::parseDifferentiableAttribute(SourceLoc atLoc, SourceLoc loc) {
|
|
StringRef AttrName = "differentiable";
|
|
SourceLoc lParenLoc = loc, rParenLoc = loc;
|
|
DifferentiabilityKind diffKind = DifferentiabilityKind::Normal;
|
|
SmallVector<ParsedAutoDiffParameter, 8> parameters;
|
|
TrailingWhereClause *whereClause = nullptr;
|
|
|
|
// Parse '('.
|
|
if (consumeIf(tok::l_paren, lParenLoc)) {
|
|
// Parse @differentiable attribute arguments.
|
|
if (parseDifferentiableAttributeArguments(
|
|
diffKind, parameters, whereClause))
|
|
return makeParserError();
|
|
// Parse ')'.
|
|
if (!consumeIf(tok::r_paren, rParenLoc)) {
|
|
diagnose(getEndOfPreviousLoc(), diag::attr_expected_rparen, AttrName,
|
|
/*DeclModifier=*/false);
|
|
return makeParserError();
|
|
}
|
|
} else {
|
|
// TODO: Change this to an error once clients have migrated to 'reverse'.
|
|
diagnose(
|
|
getEndOfPreviousLoc(), diag::attr_differentiable_expected_reverse)
|
|
.fixItInsert(getEndOfPreviousLoc(), "(reverse)");
|
|
diffKind = DifferentiabilityKind::Reverse;
|
|
}
|
|
|
|
return ParserResult<DifferentiableAttr>(DifferentiableAttr::create(
|
|
Context, /*implicit*/ false, atLoc, SourceRange(loc, rParenLoc), diffKind,
|
|
parameters, whereClause));
|
|
}
|
|
|
|
// Attribute parsing error helper.
|
|
// For the given parentheses depth, skip until ')' and consume it if possible.
|
|
// If no ')' is found, produce error.
|
|
// Always returns true to indicate a parsing error has occurred.
|
|
static bool errorAndSkipUntilConsumeRightParen(Parser &P, StringRef attrName,
|
|
int parenDepth = 1) {
|
|
for (int i = 0; i < parenDepth; ++i) {
|
|
P.skipUntil(tok::r_paren);
|
|
if (!P.consumeIf(tok::r_paren)) {
|
|
P.diagnose(P.Tok, diag::attr_expected_rparen, attrName,
|
|
/*DeclModifier=*/false);
|
|
return true;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
/// Parse a differentiability parameters 'wrt:' clause, returning true on error.
|
|
/// If `allowNamedParameters` is false, allow only index parameters and 'self'.
|
|
///
|
|
/// \verbatim
|
|
/// differentiability-params-clause:
|
|
/// 'wrt' ':' (differentiability-param | differentiability-params)
|
|
/// differentiability-params:
|
|
/// '(' differentiability-param (',' differentiability-param)* ')'
|
|
/// differentiability-param:
|
|
/// 'self' | identifier | [0-9]+
|
|
/// \endverbatim
|
|
bool Parser::parseDifferentiabilityParametersClause(
|
|
SmallVectorImpl<ParsedAutoDiffParameter> ¶meters, StringRef attrName,
|
|
bool allowNamedParameters) {
|
|
SyntaxParsingContext DiffParamsClauseContext(
|
|
SyntaxContext, SyntaxKind::DifferentiabilityParamsClause);
|
|
consumeToken(tok::identifier);
|
|
if (!consumeIf(tok::colon)) {
|
|
diagnose(Tok, diag::expected_colon_after_label, "wrt");
|
|
return errorAndSkipUntilConsumeRightParen(*this, attrName);
|
|
}
|
|
|
|
// Function that parses a parameter into `parameters`. Returns true if error
|
|
// occurred.
|
|
auto parseParam = [&](bool parseTrailingComma = true) -> bool {
|
|
SyntaxParsingContext DiffParamContext(SyntaxContext,
|
|
SyntaxKind::DifferentiabilityParam);
|
|
SourceLoc paramLoc;
|
|
switch (Tok.getKind()) {
|
|
case tok::identifier: {
|
|
// If named parameters are not allowed, diagnose.
|
|
if (!allowNamedParameters) {
|
|
diagnose(Tok, diag::diff_params_clause_expected_parameter_unnamed);
|
|
return true;
|
|
}
|
|
Identifier paramName;
|
|
paramLoc = consumeIdentifier(paramName, /*diagnoseDollarPrefix=*/false);
|
|
parameters.push_back(
|
|
ParsedAutoDiffParameter::getNamedParameter(paramLoc, paramName));
|
|
break;
|
|
}
|
|
case tok::integer_literal: {
|
|
unsigned paramNum;
|
|
if (parseUnsignedInteger(
|
|
paramNum, paramLoc,
|
|
diag::diff_params_clause_expected_parameter))
|
|
return true;
|
|
parameters.push_back(
|
|
ParsedAutoDiffParameter::getOrderedParameter(paramLoc, paramNum));
|
|
break;
|
|
}
|
|
case tok::kw_self: {
|
|
paramLoc = consumeToken(tok::kw_self);
|
|
parameters.push_back(ParsedAutoDiffParameter::getSelfParameter(paramLoc));
|
|
break;
|
|
}
|
|
default:
|
|
diagnose(Tok, diag::diff_params_clause_expected_parameter);
|
|
return true;
|
|
}
|
|
if (parseTrailingComma && Tok.isNot(tok::r_paren))
|
|
return parseToken(tok::comma, diag::attr_expected_comma, attrName,
|
|
/*isDeclModifier=*/false);
|
|
return false;
|
|
};
|
|
|
|
// Parse opening '(' of the parameter list.
|
|
if (Tok.is(tok::l_paren)) {
|
|
SyntaxParsingContext DiffParamsContext(SyntaxContext,
|
|
SyntaxKind::DifferentiabilityParams);
|
|
consumeToken(tok::l_paren);
|
|
// Parse first parameter. At least one is required.
|
|
if (parseParam())
|
|
return errorAndSkipUntilConsumeRightParen(*this, attrName, 2);
|
|
// Parse remaining parameters until ')'.
|
|
while (Tok.isNot(tok::r_paren))
|
|
if (parseParam())
|
|
return errorAndSkipUntilConsumeRightParen(*this, attrName, 2);
|
|
SyntaxContext->collectNodesInPlace(SyntaxKind::DifferentiabilityParamList);
|
|
// Parse closing ')' of the parameter list.
|
|
consumeToken(tok::r_paren);
|
|
}
|
|
// If no opening '(' for parameter list, parse a single parameter.
|
|
else {
|
|
if (parseParam(/*parseTrailingComma*/ false))
|
|
return errorAndSkipUntilConsumeRightParen(*this, attrName);
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool Parser::parseDifferentiableAttributeArguments(
|
|
DifferentiabilityKind &diffKind,
|
|
SmallVectorImpl<ParsedAutoDiffParameter> ¶meters,
|
|
TrailingWhereClause *&whereClause) {
|
|
StringRef AttrName = "differentiable";
|
|
|
|
// Parse trailing comma, if it exists, and check for errors.
|
|
auto consumeIfTrailingComma = [&]() -> bool {
|
|
if (!consumeIf(tok::comma)) return false;
|
|
// Diagnose trailing comma before 'where' or ')'.
|
|
if (Tok.is(tok::kw_where) || Tok.is(tok::r_paren)) {
|
|
diagnose(Tok, diag::unexpected_separator, ",");
|
|
return true;
|
|
}
|
|
// Check that token after comma is 'wrt'.
|
|
if (isIdentifier(Tok, "wrt")) {
|
|
return false;
|
|
}
|
|
diagnose(Tok, diag::attr_differentiable_expected_label);
|
|
return true;
|
|
};
|
|
|
|
// Store starting parser position.
|
|
auto startingLoc = Tok.getLoc();
|
|
SyntaxParsingContext ContentContext(
|
|
SyntaxContext, SyntaxKind::DifferentiableAttributeArguments);
|
|
|
|
// Parse optional differentiability parameters.
|
|
// Parse differentiability kind (optional).
|
|
if (Tok.is(tok::identifier)) {
|
|
diffKind = llvm::StringSwitch<DifferentiabilityKind>(Tok.getText())
|
|
.Case("reverse", DifferentiabilityKind::Reverse)
|
|
.Cases("wrt", "withRespectTo", DifferentiabilityKind::Normal)
|
|
.Case("_linear", DifferentiabilityKind::Linear)
|
|
.Case("_forward", DifferentiabilityKind::Forward)
|
|
.Default(DifferentiabilityKind::NonDifferentiable);
|
|
|
|
switch (diffKind) {
|
|
// Reject unsupported differentiability kinds.
|
|
case DifferentiabilityKind::Forward:
|
|
diagnose(Tok, diag::attr_differentiable_kind_not_supported,
|
|
Tok.getText())
|
|
.fixItReplaceChars(Tok.getRange().getStart(),
|
|
Tok.getRange().getEnd(), "reverse");
|
|
return errorAndSkipUntilConsumeRightParen(*this, AttrName);
|
|
case DifferentiabilityKind::NonDifferentiable:
|
|
diagnose(Tok, diag::attr_differentiable_unknown_kind,
|
|
Tok.getText())
|
|
.fixItReplaceChars(Tok.getRange().getStart(),
|
|
Tok.getRange().getEnd(), "reverse");
|
|
return errorAndSkipUntilConsumeRightParen(*this, AttrName);
|
|
// Accepted kinds.
|
|
case DifferentiabilityKind::Linear:
|
|
case DifferentiabilityKind::Reverse:
|
|
consumeToken(tok::identifier);
|
|
// If no trailing comma or 'where' clause, terminate parsing arguments.
|
|
if (Tok.isNot(tok::comma, tok::kw_where))
|
|
return false;
|
|
if (consumeIfTrailingComma())
|
|
return errorAndSkipUntilConsumeRightParen(*this, AttrName);
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (diffKind == DifferentiabilityKind::Normal) {
|
|
// TODO: Change this to an error when clients have migrated to 'reverse'.
|
|
diagnose(Tok, diag::attr_differentiable_expected_reverse)
|
|
.fixItInsert(
|
|
startingLoc,
|
|
peekToken().is(tok::r_paren) ? "reverse" : "reverse, ");
|
|
diffKind = DifferentiabilityKind::Reverse;
|
|
}
|
|
|
|
// If 'withRespectTo' is used, make the user change it to 'wrt'.
|
|
if (isIdentifier(Tok, "withRespectTo")) {
|
|
SourceRange withRespectToRange(Tok.getLoc(), peekToken().getLoc());
|
|
diagnose(Tok, diag::attr_differentiable_use_wrt_not_withrespectto)
|
|
.highlight(withRespectToRange)
|
|
.fixItReplace(withRespectToRange, "wrt:");
|
|
return errorAndSkipUntilConsumeRightParen(*this, AttrName);
|
|
}
|
|
// Parse the optional 'wrt' differentiability parameters clause.
|
|
if (isIdentifier(Tok, "wrt")) {
|
|
if (parseDifferentiabilityParametersClause(parameters, AttrName))
|
|
return true;
|
|
// If no trailing comma or 'where' clause, terminate parsing arguments.
|
|
if (Tok.isNot(tok::comma, tok::kw_where))
|
|
return false;
|
|
if (consumeIfTrailingComma())
|
|
return errorAndSkipUntilConsumeRightParen(*this, AttrName);
|
|
}
|
|
|
|
// If parser has not advanced and token is not 'where' or ')', emit error.
|
|
if (Tok.getLoc() == startingLoc && Tok.isNot(tok::kw_where, tok::r_paren)) {
|
|
diagnose(Tok, diag::attr_differentiable_expected_label);
|
|
return errorAndSkipUntilConsumeRightParen(*this, AttrName);
|
|
}
|
|
|
|
// Parse a trailing 'where' clause if any.
|
|
if (Tok.is(tok::kw_where)) {
|
|
SourceLoc whereLoc, endLoc;
|
|
SmallVector<RequirementRepr, 4> requirements;
|
|
parseGenericWhereClause(whereLoc, endLoc, requirements,
|
|
/*AllowLayoutConstraints*/ true);
|
|
whereClause =
|
|
TrailingWhereClause::create(Context, whereLoc, endLoc, requirements);
|
|
}
|
|
return false;
|
|
}
|
|
|
|
// Helper function that returns the accessor kind if a token is an accessor
|
|
// label.
|
|
static Optional<AccessorKind> isAccessorLabel(const Token &token) {
|
|
if (token.is(tok::identifier)) {
|
|
StringRef tokText = token.getText();
|
|
for (auto accessor : allAccessorKinds())
|
|
if (tokText == getAccessorLabel(accessor))
|
|
return accessor;
|
|
}
|
|
return None;
|
|
}
|
|
|
|
/// Helper function that parses 'type-identifier' for `parseQualifiedDeclName`.
|
|
/// Returns true on error. Sets `baseType` to the parsed base type if present,
|
|
/// or to `nullptr` if not. A missing base type is not considered an error.
|
|
static bool parseBaseTypeForQualifiedDeclName(Parser &P, TypeRepr *&baseType) {
|
|
baseType = nullptr;
|
|
Parser::CancellableBacktrackingScope backtrack(P);
|
|
|
|
// If base type cannot be parsed, return false (no error).
|
|
if (!P.canParseBaseTypeForQualifiedDeclName())
|
|
return false;
|
|
|
|
auto result = P.parseTypeIdentifier(/*isParsingQualifiedDeclName*/ true);
|
|
// If base type should be parseable but the actual base type result is null,
|
|
// return true (error).
|
|
if (result.isNull())
|
|
return true;
|
|
|
|
// Consume the leading period before the final declaration name component.
|
|
// `parseTypeIdentifier(/*isParsingQualifiedDeclName*/ true)` leaves the
|
|
// leading period unparsed to avoid syntax verification errors.
|
|
assert(P.startsWithSymbol(P.Tok, '.') && "false");
|
|
|
|
// Check if this is a reference to a property or subscript accessor.
|
|
//
|
|
// Note: There is an parsing ambiguity here. An accessor label identifier
|
|
// (e.g. "set") may refer to the final declaration name component instead of
|
|
// an accessor kind.
|
|
//
|
|
// FIXME: It is wrong to backtrack parsing the entire base type if an accessor
|
|
// label is found. Instead, only the final component of the base type should
|
|
// be backtracked. It may be best to implement this in
|
|
// `Parser::parseTypeIdentifier`.
|
|
//
|
|
// Example: consider parsing `A.B.property.set`.
|
|
// Current behavior: base type is entirely backtracked.
|
|
// Ideal behavior: base type is parsed as `A.B`.
|
|
if (P.Tok.is(tok::period)) {
|
|
const Token &nextToken = P.peekToken();
|
|
if (isAccessorLabel(nextToken).hasValue())
|
|
return false;
|
|
}
|
|
|
|
backtrack.cancelBacktrack();
|
|
P.consumeStartingCharacterOfCurrentToken(tok::period);
|
|
|
|
// Set base type and return false (no error).
|
|
baseType = result.getPtrOrNull();
|
|
return false;
|
|
}
|
|
|
|
/// Parses an optional base type, followed by a declaration name.
|
|
/// Returns true on error (if declaration name could not be parsed).
|
|
///
|
|
/// \verbatim
|
|
/// qualified-decl-name:
|
|
/// type-identifier? unqualified-decl-name
|
|
/// type-identifier:
|
|
/// identifier generic-args? ('.' identifier generic-args?)*
|
|
/// \endverbatim
|
|
///
|
|
// TODO(TF-1066): Use module qualified name syntax/parsing instead of custom
|
|
// qualified name syntax/parsing.
|
|
static bool parseQualifiedDeclName(Parser &P, Diag<> nameParseError,
|
|
TypeRepr *&baseType,
|
|
DeclNameRefWithLoc &original) {
|
|
{
|
|
SyntaxParsingContext DeclNameContext(P.SyntaxContext,
|
|
SyntaxKind::QualifiedDeclName);
|
|
// Parse base type.
|
|
if (parseBaseTypeForQualifiedDeclName(P, baseType))
|
|
return true;
|
|
// Parse final declaration name.
|
|
original.Name = P.parseDeclNameRef(
|
|
original.Loc, nameParseError,
|
|
Parser::DeclNameFlag::AllowZeroArgCompoundNames |
|
|
Parser::DeclNameFlag::AllowKeywordsUsingSpecialNames |
|
|
Parser::DeclNameFlag::AllowOperators);
|
|
// The base type is optional, but the final unqualified declaration name is
|
|
// not. If name could not be parsed, return true for error.
|
|
if (!original.Name)
|
|
return true;
|
|
}
|
|
|
|
// Parse an optional accessor kind.
|
|
//
|
|
// Note: there is an parsing ambiguity here.
|
|
//
|
|
// Example: `A.B.property.set` may be parsed as one of the following:
|
|
//
|
|
// 1. No accessor kind.
|
|
// - Base type: `A.B.property`
|
|
// - Declaration name: `set`
|
|
// - Accessor kind: <none>
|
|
//
|
|
// 2. Accessor kind exists.
|
|
// - Base type: `A.B`
|
|
// - Declaration name: `property`
|
|
// - Accessor kind: `set`
|
|
//
|
|
// Currently, we follow (2) because it's more useful in practice.
|
|
if (P.Tok.is(tok::period)) {
|
|
const Token &nextToken = P.peekToken();
|
|
Optional<AccessorKind> kind = isAccessorLabel(nextToken);
|
|
if (kind.hasValue()) {
|
|
original.AccessorKind = kind;
|
|
P.consumeIf(tok::period);
|
|
P.consumeIf(tok::identifier);
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
/// Parse a `@derivative(of:)` attribute, returning true on error.
|
|
///
|
|
/// \verbatim
|
|
/// derivative-attribute-arguments:
|
|
/// '(' 'of' ':' qualified-decl-name (',' differentiability-params-clause)?
|
|
/// ')'
|
|
/// \endverbatim
|
|
ParserResult<DerivativeAttr> Parser::parseDerivativeAttribute(SourceLoc atLoc,
|
|
SourceLoc loc) {
|
|
StringRef AttrName = "derivative";
|
|
SourceLoc lParenLoc = loc, rParenLoc = loc;
|
|
TypeRepr *baseType = nullptr;
|
|
DeclNameRefWithLoc original;
|
|
SmallVector<ParsedAutoDiffParameter, 8> parameters;
|
|
|
|
// Parse trailing comma, if it exists, and check for errors.
|
|
auto consumeIfTrailingComma = [&](bool requireComma = false) -> bool {
|
|
if (!consumeIf(tok::comma)) {
|
|
// If comma is required but does not exist and ')' has not been reached,
|
|
// diagnose missing comma.
|
|
if (requireComma && !Tok.is(tok::r_paren)) {
|
|
diagnose(getEndOfPreviousLoc(), diag::expected_separator, ",");
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
// Diagnose trailing comma before ')'.
|
|
if (Tok.is(tok::r_paren)) {
|
|
diagnose(Tok, diag::unexpected_separator, ",");
|
|
return errorAndSkipUntilConsumeRightParen(*this, AttrName);
|
|
}
|
|
// Check that token after comma is 'wrt:'.
|
|
if (isIdentifier(Tok, "wrt"))
|
|
return false;
|
|
diagnose(Tok, diag::attr_expected_label, "wrt", AttrName);
|
|
return errorAndSkipUntilConsumeRightParen(*this, AttrName);
|
|
};
|
|
// Parse '('.
|
|
if (!consumeIf(tok::l_paren, lParenLoc)) {
|
|
diagnose(getEndOfPreviousLoc(), diag::attr_expected_lparen, AttrName,
|
|
/*DeclModifier*/ false);
|
|
return makeParserError();
|
|
}
|
|
{
|
|
SyntaxParsingContext ContentContext(
|
|
SyntaxContext, SyntaxKind::DerivativeRegistrationAttributeArguments);
|
|
// Parse the 'of:' label and colon.
|
|
if (parseSpecificIdentifier("of", diag::attr_missing_label, "of",
|
|
AttrName) ||
|
|
parseToken(tok::colon, diag::expected_colon_after_label, "of")) {
|
|
return makeParserError();
|
|
}
|
|
{
|
|
// Parse the optionally qualified function name.
|
|
if (parseQualifiedDeclName(
|
|
*this, diag::autodiff_attr_expected_original_decl_name,
|
|
baseType, original))
|
|
return makeParserError();
|
|
}
|
|
if (consumeIfTrailingComma(/*requireComma*/ true))
|
|
return makeParserError();
|
|
// Parse the optional 'wrt' differentiability parameters clause.
|
|
if (isIdentifier(Tok, "wrt") &&
|
|
parseDifferentiabilityParametersClause(parameters, AttrName))
|
|
return makeParserError();
|
|
}
|
|
// Parse ')'.
|
|
if (!consumeIf(tok::r_paren, rParenLoc)) {
|
|
diagnose(getEndOfPreviousLoc(), diag::attr_expected_rparen, AttrName,
|
|
/*DeclModifier*/ false);
|
|
return makeParserError();
|
|
}
|
|
return ParserResult<DerivativeAttr>(DerivativeAttr::create(
|
|
Context, /*implicit*/ false, atLoc, SourceRange(loc, rParenLoc), baseType,
|
|
original, parameters));
|
|
}
|
|
|
|
/// Parse a `@transpose(of:)` attribute, returning true on error.
|
|
///
|
|
/// \verbatim
|
|
/// transpose-attribute-arguments:
|
|
/// '(' 'of' ':' qualified-decl-name (',' linearity-params-clause)? ')'
|
|
/// linearity-params-clause:
|
|
/// 'wrt' ':' (linearity-param | linearity-params)
|
|
/// linearity-params:
|
|
/// '(' linearity-param (',' linearity-param)* ')'
|
|
/// linearity-param:
|
|
/// 'self' | [0-9]+
|
|
/// \endverbatim
|
|
ParserResult<TransposeAttr> Parser::parseTransposeAttribute(SourceLoc atLoc,
|
|
SourceLoc loc) {
|
|
StringRef AttrName = "transpose";
|
|
SourceLoc lParenLoc = loc, rParenLoc = loc;
|
|
TypeRepr *baseType = nullptr;
|
|
DeclNameRefWithLoc original;
|
|
SmallVector<ParsedAutoDiffParameter, 8> parameters;
|
|
|
|
// Parse trailing comma, if it exists, and check for errors.
|
|
auto consumeIfTrailingComma = [&](bool requireComma = false) -> bool {
|
|
if (!consumeIf(tok::comma)) {
|
|
// If comma is required but does not exist and ')' has not been reached,
|
|
// diagnose missing comma.
|
|
if (requireComma && !Tok.is(tok::r_paren)) {
|
|
diagnose(Tok, diag::expected_separator, ",");
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
// Diagnose trailing comma before ')'.
|
|
if (Tok.is(tok::r_paren)) {
|
|
diagnose(Tok, diag::unexpected_separator, ",");
|
|
return errorAndSkipUntilConsumeRightParen(*this, AttrName);
|
|
}
|
|
// Check that token after comma is 'wrt:'.
|
|
if (isIdentifier(Tok, "wrt"))
|
|
return false;
|
|
diagnose(Tok, diag::attr_expected_label, "wrt", AttrName);
|
|
return errorAndSkipUntilConsumeRightParen(*this, AttrName);
|
|
};
|
|
|
|
// Parse '('.
|
|
if (!consumeIf(tok::l_paren, lParenLoc)) {
|
|
diagnose(getEndOfPreviousLoc(), diag::attr_expected_lparen, AttrName,
|
|
/*DeclModifier*/ false);
|
|
return makeParserError();
|
|
}
|
|
{
|
|
SyntaxParsingContext ContentContext(
|
|
SyntaxContext, SyntaxKind::DerivativeRegistrationAttributeArguments);
|
|
// Parse the 'of:' label and colon.
|
|
if (parseSpecificIdentifier("of", diag::attr_missing_label, "of",
|
|
AttrName) ||
|
|
parseToken(tok::colon, diag::expected_colon_after_label, "of")) {
|
|
return makeParserError();
|
|
}
|
|
{
|
|
// Parse the optionally qualified function name.
|
|
if (parseQualifiedDeclName(
|
|
*this, diag::autodiff_attr_expected_original_decl_name,
|
|
baseType, original))
|
|
return makeParserError();
|
|
}
|
|
if (consumeIfTrailingComma(/*requireComma*/ true))
|
|
return makeParserError();
|
|
// Parse the optional 'wrt' linearity parameters clause.
|
|
if (Tok.is(tok::identifier) && Tok.getText() == "wrt" &&
|
|
parseDifferentiabilityParametersClause(parameters, AttrName,
|
|
/*allowNamedParameters*/ false))
|
|
return makeParserError();
|
|
}
|
|
// Parse ')'.
|
|
if (!consumeIf(tok::r_paren, rParenLoc)) {
|
|
diagnose(getEndOfPreviousLoc(), diag::attr_expected_rparen, AttrName,
|
|
/*DeclModifier*/ false);
|
|
return makeParserError();
|
|
}
|
|
return ParserResult<TransposeAttr>(TransposeAttr::create(
|
|
Context, /*implicit*/ false, atLoc, SourceRange(loc, rParenLoc), baseType,
|
|
original, parameters));
|
|
}
|
|
|
|
void Parser::parseObjCSelector(SmallVector<Identifier, 4> &Names,
|
|
SmallVector<SourceLoc, 4> &NameLocs,
|
|
bool &IsNullarySelector) {
|
|
IsNullarySelector = true;
|
|
SyntaxParsingContext SelectorContext(SyntaxContext, SyntaxKind::ObjCSelector);
|
|
while (true) {
|
|
SyntaxParsingContext SelectorPieceContext(SyntaxContext,
|
|
SyntaxKind::ObjCSelectorPiece);
|
|
// Empty selector piece.
|
|
if (Tok.is(tok::colon)) {
|
|
Names.push_back(Identifier());
|
|
NameLocs.push_back(Tok.getLoc());
|
|
IsNullarySelector = false;
|
|
consumeToken();
|
|
continue;
|
|
}
|
|
|
|
// Name.
|
|
if (Tok.is(tok::identifier) || Tok.isKeyword()) {
|
|
Names.push_back(Context.getIdentifier(Tok.getText()));
|
|
NameLocs.push_back(Tok.getLoc());
|
|
consumeToken();
|
|
|
|
// If we have a colon, consume it.
|
|
if (Tok.is(tok::colon)) {
|
|
consumeToken();
|
|
IsNullarySelector = false;
|
|
continue;
|
|
}
|
|
|
|
// If we see a closing parentheses, we're done.
|
|
if (Tok.is(tok::r_paren)) {
|
|
// If we saw more than one identifier, there's a ':'
|
|
// missing here. Complain and pretend we saw it.
|
|
if (Names.size() > 1) {
|
|
diagnose(Tok, diag::attr_objc_missing_colon)
|
|
.fixItInsertAfter(NameLocs.back(), ":");
|
|
IsNullarySelector = false;
|
|
}
|
|
|
|
break;
|
|
}
|
|
|
|
// If we see another identifier or keyword, complain about
|
|
// the missing colon and keep going.
|
|
if (Tok.is(tok::identifier) || Tok.isKeyword()) {
|
|
diagnose(Tok, diag::attr_objc_missing_colon)
|
|
.fixItInsertAfter(NameLocs.back(), ":");
|
|
IsNullarySelector = false;
|
|
continue;
|
|
}
|
|
|
|
// We don't know what happened. Break out.
|
|
break;
|
|
}
|
|
|
|
// We didn't parse anything, don't create a ObjCSelectorPiece
|
|
SelectorPieceContext.setTransparent();
|
|
break;
|
|
}
|
|
}
|
|
|
|
bool Parser::peekAvailabilityMacroName() {
|
|
parseAllAvailabilityMacroArguments();
|
|
AvailabilityMacroMap Map = AvailabilityMacros;
|
|
|
|
StringRef MacroName = Tok.getText();
|
|
return Map.find(MacroName) != Map.end();
|
|
}
|
|
|
|
ParserStatus
|
|
Parser::parseAvailabilityMacro(SmallVectorImpl<AvailabilitySpec *> &Specs) {
|
|
// Get the macros from the compiler arguments.
|
|
parseAllAvailabilityMacroArguments();
|
|
AvailabilityMacroMap Map = AvailabilityMacros;
|
|
|
|
StringRef MacroName = Tok.getText();
|
|
auto NameMatch = Map.find(MacroName);
|
|
if (NameMatch == Map.end())
|
|
return makeParserSuccess(); // No match, it could be a standard platform.
|
|
|
|
SyntaxParsingContext VersionRestrictionContext(
|
|
SyntaxContext, SyntaxKind::AvailabilityVersionRestriction);
|
|
|
|
consumeToken();
|
|
|
|
llvm::VersionTuple Version;
|
|
SourceRange VersionRange;
|
|
if (Tok.isAny(tok::integer_literal, tok::floating_literal)) {
|
|
if (parseVersionTuple(Version, VersionRange,
|
|
diag::avail_query_expected_version_number))
|
|
return makeParserError();
|
|
}
|
|
|
|
auto VersionMatch = NameMatch->getSecond().find(Version);
|
|
if (VersionMatch == NameMatch->getSecond().end()) {
|
|
diagnose(PreviousLoc, diag::attr_availability_unknown_version,
|
|
Version.getAsString(), MacroName);
|
|
return makeParserError(); // Failed to match the version, that's an error.
|
|
}
|
|
|
|
// Make a copy of the specs to add the macro source location
|
|
// for the diagnostic about the use of macros in inlinable code.
|
|
SourceLoc MacroLoc = Tok.getLoc();
|
|
for (auto *Spec : VersionMatch->getSecond())
|
|
if (auto *PlatformVersionSpec =
|
|
dyn_cast<PlatformVersionConstraintAvailabilitySpec>(Spec)) {
|
|
auto SpecCopy =
|
|
new (Context) PlatformVersionConstraintAvailabilitySpec(
|
|
*PlatformVersionSpec);
|
|
SpecCopy->setMacroLoc(MacroLoc);
|
|
Specs.push_back(SpecCopy);
|
|
}
|
|
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
void Parser::parseAllAvailabilityMacroArguments() {
|
|
|
|
if (AvailabilityMacrosComputed) return;
|
|
|
|
AvailabilityMacroMap Map;
|
|
|
|
SourceManager &SM = Context.SourceMgr;
|
|
LangOptions LangOpts = Context.LangOpts;
|
|
// The sub-parser is not actually parsing the source file but the LangOpts
|
|
// AvailabilityMacros. No point creating a libSyntax tree for it. In fact, the
|
|
// creation of a libSyntax tree would always fail because the
|
|
// AvailibilityMacro is not valid Swift source code.
|
|
LangOpts.BuildSyntaxTree = false;
|
|
|
|
for (StringRef macro: LangOpts.AvailabilityMacros) {
|
|
|
|
// Create temporary parser.
|
|
int bufferID = SM.addMemBufferCopy(macro,
|
|
"-define-availability argument");
|
|
swift::ParserUnit PU(SM, SourceFileKind::Main, bufferID, LangOpts,
|
|
TypeCheckerOptions(), SILOptions(), "unknown");
|
|
|
|
ForwardingDiagnosticConsumer PDC(Context.Diags);
|
|
PU.getDiagnosticEngine().addConsumer(PDC);
|
|
|
|
// Parse the argument.
|
|
AvailabilityMacroDefinition ParsedMacro;
|
|
ParserStatus Status =
|
|
PU.getParser().parseAvailabilityMacroDefinition(ParsedMacro);
|
|
if (Status.isError())
|
|
continue;
|
|
|
|
// Copy the Specs to the requesting ASTContext from the temporary context
|
|
// that parsed the argument.
|
|
auto SpecsCopy = SmallVector<AvailabilitySpec*, 4>();
|
|
for (auto *Spec : ParsedMacro.Specs)
|
|
if (auto *PlatformVersionSpec =
|
|
dyn_cast<PlatformVersionConstraintAvailabilitySpec>(Spec)) {
|
|
auto SpecCopy =
|
|
new (Context) PlatformVersionConstraintAvailabilitySpec(
|
|
*PlatformVersionSpec);
|
|
SpecsCopy.push_back(SpecCopy);
|
|
}
|
|
|
|
ParsedMacro.Specs = SpecsCopy;
|
|
|
|
// Find the macro info by name.
|
|
AvailabilityMacroVersionMap MacroDefinition;
|
|
auto NameMatch = Map.find(ParsedMacro.Name);
|
|
if (NameMatch != Map.end()) {
|
|
MacroDefinition = NameMatch->getSecond();
|
|
}
|
|
|
|
// Set the macro info by version.
|
|
auto PreviousEntry =
|
|
MacroDefinition.insert({ParsedMacro.Version, ParsedMacro.Specs});
|
|
if (!PreviousEntry.second) {
|
|
diagnose(PU.getParser().PreviousLoc, diag::attr_availability_duplicate,
|
|
ParsedMacro.Name, ParsedMacro.Version.getAsString());
|
|
}
|
|
|
|
// Save back the macro spec.
|
|
Map.erase(ParsedMacro.Name);
|
|
Map.insert({ParsedMacro.Name, MacroDefinition});
|
|
}
|
|
|
|
AvailabilityMacros = Map;
|
|
AvailabilityMacrosComputed = true;
|
|
}
|
|
|
|
/// Processes a parsed option name by attempting to match it to a list of
|
|
/// alternative name/value pairs provided by a chain of \c when() calls, ending
|
|
/// in either \c whenOmitted() if omitting the option is allowed, or
|
|
/// \c diagnoseWhenOmitted() if the option is mandatory.
|
|
template<typename T, typename R = T>
|
|
class LLVM_NODISCARD AttrOptionSwitch {
|
|
// Inputs:
|
|
Optional<StringRef> parsedName; // None: parse error, empty: omitted
|
|
Parser &P;
|
|
SourceLoc loc;
|
|
StringRef attrName; // empty: error already diagnosed
|
|
bool isDeclModifier;
|
|
|
|
// State:
|
|
StringRef exampleName; // empty: when() was never called
|
|
Optional<R> result; // None: no when() has matched
|
|
|
|
public:
|
|
/// \param parsedName The name of the option parsed out of the source code. If
|
|
/// \c None, there was some sort of parse error; this will normally be
|
|
/// diagnosed as \c diag::attr_expected_option_such_as using the name
|
|
/// from the first \c when() call as an example.
|
|
/// \param P The parser used to diagnose errors concerning this attribute
|
|
/// option.
|
|
/// \param loc The source location to diagnose errors at.
|
|
/// \param attrName The name of the attribute, used in diagnostics. If empty,
|
|
/// an error has already been diagnosed and the AttrOptionSwitch should
|
|
/// just fall through.
|
|
/// \param isDeclModifier Are we parsing an attribute or a modifier?
|
|
AttrOptionSwitch(Optional<StringRef> parsedName, Parser &P, SourceLoc loc,
|
|
StringRef attrName, bool isDeclModifier)
|
|
: parsedName(parsedName), P(P), loc(loc), attrName(attrName),
|
|
isDeclModifier(isDeclModifier) { }
|
|
|
|
/// If the option has the identifier \p name, give it value \p value.
|
|
AttrOptionSwitch<R, T> &when(StringLiteral name, T value) {
|
|
// Save this to use in a future diagnostic, if needed.
|
|
if (exampleName.empty() && !name.empty())
|
|
exampleName = name;
|
|
|
|
// Does this string match?
|
|
if (parsedName && *parsedName == name) {
|
|
assert(!result && "overlapping AttrOptionSwitch::when()s?");
|
|
result = std::move(value);
|
|
}
|
|
|
|
return *this;
|
|
}
|
|
|
|
/// Diagnose if the option is missing or was not matched, returning either the
|
|
/// option's value or \c None if an error was diagnosed.
|
|
Optional<R> diagnoseWhenOmitted() {
|
|
assert(!exampleName.empty() && "No AttrOptionSwitch::when() calls");
|
|
|
|
if (attrName.empty())
|
|
// An error has already been diagnosed; nothing to do.
|
|
return None;
|
|
|
|
if (!result) {
|
|
if (!parsedName)
|
|
// We parsed a non-identifier; diagnose it with `exampleName`.
|
|
P.diagnose(loc, diag::attr_expected_option_such_as, attrName,
|
|
exampleName);
|
|
else if (*parsedName == "")
|
|
// Option list was omitted; apparently this attr doesn't allow that.
|
|
P.diagnose(loc, diag::attr_expected_lparen, attrName, isDeclModifier);
|
|
else
|
|
// The identifier didn't match any of the when() calls.
|
|
P.diagnose(loc, diag::attr_unknown_option, *parsedName, attrName);
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
/// Diagnose if the option is missing or not matched, returning:
|
|
///
|
|
/// \returns \c None if an error was diagnosed; \p value if the option was
|
|
/// omitted; the value the option was matched to otherwise.
|
|
Optional<R> whenOmitted(T value) {
|
|
return when("", value).diagnoseWhenOmitted();
|
|
}
|
|
};
|
|
|
|
/// Parses an attribute argument list that allows a single identifier with a
|
|
/// known set of permitted options:
|
|
///
|
|
/// \verbatim
|
|
/// '(' identifier ')'
|
|
/// \endverbatim
|
|
///
|
|
/// Returns an object of type \c AttrOptionSwitch, a type loosely inspired by
|
|
/// \c llvm::StringSwitch which can be used in a fluent style to map each
|
|
/// permitted identifier to a value. Together, they will automatically
|
|
/// diagnose \c diag::attr_expected_lparen,
|
|
/// \c diag::attr_expected_option_such_as, \c diag::attr_unknown_option, and
|
|
/// \c diag::attr_expected_rparen when needed.
|
|
///
|
|
/// \seealso AttrOptionSwitch
|
|
template<typename R>
|
|
static AttrOptionSwitch<R>
|
|
parseSingleAttrOption(Parser &P, SourceLoc Loc, SourceRange &AttrRange,
|
|
StringRef AttrName, DeclAttrKind DK) {
|
|
bool isModifier = DeclAttribute::isDeclModifier(DK);
|
|
if (!P.consumeIf(tok::l_paren)) {
|
|
AttrRange = SourceRange(Loc);
|
|
// Create an AttrOptionSwitch with an empty value. The calls on it will
|
|
// decide whether or not that's valid.
|
|
return AttrOptionSwitch<R>(StringRef(), P, Loc, AttrName, isModifier);
|
|
}
|
|
|
|
StringRef parsedName = P.Tok.getText();
|
|
if (!P.consumeIf(tok::identifier)) {
|
|
// Once we have an example of a valid option, diagnose this with
|
|
// diag::attr_expected_option_such_as.
|
|
return AttrOptionSwitch<R>(None, P, Loc, AttrName, isModifier);
|
|
}
|
|
|
|
if (!P.consumeIf(tok::r_paren)) {
|
|
P.diagnose(Loc, diag::attr_expected_rparen, AttrName, isModifier);
|
|
// Pass through the switch without diagnosing anything.
|
|
return AttrOptionSwitch<R>(None, P, Loc, "", isModifier);
|
|
}
|
|
|
|
AttrRange = SourceRange(Loc, P.PreviousLoc);
|
|
return AttrOptionSwitch<R>(parsedName, P, Loc, AttrName, isModifier);
|
|
}
|
|
|
|
bool Parser::parseNewDeclAttribute(DeclAttributes &Attributes, SourceLoc AtLoc,
|
|
DeclAttrKind DK, bool isFromClangAttribute) {
|
|
// Ok, it is a valid attribute, eat it, and then process it.
|
|
StringRef AttrName = Tok.getText();
|
|
SourceLoc Loc = consumeToken();
|
|
|
|
bool DiscardAttribute = false;
|
|
|
|
// Diagnose duplicated attributes.
|
|
const DeclAttribute *DuplicateAttribute = nullptr;
|
|
if (!DeclAttribute::allowMultipleAttributes(DK))
|
|
if ((DuplicateAttribute = Attributes.getAttribute(DK))) {
|
|
// Delay issuing the diagnostic until we parse the attribute.
|
|
DiscardAttribute = true;
|
|
}
|
|
|
|
// If this is a SIL-only attribute, reject it.
|
|
if ((DeclAttribute::getOptions(DK) & DeclAttribute::SILOnly) != 0 &&
|
|
!isInSILMode()) {
|
|
diagnose(Loc, diag::only_allowed_in_sil, AttrName);
|
|
DiscardAttribute = true;
|
|
}
|
|
|
|
// If this attribute is only permitted when concurrency is enabled, reject it.
|
|
if (DeclAttribute::isConcurrencyOnly(DK) &&
|
|
!shouldParseExperimentalConcurrency()) {
|
|
// Ignore concurrency-only attributes that come from Clang.
|
|
if (!isFromClangAttribute) {
|
|
diagnose(
|
|
Loc, diag::attr_requires_concurrency, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
}
|
|
|
|
DiscardAttribute = true;
|
|
}
|
|
|
|
// If this attribute is only permitted when distributed is enabled, reject it.
|
|
if (DeclAttribute::isDistributedOnly(DK) &&
|
|
!shouldParseExperimentalDistributed()) {
|
|
diagnose(Loc, diag::attr_requires_distributed, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
DiscardAttribute = true;
|
|
}
|
|
|
|
if (Context.LangOpts.Target.isOSBinFormatCOFF()) {
|
|
if (DK == DAK_WeakLinked) {
|
|
diagnose(Loc, diag::attr_unsupported_on_target, AttrName,
|
|
Context.LangOpts.Target.str());
|
|
DiscardAttribute = true;
|
|
}
|
|
}
|
|
|
|
// Filled in during parsing. If there is a duplicate
|
|
// diagnostic this can be used for better error presentation.
|
|
SourceRange AttrRange;
|
|
|
|
switch (DK) {
|
|
case DAK_Count:
|
|
llvm_unreachable("DAK_Count should not appear in parsing switch");
|
|
|
|
case DAK_RawDocComment:
|
|
case DAK_ObjCBridged:
|
|
case DAK_RestatedObjCConformance:
|
|
case DAK_SynthesizedProtocol:
|
|
case DAK_ClangImporterSynthesizedType:
|
|
case DAK_Custom:
|
|
llvm_unreachable("virtual attributes should not be parsed "
|
|
"by attribute parsing code");
|
|
case DAK_SetterAccess:
|
|
llvm_unreachable("handled by DAK_AccessControl");
|
|
|
|
#define SIMPLE_DECL_ATTR(_, CLASS, ...) \
|
|
case DAK_##CLASS: \
|
|
if (!DiscardAttribute) \
|
|
Attributes.add(new (Context) CLASS##Attr(AtLoc, Loc)); \
|
|
break;
|
|
#include "swift/AST/Attr.def"
|
|
|
|
case DAK_MainType:
|
|
if (!DiscardAttribute)
|
|
Attributes.add(new (Context) MainTypeAttr(AtLoc, Loc));
|
|
break;
|
|
|
|
case DAK_Effects: {
|
|
auto kind = parseSingleAttrOption<EffectsKind>
|
|
(*this, Loc, AttrRange, AttrName, DK)
|
|
.when("readonly", EffectsKind::ReadOnly)
|
|
.when("readnone", EffectsKind::ReadNone)
|
|
.when("readwrite", EffectsKind::ReadWrite)
|
|
.when("releasenone", EffectsKind::ReleaseNone)
|
|
.diagnoseWhenOmitted();
|
|
if (!kind)
|
|
return false;
|
|
|
|
if (!DiscardAttribute)
|
|
Attributes.add(new (Context) EffectsAttr(AtLoc, AttrRange, *kind));
|
|
|
|
break;
|
|
}
|
|
|
|
case DAK_Inline: {
|
|
auto kind = parseSingleAttrOption<InlineKind>
|
|
(*this, Loc, AttrRange, AttrName, DK)
|
|
.when("never", InlineKind::Never)
|
|
.when("__always", InlineKind::Always)
|
|
.diagnoseWhenOmitted();
|
|
if (!kind)
|
|
return false;
|
|
|
|
if (!DiscardAttribute)
|
|
Attributes.add(new (Context) InlineAttr(AtLoc, AttrRange, *kind));
|
|
|
|
break;
|
|
}
|
|
|
|
case DAK_Optimize: {
|
|
auto optMode = parseSingleAttrOption<OptimizationMode>
|
|
(*this, Loc, AttrRange, AttrName, DK)
|
|
.when("speed", OptimizationMode::ForSpeed)
|
|
.when("size", OptimizationMode::ForSize)
|
|
.when("none", OptimizationMode::NoOptimization)
|
|
.diagnoseWhenOmitted();
|
|
if (!optMode)
|
|
return false;
|
|
|
|
if (!DiscardAttribute)
|
|
Attributes.add(new (Context) OptimizeAttr(AtLoc, AttrRange, *optMode));
|
|
|
|
break;
|
|
}
|
|
|
|
case DAK_ReferenceOwnership: {
|
|
// Handle weak/unowned/unowned(unsafe).
|
|
auto Kind = AttrName == "weak" ? ReferenceOwnership::Weak
|
|
: ReferenceOwnership::Unowned;
|
|
|
|
if (Kind == ReferenceOwnership::Unowned) {
|
|
// Parse an optional specifier after unowned.
|
|
Kind = parseSingleAttrOption<ReferenceOwnership>
|
|
(*this, Loc, AttrRange, AttrName, DK)
|
|
.when("unsafe", ReferenceOwnership::Unmanaged)
|
|
.when("safe", ReferenceOwnership::Unowned)
|
|
.whenOmitted(ReferenceOwnership::Unowned)
|
|
// Recover from errors by going back to Unowned.
|
|
.getValueOr(ReferenceOwnership::Unowned);
|
|
}
|
|
else {
|
|
AttrRange = SourceRange(Loc);
|
|
}
|
|
|
|
if (!DiscardAttribute)
|
|
Attributes.add(
|
|
new (Context) ReferenceOwnershipAttr(AttrRange, Kind));
|
|
|
|
break;
|
|
}
|
|
|
|
case DAK_NonSendable: {
|
|
auto kind = parseSingleAttrOption<NonSendableKind>
|
|
(*this, Loc, AttrRange, AttrName, DK)
|
|
.when("_assumed", NonSendableKind::Assumed)
|
|
.whenOmitted(NonSendableKind::Specific);
|
|
if (!kind)
|
|
return false;
|
|
|
|
if (!DiscardAttribute)
|
|
Attributes.add(new (Context) NonSendableAttr(AtLoc, AttrRange, *kind));
|
|
|
|
break;
|
|
}
|
|
|
|
case DAK_AccessControl: {
|
|
|
|
// Diagnose using access control in a local scope, which isn't meaningful.
|
|
if (CurDeclContext->isLocalContext()) {
|
|
diagnose(Loc, diag::attr_only_at_non_local_scope, AttrName);
|
|
}
|
|
|
|
AccessLevel access = llvm::StringSwitch<AccessLevel>(AttrName)
|
|
.Case("private", AccessLevel::Private)
|
|
.Case("fileprivate", AccessLevel::FilePrivate)
|
|
.Case("internal", AccessLevel::Internal)
|
|
.Case("public", AccessLevel::Public)
|
|
.Case("open", AccessLevel::Open);
|
|
|
|
if (!consumeIf(tok::l_paren)) {
|
|
// Normal access control attribute.
|
|
AttrRange = Loc;
|
|
DuplicateAttribute = Attributes.getAttribute<AccessControlAttr>();
|
|
if (!DuplicateAttribute)
|
|
Attributes.add(new (Context) AccessControlAttr(AtLoc, Loc, access));
|
|
break;
|
|
}
|
|
|
|
// Parse the subject.
|
|
if (Tok.isContextualKeyword("set")) {
|
|
consumeToken();
|
|
} else {
|
|
diagnose(Loc, diag::attr_access_expected_set, AttrName);
|
|
// Minimal recovery: if there's a single token and then an r_paren,
|
|
// consume them both. If there's just an r_paren, consume that.
|
|
if (!consumeIf(tok::r_paren)) {
|
|
if (Tok.isNot(tok::l_paren) && peekToken().is(tok::r_paren)) {
|
|
consumeToken();
|
|
consumeToken(tok::r_paren);
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
AttrRange = SourceRange(Loc, Tok.getLoc());
|
|
|
|
if (!consumeIf(tok::r_paren)) {
|
|
diagnose(Loc, diag::attr_expected_rparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
DuplicateAttribute = Attributes.getAttribute<SetterAccessAttr>();
|
|
if (!DuplicateAttribute) {
|
|
Attributes.add(new (Context) SetterAccessAttr(AtLoc, AttrRange, access));
|
|
}
|
|
|
|
break;
|
|
}
|
|
|
|
case DAK_SPIAccessControl: {
|
|
if (!consumeIf(tok::l_paren)) {
|
|
diagnose(Loc, diag::attr_expected_lparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
SmallVector<Identifier, 4> spiGroups;
|
|
|
|
if (!Tok.is(tok::identifier) ||
|
|
Tok.isContextualKeyword("set")) {
|
|
diagnose(getEndOfPreviousLoc(), diag::attr_access_expected_spi_name);
|
|
consumeToken();
|
|
consumeIf(tok::r_paren);
|
|
return false;
|
|
}
|
|
|
|
auto text = Tok.getText();
|
|
spiGroups.push_back(Context.getIdentifier(text));
|
|
consumeToken();
|
|
|
|
AttrRange = SourceRange(Loc, Tok.getLoc());
|
|
|
|
if (!consumeIf(tok::r_paren)) {
|
|
diagnose(Loc, diag::attr_expected_rparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
Attributes.add(SPIAccessControlAttr::create(Context, AtLoc, AttrRange,
|
|
spiGroups));
|
|
break;
|
|
}
|
|
|
|
case DAK_CDecl:
|
|
case DAK_SILGenName: {
|
|
if (!consumeIf(tok::l_paren)) {
|
|
diagnose(Loc, diag::attr_expected_lparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
if (Tok.isNot(tok::string_literal)) {
|
|
diagnose(Loc, diag::attr_expected_string_literal, AttrName);
|
|
return false;
|
|
}
|
|
|
|
Optional<StringRef> AsmName = getStringLiteralIfNotInterpolated(
|
|
Loc, ("'" + AttrName + "'").str());
|
|
|
|
consumeToken(tok::string_literal);
|
|
|
|
if (AsmName.hasValue())
|
|
AttrRange = SourceRange(Loc, Tok.getRange().getStart());
|
|
else
|
|
DiscardAttribute = true;
|
|
|
|
if (!consumeIf(tok::r_paren)) {
|
|
diagnose(Loc, diag::attr_expected_rparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
// Diagnose using @_silgen_name in a local scope. These don't
|
|
// actually work.
|
|
if (CurDeclContext->isLocalContext()) {
|
|
// Emit an error, but do not discard the attribute. This enables
|
|
// better recovery in the parser.
|
|
diagnose(Loc, diag::attr_only_at_non_local_scope, AttrName);
|
|
}
|
|
|
|
if (!DiscardAttribute) {
|
|
if (DK == DAK_SILGenName)
|
|
Attributes.add(new (Context) SILGenNameAttr(AsmName.getValue(), AtLoc,
|
|
AttrRange, /*Implicit=*/false));
|
|
else if (DK == DAK_CDecl)
|
|
Attributes.add(new (Context) CDeclAttr(AsmName.getValue(), AtLoc,
|
|
AttrRange, /*Implicit=*/false));
|
|
else
|
|
llvm_unreachable("out of sync with switch");
|
|
}
|
|
|
|
break;
|
|
}
|
|
|
|
case DAK_Alignment: {
|
|
if (!consumeIf(tok::l_paren)) {
|
|
diagnose(Loc, diag::attr_expected_lparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
if (Tok.isNot(tok::integer_literal)) {
|
|
diagnose(Loc, diag::alignment_must_be_positive_integer);
|
|
return false;
|
|
}
|
|
|
|
StringRef alignmentText = Tok.getText();
|
|
unsigned alignmentValue;
|
|
if (alignmentText.getAsInteger(0, alignmentValue)) {
|
|
diagnose(Loc, diag::alignment_must_be_positive_integer);
|
|
return false;
|
|
}
|
|
|
|
consumeToken(tok::integer_literal);
|
|
|
|
auto range = SourceRange(Loc, Tok.getRange().getStart());
|
|
|
|
if (!consumeIf(tok::r_paren)) {
|
|
diagnose(Loc, diag::attr_expected_rparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
Attributes.add(new (Context) AlignmentAttr(alignmentValue, AtLoc, range,
|
|
/*implicit*/ false));
|
|
|
|
break;
|
|
}
|
|
|
|
case DAK_SwiftNativeObjCRuntimeBase: {
|
|
if (!consumeIf(tok::l_paren)) {
|
|
diagnose(Loc, diag::attr_expected_lparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
if (Tok.isNot(tok::identifier)) {
|
|
diagnose(Loc, diag::swift_native_objc_runtime_base_must_be_identifier);
|
|
return false;
|
|
}
|
|
|
|
Identifier name;
|
|
consumeIdentifier(name, /*diagnoseDollarPrefix=*/false);
|
|
|
|
auto range = SourceRange(Loc, Tok.getRange().getStart());
|
|
|
|
if (!consumeIf(tok::r_paren)) {
|
|
diagnose(Loc, diag::attr_expected_rparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
Attributes.add(new (Context) SwiftNativeObjCRuntimeBaseAttr(name,
|
|
AtLoc, range, /*implicit*/ false));
|
|
break;
|
|
}
|
|
|
|
case DAK_Semantics: {
|
|
if (!consumeIf(tok::l_paren)) {
|
|
diagnose(Loc, diag::attr_expected_lparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
if (Tok.isNot(tok::string_literal)) {
|
|
diagnose(Loc, diag::attr_expected_string_literal, AttrName);
|
|
return false;
|
|
}
|
|
|
|
auto Value = getStringLiteralIfNotInterpolated(
|
|
Loc, ("'" + AttrName + "'").str());
|
|
|
|
consumeToken(tok::string_literal);
|
|
|
|
if (Value.hasValue())
|
|
AttrRange = SourceRange(Loc, Tok.getRange().getStart());
|
|
else
|
|
DiscardAttribute = true;
|
|
|
|
if (!consumeIf(tok::r_paren)) {
|
|
diagnose(Loc, diag::attr_expected_rparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
if (!DiscardAttribute)
|
|
Attributes.add(new (Context) SemanticsAttr(Value.getValue(), AtLoc,
|
|
AttrRange,
|
|
/*Implicit=*/false));
|
|
break;
|
|
}
|
|
case DAK_OriginallyDefinedIn: {
|
|
auto LeftLoc = Tok.getLoc();
|
|
if (!consumeIf(tok::l_paren)) {
|
|
diagnose(Loc, diag::attr_expected_lparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
SourceLoc RightLoc;
|
|
enum class NextSegmentKind: uint8_t {
|
|
ModuleName = 0,
|
|
PlatformVersion,
|
|
};
|
|
NextSegmentKind NK = NextSegmentKind::ModuleName;
|
|
StringRef OriginalModuleName;
|
|
llvm::SmallVector<std::pair<PlatformKind, llvm::VersionTuple>, 4>
|
|
PlatformAndVersions;
|
|
|
|
StringRef AttrName = "@_originallyDefinedIn";
|
|
bool SuppressLaterDiags = false;
|
|
if (parseList(tok::r_paren, LeftLoc, RightLoc, false,
|
|
diag::originally_defined_in_missing_rparen,
|
|
SyntaxKind::AvailabilitySpecList, [&]() -> ParserStatus {
|
|
SWIFT_DEFER {
|
|
if (NK != NextSegmentKind::PlatformVersion) {
|
|
NK = (NextSegmentKind)((uint8_t)NK + (uint8_t)1);
|
|
}
|
|
};
|
|
switch (NK) {
|
|
// Parse 'module: "original_module_name"'.
|
|
case NextSegmentKind::ModuleName: {
|
|
SyntaxParsingContext argumentContext(SyntaxContext,
|
|
SyntaxKind::AvailabilityLabeledArgument);
|
|
// Parse 'module' ':'.
|
|
if (!Tok.is(tok::identifier) || Tok.getText() != "module" ||
|
|
!peekToken().is(tok::colon)) {
|
|
diagnose(Tok, diag::originally_defined_in_need_original_module_name);
|
|
SuppressLaterDiags = true;
|
|
return makeParserError();
|
|
}
|
|
consumeToken(tok::identifier);
|
|
consumeToken(tok::colon);
|
|
// Parse the next string literal as the original module name.
|
|
auto ModuleNameLoc = Tok.getLoc();
|
|
if (Tok.is(tok::string_literal)) {
|
|
auto NameOp = getStringLiteralIfNotInterpolated(Tok.getLoc(),
|
|
"original module name");
|
|
if (NameOp.hasValue())
|
|
OriginalModuleName = *NameOp;
|
|
consumeToken();
|
|
}
|
|
if (OriginalModuleName.empty()) {
|
|
diagnose(ModuleNameLoc,
|
|
diag::originally_defined_in_need_nonempty_module_name);
|
|
SuppressLaterDiags = true;
|
|
return makeParserError();
|
|
}
|
|
return makeParserSuccess();
|
|
}
|
|
// Parse 'OSX 13.13'.
|
|
case NextSegmentKind::PlatformVersion: {
|
|
SyntaxParsingContext argumentContext(SyntaxContext,
|
|
SyntaxKind::AvailabilityVersionRestriction);
|
|
if ((Tok.is(tok::identifier) || Tok.is(tok::oper_binary_spaced)) &&
|
|
(peekToken().isAny(tok::integer_literal, tok::floating_literal) ||
|
|
peekAvailabilityMacroName())) {
|
|
|
|
PlatformKind Platform;
|
|
|
|
if (peekAvailabilityMacroName()) {
|
|
// Handle availability macros first.
|
|
//
|
|
// The logic to search for macros and platform name could
|
|
// likely be handled by parseAvailabilitySpecList
|
|
// if we don't rely on parseList here.
|
|
SmallVector<AvailabilitySpec *, 4> Specs;
|
|
ParserStatus MacroStatus = parseAvailabilityMacro(Specs);
|
|
if (MacroStatus.isError())
|
|
return MacroStatus;
|
|
|
|
for (auto *Spec : Specs) {
|
|
if (auto *PlatformVersionSpec =
|
|
dyn_cast<PlatformVersionConstraintAvailabilitySpec>(Spec)) {
|
|
auto Platform = PlatformVersionSpec->getPlatform();
|
|
auto Version = PlatformVersionSpec->getVersion();
|
|
if (Version.getSubminor().hasValue() ||
|
|
Version.getBuild().hasValue()) {
|
|
diagnose(Tok.getLoc(), diag::originally_defined_in_major_minor_only);
|
|
}
|
|
PlatformAndVersions.emplace_back(Platform, Version);
|
|
|
|
} else if (auto *PlatformAgnostic =
|
|
dyn_cast<PlatformAgnosticVersionConstraintAvailabilitySpec>(Spec)) {
|
|
diagnose(PlatformAgnostic->getPlatformAgnosticNameLoc(),
|
|
PlatformAgnostic->isLanguageVersionSpecific() ?
|
|
diag::originally_defined_in_swift_version :
|
|
diag::originally_defined_in_package_description);
|
|
|
|
} else if (auto *OtherPlatform =
|
|
dyn_cast<OtherPlatformAvailabilitySpec>(Spec)) {
|
|
diagnose(OtherPlatform->getStarLoc(),
|
|
diag::originally_defined_in_missing_platform_name);
|
|
|
|
} else {
|
|
llvm_unreachable("Unexpected AvailabilitySpec kind.");
|
|
}
|
|
}
|
|
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
// Parse platform name.
|
|
auto Plat = platformFromString(Tok.getText());
|
|
if (!Plat.hasValue()) {
|
|
diagnose(Tok.getLoc(),
|
|
diag::originally_defined_in_unrecognized_platform);
|
|
SuppressLaterDiags = true;
|
|
return makeParserError();
|
|
} else {
|
|
consumeToken();
|
|
Platform = *Plat;
|
|
}
|
|
// Parse version number
|
|
llvm::VersionTuple VerTuple;
|
|
SourceRange VersionRange;
|
|
if (parseVersionTuple(VerTuple, VersionRange,
|
|
Diagnostic(diag::attr_availability_expected_version, AttrName))) {
|
|
SuppressLaterDiags = true;
|
|
return makeParserError();
|
|
} else {
|
|
if (VerTuple.getSubminor().hasValue() ||
|
|
VerTuple.getBuild().hasValue()) {
|
|
diagnose(Tok.getLoc(), diag::originally_defined_in_major_minor_only);
|
|
}
|
|
// * as platform name isn't supported.
|
|
if (Platform == PlatformKind::none) {
|
|
diagnose(AtLoc, diag::originally_defined_in_missing_platform_name);
|
|
} else {
|
|
PlatformAndVersions.emplace_back(Platform, VerTuple);
|
|
}
|
|
return makeParserSuccess();
|
|
}
|
|
}
|
|
diagnose(AtLoc, diag::originally_defined_in_need_platform_version);
|
|
SuppressLaterDiags = true;
|
|
return makeParserError();
|
|
}
|
|
}
|
|
llvm_unreachable("invalid next segment kind");
|
|
}).isErrorOrHasCompletion() || SuppressLaterDiags) {
|
|
return false;
|
|
}
|
|
if (OriginalModuleName.empty()) {
|
|
diagnose(AtLoc, diag::originally_defined_in_need_nonempty_module_name);
|
|
return false;
|
|
}
|
|
if (PlatformAndVersions.empty()) {
|
|
diagnose(AtLoc, diag::originally_defined_in_need_platform_version);
|
|
return false;
|
|
}
|
|
|
|
assert(!OriginalModuleName.empty());
|
|
assert(!PlatformAndVersions.empty());
|
|
assert(NK == NextSegmentKind::PlatformVersion);
|
|
AttrRange = SourceRange(Loc, Tok.getLoc());
|
|
for (auto &Item: PlatformAndVersions) {
|
|
Attributes.add(new (Context) OriginallyDefinedInAttr(AtLoc, AttrRange,
|
|
OriginalModuleName,
|
|
Item.first,
|
|
Item.second,
|
|
/*IsImplicit*/false));
|
|
}
|
|
break;
|
|
}
|
|
case DAK_Available: {
|
|
if (!consumeIf(tok::l_paren)) {
|
|
diagnose(Loc, diag::attr_expected_lparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
if (!parseAvailability(false, AttrName, DiscardAttribute, AttrRange, AtLoc,
|
|
Loc,
|
|
[&](AvailableAttr *attr) { Attributes.add(attr); }))
|
|
return false;
|
|
break;
|
|
}
|
|
case DAK_PrivateImport: {
|
|
// Parse the leading '('.
|
|
if (Tok.isNot(tok::l_paren)) {
|
|
diagnose(Loc, diag::attr_expected_lparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
SourceLoc LParenLoc = consumeToken(tok::l_paren);
|
|
Optional<StringRef> filename;
|
|
{
|
|
SyntaxParsingContext ContentContext(
|
|
SyntaxContext, SyntaxKind::NamedAttributeStringArgument);
|
|
|
|
// Parse 'sourceFile'.
|
|
if (Tok.getText() != "sourceFile") {
|
|
diagnose(LParenLoc, diag::attr_private_import_expected_sourcefile);
|
|
return false;
|
|
}
|
|
auto ForLoc = consumeToken();
|
|
|
|
// Parse ':'.
|
|
if (Tok.getKind() != tok::colon) {
|
|
diagnose(ForLoc, diag::attr_private_import_expected_colon);
|
|
return false;
|
|
}
|
|
auto ColonLoc = consumeToken(tok::colon);
|
|
|
|
// Parse '"'function-name'"'
|
|
if (Tok.isNot(tok::string_literal)) {
|
|
diagnose(ColonLoc, diag::attr_private_import_expected_sourcefile_name);
|
|
return false;
|
|
}
|
|
filename = getStringLiteralIfNotInterpolated(Loc, "_private");
|
|
if (!filename.hasValue()) {
|
|
diagnose(ColonLoc, diag::attr_private_import_expected_sourcefile_name);
|
|
return false;
|
|
}
|
|
consumeToken(tok::string_literal);
|
|
}
|
|
// Parse the matching ')'.
|
|
SourceLoc RParenLoc;
|
|
bool Invalid = parseMatchingToken(tok::r_paren, RParenLoc,
|
|
diag::attr_private_import_expected_rparen,
|
|
LParenLoc);
|
|
if (Invalid)
|
|
return false;
|
|
auto *attr = PrivateImportAttr::create(Context, AtLoc, Loc, LParenLoc,
|
|
*filename, RParenLoc);
|
|
Attributes.add(attr);
|
|
|
|
break;
|
|
}
|
|
case DAK_ObjC: {
|
|
// Unnamed @objc attribute.
|
|
if (Tok.isNot(tok::l_paren)) {
|
|
auto attr = ObjCAttr::createUnnamed(Context, AtLoc, Loc);
|
|
Attributes.add(attr);
|
|
break;
|
|
}
|
|
|
|
// Parse the leading '('.
|
|
SourceLoc LParenLoc = consumeToken(tok::l_paren);
|
|
|
|
// Parse the names, with trailing colons (if there are present) and populate
|
|
// the inout parameters
|
|
SmallVector<Identifier, 4> Names;
|
|
SmallVector<SourceLoc, 4> NameLocs;
|
|
bool NullarySelector = true;
|
|
parseObjCSelector(Names, NameLocs, NullarySelector);
|
|
|
|
// Parse the matching ')'.
|
|
SourceLoc RParenLoc;
|
|
bool Invalid = parseMatchingToken(tok::r_paren, RParenLoc,
|
|
diag::attr_objc_expected_rparen,
|
|
LParenLoc);
|
|
|
|
ObjCAttr *attr;
|
|
if (Names.empty()) {
|
|
// When there are no names, recover as if there were no parentheses.
|
|
if (!Invalid)
|
|
diagnose(LParenLoc, diag::attr_objc_empty_name);
|
|
attr = ObjCAttr::createUnnamed(Context, AtLoc, Loc);
|
|
} else if (NullarySelector) {
|
|
// When we didn't see a colon, this is a nullary name.
|
|
assert(Names.size() == 1 && "Forgot to set sawColon?");
|
|
attr = ObjCAttr::createNullary(Context, AtLoc, Loc, LParenLoc,
|
|
NameLocs.front(), Names.front(),
|
|
RParenLoc);
|
|
} else {
|
|
// When we did see a colon, this is a selector.
|
|
attr = ObjCAttr::createSelector(Context, AtLoc, Loc, LParenLoc,
|
|
NameLocs, Names, RParenLoc);
|
|
}
|
|
Attributes.add(attr);
|
|
break;
|
|
}
|
|
case DAK_ObjCRuntimeName: {
|
|
if (!consumeIf(tok::l_paren)) {
|
|
diagnose(Loc, diag::attr_expected_lparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
if (Tok.isNot(tok::identifier)) {
|
|
diagnose(Loc, diag::objc_runtime_name_must_be_identifier);
|
|
return false;
|
|
}
|
|
|
|
auto name = Tok.getText();
|
|
|
|
consumeToken(tok::identifier);
|
|
|
|
auto range = SourceRange(Loc, Tok.getRange().getStart());
|
|
|
|
if (!consumeIf(tok::r_paren)) {
|
|
diagnose(Loc, diag::attr_expected_rparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
Attributes.add(new (Context) ObjCRuntimeNameAttr(name, AtLoc, range,
|
|
/*implicit*/ false));
|
|
break;
|
|
}
|
|
|
|
|
|
case DAK_DynamicReplacement: {
|
|
// Parse the leading '('.
|
|
if (Tok.isNot(tok::l_paren)) {
|
|
diagnose(Loc, diag::attr_expected_lparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
SourceLoc LParenLoc = consumeToken(tok::l_paren);
|
|
DeclNameRef replacedFunction;
|
|
{
|
|
SyntaxParsingContext ContentContext(
|
|
SyntaxContext, SyntaxKind::NamedAttributeStringArgument);
|
|
|
|
// Parse 'for'.
|
|
if (Tok.getText() != "for") {
|
|
diagnose(Loc, diag::attr_dynamic_replacement_expected_for);
|
|
return false;
|
|
}
|
|
auto ForLoc = consumeToken();
|
|
|
|
// Parse ':'.
|
|
if (Tok.getText() != ":") {
|
|
diagnose(ForLoc, diag::attr_dynamic_replacement_expected_colon);
|
|
return false;
|
|
}
|
|
consumeToken(tok::colon);
|
|
{
|
|
SyntaxParsingContext ContentContext(SyntaxContext,
|
|
SyntaxKind::DeclName);
|
|
|
|
DeclNameLoc loc;
|
|
replacedFunction = parseDeclNameRef(loc,
|
|
diag::attr_dynamic_replacement_expected_function,
|
|
DeclNameFlag::AllowZeroArgCompoundNames |
|
|
DeclNameFlag::AllowKeywordsUsingSpecialNames |
|
|
DeclNameFlag::AllowOperators);
|
|
}
|
|
}
|
|
|
|
// Parse the matching ')'.
|
|
SourceLoc RParenLoc;
|
|
bool Invalid = parseMatchingToken(
|
|
tok::r_paren, RParenLoc, diag::attr_dynamic_replacement_expected_rparen,
|
|
LParenLoc);
|
|
if (Invalid) {
|
|
return false;
|
|
}
|
|
|
|
|
|
DynamicReplacementAttr *attr = DynamicReplacementAttr::create(
|
|
Context, AtLoc, Loc, LParenLoc, replacedFunction, RParenLoc);
|
|
Attributes.add(attr);
|
|
break;
|
|
}
|
|
|
|
case DAK_TypeEraser: {
|
|
// Parse leading '('
|
|
if (Tok.isNot(tok::l_paren)) {
|
|
diagnose(Loc, diag::attr_expected_lparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
SourceLoc LParenLoc = consumeToken(tok::l_paren);
|
|
ParserResult<TypeRepr> ErasedType;
|
|
bool invalid = false;
|
|
{
|
|
// Parse type-eraser type
|
|
SyntaxParsingContext ContentContext(SyntaxContext, SyntaxKind::Type);
|
|
ErasedType = parseType(diag::attr_type_eraser_expected_type_name);
|
|
invalid = ErasedType.hasCodeCompletion() || ErasedType.isNull();
|
|
}
|
|
|
|
// Parse matching ')'
|
|
SourceLoc RParenLoc;
|
|
invalid |= parseMatchingToken(tok::r_paren, RParenLoc,
|
|
diag::attr_type_eraser_expected_rparen,
|
|
LParenLoc);
|
|
if (invalid)
|
|
return false;
|
|
|
|
auto *TE = new (Context) TypeExpr(ErasedType.get());
|
|
Attributes.add(TypeEraserAttr::create(Context, AtLoc, {Loc, RParenLoc}, TE));
|
|
break;
|
|
}
|
|
|
|
case DAK_Specialize: {
|
|
if (Tok.isNot(tok::l_paren)) {
|
|
diagnose(Loc, diag::attr_expected_lparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
SpecializeAttr *Attr;
|
|
if (!parseSpecializeAttribute(tok::r_paren, AtLoc, Loc, Attr, nullptr))
|
|
return false;
|
|
|
|
Attributes.add(Attr);
|
|
break;
|
|
}
|
|
|
|
case DAK_Implements: {
|
|
ParserResult<ImplementsAttr> Attr = parseImplementsAttribute(AtLoc, Loc);
|
|
if (Attr.isNonNull()) {
|
|
Attributes.add(Attr.get());
|
|
}
|
|
break;
|
|
}
|
|
|
|
case DAK_Differentiable: {
|
|
auto Attr = parseDifferentiableAttribute(AtLoc, Loc);
|
|
if (Attr.isNonNull())
|
|
Attributes.add(Attr.get());
|
|
break;
|
|
}
|
|
|
|
case DAK_Derivative: {
|
|
// `@derivative` in a local scope is not allowed.
|
|
if (CurDeclContext->isLocalContext())
|
|
diagnose(Loc, diag::attr_only_at_non_local_scope, '@' + AttrName.str());
|
|
|
|
auto Attr = parseDerivativeAttribute(AtLoc, Loc);
|
|
if (Attr.isNonNull())
|
|
Attributes.add(Attr.get());
|
|
break;
|
|
}
|
|
|
|
case DAK_Transpose: {
|
|
// `@transpose` in a local scope is not allowed.
|
|
if (CurDeclContext->isLocalContext())
|
|
diagnose(Loc, diag::attr_only_at_non_local_scope, '@' + AttrName.str());
|
|
|
|
auto Attr = parseTransposeAttribute(AtLoc, Loc);
|
|
if (Attr.isNonNull())
|
|
Attributes.add(Attr.get());
|
|
break;
|
|
}
|
|
|
|
case DAK_ProjectedValueProperty: {
|
|
if (!consumeIf(tok::l_paren)) {
|
|
diagnose(Loc, diag::attr_expected_lparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
if (Tok.isNot(tok::identifier)) {
|
|
diagnose(Loc, diag::projection_value_property_not_identifier);
|
|
return false;
|
|
}
|
|
|
|
Identifier name;
|
|
consumeIdentifier(name, /*diagnoseDollarPrefix=*/false);
|
|
|
|
auto range = SourceRange(Loc, Tok.getRange().getStart());
|
|
|
|
if (!consumeIf(tok::r_paren)) {
|
|
diagnose(Loc, diag::attr_expected_rparen, AttrName,
|
|
DeclAttribute::isDeclModifier(DK));
|
|
return false;
|
|
}
|
|
|
|
Attributes.add(new (Context) ProjectedValuePropertyAttr(
|
|
name, AtLoc, range, /*implicit*/ false));
|
|
break;
|
|
}
|
|
case DAK_TypeSequence: {
|
|
auto range = SourceRange(Loc, Tok.getRange().getStart());
|
|
Attributes.add(TypeSequenceAttr::create(Context, AtLoc, range));
|
|
break;
|
|
}
|
|
|
|
case DAK_UnavailableFromAsync: {
|
|
StringRef message;
|
|
if (consumeIf(tok::l_paren)) {
|
|
if (!Tok.is(tok::identifier)) {
|
|
llvm_unreachable("Flag must start with an indentifier");
|
|
}
|
|
|
|
StringRef flag = Tok.getText();
|
|
|
|
if (flag != "message") {
|
|
diagnose(Tok.getLoc(), diag::attr_unknown_option, flag, AttrName);
|
|
return true;
|
|
}
|
|
consumeToken();
|
|
if (!consumeIf(tok::colon)) {
|
|
if (!Tok.is(tok::equal)) {
|
|
diagnose(Tok.getLoc(), diag::attr_expected_colon_after_label, flag);
|
|
return false;
|
|
}
|
|
diagnose(Tok.getLoc(), diag::replace_equal_with_colon_for_value)
|
|
.fixItReplace(Tok.getLoc(), ": ");
|
|
consumeToken();
|
|
}
|
|
if (!Tok.is(tok::string_literal)) {
|
|
diagnose(Tok.getLoc(), diag::attr_expected_string_literal, AttrName);
|
|
return false;
|
|
}
|
|
|
|
Optional<StringRef> value = getStringLiteralIfNotInterpolated(
|
|
Tok.getLoc(), flag);
|
|
if (!value)
|
|
return false;
|
|
Token stringTok = Tok;
|
|
consumeToken();
|
|
message = *value;
|
|
|
|
if (!consumeIf(tok::r_paren))
|
|
diagnose(stringTok.getRange().getEnd(), diag::attr_expected_rparen,
|
|
AttrName, /*isModifiler*/false)
|
|
.fixItInsertAfter(stringTok.getLoc(), ")");
|
|
}
|
|
|
|
Attributes.add(new (Context) UnavailableFromAsyncAttr(
|
|
message, AtLoc, SourceRange(Loc, Tok.getLoc()), false));
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (DuplicateAttribute) {
|
|
diagnose(Loc, diag::duplicate_attribute, DeclAttribute::isDeclModifier(DK))
|
|
.highlight(AttrRange);
|
|
diagnose(DuplicateAttribute->getLocation(),
|
|
diag::previous_attribute,
|
|
DeclAttribute::isDeclModifier(DK))
|
|
.highlight(DuplicateAttribute->getRange());
|
|
}
|
|
|
|
// If this is a decl modifier spelled with an @, emit an error and remove it
|
|
// with a fixit.
|
|
if (AtLoc.isValid() && DeclAttribute::isDeclModifier(DK))
|
|
diagnose(AtLoc, diag::cskeyword_not_attribute, AttrName).fixItRemove(AtLoc);
|
|
|
|
return false;
|
|
}
|
|
|
|
bool Parser::parseVersionTuple(llvm::VersionTuple &Version,
|
|
SourceRange &Range,
|
|
const Diagnostic &D) {
|
|
SyntaxParsingContext VersionContext(SyntaxContext, SyntaxKind::VersionTuple);
|
|
// A version number is either an integer (8), a float (8.1), or a
|
|
// float followed by a dot and an integer (8.1.0).
|
|
if (!Tok.isAny(tok::integer_literal, tok::floating_literal)) {
|
|
diagnose(Tok, D);
|
|
return true;
|
|
}
|
|
|
|
SourceLoc StartLoc = Tok.getLoc();
|
|
|
|
if (Tok.is(tok::integer_literal)) {
|
|
unsigned major = 0;
|
|
if (Tok.getText().getAsInteger(10, major)) {
|
|
// Maybe the literal was in hex. Reject that.
|
|
diagnose(Tok, D);
|
|
consumeToken();
|
|
return true;
|
|
}
|
|
Version = llvm::VersionTuple(major);
|
|
Range = SourceRange(StartLoc, Tok.getLoc());
|
|
consumeToken();
|
|
return false;
|
|
}
|
|
|
|
unsigned major = 0, minor = 0;
|
|
StringRef majorPart, minorPart;
|
|
std::tie(majorPart, minorPart) = Tok.getText().split('.');
|
|
if (majorPart.getAsInteger(10, major) || minorPart.getAsInteger(10, minor)) {
|
|
// Reject things like 0.1e5 and hex literals.
|
|
diagnose(Tok, D);
|
|
consumeToken();
|
|
return true;
|
|
}
|
|
|
|
Range = SourceRange(StartLoc, Tok.getLoc());
|
|
consumeToken();
|
|
|
|
if (consumeIf(tok::period)) {
|
|
unsigned micro = 0;
|
|
if (!Tok.is(tok::integer_literal) ||
|
|
Tok.getText().getAsInteger(10, micro)) {
|
|
// Reject things like 0.1e5 and hex literals.
|
|
diagnose(Tok, D);
|
|
if (Tok.is(tok::integer_literal) ||
|
|
peekToken().isAny(tok::r_paren, tok::comma))
|
|
consumeToken();
|
|
return true;
|
|
}
|
|
|
|
Range = SourceRange(StartLoc, Tok.getLoc());
|
|
consumeToken();
|
|
|
|
Version = llvm::VersionTuple(major, minor, micro);
|
|
} else {
|
|
Version = llvm::VersionTuple(major, minor);
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
/// Check whether the attributes have already established an initializer
|
|
/// context within the given set of attributes.
|
|
static PatternBindingInitializer *findAttributeInitContent(
|
|
DeclAttributes &Attributes) {
|
|
for (auto custom : Attributes.getAttributes<CustomAttr>()) {
|
|
if (auto initContext = custom->getInitContext())
|
|
return initContext;
|
|
}
|
|
|
|
return nullptr;
|
|
}
|
|
|
|
bool Parser::isCustomAttributeArgument() {
|
|
BacktrackingScope backtrack(*this);
|
|
if (skipSingle().hasCodeCompletion())
|
|
return true;
|
|
|
|
// If we have any keyword, identifier, or token that follows a function
|
|
// type's parameter list, this is a parameter list and not an attribute.
|
|
// Alternatively, we might have a token that illustrates we're not going to
|
|
// get anything following the attribute, which means the parentheses describe
|
|
// what follows the attribute.
|
|
return !Tok.isAny(
|
|
tok::arrow, tok::kw_throw, tok::kw_throws, tok::kw_rethrows,
|
|
tok::r_paren, tok::r_brace, tok::r_square, tok::r_angle) &&
|
|
!Tok.isContextualKeyword("async") && !Tok.isContextualKeyword("reasync") ;
|
|
}
|
|
|
|
bool Parser::canParseCustomAttribute() {
|
|
if (!canParseType())
|
|
return false;
|
|
|
|
if (Tok.isFollowingLParen() && isCustomAttributeArgument())
|
|
skipSingle();
|
|
|
|
return true;
|
|
}
|
|
|
|
ParserResult<CustomAttr> Parser::parseCustomAttribute(
|
|
SourceLoc atLoc, PatternBindingInitializer *&initContext) {
|
|
assert(Tok.is(tok::identifier));
|
|
SyntaxContext->setCreateSyntax(SyntaxKind::CustomAttribute);
|
|
|
|
// Parse a custom attribute.
|
|
auto type = parseType(diag::expected_type, ParseTypeReason::CustomAttribute);
|
|
if (type.hasCodeCompletion() || type.isNull()) {
|
|
if (Tok.is(tok::l_paren) && isCustomAttributeArgument())
|
|
skipSingle();
|
|
|
|
return ParserResult<CustomAttr>(ParserStatus(type));
|
|
}
|
|
|
|
// If we're not in a local context, we'll need a context to parse
|
|
// initializers into (should we have one). This happens for properties
|
|
// and global variables in libraries.
|
|
ParserStatus status;
|
|
ArgumentList *argList = nullptr;
|
|
if (Tok.isFollowingLParen() && isCustomAttributeArgument()) {
|
|
if (peekToken().is(tok::code_complete)) {
|
|
consumeToken(tok::l_paren);
|
|
if (CodeCompletion) {
|
|
auto typeE = new (Context) TypeExpr(type.get());
|
|
auto CCE = new (Context) CodeCompletionExpr(Tok.getLoc());
|
|
CodeCompletion->completePostfixExprParen(typeE, CCE);
|
|
}
|
|
consumeToken(tok::code_complete);
|
|
skipUntil(tok::r_paren);
|
|
consumeIf(tok::r_paren);
|
|
status.setHasCodeCompletionAndIsError();
|
|
} else {
|
|
// If we have no local context to parse the initial value into, create
|
|
// one for the PBD we'll eventually create. This allows us to have
|
|
// reasonable DeclContexts for any closures that may live inside of
|
|
// initializers.
|
|
Optional<ParseFunctionBody> initParser;
|
|
if (!CurDeclContext->isLocalContext()) {
|
|
if (!initContext) {
|
|
initContext =
|
|
new (Context) PatternBindingInitializer(CurDeclContext);
|
|
}
|
|
|
|
initParser.emplace(*this, initContext);
|
|
}
|
|
auto result = parseArgumentList(tok::l_paren, tok::r_paren,
|
|
/*isExprBasic*/ true,
|
|
/*allowTrailingClosure*/ false);
|
|
status |= result;
|
|
argList = result.get();
|
|
assert(!argList->hasAnyTrailingClosures() &&
|
|
"Cannot parse a trailing closure here");
|
|
}
|
|
}
|
|
|
|
// Form the attribute.
|
|
auto *TE = new (Context) TypeExpr(type.get());
|
|
auto *customAttr = CustomAttr::create(Context, atLoc, TE, initContext,
|
|
argList);
|
|
return makeParserResult(status, customAttr);
|
|
}
|
|
|
|
/// \verbatim
|
|
/// attribute:
|
|
/// '_silgen_name' '(' identifier ')'
|
|
/// 'semantics' '(' identifier ')'
|
|
/// 'infix' '=' numeric_constant
|
|
/// 'unary'
|
|
/// 'stdlib'
|
|
/// 'weak'
|
|
/// 'inout'
|
|
/// 'unowned'
|
|
/// 'unowned' '(' 'safe' ')'
|
|
/// 'unowned' '(' 'unsafe' ')'
|
|
/// 'noreturn'
|
|
/// 'optional'
|
|
/// 'mutating'
|
|
/// ( 'private' | 'internal' | 'public' )
|
|
/// ( 'private' | 'internal' | 'public' ) '(' 'set' ')'
|
|
/// 'requires_stored_property_inits'
|
|
/// \endverbatim
|
|
///
|
|
/// Note that various attributes (like mutating, weak, and unowned) are parsed
|
|
/// but rejected since they have context-sensitive keywords.
|
|
///
|
|
ParserStatus Parser::parseDeclAttribute(
|
|
DeclAttributes &Attributes, SourceLoc AtLoc,
|
|
PatternBindingInitializer *&initContext,
|
|
bool isFromClangAttribute) {
|
|
// If this not an identifier, the attribute is malformed.
|
|
if (Tok.isNot(tok::identifier) &&
|
|
Tok.isNot(tok::kw_in) &&
|
|
Tok.isNot(tok::kw_inout) &&
|
|
Tok.isNot(tok::kw_rethrows)) {
|
|
|
|
if (Tok.is(tok::code_complete)) {
|
|
if (CodeCompletion) {
|
|
// If the next token is not on the same line, this attribute might be
|
|
// starting new declaration instead of adding attribute to existing
|
|
// decl.
|
|
auto isIndependent = peekToken().isAtStartOfLine();
|
|
CodeCompletion->completeDeclAttrBeginning(isInSILMode(), isIndependent);
|
|
}
|
|
consumeToken(tok::code_complete);
|
|
return makeParserCodeCompletionStatus();
|
|
}
|
|
|
|
diagnose(Tok, diag::expected_attribute_name);
|
|
return makeParserError();
|
|
}
|
|
|
|
// If the attribute follows the new representation, switch
|
|
// over to the alternate parsing path.
|
|
DeclAttrKind DK = DeclAttribute::getAttrKindFromString(Tok.getText());
|
|
if (DK == DAK_Rethrows) { DK = DAK_AtRethrows; }
|
|
if (DK == DAK_Reasync) { DK = DAK_AtReasync; }
|
|
|
|
auto checkInvalidAttrName = [&](StringRef invalidName,
|
|
StringRef correctName,
|
|
DeclAttrKind kind,
|
|
Optional<Diag<StringRef, StringRef>> diag = None) {
|
|
if (DK == DAK_Count && Tok.getText() == invalidName) {
|
|
DK = kind;
|
|
|
|
if (diag) {
|
|
diagnose(Tok, *diag, invalidName, correctName)
|
|
.fixItReplace(Tok.getLoc(), correctName);
|
|
}
|
|
}
|
|
};
|
|
|
|
// Check if attr is availability, and suggest available instead
|
|
checkInvalidAttrName("availability", "available", DAK_Available, diag::attr_renamed);
|
|
|
|
// Check if attr is inlineable, and suggest inlinable instead
|
|
checkInvalidAttrName("inlineable", "inlinable", DAK_Inlinable, diag::attr_name_close_match);
|
|
|
|
// In Swift 5 and above, these become hard errors. In Swift 4.2, emit a
|
|
// warning for compatibility. Otherwise, don't diagnose at all.
|
|
if (Context.isSwiftVersionAtLeast(5)) {
|
|
checkInvalidAttrName("_versioned", "usableFromInline", DAK_UsableFromInline, diag::attr_renamed);
|
|
checkInvalidAttrName("_inlineable", "inlinable", DAK_Inlinable, diag::attr_renamed);
|
|
} else if (Context.isSwiftVersionAtLeast(4, 2)) {
|
|
checkInvalidAttrName("_versioned", "usableFromInline", DAK_UsableFromInline, diag::attr_renamed_warning);
|
|
checkInvalidAttrName("_inlineable", "inlinable", DAK_Inlinable, diag::attr_renamed_warning);
|
|
} else {
|
|
checkInvalidAttrName("_versioned", "usableFromInline", DAK_UsableFromInline);
|
|
checkInvalidAttrName("_inlineable", "inlinable", DAK_Inlinable);
|
|
}
|
|
|
|
// Other names of property wrappers...
|
|
checkInvalidAttrName("propertyDelegate", "propertyWrapper",
|
|
DAK_PropertyWrapper, diag::attr_renamed_warning);
|
|
checkInvalidAttrName("_propertyWrapper", "propertyWrapper",
|
|
DAK_PropertyWrapper, diag::attr_renamed_warning);
|
|
|
|
// Historical name for result builders.
|
|
checkInvalidAttrName(
|
|
"_functionBuilder", "resultBuilder", DAK_ResultBuilder,
|
|
diag::attr_renamed_warning);
|
|
|
|
// Historical name for @Sendable.
|
|
checkInvalidAttrName(
|
|
"concurrent", "Sendable", DAK_Sendable, diag::attr_renamed_warning);
|
|
|
|
// Historical name for 'nonisolated'.
|
|
if (DK == DAK_Count && Tok.getText() == "actorIndependent") {
|
|
diagnose(
|
|
Tok, diag::attr_renamed_to_modifier_warning, "actorIndependent",
|
|
"nonisolated")
|
|
.fixItReplace(SourceRange(AtLoc, Tok.getLoc()), "nonisolated");
|
|
DK = DAK_Nonisolated;
|
|
AtLoc = SourceLoc();
|
|
}
|
|
|
|
if (DK == DAK_Count && Tok.getText() == "warn_unused_result") {
|
|
// The behavior created by @warn_unused_result is now the default. Emit a
|
|
// Fix-It to remove.
|
|
SourceLoc attrLoc = consumeToken();
|
|
|
|
// @warn_unused_result with no arguments.
|
|
if (Tok.isNot(tok::l_paren)) {
|
|
diagnose(AtLoc, diag::attr_warn_unused_result_removed)
|
|
.fixItRemove(SourceRange(AtLoc, attrLoc));
|
|
|
|
// Recovered.
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
// @warn_unused_result with arguments.
|
|
SourceLoc lParenLoc = consumeToken();
|
|
skipUntil(tok::r_paren);
|
|
|
|
// Parse the closing ')'.
|
|
SourceLoc rParenLoc;
|
|
if (Tok.isNot(tok::r_paren)) {
|
|
parseMatchingToken(tok::r_paren, rParenLoc,
|
|
diag::attr_warn_unused_result_expected_rparen,
|
|
lParenLoc);
|
|
}
|
|
if (Tok.is(tok::r_paren)) {
|
|
rParenLoc = consumeToken();
|
|
}
|
|
|
|
diagnose(AtLoc, diag::attr_warn_unused_result_removed)
|
|
.fixItRemove(SourceRange(AtLoc, rParenLoc));
|
|
|
|
// Recovered.
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
// @_unsafeSendable and @_unsafeMainActor have been removed; warn about them.
|
|
if (DK == DAK_Count &&
|
|
(Tok.getText() == "_unsafeSendable" ||
|
|
Tok.getText() == "_unsafeMainActor")) {
|
|
StringRef attrName = Tok.getText();
|
|
SourceLoc attrLoc = consumeToken();
|
|
diagnose(AtLoc, diag::warn_attr_unsafe_removed, attrName)
|
|
.fixItRemove(SourceRange(AtLoc, attrLoc));
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
if (DK != DAK_Count && !DeclAttribute::shouldBeRejectedByParser(DK)) {
|
|
parseNewDeclAttribute(Attributes, AtLoc, DK, isFromClangAttribute);
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
if (TypeAttributes::getAttrKindFromString(Tok.getText()) != TAK_Count)
|
|
diagnose(Tok, diag::type_attribute_applied_to_decl);
|
|
else if (Tok.isContextualKeyword("unknown")) {
|
|
diagnose(Tok, diag::unknown_attribute, "unknown");
|
|
} else {
|
|
// Change the context to create a custom attribute syntax.
|
|
auto customAttr = parseCustomAttribute(AtLoc, initContext);
|
|
if (auto attr = customAttr.getPtrOrNull())
|
|
Attributes.add(attr);
|
|
|
|
return ParserStatus(customAttr);
|
|
}
|
|
|
|
// Recover by eating @foo(...) when foo is not known.
|
|
consumeToken();
|
|
if (Tok.is(tok::l_paren))
|
|
skipSingle();
|
|
|
|
return makeParserError();
|
|
}
|
|
|
|
bool Parser::canParseTypeAttribute() {
|
|
TypeAttributes attrs; // ignored
|
|
PatternBindingInitializer *initContext = nullptr;
|
|
return !parseTypeAttribute(attrs, /*atLoc=*/SourceLoc(), initContext,
|
|
/*justChecking*/ true).isError();
|
|
}
|
|
|
|
/// Parses the '@differentiable' type attribute argument (no argument list,
|
|
/// '(_forward)', '(reverse)', or '(_linear)') and sets the
|
|
/// `differentiabilityKind` field on `Attributes`.
|
|
///
|
|
/// \param emitDiagnostics - if false, doesn't emit diagnostics
|
|
/// \returns true on error, false on success
|
|
static bool parseDifferentiableTypeAttributeArgument(
|
|
Parser &P, TypeAttributes &Attributes, bool emitDiagnostics) {
|
|
Parser::CancellableBacktrackingScope backtrack(P);
|
|
|
|
// Match '( <identifier> )', and store the identifier token to `argument`.
|
|
if (!P.consumeIf(tok::l_paren))
|
|
return false;
|
|
auto argument = P.Tok;
|
|
if (!P.consumeIf(tok::identifier))
|
|
return false;
|
|
if (!P.consumeIf(tok::r_paren)) {
|
|
// Special case handling for '( <identifier> (' so that we don't produce the
|
|
// misleading diagnostic "expected ',' separator" when the real issue is
|
|
// that the user forgot the ')' closing the '@differentiable' argument list.
|
|
if (P.Tok.is(tok::l_paren)) {
|
|
backtrack.cancelBacktrack();
|
|
if (emitDiagnostics)
|
|
P.diagnose(P.Tok, diag::attr_expected_rparen, "@differentiable",
|
|
/*DeclModifier*/ false);
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
// If the next token is not a `(`, `@`, or an identifier, then the
|
|
// matched '( <identifier> )' is actually the parameter type list,
|
|
// not an argument to '@differentiable'.
|
|
if (P.Tok.isNot(tok::l_paren, tok::at_sign, tok::identifier))
|
|
return false;
|
|
|
|
backtrack.cancelBacktrack();
|
|
|
|
auto diffKind =
|
|
llvm::StringSwitch<DifferentiabilityKind>(argument.getText())
|
|
.Case("reverse", DifferentiabilityKind::Reverse)
|
|
.Case("_forward", DifferentiabilityKind::Forward)
|
|
.Case("_linear", DifferentiabilityKind::Linear)
|
|
.Default(DifferentiabilityKind::NonDifferentiable);
|
|
|
|
if (diffKind == DifferentiabilityKind::NonDifferentiable) {
|
|
P.diagnose(argument, diag::attr_differentiable_unknown_kind,
|
|
argument.getText())
|
|
.fixItReplaceChars(argument.getRange().getStart(),
|
|
argument.getRange().getEnd(), "reverse");
|
|
return true;
|
|
}
|
|
|
|
// Only 'reverse' is formally supported today. '_linear' works for testing
|
|
// purposes. '_forward' is rejected.
|
|
if (diffKind == DifferentiabilityKind::Forward) {
|
|
if (emitDiagnostics)
|
|
P.diagnose(argument, diag::attr_differentiable_kind_not_supported,
|
|
argument.getText())
|
|
.fixItReplaceChars(argument.getRange().getStart(),
|
|
argument.getRange().getEnd(), "reverse");
|
|
|
|
return true;
|
|
}
|
|
|
|
Attributes.differentiabilityKind = diffKind;
|
|
return false;
|
|
}
|
|
|
|
/// Parse the inside of a convention attribute '(...)'.
|
|
///
|
|
/// The '@convention' prefix should've been parsed by the caller.
|
|
/// See `Parser::parseTypeAttribute` for the justChecking argument.
|
|
///
|
|
/// Returns true if there was an error.
|
|
bool Parser::parseConventionAttributeInternal(
|
|
bool justChecking, TypeAttributes::Convention &convention) {
|
|
SourceLoc LPLoc;
|
|
if (!consumeIfNotAtStartOfLine(tok::l_paren)) {
|
|
if (!justChecking)
|
|
diagnose(Tok, diag::convention_attribute_expected_lparen);
|
|
return true;
|
|
}
|
|
|
|
if (Tok.isNot(tok::identifier)) {
|
|
if (!justChecking)
|
|
diagnose(Tok, diag::convention_attribute_expected_name);
|
|
return true;
|
|
}
|
|
|
|
convention.Name = Tok.getText();
|
|
consumeToken(tok::identifier);
|
|
|
|
// Consume extra (optional) ', cType: " blah blah "'
|
|
if (consumeIf(tok::comma)) {
|
|
if (Tok.isNot(tok::identifier)) {
|
|
if (!justChecking)
|
|
diagnose(Tok, diag::convention_attribute_ctype_expected_label);
|
|
return true;
|
|
}
|
|
auto cTypeLabel = Tok.getText();
|
|
consumeToken(tok::identifier);
|
|
if (cTypeLabel != "cType") {
|
|
if (!justChecking)
|
|
diagnose(Tok, diag::convention_attribute_ctype_expected_label);
|
|
return true;
|
|
}
|
|
if (!consumeIf(tok::colon)) {
|
|
if (!justChecking)
|
|
diagnose(Tok, diag::convention_attribute_ctype_expected_colon);
|
|
return true;
|
|
}
|
|
if (Tok.isNot(tok::string_literal)) {
|
|
if (!justChecking)
|
|
diagnose(Tok, diag::convention_attribute_ctype_expected_string);
|
|
return true;
|
|
}
|
|
if (auto ty = getStringLiteralIfNotInterpolated(Tok.getLoc(), "(C type)")) {
|
|
convention.ClangType = { ty.getValue(), Tok.getLoc() };
|
|
}
|
|
consumeToken(tok::string_literal);
|
|
}
|
|
|
|
if (convention.Name == "witness_method") {
|
|
if (!consumeIf(tok::colon)) {
|
|
if (!justChecking)
|
|
diagnose(Tok,
|
|
diag::convention_attribute_witness_method_expected_colon);
|
|
return true;
|
|
}
|
|
|
|
DeclNameLoc unusedLoc;
|
|
convention.WitnessMethodProtocol = parseDeclNameRef(unusedLoc,
|
|
diag::convention_attribute_witness_method_expected_protocol, {});
|
|
}
|
|
|
|
// Parse the ')'. We can't use parseMatchingToken if we're in
|
|
// just-checking mode.
|
|
if (justChecking && Tok.isNot(tok::r_paren))
|
|
return true;
|
|
|
|
SourceLoc RPLoc;
|
|
parseMatchingToken(tok::r_paren, RPLoc,
|
|
diag::convention_attribute_expected_rparen,
|
|
LPLoc);
|
|
return false;
|
|
}
|
|
|
|
/// \verbatim
|
|
/// attribute-type:
|
|
/// 'noreturn'
|
|
/// \endverbatim
|
|
///
|
|
/// \param justChecking - if true, we're just checking whether we
|
|
/// canParseTypeAttribute; don't emit any diagnostics, and there's
|
|
/// no need to actually record the attribute
|
|
ParserStatus Parser::parseTypeAttribute(TypeAttributes &Attributes,
|
|
SourceLoc AtLoc,
|
|
PatternBindingInitializer *&initContext,
|
|
bool justChecking) {
|
|
// If this not an identifier, the attribute is malformed.
|
|
if (Tok.isNot(tok::identifier) &&
|
|
// These are keywords that we accept as attribute names.
|
|
Tok.isNot(tok::kw_in) && Tok.isNot(tok::kw_inout)) {
|
|
|
|
if (Tok.is(tok::code_complete)) {
|
|
if (!justChecking) {
|
|
if (CodeCompletion) {
|
|
CodeCompletion->completeTypeAttrBeginning();
|
|
}
|
|
}
|
|
consumeToken(tok::code_complete);
|
|
return makeParserCodeCompletionStatus();
|
|
}
|
|
|
|
if (!justChecking)
|
|
diagnose(Tok, diag::expected_attribute_name);
|
|
return makeParserError();
|
|
}
|
|
|
|
// Determine which attribute it is, and diagnose it if unknown.
|
|
TypeAttrKind attr = TypeAttributes::getAttrKindFromString(Tok.getText());
|
|
|
|
auto checkInvalidAttrName = [&](
|
|
StringRef invalidName, StringRef correctName, TypeAttrKind kind,
|
|
Optional<Diag<StringRef, StringRef>> diag = None) {
|
|
if (attr == TAK_Count && Tok.getText() == invalidName) {
|
|
attr = kind;
|
|
|
|
if (diag) {
|
|
diagnose(Tok, *diag, invalidName, correctName)
|
|
.fixItReplace(Tok.getLoc(), correctName);
|
|
}
|
|
}
|
|
};
|
|
|
|
// Historical name for @Sendable.
|
|
checkInvalidAttrName(
|
|
"concurrent", "Sendable", TAK_Sendable, diag::attr_renamed_warning);
|
|
|
|
if (attr == TAK_Count) {
|
|
auto declAttrID = DeclAttribute::getAttrKindFromString(Tok.getText());
|
|
if (declAttrID != DAK_Count) {
|
|
// This is a valid decl attribute so they should have put it on the decl
|
|
// instead of the type.
|
|
if (justChecking) return makeParserError();
|
|
|
|
// If this is the first attribute, and if we are on a simple decl, emit a
|
|
// fixit to move the attribute. Otherwise, we don't have the location of
|
|
// the @ sign, or we don't have confidence that the fixit will be right.
|
|
if (!Attributes.empty() || StructureMarkers.empty() ||
|
|
StructureMarkers.back().Kind != StructureMarkerKind::Declaration ||
|
|
StructureMarkers.back().Loc.isInvalid() ||
|
|
peekToken().is(tok::equal)) {
|
|
diagnose(Tok, diag::decl_attribute_applied_to_type);
|
|
} else {
|
|
// Otherwise, this is the first type attribute and we know where the
|
|
// declaration is. Emit the same diagnostic, but include a fixit to
|
|
// move the attribute. Unfortunately, we don't have enough info to add
|
|
// the attribute to DeclAttributes.
|
|
diagnose(Tok, diag::decl_attribute_applied_to_type)
|
|
.fixItRemove(SourceRange(Attributes.AtLoc, Tok.getLoc()))
|
|
.fixItInsert(StructureMarkers.back().Loc,
|
|
"@" + Tok.getText().str()+" ");
|
|
}
|
|
|
|
// Recover by eating @foo(...) when foo is not known.
|
|
consumeToken();
|
|
SyntaxParsingContext TokListContext(SyntaxContext, SyntaxKind::TokenList);
|
|
|
|
if (Tok.is(tok::l_paren) && getEndOfPreviousLoc() == Tok.getLoc()) {
|
|
CancellableBacktrackingScope backtrack(*this);
|
|
skipSingle();
|
|
// If we found '->', or 'throws' after paren, it's likely a parameter
|
|
// of function type.
|
|
if (Tok.isNot(tok::arrow, tok::kw_throws, tok::kw_rethrows,
|
|
tok::kw_throw))
|
|
backtrack.cancelBacktrack();
|
|
}
|
|
|
|
return makeParserError();
|
|
}
|
|
|
|
// If we're just checking, try to parse now.
|
|
if (justChecking)
|
|
return canParseCustomAttribute() ? makeParserSuccess()
|
|
: makeParserError();
|
|
|
|
// Parse as a custom attribute.
|
|
auto customAttrResult = parseCustomAttribute(AtLoc, initContext);
|
|
if (customAttrResult.isParseErrorOrHasCompletion())
|
|
return customAttrResult;
|
|
|
|
if (auto attr = customAttrResult.get())
|
|
Attributes.addCustomAttr(attr);
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
// Ok, it is a valid attribute, eat it, and then process it.
|
|
StringRef Text = Tok.getText();
|
|
consumeToken();
|
|
|
|
TypeAttributes::Convention convention;
|
|
if (attr == TAK_convention) {
|
|
bool failedToParse =
|
|
parseConventionAttributeInternal(justChecking, convention);
|
|
if (failedToParse) {
|
|
if (Tok.is(tok::r_paren))
|
|
consumeToken();
|
|
return makeParserError();
|
|
}
|
|
}
|
|
|
|
// In just-checking mode, we only need to consume the tokens, and we don't
|
|
// want to do any other analysis.
|
|
if (justChecking)
|
|
return makeParserSuccess();
|
|
|
|
// Diagnose duplicated attributes.
|
|
if (Attributes.has(attr)) {
|
|
diagnose(AtLoc, diag::duplicate_attribute, /*isModifier=*/false);
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
// Handle any attribute-specific processing logic.
|
|
switch (attr) {
|
|
default: break;
|
|
case TAK_autoclosure:
|
|
case TAK_escaping:
|
|
case TAK_noescape:
|
|
break;
|
|
|
|
case TAK_out:
|
|
case TAK_in:
|
|
case TAK_owned:
|
|
case TAK_unowned_inner_pointer:
|
|
case TAK_guaranteed:
|
|
case TAK_autoreleased:
|
|
case TAK_callee_owned:
|
|
case TAK_callee_guaranteed:
|
|
case TAK_objc_metatype:
|
|
if (!isInSILMode()) {
|
|
diagnose(AtLoc, diag::only_allowed_in_sil, Text);
|
|
return makeParserSuccess();
|
|
}
|
|
break;
|
|
|
|
// Ownership attributes.
|
|
case TAK_sil_weak:
|
|
case TAK_sil_unowned:
|
|
if (!isInSILMode()) {
|
|
diagnose(AtLoc, diag::only_allowed_in_sil, Text);
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
if (Attributes.hasOwnership()) {
|
|
diagnose(AtLoc, diag::duplicate_attribute, /*isModifier*/false);
|
|
return makeParserSuccess();
|
|
}
|
|
break;
|
|
|
|
// 'inout' attribute.
|
|
case TAK_inout:
|
|
if (!isInSILMode()) {
|
|
diagnose(AtLoc, diag::inout_not_attribute);
|
|
return makeParserSuccess();
|
|
}
|
|
break;
|
|
|
|
case TAK_opened: {
|
|
if (!isInSILMode()) {
|
|
diagnose(AtLoc, diag::only_allowed_in_sil, "opened");
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
// Parse the opened existential ID string in parens
|
|
SourceLoc beginLoc = Tok.getLoc(), idLoc, endLoc;
|
|
if (consumeIfNotAtStartOfLine(tok::l_paren)) {
|
|
if (Tok.is(tok::string_literal)) {
|
|
UUID openedID;
|
|
idLoc = Tok.getLoc();
|
|
auto literalText = Tok.getText().slice(1, Tok.getText().size() - 1);
|
|
llvm::SmallString<UUID::StringBufferSize> text(literalText);
|
|
if (auto openedID = UUID::fromString(text.c_str())) {
|
|
Attributes.OpenedID = openedID;
|
|
} else {
|
|
diagnose(Tok, diag::opened_attribute_id_value);
|
|
}
|
|
consumeToken();
|
|
} else {
|
|
diagnose(Tok, diag::opened_attribute_id_value);
|
|
}
|
|
parseMatchingToken(tok::r_paren, endLoc,
|
|
diag::opened_attribute_expected_rparen,
|
|
beginLoc);
|
|
} else {
|
|
diagnose(Tok, diag::opened_attribute_expected_lparen);
|
|
}
|
|
|
|
break;
|
|
}
|
|
|
|
case TAK_differentiable: {
|
|
Attributes.differentiabilityKind = DifferentiabilityKind::Normal;
|
|
if (parseDifferentiableTypeAttributeArgument(
|
|
*this, Attributes, /*emitDiagnostics=*/!justChecking))
|
|
return makeParserError();
|
|
// Only 'reverse' is supported today.
|
|
// TODO: Change this to an error once clients have migrated to 'reverse'.
|
|
if (Attributes.differentiabilityKind == DifferentiabilityKind::Normal) {
|
|
diagnose(getEndOfPreviousLoc(),
|
|
diag::attr_differentiable_expected_reverse)
|
|
.fixItInsert(getEndOfPreviousLoc(), "(reverse)");
|
|
Attributes.differentiabilityKind = DifferentiabilityKind::Reverse;
|
|
}
|
|
break;
|
|
}
|
|
|
|
// Convention attribute.
|
|
case TAK_convention:
|
|
Attributes.ConventionArguments = convention;
|
|
break;
|
|
|
|
case TAK__opaqueReturnTypeOf: {
|
|
// Parse the mangled decl name and index.
|
|
auto beginLoc = Tok.getLoc();
|
|
if (!consumeIfNotAtStartOfLine(tok::l_paren)) {
|
|
diagnose(Tok, diag::attr_expected_lparen, "_opaqueReturnTypeOf", false);
|
|
return makeParserError();
|
|
}
|
|
|
|
if (!Tok.is(tok::string_literal)) {
|
|
diagnose(Tok, diag::opened_attribute_id_value);
|
|
return makeParserError();
|
|
}
|
|
auto mangling = Tok.getText().slice(1, Tok.getText().size() - 1);
|
|
consumeToken(tok::string_literal);
|
|
|
|
if (!Tok.is(tok::comma)) {
|
|
diagnose(Tok, diag::attr_expected_comma, "_opaqueReturnTypeOf", false);
|
|
return makeParserError();
|
|
}
|
|
consumeToken(tok::comma);
|
|
|
|
if (!Tok.is(tok::integer_literal)) {
|
|
diagnose(Tok, diag::attr_expected_string_literal, "_opaqueReturnTypeOf");
|
|
return makeParserError();
|
|
}
|
|
|
|
unsigned index;
|
|
if (Tok.getText().getAsInteger(10, index)) {
|
|
diagnose(Tok, diag::attr_expected_string_literal, "_opaqueReturnTypeOf");
|
|
return makeParserError();
|
|
}
|
|
consumeToken(tok::integer_literal);
|
|
|
|
SourceLoc endLoc;
|
|
parseMatchingToken(tok::r_paren, endLoc,
|
|
diag::expected_rparen_expr_list,
|
|
beginLoc);
|
|
|
|
Attributes.setOpaqueReturnTypeOf(mangling, index);
|
|
break;
|
|
}
|
|
}
|
|
|
|
Attributes.setAttr(attr, AtLoc);
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
/// \verbatim
|
|
/// attribute-list:
|
|
/// /*empty*/
|
|
/// attribute-list-clause attribute-list
|
|
/// attribute-list-clause:
|
|
/// '@' attribute
|
|
/// \endverbatim
|
|
ParserStatus Parser::parseDeclAttributeList(DeclAttributes &Attributes) {
|
|
if (Tok.isNot(tok::at_sign))
|
|
return makeParserSuccess();
|
|
|
|
PatternBindingInitializer *initContext = nullptr;
|
|
ParserStatus Status;
|
|
SyntaxParsingContext AttrListCtx(SyntaxContext, SyntaxKind::AttributeList);
|
|
do {
|
|
SyntaxParsingContext AttrCtx(SyntaxContext, SyntaxKind::Attribute);
|
|
SourceLoc AtLoc = consumeToken();
|
|
Status |= parseDeclAttribute(Attributes, AtLoc, initContext);
|
|
} while (Tok.is(tok::at_sign));
|
|
return Status;
|
|
}
|
|
|
|
/// \verbatim
|
|
/// modifier-list
|
|
/// /* empty */
|
|
// modifier modifier-list
|
|
// modifier
|
|
// 'private'
|
|
// 'private' '(' 'set' ')'
|
|
// 'fileprivate'
|
|
// 'fileprivate' '(' 'set' )'
|
|
// 'internal'
|
|
// 'internal' '(' 'set' ')'
|
|
// 'public'
|
|
// 'open'
|
|
// 'weak'
|
|
// 'unowned'
|
|
// 'unowned' '(' 'safe' ')'
|
|
// 'unowned' '(' 'unsafe' ')'
|
|
// 'optional'
|
|
// 'required'
|
|
// 'lazy'
|
|
// 'final'
|
|
// 'dynamic'
|
|
// 'prefix'
|
|
// 'postfix'
|
|
// 'infix'
|
|
// 'override'
|
|
// 'mutating
|
|
// 'nonmutating'
|
|
// '__consuming'
|
|
// 'convenience'
|
|
// 'actor'
|
|
// 'distributed'
|
|
bool Parser::parseDeclModifierList(DeclAttributes &Attributes,
|
|
SourceLoc &StaticLoc,
|
|
StaticSpellingKind &StaticSpelling,
|
|
bool isFromClangAttribute) {
|
|
SyntaxParsingContext ListContext(SyntaxContext, SyntaxKind::ModifierList);
|
|
bool isError = false;
|
|
bool hasModifier = false;
|
|
while (true) {
|
|
switch (Tok.getKind()) {
|
|
|
|
case tok::kw_private:
|
|
case tok::kw_fileprivate:
|
|
case tok::kw_internal:
|
|
case tok::kw_public: {
|
|
SyntaxParsingContext ModContext(SyntaxContext, SyntaxKind::DeclModifier);
|
|
// We still model these specifiers as attributes.
|
|
isError |=
|
|
parseNewDeclAttribute(Attributes, /*AtLoc=*/{}, DAK_AccessControl);
|
|
hasModifier = true;
|
|
continue;
|
|
}
|
|
|
|
// Context sensitive keywords.
|
|
case tok::identifier: {
|
|
if (Tok.isEscapedIdentifier())
|
|
break;
|
|
|
|
DeclAttrKind Kind = llvm::StringSwitch<DeclAttrKind>(Tok.getText())
|
|
#define CONTEXTUAL_CASE(KW, CLASS) .Case(#KW, DAK_##CLASS)
|
|
#define CONTEXTUAL_DECL_ATTR(KW, CLASS, ...) CONTEXTUAL_CASE(KW, CLASS)
|
|
#define CONTEXTUAL_DECL_ATTR_ALIAS(KW, CLASS) CONTEXTUAL_CASE(KW, CLASS)
|
|
#define CONTEXTUAL_SIMPLE_DECL_ATTR(KW, CLASS, ...) CONTEXTUAL_CASE(KW, CLASS)
|
|
#include <swift/AST/Attr.def>
|
|
#undef CONTEXTUAL_CASE
|
|
.Default(DAK_Count);
|
|
|
|
if (Kind == DAK_Count)
|
|
break;
|
|
|
|
if (Kind == DAK_Actor) {
|
|
// If the next token is a startOfSwiftDecl, we are part of the modifier
|
|
// list and should consume the actor token (e.g, actor public class Foo)
|
|
// otherwise, it's the decl keyword (e.g. actor Foo) and shouldn't be.
|
|
// Unfortunately, the BacktrackingScope will eat diagnostics emitted in
|
|
// that scope, so we have to store enough state to emit the diagnostics
|
|
// outside of the scope.
|
|
bool isActorModifier = false;
|
|
SourceLoc actorLoc = Tok.getLoc();
|
|
|
|
{
|
|
BacktrackingScope Scope(*this);
|
|
|
|
consumeToken(); // consume actor
|
|
isActorModifier = isStartOfSwiftDecl();
|
|
}
|
|
|
|
if (!isActorModifier)
|
|
break;
|
|
|
|
// Actor is a standalone keyword now, so it can't be used
|
|
// as a modifier. Let's diagnose and recover.
|
|
isError = true;
|
|
|
|
consumeToken(); // consume 'actor'
|
|
|
|
diagnose(actorLoc, diag::keyword_cant_be_identifier, Tok.getText());
|
|
continue;
|
|
}
|
|
|
|
SyntaxParsingContext ModContext(SyntaxContext,
|
|
SyntaxKind::DeclModifier);
|
|
isError |= parseNewDeclAttribute(
|
|
Attributes, /*AtLoc=*/{}, Kind, isFromClangAttribute);
|
|
hasModifier = true;
|
|
continue;
|
|
}
|
|
|
|
case tok::kw_static: {
|
|
// 'static' is not handled as an attribute in AST.
|
|
if (StaticLoc.isValid()) {
|
|
diagnose(Tok, diag::decl_already_static,
|
|
StaticSpellingKind::KeywordStatic)
|
|
.highlight(StaticLoc)
|
|
.fixItRemove(Tok.getLoc());
|
|
} else {
|
|
StaticLoc = Tok.getLoc();
|
|
StaticSpelling = StaticSpellingKind::KeywordStatic;
|
|
}
|
|
SyntaxParsingContext ModContext(SyntaxContext, SyntaxKind::DeclModifier);
|
|
consumeToken(tok::kw_static);
|
|
hasModifier = true;
|
|
continue;
|
|
}
|
|
|
|
case tok::kw_class: {
|
|
// If 'class' is a modifier on another decl kind, like var or func,
|
|
// then treat it as a modifier.
|
|
{
|
|
BacktrackingScope Scope(*this);
|
|
consumeToken(tok::kw_class);
|
|
// When followed by an 'override' or CC token inside a class,
|
|
// treat 'class' as a modifier; in the case of a following CC
|
|
// token, we cannot be sure there is no intention to override
|
|
// or witness something static.
|
|
if (isStartOfSwiftDecl() || (isa<ClassDecl>(CurDeclContext) &&
|
|
(Tok.is(tok::code_complete) ||
|
|
Tok.getRawText().equals("override")))) {
|
|
/* We're OK */
|
|
} else {
|
|
// This 'class' is a real ClassDecl introducer.
|
|
break;
|
|
}
|
|
}
|
|
if (StaticLoc.isValid()) {
|
|
diagnose(Tok, diag::decl_already_static,
|
|
StaticSpellingKind::KeywordClass)
|
|
.highlight(StaticLoc)
|
|
.fixItRemove(Tok.getLoc());
|
|
} else {
|
|
StaticLoc = Tok.getLoc();
|
|
StaticSpelling = StaticSpellingKind::KeywordClass;
|
|
}
|
|
SyntaxParsingContext ModContext(SyntaxContext, SyntaxKind::DeclModifier);
|
|
consumeToken(tok::kw_class);
|
|
hasModifier = true;
|
|
continue;
|
|
}
|
|
|
|
case tok::unknown:
|
|
// Eat an invalid token in decl modifier context. Error tokens are
|
|
// diagnosed by the lexer, so we don't need to emit another diagnostic.
|
|
consumeToken(tok::unknown);
|
|
hasModifier = true;
|
|
continue;
|
|
|
|
default:
|
|
break;
|
|
}
|
|
|
|
// If we don't have any modifiers, don't bother to construct an empty list.
|
|
if (!hasModifier)
|
|
ListContext.setTransparent();
|
|
|
|
// If we 'break' out of the switch, modifier list has ended.
|
|
return isError;
|
|
}
|
|
}
|
|
|
|
/// This is the internal implementation of \c parseTypeAttributeList,
|
|
/// which we expect to be inlined to handle the common case of an absent
|
|
/// attribute list.
|
|
///
|
|
/// \verbatim
|
|
/// attribute-list:
|
|
/// /*empty*/
|
|
/// attribute-list-clause attribute-list
|
|
/// 'inout' attribute-list-clause attribute-list
|
|
/// '__shared' attribute-list-clause attribute-list
|
|
/// '__owned' attribute-list-clause attribute-list
|
|
/// 'some' attribute-list-clause attribute-list
|
|
/// attribute-list-clause:
|
|
/// '@' attribute
|
|
/// '@' attribute attribute-list-clause
|
|
/// \endverbatim
|
|
ParserStatus
|
|
Parser::parseTypeAttributeListPresent(ParamDecl::Specifier &Specifier,
|
|
SourceLoc &SpecifierLoc,
|
|
SourceLoc &IsolatedLoc,
|
|
SourceLoc &ConstLoc,
|
|
TypeAttributes &Attributes) {
|
|
PatternBindingInitializer *initContext = nullptr;
|
|
Specifier = ParamDecl::Specifier::Default;
|
|
while (Tok.is(tok::kw_inout) ||
|
|
Tok.isContextualKeyword("__shared") ||
|
|
Tok.isContextualKeyword("__owned") ||
|
|
Tok.isContextualKeyword("isolated") ||
|
|
Tok.isContextualKeyword("_const")) {
|
|
|
|
if (Tok.isContextualKeyword("isolated")) {
|
|
if (IsolatedLoc.isValid()) {
|
|
diagnose(Tok, diag::parameter_specifier_repeated)
|
|
.fixItRemove(SpecifierLoc);
|
|
}
|
|
IsolatedLoc = consumeToken();
|
|
continue;
|
|
}
|
|
|
|
if (Tok.isContextualKeyword("_const")) {
|
|
ConstLoc = consumeToken();
|
|
continue;
|
|
}
|
|
|
|
if (SpecifierLoc.isValid()) {
|
|
diagnose(Tok, diag::parameter_specifier_repeated)
|
|
.fixItRemove(SpecifierLoc);
|
|
} else {
|
|
if (Tok.is(tok::kw_inout)) {
|
|
Specifier = ParamDecl::Specifier::InOut;
|
|
} else if (Tok.is(tok::identifier)) {
|
|
if (Tok.getRawText().equals("__shared")) {
|
|
Specifier = ParamDecl::Specifier::Shared;
|
|
} else if (Tok.getRawText().equals("__owned")) {
|
|
Specifier = ParamDecl::Specifier::Owned;
|
|
}
|
|
}
|
|
}
|
|
SpecifierLoc = consumeToken();
|
|
}
|
|
|
|
ParserStatus status;
|
|
SyntaxParsingContext AttrListCtx(SyntaxContext, SyntaxKind::AttributeList);
|
|
while (Tok.is(tok::at_sign)) {
|
|
// Ignore @substituted in SIL mode and leave it for the type parser.
|
|
if (isInSILMode() && peekToken().getText() == "substituted")
|
|
return status;
|
|
|
|
if (Attributes.AtLoc.isInvalid())
|
|
Attributes.AtLoc = Tok.getLoc();
|
|
SyntaxParsingContext AttrCtx(SyntaxContext, SyntaxKind::Attribute);
|
|
SourceLoc AtLoc = consumeToken();
|
|
status |= parseTypeAttribute(Attributes, AtLoc, initContext);
|
|
if (status.isError())
|
|
return status;
|
|
}
|
|
|
|
return status;
|
|
}
|
|
|
|
static bool isStartOfOperatorDecl(const Token &Tok, const Token &Tok2) {
|
|
return Tok.isContextualKeyword("operator") &&
|
|
(Tok2.isContextualKeyword("prefix") ||
|
|
Tok2.isContextualKeyword("postfix") ||
|
|
Tok2.isContextualKeyword("infix"));
|
|
}
|
|
|
|
/// Diagnose issues with fixity attributes, if any.
|
|
static void diagnoseOperatorFixityAttributes(Parser &P,
|
|
DeclAttributes &Attrs,
|
|
const Decl *D) {
|
|
auto isFixityAttr = [](DeclAttribute *attr){
|
|
DeclAttrKind kind = attr->getKind();
|
|
return attr->isValid() && (kind == DAK_Prefix ||
|
|
kind == DAK_Infix ||
|
|
kind == DAK_Postfix);
|
|
};
|
|
|
|
SmallVector<DeclAttribute *, 3> fixityAttrs;
|
|
std::copy_if(Attrs.begin(), Attrs.end(),
|
|
std::back_inserter(fixityAttrs), isFixityAttr);
|
|
std::reverse(fixityAttrs.begin(), fixityAttrs.end());
|
|
|
|
for (auto it = fixityAttrs.begin(); it != fixityAttrs.end(); ++it) {
|
|
if (it != fixityAttrs.begin()) {
|
|
auto *attr = *it;
|
|
P.diagnose(attr->getLocation(), diag::mutually_exclusive_attrs,
|
|
attr->getAttrName(), fixityAttrs.front()->getAttrName(),
|
|
attr->isDeclModifier())
|
|
.fixItRemove(attr->getRange());
|
|
attr->setInvalid();
|
|
}
|
|
}
|
|
|
|
// Operator declarations must specify a fixity.
|
|
if (auto *OD = dyn_cast<OperatorDecl>(D)) {
|
|
if (fixityAttrs.empty()) {
|
|
P.diagnose(OD->getOperatorLoc(), diag::operator_decl_no_fixity);
|
|
}
|
|
}
|
|
// Infix operator is only allowed on operator declarations, not on func.
|
|
else if (isa<FuncDecl>(D)) {
|
|
if (auto *attr = Attrs.getAttribute<InfixAttr>()) {
|
|
P.diagnose(attr->getLocation(), diag::invalid_infix_on_func)
|
|
.fixItRemove(attr->getLocation());
|
|
attr->setInvalid();
|
|
}
|
|
} else {
|
|
llvm_unreachable("unexpected decl kind?");
|
|
}
|
|
}
|
|
|
|
static unsigned skipUntilMatchingRBrace(Parser &P,
|
|
bool &HasPoundDirective,
|
|
bool &HasOperatorDeclarations,
|
|
bool &HasNestedClassDeclarations,
|
|
bool &HasNestedTypeDeclarations) {
|
|
HasPoundDirective = false;
|
|
HasOperatorDeclarations = false;
|
|
HasNestedClassDeclarations = false;
|
|
HasNestedTypeDeclarations = false;
|
|
|
|
unsigned OpenBraces = 1;
|
|
|
|
bool LastTokenWasFunc = false;
|
|
|
|
while (OpenBraces != 0 && P.Tok.isNot(tok::eof)) {
|
|
// Detect 'func' followed by an operator identifier.
|
|
if (LastTokenWasFunc) {
|
|
LastTokenWasFunc = false;
|
|
HasOperatorDeclarations |= P.Tok.isAnyOperator();
|
|
} else {
|
|
LastTokenWasFunc = P.Tok.is(tok::kw_func);
|
|
}
|
|
|
|
HasNestedClassDeclarations |= P.Tok.is(tok::kw_class);
|
|
|
|
HasPoundDirective |= P.Tok.isAny(tok::pound_sourceLocation, tok::pound_line,
|
|
tok::pound_if, tok::pound_else, tok::pound_endif, tok::pound_elseif);
|
|
|
|
HasNestedTypeDeclarations |= P.Tok.isAny(tok::kw_class, tok::kw_struct,
|
|
tok::kw_enum);
|
|
|
|
if (P.consumeIf(tok::l_brace)) {
|
|
++OpenBraces;
|
|
continue;
|
|
}
|
|
if (OpenBraces == 1 && P.Tok.is(tok::r_brace))
|
|
break;
|
|
if (P.consumeIf(tok::r_brace)) {
|
|
--OpenBraces;
|
|
continue;
|
|
}
|
|
P.consumeToken();
|
|
}
|
|
return OpenBraces;
|
|
}
|
|
|
|
bool swift::isKeywordPossibleDeclStart(const Token &Tok) {
|
|
switch (Tok.getKind()) {
|
|
case tok::at_sign:
|
|
case tok::kw_associatedtype:
|
|
case tok::kw_case:
|
|
case tok::kw_class:
|
|
case tok::kw_deinit:
|
|
case tok::kw_enum:
|
|
case tok::kw_extension:
|
|
case tok::kw_fileprivate:
|
|
case tok::kw_func:
|
|
case tok::kw_import:
|
|
case tok::kw_init:
|
|
case tok::kw_internal:
|
|
case tok::kw_let:
|
|
case tok::kw_operator:
|
|
case tok::kw_precedencegroup:
|
|
case tok::kw_private:
|
|
case tok::kw_protocol:
|
|
case tok::kw_public:
|
|
case tok::kw_static:
|
|
case tok::kw_struct:
|
|
case tok::kw_subscript:
|
|
case tok::kw_typealias:
|
|
case tok::kw_var:
|
|
case tok::pound_if:
|
|
case tok::pound_warning:
|
|
case tok::pound_error:
|
|
case tok::identifier:
|
|
case tok::pound_sourceLocation:
|
|
return true;
|
|
case tok::pound_line:
|
|
// #line at the start of the line is a directive, but it's deprecated.
|
|
// #line within a line is an expression.
|
|
return Tok.isAtStartOfLine();
|
|
|
|
case tok::kw_try:
|
|
// 'try' is not a valid way to start a decl, but we special-case 'try let'
|
|
// and 'try var' for better recovery.
|
|
return true;
|
|
default:
|
|
return false;
|
|
}
|
|
}
|
|
|
|
/// Given a current token of 'unowned', check to see if it is followed by a
|
|
/// "(safe)" or "(unsafe)" specifier.
|
|
static bool isParenthesizedUnowned(Parser &P) {
|
|
assert(P.Tok.getText() == "unowned" && P.peekToken().is(tok::l_paren) &&
|
|
"Invariant violated");
|
|
|
|
// Look ahead to parse the parenthesized expression.
|
|
Parser::BacktrackingScope Backtrack(P);
|
|
P.consumeToken(tok::identifier);
|
|
P.consumeToken(tok::l_paren);
|
|
return P.Tok.is(tok::identifier) && P.peekToken().is(tok::r_paren) &&
|
|
(P.Tok.getText() == "safe" || P.Tok.getText() == "unsafe");
|
|
}
|
|
|
|
static void skipAttribute(Parser &P) {
|
|
// Consider unexpected tokens to be incomplete attributes.
|
|
|
|
// Parse the attribute name, which can be qualified, have
|
|
// generic arguments, and so on.
|
|
do {
|
|
if (!(P.consumeIf(tok::identifier) || P.consumeIf(tok::kw_rethrows)) &&
|
|
!P.consumeIf(tok::code_complete))
|
|
return;
|
|
|
|
if (P.startsWithLess(P.Tok)) {
|
|
P.consumeStartingLess();
|
|
P.skipUntilGreaterInTypeList();
|
|
}
|
|
} while (P.consumeIf(tok::period));
|
|
|
|
// Skip an argument clause after the attribute name.
|
|
if (P.consumeIf(tok::l_paren)) {
|
|
while (P.Tok.isNot(tok::r_brace, tok::eof, tok::pound_endif)) {
|
|
if (P.consumeIf(tok::r_paren)) break;
|
|
P.skipSingle();
|
|
}
|
|
}
|
|
}
|
|
|
|
bool Parser::isStartOfSwiftDecl() {
|
|
if (Tok.is(tok::at_sign) && peekToken().is(tok::kw_rethrows)) {
|
|
// @rethrows does not follow the general rule of @<identifier> so
|
|
// it is needed to short circuit this else there will be an infinite
|
|
// loop on invalid attributes of just rethrows
|
|
} else if (!isKeywordPossibleDeclStart(Tok)) {
|
|
// If this is obviously not the start of a decl, then we're done.
|
|
return false;
|
|
}
|
|
|
|
// When 'init' appears inside another 'init', it's likely the user wants to
|
|
// invoke an initializer but forgets to prefix it with 'self.' or 'super.'
|
|
// Otherwise, expect 'init' to be the start of a declaration (and complain
|
|
// when the expectation is not fulfilled).
|
|
if (Tok.is(tok::kw_init)) {
|
|
return !isa<ConstructorDecl>(CurDeclContext);
|
|
}
|
|
|
|
// Similarly, when 'case' appears inside a function, it's probably a switch
|
|
// case, not an enum case declaration.
|
|
if (Tok.is(tok::kw_case)) {
|
|
return !isa<AbstractFunctionDecl>(CurDeclContext);
|
|
}
|
|
|
|
// The protocol keyword needs more checking to reject "protocol<Int>".
|
|
if (Tok.is(tok::kw_protocol)) {
|
|
const Token &Tok2 = peekToken();
|
|
return !Tok2.isAnyOperator() || !Tok2.getText().equals("<");
|
|
}
|
|
|
|
// The 'try' case is only for simple local recovery, so we only bother to
|
|
// check 'let' and 'var' right now.
|
|
if (Tok.is(tok::kw_try))
|
|
return peekToken().isAny(tok::kw_let, tok::kw_var);
|
|
|
|
// Skip an attribute, since it might be a type attribute. This can't
|
|
// happen at the top level of a scope, but we do use isStartOfSwiftDecl()
|
|
// in positions like generic argument lists.
|
|
if (Tok.is(tok::at_sign)) {
|
|
BacktrackingScope backtrack(*this);
|
|
while (consumeIf(tok::at_sign))
|
|
skipAttribute(*this);
|
|
|
|
// If this attribute is the last element in the block,
|
|
// consider it is a start of incomplete decl.
|
|
if (Tok.isAny(tok::r_brace, tok::eof, tok::pound_endif))
|
|
return true;
|
|
|
|
return isStartOfSwiftDecl();
|
|
}
|
|
|
|
// If we have a decl modifying keyword, check if the next token is a valid
|
|
// decl start. This is necessary to correctly handle Swift keywords that are
|
|
// shared by SIL, e.g 'private' in 'sil private @foo :'. We need to make sure
|
|
// this isn't considered a valid Swift decl start.
|
|
if (Tok.isKeyword()) {
|
|
auto DAK = DeclAttribute::getAttrKindFromString(Tok.getText());
|
|
if (DAK != DAK_Count && DeclAttribute::isDeclModifier(DAK)) {
|
|
BacktrackingScope backtrack(*this);
|
|
consumeToken();
|
|
|
|
// Eat paren after modifier name; e.g. private(set)
|
|
if (consumeIf(tok::l_paren)) {
|
|
while (Tok.isNot(tok::r_brace, tok::eof, tok::pound_endif)) {
|
|
if (consumeIf(tok::r_paren))
|
|
break;
|
|
|
|
// If we found the start of a decl while trying to skip over the
|
|
// paren, then we have something incomplete like 'private('. Return
|
|
// true for better recovery.
|
|
if (isStartOfSwiftDecl())
|
|
return true;
|
|
|
|
skipSingle();
|
|
}
|
|
}
|
|
return isStartOfSwiftDecl();
|
|
}
|
|
}
|
|
|
|
// Otherwise, the only hard case left is the identifier case.
|
|
if (Tok.isNot(tok::identifier)) return true;
|
|
|
|
// If this is an operator declaration, handle it.
|
|
const Token &Tok2 = peekToken();
|
|
if (isStartOfOperatorDecl(Tok, Tok2))
|
|
return true;
|
|
|
|
// If this can't possibly be a contextual keyword, then this identifier is
|
|
// not interesting. Bail out.
|
|
if (!Tok.isContextualDeclKeyword())
|
|
return false;
|
|
|
|
// If it might be, we do some more digging.
|
|
|
|
// If this is 'unowned', check to see if it is valid.
|
|
if (Tok.getText() == "unowned" && Tok2.is(tok::l_paren) &&
|
|
isParenthesizedUnowned(*this)) {
|
|
Parser::BacktrackingScope Backtrack(*this);
|
|
consumeToken(tok::identifier);
|
|
consumeToken(tok::l_paren);
|
|
consumeToken(tok::identifier);
|
|
consumeToken(tok::r_paren);
|
|
return isStartOfSwiftDecl();
|
|
}
|
|
|
|
if (Tok.isContextualKeyword("actor")) {
|
|
if (Tok2.is(tok::identifier)) // actor Foo {}
|
|
return true;
|
|
BacktrackingScope Scope(*this);
|
|
// actor may be somewhere in the modifier list. Eat the tokens until we get
|
|
// to something that isn't the start of a decl. If that is an identifier,
|
|
// it's an actor declaration, otherwise, it isn't.
|
|
do {
|
|
consumeToken();
|
|
} while (isStartOfSwiftDecl());
|
|
return Tok.is(tok::identifier);
|
|
}
|
|
|
|
// If the next token is obviously not the start of a decl, bail early.
|
|
if (!isKeywordPossibleDeclStart(Tok2))
|
|
return false;
|
|
|
|
// Otherwise, do a recursive parse.
|
|
Parser::BacktrackingScope Backtrack(*this);
|
|
consumeToken(tok::identifier);
|
|
return isStartOfSwiftDecl();
|
|
}
|
|
|
|
bool Parser::isStartOfSILDecl() {
|
|
switch (Tok.getKind()) {
|
|
case tok::kw_sil:
|
|
case tok::kw_sil_stage:
|
|
case tok::kw_sil_property:
|
|
case tok::kw_sil_vtable:
|
|
case tok::kw_sil_global:
|
|
case tok::kw_sil_witness_table:
|
|
case tok::kw_sil_default_witness_table:
|
|
case tok::kw_sil_differentiability_witness:
|
|
case tok::kw_sil_coverage_map:
|
|
case tok::kw_sil_scope:
|
|
// SIL decls must start on a new line.
|
|
return Tok.isAtStartOfLine();
|
|
case tok::kw_undef:
|
|
case tok::NUM_TOKENS:
|
|
return false;
|
|
#define SIL_KEYWORD(Name)
|
|
#define TOKEN(Name) case tok:: Name: return false;
|
|
#include "swift/Syntax/TokenKinds.def"
|
|
}
|
|
llvm_unreachable("Unhandled case in switch");
|
|
}
|
|
|
|
void Parser::consumeDecl(ParserPosition BeginParserPosition,
|
|
ParseDeclOptions Flags,
|
|
bool IsTopLevel) {
|
|
SyntaxParsingContext Discarding(SyntaxContext);
|
|
Discarding.disable();
|
|
SourceLoc CurrentLoc = Tok.getLoc();
|
|
|
|
SourceLoc EndLoc = PreviousLoc;
|
|
backtrackToPosition(BeginParserPosition);
|
|
SourceLoc BeginLoc = Tok.getLoc();
|
|
|
|
State->setCodeCompletionDelayedDeclState(
|
|
SourceMgr, L->getBufferID(),
|
|
CodeCompletionDelayedDeclKind::Decl,
|
|
Flags.toRaw(), CurDeclContext, {BeginLoc, EndLoc},
|
|
BeginParserPosition.PreviousLoc);
|
|
|
|
while (SourceMgr.isBeforeInBuffer(Tok.getLoc(), CurrentLoc))
|
|
consumeToken();
|
|
|
|
if (IsTopLevel) {
|
|
// Skip the rest of the file to prevent the parser from constructing the
|
|
// AST for it. Forward references are not allowed at the top level.
|
|
while (Tok.isNot(tok::eof))
|
|
consumeToken();
|
|
}
|
|
}
|
|
|
|
void Parser::setLocalDiscriminator(ValueDecl *D) {
|
|
// If we're not in a local context, this is unnecessary.
|
|
if (!CurLocalContext || !D->getDeclContext()->isLocalContext())
|
|
return;
|
|
|
|
if (auto TD = dyn_cast<TypeDecl>(D))
|
|
if (!InInactiveClauseEnvironment)
|
|
SF.LocalTypeDecls.insert(TD);
|
|
|
|
const Identifier name = D->getBaseIdentifier();
|
|
unsigned discriminator = CurLocalContext->claimNextNamedDiscriminator(name);
|
|
D->setLocalDiscriminator(discriminator);
|
|
}
|
|
|
|
void Parser::setLocalDiscriminatorToParamList(ParameterList *PL) {
|
|
for (auto P : *PL) {
|
|
if (!P->hasName() || P->isImplicit())
|
|
continue;
|
|
setLocalDiscriminator(P);
|
|
}
|
|
}
|
|
|
|
/// Set the original declaration in `@differentiable` attributes.
|
|
///
|
|
/// Necessary because `Parser::parseNewDeclAttribute` (which calls
|
|
/// `Parser::parseDifferentiableAttribute`) does not have access to the
|
|
/// parent declaration of parsed attributes.
|
|
static void
|
|
setOriginalDeclarationForDifferentiableAttributes(DeclAttributes attrs,
|
|
Decl *D) {
|
|
for (auto *attr : attrs.getAttributes<DifferentiableAttr>())
|
|
const_cast<DifferentiableAttr *>(attr)->setOriginalDeclaration(D);
|
|
}
|
|
|
|
/// Parse a single syntactic declaration and return a list of decl
|
|
/// ASTs. This can return multiple results for var decls that bind to multiple
|
|
/// values, structs that define a struct decl and a constructor, etc.
|
|
///
|
|
/// \verbatim
|
|
/// decl:
|
|
/// decl-typealias
|
|
/// decl-extension
|
|
/// decl-let
|
|
/// decl-var
|
|
/// decl-class
|
|
/// decl-func
|
|
/// decl-enum
|
|
/// decl-struct
|
|
/// decl-import
|
|
/// decl-operator
|
|
/// \endverbatim
|
|
ParserResult<Decl>
|
|
Parser::parseDecl(ParseDeclOptions Flags,
|
|
bool IsAtStartOfLineOrPreviousHadSemi,
|
|
llvm::function_ref<void(Decl*)> Handler) {
|
|
ParserPosition BeginParserPosition;
|
|
if (isCodeCompletionFirstPass())
|
|
BeginParserPosition = getParserPosition();
|
|
|
|
if (Tok.is(tok::pound_if)) {
|
|
auto IfConfigResult = parseIfConfig(
|
|
[&](SmallVectorImpl<ASTNode> &Decls, bool IsActive) {
|
|
ParserStatus Status;
|
|
bool PreviousHadSemi = true;
|
|
SyntaxParsingContext DeclListCtx(SyntaxContext,
|
|
SyntaxKind::MemberDeclList);
|
|
while (Tok.isNot(tok::pound_else, tok::pound_endif, tok::pound_elseif,
|
|
tok::eof)) {
|
|
if (Tok.is(tok::r_brace)) {
|
|
diagnose(Tok.getLoc(),
|
|
diag::unexpected_rbrace_in_conditional_compilation_block);
|
|
// If we see '}', following declarations don't look like belong to
|
|
// the current decl context; skip them.
|
|
skipUntilConditionalBlockClose();
|
|
break;
|
|
}
|
|
Status |= parseDeclItem(PreviousHadSemi, Flags,
|
|
[&](Decl *D) {Decls.emplace_back(D);});
|
|
}
|
|
});
|
|
if (IfConfigResult.hasCodeCompletion() && isCodeCompletionFirstPass()) {
|
|
consumeDecl(BeginParserPosition, Flags,
|
|
CurDeclContext->isModuleScopeContext());
|
|
return makeParserError();
|
|
}
|
|
|
|
if (auto ICD = IfConfigResult.getPtrOrNull()) {
|
|
// The IfConfigDecl is ahead of its members in source order.
|
|
Handler(ICD);
|
|
// Copy the active members into the entries list.
|
|
for (auto activeMember : ICD->getActiveClauseElements()) {
|
|
auto *D = activeMember.get<Decl*>();
|
|
if (isa<IfConfigDecl>(D))
|
|
// Don't hoist nested '#if'.
|
|
continue;
|
|
Handler(D);
|
|
}
|
|
}
|
|
return IfConfigResult;
|
|
}
|
|
if (Tok.isAny(tok::pound_warning, tok::pound_error)) {
|
|
auto Result = parseDeclPoundDiagnostic();
|
|
if (Result.isNonNull())
|
|
Handler(Result.get());
|
|
return Result;
|
|
}
|
|
|
|
SyntaxParsingContext DeclParsingContext(SyntaxContext,
|
|
SyntaxContextKind::Decl);
|
|
|
|
// Note that we're parsing a declaration.
|
|
StructureMarkerRAII ParsingDecl(*this, Tok.getLoc(),
|
|
StructureMarkerKind::Declaration);
|
|
|
|
// Parse attributes.
|
|
DeclAttributes Attributes;
|
|
if (Tok.hasComment())
|
|
Attributes.add(new (Context) RawDocCommentAttr(Tok.getCommentRange()));
|
|
ParserStatus AttrStatus = parseDeclAttributeList(Attributes);
|
|
|
|
// Parse modifiers.
|
|
// Keep track of where and whether we see a contextual keyword on the decl.
|
|
SourceLoc StaticLoc;
|
|
StaticSpellingKind StaticSpelling = StaticSpellingKind::None;
|
|
parseDeclModifierList(Attributes, StaticLoc, StaticSpelling);
|
|
|
|
// We emit diagnostics for 'try let ...' in parseDeclVar().
|
|
SourceLoc tryLoc;
|
|
if (Tok.is(tok::kw_try) && peekToken().isAny(tok::kw_let, tok::kw_var))
|
|
tryLoc = consumeToken(tok::kw_try);
|
|
|
|
ParserResult<Decl> DeclResult;
|
|
|
|
// Save the original token, in case code-completion needs it.
|
|
auto OrigTok = Tok;
|
|
bool MayNeedOverrideCompletion = false;
|
|
|
|
bool HandlerAlreadyCalled = false;
|
|
|
|
auto parseLetOrVar = [&](bool HasLetOrVarKeyword) {
|
|
// Collect all modifiers into a modifier list.
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::VariableDecl);
|
|
llvm::SmallVector<Decl *, 4> Entries;
|
|
DeclResult = parseDeclVar(Flags, Attributes, Entries, StaticLoc,
|
|
StaticSpelling, tryLoc, HasLetOrVarKeyword);
|
|
StaticLoc = SourceLoc(); // we handled static if present.
|
|
MayNeedOverrideCompletion = true;
|
|
if ((AttrStatus.hasCodeCompletion() || DeclResult.hasCodeCompletion())
|
|
&& isCodeCompletionFirstPass())
|
|
return;
|
|
std::for_each(Entries.begin(), Entries.end(), Handler);
|
|
HandlerAlreadyCalled = true;
|
|
};
|
|
|
|
auto parseFunc = [&](bool HasFuncKeyword) {
|
|
// Collect all modifiers into a modifier list.
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::FunctionDecl);
|
|
DeclResult = parseDeclFunc(StaticLoc, StaticSpelling, Flags, Attributes,
|
|
HasFuncKeyword);
|
|
StaticLoc = SourceLoc(); // we handled static if present.
|
|
MayNeedOverrideCompletion = true;
|
|
};
|
|
|
|
switch (Tok.getKind()) {
|
|
case tok::kw_import:
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::ImportDecl);
|
|
DeclResult = parseDeclImport(Flags, Attributes);
|
|
break;
|
|
case tok::kw_extension:
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::ExtensionDecl);
|
|
DeclResult = parseDeclExtension(Flags, Attributes);
|
|
break;
|
|
case tok::kw_let:
|
|
case tok::kw_var: {
|
|
parseLetOrVar(/*HasLetOrVarKeyword=*/true);
|
|
break;
|
|
}
|
|
case tok::kw_typealias:
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::TypealiasDecl);
|
|
DeclResult = parseDeclTypeAlias(Flags, Attributes);
|
|
MayNeedOverrideCompletion = true;
|
|
break;
|
|
case tok::kw_associatedtype:
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::AssociatedtypeDecl);
|
|
DeclResult = parseDeclAssociatedType(Flags, Attributes);
|
|
break;
|
|
case tok::kw_enum:
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::EnumDecl);
|
|
DeclResult = parseDeclEnum(Flags, Attributes);
|
|
break;
|
|
case tok::kw_case: {
|
|
llvm::SmallVector<Decl *, 4> Entries;
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::EnumCaseDecl);
|
|
DeclResult = parseDeclEnumCase(Flags, Attributes, Entries);
|
|
if ((AttrStatus.hasCodeCompletion() || DeclResult.hasCodeCompletion()) &&
|
|
isCodeCompletionFirstPass())
|
|
break;
|
|
std::for_each(Entries.begin(), Entries.end(), Handler);
|
|
HandlerAlreadyCalled = true;
|
|
break;
|
|
}
|
|
case tok::kw_class:
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::ClassDecl);
|
|
DeclResult = parseDeclClass(Flags, Attributes);
|
|
break;
|
|
case tok::kw_struct:
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::StructDecl);
|
|
DeclResult = parseDeclStruct(Flags, Attributes);
|
|
break;
|
|
case tok::kw_init:
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::InitializerDecl);
|
|
DeclResult = parseDeclInit(Flags, Attributes);
|
|
break;
|
|
case tok::kw_deinit:
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::DeinitializerDecl);
|
|
DeclResult = parseDeclDeinit(Flags, Attributes);
|
|
break;
|
|
case tok::kw_operator:
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::OperatorDecl);
|
|
DeclResult = parseDeclOperator(Flags, Attributes);
|
|
break;
|
|
case tok::kw_precedencegroup:
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::PrecedenceGroupDecl);
|
|
DeclResult = parseDeclPrecedenceGroup(Flags, Attributes);
|
|
break;
|
|
case tok::kw_protocol:
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::ProtocolDecl);
|
|
DeclResult = parseDeclProtocol(Flags, Attributes);
|
|
break;
|
|
case tok::kw_func:
|
|
parseFunc(/*HasFuncKeyword=*/true);
|
|
break;
|
|
case tok::kw_subscript: {
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::SubscriptDecl);
|
|
llvm::SmallVector<Decl *, 4> Entries;
|
|
DeclResult = parseDeclSubscript(StaticLoc, StaticSpelling, Flags,
|
|
Attributes, Entries);
|
|
StaticLoc = SourceLoc(); // we handled static if present.
|
|
if ((AttrStatus.hasCodeCompletion() || DeclResult.hasCodeCompletion()) &&
|
|
isCodeCompletionFirstPass())
|
|
break;
|
|
std::for_each(Entries.begin(), Entries.end(), Handler);
|
|
MayNeedOverrideCompletion = true;
|
|
HandlerAlreadyCalled = true;
|
|
break;
|
|
}
|
|
|
|
case tok::code_complete:
|
|
MayNeedOverrideCompletion = true;
|
|
DeclResult = makeParserError();
|
|
// Handled below.
|
|
break;
|
|
case tok::pound:
|
|
if (Tok.isAtStartOfLine() &&
|
|
peekToken().is(tok::code_complete) &&
|
|
Tok.getLoc().getAdvancedLoc(1) == peekToken().getLoc()) {
|
|
consumeToken();
|
|
if (CodeCompletion)
|
|
CodeCompletion->completeAfterPoundDirective();
|
|
consumeToken(tok::code_complete);
|
|
DeclResult = makeParserCodeCompletionResult<Decl>();
|
|
break;
|
|
}
|
|
LLVM_FALLTHROUGH;
|
|
|
|
case tok::pound_if:
|
|
case tok::pound_sourceLocation:
|
|
case tok::pound_line:
|
|
case tok::pound_warning:
|
|
case tok::pound_error:
|
|
// We see some attributes right before these pounds.
|
|
// TODO: Emit dedicated errors for them.
|
|
LLVM_FALLTHROUGH;
|
|
|
|
// Obvious nonsense.
|
|
default:
|
|
|
|
if (Tok.isContextualKeyword("actor") && peekToken().is(tok::identifier)) {
|
|
Tok.setKind(tok::contextual_keyword);
|
|
DeclParsingContext.setCreateSyntax(SyntaxKind::ClassDecl);
|
|
DeclResult = parseDeclClass(Flags, Attributes);
|
|
break;
|
|
}
|
|
|
|
if (Flags.contains(PD_HasContainerType) &&
|
|
IsAtStartOfLineOrPreviousHadSemi) {
|
|
|
|
// Emit diagnostics if we meet an identifier/operator where a declaration
|
|
// is expected, perhaps the user forgot the 'func' or 'var' keyword.
|
|
//
|
|
// Must not confuse it with trailing closure syntax, so we only
|
|
// recover in contexts where there can be no statements.
|
|
|
|
const bool IsProbablyVarDecl =
|
|
Tok.isIdentifierOrUnderscore() &&
|
|
peekToken().isAny(tok::colon, tok::equal, tok::comma);
|
|
|
|
const bool IsProbablyTupleDecl =
|
|
Tok.is(tok::l_paren) && peekToken().isIdentifierOrUnderscore();
|
|
|
|
if (IsProbablyVarDecl || IsProbablyTupleDecl) {
|
|
|
|
DescriptiveDeclKind DescriptiveKind;
|
|
|
|
switch (StaticSpelling) {
|
|
case StaticSpellingKind::None:
|
|
DescriptiveKind = DescriptiveDeclKind::Property;
|
|
break;
|
|
case StaticSpellingKind::KeywordStatic:
|
|
DescriptiveKind = DescriptiveDeclKind::StaticProperty;
|
|
break;
|
|
case StaticSpellingKind::KeywordClass:
|
|
llvm_unreachable("kw_class is only parsed as a modifier if it's "
|
|
"followed by a keyword");
|
|
}
|
|
|
|
diagnose(Tok.getLoc(), diag::expected_keyword_in_decl, "var",
|
|
DescriptiveKind)
|
|
.fixItInsert(Tok.getLoc(), "var ");
|
|
parseLetOrVar(/*HasLetOrVarKeyword=*/false);
|
|
break;
|
|
}
|
|
|
|
const bool IsProbablyFuncDecl =
|
|
Tok.isIdentifierOrUnderscore() || Tok.isAnyOperator();
|
|
|
|
if (IsProbablyFuncDecl) {
|
|
|
|
DescriptiveDeclKind DescriptiveKind;
|
|
|
|
if (Tok.isAnyOperator()) {
|
|
DescriptiveKind = DescriptiveDeclKind::OperatorFunction;
|
|
} else {
|
|
switch (StaticSpelling) {
|
|
case StaticSpellingKind::None:
|
|
DescriptiveKind = DescriptiveDeclKind::Method;
|
|
break;
|
|
case StaticSpellingKind::KeywordStatic:
|
|
DescriptiveKind = DescriptiveDeclKind::StaticMethod;
|
|
break;
|
|
case StaticSpellingKind::KeywordClass:
|
|
llvm_unreachable("kw_class is only parsed as a modifier if it's "
|
|
"followed by a keyword");
|
|
}
|
|
}
|
|
|
|
diagnose(Tok.getLoc(), diag::expected_keyword_in_decl, "func",
|
|
DescriptiveKind)
|
|
.fixItInsert(Tok.getLoc(), "func ");
|
|
parseFunc(/*HasFuncKeyword=*/false);
|
|
break;
|
|
}
|
|
}
|
|
|
|
diagnose(Tok, diag::expected_decl);
|
|
|
|
if (CurDeclContext) {
|
|
if (auto nominal = dyn_cast<NominalTypeDecl>(CurDeclContext)) {
|
|
diagnose(nominal->getLoc(), diag::note_in_decl_extension, false,
|
|
nominal->createNameRef());
|
|
} else if (auto extension = dyn_cast<ExtensionDecl>(CurDeclContext)) {
|
|
if (auto repr = extension->getExtendedTypeRepr()) {
|
|
if (auto idRepr = dyn_cast<IdentTypeRepr>(repr)) {
|
|
diagnose(extension->getLoc(), diag::note_in_decl_extension, true,
|
|
idRepr->getComponentRange().front()->getNameRef());
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
if (DeclResult.isParseErrorOrHasCompletion() && Tok.is(tok::code_complete)) {
|
|
if (MayNeedOverrideCompletion && CodeCompletion) {
|
|
// If we need to complete an override, collect the keywords already
|
|
// specified so that we do not duplicate them in code completion
|
|
// strings.
|
|
SmallVector<StringRef, 3> Keywords;
|
|
SourceLoc introducerLoc;
|
|
switch (OrigTok.getKind()) {
|
|
case tok::kw_func:
|
|
case tok::kw_subscript:
|
|
case tok::kw_var:
|
|
case tok::kw_let:
|
|
case tok::kw_typealias:
|
|
Keywords.push_back(OrigTok.getText());
|
|
introducerLoc = OrigTok.getLoc();
|
|
break;
|
|
default:
|
|
// Other tokens are already accounted for.
|
|
break;
|
|
}
|
|
if (StaticSpelling == StaticSpellingKind::KeywordStatic) {
|
|
Keywords.push_back(getTokenText(tok::kw_static));
|
|
} else if (StaticSpelling == StaticSpellingKind::KeywordClass) {
|
|
Keywords.push_back(getTokenText(tok::kw_class));
|
|
}
|
|
for (auto attr : Attributes) {
|
|
Keywords.push_back(attr->getAttrName());
|
|
}
|
|
CodeCompletion->completeNominalMemberBeginning(Keywords,
|
|
introducerLoc);
|
|
}
|
|
|
|
DeclResult = makeParserCodeCompletionStatus();
|
|
consumeToken(tok::code_complete);
|
|
}
|
|
|
|
if (AttrStatus.hasCodeCompletion() || DeclResult.hasCodeCompletion()) {
|
|
if (isCodeCompletionFirstPass() &&
|
|
!CurDeclContext->isModuleScopeContext() &&
|
|
!isa<TopLevelCodeDecl>(CurDeclContext) &&
|
|
!isa<AbstractClosureExpr>(CurDeclContext)) {
|
|
// Only consume non-toplevel decls.
|
|
consumeDecl(BeginParserPosition, Flags, /*IsTopLevel=*/false);
|
|
|
|
return makeParserError();
|
|
}
|
|
if (AttrStatus.hasCodeCompletion() && CodeCompletion) {
|
|
Optional<DeclKind> DK;
|
|
if (DeclResult.isNonNull())
|
|
DK = DeclResult.get()->getKind();
|
|
CodeCompletion->setAttrTargetDeclKind(DK);
|
|
}
|
|
DeclResult.setHasCodeCompletionAndIsError();
|
|
if (isCodeCompletionFirstPass())
|
|
return DeclResult;
|
|
}
|
|
|
|
if (DeclResult.isNonNull()) {
|
|
Decl *D = DeclResult.get();
|
|
if (!HandlerAlreadyCalled)
|
|
Handler(D);
|
|
setOriginalDeclarationForDifferentiableAttributes(D->getAttrs(), D);
|
|
}
|
|
|
|
if (!DeclResult.isParseErrorOrHasCompletion()) {
|
|
// If we parsed 'class' or 'static', but didn't handle it above, complain
|
|
// about it.
|
|
if (StaticLoc.isValid())
|
|
diagnose(DeclResult.get()->getLoc(), diag::decl_not_static,
|
|
StaticSpelling)
|
|
.fixItRemove(SourceRange(StaticLoc));
|
|
}
|
|
|
|
return DeclResult;
|
|
}
|
|
|
|
/// Determine the declaration parsing options to use when parsing the members
|
|
/// of the given context.
|
|
static Parser::ParseDeclOptions getMemberParseDeclOptions(
|
|
IterableDeclContext *idc) {
|
|
using ParseDeclOptions = Parser::ParseDeclOptions;
|
|
|
|
auto decl = idc->getDecl();
|
|
switch (decl->getKind()) {
|
|
case DeclKind::Extension:
|
|
return ParseDeclOptions(
|
|
Parser::PD_HasContainerType | Parser::PD_InExtension);
|
|
case DeclKind::Enum:
|
|
return ParseDeclOptions(
|
|
Parser::PD_HasContainerType | Parser::PD_AllowEnumElement |
|
|
Parser::PD_InEnum);
|
|
|
|
case DeclKind::Protocol:
|
|
return ParseDeclOptions(
|
|
Parser::PD_HasContainerType | Parser::PD_DisallowInit |
|
|
Parser::PD_InProtocol);
|
|
|
|
case DeclKind::Class:
|
|
return ParseDeclOptions(
|
|
Parser::PD_HasContainerType | Parser::PD_AllowDestructor |
|
|
Parser::PD_InClass);
|
|
|
|
case DeclKind::Struct:
|
|
return ParseDeclOptions(Parser::PD_HasContainerType | Parser::PD_InStruct);
|
|
|
|
default:
|
|
llvm_unreachable("Bad iterable decl context kinds.");
|
|
}
|
|
}
|
|
|
|
std::pair<std::vector<Decl *>, Optional<Fingerprint>>
|
|
Parser::parseDeclListDelayed(IterableDeclContext *IDC) {
|
|
Decl *D = const_cast<Decl*>(IDC->getDecl());
|
|
DeclContext *DC = cast<DeclContext>(D);
|
|
SourceRange BodyRange;
|
|
if (auto ext = dyn_cast<ExtensionDecl>(IDC)) {
|
|
BodyRange = ext->getBraces();
|
|
} else {
|
|
auto *ntd = cast<NominalTypeDecl>(IDC);
|
|
BodyRange = ntd->getBraces();
|
|
}
|
|
|
|
if (BodyRange.isInvalid()) {
|
|
assert(D->isImplicit());
|
|
return {std::vector<Decl *>(), None};
|
|
}
|
|
|
|
auto BeginParserPosition = getParserPosition(BodyRange.Start,
|
|
/*previousLoc*/ SourceLoc());
|
|
auto EndLexerState = L->getStateForEndOfTokenLoc(BodyRange.End);
|
|
|
|
// ParserPositionRAII needs a primed parser to restore to.
|
|
if (Tok.is(tok::NUM_TOKENS))
|
|
consumeTokenWithoutFeedingReceiver();
|
|
|
|
// Ensure that we restore the parser state at exit.
|
|
ParserPositionRAII PPR(*this);
|
|
|
|
// Create a lexer that cannot go past the end state.
|
|
Lexer LocalLex(*L, BeginParserPosition.LS, EndLexerState);
|
|
|
|
// Temporarily swap out the parser's current lexer with our new one.
|
|
llvm::SaveAndRestore<Lexer *> T(L, &LocalLex);
|
|
|
|
// Rewind to the start of the member list, which is a '{' in well-formed
|
|
// code.
|
|
restoreParserPosition(BeginParserPosition);
|
|
|
|
// If there is no left brace, then return an empty list of declarations;
|
|
// we will have already diagnosed this.
|
|
if (!Tok.is(tok::l_brace))
|
|
return {std::vector<Decl *>(), None};
|
|
|
|
ContextChange CC(*this, DC);
|
|
SourceLoc LBLoc = consumeToken(tok::l_brace);
|
|
(void)LBLoc;
|
|
assert(LBLoc == BodyRange.Start);
|
|
SourceLoc RBLoc;
|
|
Diag<> Id;
|
|
switch (D->getKind()) {
|
|
case DeclKind::Extension: Id = diag::expected_rbrace_extension; break;
|
|
case DeclKind::Enum: Id = diag::expected_rbrace_enum; break;
|
|
case DeclKind::Protocol: Id = diag::expected_rbrace_protocol; break;
|
|
case DeclKind::Class: Id = diag::expected_rbrace_class; break;
|
|
case DeclKind::Struct: Id = diag::expected_rbrace_struct; break;
|
|
default:
|
|
llvm_unreachable("Bad iterable decl context kinds.");
|
|
}
|
|
bool hadError = false;
|
|
ParseDeclOptions Options = getMemberParseDeclOptions(IDC);
|
|
return parseDeclList(LBLoc, RBLoc, Id, Options, IDC, hadError);
|
|
}
|
|
|
|
/// Parse an 'import' declaration, doing no token skipping on error.
|
|
///
|
|
/// \verbatim
|
|
/// decl-import:
|
|
/// 'import' attribute-list import-kind? import-path
|
|
/// import-kind:
|
|
/// 'typealias'
|
|
/// 'struct'
|
|
/// 'class'
|
|
/// 'enum'
|
|
/// 'protocol'
|
|
/// 'var'
|
|
/// 'func'
|
|
/// import-path:
|
|
/// any-identifier ('.' any-identifier)*
|
|
/// \endverbatim
|
|
ParserResult<ImportDecl> Parser::parseDeclImport(ParseDeclOptions Flags,
|
|
DeclAttributes &Attributes) {
|
|
SourceLoc ImportLoc = consumeToken(tok::kw_import);
|
|
DebuggerContextChange DCC (*this);
|
|
|
|
if (!CodeCompletion && !DCC.movedToTopLevel() && !(Flags & PD_AllowTopLevel)) {
|
|
diagnose(ImportLoc, diag::decl_inner_scope);
|
|
return nullptr;
|
|
}
|
|
|
|
ImportKind Kind = ImportKind::Module;
|
|
SourceLoc KindLoc;
|
|
if (Tok.isKeyword()) {
|
|
switch (Tok.getKind()) {
|
|
case tok::kw_typealias:
|
|
Kind = ImportKind::Type;
|
|
break;
|
|
case tok::kw_struct:
|
|
Kind = ImportKind::Struct;
|
|
break;
|
|
case tok::kw_class:
|
|
Kind = ImportKind::Class;
|
|
break;
|
|
case tok::kw_enum:
|
|
Kind = ImportKind::Enum;
|
|
break;
|
|
case tok::kw_protocol:
|
|
Kind = ImportKind::Protocol;
|
|
break;
|
|
case tok::kw_var:
|
|
case tok::kw_let:
|
|
Kind = ImportKind::Var;
|
|
break;
|
|
case tok::kw_func:
|
|
Kind = ImportKind::Func;
|
|
break;
|
|
default:
|
|
diagnose(Tok, diag::expected_identifier_in_decl, "import");
|
|
diagnose(Tok, diag::keyword_cant_be_identifier, Tok.getText());
|
|
diagnose(Tok, diag::backticks_to_escape);
|
|
return nullptr;
|
|
}
|
|
KindLoc = consumeToken();
|
|
}
|
|
|
|
ImportPath::Builder importPath;
|
|
bool HasNext;
|
|
do {
|
|
SyntaxParsingContext AccessCompCtx(SyntaxContext,
|
|
SyntaxKind::AccessPathComponent);
|
|
if (Tok.is(tok::code_complete)) {
|
|
consumeToken();
|
|
if (CodeCompletion) {
|
|
CodeCompletion->completeImportDecl(importPath);
|
|
}
|
|
return makeParserCodeCompletionStatus();
|
|
}
|
|
importPath.push_back(Identifier(), Tok.getLoc());
|
|
if (parseAnyIdentifier(importPath.back().Item,
|
|
/*diagnoseDollarPrefix=*/false,
|
|
diag::expected_identifier_in_decl, "import"))
|
|
return nullptr;
|
|
HasNext = consumeIf(tok::period);
|
|
} while (HasNext);
|
|
|
|
// Collect all access path components to an import path.
|
|
SyntaxContext->collectNodesInPlace(SyntaxKind::AccessPath);
|
|
|
|
if (Tok.is(tok::code_complete)) {
|
|
// We omit the code completion token if it immediately follows the module
|
|
// identifiers.
|
|
auto BufferId = SourceMgr.getCodeCompletionBufferID();
|
|
auto IdEndOffset = SourceMgr.getLocOffsetInBuffer(importPath.back().Loc,
|
|
BufferId) + importPath.back().Item.str().size();
|
|
auto CCTokenOffset = SourceMgr.getLocOffsetInBuffer(SourceMgr.
|
|
getCodeCompletionLoc(), BufferId);
|
|
if (IdEndOffset == CCTokenOffset) {
|
|
consumeToken();
|
|
}
|
|
}
|
|
|
|
if (Kind != ImportKind::Module && importPath.size() == 1) {
|
|
diagnose(importPath.front().Loc, diag::decl_expected_module_name);
|
|
return nullptr;
|
|
}
|
|
|
|
// Look up if the imported module is being aliased via -module-alias,
|
|
// and check that the module alias appeared in source files instead of
|
|
// its corresponding real name
|
|
auto parsedModuleID = importPath.get().front().Item;
|
|
if (Context.getRealModuleName(parsedModuleID, ASTContext::ModuleAliasLookupOption::realNameFromAlias).empty()) {
|
|
// If reached here, it means the parsed module name is a real module name
|
|
// which appeared in the source file; only a module alias should be allowed
|
|
auto aliasName = Context.getRealModuleName(parsedModuleID, ASTContext::ModuleAliasLookupOption::aliasFromRealName);
|
|
diagnose(importPath.front().Loc, diag::expected_module_alias,
|
|
parsedModuleID, aliasName)
|
|
.fixItReplace(importPath.front().Loc, aliasName.str());
|
|
return nullptr;
|
|
}
|
|
|
|
auto *ID = ImportDecl::create(Context, CurDeclContext, ImportLoc, Kind,
|
|
KindLoc, importPath.get());
|
|
ID->getAttrs() = Attributes;
|
|
return DCC.fixupParserResult(ID);
|
|
}
|
|
|
|
/// Parse an inheritance clause.
|
|
///
|
|
/// \verbatim
|
|
/// inheritance:
|
|
/// ':' inherited (',' inherited)*
|
|
///
|
|
/// inherited:
|
|
/// 'class'
|
|
/// type-identifier
|
|
/// \endverbatim
|
|
ParserStatus Parser::parseInheritance(
|
|
SmallVectorImpl<InheritedEntry> &Inherited,
|
|
bool allowClassRequirement, bool allowAnyObject) {
|
|
SyntaxParsingContext InheritanceContext(SyntaxContext,
|
|
SyntaxKind::TypeInheritanceClause);
|
|
|
|
consumeToken(tok::colon);
|
|
|
|
SyntaxParsingContext TypeListContext(SyntaxContext,
|
|
SyntaxKind::InheritedTypeList);
|
|
SourceLoc classRequirementLoc;
|
|
|
|
ParserStatus Status;
|
|
SourceLoc prevComma;
|
|
bool HasNextType;
|
|
do {
|
|
SyntaxParsingContext TypeContext(SyntaxContext, SyntaxKind::InheritedType);
|
|
SWIFT_DEFER {
|
|
// Check for a ',', which indicates that there are more protocols coming.
|
|
HasNextType = consumeIf(tok::comma, prevComma);
|
|
};
|
|
// Parse the 'class' keyword for a class requirement.
|
|
if (Tok.is(tok::kw_class)) {
|
|
SyntaxParsingContext ClassTypeContext(SyntaxContext,
|
|
SyntaxKind::ClassRestrictionType);
|
|
// If we aren't allowed to have a class requirement here, complain.
|
|
auto classLoc = consumeToken();
|
|
if (!allowClassRequirement) {
|
|
diagnose(classLoc, diag::unexpected_class_constraint);
|
|
|
|
// Note that it makes no sense to suggest fixing
|
|
// 'struct S : class' to 'struct S : AnyObject' for
|
|
// example; in that case we just complain about
|
|
// 'class' being invalid here.
|
|
if (allowAnyObject) {
|
|
diagnose(classLoc, diag::suggest_anyobject)
|
|
.fixItReplace(classLoc, "AnyObject");
|
|
}
|
|
continue;
|
|
}
|
|
|
|
// If we already saw a class requirement, complain.
|
|
if (classRequirementLoc.isValid()) {
|
|
diagnose(classLoc, diag::redundant_class_requirement)
|
|
.highlight(classRequirementLoc)
|
|
.fixItRemove(SourceRange(prevComma, classLoc));
|
|
continue;
|
|
}
|
|
|
|
// If the class requirement was not the first requirement, complain.
|
|
if (!Inherited.empty()) {
|
|
SourceLoc properLoc = Inherited[0].getSourceRange().Start;
|
|
diagnose(classLoc, diag::late_class_requirement)
|
|
.fixItInsert(properLoc, "class, ")
|
|
.fixItRemove(SourceRange(prevComma, classLoc));
|
|
}
|
|
|
|
// Record the location of the 'class' keyword.
|
|
classRequirementLoc = classLoc;
|
|
|
|
// Add 'AnyObject' to the inherited list.
|
|
Inherited.push_back(
|
|
InheritedEntry(
|
|
new (Context) SimpleIdentTypeRepr(
|
|
DeclNameLoc(classLoc),
|
|
DeclNameRef(Context.getIdentifier("AnyObject")))));
|
|
continue;
|
|
}
|
|
|
|
auto ParsedTypeResult = parseType();
|
|
Status |= ParsedTypeResult;
|
|
|
|
// Record the type if its a single type.
|
|
if (ParsedTypeResult.isNonNull())
|
|
Inherited.push_back(InheritedEntry(ParsedTypeResult.get()));
|
|
} while (HasNextType);
|
|
|
|
return Status;
|
|
}
|
|
|
|
static ParserStatus
|
|
parseIdentifierDeclName(Parser &P, Identifier &Result, SourceLoc &Loc,
|
|
StringRef DeclKindName,
|
|
llvm::function_ref<bool(const Token &)> canRecover) {
|
|
if (P.Tok.is(tok::identifier)) {
|
|
Loc = P.consumeIdentifier(Result, /*diagnoseDollarPrefix=*/true);
|
|
|
|
// We parsed an identifier for the declaration. If we see another
|
|
// identifier, it might've been a single identifier that got broken by a
|
|
// space or newline accidentally.
|
|
if (P.Tok.isIdentifierOrUnderscore() && !P.Tok.isContextualDeclKeyword())
|
|
P.diagnoseConsecutiveIDs(Result.str(), Loc, DeclKindName);
|
|
|
|
// Return success anyway
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
P.checkForInputIncomplete();
|
|
|
|
if (P.Tok.is(tok::integer_literal) || P.Tok.is(tok::floating_literal) ||
|
|
(P.Tok.is(tok::unknown) && isdigit(P.Tok.getText()[0]))) {
|
|
// Using numbers for identifiers is a common error for beginners, so it's
|
|
// worth handling this in a special way.
|
|
P.diagnose(P.Tok, diag::number_cant_start_decl_name, DeclKindName);
|
|
|
|
// Pretend this works as an identifier, which shouldn't be observable since
|
|
// actual uses of it will hit random other errors, e.g. `1()` won't be
|
|
// callable.
|
|
Result = P.Context.getIdentifier(P.Tok.getText());
|
|
Loc = P.Tok.getLoc();
|
|
P.consumeToken();
|
|
|
|
// We recovered, so this is a success.
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
if (P.Tok.isKeyword()) {
|
|
P.diagnose(P.Tok, diag::keyword_cant_be_identifier, P.Tok.getText());
|
|
P.diagnose(P.Tok, diag::backticks_to_escape)
|
|
.fixItReplace(P.Tok.getLoc(), "`" + P.Tok.getText().str() + "`");
|
|
|
|
// Recover if the next token is one of the expected tokens.
|
|
if (canRecover(P.peekToken())) {
|
|
llvm::SmallString<32> Name(P.Tok.getText());
|
|
// Append an invalid character so that nothing can resolve to this name.
|
|
Name += "#";
|
|
Result = P.Context.getIdentifier(Name.str());
|
|
Loc = P.Tok.getLoc();
|
|
P.consumeToken();
|
|
// Return success because we recovered.
|
|
return makeParserSuccess();
|
|
}
|
|
return makeParserError();
|
|
}
|
|
|
|
// If there is expected tokens after the code completion token, just eat the
|
|
// code completion token. We don't need code completion here.
|
|
// E.g.:
|
|
// 'func' <completion> ('('|'<')
|
|
// 'typealias' <completion> ('='|'<')
|
|
// If there's no expected token after the completion, override completion may
|
|
// kicks in. So leave the token here.
|
|
// E.g.
|
|
// 'func' <completion>
|
|
// 'init' <completion>
|
|
if (P.Tok.is(tok::code_complete) && canRecover(P.peekToken())) {
|
|
P.consumeToken(tok::code_complete);
|
|
return makeParserCodeCompletionStatus();
|
|
}
|
|
|
|
P.diagnose(P.Tok, diag::expected_identifier_in_decl, DeclKindName);
|
|
return makeParserError();
|
|
}
|
|
|
|
/// Add a fix-it to remove the space in consecutive identifiers.
|
|
/// Add a camel-cased option if it is different than the first option.
|
|
void Parser::diagnoseConsecutiveIDs(StringRef First, SourceLoc FirstLoc,
|
|
StringRef DeclKindName) {
|
|
assert(Tok.isAny(tok::identifier, tok::kw__));
|
|
|
|
diagnose(Tok, diag::repeated_identifier, DeclKindName);
|
|
auto Second = Tok.getText();
|
|
auto SecondLoc = consumeToken();
|
|
|
|
SourceRange FixRange(FirstLoc, SecondLoc);
|
|
// Provide two fix-its: a direct concatenation of the two identifiers
|
|
// and a camel-cased version.
|
|
//
|
|
auto DirectConcatenation = First.str() + Second.str();
|
|
diagnose(SecondLoc, diag::join_identifiers)
|
|
.fixItReplace(FixRange, DirectConcatenation);
|
|
|
|
SmallString<8> CapitalizedScratch;
|
|
auto Capitalized = camel_case::toSentencecase(Second,
|
|
CapitalizedScratch);
|
|
if (Capitalized != Second) {
|
|
auto CamelCaseConcatenation = First.str() + Capitalized.str();
|
|
diagnose(SecondLoc, diag::join_identifiers_camel_case)
|
|
.fixItReplace(FixRange, CamelCaseConcatenation);
|
|
}
|
|
}
|
|
|
|
/// Parse a Decl item in decl list.
|
|
ParserStatus Parser::parseDeclItem(bool &PreviousHadSemi,
|
|
ParseDeclOptions Options,
|
|
llvm::function_ref<void(Decl*)> handler) {
|
|
if (Tok.is(tok::semi)) {
|
|
// Consume ';' without preceding decl.
|
|
diagnose(Tok, diag::unexpected_separator, ";")
|
|
.fixItRemove(Tok.getLoc());
|
|
consumeToken();
|
|
// Return success because we already recovered.
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
// If the previous declaration didn't have a semicolon and this new
|
|
// declaration doesn't start a line, complain.
|
|
const bool IsAtStartOfLineOrPreviousHadSemi =
|
|
PreviousHadSemi || Tok.isAtStartOfLine() || Tok.is(tok::unknown);
|
|
if (!IsAtStartOfLineOrPreviousHadSemi) {
|
|
auto endOfPrevious = getEndOfPreviousLoc();
|
|
diagnose(endOfPrevious, diag::declaration_same_line_without_semi)
|
|
.fixItInsert(endOfPrevious, ";");
|
|
}
|
|
|
|
SyntaxParsingContext DeclContext(SyntaxContext,
|
|
SyntaxKind::MemberDeclListItem);
|
|
|
|
if (Tok.isAny(tok::pound_sourceLocation, tok::pound_line)) {
|
|
auto LineDirectiveStatus = parseLineDirective(Tok.is(tok::pound_line));
|
|
if (LineDirectiveStatus.isErrorOrHasCompletion())
|
|
skipUntilDeclRBrace(tok::semi, tok::pound_endif);
|
|
return LineDirectiveStatus;
|
|
}
|
|
|
|
ParserResult<Decl> Result;
|
|
if (loadCurrentSyntaxNodeFromCache()) {
|
|
return ParserStatus();
|
|
}
|
|
Result = parseDecl(Options, IsAtStartOfLineOrPreviousHadSemi, handler);
|
|
if (Result.isParseErrorOrHasCompletion())
|
|
skipUntilDeclRBrace(tok::semi, tok::pound_endif);
|
|
SourceLoc SemiLoc;
|
|
PreviousHadSemi = consumeIf(tok::semi, SemiLoc);
|
|
if (PreviousHadSemi && Result.isNonNull())
|
|
Result.get()->TrailingSemiLoc = SemiLoc;
|
|
return Result;
|
|
}
|
|
|
|
bool Parser::parseMemberDeclList(SourceLoc &LBLoc, SourceLoc &RBLoc,
|
|
Diag<> LBraceDiag, Diag<> RBraceDiag,
|
|
IterableDeclContext *IDC) {
|
|
if (parseToken(tok::l_brace, LBLoc, LBraceDiag)) {
|
|
LBLoc = RBLoc = PreviousLoc;
|
|
|
|
// Cache the empty result to prevent delayed parsing.
|
|
Context.evaluator.cacheOutput(
|
|
ParseMembersRequest{IDC}, FingerprintAndMembers{None, {}});
|
|
return true;
|
|
}
|
|
|
|
// Record '{' '}' to the current hash, nothing else.
|
|
recordTokenHash("}");
|
|
llvm::SaveAndRestore<Optional<StableHasher>> T(CurrentTokenHash, None);
|
|
|
|
bool HasOperatorDeclarations;
|
|
bool HasNestedClassDeclarations;
|
|
|
|
if (canDelayMemberDeclParsing(HasOperatorDeclarations,
|
|
HasNestedClassDeclarations)) {
|
|
if (HasOperatorDeclarations)
|
|
IDC->setMaybeHasOperatorDeclarations();
|
|
if (HasNestedClassDeclarations)
|
|
IDC->setMaybeHasNestedClassDeclarations();
|
|
|
|
if (delayParsingDeclList(LBLoc, RBLoc, IDC))
|
|
return true;
|
|
} else {
|
|
// When forced to eagerly parse, do so and cache the results in the
|
|
// evaluator.
|
|
bool hadError = false;
|
|
ParseDeclOptions Options = getMemberParseDeclOptions(IDC);
|
|
auto membersAndHash =
|
|
parseDeclList(LBLoc, RBLoc, RBraceDiag, Options, IDC, hadError);
|
|
IDC->setMaybeHasOperatorDeclarations();
|
|
IDC->setMaybeHasNestedClassDeclarations();
|
|
Context.evaluator.cacheOutput(
|
|
ParseMembersRequest{IDC},
|
|
FingerprintAndMembers{
|
|
membersAndHash.second,
|
|
Context.AllocateCopy(llvm::makeArrayRef(membersAndHash.first))});
|
|
|
|
if (hadError)
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
/// Parse the members in a struct/class/enum/protocol/extension.
|
|
///
|
|
/// \verbatim
|
|
/// decl* '}'
|
|
/// \endverbatim
|
|
std::pair<std::vector<Decl *>, Optional<Fingerprint>>
|
|
Parser::parseDeclList(SourceLoc LBLoc, SourceLoc &RBLoc, Diag<> ErrorDiag,
|
|
ParseDeclOptions Options, IterableDeclContext *IDC,
|
|
bool &hadError) {
|
|
|
|
// Hash the type body separately.
|
|
llvm::SaveAndRestore<Optional<StableHasher>> MemberHashingScope{
|
|
CurrentTokenHash, StableHasher::defaultHasher()};
|
|
|
|
// Record '{' which has been consumed in callers.
|
|
recordTokenHash("{");
|
|
|
|
std::vector<Decl *> decls;
|
|
ParserStatus Status;
|
|
bool PreviousHadSemi = true;
|
|
{
|
|
SyntaxParsingContext ListContext(SyntaxContext, SyntaxKind::MemberDeclList);
|
|
while (Tok.isNot(tok::r_brace)) {
|
|
Status |= parseDeclItem(PreviousHadSemi, Options,
|
|
[&](Decl *D) { decls.push_back(D); });
|
|
if (Tok.isAny(tok::eof, tok::pound_endif, tok::pound_else,
|
|
tok::pound_elseif)) {
|
|
IsInputIncomplete = true;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
if (parseMatchingToken(tok::r_brace, RBLoc, ErrorDiag, LBLoc)) {
|
|
// Synthesize an r_brace syntax node if the token is absent
|
|
SyntaxContext->synthesize(tok::r_brace, RBLoc);
|
|
}
|
|
|
|
// Increase counter.
|
|
if (auto *stat = Context.Stats) {
|
|
++stat->getFrontendCounters().NumIterableDeclContextParsed;
|
|
}
|
|
// If we found the closing brace, then the caller should not care if there
|
|
// were errors while parsing inner decls, because we recovered.
|
|
if (RBLoc.isInvalid())
|
|
hadError = true;
|
|
|
|
// Clone the current hasher and extract a Fingerprint.
|
|
StableHasher currentHash{*CurrentTokenHash};
|
|
return std::make_pair(decls, Fingerprint{std::move(currentHash)});
|
|
}
|
|
|
|
bool Parser::canDelayMemberDeclParsing(bool &HasOperatorDeclarations,
|
|
bool &HasNestedClassDeclarations) {
|
|
// If explicitly disabled, respect the flag.
|
|
if (!isDelayedParsingEnabled())
|
|
return false;
|
|
// Recovering parser status later for #sourceLocation is not-trivial and
|
|
// it may not worth it.
|
|
if (InPoundLineEnvironment)
|
|
return false;
|
|
|
|
// Skip until the matching right curly bracket; if we find a pound directive,
|
|
// we can't lazily parse.
|
|
CancellableBacktrackingScope BackTrack(*this);
|
|
bool HasPoundDirective;
|
|
bool HasNestedTypeDeclarations;
|
|
skipUntilMatchingRBrace(*this,
|
|
HasPoundDirective,
|
|
HasOperatorDeclarations,
|
|
HasNestedClassDeclarations,
|
|
HasNestedTypeDeclarations);
|
|
if (!HasPoundDirective)
|
|
BackTrack.cancelBacktrack();
|
|
return !BackTrack.willBacktrack();
|
|
}
|
|
|
|
bool Parser::delayParsingDeclList(SourceLoc LBLoc, SourceLoc &RBLoc,
|
|
IterableDeclContext *IDC) {
|
|
bool error = false;
|
|
|
|
if (Tok.is(tok::r_brace)) {
|
|
RBLoc = consumeToken();
|
|
} else {
|
|
// Non-delayed parsing would set the RB location to the LB if it is missing,
|
|
// match that behaviour here
|
|
RBLoc = LBLoc;
|
|
error = true;
|
|
}
|
|
return error;
|
|
}
|
|
|
|
/// Parse an 'extension' declaration.
|
|
///
|
|
/// \verbatim
|
|
/// extension:
|
|
/// 'extension' attribute-list type inheritance? where-clause?
|
|
/// '{' decl* '}'
|
|
/// \endverbatim
|
|
ParserResult<ExtensionDecl>
|
|
Parser::parseDeclExtension(ParseDeclOptions Flags, DeclAttributes &Attributes) {
|
|
SourceLoc ExtensionLoc = consumeToken(tok::kw_extension);
|
|
|
|
DebuggerContextChange DCC (*this);
|
|
|
|
// Parse the type being extended.
|
|
ParserStatus status;
|
|
ParserResult<TypeRepr> extendedType = parseType(diag::extension_type_expected);
|
|
status |= extendedType;
|
|
|
|
// Parse optional inheritance clause.
|
|
SmallVector<InheritedEntry, 2> Inherited;
|
|
if (Tok.is(tok::colon))
|
|
status |= parseInheritance(Inherited,
|
|
/*allowClassRequirement=*/false,
|
|
/*allowAnyObject=*/false);
|
|
|
|
// Parse the optional where-clause.
|
|
TrailingWhereClause *trailingWhereClause = nullptr;
|
|
bool trailingWhereHadCodeCompletion = false;
|
|
if (Tok.is(tok::kw_where)) {
|
|
SourceLoc whereLoc, endLoc;
|
|
SmallVector<RequirementRepr, 4> requirements;
|
|
auto whereStatus = parseGenericWhereClause(whereLoc, endLoc, requirements);
|
|
if (whereStatus.hasCodeCompletion()) {
|
|
if (isCodeCompletionFirstPass())
|
|
return whereStatus;
|
|
trailingWhereHadCodeCompletion = true;
|
|
}
|
|
if (!requirements.empty()) {
|
|
trailingWhereClause =
|
|
TrailingWhereClause::create(Context, whereLoc, endLoc, requirements);
|
|
}
|
|
status |= whereStatus;
|
|
}
|
|
|
|
ExtensionDecl *ext = ExtensionDecl::create(Context, ExtensionLoc,
|
|
extendedType.getPtrOrNull(),
|
|
Context.AllocateCopy(Inherited),
|
|
CurDeclContext,
|
|
trailingWhereClause);
|
|
ext->getAttrs() = Attributes;
|
|
if (trailingWhereHadCodeCompletion && CodeCompletion)
|
|
CodeCompletion->setParsedDecl(ext);
|
|
|
|
SyntaxParsingContext BlockContext(SyntaxContext, SyntaxKind::MemberDeclBlock);
|
|
SourceLoc LBLoc, RBLoc;
|
|
|
|
{
|
|
ContextChange CC(*this, ext);
|
|
|
|
if (parseMemberDeclList(LBLoc, RBLoc,
|
|
diag::expected_lbrace_extension,
|
|
diag::expected_rbrace_extension,
|
|
ext))
|
|
status.setIsParseError();
|
|
|
|
// Don't propagate the code completion bit from members: we cannot help
|
|
// code completion inside a member decl, and our callers cannot do
|
|
// anything about it either. But propagate the error bit.
|
|
}
|
|
ext->setBraces({LBLoc, RBLoc});
|
|
if (!DCC.movedToTopLevel() && !(Flags & PD_AllowTopLevel)) {
|
|
diagnose(ExtensionLoc, diag::decl_inner_scope);
|
|
status.setIsParseError();
|
|
|
|
// Tell the type checker not to touch this extension.
|
|
ext->setInvalid();
|
|
}
|
|
|
|
return DCC.fixupParserResult(status, ext);
|
|
}
|
|
|
|
ParserResult<PoundDiagnosticDecl> Parser::parseDeclPoundDiagnostic() {
|
|
bool isError = Tok.is(tok::pound_error);
|
|
SyntaxParsingContext LocalContext(SyntaxContext,
|
|
isError ? SyntaxKind::PoundErrorDecl : SyntaxKind::PoundWarningDecl);
|
|
SourceLoc startLoc =
|
|
consumeToken(isError ? tok::pound_error : tok::pound_warning);
|
|
|
|
SourceLoc lParenLoc = Tok.getLoc();
|
|
bool hadLParen = consumeIf(tok::l_paren);
|
|
|
|
if (!Tok.is(tok::string_literal)) {
|
|
// Catch #warning(oops, forgot the quotes)
|
|
SourceLoc wordsStartLoc = Tok.getLoc();
|
|
|
|
skipUntilTokenOrEndOfLine(tok::r_paren);
|
|
|
|
SourceLoc wordsEndLoc = getEndOfPreviousLoc();
|
|
|
|
auto diag = diagnose(wordsStartLoc,
|
|
diag::pound_diagnostic_expected_string, isError);
|
|
if (wordsEndLoc != wordsStartLoc) {
|
|
diag.fixItInsert(wordsStartLoc, hadLParen ? "\"" : "(\"")
|
|
.fixItInsert(wordsEndLoc, Tok.is(tok::r_paren) ? "\"" : "\")");
|
|
}
|
|
|
|
// Consume the right paren to finish the decl, if it's there.
|
|
consumeIf(tok::r_paren);
|
|
|
|
return makeParserError();
|
|
}
|
|
|
|
auto string = parseExprStringLiteral();
|
|
if (string.isNull())
|
|
return makeParserError();
|
|
|
|
auto messageExpr = string.get();
|
|
|
|
SourceLoc rParenLoc = Tok.getLoc();
|
|
bool hadRParen = consumeIf(tok::r_paren);
|
|
|
|
if (!Tok.isAtStartOfLine() && Tok.isNot(tok::eof)) {
|
|
diagnose(Tok.getLoc(),
|
|
diag::extra_tokens_pound_diagnostic_directive, isError);
|
|
return makeParserError();
|
|
}
|
|
|
|
if (!hadLParen && !hadRParen) {
|
|
// Catch if the user forgot parentheses around the string, e.g.
|
|
// #warning "foo"
|
|
diagnose(lParenLoc, diag::pound_diagnostic_expected_parens, isError)
|
|
.highlight(messageExpr->getSourceRange())
|
|
.fixItInsert(messageExpr->getStartLoc(), "(")
|
|
.fixItInsertAfter(messageExpr->getEndLoc(), ")");
|
|
return makeParserError();
|
|
} else if (hadRParen && !hadLParen) {
|
|
// Catch if the user forgot a left paren before the string, e.g.
|
|
// #warning "foo")
|
|
diagnose(messageExpr->getStartLoc(), diag::pound_diagnostic_expected,
|
|
"(", isError)
|
|
.fixItInsert(messageExpr->getStartLoc(), "(");
|
|
return makeParserError();
|
|
} else if (hadLParen && !hadRParen) {
|
|
// Catch if the user forgot a right paren after the string, e.g.
|
|
// #warning("foo"
|
|
diagnose(messageExpr->getEndLoc(), diag::pound_diagnostic_expected,
|
|
")", isError)
|
|
.fixItInsertAfter(messageExpr->getEndLoc(), ")");
|
|
return makeParserError();
|
|
}
|
|
|
|
if (messageExpr->getKind() == ExprKind::InterpolatedStringLiteral) {
|
|
diagnose(messageExpr->getStartLoc(), diag::pound_diagnostic_interpolation,
|
|
isError)
|
|
.highlight(messageExpr->getSourceRange());
|
|
return makeParserError();
|
|
}
|
|
|
|
ParserStatus Status;
|
|
return makeParserResult(Status,
|
|
new (Context) PoundDiagnosticDecl(CurDeclContext, isError,
|
|
startLoc, rParenLoc,
|
|
cast<StringLiteralExpr>(messageExpr)));
|
|
}
|
|
|
|
ParserStatus Parser::parseLineDirective(bool isLine) {
|
|
SyntaxParsingContext PoundSourceLocation(SyntaxContext,
|
|
SyntaxKind::PoundSourceLocation);
|
|
SourceLoc Loc = consumeToken();
|
|
if (isLine) {
|
|
diagnose(Loc, diag::line_directive_style_deprecated)
|
|
.fixItReplace(Loc, "#sourceLocation");
|
|
}
|
|
bool WasInPoundLineEnvironment = InPoundLineEnvironment;
|
|
if (WasInPoundLineEnvironment) {
|
|
SourceMgr.closeVirtualFile(Loc);
|
|
InPoundLineEnvironment = false;
|
|
}
|
|
|
|
|
|
unsigned StartLine = 0;
|
|
Optional<StringRef> Filename;
|
|
if (!isLine) {
|
|
// #sourceLocation()
|
|
// #sourceLocation(file: "foo", line: 42)
|
|
if (parseToken(tok::l_paren, diag::sourceLocation_expected, "("))
|
|
return makeParserError();
|
|
|
|
// Handle the "reset" form.
|
|
if (consumeIf(tok::r_paren)) {
|
|
if (!WasInPoundLineEnvironment) {
|
|
diagnose(Tok, diag::unexpected_line_directive);
|
|
return makeParserError();
|
|
}
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
{
|
|
SyntaxParsingContext Args(SyntaxContext,
|
|
SyntaxKind::PoundSourceLocationArgs);
|
|
|
|
if (parseSpecificIdentifier("file", diag::sourceLocation_expected,
|
|
"file:") ||
|
|
parseToken(tok::colon, diag::sourceLocation_expected, ":"))
|
|
return makeParserError();
|
|
|
|
if (Tok.isNot(tok::string_literal)) {
|
|
diagnose(Tok, diag::expected_line_directive_name);
|
|
return makeParserError();
|
|
}
|
|
|
|
Filename =
|
|
getStringLiteralIfNotInterpolated(Loc, "'#sourceLocation'");
|
|
if (!Filename.hasValue())
|
|
return makeParserError();
|
|
SourceLoc filenameLoc = consumeToken(tok::string_literal);
|
|
SF.VirtualFilePaths.emplace_back(*Filename, filenameLoc);
|
|
|
|
if (parseToken(tok::comma, diag::sourceLocation_expected, ",") ||
|
|
parseSpecificIdentifier("line", diag::sourceLocation_expected,
|
|
"line:") ||
|
|
parseToken(tok::colon, diag::sourceLocation_expected, ":"))
|
|
return makeParserError();
|
|
|
|
if (Tok.isNot(tok::integer_literal)) {
|
|
diagnose(Tok, diag::expected_line_directive_number);
|
|
return makeParserError();
|
|
}
|
|
if (Tok.getText().getAsInteger(0, StartLine)) {
|
|
diagnose(Tok, diag::expected_line_directive_number);
|
|
return makeParserError();
|
|
}
|
|
if (StartLine == 0) {
|
|
diagnose(Tok, diag::line_directive_line_zero);
|
|
return makeParserError();
|
|
}
|
|
consumeToken(tok::integer_literal);
|
|
}
|
|
|
|
if (Tok.isNot(tok::r_paren)) {
|
|
diagnose(Tok, diag::sourceLocation_expected, ")");
|
|
return makeParserError();
|
|
}
|
|
} else { // Legacy #line syntax.
|
|
|
|
// #line\n returns to the main buffer.
|
|
if (Tok.isAtStartOfLine()) {
|
|
if (!WasInPoundLineEnvironment) {
|
|
diagnose(Tok, diag::unexpected_line_directive);
|
|
return makeParserError();
|
|
}
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
// #line 42 "file.swift"\n
|
|
if (Tok.isNot(tok::integer_literal)) {
|
|
diagnose(Tok, diag::expected_line_directive_number);
|
|
return makeParserError();
|
|
}
|
|
if (Tok.getText().getAsInteger(0, StartLine)) {
|
|
diagnose(Tok, diag::expected_line_directive_number);
|
|
return makeParserError();
|
|
}
|
|
if (StartLine == 0) {
|
|
diagnose(Tok, diag::line_directive_line_zero);
|
|
return makeParserError();
|
|
}
|
|
consumeToken(tok::integer_literal);
|
|
|
|
if (Tok.isNot(tok::string_literal)) {
|
|
diagnose(Tok, diag::expected_line_directive_name);
|
|
return makeParserError();
|
|
}
|
|
|
|
Filename = getStringLiteralIfNotInterpolated(Loc, "'#line'");
|
|
if (!Filename.hasValue())
|
|
return makeParserError();
|
|
}
|
|
|
|
const char *LastTokTextEnd = Tok.getText().end();
|
|
|
|
// Skip over trailing whitespace and a single \n to the start of the next
|
|
// line.
|
|
while (*LastTokTextEnd == ' ' || *LastTokTextEnd == '\t')
|
|
++LastTokTextEnd;
|
|
SourceLoc nextLineStartLoc = Lexer::getSourceLoc(LastTokTextEnd);
|
|
|
|
if (*LastTokTextEnd == '\n')
|
|
nextLineStartLoc = nextLineStartLoc.getAdvancedLoc(1);
|
|
else {
|
|
diagnose(Tok.getLoc(), diag::extra_tokens_line_directive);
|
|
return makeParserError();
|
|
}
|
|
|
|
int LineOffset =
|
|
StartLine - SourceMgr.getLineAndColumnInBuffer(nextLineStartLoc).first;
|
|
|
|
// Create a new virtual file for the region started by the #line marker.
|
|
bool isNewFile = SourceMgr.openVirtualFile(nextLineStartLoc,
|
|
Filename.getValue(), LineOffset);
|
|
assert(isNewFile);(void)isNewFile;
|
|
|
|
// Lexing of next token must be deferred until after virtual file setup.
|
|
consumeToken(isLine ? tok::string_literal : tok::r_paren);
|
|
|
|
InPoundLineEnvironment = true;
|
|
return makeParserSuccess();
|
|
}
|
|
|
|
/// Parse a typealias decl.
|
|
///
|
|
/// \verbatim
|
|
/// decl-typealias:
|
|
/// 'typealias' identifier generic-params? '=' type requirement-clause?
|
|
/// \endverbatim
|
|
ParserResult<TypeDecl> Parser::
|
|
parseDeclTypeAlias(Parser::ParseDeclOptions Flags, DeclAttributes &Attributes) {
|
|
ParserPosition startPosition = getParserPosition();
|
|
llvm::Optional<SyntaxParsingContext> TmpCtxt;
|
|
TmpCtxt.emplace(SyntaxContext);
|
|
TmpCtxt->setBackTracking();
|
|
|
|
SourceLoc TypeAliasLoc = consumeToken(tok::kw_typealias);
|
|
SourceLoc EqualLoc;
|
|
Identifier Id;
|
|
SourceLoc IdLoc;
|
|
ParserStatus Status;
|
|
|
|
Status |= parseIdentifierDeclName(
|
|
*this, Id, IdLoc, "typealias",
|
|
[](const Token &next) { return next.isAny(tok::colon, tok::equal); });
|
|
if (Status.isErrorOrHasCompletion()) {
|
|
TmpCtxt->setTransparent();
|
|
return Status;
|
|
}
|
|
|
|
DebuggerContextChange DCC(*this, Id, DeclKind::TypeAlias);
|
|
|
|
// Parse a generic parameter list if it is present.
|
|
GenericParamList *genericParams = nullptr;
|
|
if (startsWithLess(Tok)) {
|
|
auto Result = parseGenericParameters();
|
|
if (Result.hasCodeCompletion() && !CodeCompletion)
|
|
return makeParserCodeCompletionStatus();
|
|
genericParams = Result.getPtrOrNull();
|
|
|
|
if (!genericParams) {
|
|
// If the parser returned null, it is an already diagnosed parse error.
|
|
} else if (!genericParams->getRequirements().empty()) {
|
|
// Reject a where clause.
|
|
diagnose(genericParams->getWhereLoc(),
|
|
diag::associated_type_generic_parameter_list)
|
|
.highlight(genericParams->getWhereClauseSourceRange());
|
|
}
|
|
}
|
|
|
|
if (Flags.contains(PD_InProtocol) && !genericParams && !Tok.is(tok::equal)) {
|
|
TmpCtxt.reset();
|
|
// If we're in a protocol and don't see an '=' this looks like leftover Swift 2
|
|
// code intending to be an associatedtype.
|
|
backtrackToPosition(startPosition);
|
|
return parseDeclAssociatedType(Flags, Attributes);
|
|
}
|
|
TmpCtxt->setTransparent();
|
|
TmpCtxt.reset();
|
|
|
|
auto *TAD = new (Context) TypeAliasDecl(TypeAliasLoc, EqualLoc, Id, IdLoc,
|
|
genericParams, CurDeclContext);
|
|
setLocalDiscriminator(TAD);
|
|
ParserResult<TypeRepr> UnderlyingTy;
|
|
|
|
if (Tok.is(tok::colon) || Tok.is(tok::equal)) {
|
|
ContextChange CC(*this, TAD);
|
|
|
|
SyntaxParsingContext InitCtx(SyntaxContext,
|
|
SyntaxKind::TypeInitializerClause);
|
|
if (Tok.is(tok::colon)) {
|
|
// It is a common mistake to write "typealias A : Int" instead of = Int.
|
|
// Recognize this and produce a fixit.
|
|
diagnose(Tok, diag::expected_equal_in_typealias)
|
|
.fixItReplace(Tok.getLoc(), " = ");
|
|
EqualLoc = consumeToken(tok::colon);
|
|
} else {
|
|
EqualLoc = consumeToken(tok::equal);
|
|
}
|
|
|
|
UnderlyingTy = parseType(diag::expected_type_in_typealias);
|
|
TAD->setTypeEndLoc(PreviousLoc);
|
|
Status |= UnderlyingTy;
|
|
}
|
|
|
|
TAD->setUnderlyingTypeRepr(UnderlyingTy.getPtrOrNull());
|
|
TAD->getAttrs() = Attributes;
|
|
|
|
// Parse a 'where' clause if present.
|
|
if (Tok.is(tok::kw_where)) {
|
|
ContextChange CC(*this, TAD);
|
|
Status |= parseFreestandingGenericWhereClause(TAD);
|
|
}
|
|
|
|
if (UnderlyingTy.isNull()) {
|
|
// If there is an attempt to do code completion
|
|
// inside of typealias type, let's just return
|
|
// because we've seen required '=' token.
|
|
if (EqualLoc.isInvalid()) {
|
|
diagnose(Tok, diag::expected_equal_in_typealias);
|
|
Status.setIsParseError();
|
|
return Status;
|
|
}
|
|
}
|
|
|
|
return DCC.fixupParserResult(Status, TAD);
|
|
}
|
|
|
|
/// Parse an associatedtype decl.
|
|
///
|
|
/// \verbatim
|
|
/// decl-associatedtype:
|
|
/// 'associatedtype' identifier inheritance? ('=' type)? where-clause?
|
|
/// \endverbatim
|
|
|
|
ParserResult<TypeDecl> Parser::parseDeclAssociatedType(Parser::ParseDeclOptions Flags,
|
|
DeclAttributes &Attributes) {
|
|
SourceLoc AssociatedTypeLoc;
|
|
ParserStatus Status;
|
|
Identifier Id;
|
|
SourceLoc IdLoc;
|
|
|
|
// Look for 'typealias' here and diagnose a fixit because parseDeclTypeAlias can
|
|
// ask us to fix up leftover Swift 2 code intending to be an associatedtype.
|
|
if (Tok.is(tok::kw_typealias)) {
|
|
AssociatedTypeLoc = consumeToken(tok::kw_typealias);
|
|
diagnose(AssociatedTypeLoc, diag::typealias_inside_protocol_without_type)
|
|
.fixItReplace(AssociatedTypeLoc, "associatedtype");
|
|
} else {
|
|
AssociatedTypeLoc = consumeToken(tok::kw_associatedtype);
|
|
}
|
|
|
|
Status = parseIdentifierDeclName(
|
|
*this, Id, IdLoc, "associatedtype",
|
|
[](const Token &next) { return next.isAny(tok::colon, tok::equal); });
|
|
if (Status.isErrorOrHasCompletion())
|
|
return Status;
|
|
|
|
DebuggerContextChange DCC(*this, Id, DeclKind::AssociatedType);
|
|
|
|
// Reject generic parameters with a specific error.
|
|
if (startsWithLess(Tok)) {
|
|
if (auto genericParams = parseGenericParameters().getPtrOrNull()) {
|
|
diagnose(genericParams->getLAngleLoc(),
|
|
diag::associated_type_generic_parameter_list)
|
|
.fixItRemove(genericParams->getSourceRange());
|
|
}
|
|
}
|
|
|
|
// Parse optional inheritance clause.
|
|
// FIXME: Allow class requirements here.
|
|
SmallVector<InheritedEntry, 2> Inherited;
|
|
if (Tok.is(tok::colon))
|
|
Status |= parseInheritance(Inherited,
|
|
/*allowClassRequirement=*/false,
|
|
/*allowAnyObject=*/true);
|
|
|
|
ParserResult<TypeRepr> UnderlyingTy;
|
|
if (Tok.is(tok::equal)) {
|
|
SyntaxParsingContext InitContext(SyntaxContext,
|
|
SyntaxKind::TypeInitializerClause);
|
|
consumeToken(tok::equal);
|
|
UnderlyingTy = parseType(diag::expected_type_in_associatedtype);
|
|
Status |= UnderlyingTy;
|
|
if (UnderlyingTy.isNull())
|
|
return Status;
|
|
}
|
|
|
|
TrailingWhereClause *TrailingWhere = nullptr;
|
|
// Parse a 'where' clause if present.
|
|
if (Tok.is(tok::kw_where)) {
|
|
auto whereStatus = parseProtocolOrAssociatedTypeWhereClause(
|
|
TrailingWhere, /*isProtocol=*/false);
|
|
Status |= whereStatus;
|
|
if (whereStatus.hasCodeCompletion() && !CodeCompletion) {
|
|
// Trigger delayed parsing, no need to continue.
|
|
return whereStatus;
|
|
}
|
|
}
|
|
|
|
if (!Flags.contains(PD_InProtocol)) {
|
|
diagnose(AssociatedTypeLoc, diag::associatedtype_outside_protocol)
|
|
.fixItReplace(AssociatedTypeLoc, "typealias");
|
|
Status.setIsParseError();
|
|
return Status;
|
|
}
|
|
|
|
auto assocType = new (Context)
|
|
AssociatedTypeDecl(CurDeclContext, AssociatedTypeLoc, Id, IdLoc,
|
|
UnderlyingTy.getPtrOrNull(), TrailingWhere);
|
|
assocType->getAttrs() = Attributes;
|
|
if (!Inherited.empty())
|
|
assocType->setInherited(Context.AllocateCopy(Inherited));
|
|
return makeParserResult(Status, assocType);
|
|
}
|
|
|
|
/// This function creates an accessor function (with no body) for a computed
|
|
/// property or subscript.
|
|
static AccessorDecl *createAccessorFunc(SourceLoc DeclLoc,
|
|
ParameterList *param,
|
|
GenericParamList *GenericParams,
|
|
ParameterList *Indices,
|
|
SourceLoc StaticLoc,
|
|
Parser::ParseDeclOptions Flags,
|
|
AccessorKind Kind,
|
|
AbstractStorageDecl *storage,
|
|
Parser *P, SourceLoc AccessorKeywordLoc,
|
|
SourceLoc asyncLoc, SourceLoc throwsLoc) {
|
|
// First task, set up the value argument list. This is the "newValue" name
|
|
// (for setters) followed by the index list (for subscripts). For
|
|
// non-subscript getters, this degenerates down to "()".
|
|
//
|
|
// We put the 'newValue' argument before the subscript index list as a
|
|
// micro-optimization for Objective-C thunk generation.
|
|
ParameterList *ValueArg;
|
|
{
|
|
SmallVector<ParamDecl*, 2> ValueArgElements;
|
|
SourceLoc StartLoc, EndLoc;
|
|
if (param) {
|
|
assert(param->size() == 1 &&
|
|
"Should only have a single parameter in the list");
|
|
ValueArgElements.push_back(param->get(0));
|
|
StartLoc = param->getStartLoc();
|
|
EndLoc = param->getEndLoc();
|
|
}
|
|
|
|
if (Indices) {
|
|
// Create parameter declarations corresponding to each of the
|
|
// parameter declarations from the subscript declaration.
|
|
for (ParamDecl *storageParam : *Indices) {
|
|
// Clone the parameter. Do not clone the parameter type;
|
|
// this will be filled in by the type-checker.
|
|
auto accessorParam =
|
|
new (P->Context) ParamDecl(storageParam->getSpecifierLoc(),
|
|
storageParam->getArgumentNameLoc(),
|
|
storageParam->getArgumentName(),
|
|
storageParam->getNameLoc(),
|
|
storageParam->getName(),
|
|
P->CurDeclContext);
|
|
accessorParam->setVariadic(storageParam->isVariadic());
|
|
accessorParam->setAutoClosure(storageParam->isAutoClosure());
|
|
|
|
// The cloned parameter is implicit.
|
|
accessorParam->setImplicit();
|
|
|
|
// It has no default arguments; these will be always be taken
|
|
// from the subscript declaration.
|
|
accessorParam->setDefaultArgumentKind(DefaultArgumentKind::None);
|
|
|
|
ValueArgElements.push_back(accessorParam);
|
|
}
|
|
|
|
if (StartLoc.isInvalid()) {
|
|
StartLoc = Indices->getStartLoc();
|
|
EndLoc = Indices->getEndLoc();
|
|
}
|
|
}
|
|
|
|
ValueArg = ParameterList::create(P->Context, StartLoc, ValueArgElements,
|
|
EndLoc);
|
|
}
|
|
|
|
// Start the function.
|
|
auto *D = AccessorDecl::create(P->Context,
|
|
/*FIXME FuncLoc=*/DeclLoc,
|
|
AccessorKeywordLoc,
|
|
Kind, storage,
|
|
StaticLoc, StaticSpellingKind::None,
|
|
asyncLoc.isValid(), asyncLoc,
|
|
throwsLoc.isValid(), throwsLoc,
|
|
(GenericParams
|
|
? GenericParams->clone(P->CurDeclContext)
|
|
: nullptr),
|
|
ValueArg, Type(),
|
|
P->CurDeclContext);
|
|
|
|
return D;
|
|
}
|
|
|
|
static ParamDecl *createSetterAccessorArgument(SourceLoc nameLoc,
|
|
Identifier name,
|
|
AccessorKind accessorKind,
|
|
Parser &P) {
|
|
// Add the parameter. If no name was specified, the name defaults to
|
|
// 'value'.
|
|
bool isNameImplicit = name.empty();
|
|
if (isNameImplicit) {
|
|
const char *implName =
|
|
accessorKind == AccessorKind::DidSet ? "oldValue" : "newValue";
|
|
name = P.Context.getIdentifier(implName);
|
|
}
|
|
|
|
auto result = new (P.Context)
|
|
ParamDecl(SourceLoc(), SourceLoc(),
|
|
Identifier(), nameLoc, name, P.CurDeclContext);
|
|
|
|
if (isNameImplicit)
|
|
result->setImplicit();
|
|
|
|
return result;
|
|
}
|
|
|
|
/// Parse a "(value)" specifier for "set" or "willSet" if present. Create a
|
|
/// parameter list to represent the spelled argument or return null if none is
|
|
/// present.
|
|
static ParameterList *parseOptionalAccessorArgument(SourceLoc SpecifierLoc,
|
|
Parser &P,
|
|
AccessorKind Kind) {
|
|
// 'set' and 'willSet' have a (value) parameter, 'didSet' takes an (oldValue)
|
|
// parameter and 'get' and always takes a () parameter.
|
|
if (Kind != AccessorKind::Set && Kind != AccessorKind::WillSet &&
|
|
Kind != AccessorKind::DidSet)
|
|
return nullptr;
|
|
|
|
SourceLoc StartLoc, NameLoc, EndLoc;
|
|
Identifier Name;
|
|
|
|
// If the SpecifierLoc is invalid, then the caller just wants us to synthesize
|
|
// the default, not actually try to parse something.
|
|
if (SpecifierLoc.isValid() && P.Tok.is(tok::l_paren)) {
|
|
SyntaxParsingContext ParamCtx(P.SyntaxContext, SyntaxKind::AccessorParameter);
|
|
StartLoc = P.consumeToken(tok::l_paren);
|
|
if (P.Tok.isNot(tok::identifier)) {
|
|
P.diagnose(P.Tok, diag::expected_accessor_parameter_name,
|
|
Kind == AccessorKind::Set ? 0 :
|
|
Kind == AccessorKind::WillSet ? 1 : 2);
|
|
P.skipUntil(tok::r_paren, tok::l_brace);
|
|
if (P.Tok.is(tok::r_paren))
|
|
EndLoc = P.consumeToken();
|
|
else
|
|
EndLoc = StartLoc;
|
|
} else {
|
|
// We have a name.
|
|
NameLoc = P.consumeIdentifier(Name, /*diagnoseDollarPrefix=*/true);
|
|
|
|
auto DiagID =
|
|
Kind == AccessorKind::Set ? diag::expected_rparen_set_name :
|
|
Kind == AccessorKind::WillSet ? diag::expected_rparen_willSet_name :
|
|
diag::expected_rparen_didSet_name;
|
|
|
|
// Look for the closing ')'.
|
|
P.parseMatchingToken(tok::r_paren, EndLoc, DiagID, StartLoc);
|
|
}
|
|
}
|
|
|
|
if (Name.empty()) NameLoc = SpecifierLoc;
|
|
auto param = createSetterAccessorArgument(NameLoc, Name, Kind, P);
|
|
return ParameterList::create(P.Context, StartLoc, param, EndLoc);
|
|
}
|
|
|
|
bool Parser::skipBracedBlock(bool &HasNestedTypeDeclarations) {
|
|
SyntaxParsingContext disabled(SyntaxContext);
|
|
SyntaxContext->disable();
|
|
consumeToken(tok::l_brace);
|
|
|
|
// We don't care if a skipped function body contained any of these, so
|
|
// just ignore them.
|
|
bool HasPoundDirectives;
|
|
bool HasOperatorDeclarations;
|
|
bool HasNestedClassDeclarations;
|
|
|
|
unsigned OpenBraces = skipUntilMatchingRBrace(*this,
|
|
HasPoundDirectives,
|
|
HasOperatorDeclarations,
|
|
HasNestedClassDeclarations,
|
|
HasNestedTypeDeclarations);
|
|
if (consumeIf(tok::r_brace))
|
|
--OpenBraces;
|
|
return OpenBraces != 0;
|
|
}
|
|
|
|
void Parser::skipSILUntilSwiftDecl() {
|
|
// For now, create 'UnknownDecl' for all SIL declarations.
|
|
SyntaxParsingContext itemCtxt(SyntaxContext, SyntaxKind::CodeBlockItem);
|
|
SyntaxParsingContext declCtxt(SyntaxContext, SyntaxContextKind::Decl);
|
|
|
|
// Tell the lexer we're about to start lexing SIL.
|
|
Lexer::SILBodyRAII sbr(*L);
|
|
|
|
while (!Tok.is(tok::eof) && !isStartOfSwiftDecl()) {
|
|
// SIL pound dotted paths need to be skipped specially as they can contain
|
|
// decl keywords like 'subscript'.
|
|
if (consumeIf(tok::pound)) {
|
|
do {
|
|
consumeToken();
|
|
} while (consumeIf(tok::period));
|
|
continue;
|
|
}
|
|
|
|
// SIL types need to be skipped specially as they can contain attributes on
|
|
// tuples which can look like decl attributes.
|
|
if (consumeIf(tok::sil_dollar)) {
|
|
if (Tok.isAnyOperator() && Tok.getText().startswith("*")) {
|
|
consumeStartingCharacterOfCurrentToken();
|
|
}
|
|
(void)parseType();
|
|
continue;
|
|
}
|
|
skipSingle();
|
|
}
|
|
}
|
|
|
|
void Parser::skipAnyAttribute() {
|
|
consumeToken(tok::at_sign);
|
|
if (!Tok.is(tok::identifier))
|
|
return;
|
|
|
|
(void)canParseCustomAttribute();
|
|
}
|
|
|
|
/// Returns a descriptive name for the given accessor/addressor kind.
|
|
static StringRef getAccessorNameForDiagnostic(AccessorKind accessorKind,
|
|
bool article) {
|
|
switch (accessorKind) {
|
|
case AccessorKind::Get:
|
|
return article ? "a getter" : "getter";
|
|
case AccessorKind::Set:
|
|
return article ? "a setter" : "setter";
|
|
case AccessorKind::Address:
|
|
return article ? "an addressor" : "addressor";
|
|
case AccessorKind::MutableAddress:
|
|
return article ? "a mutable addressor" : "mutable addressor";
|
|
case AccessorKind::Read:
|
|
return article ? "a 'read' accessor" : "'read' accessor";
|
|
case AccessorKind::Modify:
|
|
return article ? "a 'modify' accessor" : "'modify' accessor";
|
|
case AccessorKind::WillSet:
|
|
return "'willSet'";
|
|
case AccessorKind::DidSet:
|
|
return "'didSet'";
|
|
}
|
|
llvm_unreachable("bad accessor kind");
|
|
}
|
|
|
|
static StringRef getAccessorNameForDiagnostic(AccessorDecl *accessor,
|
|
bool article) {
|
|
return getAccessorNameForDiagnostic(accessor->getAccessorKind(),
|
|
article);
|
|
}
|
|
|
|
static void diagnoseRedundantAccessors(Parser &P, SourceLoc loc,
|
|
AccessorKind accessorKind,
|
|
bool isSubscript,
|
|
AccessorDecl *previous) {
|
|
assert(accessorKind == previous->getAccessorKind());
|
|
|
|
P.diagnose(loc, diag::duplicate_accessor,
|
|
unsigned(isSubscript),
|
|
getAccessorNameForDiagnostic(previous, /*article*/ true));
|
|
P.diagnose(previous->getLoc(), diag::previous_accessor,
|
|
getAccessorNameForDiagnostic(previous, /*article*/ false),
|
|
/*already*/ true);
|
|
}
|
|
|
|
static bool isAllowedInLimitedSyntax(AccessorKind kind) {
|
|
switch (kind) {
|
|
case AccessorKind::Get:
|
|
case AccessorKind::Set:
|
|
return true;
|
|
|
|
case AccessorKind::Address:
|
|
case AccessorKind::MutableAddress:
|
|
case AccessorKind::WillSet:
|
|
case AccessorKind::DidSet:
|
|
case AccessorKind::Read:
|
|
case AccessorKind::Modify:
|
|
return false;
|
|
}
|
|
llvm_unreachable("bad accessor kind");
|
|
}
|
|
|
|
struct Parser::ParsedAccessors {
|
|
SourceLoc LBLoc, RBLoc;
|
|
SmallVector<AccessorDecl*, 16> Accessors;
|
|
|
|
#define ACCESSOR(ID) AccessorDecl *ID = nullptr;
|
|
#include "swift/AST/AccessorKinds.def"
|
|
|
|
void record(Parser &P, AbstractStorageDecl *storage, bool invalid);
|
|
void classify(Parser &P, AbstractStorageDecl *storage, bool invalid);
|
|
|
|
/// Add an accessor. If there's an existing accessor of this kind,
|
|
/// return it. The new accessor is still remembered but will be
|
|
/// ignored.
|
|
AccessorDecl *add(AccessorDecl *accessor);
|
|
|
|
/// applies the function to each accessor that is not a 'get'
|
|
void forEachNonGet(llvm::function_ref<void(AccessorDecl *)> func) {
|
|
for (auto accessor : Accessors)
|
|
if (!accessor->isGetter())
|
|
func(accessor);
|
|
}
|
|
|
|
/// Find the first accessor that's not an observing accessor.
|
|
AccessorDecl *findFirstNonObserver() {
|
|
for (auto accessor : Accessors) {
|
|
if (!accessor->isObservingAccessor())
|
|
return accessor;
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
/// Find the first accessor that can be used to perform mutation.
|
|
AccessorDecl *findFirstMutator() const {
|
|
if (Set) return Set;
|
|
if (Modify) return Modify;
|
|
if (MutableAddress) return MutableAddress;
|
|
return nullptr;
|
|
}
|
|
};
|
|
|
|
static bool parseAccessorIntroducer(Parser &P,
|
|
DeclAttributes &Attributes,
|
|
AccessorKind &Kind,
|
|
SourceLoc &Loc) {
|
|
assert(Attributes.isEmpty());
|
|
P.parseDeclAttributeList(Attributes);
|
|
|
|
// Parse the contextual keywords for 'mutating' and 'nonmutating' before
|
|
// get and set.
|
|
{
|
|
SyntaxParsingContext ModifierCtx(P.SyntaxContext, SyntaxKind::DeclModifier);
|
|
|
|
if (P.Tok.isContextualKeyword("mutating")) {
|
|
P.parseNewDeclAttribute(Attributes, /*AtLoc*/ {}, DAK_Mutating);
|
|
} else if (P.Tok.isContextualKeyword("nonmutating")) {
|
|
P.parseNewDeclAttribute(Attributes, /*AtLoc*/ {}, DAK_NonMutating);
|
|
} else if (P.Tok.isContextualKeyword("__consuming")) {
|
|
P.parseNewDeclAttribute(Attributes, /*AtLoc*/ {}, DAK_Consuming);
|
|
} else {
|
|
ModifierCtx.setTransparent();
|
|
}
|
|
}
|
|
|
|
if (!P.Tok.is(tok::identifier) || P.Tok.isEscapedIdentifier()) {
|
|
return true;
|
|
}
|
|
#define SUPPRESS_ARTIFICIAL_ACCESSORS 1
|
|
#define ACCESSOR_KEYWORD(KEYWORD)
|
|
#define SINGLETON_ACCESSOR(ID, KEYWORD) \
|
|
else if (P.Tok.getRawText() == #KEYWORD) { \
|
|
Kind = AccessorKind::ID; \
|
|
}
|
|
#include "swift/AST/AccessorKinds.def"
|
|
else {
|
|
return true;
|
|
}
|
|
P.Tok.setKind(tok::contextual_keyword);
|
|
Loc = P.consumeToken();
|
|
return false;
|
|
}
|
|
|
|
/// Parsing for effects specifiers. We expect the token cursor to be
|
|
/// at the point marked by the ^ below:
|
|
///
|
|
/// \verbatim
|
|
/// getter-clause ::= ... "get" getter-effects? code-block
|
|
/// ^
|
|
/// getter-effects ::= "throws"
|
|
/// getter-effects ::= "async" "throws"?
|
|
/// \endverbatim
|
|
///
|
|
/// While only 'get' accessors currently support such specifiers,
|
|
/// this routine will also diagnose unspported effects specifiers on
|
|
/// other accessors.
|
|
///
|
|
/// \param accessors the accessors we've parsed already.
|
|
/// \param asyncLoc is mutated with the location of 'async' if found.
|
|
/// \param throwsLoc is mutated with the location of 'throws' if found.
|
|
/// \param hasEffectfulGet maintains the state of parsing multiple accessors
|
|
/// to track whether we've already seen an effectful
|
|
/// 'get' accessor. It is mutated by this function.
|
|
/// \param currentKind is the kind of accessor we're parsing.
|
|
/// \param currentLoc is the location of the current accessor we're parsing.
|
|
/// \return the status of the parser after trying to parse these specifiers.
|
|
ParserStatus Parser::parseGetEffectSpecifier(ParsedAccessors &accessors,
|
|
SourceLoc &asyncLoc,
|
|
SourceLoc &throwsLoc,
|
|
bool &hasEffectfulGet,
|
|
AccessorKind currentKind,
|
|
SourceLoc const& currentLoc) {
|
|
ParserStatus Status;
|
|
|
|
if (isEffectsSpecifier(Tok)) {
|
|
if (currentKind == AccessorKind::Get) {
|
|
Status |=
|
|
parseEffectsSpecifiers(/*existingArrowLoc*/ SourceLoc(), asyncLoc,
|
|
/*reasync*/ nullptr, throwsLoc,
|
|
/*rethrows*/ nullptr);
|
|
|
|
// If we've previously parsed a non-'get' accessor, raise diagnostics,
|
|
// because we're about to add an effectful 'get' accessor.
|
|
if (!hasEffectfulGet) {
|
|
accessors.forEachNonGet([&](AccessorDecl *nonGetAccessor) {
|
|
diagnose(nonGetAccessor->getLoc(),
|
|
diag::invalid_accessor_with_effectful_get,
|
|
accessorKindName(nonGetAccessor->getAccessorKind()));
|
|
});
|
|
}
|
|
|
|
hasEffectfulGet = true;
|
|
} else {
|
|
// effects are not valid on this accessor. emit error for each one.
|
|
do {
|
|
diagnose(Tok, diag::invalid_accessor_specifier,
|
|
accessorKindName(currentKind), Tok.getRawText());
|
|
consumeToken();
|
|
} while (isEffectsSpecifier(Tok));
|
|
}
|
|
}
|
|
|
|
// If we're about to set-up a non-'get' accessor when
|
|
// we have an effectful 'get', raise a diagnostic.
|
|
if (hasEffectfulGet && currentKind != AccessorKind::Get) {
|
|
diagnose(currentLoc, diag::invalid_accessor_with_effectful_get,
|
|
accessorKindName(currentKind));
|
|
}
|
|
|
|
return Status;
|
|
}
|
|
|
|
ParserStatus Parser::parseGetSet(ParseDeclOptions Flags,
|
|
GenericParamList *GenericParams,
|
|
ParameterList *Indices,
|
|
ParsedAccessors &accessors,
|
|
AbstractStorageDecl *storage,
|
|
SourceLoc StaticLoc) {
|
|
assert(Tok.is(tok::l_brace));
|
|
|
|
// Properties in protocols use a very limited syntax.
|
|
// SIL mode and module interfaces use the same syntax.
|
|
// Otherwise, we have a normal var or subscript declaration and we need
|
|
// parse the full complement of specifiers, along with their bodies.
|
|
bool parsingLimitedSyntax = Flags.contains(PD_InProtocol) ||
|
|
SF.Kind == SourceFileKind::SIL;
|
|
|
|
SyntaxParsingContext AccessorListCtx(SyntaxContext,
|
|
SyntaxKind::AccessorBlock);
|
|
|
|
// If the body is completely empty, preserve it. This is at best a getter with
|
|
// an implicit fallthrough off the end.
|
|
if (peekToken().is(tok::r_brace)) {
|
|
accessors.LBLoc = consumeToken(tok::l_brace);
|
|
// Give syntax node an empty accessor list.
|
|
if (SyntaxContext->isEnabled()) {
|
|
SourceLoc listLoc = leadingTriviaLoc();
|
|
SyntaxContext->addSyntax(
|
|
ParsedSyntaxRecorder::makeBlankAccessorList(listLoc, *SyntaxContext));
|
|
}
|
|
accessors.RBLoc = consumeToken(tok::r_brace);
|
|
|
|
// In the limited syntax, fall out and let the caller handle it.
|
|
if (parsingLimitedSyntax)
|
|
return makeParserSuccess();
|
|
|
|
diagnose(accessors.RBLoc, diag::computed_property_no_accessors,
|
|
/*subscript*/ Indices != nullptr);
|
|
return makeParserError();
|
|
}
|
|
|
|
auto parseImplicitGetter = [&]() {
|
|
assert(Tok.is(tok::l_brace));
|
|
accessors.LBLoc = Tok.getLoc();
|
|
auto getter =
|
|
createAccessorFunc(Tok.getLoc(), /*ValueNamePattern*/ nullptr,
|
|
GenericParams, Indices, StaticLoc, Flags,
|
|
AccessorKind::Get, storage, this,
|
|
/*AccessorKeywordLoc*/ SourceLoc(),
|
|
/*asyncLoc*/SourceLoc(), /*throwsLoc*/SourceLoc());
|
|
accessors.add(getter);
|
|
parseAbstractFunctionBody(getter);
|
|
accessors.RBLoc = getter->getEndLoc();
|
|
};
|
|
|
|
// Prepare backtracking for implicit getter.
|
|
Optional<CancellableBacktrackingScope> backtrack;
|
|
backtrack.emplace(*this);
|
|
|
|
ParserStatus Status;
|
|
bool accessorHasCodeCompletion = false;
|
|
bool IsFirstAccessor = true;
|
|
bool hasEffectfulGet = false;
|
|
accessors.LBLoc = consumeToken(tok::l_brace);
|
|
while (!Tok.isAny(tok::r_brace, tok::eof)) {
|
|
Optional<SyntaxParsingContext> AccessorCtx;
|
|
AccessorCtx.emplace(SyntaxContext, SyntaxKind::AccessorDecl);
|
|
|
|
// Parse introducer if possible.
|
|
DeclAttributes Attributes;
|
|
AccessorKind Kind = AccessorKind::Get;
|
|
SourceLoc Loc;
|
|
bool NotAccessor = parseAccessorIntroducer(
|
|
*this, Attributes, Kind, Loc);
|
|
if (NotAccessor) {
|
|
AccessorCtx->setTransparent();
|
|
AccessorCtx.reset();
|
|
|
|
if (Tok.is(tok::code_complete)) {
|
|
// Handle code completion here only if it's not the first accessor.
|
|
// If it's the first accessor, it's handled in function body parsing
|
|
// because it might be an implicit getter.
|
|
if (!IsFirstAccessor || parsingLimitedSyntax) {
|
|
if (CodeCompletion) {
|
|
CodeCompletion->setParsedDecl(storage);
|
|
CodeCompletion->completeAccessorBeginning(nullptr);
|
|
}
|
|
consumeToken(tok::code_complete);
|
|
accessorHasCodeCompletion = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
// parsingLimitedSyntax mode cannot have a body.
|
|
if (parsingLimitedSyntax) {
|
|
diagnose(Tok, diag::expected_getset_in_protocol);
|
|
Status |= makeParserError();
|
|
break;
|
|
}
|
|
|
|
// Cannot have an implicit getter after other accessor.
|
|
if (!IsFirstAccessor) {
|
|
diagnose(Tok, diag::expected_accessor_kw);
|
|
skipUntil(tok::r_brace);
|
|
// Don't signal an error since we recovered.
|
|
break;
|
|
}
|
|
|
|
// This is an implicit getter. Cancel accessor contexts, backtrack to '{'
|
|
// position.
|
|
backtrack.reset();
|
|
AccessorListCtx.setTransparent();
|
|
parseImplicitGetter();
|
|
return makeParserSuccess();
|
|
}
|
|
if (IsFirstAccessor) {
|
|
// Continue parsing without backtracking so we can re-use previously
|
|
// parsed nodes for incremental re-parsing, but avoid destructing
|
|
// `backtrack` because its syntax context isn't at the top of the stack at
|
|
// this point.
|
|
backtrack->cancelBacktrack();
|
|
IsFirstAccessor = false;
|
|
}
|
|
|
|
// For now, immediately reject illegal accessors in protocols just to
|
|
// avoid having to deal with them everywhere.
|
|
if (parsingLimitedSyntax && !isAllowedInLimitedSyntax(Kind)) {
|
|
diagnose(Loc, diag::expected_getset_in_protocol);
|
|
continue;
|
|
}
|
|
|
|
// 'set' and 'willSet' can have an optional name. This isn't valid in a
|
|
// protocol, but we parse and then reject it for better QoI.
|
|
//
|
|
// set-name ::= '(' identifier ')'
|
|
if (parsingLimitedSyntax && Tok.is(tok::l_paren)) {
|
|
diagnose(Loc, diag::protocol_setter_name);
|
|
}
|
|
auto *ValueNamePattern = parseOptionalAccessorArgument(Loc, *this, Kind);
|
|
|
|
// Next, parse effects specifiers. While it's only valid to have them
|
|
// on 'get' accessors, we also emit diagnostics if they show up on others.
|
|
SourceLoc asyncLoc;
|
|
SourceLoc throwsLoc;
|
|
Status |= parseGetEffectSpecifier(accessors, asyncLoc, throwsLoc,
|
|
hasEffectfulGet, Kind, Loc);
|
|
|
|
// Set up a function declaration.
|
|
auto accessor = createAccessorFunc(Loc, ValueNamePattern, GenericParams,
|
|
Indices, StaticLoc, Flags,
|
|
Kind, storage, this, Loc,
|
|
asyncLoc, throwsLoc);
|
|
accessor->getAttrs() = Attributes;
|
|
|
|
// Collect this accessor and detect conflicts.
|
|
if (auto existingAccessor = accessors.add(accessor)) {
|
|
diagnoseRedundantAccessors(*this, Loc, Kind,
|
|
/*subscript*/Indices != nullptr,
|
|
existingAccessor);
|
|
}
|
|
|
|
// There should be no body in the limited syntax; diagnose unexpected
|
|
// accessor implementations.
|
|
if (parsingLimitedSyntax) {
|
|
if (Tok.is(tok::l_brace))
|
|
diagnose(Tok, diag::unexpected_getset_implementation_in_protocol,
|
|
getAccessorNameForDiagnostic(Kind, /*article*/ false));
|
|
continue;
|
|
}
|
|
|
|
// It's okay not to have a body if there's an external asm name.
|
|
if (!Tok.is(tok::l_brace)) {
|
|
// Accessors don't need bodies in module interfaces
|
|
if (SF.Kind == SourceFileKind::Interface)
|
|
continue;
|
|
// _silgen_name'd accessors don't need bodies.
|
|
if (!Attributes.hasAttribute<SILGenNameAttr>()) {
|
|
diagnose(Tok, diag::expected_lbrace_accessor,
|
|
getAccessorNameForDiagnostic(accessor, /*article*/ false));
|
|
Status |= makeParserError();
|
|
break;
|
|
}
|
|
continue;
|
|
}
|
|
|
|
parseAbstractFunctionBody(accessor);
|
|
}
|
|
backtrack->cancelBacktrack();
|
|
backtrack.reset();
|
|
// Collect all explicit accessors to a list.
|
|
AccessorListCtx.collectNodesInPlace(SyntaxKind::AccessorList);
|
|
// Parse the final '}'.
|
|
if (Status.isError())
|
|
skipUntil(tok::r_brace);
|
|
|
|
parseMatchingToken(tok::r_brace, accessors.RBLoc,
|
|
diag::expected_rbrace_in_getset, accessors.LBLoc);
|
|
if (accessorHasCodeCompletion)
|
|
return makeParserCodeCompletionStatus();
|
|
return Status;
|
|
}
|
|
|
|
/// Parse the brace-enclosed getter and setter for a variable.
|
|
ParserResult<VarDecl>
|
|
Parser::parseDeclVarGetSet(PatternBindingEntry &entry, ParseDeclOptions Flags,
|
|
SourceLoc StaticLoc,
|
|
StaticSpellingKind StaticSpelling,
|
|
SourceLoc VarLoc, bool hasInitializer,
|
|
const DeclAttributes &Attributes,
|
|
SmallVectorImpl<Decl *> &Decls) {
|
|
bool Invalid = false;
|
|
|
|
auto *pattern = entry.getPattern();
|
|
|
|
// The grammar syntactically requires a simple identifier for the variable
|
|
// name. Complain if that isn't what we got. But for recovery purposes,
|
|
// make an effort to look through other things anyway.
|
|
VarDecl *PrimaryVar = nullptr;
|
|
bool primaryVarIsWellFormed = true;
|
|
{
|
|
Pattern *cur = pattern;
|
|
TypedPattern *previousTyped = nullptr;
|
|
while (true) {
|
|
if (auto typed = dyn_cast<TypedPattern>(cur)) {
|
|
if (previousTyped) primaryVarIsWellFormed = false;
|
|
previousTyped = typed;
|
|
cur = typed->getSubPattern();
|
|
} else if (auto paren = dyn_cast<ParenPattern>(cur)) {
|
|
primaryVarIsWellFormed = false;
|
|
cur = paren->getSubPattern();
|
|
} else if (auto var = dyn_cast<BindingPattern>(cur)) {
|
|
primaryVarIsWellFormed = false;
|
|
cur = var->getSubPattern();
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (auto named = dyn_cast<NamedPattern>(cur)) {
|
|
PrimaryVar = named->getDecl();
|
|
}
|
|
}
|
|
|
|
if (!PrimaryVar || !primaryVarIsWellFormed) {
|
|
diagnose(pattern->getLoc(), diag::getset_nontrivial_pattern);
|
|
Invalid = true;
|
|
}
|
|
|
|
// Create a fake VarDecl and PBD so that we don't have to weaken the
|
|
// formation rule that an AccessorDecl always has a VarDecl.
|
|
VarDecl *storage = PrimaryVar;
|
|
if (!storage) {
|
|
storage = new (Context) VarDecl(StaticLoc.isValid(),
|
|
VarDecl::Introducer::Var,
|
|
VarLoc, Identifier(),
|
|
CurDeclContext);
|
|
storage->setInvalid();
|
|
|
|
pattern =
|
|
TypedPattern::createImplicit(Context, new (Context) NamedPattern(storage),
|
|
ErrorType::get(Context));
|
|
entry.setPattern(pattern);
|
|
}
|
|
|
|
// Parse getter and setter.
|
|
ParsedAccessors accessors;
|
|
auto AccessorStatus = parseGetSet(Flags, /*GenericParams=*/nullptr,
|
|
/*Indices=*/nullptr, accessors,
|
|
storage, StaticLoc);
|
|
if (AccessorStatus.hasCodeCompletion())
|
|
return makeParserCodeCompletionStatus();
|
|
if (AccessorStatus.isErrorOrHasCompletion())
|
|
Invalid = true;
|
|
|
|
// If we have an invalid case, bail out now.
|
|
if (!PrimaryVar)
|
|
return nullptr;
|
|
|
|
if (!isa<TypedPattern>(pattern)) {
|
|
if (accessors.Get || accessors.Set || accessors.Address ||
|
|
accessors.MutableAddress) {
|
|
SourceLoc locAfterPattern = pattern->getLoc().getAdvancedLoc(
|
|
pattern->getBoundName().getLength());
|
|
diagnose(pattern->getLoc(), diag::computed_property_missing_type)
|
|
.fixItInsert(locAfterPattern, ": <# Type #>");
|
|
Invalid = true;
|
|
}
|
|
}
|
|
|
|
// Reject accessors on 'let's after parsing them (for better recovery).
|
|
if (PrimaryVar->isLet() && !Attributes.hasAttribute<HasStorageAttr>()) {
|
|
Diag<> DiagID;
|
|
if (accessors.WillSet || accessors.DidSet)
|
|
DiagID = diag::let_cannot_be_observing_property;
|
|
else if (accessors.Address || accessors.MutableAddress)
|
|
DiagID = diag::let_cannot_be_addressed_property;
|
|
else
|
|
DiagID = diag::let_cannot_be_computed_property;
|
|
|
|
diagnose(accessors.LBLoc, DiagID).fixItReplace(VarLoc, "var");
|
|
Invalid = true;
|
|
}
|
|
|
|
accessors.record(*this, PrimaryVar, Invalid);
|
|
|
|
// Set original declaration in `@differentiable` attributes.
|
|
for (auto *accessor : accessors.Accessors)
|
|
setOriginalDeclarationForDifferentiableAttributes(accessor->getAttrs(),
|
|
accessor);
|
|
|
|
return makeParserResult(PrimaryVar);
|
|
}
|
|
|
|
/// Add the given accessor to the collection of parsed accessors. If
|
|
/// it's the first accessor of its kind, remember it for that purpose
|
|
/// and return null; otherwise, return the existing accessor.
|
|
AccessorDecl *Parser::ParsedAccessors::add(AccessorDecl *accessor) {
|
|
Accessors.push_back(accessor);
|
|
|
|
switch (accessor->getAccessorKind()) {
|
|
#define ACCESSOR(ID) \
|
|
case AccessorKind::ID: \
|
|
if (ID) { \
|
|
return ID; \
|
|
} else { \
|
|
ID = accessor; \
|
|
return nullptr; \
|
|
}
|
|
#include "swift/AST/AccessorKinds.def"
|
|
}
|
|
llvm_unreachable("bad accessor kind");
|
|
}
|
|
|
|
/// Record a bunch of parsed accessors into the given abstract storage decl.
|
|
void Parser::ParsedAccessors::record(Parser &P, AbstractStorageDecl *storage,
|
|
bool invalid) {
|
|
classify(P, storage, invalid);
|
|
storage->setAccessors(LBLoc, Accessors, RBLoc);
|
|
}
|
|
|
|
static void diagnoseConflictingAccessors(Parser &P, AccessorDecl *first,
|
|
AccessorDecl *&second) {
|
|
if (!second) return;
|
|
P.diagnose(second->getLoc(), diag::conflicting_accessor,
|
|
isa<SubscriptDecl>(first->getStorage()),
|
|
getAccessorNameForDiagnostic(second, /*article*/ true),
|
|
getAccessorNameForDiagnostic(first, /*article*/ true));
|
|
P.diagnose(first->getLoc(), diag::previous_accessor,
|
|
getAccessorNameForDiagnostic(first, /*article*/ false),
|
|
/*already*/ false);
|
|
second->setInvalid();
|
|
}
|
|
|
|
template <class... DiagArgs>
|
|
static void diagnoseAndIgnoreObservers(Parser &P,
|
|
Parser::ParsedAccessors &accessors,
|
|
Diag<unsigned, DiagArgs...> diagnostic,
|
|
typename std::enable_if<true, DiagArgs>::type... args) {
|
|
if (auto &accessor = accessors.WillSet) {
|
|
P.diagnose(accessor->getLoc(), diagnostic, /*willSet*/ 0, args...);
|
|
accessor->setInvalid();
|
|
}
|
|
if (auto &accessor = accessors.DidSet) {
|
|
P.diagnose(accessor->getLoc(), diagnostic, /*didSet*/ 1, args...);
|
|
accessor->setInvalid();
|
|
}
|
|
}
|
|
|
|
void Parser::ParsedAccessors::classify(Parser &P, AbstractStorageDecl *storage,
|
|
bool invalid) {
|
|
// If there was a problem parsing accessors, mark all parsed accessors
|
|
// as invalid to avoid tripping up later invariants.
|
|
// We also want to avoid diagnose missing accessors if something
|
|
// was invalid.
|
|
if (invalid) {
|
|
for (auto accessor : Accessors) {
|
|
accessor->setInvalid();
|
|
}
|
|
}
|
|
|
|
// The observing accessors have very specific restrictions.
|
|
// Prefer to ignore them.
|
|
if (WillSet || DidSet) {
|
|
// For now, we don't support the observing accessors on subscripts.
|
|
if (isa<SubscriptDecl>(storage)) {
|
|
diagnoseAndIgnoreObservers(P, *this,
|
|
diag::observing_accessor_in_subscript);
|
|
|
|
// The observing accessors cannot be combined with other accessors.
|
|
} else if (auto nonObserver = findFirstNonObserver()) {
|
|
diagnoseAndIgnoreObservers(P, *this,
|
|
diag::observing_accessor_conflicts_with_accessor,
|
|
getAccessorNameForDiagnostic(nonObserver, /*article*/ true));
|
|
}
|
|
}
|
|
|
|
// Okay, observers are out of the way.
|
|
|
|
// 'get', 'read', and a non-mutable addressor are all exclusive.
|
|
if (Get) {
|
|
diagnoseConflictingAccessors(P, Get, Read);
|
|
diagnoseConflictingAccessors(P, Get, Address);
|
|
} else if (Read) {
|
|
diagnoseConflictingAccessors(P, Read, Address);
|
|
} else if (Address) {
|
|
// Nothing can go wrong.
|
|
|
|
// If there's a writing accessor of any sort, there must also be a
|
|
// reading accessor.
|
|
} else if (auto mutator = findFirstMutator()) {
|
|
if (!invalid) {
|
|
P.diagnose(mutator->getLoc(),
|
|
// Don't mention the more advanced accessors if the user
|
|
// only provided a setter without a getter.
|
|
(MutableAddress || Modify)
|
|
? diag::missing_reading_accessor
|
|
: diag::missing_getter,
|
|
isa<SubscriptDecl>(storage),
|
|
getAccessorNameForDiagnostic(mutator, /*article*/ true));
|
|
}
|
|
|
|
// Subscripts always have to have some sort of accessor; they can't be
|
|
// purely stored.
|
|
} else if (isa<SubscriptDecl>(storage)) {
|
|
if (!invalid) {
|
|
P.diagnose(LBLoc, diag::subscript_without_get);
|
|
}
|
|
}
|
|
|
|
// A mutable addressor is exclusive with 'set' and 'modify', but
|
|
// 'set' and 'modify' can appear together.
|
|
if (Set) {
|
|
diagnoseConflictingAccessors(P, Set, MutableAddress);
|
|
} else if (Modify) {
|
|
diagnoseConflictingAccessors(P, Modify, MutableAddress);
|
|
}
|
|
}
|
|
|
|
|
|
/// Parse a 'var' or 'let' declaration, doing no token skipping on error.
|
|
ParserResult<PatternBindingDecl>
|
|
Parser::parseDeclVar(ParseDeclOptions Flags,
|
|
DeclAttributes &Attributes,
|
|
SmallVectorImpl<Decl *> &Decls,
|
|
SourceLoc StaticLoc,
|
|
StaticSpellingKind StaticSpelling,
|
|
SourceLoc TryLoc,
|
|
bool HasLetOrVarKeyword) {
|
|
assert(StaticLoc.isInvalid() || StaticSpelling != StaticSpellingKind::None);
|
|
|
|
if (StaticLoc.isValid()) {
|
|
if (!Flags.contains(PD_HasContainerType)) {
|
|
diagnose(Tok, diag::static_var_decl_global_scope, StaticSpelling)
|
|
.fixItRemove(StaticLoc);
|
|
StaticLoc = SourceLoc();
|
|
StaticSpelling = StaticSpellingKind::None;
|
|
} else if (Flags.contains(PD_InStruct) || Flags.contains(PD_InEnum) ||
|
|
Flags.contains(PD_InProtocol)) {
|
|
if (StaticSpelling == StaticSpellingKind::KeywordClass)
|
|
diagnose(Tok, diag::class_var_not_in_class,
|
|
Flags.contains(PD_InProtocol))
|
|
.fixItReplace(StaticLoc, "static");
|
|
}
|
|
}
|
|
|
|
bool isLet = HasLetOrVarKeyword && Tok.is(tok::kw_let);
|
|
assert(!HasLetOrVarKeyword || Tok.getKind() == tok::kw_let ||
|
|
Tok.getKind() == tok::kw_var);
|
|
|
|
SourceLoc VarLoc = HasLetOrVarKeyword ? consumeToken() : Tok.getLoc();
|
|
|
|
// If this is a var in the top-level of script/repl source file, wrap the
|
|
// PatternBindingDecl in a TopLevelCodeDecl, since it represents executable
|
|
// code. The VarDecl and any accessor decls (for computed properties) go in
|
|
// CurDeclContext.
|
|
//
|
|
TopLevelCodeDecl *topLevelDecl = nullptr;
|
|
if (allowTopLevelCode() && CurDeclContext->isModuleScopeContext()) {
|
|
// The body of topLevelDecl will get set later.
|
|
topLevelDecl = new (Context) TopLevelCodeDecl(CurDeclContext);
|
|
}
|
|
|
|
bool HasAccessors = false; // Syntactically has accessor {}'s.
|
|
ParserStatus Status;
|
|
|
|
unsigned NumDeclsInResult = Decls.size();
|
|
|
|
// In var/let decl with multiple patterns, accumulate them all in this list
|
|
// so we can build our singular PatternBindingDecl at the end.
|
|
SmallVector<PatternBindingEntry, 4> PBDEntries;
|
|
auto BaseContext = CurDeclContext;
|
|
|
|
// No matter what error path we take, make sure the
|
|
// PatternBindingDecl/TopLevel code block are added.
|
|
auto makeResult =
|
|
[&](ParserStatus Status) -> ParserResult<PatternBindingDecl> {
|
|
|
|
// If we didn't parse any patterns, don't create the pattern binding decl.
|
|
if (PBDEntries.empty())
|
|
return Status;
|
|
|
|
// Now that we've parsed all of our patterns, initializers and accessors, we
|
|
// can finally create our PatternBindingDecl to represent the
|
|
// pattern/initializer pairs.
|
|
auto *PBD = PatternBindingDecl::create(Context, StaticLoc, StaticSpelling,
|
|
VarLoc, PBDEntries, BaseContext);
|
|
|
|
// Wire up any initializer contexts we needed.
|
|
for (unsigned i : indices(PBDEntries)) {
|
|
if (auto initContext = PBD->getInitContext(i))
|
|
cast<PatternBindingInitializer>(initContext)->setBinding(PBD, i);
|
|
}
|
|
|
|
// If we're setting up a TopLevelCodeDecl, configure it by setting up the
|
|
// body that holds PBD and we're done. The TopLevelCodeDecl is already set
|
|
// up in Decls to be returned to caller.
|
|
if (topLevelDecl) {
|
|
PBD->setDeclContext(topLevelDecl);
|
|
auto range = PBD->getSourceRangeIncludingAttrs();
|
|
topLevelDecl->setBody(BraceStmt::create(Context, range.Start,
|
|
ASTNode(PBD), range.End, true));
|
|
Decls.insert(Decls.begin()+NumDeclsInResult, topLevelDecl);
|
|
return makeParserResult(Status, PBD);
|
|
}
|
|
|
|
// Otherwise return the PBD in "Decls" to the caller. We add it at a
|
|
// specific spot to get it in before any accessors, which SILGen seems to
|
|
// want.
|
|
Decls.insert(Decls.begin()+NumDeclsInResult, PBD);
|
|
|
|
// Always return the result for PBD.
|
|
return makeParserResult(Status, PBD);
|
|
};
|
|
SyntaxParsingContext PBListCtx(SyntaxContext, SyntaxKind::PatternBindingList);
|
|
bool HasNext;
|
|
do {
|
|
SyntaxParsingContext PatternBindingCtx(SyntaxContext,
|
|
SyntaxKind::PatternBinding);
|
|
Pattern *pattern;
|
|
{
|
|
// In our recursive parse, remember that we're in a var/let pattern.
|
|
llvm::SaveAndRestore<decltype(InVarOrLetPattern)>
|
|
T(InVarOrLetPattern, isLet ? IVOLP_InLet : IVOLP_InVar);
|
|
|
|
auto patternRes = parseTypedPattern();
|
|
if (patternRes.hasCodeCompletion())
|
|
return makeResult(makeParserCodeCompletionStatus());
|
|
if (patternRes.isNull())
|
|
return makeResult(makeParserError());
|
|
|
|
pattern = patternRes.get();
|
|
}
|
|
|
|
bool hasOpaqueReturnTy = false;
|
|
if (auto typedPattern = dyn_cast<TypedPattern>(pattern)) {
|
|
hasOpaqueReturnTy =
|
|
isa<OpaqueReturnTypeRepr>(typedPattern->getTypeRepr());
|
|
}
|
|
auto sf = CurDeclContext->getParentSourceFile();
|
|
|
|
// Configure all vars with attributes, 'static' and parent pattern.
|
|
pattern->forEachVariable([&](VarDecl *VD) {
|
|
VD->setStatic(StaticLoc.isValid());
|
|
VD->getAttrs() = Attributes;
|
|
setLocalDiscriminator(VD);
|
|
VD->setTopLevelGlobal(topLevelDecl);
|
|
|
|
// Set original declaration in `@differentiable` attributes.
|
|
setOriginalDeclarationForDifferentiableAttributes(Attributes, VD);
|
|
|
|
Decls.push_back(VD);
|
|
if (hasOpaqueReturnTy && sf && !InInactiveClauseEnvironment) {
|
|
sf->addUnvalidatedDeclWithOpaqueResultType(VD);
|
|
}
|
|
});
|
|
|
|
// Check whether we have already established an initializer context.
|
|
PatternBindingInitializer *initContext =
|
|
findAttributeInitContent(Attributes);
|
|
|
|
// Remember this pattern/init pair for our ultimate PatternBindingDecl. The
|
|
// Initializer will be added later when/if it is parsed.
|
|
PBDEntries.push_back({pattern, /*EqualLoc*/ SourceLoc(), /*Init*/ nullptr,
|
|
initContext});
|
|
|
|
Expr *PatternInit = nullptr;
|
|
|
|
// Parse an initializer if present.
|
|
if (Tok.is(tok::equal)) {
|
|
SyntaxParsingContext InitCtx(SyntaxContext, SyntaxKind::InitializerClause);
|
|
// If we're not in a local context, we'll need a context to parse initializers
|
|
// into (should we have one). This happens for properties and global
|
|
// variables in libraries.
|
|
|
|
// If we have no local context to parse the initial value into, create one
|
|
// for the PBD we'll eventually create. This allows us to have reasonable
|
|
// DeclContexts for any closures that may live inside of initializers.
|
|
if (!CurDeclContext->isLocalContext() && !topLevelDecl && !initContext)
|
|
initContext = new (Context) PatternBindingInitializer(CurDeclContext);
|
|
|
|
// If we're using a local context (either a TopLevelCodeDecl or a
|
|
// PatternBindingContext) install it now so that CurDeclContext is set
|
|
// right when parsing the initializer.
|
|
Optional<ParseFunctionBody> initParser;
|
|
Optional<ContextChange> topLevelParser;
|
|
if (topLevelDecl)
|
|
topLevelParser.emplace(*this, topLevelDecl,
|
|
&State->getTopLevelContext());
|
|
if (initContext)
|
|
initParser.emplace(*this, initContext);
|
|
|
|
|
|
SourceLoc EqualLoc = consumeToken(tok::equal);
|
|
PBDEntries.back().setEqualLoc(EqualLoc);
|
|
|
|
ParserResult<Expr> init = parseExpr(diag::expected_init_value);
|
|
PBDEntries.back().setOriginalInit(init.getPtrOrNull());
|
|
|
|
// If this Pattern binding was not supposed to have an initializer, but it
|
|
// did, diagnose this and remove it.
|
|
if (Flags & PD_DisallowInit && init.isNonNull()) {
|
|
diagnose(EqualLoc, diag::disallowed_init);
|
|
init = nullptr;
|
|
}
|
|
|
|
// Otherwise, if this pattern binding *was* supposed (or allowed) to have
|
|
// an initializer, but it was a parse error, replace it with ErrorExpr so
|
|
// that downstream clients know that it was present (well, at least the =
|
|
// was present). This silences downstream diagnostics checking to make
|
|
// sure that some PBD's that require initializers actually had them.
|
|
if (!(Flags & PD_DisallowInit) && init.isNull())
|
|
init = makeParserResult(init, new (Context) ErrorExpr(EqualLoc));
|
|
|
|
|
|
// Remember this init for the PatternBindingDecl.
|
|
PatternInit = init.getPtrOrNull();
|
|
PBDEntries.back().setInit(PatternInit);
|
|
|
|
// If we set up an initialization context for a property or module-level
|
|
// global, record it.
|
|
PBDEntries.back().setInitContext(initContext);
|
|
|
|
if (init.hasCodeCompletion()) {
|
|
Status |= init;
|
|
// If we are doing second pass of code completion, we don't want to
|
|
// suddenly cut off parsing and throw away the declaration.
|
|
if (isCodeCompletionFirstPass())
|
|
return makeResult(makeParserCodeCompletionStatus());
|
|
}
|
|
|
|
if (init.isNull())
|
|
return makeResult(makeParserError());
|
|
}
|
|
|
|
// If we syntactically match the second decl-var production, with a
|
|
// var-get-set clause, parse the var-get-set clause.
|
|
if (Tok.is(tok::l_brace)) {
|
|
|
|
// Skip parsing the var-get-set clause if '{' is at start of line
|
|
// and next token is not 'didSet' or 'willSet'. Parsing as 'do'
|
|
// statement gives useful errors for missing 'do' before brace.
|
|
// See SR-14836.
|
|
if (!PatternInit || !Tok.isAtStartOfLine() || isStartOfGetSetAccessor()) {
|
|
HasAccessors = true;
|
|
auto boundVar = parseDeclVarGetSet(
|
|
PBDEntries.back(), Flags, StaticLoc, StaticSpelling, VarLoc,
|
|
PatternInit != nullptr, Attributes, Decls);
|
|
if (boundVar.hasCodeCompletion())
|
|
return makeResult(makeParserCodeCompletionStatus());
|
|
}
|
|
}
|
|
|
|
// Propagate back types for simple patterns, like "var A, B : T".
|
|
if (auto *TP = dyn_cast<TypedPattern>(pattern)) {
|
|
if (isa<NamedPattern>(TP->getSubPattern()) && PatternInit == nullptr) {
|
|
for (unsigned i = PBDEntries.size() - 1; i != 0; --i) {
|
|
Pattern *PrevPat = PBDEntries[i-1].getPattern();
|
|
if (!isa<NamedPattern>(PrevPat) || PBDEntries[i-1].getInit())
|
|
break;
|
|
if (HasAccessors) {
|
|
// FIXME -- offer a fixit to explicitly specify the type
|
|
diagnose(PrevPat->getLoc(), diag::getset_cannot_be_implied);
|
|
Status.setIsParseError();
|
|
}
|
|
|
|
TypedPattern *NewTP = new (Context) TypedPattern(PrevPat,
|
|
TP->getTypeRepr());
|
|
NewTP->setPropagatedType();
|
|
PBDEntries[i-1].setPattern(NewTP);
|
|
}
|
|
}
|
|
}
|
|
HasNext = consumeIf(tok::comma);
|
|
} while (HasNext);
|
|
|
|
if (HasAccessors && PBDEntries.size() > 1) {
|
|
diagnose(VarLoc, diag::disallowed_var_multiple_getset);
|
|
Status.setIsParseError();
|
|
}
|
|
|
|
if (TryLoc.isValid()) {
|
|
auto inFlightDiag = diagnose(TryLoc, diag::try_on_var_let);
|
|
|
|
if (PBDEntries.size() == 1 && PBDEntries.front().getInit() &&
|
|
!isa<ErrorExpr>(PBDEntries.front().getInit())) {
|
|
auto *init = PBDEntries.front().getInit();
|
|
inFlightDiag.fixItRemoveChars(TryLoc, VarLoc);
|
|
inFlightDiag.fixItInsert(init->getStartLoc(), "try ");
|
|
|
|
// Note: We can't use TryLoc here because it's outside the PBD source
|
|
// range.
|
|
PBDEntries.front().setInit(new (Context) TryExpr(init->getStartLoc(),
|
|
init));
|
|
}
|
|
}
|
|
|
|
return makeResult(Status);
|
|
}
|
|
|
|
void Parser::consumeAbstractFunctionBody(AbstractFunctionDecl *AFD,
|
|
const DeclAttributes &Attrs) {
|
|
auto BeginParserPosition = getParserPosition();
|
|
SourceRange BodyRange;
|
|
BodyRange.Start = Tok.getLoc();
|
|
|
|
// Advance the parser to the end of the block; '{' ... '}'.
|
|
bool HasNestedTypeDeclarations;
|
|
skipBracedBlock(HasNestedTypeDeclarations);
|
|
|
|
BodyRange.End = PreviousLoc;
|
|
|
|
AFD->setBodyDelayed(BodyRange);
|
|
AFD->setHasNestedTypeDeclarations(HasNestedTypeDeclarations);
|
|
|
|
if (isCodeCompletionFirstPass() &&
|
|
SourceMgr.rangeContainsCodeCompletionLoc(BodyRange)) {
|
|
State->setCodeCompletionDelayedDeclState(
|
|
SourceMgr, L->getBufferID(),
|
|
CodeCompletionDelayedDeclKind::FunctionBody,
|
|
PD_Default, AFD, BodyRange, BeginParserPosition.PreviousLoc);
|
|
}
|
|
}
|
|
|
|
/// Parse a 'func' declaration, returning null on error. The caller
|
|
/// handles this case and does recovery as appropriate.
|
|
///
|
|
/// \verbatim
|
|
/// decl-func:
|
|
/// attribute-list? ('static' | 'class')? 'mutating'? 'func'
|
|
/// any-identifier generic-params? func-signature where-clause?
|
|
/// stmt-brace?
|
|
/// \endverbatim
|
|
///
|
|
/// \note The caller of this method must ensure that the next token is 'func'.
|
|
ParserResult<FuncDecl> Parser::parseDeclFunc(SourceLoc StaticLoc,
|
|
StaticSpellingKind StaticSpelling,
|
|
ParseDeclOptions Flags,
|
|
DeclAttributes &Attributes,
|
|
bool HasFuncKeyword) {
|
|
assert(StaticLoc.isInvalid() || StaticSpelling != StaticSpellingKind::None);
|
|
|
|
if (StaticLoc.isValid()) {
|
|
if (!Flags.contains(PD_HasContainerType)) {
|
|
// Reject static functions at global scope.
|
|
diagnose(Tok, diag::static_func_decl_global_scope, StaticSpelling)
|
|
.fixItRemove(StaticLoc);
|
|
StaticLoc = SourceLoc();
|
|
StaticSpelling = StaticSpellingKind::None;
|
|
} else if (Flags.contains(PD_InStruct) || Flags.contains(PD_InEnum) ||
|
|
Flags.contains(PD_InProtocol)) {
|
|
if (StaticSpelling == StaticSpellingKind::KeywordClass) {
|
|
diagnose(Tok, diag::class_func_not_in_class,
|
|
Flags.contains(PD_InProtocol))
|
|
.fixItReplace(StaticLoc, "static");
|
|
|
|
StaticSpelling = StaticSpellingKind::KeywordStatic;
|
|
}
|
|
}
|
|
}
|
|
|
|
ParserStatus Status;
|
|
SourceLoc FuncLoc =
|
|
HasFuncKeyword ? consumeToken(tok::kw_func) : Tok.getLoc();
|
|
|
|
// Parse function name.
|
|
Identifier SimpleName;
|
|
SourceLoc NameLoc;
|
|
if (Tok.isAnyOperator() || Tok.isAny(tok::exclaim_postfix, tok::amp_prefix)) {
|
|
// If the name is an operator token that ends in '<' and the following token
|
|
// is an identifier, split the '<' off as a separate token. This allows
|
|
// things like 'func ==<T>(x:T, y:T) {}' to parse as '==' with generic type
|
|
// variable '<T>' as expected.
|
|
auto NameStr = Tok.getText();
|
|
if (NameStr.size() > 1 && NameStr.back() == '<' &&
|
|
peekToken().is(tok::identifier)) {
|
|
NameStr = NameStr.slice(0, NameStr.size() - 1);
|
|
}
|
|
SimpleName = Context.getIdentifier(NameStr);
|
|
NameLoc = consumeStartingCharacterOfCurrentToken(tok::oper_binary_spaced,
|
|
NameStr.size());
|
|
// Within a protocol, recover from a missing 'static'.
|
|
if (Flags & PD_InProtocol) {
|
|
switch (StaticSpelling) {
|
|
case StaticSpellingKind::None: {
|
|
diagnose(NameLoc, diag::operator_static_in_protocol, SimpleName.str())
|
|
.fixItInsert(FuncLoc, "static ");
|
|
StaticSpelling = StaticSpellingKind::KeywordStatic;
|
|
break;
|
|
}
|
|
|
|
case StaticSpellingKind::KeywordStatic:
|
|
// Okay, this is correct.
|
|
break;
|
|
|
|
case StaticSpellingKind::KeywordClass:
|
|
llvm_unreachable("should have been fixed above");
|
|
}
|
|
}
|
|
} else {
|
|
// This non-operator path is quite accepting of what tokens might be a name,
|
|
// because we're aggressive about recovering/providing good diagnostics for
|
|
// beginners.
|
|
auto NameStatus = parseIdentifierDeclName(
|
|
*this, SimpleName, NameLoc, "function", [&](const Token &next) {
|
|
return next.isAny(tok::l_paren, tok::arrow, tok::l_brace) ||
|
|
startsWithLess(next);
|
|
});
|
|
if (NameStatus.isErrorOrHasCompletion())
|
|
return NameStatus;
|
|
}
|
|
|
|
DebuggerContextChange DCC(*this, SimpleName, DeclKind::Func);
|
|
|
|
// Parse the generic-params, if present.
|
|
GenericParamList *GenericParams;
|
|
auto GenericParamResult = maybeParseGenericParams();
|
|
GenericParams = GenericParamResult.getPtrOrNull();
|
|
if (GenericParamResult.hasCodeCompletion()) {
|
|
Status.setHasCodeCompletionAndIsError();
|
|
if (!CodeCompletion)
|
|
return Status;
|
|
}
|
|
|
|
DefaultArgumentInfo DefaultArgs;
|
|
TypeRepr *FuncRetTy = nullptr;
|
|
DeclName FullName;
|
|
ParameterList *BodyParams;
|
|
SourceLoc asyncLoc;
|
|
bool reasync;
|
|
SourceLoc throwsLoc;
|
|
bool rethrows;
|
|
Status |= parseFunctionSignature(SimpleName, FullName, BodyParams,
|
|
DefaultArgs,
|
|
asyncLoc, reasync,
|
|
throwsLoc, rethrows,
|
|
FuncRetTy);
|
|
if (Status.hasCodeCompletion() && !CodeCompletion) {
|
|
// Trigger delayed parsing, no need to continue.
|
|
return Status;
|
|
}
|
|
|
|
diagnoseWhereClauseInGenericParamList(GenericParams);
|
|
|
|
// If there was an 'async' modifier, put it in the right place for a function.
|
|
bool isAsync = asyncLoc.isValid();
|
|
if (auto asyncAttr = Attributes.getAttribute<AsyncAttr>()) {
|
|
SourceLoc insertLoc = Lexer::getLocForEndOfToken(
|
|
SourceMgr, BodyParams->getRParenLoc());
|
|
|
|
diagnose(asyncAttr->getLocation(), diag::async_func_modifier)
|
|
.fixItRemove(asyncAttr->getRange())
|
|
.fixItInsert(insertLoc, " async");
|
|
asyncAttr->setInvalid();
|
|
isAsync = true;
|
|
}
|
|
|
|
// Create the decl for the func and add it to the parent scope.
|
|
auto *FD = FuncDecl::create(Context, StaticLoc, StaticSpelling,
|
|
FuncLoc, FullName, NameLoc,
|
|
/*Async=*/isAsync, asyncLoc,
|
|
/*Throws=*/throwsLoc.isValid(), throwsLoc,
|
|
GenericParams,
|
|
BodyParams, FuncRetTy,
|
|
CurDeclContext);
|
|
|
|
// Let the source file track the opaque return type mapping, if any.
|
|
if (isa_and_nonnull<OpaqueReturnTypeRepr>(FuncRetTy) &&
|
|
!InInactiveClauseEnvironment) {
|
|
if (auto sf = CurDeclContext->getParentSourceFile()) {
|
|
sf->addUnvalidatedDeclWithOpaqueResultType(FD);
|
|
}
|
|
}
|
|
|
|
// Parse a 'where' clause if present.
|
|
if (Tok.is(tok::kw_where)) {
|
|
ContextChange CC(*this, FD);
|
|
|
|
Status |= parseFreestandingGenericWhereClause(FD);
|
|
if (Status.hasCodeCompletion() && !CodeCompletion) {
|
|
// Trigger delayed parsing, no need to continue.
|
|
return Status;
|
|
}
|
|
}
|
|
|
|
// Protocol method arguments may not have default values.
|
|
if (Flags.contains(PD_InProtocol) && DefaultArgs.HasDefaultArgument) {
|
|
diagnose(FuncLoc, diag::protocol_method_argument_init);
|
|
return nullptr;
|
|
}
|
|
|
|
if (reasync) {
|
|
Attributes.add(new (Context) ReasyncAttr(asyncLoc));
|
|
}
|
|
if (rethrows) {
|
|
Attributes.add(new (Context) RethrowsAttr(throwsLoc));
|
|
}
|
|
|
|
diagnoseOperatorFixityAttributes(*this, Attributes, FD);
|
|
// Add the attributes here so if we need them while parsing the body
|
|
// they are available.
|
|
FD->getAttrs() = Attributes;
|
|
|
|
// Pass the function signature to code completion.
|
|
if (Status.hasCodeCompletion()) {
|
|
assert(CodeCompletion && "must be code completion second pass");
|
|
CodeCompletion->setParsedDecl(FD);
|
|
}
|
|
|
|
DefaultArgs.setFunctionContext(FD, FD->getParameters());
|
|
setLocalDiscriminator(FD);
|
|
|
|
if (Flags.contains(PD_InProtocol)) {
|
|
if (Tok.is(tok::l_brace)) {
|
|
diagnose(Tok, diag::protocol_method_with_body);
|
|
skipSingle();
|
|
}
|
|
} else if (!Status.hasCodeCompletion()) {
|
|
parseAbstractFunctionBody(FD);
|
|
}
|
|
|
|
return DCC.fixupParserResult(FD);
|
|
}
|
|
|
|
/// Parse a function body for \p AFD, setting the body to \p AFD before
|
|
/// returning it.
|
|
BraceStmt *Parser::parseAbstractFunctionBodyImpl(AbstractFunctionDecl *AFD) {
|
|
assert(Tok.is(tok::l_brace));
|
|
|
|
// Establish the new context.
|
|
ParseFunctionBody CC(*this, AFD);
|
|
setLocalDiscriminatorToParamList(AFD->getParameters());
|
|
|
|
if (auto *Stats = Context.Stats)
|
|
++Stats->getFrontendCounters().NumFunctionsParsed;
|
|
|
|
// In implicit getter, if a CC token is the first token after '{', it might
|
|
// be a start of an accessor block. Perform special completion for that.
|
|
if (auto accessor = dyn_cast<AccessorDecl>(AFD)) {
|
|
if (peekToken().is(tok::code_complete) && accessor->isImplicitGetter()) {
|
|
SourceLoc LBraceLoc, RBraceLoc;
|
|
LBraceLoc = consumeToken(tok::l_brace);
|
|
auto *CCE = new (Context) CodeCompletionExpr(Tok.getLoc());
|
|
CodeCompletion->setParsedDecl(accessor);
|
|
CodeCompletion->completeAccessorBeginning(CCE);
|
|
RBraceLoc = Tok.getLoc();
|
|
consumeToken(tok::code_complete);
|
|
auto *BS = BraceStmt::create(Context, LBraceLoc, ASTNode(CCE), RBraceLoc,
|
|
/*implicit*/ true);
|
|
AFD->setBodyParsed(BS);
|
|
return BS;
|
|
}
|
|
}
|
|
|
|
ParserResult<BraceStmt> Body = parseBraceItemList(diag::invalid_diagnostic);
|
|
if (Body.isNull())
|
|
return nullptr;
|
|
|
|
BraceStmt *BS = Body.get();
|
|
// Reset the single expression body status.
|
|
AFD->setHasSingleExpressionBody(false);
|
|
AFD->setBodyParsed(BS);
|
|
|
|
if (Parser::shouldReturnSingleExpressionElement(BS->getElements())) {
|
|
auto Element = BS->getLastElement();
|
|
if (auto *stmt = Element.dyn_cast<Stmt *>()) {
|
|
if (isa<FuncDecl>(AFD)) {
|
|
if (auto *returnStmt = dyn_cast<ReturnStmt>(stmt)) {
|
|
if (!returnStmt->hasResult()) {
|
|
auto returnExpr = TupleExpr::createEmpty(Context,
|
|
SourceLoc(),
|
|
SourceLoc(),
|
|
/*implicit*/true);
|
|
returnStmt->setResult(returnExpr);
|
|
AFD->setHasSingleExpressionBody();
|
|
AFD->setSingleExpressionBody(returnExpr);
|
|
}
|
|
}
|
|
}
|
|
} else if (auto *E = Element.dyn_cast<Expr *>()) {
|
|
if (auto SE = dyn_cast<SequenceExpr>(E->getSemanticsProvidingExpr())) {
|
|
if (SE->getNumElements() > 1 && isa<AssignExpr>(SE->getElement(1))) {
|
|
// This is an assignment. We don't want to implicitly return
|
|
// it.
|
|
return BS;
|
|
}
|
|
}
|
|
if (isa<FuncDecl>(AFD)) {
|
|
auto RS = new (Context) ReturnStmt(SourceLoc(), E);
|
|
BS->setLastElement(RS);
|
|
AFD->setHasSingleExpressionBody();
|
|
AFD->setSingleExpressionBody(E);
|
|
} else if (auto *F = dyn_cast<ConstructorDecl>(AFD)) {
|
|
if (F->isFailable() && isa<NilLiteralExpr>(E)) {
|
|
// If it's a nil literal, just insert return. This is the only
|
|
// legal thing to return.
|
|
auto RS = new (Context) ReturnStmt(E->getStartLoc(), E);
|
|
BS->setLastElement(RS);
|
|
AFD->setHasSingleExpressionBody();
|
|
AFD->setSingleExpressionBody(E);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return BS;
|
|
}
|
|
|
|
/// Parse function body into \p AFD or skip it for delayed parsing.
|
|
void Parser::parseAbstractFunctionBody(AbstractFunctionDecl *AFD) {
|
|
if (!Tok.is(tok::l_brace)) {
|
|
checkForInputIncomplete();
|
|
return;
|
|
}
|
|
|
|
// Record the curly braces but nothing inside.
|
|
recordTokenHash("{");
|
|
recordTokenHash("}");
|
|
|
|
llvm::SaveAndRestore<Optional<StableHasher>> T(CurrentTokenHash, None);
|
|
|
|
// If we can delay parsing this body, or this is the first pass of code
|
|
// completion, skip until the end. If we encounter a code completion token
|
|
// while skipping, we'll make a note of it.
|
|
if (isDelayedParsingEnabled() || isCodeCompletionFirstPass()) {
|
|
consumeAbstractFunctionBody(AFD, AFD->getAttrs());
|
|
return;
|
|
}
|
|
|
|
(void)parseAbstractFunctionBodyImpl(AFD);
|
|
}
|
|
|
|
BraceStmt *Parser::parseAbstractFunctionBodyDelayed(AbstractFunctionDecl *AFD) {
|
|
assert(AFD->getBodyKind() == AbstractFunctionDecl::BodyKind::Unparsed &&
|
|
"function body should be delayed");
|
|
|
|
auto bodyRange = AFD->getBodySourceRange();
|
|
auto BeginParserPosition = getParserPosition(bodyRange.Start,
|
|
/*previousLoc*/ SourceLoc());
|
|
auto EndLexerState = L->getStateForEndOfTokenLoc(AFD->getEndLoc());
|
|
|
|
// ParserPositionRAII needs a primed parser to restore to.
|
|
if (Tok.is(tok::NUM_TOKENS))
|
|
consumeTokenWithoutFeedingReceiver();
|
|
|
|
// Ensure that we restore the parser state at exit.
|
|
ParserPositionRAII PPR(*this);
|
|
|
|
// Create a lexer that cannot go past the end state.
|
|
Lexer LocalLex(*L, BeginParserPosition.LS, EndLexerState);
|
|
|
|
// Temporarily swap out the parser's current lexer with our new one.
|
|
llvm::SaveAndRestore<Lexer *> T(L, &LocalLex);
|
|
|
|
// Rewind to '{' of the function body.
|
|
restoreParserPosition(BeginParserPosition);
|
|
|
|
return parseAbstractFunctionBodyImpl(AFD);
|
|
}
|
|
|
|
/// Parse a 'enum' declaration, returning true (and doing no token
|
|
/// skipping) on error.
|
|
///
|
|
/// \verbatim
|
|
/// decl-enum:
|
|
/// 'enum' attribute-list identifier generic-params? inheritance?
|
|
/// where-clause? '{' decl-enum-body '}'
|
|
/// decl-enum-body:
|
|
/// decl*
|
|
/// \endverbatim
|
|
ParserResult<EnumDecl> Parser::parseDeclEnum(ParseDeclOptions Flags,
|
|
DeclAttributes &Attributes) {
|
|
SourceLoc EnumLoc = consumeToken(tok::kw_enum);
|
|
|
|
Identifier EnumName;
|
|
SourceLoc EnumNameLoc;
|
|
ParserStatus Status;
|
|
|
|
Status |= parseIdentifierDeclName(
|
|
*this, EnumName, EnumNameLoc, "enum", [&](const Token &next) {
|
|
return next.isAny(tok::colon, tok::l_brace) || startsWithLess(next);
|
|
});
|
|
if (Status.isErrorOrHasCompletion())
|
|
return Status;
|
|
|
|
DebuggerContextChange DCC(*this, EnumName, DeclKind::Enum);
|
|
|
|
// Parse the generic-params, if present.
|
|
GenericParamList *GenericParams = nullptr;
|
|
{
|
|
auto Result = maybeParseGenericParams();
|
|
GenericParams = Result.getPtrOrNull();
|
|
if (Result.hasCodeCompletion())
|
|
return makeParserCodeCompletionStatus();
|
|
}
|
|
|
|
EnumDecl *ED = new (Context) EnumDecl(EnumLoc, EnumName, EnumNameLoc,
|
|
{ }, GenericParams, CurDeclContext);
|
|
setLocalDiscriminator(ED);
|
|
ED->getAttrs() = Attributes;
|
|
|
|
ContextChange CC(*this, ED);
|
|
|
|
// Parse optional inheritance clause within the context of the enum.
|
|
if (Tok.is(tok::colon)) {
|
|
SmallVector<InheritedEntry, 2> Inherited;
|
|
Status |= parseInheritance(Inherited,
|
|
/*allowClassRequirement=*/false,
|
|
/*allowAnyObject=*/false);
|
|
ED->setInherited(Context.AllocateCopy(Inherited));
|
|
}
|
|
|
|
diagnoseWhereClauseInGenericParamList(GenericParams);
|
|
|
|
// Parse a 'where' clause if present.
|
|
if (Tok.is(tok::kw_where)) {
|
|
auto whereStatus = parseFreestandingGenericWhereClause(ED);
|
|
if (whereStatus.hasCodeCompletion() && !CodeCompletion) {
|
|
// Trigger delayed parsing, no need to continue.
|
|
return whereStatus;
|
|
}
|
|
Status |= whereStatus;
|
|
}
|
|
|
|
SyntaxParsingContext BlockContext(SyntaxContext, SyntaxKind::MemberDeclBlock);
|
|
SourceLoc LBLoc, RBLoc;
|
|
{
|
|
if (parseMemberDeclList(LBLoc, RBLoc,
|
|
diag::expected_lbrace_enum,
|
|
diag::expected_rbrace_enum,
|
|
ED))
|
|
Status.setIsParseError();
|
|
}
|
|
|
|
ED->setBraces({LBLoc, RBLoc});
|
|
|
|
return DCC.fixupParserResult(Status, ED);
|
|
}
|
|
|
|
/// Parse a 'case' of an enum.
|
|
///
|
|
/// \verbatim
|
|
/// enum-case:
|
|
/// identifier type-tuple?
|
|
/// decl-enum-element:
|
|
/// 'case' attribute-list enum-case (',' enum-case)*
|
|
/// \endverbatim
|
|
ParserResult<EnumCaseDecl>
|
|
Parser::parseDeclEnumCase(ParseDeclOptions Flags,
|
|
DeclAttributes &Attributes,
|
|
llvm::SmallVectorImpl<Decl *> &Decls) {
|
|
ParserStatus Status;
|
|
SourceLoc CaseLoc = consumeToken(tok::kw_case);
|
|
|
|
// Parse comma-separated enum elements.
|
|
SmallVector<EnumElementDecl*, 4> Elements;
|
|
|
|
SourceLoc CommaLoc;
|
|
for (;;) {
|
|
SyntaxParsingContext ElementContext(SyntaxContext,
|
|
SyntaxKind::EnumCaseElement);
|
|
Identifier Name;
|
|
SourceLoc NameLoc;
|
|
|
|
// Consume an extraneous '.' so we can recover the case name.
|
|
SourceLoc DotLoc;
|
|
consumeIf(tok::period_prefix, DotLoc);
|
|
|
|
// Handle the likely case someone typed 'case X, case Y'.
|
|
if (Tok.is(tok::kw_case) && CommaLoc.isValid()) {
|
|
diagnose(Tok, diag::expected_identifier_after_case_comma);
|
|
break;
|
|
}
|
|
|
|
if (Tok.is(tok::identifier)) {
|
|
Status |= parseIdentifierDeclName(
|
|
*this, Name, NameLoc, "enum 'case'", [](const Token &next) {
|
|
return next.isAny(tok::l_paren, tok::kw_case, tok::colon,
|
|
tok::r_brace);
|
|
});
|
|
assert(Status.isSuccess() && !Status.hasCodeCompletion());
|
|
if (DotLoc.isValid())
|
|
diagnose(DotLoc, diag::enum_case_dot_prefix)
|
|
.fixItRemove(DotLoc);
|
|
} else {
|
|
NameLoc = CaseLoc;
|
|
bool NameIsKeyword = Tok.isKeyword();
|
|
SourceLoc TokLoc = Tok.getLoc();
|
|
StringRef TokText = Tok.getText();
|
|
|
|
// For recovery, see if the user typed something resembling a switch
|
|
// "case" label.
|
|
{
|
|
CancellableBacktrackingScope backtrack(*this);
|
|
llvm::SaveAndRestore<decltype(InVarOrLetPattern)>
|
|
T(InVarOrLetPattern, Parser::IVOLP_InMatchingPattern);
|
|
parseMatchingPattern(/*isExprBasic*/false);
|
|
|
|
if (consumeIf(tok::colon)) {
|
|
backtrack.cancelBacktrack();
|
|
diagnose(CaseLoc, diag::case_outside_of_switch, "case");
|
|
Status.setIsParseError();
|
|
return Status;
|
|
}
|
|
}
|
|
|
|
if (NameIsKeyword) {
|
|
diagnose(TokLoc, diag::keyword_cant_be_identifier, TokText);
|
|
diagnose(TokLoc, diag::backticks_to_escape)
|
|
.fixItReplace(TokLoc, "`" + TokText.str() + "`");
|
|
if (!Tok.isAtStartOfLine()) {
|
|
Name = Context.getIdentifier(Tok.getText());
|
|
NameLoc = consumeToken();
|
|
}
|
|
} else if (CommaLoc.isValid()) {
|
|
diagnose(Tok, diag::expected_identifier_after_case_comma);
|
|
break;
|
|
} else {
|
|
diagnose(CaseLoc, diag::expected_identifier_in_decl, "enum 'case'");
|
|
}
|
|
}
|
|
|
|
// See if there's a following argument type.
|
|
ParserResult<ParameterList> ArgParams;
|
|
SmallVector<Identifier, 4> argumentNames;
|
|
DefaultArgumentInfo DefaultArgs;
|
|
if (Tok.isFollowingLParen()) {
|
|
ArgParams = parseSingleParameterClause(ParameterContextKind::EnumElement,
|
|
&argumentNames, &DefaultArgs);
|
|
if (ArgParams.isNull() || ArgParams.hasCodeCompletion())
|
|
return ParserStatus(ArgParams);
|
|
}
|
|
|
|
// See if there's a raw value expression.
|
|
SourceLoc EqualsLoc;
|
|
ParserResult<Expr> RawValueExpr;
|
|
LiteralExpr *LiteralRawValueExpr = nullptr;
|
|
if (Tok.is(tok::equal)) {
|
|
SyntaxParsingContext InitContext(SyntaxContext,
|
|
SyntaxKind::InitializerClause);
|
|
|
|
EqualsLoc = consumeToken();
|
|
{
|
|
CodeCompletionCallbacks::InEnumElementRawValueRAII
|
|
InEnumElementRawValue(CodeCompletion);
|
|
if (!CurLocalContext) {
|
|
// A local context is needed for parsing closures. We want to parse
|
|
// them anyways for proper diagnosis.
|
|
LocalContext tempContext{};
|
|
CurLocalContext = &tempContext;
|
|
RawValueExpr = parseExpr(diag::expected_expr_enum_case_raw_value);
|
|
CurLocalContext = nullptr;
|
|
} else {
|
|
RawValueExpr = parseExpr(diag::expected_expr_enum_case_raw_value);
|
|
}
|
|
}
|
|
if (RawValueExpr.hasCodeCompletion()) {
|
|
Status.setHasCodeCompletionAndIsError();
|
|
return Status;
|
|
}
|
|
if (RawValueExpr.isNull()) {
|
|
Status.setIsParseError();
|
|
return Status;
|
|
}
|
|
// The raw value must be syntactically a simple literal.
|
|
LiteralRawValueExpr = dyn_cast<LiteralExpr>(RawValueExpr.getPtrOrNull());
|
|
if (!LiteralRawValueExpr
|
|
|| isa<InterpolatedStringLiteralExpr>(LiteralRawValueExpr)) {
|
|
diagnose(RawValueExpr.getPtrOrNull()->getLoc(),
|
|
diag::nonliteral_enum_case_raw_value);
|
|
LiteralRawValueExpr = nullptr;
|
|
}
|
|
}
|
|
|
|
// For recovery, again make sure the user didn't try to spell a switch
|
|
// case label:
|
|
// 'case Identifier:' or
|
|
// 'case Identifier where ...:'
|
|
if (Tok.is(tok::colon) || Tok.is(tok::kw_where)) {
|
|
diagnose(CaseLoc, diag::case_outside_of_switch, "case");
|
|
skipUntilDeclRBrace();
|
|
Status.setIsParseError();
|
|
return Status;
|
|
}
|
|
|
|
|
|
// Create the element.
|
|
DeclName FullName;
|
|
if (ArgParams.isNull()) {
|
|
FullName = Name;
|
|
} else {
|
|
FullName = DeclName(Context, Name, argumentNames);
|
|
}
|
|
auto *result = new (Context) EnumElementDecl(NameLoc, FullName,
|
|
ArgParams.getPtrOrNull(),
|
|
EqualsLoc,
|
|
LiteralRawValueExpr,
|
|
CurDeclContext);
|
|
|
|
DefaultArgs.setFunctionContext(result, result->getParameterList());
|
|
|
|
if (NameLoc == CaseLoc) {
|
|
result->setImplicit(); // Parse error
|
|
}
|
|
|
|
result->getAttrs() = Attributes;
|
|
Elements.push_back(result);
|
|
|
|
// Continue through the comma-separated list.
|
|
if (!Tok.is(tok::comma))
|
|
break;
|
|
CommaLoc = consumeToken(tok::comma);
|
|
}
|
|
SyntaxContext->collectNodesInPlace(SyntaxKind::EnumCaseElementList);
|
|
|
|
if (!(Flags & PD_AllowEnumElement)) {
|
|
diagnose(CaseLoc, diag::disallowed_enum_element);
|
|
// Don't add the EnumElementDecls unless the current context
|
|
// is allowed to have EnumElementDecls.
|
|
Status.setIsParseError();
|
|
return Status;
|
|
}
|
|
|
|
// Create and insert the EnumCaseDecl containing all the elements.
|
|
auto TheCase = EnumCaseDecl::create(CaseLoc, Elements, CurDeclContext);
|
|
Decls.push_back(TheCase);
|
|
|
|
// Insert the element decls.
|
|
std::copy(Elements.begin(), Elements.end(), std::back_inserter(Decls));
|
|
return makeParserResult(Status, TheCase);
|
|
}
|
|
|
|
/// Parse a 'struct' declaration, returning true (and doing no token
|
|
/// skipping) on error.
|
|
///
|
|
/// \verbatim
|
|
/// decl-struct:
|
|
/// 'struct' attribute-list identifier generic-params? inheritance?
|
|
/// where-clause? '{' decl-struct-body '}
|
|
/// decl-struct-body:
|
|
/// decl*
|
|
/// \endverbatim
|
|
ParserResult<StructDecl> Parser::parseDeclStruct(ParseDeclOptions Flags,
|
|
DeclAttributes &Attributes) {
|
|
SourceLoc StructLoc = consumeToken(tok::kw_struct);
|
|
|
|
Identifier StructName;
|
|
SourceLoc StructNameLoc;
|
|
ParserStatus Status;
|
|
|
|
Status |= parseIdentifierDeclName(
|
|
*this, StructName, StructNameLoc, "struct", [&](const Token &next) {
|
|
return next.isAny(tok::colon, tok::l_brace) || startsWithLess(next);
|
|
});
|
|
if (Status.isErrorOrHasCompletion())
|
|
return Status;
|
|
|
|
DebuggerContextChange DCC (*this, StructName, DeclKind::Struct);
|
|
|
|
// Parse the generic-params, if present.
|
|
GenericParamList *GenericParams = nullptr;
|
|
{
|
|
auto Result = maybeParseGenericParams();
|
|
GenericParams = Result.getPtrOrNull();
|
|
if (Result.hasCodeCompletion())
|
|
return makeParserCodeCompletionStatus();
|
|
}
|
|
|
|
StructDecl *SD = new (Context) StructDecl(StructLoc, StructName,
|
|
StructNameLoc,
|
|
{ },
|
|
GenericParams,
|
|
CurDeclContext);
|
|
setLocalDiscriminator(SD);
|
|
SD->getAttrs() = Attributes;
|
|
|
|
ContextChange CC(*this, SD);
|
|
|
|
// Parse optional inheritance clause within the context of the struct.
|
|
if (Tok.is(tok::colon)) {
|
|
SmallVector<InheritedEntry, 2> Inherited;
|
|
Status |= parseInheritance(Inherited,
|
|
/*allowClassRequirement=*/false,
|
|
/*allowAnyObject=*/false);
|
|
SD->setInherited(Context.AllocateCopy(Inherited));
|
|
}
|
|
|
|
diagnoseWhereClauseInGenericParamList(GenericParams);
|
|
|
|
// Parse a 'where' clause if present.
|
|
if (Tok.is(tok::kw_where)) {
|
|
auto whereStatus = parseFreestandingGenericWhereClause(SD);
|
|
if (whereStatus.hasCodeCompletion() && !CodeCompletion) {
|
|
// Trigger delayed parsing, no need to continue.
|
|
return whereStatus;
|
|
}
|
|
Status |= whereStatus;
|
|
}
|
|
|
|
// Make the entities of the struct as a code block.
|
|
SyntaxParsingContext BlockContext(SyntaxContext, SyntaxKind::MemberDeclBlock);
|
|
SourceLoc LBLoc, RBLoc;
|
|
{
|
|
// Parse the body.
|
|
if (parseMemberDeclList(LBLoc, RBLoc,
|
|
diag::expected_lbrace_struct,
|
|
diag::expected_rbrace_struct,
|
|
SD))
|
|
Status.setIsParseError();
|
|
}
|
|
|
|
SD->setBraces({LBLoc, RBLoc});
|
|
|
|
return DCC.fixupParserResult(Status, SD);
|
|
}
|
|
|
|
/// Parse a 'class' declaration, doing no token skipping on error.
|
|
///
|
|
/// \verbatim
|
|
/// decl-class:
|
|
/// 'class' attribute-list identifier generic-params? inheritance?
|
|
/// where-clause? '{' decl-class-body '}
|
|
/// decl-class-body:
|
|
/// decl*
|
|
/// \endverbatim
|
|
ParserResult<ClassDecl> Parser::parseDeclClass(ParseDeclOptions Flags,
|
|
DeclAttributes &Attributes) {
|
|
bool isExplicitActorDecl = Tok.isContextualKeyword("actor");
|
|
|
|
// part of
|
|
SourceLoc ClassLoc;
|
|
if (isExplicitActorDecl) {
|
|
ClassLoc = consumeToken();
|
|
} else {
|
|
ClassLoc = consumeToken(tok::kw_class);
|
|
}
|
|
|
|
Identifier ClassName;
|
|
SourceLoc ClassNameLoc;
|
|
ParserStatus Status;
|
|
|
|
Status |= parseIdentifierDeclName(
|
|
*this, ClassName, ClassNameLoc, isExplicitActorDecl ? "actor" : "class",
|
|
[&](const Token &next) {
|
|
return next.isAny(tok::colon, tok::l_brace) || startsWithLess(next);
|
|
});
|
|
if (Status.isErrorOrHasCompletion())
|
|
return Status;
|
|
|
|
DebuggerContextChange DCC (*this, ClassName, DeclKind::Class);
|
|
|
|
// Parse the generic-params, if present.
|
|
GenericParamList *GenericParams = nullptr;
|
|
{
|
|
auto Result = maybeParseGenericParams();
|
|
GenericParams = Result.getPtrOrNull();
|
|
if (Result.hasCodeCompletion())
|
|
return makeParserCodeCompletionStatus();
|
|
}
|
|
|
|
// Create the class.
|
|
ClassDecl *CD = new (Context) ClassDecl(ClassLoc, ClassName, ClassNameLoc,
|
|
{ }, GenericParams, CurDeclContext,
|
|
isExplicitActorDecl);
|
|
setLocalDiscriminator(CD);
|
|
CD->getAttrs() = Attributes;
|
|
|
|
// Parsed classes never have missing vtable entries.
|
|
CD->setHasMissingVTableEntries(false);
|
|
|
|
ContextChange CC(*this, CD);
|
|
|
|
// Parse optional inheritance clause within the context of the class.
|
|
if (Tok.is(tok::colon)) {
|
|
SmallVector<InheritedEntry, 2> Inherited;
|
|
Status |= parseInheritance(Inherited,
|
|
/*allowClassRequirement=*/false,
|
|
/*allowAnyObject=*/false);
|
|
CD->setInherited(Context.AllocateCopy(Inherited));
|
|
|
|
// Parse python style inheritance clause and replace parentheses with a colon
|
|
} else if (Tok.is(tok::l_paren)) {
|
|
bool isParenStyleInheritance = false;
|
|
{
|
|
BacktrackingScope backtrack(*this);
|
|
consumeToken(tok::l_paren);
|
|
isParenStyleInheritance = canParseType() &&
|
|
Tok.isAny(tok::r_paren, tok::kw_where, tok::l_brace, tok::eof);
|
|
}
|
|
if(isParenStyleInheritance) {
|
|
SourceLoc LParenLoc = consumeToken(tok::l_paren);
|
|
auto TypeResult = parseType();
|
|
if (TypeResult.isNull()) {
|
|
Status.setIsParseError();
|
|
return Status;
|
|
}
|
|
SourceLoc RParenLoc;
|
|
consumeIf(tok::r_paren, RParenLoc);
|
|
diagnose(LParenLoc, diag::expected_colon_class)
|
|
.fixItReplace(LParenLoc, ": ")
|
|
.fixItRemove(RParenLoc);
|
|
}
|
|
}
|
|
|
|
diagnoseWhereClauseInGenericParamList(GenericParams);
|
|
|
|
// Parse a 'where' clause if present.
|
|
if (Tok.is(tok::kw_where)) {
|
|
auto whereStatus = parseFreestandingGenericWhereClause(CD);
|
|
if (whereStatus.hasCodeCompletion() && !CodeCompletion) {
|
|
// Trigger delayed parsing, no need to continue.
|
|
return whereStatus;
|
|
}
|
|
Status |= whereStatus;
|
|
}
|
|
|
|
SyntaxParsingContext BlockContext(SyntaxContext, SyntaxKind::MemberDeclBlock);
|
|
SourceLoc LBLoc, RBLoc;
|
|
{
|
|
// Parse the body.
|
|
if (parseMemberDeclList(LBLoc, RBLoc,
|
|
diag::expected_lbrace_class,
|
|
diag::expected_rbrace_class,
|
|
CD))
|
|
Status.setIsParseError();
|
|
}
|
|
|
|
CD->setBraces({LBLoc, RBLoc});
|
|
|
|
return DCC.fixupParserResult(Status, CD);
|
|
}
|
|
|
|
/// Parse a 'protocol' declaration, doing no token skipping on error.
|
|
///
|
|
/// \verbatim
|
|
/// decl-protocol:
|
|
/// protocol-head '{' protocol-member* '}'
|
|
///
|
|
/// protocol-head:
|
|
/// 'protocol' attribute-list identifier inheritance?
|
|
///
|
|
/// protocol-member:
|
|
/// decl-func
|
|
/// decl-var-simple
|
|
/// decl-typealias
|
|
/// \endverbatim
|
|
ParserResult<ProtocolDecl> Parser::
|
|
parseDeclProtocol(ParseDeclOptions Flags, DeclAttributes &Attributes) {
|
|
SourceLoc ProtocolLoc = consumeToken(tok::kw_protocol);
|
|
|
|
SourceLoc NameLoc;
|
|
Identifier ProtocolName;
|
|
ParserStatus Status;
|
|
|
|
Status |= parseIdentifierDeclName(
|
|
*this, ProtocolName, NameLoc, "protocol",
|
|
[&](const Token &next) { return next.isAny(tok::colon, tok::l_brace); });
|
|
if (Status.isErrorOrHasCompletion())
|
|
return Status;
|
|
|
|
// Protocols don't support generic parameters, but people often want them and
|
|
// we want to have good error recovery if they try them out. Parse them and
|
|
// produce a specific diagnostic if present.
|
|
if (startsWithLess(Tok)) {
|
|
diagnose(Tok, diag::generic_arguments_protocol);
|
|
maybeParseGenericParams();
|
|
}
|
|
|
|
DebuggerContextChange DCC (*this);
|
|
|
|
// Parse optional inheritance clause.
|
|
SmallVector<InheritedEntry, 4> InheritedProtocols;
|
|
SourceLoc colonLoc;
|
|
if (Tok.is(tok::colon)) {
|
|
colonLoc = Tok.getLoc();
|
|
Status |= parseInheritance(InheritedProtocols,
|
|
/*allowClassRequirement=*/true,
|
|
/*allowAnyObject=*/true);
|
|
}
|
|
|
|
TrailingWhereClause *TrailingWhere = nullptr;
|
|
bool whereClauseHadCodeCompletion = false;
|
|
// Parse a 'where' clause if present.
|
|
if (Tok.is(tok::kw_where)) {
|
|
auto whereStatus = parseProtocolOrAssociatedTypeWhereClause(
|
|
TrailingWhere, /*isProtocol=*/true);
|
|
if (whereStatus.hasCodeCompletion()) {
|
|
if (isCodeCompletionFirstPass())
|
|
return whereStatus;
|
|
whereClauseHadCodeCompletion = true;
|
|
}
|
|
}
|
|
|
|
ProtocolDecl *Proto = new (Context)
|
|
ProtocolDecl(CurDeclContext, ProtocolLoc, NameLoc, ProtocolName,
|
|
Context.AllocateCopy(InheritedProtocols), TrailingWhere);
|
|
// No need to setLocalDiscriminator: protocols can't appear in local contexts.
|
|
|
|
Proto->getAttrs() = Attributes;
|
|
if (whereClauseHadCodeCompletion && CodeCompletion)
|
|
CodeCompletion->setParsedDecl(Proto);
|
|
|
|
ContextChange CC(*this, Proto);
|
|
|
|
// Parse the body.
|
|
{
|
|
SyntaxParsingContext BlockContext(SyntaxContext, SyntaxKind::MemberDeclBlock);
|
|
SourceLoc LBraceLoc;
|
|
SourceLoc RBraceLoc;
|
|
{
|
|
// Parse the members.
|
|
if (parseMemberDeclList(LBraceLoc, RBraceLoc,
|
|
diag::expected_lbrace_protocol,
|
|
diag::expected_rbrace_protocol,
|
|
Proto))
|
|
Status.setIsParseError();
|
|
}
|
|
|
|
// Install the protocol elements.
|
|
Proto->setBraces({LBraceLoc, RBraceLoc});
|
|
}
|
|
|
|
return DCC.fixupParserResult(Status, Proto);
|
|
}
|
|
|
|
/// Parse a 'subscript' declaration.
|
|
///
|
|
/// \verbatim
|
|
/// decl-subscript:
|
|
/// subscript-head get-set
|
|
/// subscript-head
|
|
/// attribute-list? 'subscript' parameter-clause '->' type
|
|
/// \endverbatim
|
|
ParserResult<SubscriptDecl>
|
|
Parser::parseDeclSubscript(SourceLoc StaticLoc,
|
|
StaticSpellingKind StaticSpelling,
|
|
ParseDeclOptions Flags,
|
|
DeclAttributes &Attributes,
|
|
SmallVectorImpl<Decl *> &Decls) {
|
|
assert(StaticLoc.isInvalid() || StaticSpelling != StaticSpellingKind::None);
|
|
|
|
if (StaticLoc.isValid()) {
|
|
if (Flags.contains(PD_InStruct) || Flags.contains(PD_InEnum) ||
|
|
Flags.contains(PD_InProtocol)) {
|
|
if (StaticSpelling == StaticSpellingKind::KeywordClass) {
|
|
diagnose(Tok, diag::class_subscript_not_in_class,
|
|
Flags.contains(PD_InProtocol))
|
|
.fixItReplace(StaticLoc, "static");
|
|
|
|
StaticSpelling = StaticSpellingKind::KeywordStatic;
|
|
}
|
|
}
|
|
}
|
|
|
|
ParserStatus Status;
|
|
SourceLoc SubscriptLoc = consumeToken(tok::kw_subscript);
|
|
|
|
// Diagnose 'subscript' with name.
|
|
if (Tok.is(tok::identifier) &&
|
|
(peekToken().is(tok::l_paren) || startsWithLess(peekToken()))) {
|
|
diagnose(Tok, diag::subscript_has_name)
|
|
.fixItRemove(Tok.getLoc());
|
|
consumeToken(tok::identifier);
|
|
}
|
|
|
|
// Parse the generic-params, if present.
|
|
GenericParamList *GenericParams;
|
|
|
|
auto Result = maybeParseGenericParams();
|
|
GenericParams = Result.getPtrOrNull();
|
|
if (Result.hasCodeCompletion()) {
|
|
Status.setHasCodeCompletionAndIsError();
|
|
if (!CodeCompletion)
|
|
return Status;
|
|
}
|
|
|
|
// Parse the parameter list.
|
|
DefaultArgumentInfo DefaultArgs;
|
|
SmallVector<Identifier, 4> argumentNames;
|
|
ParserResult<ParameterList> Indices
|
|
= parseSingleParameterClause(ParameterContextKind::Subscript,
|
|
&argumentNames, &DefaultArgs);
|
|
Status |= Indices;
|
|
if (Status.hasCodeCompletion() && !CodeCompletion)
|
|
return Status;
|
|
|
|
SourceLoc ArrowLoc;
|
|
ParserResult<TypeRepr> ElementTy;
|
|
{
|
|
SyntaxParsingContext ReturnCtxt(SyntaxContext, SyntaxKind::ReturnClause);
|
|
|
|
// '->'
|
|
if (!consumeIf(tok::arrow, ArrowLoc)) {
|
|
if (!Indices.isParseErrorOrHasCompletion())
|
|
diagnose(Tok, diag::expected_arrow_subscript);
|
|
Status.setIsParseError();
|
|
}
|
|
|
|
if (!ArrowLoc.isValid() &&
|
|
(Indices.isNull() || Indices.get()->size() == 0)) {
|
|
// This doesn't look much like a subscript, so let regular recovery take
|
|
// care of it.
|
|
return Status;
|
|
}
|
|
|
|
// type
|
|
ElementTy = parseDeclResultType(diag::expected_type_subscript);
|
|
Status |= ElementTy;
|
|
if (Status.hasCodeCompletion() && !CodeCompletion)
|
|
return Status;
|
|
|
|
if (ElementTy.isNull()) {
|
|
// Always set an element type.
|
|
ElementTy = makeParserResult(ElementTy, new (Context) ErrorTypeRepr());
|
|
}
|
|
}
|
|
|
|
diagnoseWhereClauseInGenericParamList(GenericParams);
|
|
|
|
// Protocol requirement arguments may not have default values.
|
|
if (Flags.contains(PD_InProtocol) && DefaultArgs.HasDefaultArgument) {
|
|
diagnose(SubscriptLoc, diag::protocol_subscript_argument_init);
|
|
return nullptr;
|
|
}
|
|
|
|
// Build an AST for the subscript declaration.
|
|
DeclName name = DeclName(Context, DeclBaseName::createSubscript(),
|
|
argumentNames);
|
|
auto *const Subscript = SubscriptDecl::create(
|
|
Context, name, StaticLoc, StaticSpelling, SubscriptLoc, Indices.get(),
|
|
ArrowLoc, ElementTy.get(), CurDeclContext, GenericParams);
|
|
Subscript->getAttrs() = Attributes;
|
|
|
|
// Let the source file track the opaque return type mapping, if any.
|
|
if (isa_and_nonnull<OpaqueReturnTypeRepr>(ElementTy.get()) &&
|
|
!InInactiveClauseEnvironment) {
|
|
if (auto sf = CurDeclContext->getParentSourceFile()) {
|
|
sf->addUnvalidatedDeclWithOpaqueResultType(Subscript);
|
|
}
|
|
}
|
|
|
|
DefaultArgs.setFunctionContext(Subscript, Subscript->getIndices());
|
|
|
|
// Parse a 'where' clause if present.
|
|
if (Tok.is(tok::kw_where)) {
|
|
ContextChange CC(*this, Subscript);
|
|
|
|
Status |= parseFreestandingGenericWhereClause(Subscript);
|
|
if (Status.hasCodeCompletion() && !CodeCompletion) {
|
|
// Trigger delayed parsing, no need to continue.
|
|
return Status;
|
|
}
|
|
}
|
|
|
|
// Pass the function signature to code completion.
|
|
if (Status.hasCodeCompletion()) {
|
|
assert(CodeCompletion && "must be code completion second pass");
|
|
CodeCompletion->setParsedDecl(Subscript);
|
|
}
|
|
|
|
Decls.push_back(Subscript);
|
|
|
|
// '{'
|
|
// Parse getter and setter.
|
|
ParsedAccessors accessors;
|
|
if (Tok.isNot(tok::l_brace)) {
|
|
// Subscript declarations must always have at least a getter, so they need
|
|
// to be followed by a {.
|
|
if (!Status.isErrorOrHasCompletion()) {
|
|
if (Flags.contains(PD_InProtocol)) {
|
|
diagnose(Tok, diag::expected_lbrace_subscript_protocol)
|
|
.fixItInsertAfter(ElementTy.get()->getEndLoc(), " { get <#set#> }");
|
|
} else {
|
|
diagnose(Tok, diag::expected_lbrace_subscript);
|
|
}
|
|
Status.setIsParseError();
|
|
}
|
|
} else if (!Status.hasCodeCompletion()) {
|
|
Status |= parseGetSet(Flags, GenericParams, Indices.get(),
|
|
accessors, Subscript, StaticLoc);
|
|
}
|
|
|
|
// Now that it's been parsed, set the end location.
|
|
Subscript->setEndLoc(PreviousLoc);
|
|
|
|
bool Invalid = false;
|
|
// Reject 'subscript' functions outside of type decls
|
|
if (!(Flags & PD_HasContainerType)) {
|
|
diagnose(SubscriptLoc, diag::subscript_decl_wrong_scope);
|
|
Invalid = true;
|
|
}
|
|
|
|
accessors.record(*this, Subscript, (Invalid || !Status.isSuccess() ||
|
|
Status.hasCodeCompletion()));
|
|
|
|
// Set original declaration in `@differentiable` attributes.
|
|
for (auto *accessor : accessors.Accessors)
|
|
setOriginalDeclarationForDifferentiableAttributes(accessor->getAttrs(),
|
|
accessor);
|
|
|
|
// No need to setLocalDiscriminator because subscripts cannot
|
|
// validly appear outside of type decls.
|
|
return makeParserResult(Status, Subscript);
|
|
}
|
|
|
|
ParserResult<ConstructorDecl>
|
|
Parser::parseDeclInit(ParseDeclOptions Flags, DeclAttributes &Attributes) {
|
|
assert(Tok.is(tok::kw_init));
|
|
ParserStatus Status;
|
|
SourceLoc ConstructorLoc = consumeToken();
|
|
bool Failable = false, IUO = false;
|
|
SourceLoc FailabilityLoc;
|
|
|
|
const bool ConstructorsNotAllowed = !(Flags & PD_HasContainerType);
|
|
|
|
// Reject constructors outside of types.
|
|
if (ConstructorsNotAllowed) {
|
|
diagnose(Tok, diag::initializer_decl_wrong_scope);
|
|
}
|
|
|
|
// Parse the '!' or '?' for a failable initializer.
|
|
if (Tok.isAny(tok::exclaim_postfix, tok::sil_exclamation) ||
|
|
(Tok.isAnyOperator() && Tok.getText() == "!")) {
|
|
Failable = true;
|
|
IUO = true;
|
|
FailabilityLoc = consumeToken();
|
|
} else if (Tok.isAny(tok::question_postfix, tok::question_infix)) {
|
|
Failable = true;
|
|
FailabilityLoc = consumeToken();
|
|
}
|
|
|
|
// Reject named 'init'. e.g. 'init withString(string: str)'.
|
|
if (Tok.is(tok::identifier) &&
|
|
(peekToken().is(tok::l_paren) || startsWithLess(peekToken()))) {
|
|
diagnose(Tok, diag::initializer_has_name)
|
|
.fixItRemove(Tok.getLoc());
|
|
consumeToken(tok::identifier);
|
|
}
|
|
|
|
// Parse the generic-params, if present.
|
|
auto GPResult = maybeParseGenericParams();
|
|
GenericParamList *GenericParams = GPResult.getPtrOrNull();
|
|
if (GPResult.hasCodeCompletion()) {
|
|
Status.setHasCodeCompletionAndIsError();
|
|
if (!CodeCompletion)
|
|
return Status;
|
|
}
|
|
|
|
// Parse the parameters.
|
|
DefaultArgumentInfo DefaultArgs;
|
|
llvm::SmallVector<Identifier, 4> namePieces;
|
|
ParserResult<ParameterList> Params
|
|
= parseSingleParameterClause(ParameterContextKind::Initializer,
|
|
&namePieces, &DefaultArgs);
|
|
Status |= Params;
|
|
if (Status.hasCodeCompletion() && !CodeCompletion) {
|
|
// Trigger delayed parsing, no need to continue.
|
|
return Status;
|
|
}
|
|
|
|
// Protocol initializer arguments may not have default values.
|
|
if (Flags.contains(PD_InProtocol) && DefaultArgs.HasDefaultArgument) {
|
|
diagnose(ConstructorLoc, diag::protocol_init_argument_init);
|
|
return nullptr;
|
|
}
|
|
|
|
// Parse 'async' / 'reasync' / 'throws' / 'rethrows'.
|
|
SourceLoc asyncLoc;
|
|
bool reasync = false;
|
|
SourceLoc throwsLoc;
|
|
bool rethrows = false;
|
|
Status |= parseEffectsSpecifiers(SourceLoc(),
|
|
asyncLoc, &reasync,
|
|
throwsLoc, &rethrows);
|
|
if (Status.hasCodeCompletion() && !CodeCompletion) {
|
|
// Trigger delayed parsing, no need to continue.
|
|
return Status;
|
|
}
|
|
|
|
if (reasync) {
|
|
Attributes.add(new (Context) ReasyncAttr(asyncLoc));
|
|
}
|
|
if (rethrows) {
|
|
Attributes.add(new (Context) RethrowsAttr(throwsLoc));
|
|
}
|
|
|
|
diagnoseWhereClauseInGenericParamList(GenericParams);
|
|
|
|
DeclName FullName(Context, DeclBaseName::createConstructor(), namePieces);
|
|
auto *CD = new (Context) ConstructorDecl(FullName, ConstructorLoc,
|
|
Failable, FailabilityLoc,
|
|
asyncLoc.isValid(), asyncLoc,
|
|
throwsLoc.isValid(), throwsLoc,
|
|
Params.get(), GenericParams,
|
|
CurDeclContext);
|
|
CD->setImplicitlyUnwrappedOptional(IUO);
|
|
CD->getAttrs() = Attributes;
|
|
|
|
// Parse a 'where' clause if present.
|
|
if (Tok.is(tok::kw_where)) {
|
|
ContextChange(*this, CD);
|
|
|
|
Status |= parseFreestandingGenericWhereClause(CD);
|
|
if (Status.hasCodeCompletion() && !CodeCompletion) {
|
|
// Trigger delayed parsing, no need to continue.
|
|
return Status;
|
|
}
|
|
}
|
|
|
|
// No need to setLocalDiscriminator.
|
|
|
|
DefaultArgs.setFunctionContext(CD, CD->getParameters());
|
|
|
|
// Pass the function signature to code completion.
|
|
if (Status.hasCodeCompletion()) {
|
|
assert(CodeCompletion && "must be code completion second pass");
|
|
CodeCompletion->setParsedDecl(CD);
|
|
}
|
|
|
|
if (ConstructorsNotAllowed || Params.isParseErrorOrHasCompletion()) {
|
|
// Tell the type checker not to touch this constructor.
|
|
CD->setInvalid();
|
|
}
|
|
|
|
if (Flags.contains(PD_InProtocol)) {
|
|
if (Tok.is(tok::l_brace)) {
|
|
diagnose(Tok, diag::protocol_init_with_body);
|
|
skipSingle();
|
|
}
|
|
} else if(!Status.hasCodeCompletion()) {
|
|
parseAbstractFunctionBody(CD);
|
|
}
|
|
|
|
return makeParserResult(Status, CD);
|
|
}
|
|
|
|
ParserResult<DestructorDecl> Parser::
|
|
parseDeclDeinit(ParseDeclOptions Flags, DeclAttributes &Attributes) {
|
|
SourceLoc DestructorLoc = consumeToken(tok::kw_deinit);
|
|
|
|
// Parse extraneous parentheses and remove them with a fixit.
|
|
auto skipParameterListIfPresent = [this] {
|
|
SourceLoc LParenLoc;
|
|
if (!consumeIf(tok::l_paren, LParenLoc))
|
|
return;
|
|
SourceLoc RParenLoc;
|
|
skipUntil(tok::r_paren);
|
|
|
|
if (Tok.is(tok::r_paren)) {
|
|
SourceLoc RParenLoc = consumeToken();
|
|
diagnose(LParenLoc, diag::destructor_params)
|
|
.fixItRemove(SourceRange(LParenLoc, RParenLoc));
|
|
} else {
|
|
diagnose(Tok, diag::opened_destructor_expected_rparen);
|
|
diagnose(LParenLoc, diag::opening_paren);
|
|
}
|
|
};
|
|
|
|
// '{'
|
|
if (!Tok.is(tok::l_brace)) {
|
|
switch (SF.Kind) {
|
|
case SourceFileKind::Interface:
|
|
case SourceFileKind::SIL:
|
|
// It's okay to have no body for SIL code or module interfaces.
|
|
break;
|
|
case SourceFileKind::Library:
|
|
case SourceFileKind::Main:
|
|
if (Tok.is(tok::identifier)) {
|
|
diagnose(Tok, diag::destructor_has_name).fixItRemove(Tok.getLoc());
|
|
consumeToken();
|
|
}
|
|
skipParameterListIfPresent();
|
|
if (Tok.is(tok::l_brace))
|
|
break;
|
|
|
|
diagnose(Tok, diag::expected_lbrace_destructor);
|
|
return nullptr;
|
|
}
|
|
}
|
|
|
|
auto *DD = new (Context) DestructorDecl(DestructorLoc, CurDeclContext);
|
|
parseAbstractFunctionBody(DD);
|
|
|
|
DD->getAttrs() = Attributes;
|
|
|
|
// Reject 'destructor' functions outside of classes
|
|
if (!(Flags & PD_AllowDestructor)) {
|
|
diagnose(DestructorLoc, diag::destructor_decl_outside_class);
|
|
|
|
// Tell the type checker not to touch this destructor.
|
|
DD->setInvalid();
|
|
}
|
|
|
|
return makeParserResult(DD);
|
|
}
|
|
|
|
ParserResult<OperatorDecl>
|
|
Parser::parseDeclOperator(ParseDeclOptions Flags, DeclAttributes &Attributes) {
|
|
SourceLoc OperatorLoc = consumeToken(tok::kw_operator);
|
|
bool AllowTopLevel = Flags.contains(PD_AllowTopLevel);
|
|
|
|
const auto maybeDiagnoseInvalidCharInOperatorName = [this](const Token &Tk) {
|
|
if (Tk.is(tok::identifier)) {
|
|
if (Tk.getText().equals("$") ||
|
|
DeclAttribute::getAttrKindFromString(Tk.getText()) ==
|
|
DeclAttrKind::DAK_Count) {
|
|
diagnose(Tk, diag::identifier_within_operator_name, Tk.getText());
|
|
return true;
|
|
}
|
|
} else if (Tk.isNot(tok::colon, tok::l_brace, tok::semi) &&
|
|
Tk.isPunctuation()) {
|
|
diagnose(Tk, diag::operator_name_invalid_char,
|
|
Tk.getText().take_front());
|
|
return true;
|
|
}
|
|
return false;
|
|
};
|
|
|
|
// Postfix operators starting with ? or ! conflict with builtin
|
|
// unwrapping operators.
|
|
if (Attributes.hasAttribute<PostfixAttr>())
|
|
if (!Tok.getText().empty() && (Tok.getRawText().front() == '?' ||
|
|
Tok.getRawText().front() == '!'))
|
|
diagnose(Tok, diag::postfix_operator_name_cannot_start_with_unwrap);
|
|
|
|
// A common error is to try to define an operator with something in the
|
|
// unicode plane considered to be an operator, or to try to define an
|
|
// operator like "not". Analyze and diagnose this specifically.
|
|
if (Tok.isAnyOperator() || Tok.isAny(tok::exclaim_postfix,
|
|
tok::question_infix,
|
|
tok::question_postfix,
|
|
tok::equal, tok::arrow)) {
|
|
if (peekToken().getLoc() == Tok.getRange().getEnd() &&
|
|
maybeDiagnoseInvalidCharInOperatorName(peekToken())) {
|
|
consumeToken();
|
|
|
|
// If there's a deprecated body, skip it to improve recovery.
|
|
if (peekToken().is(tok::l_brace)) {
|
|
consumeToken();
|
|
skipSingle();
|
|
}
|
|
return nullptr;
|
|
}
|
|
} else {
|
|
if (maybeDiagnoseInvalidCharInOperatorName(Tok)) {
|
|
// We're done diagnosing.
|
|
} else {
|
|
diagnose(Tok, diag::expected_operator_name_after_operator);
|
|
}
|
|
|
|
// If there's a deprecated body, skip it to improve recovery.
|
|
if (peekToken().is(tok::l_brace)) {
|
|
consumeToken();
|
|
skipSingle();
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
DebuggerContextChange DCC (*this);
|
|
|
|
Identifier Name = Context.getIdentifier(Tok.getText());
|
|
SourceLoc NameLoc = consumeToken();
|
|
|
|
auto Result = parseDeclOperatorImpl(OperatorLoc, Name, NameLoc, Attributes);
|
|
|
|
if (!DCC.movedToTopLevel() && !AllowTopLevel) {
|
|
diagnose(OperatorLoc, diag::operator_decl_inner_scope);
|
|
return nullptr;
|
|
}
|
|
|
|
return DCC.fixupParserResult(Result);
|
|
}
|
|
|
|
ParserResult<OperatorDecl>
|
|
Parser::parseDeclOperatorImpl(SourceLoc OperatorLoc, Identifier Name,
|
|
SourceLoc NameLoc, DeclAttributes &Attributes) {
|
|
bool isPrefix = Attributes.hasAttribute<PrefixAttr>();
|
|
bool isInfix = Attributes.hasAttribute<InfixAttr>();
|
|
bool isPostfix = Attributes.hasAttribute<PostfixAttr>();
|
|
|
|
// Parse (or diagnose) a specified precedence group and/or
|
|
// designated protocol. These both look like identifiers, so we
|
|
// parse them both as identifiers here and sort it out in type
|
|
// checking.
|
|
SourceLoc colonLoc, groupLoc;
|
|
Identifier groupName;
|
|
if (Tok.is(tok::colon)) {
|
|
SyntaxParsingContext GroupCtxt(SyntaxContext,
|
|
SyntaxKind::OperatorPrecedenceAndTypes);
|
|
colonLoc = consumeToken();
|
|
if (Tok.is(tok::code_complete)) {
|
|
if (CodeCompletion && !isPrefix && !isPostfix) {
|
|
CodeCompletion->completeInPrecedenceGroup(
|
|
SyntaxKind::PrecedenceGroupRelation);
|
|
}
|
|
consumeToken();
|
|
|
|
return makeParserCodeCompletionResult<OperatorDecl>();
|
|
}
|
|
|
|
SyntaxParsingContext ListCtxt(SyntaxContext, SyntaxKind::IdentifierList);
|
|
|
|
(void)parseIdentifier(groupName, groupLoc,
|
|
diag::operator_decl_expected_precedencegroup,
|
|
/*diagnoseDollarPrefix=*/false);
|
|
|
|
if (Context.TypeCheckerOpts.EnableOperatorDesignatedTypes) {
|
|
// Designated types have been removed; consume the list (mainly for source
|
|
// compatibility with old swiftinterfaces) and emit a warning.
|
|
|
|
// These SourceLocs point to the ends of the designated type list. If
|
|
// `typesEndLoc` never becomes valid, we didn't find any designated types.
|
|
SourceLoc typesStartLoc = Tok.getLoc();
|
|
SourceLoc typesEndLoc;
|
|
|
|
if (isPrefix || isPostfix) {
|
|
// These have no precedence group, so we already parsed the first entry
|
|
// in the designated types list. Retroactively include it in the range.
|
|
typesStartLoc = colonLoc;
|
|
typesEndLoc = groupLoc;
|
|
}
|
|
|
|
while (consumeIf(tok::comma, typesEndLoc)) {
|
|
if (Tok.isNot(tok::eof))
|
|
typesEndLoc = consumeToken();
|
|
}
|
|
|
|
if (typesEndLoc.isValid())
|
|
diagnose(typesStartLoc, diag::operator_decl_remove_designated_types)
|
|
.fixItRemove({typesStartLoc, typesEndLoc});
|
|
} else {
|
|
if (isPrefix || isPostfix) {
|
|
diagnose(colonLoc, diag::precedencegroup_not_infix)
|
|
.fixItRemove({colonLoc, groupLoc});
|
|
}
|
|
// Nothing to complete here, simply consume the token.
|
|
if (Tok.is(tok::code_complete))
|
|
consumeToken();
|
|
}
|
|
}
|
|
|
|
// Diagnose deprecated operator body syntax `operator + { ... }`.
|
|
SourceLoc lBraceLoc;
|
|
if (consumeIf(tok::l_brace, lBraceLoc)) {
|
|
if (isInfix && !Tok.is(tok::r_brace)) {
|
|
diagnose(lBraceLoc, diag::deprecated_operator_body_use_group);
|
|
} else {
|
|
auto Diag = diagnose(lBraceLoc, diag::deprecated_operator_body);
|
|
if (Tok.is(tok::r_brace)) {
|
|
SourceLoc lastGoodLoc = groupLoc.isValid() ? groupLoc : NameLoc;
|
|
SourceLoc lastGoodLocEnd = Lexer::getLocForEndOfToken(SourceMgr,
|
|
lastGoodLoc);
|
|
SourceLoc rBraceEnd = Lexer::getLocForEndOfToken(SourceMgr, Tok.getLoc());
|
|
Diag.fixItRemoveChars(lastGoodLocEnd, rBraceEnd);
|
|
}
|
|
}
|
|
|
|
skipUntilDeclRBrace();
|
|
(void) consumeIf(tok::r_brace);
|
|
}
|
|
|
|
OperatorDecl *res;
|
|
if (isPrefix)
|
|
res = new (Context)
|
|
PrefixOperatorDecl(CurDeclContext, OperatorLoc, Name, NameLoc);
|
|
else if (isPostfix)
|
|
res = new (Context)
|
|
PostfixOperatorDecl(CurDeclContext, OperatorLoc, Name, NameLoc);
|
|
else
|
|
res = new (Context)
|
|
InfixOperatorDecl(CurDeclContext, OperatorLoc, Name, NameLoc, colonLoc,
|
|
groupName, groupLoc);
|
|
|
|
diagnoseOperatorFixityAttributes(*this, Attributes, res);
|
|
|
|
res->getAttrs() = Attributes;
|
|
return makeParserResult(res);
|
|
}
|
|
|
|
ParserResult<PrecedenceGroupDecl>
|
|
Parser::parseDeclPrecedenceGroup(ParseDeclOptions flags,
|
|
DeclAttributes &attributes) {
|
|
SourceLoc precedenceGroupLoc = consumeToken(tok::kw_precedencegroup);
|
|
DebuggerContextChange DCC (*this);
|
|
|
|
if (!CodeCompletion &&
|
|
!DCC.movedToTopLevel() &&
|
|
!(flags & PD_AllowTopLevel)) {
|
|
diagnose(precedenceGroupLoc, diag::decl_inner_scope);
|
|
return nullptr;
|
|
}
|
|
|
|
Identifier name;
|
|
SourceLoc nameLoc;
|
|
if (parseIdentifier(name, nameLoc, /*diagnoseDollarPrefix=*/true,
|
|
diag::expected_precedencegroup_name)) {
|
|
// If the identifier is missing or a keyword or something, try to
|
|
// skip the entire body.
|
|
if (!Tok.isAtStartOfLine() && Tok.isNot(tok::eof) &&
|
|
peekToken().is(tok::l_brace))
|
|
consumeToken();
|
|
if (Tok.is(tok::l_brace)) {
|
|
consumeToken(tok::l_brace);
|
|
skipUntilDeclRBrace();
|
|
(void) consumeIf(tok::r_brace);
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
SourceLoc lbraceLoc, rbraceLoc;
|
|
SourceLoc associativityKeywordLoc, associativityValueLoc;
|
|
SourceLoc assignmentKeywordLoc, assignmentValueLoc;
|
|
SourceLoc higherThanKeywordLoc, lowerThanKeywordLoc;
|
|
SmallVector<PrecedenceGroupDecl::Relation, 4> higherThan, lowerThan;
|
|
Associativity associativity = Associativity::None;
|
|
bool assignment = false;
|
|
bool invalid = false;
|
|
bool hasCodeCompletion = false;
|
|
|
|
// Helper functions.
|
|
auto create = [&] {
|
|
auto result = PrecedenceGroupDecl::create(CurDeclContext,
|
|
precedenceGroupLoc,
|
|
nameLoc, name, lbraceLoc,
|
|
associativityKeywordLoc,
|
|
associativityValueLoc,
|
|
associativity,
|
|
assignmentKeywordLoc,
|
|
assignmentValueLoc,
|
|
assignment,
|
|
higherThanKeywordLoc, higherThan,
|
|
lowerThanKeywordLoc, lowerThan,
|
|
rbraceLoc);
|
|
result->getAttrs() = attributes;
|
|
return result;
|
|
};
|
|
auto createInvalid = [&](bool hasCodeCompletion) {
|
|
// Use the last consumed token location as the rbrace to satisfy
|
|
// the AST invariant about a decl's source range including all of
|
|
// its components.
|
|
if (!rbraceLoc.isValid()) rbraceLoc = PreviousLoc;
|
|
|
|
auto result = create();
|
|
result->setInvalid();
|
|
if (hasCodeCompletion)
|
|
return makeParserCodeCompletionResult(result);
|
|
return makeParserErrorResult(result);
|
|
};
|
|
|
|
// Expect the body to start here.
|
|
if (!consumeIf(tok::l_brace, lbraceLoc)) {
|
|
diagnose(Tok, diag::expected_precedencegroup_lbrace);
|
|
return createInvalid(/*hasCodeCompletion*/false);
|
|
}
|
|
// Empty body.
|
|
if (Tok.is(tok::r_brace)) {
|
|
// Create empty attribute list.
|
|
SyntaxParsingContext(SyntaxContext,
|
|
SyntaxKind::PrecedenceGroupAttributeList);
|
|
rbraceLoc = consumeToken(tok::r_brace);
|
|
return makeParserResult(create());
|
|
}
|
|
|
|
auto abortBody = [&](bool hasCodeCompletion = false) {
|
|
skipUntilDeclRBrace();
|
|
(void) consumeIf(tok::r_brace, rbraceLoc);
|
|
return createInvalid(hasCodeCompletion);
|
|
};
|
|
|
|
auto parseAttributePrefix = [&](SourceLoc &attrKeywordLoc) {
|
|
auto attrName = Tok.getText();
|
|
if (attrKeywordLoc.isValid()) {
|
|
diagnose(Tok, diag::precedencegroup_attribute_redeclared, attrName);
|
|
// We want to continue parsing after this.
|
|
invalid = true;
|
|
}
|
|
attrKeywordLoc = consumeToken(tok::identifier);
|
|
if (!consumeIf(tok::colon)) {
|
|
diagnose(Tok, diag::expected_precedencegroup_attribute_colon, attrName);
|
|
// Try to recover by allowing the colon to be missing.
|
|
}
|
|
};
|
|
|
|
auto checkCodeCompletion = [&](SyntaxKind SK) -> bool {
|
|
if (Tok.is(tok::code_complete)) {
|
|
if (CodeCompletion)
|
|
CodeCompletion->completeInPrecedenceGroup(SK);
|
|
consumeToken();
|
|
return true;
|
|
}
|
|
return false;
|
|
};
|
|
|
|
// Skips the CC token if it comes without spacing.
|
|
auto skipUnspacedCodeCompleteToken = [&]() -> bool {
|
|
if (Tok.is(tok::code_complete) && getEndOfPreviousLoc() == Tok.getLoc()) {
|
|
consumeToken();
|
|
return true;
|
|
}
|
|
return false;
|
|
};
|
|
|
|
// Parse the attributes in the body.
|
|
while (Tok.isNot(tok::r_brace)) {
|
|
if (checkCodeCompletion(SyntaxKind::PrecedenceGroupAttributeList)) {
|
|
hasCodeCompletion = true;
|
|
continue;
|
|
} else if (Tok.isNot(tok::identifier)) {
|
|
diagnose(Tok, diag::expected_precedencegroup_attribute);
|
|
return abortBody();
|
|
}
|
|
auto attrName = Tok.getText();
|
|
|
|
if (attrName == "associativity") {
|
|
SyntaxParsingContext AttrCtxt(SyntaxContext,
|
|
SyntaxKind::PrecedenceGroupAssociativity);
|
|
// "associativity" is considered as a contextual keyword.
|
|
TokReceiver->registerTokenKindChange(Tok.getLoc(),
|
|
tok::contextual_keyword);
|
|
parseAttributePrefix(associativityKeywordLoc);
|
|
|
|
if (checkCodeCompletion(SyntaxKind::PrecedenceGroupAssociativity))
|
|
return abortBody(/*hasCodeCompletion*/true);
|
|
|
|
if (Tok.isNot(tok::identifier)) {
|
|
diagnose(Tok, diag::expected_precedencegroup_associativity);
|
|
return abortBody();
|
|
}
|
|
|
|
auto parsedAssociativity
|
|
= llvm::StringSwitch<Optional<Associativity>>(Tok.getText())
|
|
.Case("none", Associativity::None)
|
|
.Case("left", Associativity::Left)
|
|
.Case("right", Associativity::Right)
|
|
.Default(None);
|
|
|
|
if (!parsedAssociativity) {
|
|
diagnose(Tok, diag::expected_precedencegroup_associativity);
|
|
parsedAssociativity = Associativity::None;
|
|
invalid = true;
|
|
} else {
|
|
// "left", "right" or "none" are considered contextual keywords.
|
|
TokReceiver->registerTokenKindChange(Tok.getLoc(),
|
|
tok::contextual_keyword);
|
|
}
|
|
associativity = *parsedAssociativity;
|
|
associativityValueLoc = consumeToken();
|
|
|
|
if (skipUnspacedCodeCompleteToken())
|
|
return abortBody(/*hasCodeCompletion*/true);
|
|
continue;
|
|
}
|
|
|
|
if (attrName == "assignment") {
|
|
SyntaxParsingContext AttrCtxt(SyntaxContext,
|
|
SyntaxKind::PrecedenceGroupAssignment);
|
|
parseAttributePrefix(assignmentKeywordLoc);
|
|
|
|
// "assignment" is considered as a contextual keyword.
|
|
TokReceiver->registerTokenKindChange(assignmentKeywordLoc,
|
|
tok::contextual_keyword);
|
|
if (checkCodeCompletion(SyntaxKind::PrecedenceGroupAssignment))
|
|
return abortBody(/*hasCodeCompletion*/true);
|
|
|
|
if (consumeIf(tok::kw_true, assignmentValueLoc)) {
|
|
assignment = true;
|
|
} else if (consumeIf(tok::kw_false, assignmentValueLoc)) {
|
|
assignment = false;
|
|
} else {
|
|
diagnose(Tok, diag::expected_precedencegroup_assignment);
|
|
return abortBody();
|
|
}
|
|
if (skipUnspacedCodeCompleteToken())
|
|
return abortBody(/*hasCodeCompletion*/true);
|
|
continue;
|
|
}
|
|
|
|
bool isLowerThan = false;
|
|
if (attrName == "higherThan" ||
|
|
(isLowerThan = (attrName == "lowerThan"))) {
|
|
SyntaxParsingContext AttrCtxt(SyntaxContext,
|
|
SyntaxKind::PrecedenceGroupRelation);
|
|
// "lowerThan" and "higherThan" are contextual keywords.
|
|
TokReceiver->registerTokenKindChange(Tok.getLoc(),
|
|
tok::contextual_keyword);
|
|
parseAttributePrefix(isLowerThan ? lowerThanKeywordLoc
|
|
: higherThanKeywordLoc);
|
|
auto &relations = (isLowerThan ? lowerThan : higherThan);
|
|
|
|
do {
|
|
SyntaxParsingContext NameCtxt(SyntaxContext,
|
|
SyntaxKind::PrecedenceGroupNameElement);
|
|
if (checkCodeCompletion(SyntaxKind::PrecedenceGroupRelation)) {
|
|
return abortBody(/*hasCodeCompletion*/true);
|
|
}
|
|
|
|
if (Tok.isNot(tok::identifier)) {
|
|
diagnose(Tok, diag::expected_precedencegroup_relation, attrName);
|
|
return abortBody();
|
|
}
|
|
Identifier name;
|
|
SourceLoc nameLoc = consumeIdentifier(name,
|
|
/*diagnoseDollarPrefix=*/false);
|
|
relations.push_back({nameLoc, name, nullptr});
|
|
|
|
if (skipUnspacedCodeCompleteToken())
|
|
return abortBody(/*hasCodeCompletion*/true);
|
|
if (!consumeIf(tok::comma))
|
|
break;
|
|
} while (true);
|
|
SyntaxContext->collectNodesInPlace(SyntaxKind::PrecedenceGroupNameList);
|
|
continue;
|
|
}
|
|
|
|
diagnose(Tok, diag::unknown_precedencegroup_attribute, attrName);
|
|
return abortBody();
|
|
}
|
|
SyntaxContext->collectNodesInPlace(SyntaxKind::PrecedenceGroupAttributeList);
|
|
rbraceLoc = consumeToken(tok::r_brace);
|
|
|
|
auto result = create();
|
|
if (invalid) result->setInvalid();
|
|
if (hasCodeCompletion)
|
|
return makeParserCodeCompletionResult(result);
|
|
return makeParserResult(result);
|
|
}
|