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
|
/*
* Copyright (C) 2006-2016 Apple Inc. All rights reserved.
* Copyright (C) Research In Motion Limited 2009-2010. All rights reserved.
* Copyright (C) 2015 Canon Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "SharedBuffer.h"
#include <algorithm>
#include <wtf/unicode/UTF8.h>
#if USE(SOUP)
#include "GUniquePtrSoup.h"
#endif
namespace WebCore {
SharedBuffer::SharedBuffer(const char* data, size_t size)
{
append(data, size);
}
SharedBuffer::SharedBuffer(const unsigned char* data, size_t size)
{
append(reinterpret_cast<const char*>(data), size);
}
SharedBuffer::SharedBuffer(MappedFileData&& fileData)
: m_size(fileData.size())
{
m_segments.append({0, DataSegment::create(WTFMove(fileData))});
}
SharedBuffer::SharedBuffer(Vector<char>&& data)
{
append(WTFMove(data));
}
RefPtr<SharedBuffer> SharedBuffer::createWithContentsOfFile(const String& filePath)
{
bool mappingSuccess;
MappedFileData mappedFileData(filePath, mappingSuccess);
if (!mappingSuccess)
return SharedBuffer::createFromReadingFile(filePath);
return adoptRef(new SharedBuffer(WTFMove(mappedFileData)));
}
Ref<SharedBuffer> SharedBuffer::create(Vector<char>&& vector)
{
return adoptRef(*new SharedBuffer(WTFMove(vector)));
}
void SharedBuffer::combineIntoOneSegment() const
{
#if !ASSERT_DISABLED
// FIXME: We ought to be able to set this to true and have no assertions fire.
// Remove all instances of appending after calling this, because they are all O(n^2) algorithms since r215686.
// m_hasBeenCombinedIntoOneSegment = true;
#endif
if (m_segments.size() <= 1)
return;
Vector<char> combinedData;
combinedData.reserveInitialCapacity(m_size);
for (const auto& segment : m_segments)
combinedData.append(segment.segment->data(), segment.segment->size());
ASSERT(combinedData.size() == m_size);
m_segments.clear();
m_segments.append({0, DataSegment::create(WTFMove(combinedData))});
ASSERT(m_segments.size() == 1);
ASSERT(internallyConsistent());
}
const char* SharedBuffer::data() const
{
if (!m_segments.size())
return nullptr;
combineIntoOneSegment();
ASSERT(internallyConsistent());
return m_segments[0].segment->data();
}
SharedBufferDataView SharedBuffer::getSomeData(size_t position) const
{
RELEASE_ASSERT(position < m_size);
auto comparator = [](const size_t& position, const DataSegmentVectorEntry& entry) {
return position < entry.beginPosition;
};
const DataSegmentVectorEntry* element = std::upper_bound(m_segments.begin(), m_segments.end(), position, comparator);
element--; // std::upper_bound gives a pointer to the element that is greater than position. We want the element just before that.
return { element->segment.copyRef(), position - element->beginPosition };
}
RefPtr<ArrayBuffer> SharedBuffer::tryCreateArrayBuffer() const
{
RefPtr<ArrayBuffer> arrayBuffer = ArrayBuffer::createUninitialized(static_cast<unsigned>(size()), sizeof(char));
if (!arrayBuffer) {
WTFLogAlways("SharedBuffer::tryCreateArrayBuffer Unable to create buffer. Requested size was %zu x %lu\n", size(), sizeof(char));
return nullptr;
}
size_t position = 0;
for (const auto& segment : m_segments) {
memcpy(static_cast<char*>(arrayBuffer->data()) + position, segment.segment->data(), segment.segment->size());
position += segment.segment->size();
}
ASSERT(position == m_size);
ASSERT(internallyConsistent());
return arrayBuffer;
}
void SharedBuffer::append(const SharedBuffer& data)
{
ASSERT(!m_hasBeenCombinedIntoOneSegment);
m_segments.reserveCapacity(m_segments.size() + data.m_segments.size());
for (const auto& element : data.m_segments) {
m_segments.uncheckedAppend({m_size, element.segment.copyRef()});
m_size += element.segment->size();
}
ASSERT(internallyConsistent());
}
void SharedBuffer::append(const char* data, size_t length)
{
ASSERT(!m_hasBeenCombinedIntoOneSegment);
Vector<char> vector;
vector.append(data, length);
m_segments.append({m_size, DataSegment::create(WTFMove(vector))});
m_size += length;
ASSERT(internallyConsistent());
}
void SharedBuffer::append(Vector<char>&& data)
{
ASSERT(!m_hasBeenCombinedIntoOneSegment);
auto dataSize = data.size();
m_segments.append({m_size, DataSegment::create(WTFMove(data))});
m_size += dataSize;
ASSERT(internallyConsistent());
}
void SharedBuffer::clear()
{
m_size = 0;
m_segments.clear();
ASSERT(internallyConsistent());
}
Ref<SharedBuffer> SharedBuffer::copy() const
{
Ref<SharedBuffer> clone = adoptRef(*new SharedBuffer);
clone->m_size = m_size;
clone->m_segments.reserveInitialCapacity(m_segments.size());
for (const auto& element : m_segments)
clone->m_segments.uncheckedAppend({element.beginPosition, element.segment.copyRef()});
ASSERT(clone->internallyConsistent());
ASSERT(internallyConsistent());
return clone;
}
#if !ASSERT_DISABLED
bool SharedBuffer::internallyConsistent() const
{
size_t position = 0;
for (const auto& element : m_segments) {
if (element.beginPosition != position)
return false;
position += element.segment->size();
}
return position == m_size;
}
#endif
const char* SharedBuffer::DataSegment::data() const
{
auto visitor = WTF::makeVisitor(
[](const Vector<char>& data) { return data.data(); },
#if USE(CF)
[](const RetainPtr<CFDataRef>& data) { return reinterpret_cast<const char*>(CFDataGetBytePtr(data.get())); },
#endif
#if USE(SOUP)
[](const GUniquePtr<SoupBuffer>& data) { return data->data; },
#endif
[](const MappedFileData& data) { return reinterpret_cast<const char*>(data.data()); }
);
return WTF::visit(visitor, m_immutableData);
}
#if !USE(CF)
void SharedBuffer::hintMemoryNotNeededSoon() const
{
}
#endif
size_t SharedBuffer::DataSegment::size() const
{
auto visitor = WTF::makeVisitor(
[](const Vector<char>& data) { return data.size(); },
#if USE(CF)
[](const RetainPtr<CFDataRef>& data) { return CFDataGetLength(data.get()); },
#endif
#if USE(SOUP)
[](const GUniquePtr<SoupBuffer>& data) { return static_cast<size_t>(data->length); },
#endif
[](const MappedFileData& data) { return data.size(); }
);
return WTF::visit(visitor, m_immutableData);
}
SharedBufferDataView::SharedBufferDataView(Ref<SharedBuffer::DataSegment>&& segment, size_t positionWithinSegment)
: m_positionWithinSegment(positionWithinSegment)
, m_segment(WTFMove(segment))
{
ASSERT(positionWithinSegment < m_segment->size());
}
size_t SharedBufferDataView::size() const
{
return m_segment->size() - m_positionWithinSegment;
}
const char* SharedBufferDataView::data() const
{
return m_segment->data() + m_positionWithinSegment;
}
RefPtr<SharedBuffer> utf8Buffer(const String& string)
{
// Allocate a buffer big enough to hold all the characters.
const int length = string.length();
Vector<char> buffer(length * 3);
// Convert to runs of 8-bit characters.
char* p = buffer.data();
WTF::Unicode::ConversionResult result;
if (length) {
if (string.is8Bit()) {
const LChar* d = string.characters8();
result = WTF::Unicode::convertLatin1ToUTF8(&d, d + length, &p, p + buffer.size());
} else {
const UChar* d = string.characters16();
result = WTF::Unicode::convertUTF16ToUTF8(&d, d + length, &p, p + buffer.size(), true);
}
if (result != WTF::Unicode::conversionOK)
return nullptr;
}
buffer.shrink(p - buffer.data());
return SharedBuffer::create(WTFMove(buffer));
}
} // namespace WebCore
|