1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284
|
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2023 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
//
//===----------------------------------------------------------------------===//
#if swift(>=6)
@_spi(RawSyntax) public import SwiftSyntax
#else
@_spi(RawSyntax) import SwiftSyntax
#endif
fileprivate extension SyntaxProtocol {
var contextualClassification: (SyntaxClassification, Bool)? {
var contextualClassif: (SyntaxClassification, Bool)? = nil
var curData = Syntax(self)
repeat {
guard let parent = curData.parent, let keyPath = curData.keyPathInParent else { break }
contextualClassif = SyntaxClassification.classify(keyPath)
curData = parent
} while contextualClassif == nil
return contextualClassif
}
}
extension TokenSyntax {
/// The ``SyntaxClassifiedRange`` for the token text, excluding trivia.
public var tokenClassification: SyntaxClassifiedRange {
let contextualClassification = self.contextualClassification
let relativeOffset = leadingTriviaLength.utf8Length
let absoluteOffset = position.utf8Offset + relativeOffset
return TokenKindAndText(kind: tokenView.rawKind, text: tokenView.rawText).classify(
offset: absoluteOffset,
contextualClassification: contextualClassification
)
}
}
extension RawTriviaPiece {
func classify(offset: Int) -> SyntaxClassifiedRange {
let range = ByteSourceRange(offset: offset, length: byteLength)
switch self {
case .lineComment: return .init(kind: .lineComment, range: range)
case .blockComment: return .init(kind: .blockComment, range: range)
case .docLineComment: return .init(kind: .docLineComment, range: range)
case .docBlockComment: return .init(kind: .docBlockComment, range: range)
default: return .init(kind: .none, range: range)
}
}
}
fileprivate struct TokenKindAndText {
let kind: RawTokenKind
let text: SyntaxText
func classify(
offset: Int,
contextualClassification: (SyntaxClassification, Bool)?
) -> SyntaxClassifiedRange {
let range = ByteSourceRange(offset: offset, length: text.count)
if let contextualClassify = contextualClassification {
let (classify, force) = contextualClassify
if kind == .identifier || force {
return .init(kind: classify, range: range)
}
}
return .init(kind: contextFreeClassification(), range: range)
}
fileprivate func contextFreeClassification() -> SyntaxClassification {
if kind == .unknown, text.hasPrefix("\"") {
return .stringLiteral
}
if kind == .identifier,
text.hasPrefix("<#"),
text.hasSuffix("#>")
{
return .editorPlaceholder
}
return kind.classification
}
}
/// Represents a source range that is associated with a syntax classification.
public struct SyntaxClassifiedRange: Equatable, Sendable {
public var kind: SyntaxClassification
public var range: ByteSourceRange
public var offset: Int { return range.offset }
public var length: Int { return range.length }
public var endOffset: Int { return range.endOffset }
}
private struct ClassificationVisitor {
private enum VisitResult {
case `continue`
case `break`
}
private struct Descriptor {
var node: RawSyntax
var byteOffset: Int
var contextualClassification: (SyntaxClassification, Bool)?
}
/// Only tokens within this absolute range will be classified. No
/// classifications will be reported for tokens out of this range.
private var targetRange: ByteSourceRange
var classifications: [SyntaxClassifiedRange]
/// Only classify tokens in `relativeClassificationRange`, where the start
/// offset is relative to `node`.
init(node: Syntax, relativeClassificationRange: ByteSourceRange) {
let range = ByteSourceRange(
offset: node.position.utf8Offset + relativeClassificationRange.offset,
length: relativeClassificationRange.length
)
self.targetRange = range
self.classifications = []
// `withExtendedLifetime` to make sure ``SyntaxArena`` for the node alive
// during the visit.
withExtendedLifetime(node) {
_ = self.visit(
Descriptor(
node: node.raw,
byteOffset: node.position.utf8Offset,
contextualClassification: node.contextualClassification
)
)
}
}
private mutating func report(range: SyntaxClassifiedRange) {
if range.kind == .none && range.length == 0 {
return
}
// Merge consecutive classified ranges of the same kind.
if let last = classifications.last,
last.kind == range.kind,
last.endOffset == range.offset
{
classifications[classifications.count - 1].range = ByteSourceRange(
offset: last.offset,
length: last.length + range.length
)
return
}
guard range.offset <= targetRange.endOffset,
range.endOffset >= targetRange.offset
else {
return
}
classifications.append(range)
}
/// Classifies `triviaPieces` starting from `offset` and returns the number of bytes the trivia took up in the source
private mutating func classify(triviaPieces: [RawTriviaPiece], at offset: Int) -> Int {
var classifiedBytes = 0
for triviaPiece in triviaPieces {
let range = triviaPiece.classify(offset: offset + classifiedBytes)
report(range: range)
classifiedBytes += triviaPiece.byteLength
}
return classifiedBytes
}
// Report classification ranges in `descriptor.node` that is a token.
private mutating func handleToken(_ descriptor: Descriptor) -> VisitResult {
let tokenView = descriptor.node.tokenView!
var byteOffset = descriptor.byteOffset
// Leading trivia.
byteOffset += classify(triviaPieces: tokenView.leadingRawTriviaPieces, at: byteOffset)
// Token text.
do {
let range = TokenKindAndText(kind: tokenView.rawKind, text: tokenView.rawText)
.classify(offset: byteOffset, contextualClassification: descriptor.contextualClassification)
report(range: range)
byteOffset += tokenView.rawText.count
}
// Trailing trivia.
byteOffset += classify(triviaPieces: tokenView.trailingRawTriviaPieces, at: byteOffset)
precondition(byteOffset == descriptor.byteOffset + descriptor.node.byteLength)
return .continue
}
/// Call `visit()` on all `descriptor.node` non-nil children.
private mutating func handleLayout(_ descriptor: Descriptor) -> VisitResult {
let children = descriptor.node.layoutView!.children
var byteOffset = descriptor.byteOffset
for case (let index, let child?) in children.enumerated() {
let classification: (classification: SyntaxClassification, force: Bool)?
if case .layout(let layout) = descriptor.node.kind.syntaxNodeType.structure {
classification = SyntaxClassification.classify(layout[index])
} else {
classification = nil
}
if let classification, classification.force {
// Leading trivia.
if let leadingTriviaPieces = child.leadingTriviaPieces {
byteOffset += classify(triviaPieces: leadingTriviaPieces, at: byteOffset)
}
// Layout node text.
let layoutNodeTextLength = child.byteLength - child.leadingTriviaByteLength - child.trailingTriviaByteLength
let range = SyntaxClassifiedRange(
kind: classification.classification,
range: ByteSourceRange(
offset: byteOffset,
length: layoutNodeTextLength
)
)
report(range: range)
byteOffset += layoutNodeTextLength
// Trailing trivia.
if let trailingTriviaPieces = child.trailingTriviaPieces {
byteOffset += classify(triviaPieces: trailingTriviaPieces, at: byteOffset)
}
continue
}
let result = visit(
.init(
node: child,
byteOffset: byteOffset,
contextualClassification: classification ?? descriptor.contextualClassification
)
)
if result == .break {
return .break
}
byteOffset += child.byteLength
}
return .continue
}
private mutating func visit(_ descriptor: ClassificationVisitor.Descriptor) -> VisitResult {
guard descriptor.byteOffset < targetRange.endOffset else {
return .break
}
guard descriptor.byteOffset + descriptor.node.byteLength > targetRange.offset else {
return .continue
}
guard SyntaxTreeViewMode.sourceAccurate.shouldTraverse(node: descriptor.node) else {
return .continue
}
if descriptor.node.isToken {
return handleToken(descriptor)
} else {
return handleLayout(descriptor)
}
}
}
/// Provides a sequence of ``SyntaxClassifiedRange``s for a syntax node.
public struct SyntaxClassifications: Sequence, Sendable {
public typealias Iterator = Array<SyntaxClassifiedRange>.Iterator
var classifications: [SyntaxClassifiedRange]
public init(_ node: Syntax, in relRange: ByteSourceRange) {
let visitor = ClassificationVisitor(node: node, relativeClassificationRange: relRange)
self.classifications = visitor.classifications
}
public func makeIterator() -> Iterator {
classifications.makeIterator()
}
}
|