/* 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-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/opencl/kernels/Cn0Kernel.h" #include "backend/opencl/OclLaunchData.h" #include "backend/opencl/runners/OclCnRunner.h" #include "backend/opencl/wrappers/OclLib.h" #include "base/io/log/Log.h" #include "base/net/stratum/Job.h" #include "crypto/cn/CnAlgo.h" xmrig::OclCnRunner::OclCnRunner(size_t index, const OclLaunchData &data) : OclBaseRunner(index, data) { if (m_queue == nullptr) { return; } const size_t g_thd = data.thread.intensity(); cl_int ret; m_scratchpads = OclLib::createBuffer(data.ctx, CL_MEM_READ_WRITE, data.algorithm.l3() * g_thd, nullptr, &ret); if (ret != CL_SUCCESS) { return; } m_states = OclLib::createBuffer(data.ctx, CL_MEM_READ_WRITE, 200 * g_thd, nullptr, &ret); if (ret != CL_SUCCESS) { return; } for (size_t i = 0; i < BRANCH_MAX; ++i) { m_branches[i] = OclLib::createBuffer(data.ctx, CL_MEM_READ_WRITE, sizeof(cl_uint) * (g_thd + 2), nullptr, &ret); if (ret != CL_SUCCESS) { return; } } uint32_t stridedIndex = data.thread.stridedIndex(); if (data.device.vendorId() == OCL_VENDOR_NVIDIA) { stridedIndex = 0; } else if (stridedIndex == 1 && (m_algorithm.family() == Algorithm::CN_PICO || (m_algorithm.family() == Algorithm::CN && CnAlgo<>::base(m_algorithm) == Algorithm::CN_2))) { stridedIndex = 2; } m_options += " -DITERATIONS=" + std::to_string(CnAlgo<>::iterations(m_algorithm)) + "U"; m_options += " -DMASK=" + std::to_string(CnAlgo<>::mask(m_algorithm)) + "U"; m_options += " -DWORKSIZE=" + std::to_string(data.thread.worksize()) + "U"; m_options += " -DSTRIDED_INDEX=" + std::to_string(stridedIndex) + "U"; m_options += " -DMEM_CHUNK_EXPONENT=" + std::to_string(1u << data.thread.memChunk()) + "U"; m_options += " -DCOMP_MODE=" + std::to_string(data.thread.isCompMode() && g_thd % data.thread.worksize() != 0 ? 1u : 0u) + "U"; m_options += " -DMEMORY=" + std::to_string(m_algorithm.l3()) + "LU"; m_options += " -DALGO=" + std::to_string(m_algorithm.id()); m_options += " -DALGO_FAMILY=" + std::to_string(m_algorithm.family()); m_options += " -DCN_UNROLL=" + std::to_string(data.thread.unrollFactor()); # ifdef XMRIG_ALGO_CN_GPU if (data.algorithm == Algorithm::CN_GPU) { m_options += " -cl-fp32-correctly-rounded-divide-sqrt"; } # endif } xmrig::OclCnRunner::~OclCnRunner() { delete m_cn0; OclLib::releaseMemObject(m_scratchpads); OclLib::releaseMemObject(m_states); for (size_t i = 0; i < BRANCH_MAX; ++i) { OclLib::releaseMemObject(m_branches[i]); } } bool xmrig::OclCnRunner::isReadyToBuild() const { return OclBaseRunner::isReadyToBuild() && m_scratchpads != nullptr && m_states != nullptr && m_branches[BRANCH_BLAKE_256] != nullptr && m_branches[BRANCH_GROESTL_256] != nullptr && m_branches[BRANCH_JH_256] != nullptr && m_branches[BRANCH_SKEIN_512] != nullptr; } bool xmrig::OclCnRunner::run(uint32_t nonce, uint32_t *hashOutput) { static const cl_uint zero = 0; cl_int ret; size_t branchNonces[4] = { 0 }; const size_t g_intensity = data().thread.intensity(); const size_t w_size = data().thread.worksize(); const size_t g_thd = ((g_intensity + w_size - 1u) / w_size) * w_size; for (size_t i = 0; i < BRANCH_MAX; ++i) { if (OclLib::enqueueWriteBuffer(m_queue, m_branches[i], CL_FALSE, sizeof(cl_uint) * g_intensity, sizeof(cl_uint), &zero, 0, nullptr, nullptr) != CL_SUCCESS) { return false; } } if (OclLib::enqueueWriteBuffer(m_queue, m_output, CL_FALSE, sizeof(cl_uint) * 0xFF, sizeof(cl_uint), &zero, 0, nullptr, nullptr) != CL_SUCCESS) { return false; } if (!m_cn0->enqueue(m_queue, nonce, g_thd)) { return false; } OclLib::finish(m_queue); return true; } bool xmrig::OclCnRunner::selfTest() const { return OclBaseRunner::selfTest() && m_cn0->isValid(); } bool xmrig::OclCnRunner::set(const Job &job, uint8_t *blob) { if (job.size() > (Job::kMaxBlobSize - 4)) { return false; } blob[job.size()] = 0x01; memset(blob + job.size() + 1, 0, Job::kMaxBlobSize - job.size() - 1); if (OclLib::enqueueWriteBuffer(m_queue, m_input, CL_TRUE, 0, Job::kMaxBlobSize, blob, 0, nullptr, nullptr) != CL_SUCCESS) { return false; } if (!m_cn0->setArgs(m_input, m_scratchpads, m_states, data().thread.intensity())) { return false; } return true; } void xmrig::OclCnRunner::build() { OclBaseRunner::build(); if (!m_program) { return; } m_cn0 = new Cn0Kernel(m_program); }