/* 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 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 "backend/common/Worker.h" #include "base/kernel/Platform.h" #include "base/tools/Chrono.h" #include "crypto/common/VirtualMemory.h" xmrig::Worker::Worker(size_t id, int64_t affinity, int priority) : m_affinity(affinity), m_id(id) { m_node = VirtualMemory::bindToNUMANode(affinity); Platform::trySetThreadAffinity(affinity); Platform::setThreadPriority(priority); } void xmrig::Worker::storeStats() { // Get index which is unused now const uint32_t index = m_index.load(std::memory_order_relaxed) ^ 1; // Fill in the data for that index m_hashCount[index] = m_count; m_timestamp[index] = Chrono::highResolutionMSecs(); // Switch to that index // All data will be in memory by the time it completes thanks to std::memory_order_seq_cst m_index.fetch_xor(1, std::memory_order_seq_cst); } void xmrig::Worker::getHashrateData(uint64_t& hashCount, uint64_t& timeStamp) const { const uint32_t index = m_index.load(std::memory_order_relaxed); hashCount = m_hashCount[index]; timeStamp = m_timestamp[index]; }