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
|
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2021-2022 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
//
//===----------------------------------------------------------------------===//
internal import _RegexParser
/// `Executor` encapsulates the execution of the regex engine post-compilation.
/// It doesn't know anything about the `Regex` type or how to compile a regex.
@available(SwiftStdlib 5.7, *)
enum Executor<Output> {
static func prefixMatch(
_ program: MEProgram,
_ input: String,
subjectBounds: Range<String.Index>,
searchBounds: Range<String.Index>
) throws -> Regex<Output>.Match? {
try Executor._run(
program,
input,
subjectBounds: subjectBounds,
searchBounds: searchBounds,
mode: .partialFromFront)
}
static func wholeMatch(
_ program: MEProgram,
_ input: String,
subjectBounds: Range<String.Index>,
searchBounds: Range<String.Index>
) throws -> Regex<Output>.Match? {
try Executor._run(
program,
input,
subjectBounds: subjectBounds,
searchBounds: searchBounds,
mode: .wholeString)
}
static func firstMatch(
_ program: MEProgram,
_ input: String,
subjectBounds: Range<String.Index>,
searchBounds: Range<String.Index>
) throws -> Regex<Output>.Match? {
var cpu = Processor(
program: program,
input: input,
subjectBounds: subjectBounds,
searchBounds: searchBounds,
matchMode: .partialFromFront)
return try Executor._firstMatch(
program,
using: &cpu)
}
static func _firstMatch(
_ program: MEProgram,
using cpu: inout Processor
) throws -> Regex<Output>.Match? {
let isGraphemeSemantic = program.initialOptions.semanticLevel == .graphemeCluster
var low = cpu.searchBounds.lowerBound
let high = cpu.searchBounds.upperBound
while true {
if let m = try Executor._run(program, &cpu) {
return m
}
// Fast-path for start-anchored regex
if program.canOnlyMatchAtStart {
return nil
}
if low == high { return nil }
if isGraphemeSemantic {
cpu.input.formIndex(after: &low)
} else {
cpu.input.unicodeScalars.formIndex(after: &low)
}
guard low <= high else {
return nil
}
cpu.reset(currentPosition: low, searchBounds: cpu.searchBounds)
}
}
}
@available(SwiftStdlib 5.7, *)
extension Executor {
struct Matches: Sequence {
var program: MEProgram
var input: String
var subjectBounds: Range<String.Index>
var searchBounds: Range<String.Index>
struct Iterator: IteratorProtocol {
var program: MEProgram
var processor: Processor
var finished = false
}
func makeIterator() -> Iterator {
Iterator(
program: program,
processor: Processor(
program: program,
input: input,
subjectBounds: subjectBounds,
searchBounds: searchBounds,
matchMode: .partialFromFront))
}
}
}
@available(SwiftStdlib 5.7, *)
extension Executor.Matches.Iterator {
func nextSearchIndex(
after range: Range<String.Index>
) -> String.Index? {
if !range.isEmpty {
return range.upperBound
}
// If the last match was an empty match, advance by one position and
// run again, unless at the end of `input`.
guard range.lowerBound < processor.subjectBounds.upperBound else {
return nil
}
switch program.initialOptions.semanticLevel {
case .graphemeCluster:
return processor.input.index(after: range.upperBound)
case .unicodeScalar:
return processor.input.unicodeScalars.index(after: range.upperBound)
}
}
mutating func next() -> Regex<Output>.Match? {
if finished {
return nil
}
guard let match = try? Executor._firstMatch(
program, using: &processor
) else {
return nil
}
// If there's more input to process, advance our position
// and search bounds. Otherwise, set to fail fast.
if let currentPosition = nextSearchIndex(after: match.range) {
processor.reset(
currentPosition: currentPosition,
searchBounds: currentPosition..<processor.searchBounds.upperBound)
} else {
finished = true
}
return match
}
}
@available(SwiftStdlib 5.7, *)
extension Executor {
static func _run(
_ program: MEProgram,
_ input: String,
subjectBounds: Range<String.Index>,
searchBounds: Range<String.Index>,
mode: MatchMode
) throws -> Regex<Output>.Match? {
var cpu = Processor(
program: program,
input: input,
subjectBounds: subjectBounds,
searchBounds: searchBounds,
matchMode: mode)
return try _run(program, &cpu)
}
static func _run(
_ program: MEProgram,
_ cpu: inout Processor
) throws -> Regex<Output>.Match? {
let startPosition = cpu.currentPosition
guard let endIdx = try cpu.run() else {
return nil
}
let range = startPosition..<endIdx
let wholeMatchValue: Any?
if let reg = program.wholeMatchValueRegister {
wholeMatchValue = cpu.registers[reg]
} else {
wholeMatchValue = nil
}
let aroElements = Executor.createExistentialElements(
program,
matchRange: startPosition..<endIdx,
storedCaptures: cpu.storedCaptures,
wholeMatchValue: wholeMatchValue)
let anyRegexOutput = AnyRegexOutput(
input: cpu.input, elements: aroElements)
return .init(anyRegexOutput: anyRegexOutput, range: range)
}}
extension Processor {
fileprivate mutating func run() throws -> Input.Index? {
#if PROCESSOR_MEASUREMENTS_ENABLED
defer { if cpu.metrics.shouldMeasureMetrics { cpu.printMetrics() } }
#endif
if self.state == .fail {
if let e = failureReason {
throw e
}
return nil
}
assert(isReset())
while true {
switch self.state {
case .accept:
return self.currentPosition
case .fail:
if let e = failureReason {
throw e
}
return nil
case .inProgress: self.cycle()
}
}
}
}
|