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 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375
|
/*
Copyright (C) 2004, 2005, 2006, 2007, 2008 Apple Inc. All rights reserved.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#ifndef THIRD_PARTY_BLINK_RENDERER_PLATFORM_TEXT_SEGMENTED_STRING_H_
#define THIRD_PARTY_BLINK_RENDERER_PLATFORM_TEXT_SEGMENTED_STRING_H_
#include "base/check_op.h"
#include "base/compiler_specific.h"
#include "base/memory/raw_ptr.h"
#include "base/memory/raw_ptr_exclusion.h"
#include "third_party/blink/renderer/platform/platform_export.h"
#include "third_party/blink/renderer/platform/wtf/allocator/allocator.h"
#include "third_party/blink/renderer/platform/wtf/deque.h"
#include "third_party/blink/renderer/platform/wtf/text/string_builder.h"
#include "third_party/blink/renderer/platform/wtf/text/string_view.h"
#include "third_party/blink/renderer/platform/wtf/text/text_position.h"
#include "third_party/blink/renderer/platform/wtf/text/unicode.h"
#include "third_party/blink/renderer/platform/wtf/text/wtf_string.h"
namespace blink {
class SegmentedString;
class PLATFORM_EXPORT SegmentedSubstring {
DISALLOW_NEW();
public:
SegmentedSubstring() { Clear(); }
explicit SegmentedSubstring(const String& str) : string_(str) {
unsigned len = str.length();
if (len) {
if (string_.Is8Bit()) {
is_8bit_ = true;
data_.string8_ptr = UNSAFE_TODO(string_.Characters8());
// SAFETY: len is length of string and checked to be non-zero.
data_last_char_ = UNSAFE_BUFFERS(data_.string8_ptr + len - 1);
} else {
is_8bit_ = false;
data_.string16_ptr = UNSAFE_TODO(string_.Characters16());
// SAFETY: len is length of string and checked to be non-zero.
data_last_char_ = UNSAFE_BUFFERS(
reinterpret_cast<const LChar*>(data_.string16_ptr + len - 1));
}
} else {
is_8bit_ = true;
data_.string8_ptr = nullptr;
data_last_char_ = nullptr;
}
data_start_ = data_.string8_ptr;
}
void Clear() {
is_8bit_ = true;
data_.string8_ptr = nullptr;
data_start_ = data_last_char_ = nullptr;
}
bool ExcludeLineNumbers() const { return !do_not_exclude_line_numbers_; }
bool DoNotExcludeLineNumbers() const { return do_not_exclude_line_numbers_; }
void SetExcludeLineNumbers() { do_not_exclude_line_numbers_ = false; }
int NumberOfCharactersConsumed() const { return offset(); }
void AppendTo(StringBuilder& builder) const {
int off = offset();
int len = length();
if (!off) {
if (len)
builder.Append(string_);
} else {
builder.Append(string_.Substring(off, len));
}
}
bool PushIfPossible(UChar c) {
// This checks if either 8 or 16 bit strings are in the first character
// or they are both nullptr (where we can't rewind).
if (data_.string8_ptr == data_start_)
return false;
// SAFETY: if the string pointer is not at the start, then it points
// into the string data and is safe to index one before it.
if (is_8bit_) {
if (*(UNSAFE_BUFFERS(data_.string8_ptr - 1)) != c) {
return false;
}
UNSAFE_BUFFERS(--data_.string8_ptr);
} else {
if (*(UNSAFE_BUFFERS(data_.string16_ptr - 1)) != c) {
return false;
}
UNSAFE_BUFFERS(--data_.string16_ptr);
}
return true;
}
ALWAYS_INLINE UChar GetCurrentChar() const {
if (is_8bit_)
return *data_.string8_ptr;
return *data_.string16_ptr;
}
ALWAYS_INLINE bool CanAdvance() {
return data_.string8_ptr < data_last_char_;
}
// Advances up to `delta` characters, returning how many characters were
// advanced. This will not advance past the last character.
unsigned Advance(unsigned delta) {
DCHECK_NE(0, length());
delta = std::min(static_cast<unsigned>(length()) - 1, delta);
// Unsafe since a stronger check for non-zero length is required.
if (is_8bit_)
UNSAFE_TODO(data_.string8_ptr += delta);
else
UNSAFE_TODO(data_.string16_ptr += delta);
return delta;
}
ALWAYS_INLINE UChar Advance() {
return UNSAFE_TODO(is_8bit_ ? *++data_.string8_ptr : *++data_.string16_ptr);
}
StringView CurrentSubString(unsigned len) const {
return StringView(string_, offset(), len);
}
ALWAYS_INLINE int offset() const {
DCHECK_LE(data_start_, data_.string8_ptr);
return static_cast<int>(data_.string8_ptr - data_start_) >> !is_8bit_;
}
ALWAYS_INLINE int length() const {
DCHECK_LE(data_.string8_ptr, data_last_char_);
return static_cast<int>(data_end() - data_.string8_ptr) >> !is_8bit_;
}
private:
ALWAYS_INLINE const LChar* data_end() const {
if (!data_last_char_)
return nullptr;
return UNSAFE_TODO(data_last_char_ + 1 + !is_8bit_);
}
union {
// RAW_PTR_EXCLUSION: #union
RAW_PTR_EXCLUSION const LChar* string8_ptr;
RAW_PTR_EXCLUSION const UChar* string16_ptr;
} data_;
raw_ptr<const LChar, AllowPtrArithmetic | DanglingUntriaged> data_start_;
// |data_last_char_| points to the last character (or nullptr). This is to
// avoid extra computation in |CanAdvance|, which is in the critical path of
// HTMLTokenizer.
// RAW_PTR_EXCLUSION: End of the buffer already protected by raw_ptr.
RAW_PTR_EXCLUSION const LChar* data_last_char_;
bool do_not_exclude_line_numbers_ = true;
bool is_8bit_ = true;
String string_;
};
class PLATFORM_EXPORT SegmentedString {
DISALLOW_NEW();
public:
SegmentedString()
: number_of_characters_consumed_prior_to_current_string_(0),
number_of_characters_consumed_prior_to_current_line_(0),
current_line_(0),
closed_(false),
empty_(true),
current_char_('\0') {}
SegmentedString(const String& str)
: current_string_(str),
number_of_characters_consumed_prior_to_current_string_(0),
number_of_characters_consumed_prior_to_current_line_(0),
current_line_(0),
closed_(false),
empty_(!str.length()),
current_char_(empty_ ? '\0' : current_string_.GetCurrentChar()) {}
void Clear();
void Close();
void Append(const SegmentedString&);
enum class PrependType {
kNewInput = 0,
kUnconsume = 1,
};
void Prepend(const SegmentedString&, PrependType);
const SegmentedString* NextSegmentedString() const {
return next_segmented_string_;
}
void SetNextSegmentedString(const SegmentedString* next) {
next_segmented_string_ = next;
}
bool ExcludeLineNumbers() const {
return current_string_.ExcludeLineNumbers();
}
void SetExcludeLineNumbers();
void Push(UChar);
bool IsEmpty() const { return empty_; }
unsigned length() const;
bool IsClosed() const { return closed_; }
enum LookAheadResult {
kDidNotMatch,
kDidMatch,
kNotEnoughCharacters,
};
LookAheadResult LookAhead(const String& string) {
return LookAheadInline(string, kTextCaseSensitive);
}
LookAheadResult LookAheadIgnoringCase(const String& string) {
return LookAheadInline(string, kTextCaseASCIIInsensitive);
}
// Used to advance by multiple characters. Specifically this advances by
// `num_chars` and `num_lines`. This function advances without analyzing the
// input string in anyway. As a result, the caller must know `num_lines` and
// `current_column`.
void Advance(unsigned num_chars, unsigned num_lines, int current_column);
ALWAYS_INLINE UChar Advance() {
if (current_string_.CanAdvance()) [[likely]] {
current_char_ = current_string_.Advance();
return current_char_;
}
return AdvanceSubstring();
}
ALWAYS_INLINE void UpdateLineNumber() {
if (current_string_.DoNotExcludeLineNumbers()) [[likely]] {
++current_line_;
// Plus 1 because numberOfCharactersConsumed value hasn't incremented yet;
// it does with length() decrement below.
number_of_characters_consumed_prior_to_current_line_ =
NumberOfCharactersConsumed() + 1;
}
}
ALWAYS_INLINE UChar AdvanceAndUpdateLineNumber() {
DCHECK_GE(current_string_.length(), 1);
if (current_char_ == '\n')
UpdateLineNumber();
return Advance();
}
ALWAYS_INLINE UChar AdvanceAndASSERT(UChar expected_character) {
DCHECK_EQ(expected_character, CurrentChar());
return Advance();
}
ALWAYS_INLINE UChar AdvanceAndASSERTIgnoringCase(UChar expected_character) {
DCHECK_EQ(WTF::unicode::FoldCase(CurrentChar()),
WTF::unicode::FoldCase(expected_character));
return Advance();
}
ALWAYS_INLINE UChar AdvancePastNonNewline() {
DCHECK_NE(CurrentChar(), '\n');
return Advance();
}
ALWAYS_INLINE UChar AdvancePastNewlineAndUpdateLineNumber() {
DCHECK_EQ(CurrentChar(), '\n');
DCHECK_GE(current_string_.length(), 1);
UpdateLineNumber();
return Advance();
}
ALWAYS_INLINE int NumberOfCharactersConsumed() const {
int number_of_pushed_characters = 0;
return number_of_characters_consumed_prior_to_current_string_ +
current_string_.NumberOfCharactersConsumed() -
number_of_pushed_characters;
}
String ToString() const;
ALWAYS_INLINE UChar CurrentChar() const { return current_char_; }
// The method is moderately slow, comparing to currentLine method.
OrdinalNumber CurrentColumn() const;
OrdinalNumber CurrentLine() const;
// Sets value of line/column variables. Column is specified indirectly by a
// parameter columnAftreProlog which is a value of column that we should get
// after a prolog (first prologLength characters) has been consumed.
void SetCurrentPosition(OrdinalNumber line,
OrdinalNumber column_aftre_prolog,
int prolog_length);
private:
void Append(const SegmentedSubstring&);
void Prepend(const SegmentedSubstring&, PrependType);
UChar AdvanceSubstring();
// Consume characters into `characters`, which should not be bigger than
// `length()`.
void AdvanceAndCollect(base::span<UChar> characters);
inline LookAheadResult LookAheadInline(const String& string,
TextCaseSensitivity case_sensitivity) {
if (string.length() <= static_cast<unsigned>(current_string_.length())) {
StringView current_substring =
current_string_.CurrentSubString(string.length());
if (string.StartsWith(current_substring, case_sensitivity))
return kDidMatch;
return kDidNotMatch;
}
return LookAheadSlowCase(string, case_sensitivity);
}
LookAheadResult LookAheadSlowCase(const String& string,
TextCaseSensitivity case_sensitivity) {
unsigned count = string.length();
if (count > length())
return kNotEnoughCharacters;
base::span<UChar> consumed_characters;
String consumed_string =
String::CreateUninitialized(count, consumed_characters);
AdvanceAndCollect(consumed_characters);
LookAheadResult result = kDidNotMatch;
if (consumed_string.StartsWith(string, case_sensitivity))
result = kDidMatch;
Prepend(SegmentedString(consumed_string), PrependType::kUnconsume);
return result;
}
bool IsComposite() const { return !substrings_.empty(); }
SegmentedSubstring current_string_;
int number_of_characters_consumed_prior_to_current_string_;
int number_of_characters_consumed_prior_to_current_line_;
int current_line_;
Deque<SegmentedSubstring> substrings_;
bool closed_;
bool empty_;
UChar current_char_;
raw_ptr<const SegmentedString> next_segmented_string_ = nullptr;
};
} // namespace blink
#endif // THIRD_PARTY_BLINK_RENDERER_PLATFORM_TEXT_SEGMENTED_STRING_H_
|