mirror of
https://github.com/apple/swift.git
synced 2025-12-14 20:36:38 +01:00
57c1f72cc3
This eliminates the overhead of ParsedRawSyntaxNode needing to do memory management. If ParsedRawSyntaxNode needs to point to some data the memory is allocated from a bump allocator. There are also some improvements on how the ParsedSyntaxBuilders work.
93 lines
3.0 KiB
C++
93 lines
3.0 KiB
C++
//===--- ParsedRawSyntaxNode.cpp - Parsed Raw Syntax Node -----------------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "swift/Parse/ParsedRawSyntaxNode.h"
|
|
#include "swift/Parse/SyntaxParsingContext.h"
|
|
|
|
using namespace swift;
|
|
using namespace swift::syntax;
|
|
using namespace llvm;
|
|
|
|
ParsedRawSyntaxNode
|
|
ParsedRawSyntaxNode::makeDeferred(SyntaxKind k,
|
|
ArrayRef<ParsedRawSyntaxNode> deferredNodes,
|
|
SyntaxParsingContext &ctx) {
|
|
if (deferredNodes.empty()) {
|
|
return ParsedRawSyntaxNode(k, {});
|
|
}
|
|
ParsedRawSyntaxNode *newPtr =
|
|
ctx.getScratchAlloc().Allocate<ParsedRawSyntaxNode>(deferredNodes.size());
|
|
std::uninitialized_copy(deferredNodes.begin(), deferredNodes.end(), newPtr);
|
|
return ParsedRawSyntaxNode(k, makeArrayRef(newPtr, deferredNodes.size()));
|
|
}
|
|
|
|
ParsedRawSyntaxNode
|
|
ParsedRawSyntaxNode::makeDeferred(Token tok,
|
|
const ParsedTrivia &leadingTrivia,
|
|
const ParsedTrivia &trailingTrivia,
|
|
SyntaxParsingContext &ctx) {
|
|
CharSourceRange tokRange = tok.getRangeWithoutBackticks();
|
|
size_t piecesCount = leadingTrivia.size() + trailingTrivia.size();
|
|
ParsedTriviaPiece *piecesPtr = nullptr;
|
|
if (piecesCount > 0) {
|
|
piecesPtr = ctx.getScratchAlloc().Allocate<ParsedTriviaPiece>(piecesCount);
|
|
std::uninitialized_copy(leadingTrivia.begin(), leadingTrivia.end(),
|
|
piecesPtr);
|
|
std::uninitialized_copy(trailingTrivia.begin(), trailingTrivia.end(),
|
|
piecesPtr + leadingTrivia.size());
|
|
}
|
|
return ParsedRawSyntaxNode(tok.getKind(), tokRange.getStart(),
|
|
tokRange.getByteLength(), piecesPtr,
|
|
leadingTrivia.size(), trailingTrivia.size());
|
|
}
|
|
|
|
void ParsedRawSyntaxNode::dump() const {
|
|
dump(llvm::errs(), /*Indent*/ 0);
|
|
llvm::errs() << '\n';
|
|
}
|
|
|
|
void ParsedRawSyntaxNode::dump(llvm::raw_ostream &OS, unsigned Indent) const {
|
|
auto indent = [&](unsigned Amount) {
|
|
for (decltype(Amount) i = 0; i < Amount; ++i) {
|
|
OS << ' ';
|
|
}
|
|
};
|
|
|
|
indent(Indent);
|
|
|
|
if (isNull()) {
|
|
OS << "(<NULL>)";
|
|
return;
|
|
}
|
|
|
|
OS << '(';
|
|
dumpSyntaxKind(OS, getKind());
|
|
|
|
if (isToken()) {
|
|
dumpTokenKind(OS, getTokenKind());
|
|
|
|
} else {
|
|
if (isRecorded()) {
|
|
OS << " [recorded]";
|
|
} else if (isDeferredLayout()) {
|
|
for (const auto &child : getDeferredChildren()) {
|
|
OS << "\n";
|
|
child.dump(OS, Indent + 1);
|
|
}
|
|
} else {
|
|
assert(isDeferredToken());
|
|
OS << " [deferred token]";
|
|
}
|
|
}
|
|
OS << ')';
|
|
}
|