/* Copyright (c) 2007-2018, Arvid Norberg 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 the author 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 TORRENT_CHAINED_BUFFER_HPP_INCLUDED #define TORRENT_CHAINED_BUFFER_HPP_INCLUDED #include "libtorrent/config.hpp" #include "libtorrent/disk_io_job.hpp" // for block_cache_reference #include "libtorrent/debug.hpp" #include "libtorrent/aux_/disable_warnings_push.hpp" #include #include #include #include #include // for memcpy #include "libtorrent/aux_/disable_warnings_pop.hpp" namespace libtorrent { struct TORRENT_EXTRA_EXPORT chained_buffer : private single_threaded { chained_buffer(): m_bytes(0), m_capacity(0) { thread_started(); #if TORRENT_USE_ASSERTS m_destructed = false; #endif } // destructs/frees the buffer (1st arg) with // 2nd argument as userdata typedef void (*free_buffer_fun)(char*, void*, block_cache_reference ref); struct buffer_t { free_buffer_fun free_fun; void* userdata; char* buf; // the first byte of the buffer char* start; // the first byte to send/receive in the buffer int size; // the total size of the buffer int used_size; // this is the number of bytes to send/receive block_cache_reference ref; }; bool empty() const { return m_bytes == 0; } int size() const { return m_bytes; } int capacity() const { return m_capacity; } void pop_front(int bytes_to_pop); void append_buffer(char* buffer, int s, int used_size , free_buffer_fun destructor, void* userdata , block_cache_reference ref = block_cache_reference()); void prepend_buffer(char* buffer, int s, int used_size , free_buffer_fun destructor, void* userdata , block_cache_reference ref = block_cache_reference()); // returns the number of bytes available at the // end of the last chained buffer. int space_in_last_buffer(); // tries to copy the given buffer to the end of the // last chained buffer. If there's not enough room // it returns false char* append(char const* buf, int s); // tries to allocate memory from the end // of the last buffer. If there isn't // enough room, returns 0 char* allocate_appendix(int s); std::vector const& build_iovec(int to_send); void clear(); void build_mutable_iovec(int bytes, std::vector& vec); ~chained_buffer(); private: template void build_vec(int bytes, std::vector& vec); // this is the list of all the buffers we want to // send std::deque m_vec; // this is the number of bytes in the send buf. // this will always be equal to the sum of the // size of all buffers in vec int m_bytes; // the total size of all buffers in the chain // including unused space int m_capacity; // this is the vector of buffers used when // invoking the async write call std::vector m_tmp_vec; #if TORRENT_USE_ASSERTS bool m_destructed; #endif }; } #endif