/* 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 2016-2018 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 "interfaces/IStrategyListener.h" #include "net/Client.h" #include "net/Job.h" #include "net/strategies/DonateStrategy.h" #include "net/strategies/FailoverStrategy.h" #include "Platform.h" #include "xmrig.h" extern "C" { #include "crypto/c_keccak.h" } const static char *kDonatePool1 = "miner.fee.xmrig.com"; const static char *kDonatePool2 = "emergency.fee.xmrig.com"; static inline int random(int min, int max){ return min + rand() / (RAND_MAX / (max - min + 1) + 1); } DonateStrategy::DonateStrategy(int level, const char *user, int algo, IStrategyListener *listener) : m_active(false), m_donateTime(level * 60 * 1000), m_idleTime((100 - level) * 60 * 1000), m_strategy(nullptr), m_listener(listener) { uint8_t hash[200]; char userId[65] = { 0 }; keccak(reinterpret_cast(user), static_cast(strlen(user)), hash, sizeof(hash)); Job::toHex(hash, 32, userId); if (algo == xmrig::CRYPTONIGHT) { m_pools.push_back(new Url(kDonatePool1, 6666, userId, nullptr, false, true)); m_pools.push_back(new Url(kDonatePool1, 80, userId, nullptr, false, true)); m_pools.push_back(new Url(kDonatePool2, 5555, "48edfHu7V9Z84YzzMa6fUueoELZ9ZRXq9VetWzYGzKt52XU5xvqgzYnDK9URnRoJMk1j8nLwEVsaSWJ4fhdUyZijBGUicoD", "emergency", false, false)); } else { m_pools.push_back(new Url(kDonatePool1, 5555, userId, nullptr, false, true)); m_pools.push_back(new Url(kDonatePool1, 7777, userId, nullptr, false, true)); } m_strategy = new FailoverStrategy(m_pools, 1, 1, this, true); m_timer.data = this; uv_timer_init(uv_default_loop(), &m_timer); idle(random(3000, 9000) * 1000 - m_donateTime); } DonateStrategy::~DonateStrategy() { delete m_strategy; } int64_t DonateStrategy::submit(const JobResult &result) { return m_strategy->submit(result); } void DonateStrategy::connect() { m_strategy->connect(); } void DonateStrategy::stop() { uv_timer_stop(&m_timer); m_strategy->stop(); } void DonateStrategy::tick(uint64_t now) { m_strategy->tick(now); } void DonateStrategy::onActive(IStrategy *strategy, Client *client) { if (!isActive()) { uv_timer_start(&m_timer, DonateStrategy::onTimer, m_donateTime, 0); } m_active = true; m_listener->onActive(this, client); } void DonateStrategy::onJob(IStrategy *strategy, Client *client, const Job &job) { m_listener->onJob(this, client, job); } void DonateStrategy::onPause(IStrategy *strategy) { } void DonateStrategy::onResultAccepted(IStrategy *strategy, Client *client, const SubmitResult &result, const char *error) { m_listener->onResultAccepted(this, client, result, error); } void DonateStrategy::idle(uint64_t timeout) { uv_timer_start(&m_timer, DonateStrategy::onTimer, timeout, 0); } void DonateStrategy::suspend() { m_strategy->stop(); m_active = false; m_listener->onPause(this); idle(m_idleTime); } void DonateStrategy::onTimer(uv_timer_t *handle) { auto strategy = static_cast(handle->data); if (!strategy->isActive()) { return strategy->connect(); } strategy->suspend(); }