OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2003, 2006, 2008, 2009, 2010, 2012 Apple Inc. All rights reserv
ed. | 2 * Copyright (C) 2003, 2006, 2008, 2009, 2010, 2012 Apple Inc. All rights reserv
ed. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
6 * are met: | 6 * are met: |
7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
11 * documentation and/or other materials provided with the distribution. | 11 * documentation and/or other materials provided with the distribution. |
12 * | 12 * |
13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY | 13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY |
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | 14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR | 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR |
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | 17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | 18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | 20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
24 */ | 24 */ |
25 | 25 |
26 | |
27 #include "wtf/text/CString.h" | 26 #include "wtf/text/CString.h" |
28 | 27 |
29 #include "wtf/ASCIICType.h" | 28 #include "wtf/ASCIICType.h" |
30 #include "wtf/allocator/PartitionAlloc.h" | 29 #include "wtf/allocator/PartitionAlloc.h" |
31 #include "wtf/allocator/Partitions.h" | 30 #include "wtf/allocator/Partitions.h" |
32 #include <string.h> | 31 #include <string.h> |
33 | 32 |
34 using namespace std; | 33 using namespace std; |
35 | 34 |
36 namespace WTF { | 35 namespace WTF { |
37 | 36 |
38 PassRefPtr<CStringBuffer> CStringBuffer::createUninitialized(size_t length) | 37 PassRefPtr<CStringBuffer> CStringBuffer::createUninitialized(size_t length, char
*& data) |
39 { | 38 { |
| 39 // TODO(esprehn): This doesn't account for the NUL. |
40 RELEASE_ASSERT(length < (numeric_limits<unsigned>::max() - sizeof(CStringBuf
fer))); | 40 RELEASE_ASSERT(length < (numeric_limits<unsigned>::max() - sizeof(CStringBuf
fer))); |
41 | 41 |
42 // The +1 is for the terminating NUL character. | 42 // The +1 is for the terminating NUL character. |
43 size_t size = sizeof(CStringBuffer) + length + 1; | 43 size_t size = sizeof(CStringBuffer) + length + 1; |
44 CStringBuffer* stringBuffer = static_cast<CStringBuffer*>(Partitions::buffer
Malloc(size, WTF_HEAP_PROFILER_TYPE_NAME(CStringBuffer))); | 44 CStringBuffer* buffer = static_cast<CStringBuffer*>(Partitions::bufferMalloc
(size, WTF_HEAP_PROFILER_TYPE_NAME(CStringBuffer))); |
45 return adoptRef(new (stringBuffer) CStringBuffer(length)); | 45 data = reinterpret_cast<char*>(buffer + 1); |
| 46 data[length] = '\0'; |
| 47 return adoptRef(new (buffer) CStringBuffer(length)); |
46 } | 48 } |
47 | 49 |
48 void CStringBuffer::operator delete(void* ptr) | 50 void CStringBuffer::operator delete(void* ptr) |
49 { | 51 { |
50 Partitions::bufferFree(ptr); | 52 Partitions::bufferFree(ptr); |
51 } | 53 } |
52 | 54 |
53 CString::CString(const char* str) | 55 CString::CString(const char* chars, size_t length) |
54 { | 56 { |
55 if (!str) | 57 if (!chars) { |
56 return; | 58 DCHECK_EQ(length, 0u); |
57 | |
58 init(str, strlen(str)); | |
59 } | |
60 | |
61 CString::CString(const char* str, size_t length) | |
62 { | |
63 if (!str) { | |
64 ASSERT(!length); | |
65 return; | 59 return; |
66 } | 60 } |
67 | 61 char* data; |
68 init(str, length); | 62 m_buffer = CStringBuffer::createUninitialized(length, data); |
69 } | 63 memcpy(data, chars, length); |
70 | |
71 void CString::init(const char* str, size_t length) | |
72 { | |
73 ASSERT(str); | |
74 | |
75 m_buffer = CStringBuffer::createUninitialized(length); | |
76 memcpy(m_buffer->mutableData(), str, length); | |
77 m_buffer->mutableData()[length] = '\0'; | |
78 } | |
79 | |
80 char* CString::mutableData() | |
81 { | |
82 copyBufferIfNeeded(); | |
83 if (!m_buffer) | |
84 return 0; | |
85 return m_buffer->mutableData(); | |
86 } | |
87 | |
88 CString CString::newUninitialized(size_t length, char*& characterBuffer) | |
89 { | |
90 CString result; | |
91 result.m_buffer = CStringBuffer::createUninitialized(length); | |
92 char* bytes = result.m_buffer->mutableData(); | |
93 bytes[length] = '\0'; | |
94 characterBuffer = bytes; | |
95 return result; | |
96 } | |
97 | |
98 void CString::copyBufferIfNeeded() | |
99 { | |
100 if (!m_buffer || m_buffer->hasOneRef()) | |
101 return; | |
102 | |
103 RefPtr<CStringBuffer> buffer = m_buffer.release(); | |
104 size_t length = buffer->length(); | |
105 m_buffer = CStringBuffer::createUninitialized(length); | |
106 memcpy(m_buffer->mutableData(), buffer->data(), length + 1); | |
107 } | 64 } |
108 | 65 |
109 bool CString::isSafeToSendToAnotherThread() const | 66 bool CString::isSafeToSendToAnotherThread() const |
110 { | 67 { |
111 return !m_buffer || m_buffer->hasOneRef(); | 68 return !m_buffer || m_buffer->hasOneRef(); |
112 } | 69 } |
113 | 70 |
114 bool operator==(const CString& a, const CString& b) | 71 bool operator==(const CString& a, const CString& b) |
115 { | 72 { |
116 if (a.isNull() != b.isNull()) | 73 if (a.isNull() != b.isNull()) |
(...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
166 ostream.setf(std::ios::uppercase); | 123 ostream.setf(std::ios::uppercase); |
167 ostream << (character & 0xff); | 124 ostream << (character & 0xff); |
168 } | 125 } |
169 break; | 126 break; |
170 } | 127 } |
171 } | 128 } |
172 return ostream << '"'; | 129 return ostream << '"'; |
173 } | 130 } |
174 | 131 |
175 } // namespace WTF | 132 } // namespace WTF |
OLD | NEW |