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
|
/*
* Copyright (C) 2011 Google Inc. All rights reserved.
* Copyright (C) 2021 Apple 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:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * 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.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "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 THE COPYRIGHT
* OWNER 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 "SharedBufferChunkReader.h"
#include <wtf/text/StringCommon.h>
namespace WebCore {
#if ENABLE(MHTML)
SharedBufferChunkReader::SharedBufferChunkReader(FragmentedSharedBuffer* buffer, const Vector<char>& separator)
: m_iteratorCurrent(buffer->begin())
, m_iteratorEnd(buffer->end())
, m_segment(m_iteratorCurrent != m_iteratorEnd ? m_iteratorCurrent->segment->span().data() : nullptr)
, m_separator(separator)
{
}
SharedBufferChunkReader::SharedBufferChunkReader(FragmentedSharedBuffer* buffer, const char* separator)
: m_iteratorCurrent(buffer->begin())
, m_iteratorEnd(buffer->end())
, m_segment(m_iteratorCurrent != m_iteratorEnd ? m_iteratorCurrent->segment->span().data() : nullptr)
{
setSeparator(separator);
}
void SharedBufferChunkReader::setSeparator(const Vector<char>& separator)
{
m_separator = separator;
}
void SharedBufferChunkReader::setSeparator(const char* separator)
{
m_separator.clear();
m_separator.append(unsafeSpan(separator));
}
bool SharedBufferChunkReader::nextChunk(Vector<uint8_t>& chunk, bool includeSeparator)
{
if (m_iteratorCurrent == m_iteratorEnd)
return false;
chunk.clear();
while (true) {
while (m_segmentIndex < m_iteratorCurrent->segment->size()) {
// FIXME: The existing code to check for separators doesn't work correctly with arbitrary separator strings.
WTF_ALLOW_UNSAFE_BUFFER_USAGE_BEGIN
auto currentCharacter = m_segment[m_segmentIndex++];
WTF_ALLOW_UNSAFE_BUFFER_USAGE_END
if (currentCharacter != m_separator[m_separatorIndex]) {
if (m_separatorIndex > 0) {
ASSERT_WITH_SECURITY_IMPLICATION(m_separatorIndex <= m_separator.size());
chunk.append(m_separator.span().first(m_separatorIndex));
m_separatorIndex = 0;
}
chunk.append(currentCharacter);
continue;
}
m_separatorIndex++;
if (m_separatorIndex == m_separator.size()) {
if (includeSeparator)
chunk.appendVector(m_separator);
m_separatorIndex = 0;
return true;
}
}
// Read the next segment.
m_segmentIndex = 0;
WTF_ALLOW_UNSAFE_BUFFER_USAGE_BEGIN
if (++m_iteratorCurrent == m_iteratorEnd) {
WTF_ALLOW_UNSAFE_BUFFER_USAGE_END
m_segment = nullptr;
if (m_separatorIndex > 0)
chunk.append(byteCast<uint8_t>(m_separator.subspan(0, m_separatorIndex)));
return !chunk.isEmpty();
}
m_segment = m_iteratorCurrent->segment->span().data();
}
ASSERT_NOT_REACHED();
return false;
}
String SharedBufferChunkReader::nextChunkAsUTF8StringWithLatin1Fallback(bool includeSeparator)
{
Vector<uint8_t> data;
if (!nextChunk(data, includeSeparator))
return String();
return data.size() ? String::fromUTF8WithLatin1Fallback(data.span()) : emptyString();
}
size_t SharedBufferChunkReader::peek(Vector<uint8_t>& data, size_t requestedSize)
{
data.clear();
if (m_iteratorCurrent == m_iteratorEnd)
return 0;
size_t availableInSegment = std::min(m_iteratorCurrent->segment->size() - m_segmentIndex, requestedSize);
WTF_ALLOW_UNSAFE_BUFFER_USAGE_BEGIN
data.append(unsafeMakeSpan(m_segment + m_segmentIndex, availableInSegment));
size_t readBytesCount = availableInSegment;
requestedSize -= readBytesCount;
auto currentSegment = m_iteratorCurrent;
WTF_ALLOW_UNSAFE_BUFFER_USAGE_END
while (requestedSize && ++currentSegment != m_iteratorEnd) {
size_t lengthInSegment = std::min(currentSegment->segment->size(), requestedSize);
data.append(currentSegment->segment->span().first(lengthInSegment));
readBytesCount += lengthInSegment;
requestedSize -= lengthInSegment;
}
return readBytesCount;
}
#endif
}
|
