File: SharedBuffer.cpp

package info (click to toggle)
chromium-browser 57.0.2987.98-1~deb8u1
  • links: PTS, VCS
  • area: main
  • in suites: jessie
  • size: 2,637,852 kB
  • ctags: 2,544,394
  • sloc: cpp: 12,815,961; ansic: 3,676,222; python: 1,147,112; asm: 526,608; java: 523,212; xml: 286,794; perl: 92,654; sh: 86,408; objc: 73,271; makefile: 27,698; cs: 18,487; yacc: 13,031; tcl: 12,957; pascal: 4,875; ml: 4,716; lex: 3,904; sql: 3,862; ruby: 1,982; lisp: 1,508; php: 1,368; exp: 404; awk: 325; csh: 117; jsp: 39; sed: 37
file content (269 lines) | stat: -rw-r--r-- 8,471 bytes parent folder | download
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
/*
 * Copyright (C) 2006, 2008 Apple Inc. All rights reserved.
 * Copyright (C) Research In Motion Limited 2009-2010. 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 COMPUTER, 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 COMPUTER, 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 "platform/SharedBuffer.h"

#include "platform/instrumentation/tracing/web_process_memory_dump.h"
#include "wtf/text/UTF8.h"
#include "wtf/text/Unicode.h"

namespace blink {

static inline size_t segmentIndex(size_t position) {
  return position / SharedBuffer::kSegmentSize;
}

static inline size_t offsetInSegment(size_t position) {
  return position % SharedBuffer::kSegmentSize;
}

static inline char* allocateSegment() {
  return static_cast<char*>(WTF::Partitions::fastMalloc(
      SharedBuffer::kSegmentSize, "blink::SharedBuffer"));
}

static inline void freeSegment(char* p) {
  WTF::Partitions::fastFree(p);
}

SharedBuffer::SharedBuffer() : m_size(0) {}

SharedBuffer::SharedBuffer(size_t size) : m_size(size), m_buffer(size) {}

SharedBuffer::SharedBuffer(const char* data, size_t size) : m_size(0) {
  appendInternal(data, size);
}

SharedBuffer::SharedBuffer(const unsigned char* data, size_t size) : m_size(0) {
  appendInternal(reinterpret_cast<const char*>(data), size);
}

SharedBuffer::~SharedBuffer() {
  clear();
}

PassRefPtr<SharedBuffer> SharedBuffer::adoptVector(Vector<char>& vector) {
  RefPtr<SharedBuffer> buffer = create();
  buffer->m_buffer.swap(vector);
  buffer->m_size = buffer->m_buffer.size();
  return buffer.release();
}

size_t SharedBuffer::size() const {
  return m_size;
}

const char* SharedBuffer::data() const {
  mergeSegmentsIntoBuffer();
  return m_buffer.data();
}

void SharedBuffer::append(PassRefPtr<SharedBuffer> data) {
  const char* segment;
  size_t position = 0;
  while (size_t length = data->getSomeDataInternal(segment, position)) {
    append(segment, length);
    position += length;
  }
}

void SharedBuffer::appendInternal(const char* data, size_t length) {
  if (!length)
    return;

  ASSERT(m_size >= m_buffer.size());
  size_t positionInSegment = offsetInSegment(m_size - m_buffer.size());
  m_size += length;

  if (m_size <= kSegmentSize) {
    // No need to use segments for small resource data.
    m_buffer.append(data, length);
    return;
  }

  char* segment;
  if (!positionInSegment) {
    segment = allocateSegment();
    m_segments.push_back(segment);
  } else
    segment = m_segments.back() + positionInSegment;

  size_t segmentFreeSpace = kSegmentSize - positionInSegment;
  size_t bytesToCopy = std::min(length, segmentFreeSpace);

  for (;;) {
    memcpy(segment, data, bytesToCopy);
    if (length == bytesToCopy)
      break;

    length -= bytesToCopy;
    data += bytesToCopy;
    segment = allocateSegment();
    m_segments.push_back(segment);
    bytesToCopy = std::min(length, static_cast<size_t>(kSegmentSize));
  }
}

void SharedBuffer::append(const Vector<char>& data) {
  append(data.data(), data.size());
}

void SharedBuffer::clear() {
  for (size_t i = 0; i < m_segments.size(); ++i)
    freeSegment(m_segments[i]);

  m_segments.clear();
  m_size = 0;
  m_buffer.clear();
}

PassRefPtr<SharedBuffer> SharedBuffer::copy() const {
  RefPtr<SharedBuffer> clone(adoptRef(new SharedBuffer));
  clone->m_size = m_size;
  clone->m_buffer.reserveInitialCapacity(m_size);
  clone->m_buffer.append(m_buffer.data(), m_buffer.size());
  if (!m_segments.isEmpty()) {
    const char* segment = 0;
    size_t position = m_buffer.size();
    while (size_t segmentSize = getSomeDataInternal(segment, position)) {
      clone->m_buffer.append(segment, segmentSize);
      position += segmentSize;
    }
    ASSERT(position == clone->size());
  }
  return clone.release();
}

void SharedBuffer::mergeSegmentsIntoBuffer() const {
  size_t bufferSize = m_buffer.size();
  if (m_size > bufferSize) {
    size_t bytesLeft = m_size - bufferSize;
    for (size_t i = 0; i < m_segments.size(); ++i) {
      size_t bytesToCopy =
          std::min(bytesLeft, static_cast<size_t>(kSegmentSize));
      m_buffer.append(m_segments[i], bytesToCopy);
      bytesLeft -= bytesToCopy;
      freeSegment(m_segments[i]);
    }
    m_segments.clear();
  }
}

size_t SharedBuffer::getSomeDataInternal(const char*& someData,
                                         size_t position) const {
  size_t totalSize = size();
  if (position >= totalSize) {
    someData = 0;
    return 0;
  }

  SECURITY_DCHECK(position < m_size);
  size_t consecutiveSize = m_buffer.size();
  if (position < consecutiveSize) {
    someData = m_buffer.data() + position;
    return consecutiveSize - position;
  }

  position -= consecutiveSize;
  size_t segments = m_segments.size();
  size_t maxSegmentedSize = segments * kSegmentSize;
  size_t segment = segmentIndex(position);
  if (segment < segments) {
    size_t bytesLeft = totalSize - consecutiveSize;
    size_t segmentedSize = std::min(maxSegmentedSize, bytesLeft);

    size_t positionInSegment = offsetInSegment(position);
    someData = m_segments[segment] + positionInSegment;
    return segment == segments - 1 ? segmentedSize - position
                                   : kSegmentSize - positionInSegment;
  }
  ASSERT_NOT_REACHED();
  return 0;
}

bool SharedBuffer::getAsBytesInternal(void* dest,
                                      size_t loadPosition,
                                      size_t byteLength) const {
  if (!dest)
    return false;

  const char* segment = nullptr;
  size_t writePosition = 0;
  while (byteLength > 0) {
    size_t loadSize = getSomeDataInternal(segment, loadPosition);
    if (loadSize == 0)
      break;

    if (byteLength < loadSize)
      loadSize = byteLength;
    memcpy(static_cast<char*>(dest) + writePosition, segment, loadSize);
    loadPosition += loadSize;
    writePosition += loadSize;
    byteLength -= loadSize;
  }

  return byteLength == 0;
}

sk_sp<SkData> SharedBuffer::getAsSkData() const {
  size_t bufferLength = size();
  sk_sp<SkData> data = SkData::MakeUninitialized(bufferLength);
  char* buffer = static_cast<char*>(data->writable_data());
  const char* segment = 0;
  size_t position = 0;
  while (size_t segmentSize = getSomeDataInternal(segment, position)) {
    memcpy(buffer + position, segment, segmentSize);
    position += segmentSize;
  }

  if (position != bufferLength) {
    ASSERT_NOT_REACHED();
    // Don't return the incomplete SkData.
    return nullptr;
  }
  return data;
}

void SharedBuffer::onMemoryDump(const String& dumpPrefix,
                                WebProcessMemoryDump* memoryDump) const {
  if (m_buffer.size()) {
    WebMemoryAllocatorDump* dump =
        memoryDump->createMemoryAllocatorDump(dumpPrefix + "/shared_buffer");
    dump->addScalar("size", "bytes", m_buffer.size());
    memoryDump->addSuballocation(
        dump->guid(), String(WTF::Partitions::kAllocatedObjectPoolName));
  } else {
    // If there is data in the segments, then it should have been allocated
    // using fastMalloc.
    const String dataDumpName = dumpPrefix + "/segments";
    auto dump = memoryDump->createMemoryAllocatorDump(dataDumpName);
    dump->addScalar("size", "bytes", m_size);
    memoryDump->addSuballocation(
        dump->guid(), String(WTF::Partitions::kAllocatedObjectPoolName));
  }
}

}  // namespace blink