/* XMRig * Copyright 2010 Jeff Garzik * Copyright 2012-2014 pooler * Copyright 2014 Lucas Jones * Copyright 2014-2016 Wolf9466 * Copyright 2016 Jay D Dee * Copyright 2017-2018 XMR-Stak , * Copyright 2018 Lee Clagett * Copyright 2018-2019 SChernykh * Copyright 2018-2019 tevador * Copyright 2016-2019 XMRig , * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . */ #include "crypto/common/MemoryPool.h" #include "crypto/common/VirtualMemory.h" #include namespace xmrig { constexpr size_t pageSize = 2 * 1024 * 1024; } // namespace xmrig xmrig::MemoryPool::MemoryPool(size_t size, bool hugePages, uint32_t node) { if (!size) { return; } m_memory = new VirtualMemory(size * pageSize, hugePages, false, false, node); } xmrig::MemoryPool::~MemoryPool() { delete m_memory; } bool xmrig::MemoryPool::isHugePages(uint32_t) const { return m_memory && m_memory->isHugePages(); } uint8_t *xmrig::MemoryPool::get(size_t size, uint32_t) { assert(!(size % pageSize)); if (!m_memory || (m_memory->size() - m_offset) < size) { return nullptr; } uint8_t *out = m_memory->scratchpad() + m_offset; m_offset += size; ++m_refs; return out; } void xmrig::MemoryPool::release(uint32_t) { assert(m_refs > 0); if (m_refs > 0) { --m_refs; } if (m_refs == 0) { m_offset = 0; } }