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
|
/*
* Copyright (C) 2004-2008, 2013-2014 Apple Inc. All rights reserved.
* Copyright (C) 2010 Patrick Gansterer <paroga@paroga.com>
* Copyright (C) 2012 Google 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.
*
*/
#include "config.h"
#include "AtomicString.h"
#include "IntegerToStringConversion.h"
#include "dtoa.h"
#if USE(WEB_THREAD)
#include "Lock.h"
#endif
namespace WTF {
template<AtomicString::CaseConvertType type>
ALWAYS_INLINE AtomicString AtomicString::convertASCIICase() const
{
StringImpl* impl = this->impl();
if (UNLIKELY(!impl))
return AtomicString();
// Convert short strings without allocating a new StringImpl, since
// there's a good chance these strings are already in the atomic
// string table and so no memory allocation will be required.
unsigned length;
const unsigned localBufferSize = 100;
if (impl->is8Bit() && (length = impl->length()) <= localBufferSize) {
const LChar* characters = impl->characters8();
unsigned failingIndex;
for (unsigned i = 0; i < length; ++i) {
if (type == CaseConvertType::Lower ? UNLIKELY(isASCIIUpper(characters[i])) : LIKELY(isASCIILower(characters[i]))) {
failingIndex = i;
goto SlowPath;
}
}
return *this;
SlowPath:
LChar localBuffer[localBufferSize];
for (unsigned i = 0; i < failingIndex; ++i)
localBuffer[i] = characters[i];
for (unsigned i = failingIndex; i < length; ++i)
localBuffer[i] = type == CaseConvertType::Lower ? toASCIILower(characters[i]) : toASCIIUpper(characters[i]);
return AtomicString(localBuffer, length);
}
Ref<StringImpl> convertedString = type == CaseConvertType::Lower ? impl->convertToASCIILowercase() : impl->convertToASCIIUppercase();
if (LIKELY(convertedString.ptr() == impl))
return *this;
AtomicString result;
result.m_string = AtomicStringImpl::add(convertedString.ptr());
return result;
}
AtomicString AtomicString::convertToASCIILowercase() const
{
return convertASCIICase<CaseConvertType::Lower>();
}
AtomicString AtomicString::convertToASCIIUppercase() const
{
return convertASCIICase<CaseConvertType::Upper>();
}
AtomicString AtomicString::number(int number)
{
return numberToStringSigned<AtomicString>(number);
}
AtomicString AtomicString::number(unsigned number)
{
return numberToStringUnsigned<AtomicString>(number);
}
AtomicString AtomicString::number(double number)
{
NumberToStringBuffer buffer;
return String(numberToFixedPrecisionString(number, 6, buffer, true));
}
AtomicString AtomicString::fromUTF8Internal(const char* charactersStart, const char* charactersEnd)
{
auto impl = AtomicStringImpl::addUTF8(charactersStart, charactersEnd);
if (!impl)
return nullAtom;
return impl.get();
}
#ifndef NDEBUG
void AtomicString::show() const
{
m_string.show();
}
#endif
} // namespace WTF
|
