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 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356
|
// Copyright 2020 The Chromium Authors
// Copyright 2014 Blake Embrey (hello@blakeembrey.com)
// Use of this source code is governed by an MIT-style license that can be
// found in the LICENSE file or at https://opensource.org/licenses/MIT.
#include "third_party/liburlpattern/tokenize.h"
#include <string_view>
#include "third_party/abseil-cpp/absl/strings/str_format.h"
#include "third_party/icu/source/common/unicode/uchar.h"
#include "third_party/icu/source/common/unicode/utf8.h"
#include "third_party/liburlpattern/utils.h"
// The following code is a translation from the path-to-regexp typescript at:
//
// https://github.com/pillarjs/path-to-regexp/blob/125c43e6481f68cc771a5af22b914acdb8c5ba1f/src/index.ts#L4-L124
namespace liburlpattern {
namespace {
bool IsASCII(UChar32 c) {
// Characters should be valid ASCII code points:
// https://infra.spec.whatwg.org/#ascii-code-point
return c >= 0x00 && c <= 0x7f;
}
class Tokenizer {
public:
Tokenizer(std::string_view pattern, TokenizePolicy policy)
: pattern_(std::move(pattern)), policy_(policy) {
token_list_.reserve(pattern_.size());
}
base::expected<std::vector<Token>, absl::Status> Tokenize() {
while (index_ < pattern_.size()) {
if (!status_.ok())
return base::unexpected(std::move(status_));
if (!NextAt(index_)) {
Error(absl::StrFormat("Invalid UTF-8 codepoint at index %d.", index_));
continue;
}
if (codepoint_ == '*') {
AddToken(TokenType::kAsterisk);
continue;
}
if (codepoint_ == '+' || codepoint_ == '?') {
AddToken(TokenType::kOtherModifier);
continue;
}
// Escape sequences always escape a single following character at the
// level of the pattern.
if (codepoint_ == '\\') {
if (index_ == (pattern_.size() - 1)) {
Error(absl::StrFormat("Trailing escape character at index %d.",
index_));
continue;
}
size_t escaped_i = next_index_;
if (!Next()) {
Error(absl::StrFormat("Invalid UTF-8 codepoint at index %d.",
next_index_));
continue;
}
AddToken(TokenType::kEscapedChar, next_index_, escaped_i);
continue;
}
if (codepoint_ == '{') {
AddToken(TokenType::kOpen);
continue;
}
if (codepoint_ == '}') {
AddToken(TokenType::kClose);
continue;
}
if (codepoint_ == ':') {
size_t pos = next_index_;
size_t name_start = pos;
// Iterate over codepoints until we find the first non-name codepoint.
while (pos < pattern_.size()) {
if (!status_.ok())
return base::unexpected(std::move(status_));
if (!NextAt(pos)) {
Error(absl::StrFormat("Invalid UTF-8 codepoint at index %d.", pos));
continue;
}
if (!IsNameCodepoint(codepoint_, pos == name_start))
break;
pos = next_index_;
}
if (pos <= name_start) {
Error(absl::StrFormat("Missing parameter name at index %d.", index_),
name_start, index_);
continue;
}
AddToken(TokenType::kName, pos, name_start);
continue;
}
if (codepoint_ == '(') {
size_t paren_nesting = 1;
size_t j = next_index_;
const size_t regex_start = next_index_;
bool error = false;
while (j < pattern_.size()) {
if (!NextAt(j)) {
Error(absl::StrFormat("Invalid UTF-8 codepoint at index %d.", j));
error = true;
break;
}
if (!IsASCII(codepoint_)) {
Error(absl::StrFormat(
"Invalid non-ASCII character 0x%02x at index %d.",
codepoint_, j),
regex_start, index_);
error = true;
break;
}
if (j == regex_start && codepoint_ == '?') {
Error(absl::StrFormat("Regex cannot start with '?' at index %d", j),
regex_start, index_);
error = true;
break;
}
// This escape processing only handles single character escapes since
// we only need to understand escaped paren characters for our state
// processing. The escape `\` character is propagated to the embedded
// regex expression. This permits authors to write longer escape
// sequences such as `\x22` since the later characters will be
// propagated on subsequent loop iterations.
if (codepoint_ == '\\') {
if (j == (pattern_.size() - 1)) {
Error(
absl::StrFormat("Trailing escape character at index %d.", j),
regex_start, index_);
error = true;
break;
}
size_t escaped_j = next_index_;
if (!Next()) {
Error(absl::StrFormat("Invalid UTF-8 codepoint at index %d.",
next_index_));
error = true;
break;
}
if (!IsASCII(codepoint_)) {
Error(absl::StrFormat(
"Invalid non-ASCII character 0x%02x at index %d.",
codepoint_, escaped_j),
regex_start, index_);
error = true;
break;
}
j = next_index_;
continue;
}
if (codepoint_ == ')') {
paren_nesting -= 1;
if (paren_nesting == 0) {
j = next_index_;
break;
}
} else if (codepoint_ == '(') {
paren_nesting += 1;
if (j == (pattern_.size() - 1)) {
Error(absl::StrFormat("Unbalanced regex at index %d.", j),
regex_start, index_);
error = true;
break;
}
size_t tmp_j = next_index_;
if (!Next()) {
Error(absl::StrFormat("Invalid UTF-8 codepoint at index %d.",
next_index_));
error = true;
break;
}
// Require the the first character after an open paren is `?`. This
// permits assertions, named capture groups, and non-capturing
// groups. It blocks, however, unnamed capture groups.
if (codepoint_ != '?') {
Error(absl::StrFormat(
"Unnamed capturing groups are not allowed at index %d.",
tmp_j),
regex_start, index_);
error = true;
break;
}
next_index_ = tmp_j;
}
j = next_index_;
}
if (error)
continue;
if (paren_nesting) {
Error(absl::StrFormat("Unbalanced regex at index %d.", index_),
regex_start, index_);
continue;
}
const size_t regex_length = j - regex_start - 1;
if (regex_length == 0) {
Error(absl::StrFormat("Missing regex at index %d.", index_),
regex_start, index_);
continue;
}
AddToken(TokenType::kRegex, j, regex_start, regex_length);
continue;
}
AddToken(TokenType::kChar);
}
if (!status_.ok())
return base::unexpected(std::move(status_));
AddToken(TokenType::kEnd, index_, index_);
return std::move(token_list_);
}
private:
// Read the codepoint at `next_index_` in `pattern_` and store it in
// `codepoint_`. In addition, `next_index_` is updated to the codepoint to be
// read next. Returns true iff the codepoint was read successfully. On
// success, `codepoint_` is non-negative.
[[nodiscard]] bool Next() {
U8_NEXT(pattern_.data(), next_index_, pattern_.size(), codepoint_);
return codepoint_ >= 0;
}
// Read the codepoint at the specified `index` in `pattern_` and store it in
// `codepoint_`. In addition, `next_index_` is updated to the codepoint to be
// read next. Returns true iff the codepoint was read successfully. On
// success, `codepoint_` is non-negative.
[[nodiscard]] bool NextAt(size_t index) {
next_index_ = index;
return Next();
}
// Append a Token to our list of the given `type` and with a value consisting
// of the codepoints in `pattern_` starting at `value_pos` with
// `value_length`. Update `index_` to `next_pos` automatically.
void AddToken(TokenType type,
size_t next_pos,
size_t value_pos,
size_t value_length) {
token_list_.emplace_back(type, index_,
pattern_.substr(value_pos, value_length));
index_ = next_pos;
}
// Append a Token to our list of the given `type` and with a value consisting
// of the codepoints in `pattern_` starting at `value_pos`. The value length
// is automatically computed as the difference between `next_pos` and
// `value_pos`. Update `index_` to `next_pos` automatically.
void AddToken(TokenType type, size_t next_pos, size_t value_pos) {
AddToken(type, next_pos, value_pos, next_pos - value_pos);
}
// Append a Token to our list of the given `type` and with a value consisting
// of the codepoints in `pattern_` starting at `index_`. The value length
// is automatically computed as the difference between `next_index_` and
// `index_`. Update `index_` to `next_index_` automatically.
void AddToken(TokenType type) { AddToken(type, next_index_, index_); }
void Error(std::string_view message, size_t next_pos, size_t value_pos) {
if (policy_ == TokenizePolicy::kLenient)
AddToken(TokenType::kInvalidChar, next_pos, value_pos);
else
status_ = absl::InvalidArgumentError(message);
}
void Error(std::string_view message) { Error(message, next_index_, index_); }
const std::string_view pattern_;
const TokenizePolicy policy_;
std::vector<Token> token_list_;
absl::Status status_;
// `index_` tracks our "current" byte index in the input string. Typically
// this will be updated every time we commit a token to `token_list_`. It may
// stay frozen in place if we have a sub-loop consuming a larger token like
// a named group or regex group.
size_t index_ = 0;
// The `next_index_` member is used to find the next UTF8 codepoint in the
// string. This is used as both an input and output from the U8_NEXT()
// function. We keep this separate from `index_` because there are many
// cases where we need to read ahead of the last token consumed.
size_t next_index_ = 0;
UChar32 codepoint_ = U_SENTINEL;
};
} // namespace
const char* TokenTypeToString(TokenType type) {
switch (type) {
case TokenType::kOpen:
return "'{'";
case TokenType::kClose:
return "'}'";
case TokenType::kRegex:
return "regex group";
case TokenType::kName:
return "named group";
case TokenType::kChar:
return "character";
case TokenType::kEscapedChar:
return "escaped character";
case TokenType::kOtherModifier:
return "modifier";
case TokenType::kAsterisk:
return "asterisk";
case TokenType::kEnd:
return "end of pattern";
case TokenType::kInvalidChar:
return "invalid character";
}
}
std::ostream& operator<<(std::ostream& o, Token token) {
o << "{ type:" << static_cast<int>(token.type) << ", index:" << token.index
<< ", value:" << token.value << " }";
return o;
}
// Split the input pattern into a list of tokens.
base::expected<std::vector<Token>, absl::Status> Tokenize(
std::string_view pattern,
TokenizePolicy policy) {
Tokenizer tokenizer(std::move(pattern), policy);
return tokenizer.Tokenize();
}
} // namespace liburlpattern
|