2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2013 Apple Inc. All rights reserved.
3 * Copyright (C) 2010 Patrick Gansterer <paroga@paroga.com>
4 * Copyright (C) 2012 Google Inc. All rights reserved.
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Library General Public
8 * License as published by the Free Software Foundation; either
9 * version 2 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Library General Public License for more details.
16 * You should have received a copy of the GNU Library General Public License
17 * along with this library; see the file COPYING.LIB. If not, write to
18 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
19 * Boston, MA 02110-1301, USA.
24 #include "AtomicString.h"
26 #include "StringHash.h"
27 #include "wtf/HashSet.h"
28 #include "wtf/WTFThreadData.h"
30 #include "wtf/text/IntegerToStringConversion.h"
31 #include "wtf/unicode/UTF8.h"
35 using namespace Unicode;
37 COMPILE_ASSERT(sizeof(AtomicString) == sizeof(String), atomic_string_and_string_must_be_same_size);
39 class AtomicStringTable {
40 WTF_MAKE_NONCOPYABLE(AtomicStringTable);
42 static AtomicStringTable* create(WTFThreadData& data)
44 data.m_atomicStringTable = new AtomicStringTable;
45 data.m_atomicStringTableDestructor = AtomicStringTable::destroy;
46 data.m_atomicStringTable->addStaticStrings();
47 return data.m_atomicStringTable;
50 StringImpl* addStringImpl(StringImpl* string)
52 if (!string->length())
53 return StringImpl::empty();
55 StringImpl* result = *m_table.add(string).storedValue;
57 if (!result->isAtomic())
58 result->setIsAtomic(true);
60 ASSERT(!string->isStatic() || result->isStatic());
64 HashSet<StringImpl*>& table()
70 AtomicStringTable() { }
72 void addStaticStrings()
74 const StaticStringsTable& staticStrings = StringImpl::allStaticStrings();
76 StaticStringsTable::const_iterator it = staticStrings.begin();
77 for (; it != staticStrings.end(); ++it) {
78 addStringImpl(it->value);
82 static void destroy(AtomicStringTable* table)
84 HashSet<StringImpl*>::iterator end = table->m_table.end();
85 for (HashSet<StringImpl*>::iterator iter = table->m_table.begin(); iter != end; ++iter) {
86 StringImpl* string = *iter;
87 if (!string->isStatic()) {
88 ASSERT(string->isAtomic());
89 string->setIsAtomic(false);
95 HashSet<StringImpl*> m_table;
98 static inline AtomicStringTable& atomicStringTable()
100 // Once possible we should make this non-lazy (constructed in WTFThreadData's constructor).
101 WTFThreadData& data = wtfThreadData();
102 AtomicStringTable* table = data.atomicStringTable();
103 if (UNLIKELY(!table))
104 table = AtomicStringTable::create(data);
108 static inline HashSet<StringImpl*>& atomicStrings()
110 return atomicStringTable().table();
113 template<typename T, typename HashTranslator>
114 static inline PassRefPtr<StringImpl> addToStringTable(const T& value)
116 HashSet<StringImpl*>::AddResult addResult = atomicStrings().add<HashTranslator>(value);
118 // If the string is newly-translated, then we need to adopt it.
119 // The boolean in the pair tells us if that is so.
120 return addResult.isNewEntry ? adoptRef(*addResult.storedValue) : *addResult.storedValue;
123 struct CStringTranslator {
124 static unsigned hash(const LChar* c)
126 return StringHasher::computeHashAndMaskTop8Bits(c);
129 static inline bool equal(StringImpl* r, const LChar* s)
131 return WTF::equal(r, s);
134 static void translate(StringImpl*& location, const LChar* const& c, unsigned hash)
136 location = StringImpl::create(c).leakRef();
137 location->setHash(hash);
138 location->setIsAtomic(true);
142 PassRefPtr<StringImpl> AtomicString::add(const LChar* c)
147 return StringImpl::empty();
149 return addToStringTable<const LChar*, CStringTranslator>(c);
152 template<typename CharacterType>
153 struct HashTranslatorCharBuffer {
154 const CharacterType* s;
158 typedef HashTranslatorCharBuffer<UChar> UCharBuffer;
159 struct UCharBufferTranslator {
160 static unsigned hash(const UCharBuffer& buf)
162 return StringHasher::computeHashAndMaskTop8Bits(buf.s, buf.length);
165 static bool equal(StringImpl* const& str, const UCharBuffer& buf)
167 return WTF::equal(str, buf.s, buf.length);
170 static void translate(StringImpl*& location, const UCharBuffer& buf, unsigned hash)
172 location = StringImpl::create8BitIfPossible(buf.s, buf.length).leakRef();
173 location->setHash(hash);
174 location->setIsAtomic(true);
178 template<typename CharacterType>
179 struct HashAndCharacters {
181 const CharacterType* characters;
185 template<typename CharacterType>
186 struct HashAndCharactersTranslator {
187 static unsigned hash(const HashAndCharacters<CharacterType>& buffer)
189 ASSERT(buffer.hash == StringHasher::computeHashAndMaskTop8Bits(buffer.characters, buffer.length));
193 static bool equal(StringImpl* const& string, const HashAndCharacters<CharacterType>& buffer)
195 return WTF::equal(string, buffer.characters, buffer.length);
198 static void translate(StringImpl*& location, const HashAndCharacters<CharacterType>& buffer, unsigned hash)
200 location = StringImpl::create(buffer.characters, buffer.length).leakRef();
201 location->setHash(hash);
202 location->setIsAtomic(true);
206 struct HashAndUTF8Characters {
208 const char* characters;
210 unsigned utf16Length;
213 struct HashAndUTF8CharactersTranslator {
214 static unsigned hash(const HashAndUTF8Characters& buffer)
219 static bool equal(StringImpl* const& string, const HashAndUTF8Characters& buffer)
221 if (buffer.utf16Length != string->length())
224 // If buffer contains only ASCII characters UTF-8 and UTF16 length are the same.
225 if (buffer.utf16Length != buffer.length) {
226 if (string->is8Bit()) {
227 const LChar* characters8 = string->characters8();
228 return equalLatin1WithUTF8(characters8, characters8 + string->length(), buffer.characters, buffer.characters + buffer.length);
230 const UChar* characters16 = string->characters16();
231 return equalUTF16WithUTF8(characters16, characters16 + string->length(), buffer.characters, buffer.characters + buffer.length);
234 if (string->is8Bit()) {
235 const LChar* stringCharacters = string->characters8();
237 for (unsigned i = 0; i < buffer.length; ++i) {
238 ASSERT(isASCII(buffer.characters[i]));
239 if (stringCharacters[i] != buffer.characters[i])
246 const UChar* stringCharacters = string->characters16();
248 for (unsigned i = 0; i < buffer.length; ++i) {
249 ASSERT(isASCII(buffer.characters[i]));
250 if (stringCharacters[i] != buffer.characters[i])
257 static void translate(StringImpl*& location, const HashAndUTF8Characters& buffer, unsigned hash)
260 RefPtr<StringImpl> newString = StringImpl::createUninitialized(buffer.utf16Length, target);
263 const char* source = buffer.characters;
264 if (convertUTF8ToUTF16(&source, source + buffer.length, &target, target + buffer.utf16Length, &isAllASCII) != conversionOK)
265 ASSERT_NOT_REACHED();
268 newString = StringImpl::create(buffer.characters, buffer.length);
270 location = newString.release().leakRef();
271 location->setHash(hash);
272 location->setIsAtomic(true);
276 PassRefPtr<StringImpl> AtomicString::add(const UChar* s, unsigned length)
282 return StringImpl::empty();
284 UCharBuffer buffer = { s, length };
285 return addToStringTable<UCharBuffer, UCharBufferTranslator>(buffer);
288 PassRefPtr<StringImpl> AtomicString::add(const UChar* s, unsigned length, unsigned existingHash)
291 ASSERT(existingHash);
294 return StringImpl::empty();
296 HashAndCharacters<UChar> buffer = { existingHash, s, length };
297 return addToStringTable<HashAndCharacters<UChar>, HashAndCharactersTranslator<UChar> >(buffer);
300 PassRefPtr<StringImpl> AtomicString::add(const UChar* s)
306 while (s[length] != UChar(0))
310 return StringImpl::empty();
312 UCharBuffer buffer = { s, length };
313 return addToStringTable<UCharBuffer, UCharBufferTranslator>(buffer);
316 struct SubstringLocation {
317 StringImpl* baseString;
322 struct SubstringTranslator {
323 static unsigned hash(const SubstringLocation& buffer)
325 if (buffer.baseString->is8Bit())
326 return StringHasher::computeHashAndMaskTop8Bits(buffer.baseString->characters8() + buffer.start, buffer.length);
327 return StringHasher::computeHashAndMaskTop8Bits(buffer.baseString->characters16() + buffer.start, buffer.length);
330 static bool equal(StringImpl* const& string, const SubstringLocation& buffer)
332 if (buffer.baseString->is8Bit())
333 return WTF::equal(string, buffer.baseString->characters8() + buffer.start, buffer.length);
334 return WTF::equal(string, buffer.baseString->characters16() + buffer.start, buffer.length);
337 static void translate(StringImpl*& location, const SubstringLocation& buffer, unsigned hash)
339 location = buffer.baseString->substring(buffer.start, buffer.length).leakRef();
340 location->setHash(hash);
341 location->setIsAtomic(true);
345 PassRefPtr<StringImpl> AtomicString::add(StringImpl* baseString, unsigned start, unsigned length)
350 if (!length || start >= baseString->length())
351 return StringImpl::empty();
353 unsigned maxLength = baseString->length() - start;
354 if (length >= maxLength) {
356 return add(baseString);
360 SubstringLocation buffer = { baseString, start, length };
361 return addToStringTable<SubstringLocation, SubstringTranslator>(buffer);
364 typedef HashTranslatorCharBuffer<LChar> LCharBuffer;
365 struct LCharBufferTranslator {
366 static unsigned hash(const LCharBuffer& buf)
368 return StringHasher::computeHashAndMaskTop8Bits(buf.s, buf.length);
371 static bool equal(StringImpl* const& str, const LCharBuffer& buf)
373 return WTF::equal(str, buf.s, buf.length);
376 static void translate(StringImpl*& location, const LCharBuffer& buf, unsigned hash)
378 location = StringImpl::create(buf.s, buf.length).leakRef();
379 location->setHash(hash);
380 location->setIsAtomic(true);
384 typedef HashTranslatorCharBuffer<char> CharBuffer;
385 struct CharBufferFromLiteralDataTranslator {
386 static unsigned hash(const CharBuffer& buf)
388 return StringHasher::computeHashAndMaskTop8Bits(reinterpret_cast<const LChar*>(buf.s), buf.length);
391 static bool equal(StringImpl* const& str, const CharBuffer& buf)
393 return WTF::equal(str, buf.s, buf.length);
396 static void translate(StringImpl*& location, const CharBuffer& buf, unsigned hash)
398 location = StringImpl::create(buf.s, buf.length).leakRef();
399 location->setHash(hash);
400 location->setIsAtomic(true);
404 PassRefPtr<StringImpl> AtomicString::add(const LChar* s, unsigned length)
410 return StringImpl::empty();
412 LCharBuffer buffer = { s, length };
413 return addToStringTable<LCharBuffer, LCharBufferTranslator>(buffer);
416 PassRefPtr<StringImpl> AtomicString::addFromLiteralData(const char* characters, unsigned length)
421 CharBuffer buffer = { characters, length };
422 return addToStringTable<CharBuffer, CharBufferFromLiteralDataTranslator>(buffer);
425 PassRefPtr<StringImpl> AtomicString::addSlowCase(StringImpl* string)
427 return atomicStringTable().addStringImpl(string);
430 template<typename CharacterType>
431 static inline HashSet<StringImpl*>::iterator findString(const StringImpl* stringImpl)
433 HashAndCharacters<CharacterType> buffer = { stringImpl->existingHash(), stringImpl->getCharacters<CharacterType>(), stringImpl->length() };
434 return atomicStrings().find<HashAndCharactersTranslator<CharacterType> >(buffer);
437 StringImpl* AtomicString::find(const StringImpl* stringImpl)
440 ASSERT(stringImpl->existingHash());
442 if (!stringImpl->length())
443 return StringImpl::empty();
445 HashSet<StringImpl*>::iterator iterator;
446 if (stringImpl->is8Bit())
447 iterator = findString<LChar>(stringImpl);
449 iterator = findString<UChar>(stringImpl);
450 if (iterator == atomicStrings().end())
455 void AtomicString::remove(StringImpl* r)
457 HashSet<StringImpl*>::iterator iterator;
459 iterator = findString<LChar>(r);
461 iterator = findString<UChar>(r);
462 RELEASE_ASSERT(iterator != atomicStrings().end());
463 atomicStrings().remove(iterator);
466 AtomicString AtomicString::lower() const
468 // Note: This is a hot function in the Dromaeo benchmark.
469 StringImpl* impl = this->impl();
472 RefPtr<StringImpl> newImpl = impl->lower();
473 if (LIKELY(newImpl == impl))
475 return AtomicString(newImpl.release());
478 AtomicString AtomicString::fromUTF8Internal(const char* charactersStart, const char* charactersEnd)
480 HashAndUTF8Characters buffer;
481 buffer.characters = charactersStart;
482 buffer.hash = calculateStringHashAndLengthFromUTF8MaskingTop8Bits(charactersStart, charactersEnd, buffer.length, buffer.utf16Length);
487 AtomicString atomicString;
488 atomicString.m_string = addToStringTable<HashAndUTF8Characters, HashAndUTF8CharactersTranslator>(buffer);
492 AtomicString AtomicString::number(int number)
494 return numberToStringSigned<AtomicString>(number);
497 AtomicString AtomicString::number(unsigned number)
499 return numberToStringUnsigned<AtomicString>(number);
502 AtomicString AtomicString::number(long number)
504 return numberToStringSigned<AtomicString>(number);
507 AtomicString AtomicString::number(unsigned long number)
509 return numberToStringUnsigned<AtomicString>(number);
512 AtomicString AtomicString::number(long long number)
514 return numberToStringSigned<AtomicString>(number);
517 AtomicString AtomicString::number(unsigned long long number)
519 return numberToStringUnsigned<AtomicString>(number);
522 AtomicString AtomicString::number(double number, unsigned precision, TrailingZerosTruncatingPolicy trailingZerosTruncatingPolicy)
524 NumberToStringBuffer buffer;
525 return AtomicString(numberToFixedPrecisionString(number, precision, buffer, trailingZerosTruncatingPolicy == TruncateTrailingZeros));
529 void AtomicString::show() const