mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-11-18 13:42:02 +00:00
151 lines
3.6 KiB
C++
151 lines
3.6 KiB
C++
#pragma once
|
||
|
||
#include <boost/noncopyable.hpp>
|
||
|
||
#include <DB/Common/ProfileEvents.h>
|
||
#include <DB/Common/MemoryTracker.h>
|
||
|
||
#include <DB/Core/Exception.h>
|
||
#include <DB/Core/ErrorCodes.h>
|
||
#include <DB/Core/Defines.h>
|
||
|
||
|
||
namespace DB
|
||
{
|
||
|
||
|
||
/** Замена std::vector<char> для использования в буферах.
|
||
* Отличается тем, что не делает лишний memset. (И почти ничего не делает.)
|
||
* Также можно попросить выделять выровненный кусок памяти.
|
||
*/
|
||
struct Memory : boost::noncopyable
|
||
{
|
||
size_t m_capacity = 0;
|
||
size_t m_size = 0;
|
||
char * m_data = nullptr;
|
||
size_t alignment = 0;
|
||
|
||
Memory() {}
|
||
|
||
/// Если alignment != 0, то будет выделяться память, выровненная на alignment.
|
||
Memory(size_t size_, size_t alignment_ = 0) : m_capacity(size_), m_size(m_capacity), alignment(alignment_)
|
||
{
|
||
alloc();
|
||
}
|
||
|
||
~Memory()
|
||
{
|
||
dealloc();
|
||
}
|
||
|
||
Memory(Memory && rhs)
|
||
{
|
||
*this = std::move(rhs);
|
||
}
|
||
|
||
Memory & operator=(Memory && rhs)
|
||
{
|
||
std::swap(m_capacity, rhs.m_capacity);
|
||
std::swap(m_size, rhs.m_size);
|
||
std::swap(m_data, rhs.m_data);
|
||
std::swap(alignment, rhs.alignment);
|
||
|
||
return *this;
|
||
}
|
||
|
||
size_t size() const { return m_size; }
|
||
const char & operator[](size_t i) const { return m_data[i]; }
|
||
char & operator[](size_t i) { return m_data[i]; }
|
||
|
||
void resize(size_t new_size)
|
||
{
|
||
if (new_size < m_capacity)
|
||
{
|
||
m_size = new_size;
|
||
return;
|
||
}
|
||
else
|
||
{
|
||
dealloc();
|
||
|
||
m_capacity = new_size;
|
||
m_size = m_capacity;
|
||
|
||
alloc();
|
||
}
|
||
}
|
||
|
||
private:
|
||
void alloc()
|
||
{
|
||
if (!m_capacity)
|
||
{
|
||
m_data = nullptr;
|
||
return;
|
||
}
|
||
|
||
ProfileEvents::increment(ProfileEvents::IOBufferAllocs);
|
||
ProfileEvents::increment(ProfileEvents::IOBufferAllocBytes, m_capacity);
|
||
|
||
if (current_memory_tracker)
|
||
current_memory_tracker->alloc(m_capacity);
|
||
|
||
char * new_m_data = nullptr;
|
||
|
||
if (!alignment)
|
||
{
|
||
new_m_data = reinterpret_cast<char *>(malloc(m_capacity));
|
||
|
||
if (!new_m_data)
|
||
throw Exception("Cannot allocate memory (malloc)", ErrorCodes::CANNOT_ALLOCATE_MEMORY);
|
||
|
||
m_data = new_m_data;
|
||
|
||
return;
|
||
}
|
||
|
||
size_t aligned_capacity = (m_capacity + alignment - 1) / alignment * alignment;
|
||
m_capacity = aligned_capacity;
|
||
m_size = m_capacity;
|
||
|
||
int res = posix_memalign(reinterpret_cast<void **>(&new_m_data), alignment, m_capacity);
|
||
|
||
if (0 != res)
|
||
DB::throwFromErrno("Cannot allocate memory (posix_memalign)", ErrorCodes::CANNOT_ALLOCATE_MEMORY, res);
|
||
|
||
m_data = new_m_data;
|
||
}
|
||
|
||
void dealloc()
|
||
{
|
||
if (!m_data)
|
||
return;
|
||
|
||
free(reinterpret_cast<void *>(m_data));
|
||
m_data = nullptr; /// Чтобы избежать double free, если последующий вызов alloc кинет исключение.
|
||
|
||
if (current_memory_tracker)
|
||
current_memory_tracker->free(m_capacity);
|
||
}
|
||
};
|
||
|
||
|
||
/** Буфер, который может сам владеть своим куском памяти для работы.
|
||
* Аргумент шаблона - ReadBuffer или WriteBuffer
|
||
*/
|
||
template <typename Base>
|
||
class BufferWithOwnMemory : public Base
|
||
{
|
||
protected:
|
||
Memory memory;
|
||
public:
|
||
/// Если передать не-NULL existing_memory, то буфер не будет создавать свой кусок памяти, а будет использовать существующий (и не будет им владеть).
|
||
BufferWithOwnMemory(size_t size = DBMS_DEFAULT_BUFFER_SIZE, char * existing_memory = nullptr, size_t alignment = 0) : Base(nullptr, 0), memory(existing_memory ? 0 : size, alignment)
|
||
{
|
||
Base::set(existing_memory ? existing_memory : &memory[0], size);
|
||
}
|
||
};
|
||
|
||
|
||
}
|