2012-04-30 07:39:35 +02:00
|
|
|
/*
|
|
|
|
|
2016-01-18 00:57:46 +01:00
|
|
|
Copyright (c) 2015-2016, Arvid Norberg
|
2012-04-30 07:39:35 +02:00
|
|
|
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.
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
2015-04-03 22:15:48 +02:00
|
|
|
#ifndef TORRENT_STACK_ALLOCATOR
|
2016-11-26 09:09:01 +01:00
|
|
|
#define TORRENT_STACK_ALLOCATOR
|
2012-04-30 07:39:35 +02:00
|
|
|
|
2015-04-03 22:15:48 +02:00
|
|
|
#include "libtorrent/assert.hpp"
|
2016-09-28 05:21:18 +02:00
|
|
|
#include "libtorrent/span.hpp"
|
2016-10-05 05:58:26 +02:00
|
|
|
#include "libtorrent/string_view.hpp"
|
2016-09-28 05:21:18 +02:00
|
|
|
|
2016-11-26 09:09:01 +01:00
|
|
|
#include <cstdio> // for vsnprintf
|
2016-09-28 05:21:18 +02:00
|
|
|
#include <cstring>
|
2015-04-03 22:15:48 +02:00
|
|
|
|
|
|
|
namespace libtorrent { namespace aux
|
2012-04-30 07:39:35 +02:00
|
|
|
{
|
2016-11-26 09:09:01 +01:00
|
|
|
struct allocation_slot
|
|
|
|
{
|
|
|
|
allocation_slot() : m_idx(-1) {}
|
|
|
|
allocation_slot(allocation_slot const&) = default;
|
|
|
|
allocation_slot(allocation_slot&&) = default;
|
|
|
|
allocation_slot& operator=(allocation_slot const&) = default;
|
|
|
|
allocation_slot& operator=(allocation_slot&&) = default;
|
|
|
|
bool operator==(allocation_slot const& s) const { return m_idx == s.m_idx; }
|
|
|
|
bool operator!=(allocation_slot const& s) const { return m_idx != s.m_idx; }
|
|
|
|
friend struct stack_allocator;
|
|
|
|
private:
|
|
|
|
explicit allocation_slot(int idx) : m_idx(idx) {}
|
|
|
|
int val() const { return m_idx; }
|
|
|
|
int m_idx;
|
|
|
|
};
|
2012-04-30 07:39:35 +02:00
|
|
|
|
2015-04-03 22:15:48 +02:00
|
|
|
struct stack_allocator
|
2012-04-30 07:39:35 +02:00
|
|
|
{
|
2015-04-03 22:15:48 +02:00
|
|
|
stack_allocator() {}
|
2015-05-28 22:36:22 +02:00
|
|
|
|
2016-06-27 02:41:03 +02:00
|
|
|
// non-copyable
|
|
|
|
stack_allocator(stack_allocator const&) = delete;
|
|
|
|
stack_allocator& operator=(stack_allocator const&) = delete;
|
|
|
|
|
2016-11-26 09:09:01 +01:00
|
|
|
allocation_slot copy_string(string_view str)
|
2015-04-03 22:15:48 +02:00
|
|
|
{
|
2016-09-28 05:21:18 +02:00
|
|
|
int const ret = int(m_storage.size());
|
2016-10-05 05:58:26 +02:00
|
|
|
m_storage.resize(ret + str.size() + 1);
|
|
|
|
std::memcpy(&m_storage[ret], str.data(), str.size());
|
|
|
|
m_storage[ret + str.length()] = '\0';
|
2016-11-26 09:09:01 +01:00
|
|
|
return allocation_slot(ret);
|
2015-04-03 22:15:48 +02:00
|
|
|
}
|
|
|
|
|
2016-11-26 09:09:01 +01:00
|
|
|
allocation_slot copy_string(char const* str)
|
2015-04-03 22:15:48 +02:00
|
|
|
{
|
2016-09-28 05:21:18 +02:00
|
|
|
int const ret = int(m_storage.size());
|
|
|
|
int const len = int(std::strlen(str));
|
2015-04-03 22:15:48 +02:00
|
|
|
m_storage.resize(ret + len + 1);
|
2016-12-09 23:17:27 +01:00
|
|
|
std::memcpy(&m_storage[ret], str, len);
|
|
|
|
m_storage[ret + len] = '\0';
|
2016-11-26 09:09:01 +01:00
|
|
|
return allocation_slot(ret);
|
2015-04-03 22:15:48 +02:00
|
|
|
}
|
|
|
|
|
2016-11-26 09:09:01 +01:00
|
|
|
allocation_slot format_string(char const* fmt, va_list v)
|
2015-05-28 22:36:22 +02:00
|
|
|
{
|
2016-06-28 07:30:25 +02:00
|
|
|
int const ret = int(m_storage.size());
|
|
|
|
m_storage.resize(ret + 512);
|
|
|
|
|
|
|
|
#ifdef __clang__
|
|
|
|
#pragma clang diagnostic push
|
|
|
|
#pragma clang diagnostic ignored "-Wformat-nonliteral"
|
|
|
|
#endif
|
|
|
|
int const len = std::vsnprintf(m_storage.data() + ret, 512, fmt, v);
|
|
|
|
#ifdef __clang__
|
|
|
|
#pragma clang diagnostic pop
|
|
|
|
#endif
|
|
|
|
|
2016-11-24 13:40:32 +01:00
|
|
|
if (len < 0)
|
|
|
|
{
|
|
|
|
m_storage.resize(ret);
|
|
|
|
return copy_string("(format error)");
|
|
|
|
}
|
2016-06-28 14:43:31 +02:00
|
|
|
|
|
|
|
// +1 is to include the 0-terminator
|
|
|
|
m_storage.resize(ret + (len > 512 ? 512 : len) + 1);
|
2016-11-26 09:09:01 +01:00
|
|
|
return allocation_slot(ret);
|
2016-06-28 07:30:25 +02:00
|
|
|
}
|
|
|
|
|
2016-11-26 09:09:01 +01:00
|
|
|
allocation_slot copy_buffer(span<char const> buf)
|
2016-06-28 07:30:25 +02:00
|
|
|
{
|
|
|
|
int const ret = int(m_storage.size());
|
2016-09-28 05:21:18 +02:00
|
|
|
int const size = int(buf.size());
|
2016-11-26 09:09:01 +01:00
|
|
|
if (size < 1) return allocation_slot();
|
2015-05-28 22:36:22 +02:00
|
|
|
m_storage.resize(ret + size);
|
2016-09-28 05:21:18 +02:00
|
|
|
std::memcpy(&m_storage[ret], buf.data(), size);
|
2016-11-26 09:09:01 +01:00
|
|
|
return allocation_slot(ret);
|
2015-05-28 22:36:22 +02:00
|
|
|
}
|
|
|
|
|
2016-11-26 09:09:01 +01:00
|
|
|
allocation_slot allocate(int const bytes)
|
2015-04-03 22:15:48 +02:00
|
|
|
{
|
2016-11-26 09:09:01 +01:00
|
|
|
if (bytes < 1) return allocation_slot();
|
2016-09-28 05:21:18 +02:00
|
|
|
int const ret = int(m_storage.size());
|
2015-04-03 22:15:48 +02:00
|
|
|
m_storage.resize(ret + bytes);
|
2016-11-26 09:09:01 +01:00
|
|
|
return allocation_slot(ret);
|
2015-04-03 22:15:48 +02:00
|
|
|
}
|
|
|
|
|
2016-11-26 09:09:01 +01:00
|
|
|
char* ptr(allocation_slot const idx)
|
2015-04-03 22:15:48 +02:00
|
|
|
{
|
2016-11-26 09:09:01 +01:00
|
|
|
if(idx.val() < 0) return nullptr;
|
|
|
|
TORRENT_ASSERT(idx.val() < int(m_storage.size()));
|
|
|
|
return &m_storage[idx.val()];
|
2015-04-03 22:15:48 +02:00
|
|
|
}
|
|
|
|
|
2016-11-26 09:09:01 +01:00
|
|
|
char const* ptr(allocation_slot const idx) const
|
2015-04-03 22:15:48 +02:00
|
|
|
{
|
2016-11-26 09:09:01 +01:00
|
|
|
if(idx.val() < 0) return nullptr;
|
|
|
|
TORRENT_ASSERT(idx.val() < int(m_storage.size()));
|
|
|
|
return &m_storage[idx.val()];
|
2015-04-03 22:15:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void swap(stack_allocator& rhs)
|
|
|
|
{
|
|
|
|
m_storage.swap(rhs.m_storage);
|
|
|
|
}
|
|
|
|
|
|
|
|
void reset()
|
|
|
|
{
|
|
|
|
m_storage.clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
2016-06-27 02:41:03 +02:00
|
|
|
std::vector<char> m_storage;
|
2012-04-30 07:39:35 +02:00
|
|
|
};
|
2015-04-03 22:15:48 +02:00
|
|
|
|
|
|
|
} }
|
2012-04-30 07:39:35 +02:00
|
|
|
|
|
|
|
#endif
|