mirror of
https://github.com/darlinghq/darling-WTF.git
synced 2025-02-17 10:27:45 +00:00
117 lines
3.4 KiB
C++
117 lines
3.4 KiB
C++
/*
|
|
* Copyright (C) 2012 Google 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.
|
|
*/
|
|
|
|
#ifndef WTF_StreamBuffer_h
|
|
#define WTF_StreamBuffer_h
|
|
|
|
#include <wtf/Deque.h>
|
|
|
|
namespace WTF {
|
|
|
|
template <typename T, size_t BlockSize> class StreamBuffer {
|
|
private:
|
|
typedef Vector<T> Block;
|
|
public:
|
|
StreamBuffer()
|
|
: m_size(0)
|
|
, m_readOffset(0)
|
|
{
|
|
}
|
|
|
|
~StreamBuffer()
|
|
{
|
|
}
|
|
|
|
bool isEmpty() const { return !size(); }
|
|
|
|
void append(const T* data, size_t size)
|
|
{
|
|
if (!size)
|
|
return;
|
|
|
|
m_size += size;
|
|
while (size) {
|
|
if (!m_buffer.size() || m_buffer.last()->size() == BlockSize)
|
|
m_buffer.append(std::make_unique<Block>());
|
|
size_t appendSize = std::min(BlockSize - m_buffer.last()->size(), size);
|
|
m_buffer.last()->append(data, appendSize);
|
|
data += appendSize;
|
|
size -= appendSize;
|
|
}
|
|
}
|
|
|
|
// This function consume data in the fist block.
|
|
// Specified size must be less than over equal to firstBlockSize().
|
|
void consume(size_t size)
|
|
{
|
|
ASSERT(m_size >= size);
|
|
if (!m_size)
|
|
return;
|
|
|
|
ASSERT(m_buffer.size() > 0);
|
|
ASSERT(m_readOffset + size <= m_buffer.first()->size());
|
|
m_readOffset += size;
|
|
m_size -= size;
|
|
if (m_readOffset >= m_buffer.first()->size()) {
|
|
m_readOffset = 0;
|
|
m_buffer.removeFirst();
|
|
}
|
|
}
|
|
|
|
size_t size() const { return m_size; }
|
|
|
|
const T* firstBlockData() const
|
|
{
|
|
if (!m_size)
|
|
return 0;
|
|
ASSERT(m_buffer.size() > 0);
|
|
return &m_buffer.first()->data()[m_readOffset];
|
|
}
|
|
|
|
size_t firstBlockSize() const
|
|
{
|
|
if (!m_size)
|
|
return 0;
|
|
ASSERT(m_buffer.size() > 0);
|
|
return m_buffer.first()->size() - m_readOffset;
|
|
}
|
|
|
|
private:
|
|
size_t m_size;
|
|
size_t m_readOffset;
|
|
Deque<std::unique_ptr<Block>> m_buffer;
|
|
};
|
|
|
|
} // namespace WTF
|
|
|
|
using WTF::StreamBuffer;
|
|
|
|
#endif // WTF_StreamBuffer_h
|