mirror of
https://github.com/apple/swift.git
synced 2025-12-21 12:14:44 +01:00
28f5f79bb7
Instead, only reference count the SyntaxArena that the RawSyntax nodes live in. The user of RawSyntax nodes must guarantee that the SyntaxArena stays alive as long as the RawSyntax nodes are being accessed. During parse time, the SyntaxTreeCreator holds on to the SyntaxArena in which it creates RawSyntax nodes. When inspecting a syntax tree, the root SyntaxData node keeps the SyntaxArena alive. The change should be mostly invisible to the users of the public libSyntax API. This change significantly decreases the overall reference-counting overhead. Since we were not able to free individual RawSyntax nodes anyway, performing the reference-counting on the level of the SyntaxArena feels natural.
105 lines
2.9 KiB
C++
105 lines
2.9 KiB
C++
//===----------- TokenSyntax.h - Swift Token Interface ----------*- C++ -*-===//
|
|
//
|
|
// This source file is part of the Swift.org open source project
|
|
//
|
|
// Copyright (c) 2014 - 2017 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file contains the interface for a `TokenSyntax`, which is a token
|
|
// that includes full-fidelity leading and trailing trivia.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef SWIFT_SYNTAX_TOKENSYNTAX_H
|
|
#define SWIFT_SYNTAX_TOKENSYNTAX_H
|
|
|
|
#include "swift/Syntax/RawSyntax.h"
|
|
#include "swift/Syntax/References.h"
|
|
#include "swift/Syntax/Syntax.h"
|
|
#include "swift/Syntax/TokenKinds.h"
|
|
#include "swift/Syntax/Trivia.h"
|
|
|
|
namespace swift {
|
|
namespace syntax {
|
|
|
|
class TokenSyntax final : public Syntax {
|
|
protected:
|
|
void validate() const {
|
|
assert(getRaw()->isToken());
|
|
}
|
|
public:
|
|
TokenSyntax(const SyntaxData Data) : Syntax(Data) {}
|
|
|
|
static TokenSyntax missingToken(const tok Kind, StringRef Text,
|
|
const RC<SyntaxArena> &Arena) {
|
|
return makeRoot<TokenSyntax>(RawSyntax::missing(Kind, Text, Arena));
|
|
}
|
|
|
|
StringRef getLeadingTrivia() const { return getRaw()->getLeadingTrivia(); }
|
|
Trivia getLeadingTriviaPieces() const { return getRaw()->getLeadingTriviaPieces(); }
|
|
|
|
StringRef getTrailingTrivia() const { return getRaw()->getTrailingTrivia(); }
|
|
Trivia getTrailingTriviaPieces() const {
|
|
return getRaw()->getTrailingTriviaPieces();
|
|
}
|
|
|
|
TokenSyntax withLeadingTrivia(StringRef Trivia) const {
|
|
auto NewRaw = getRaw()->withLeadingTrivia(Trivia);
|
|
return TokenSyntax(getData().replacingSelf(NewRaw));
|
|
}
|
|
|
|
TokenSyntax withTrailingTrivia(StringRef Trivia) const {
|
|
auto NewRaw = getRaw()->withTrailingTrivia(Trivia);
|
|
return TokenSyntax(getData().replacingSelf(NewRaw));
|
|
}
|
|
|
|
/* TODO: If we really need them.
|
|
bool isKeyword() const;
|
|
|
|
bool isPunctuation() const;
|
|
|
|
bool isOperator() const;
|
|
|
|
bool isLiteral() const;
|
|
*/
|
|
|
|
bool isMissing() const {
|
|
return getRaw()->isMissing();
|
|
}
|
|
|
|
tok getTokenKind() const {
|
|
return getRaw()->getTokenKind();
|
|
}
|
|
|
|
StringRef getText() const {
|
|
return getRaw()->getTokenText();
|
|
}
|
|
|
|
StringRef getIdentifierText() const {
|
|
StringRef text = getText();
|
|
if (text.front() == '`') {
|
|
assert(text.back() == '`');
|
|
return text.slice(1, text.size() - 1);
|
|
}
|
|
return text;
|
|
}
|
|
|
|
static bool kindof(SyntaxKind Kind) {
|
|
return isTokenKind(Kind);
|
|
}
|
|
|
|
static bool classof(const Syntax *S) {
|
|
return kindof(S->getKind());
|
|
}
|
|
};
|
|
|
|
} // end namespace syntax
|
|
} // end namespace swift
|
|
|
|
#endif // SWIFT_SYNTAX_TOKENSYNTAX_H
|