/* This file is part of cpp-ethereum. cpp-ethereum 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. cpp-ethereum 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 cpp-ethereum. If not, see . */ /** @file EthashAux.cpp * @author Gav Wood * @date 2014 */ #pragma once #include #include #include #include #include "Ethash.h" namespace dev { namespace eth { struct DAGChannel: public LogChannel { static const char* name(); static const int verbosity = 1; }; /// Proof of work definition for Ethash. struct EthashProofOfWork { struct Solution { Nonce nonce; h256 mixHash; }; struct Result { h256 value; h256 mixHash; }; struct WorkPackage { WorkPackage() = default; WorkPackage(Ethash::BlockHeader const& _bh) : boundary(_bh.boundary()), headerHash(_bh.hashWithout()), seedHash(_bh.seedHash()) { } void reset() { headerHash = h256(); } operator bool() const { return headerHash != h256(); } h256 boundary; h256 headerHash; ///< When h256() means "pause until notified a new work package is available". h256 seedHash; uint64_t startNonce = 0; int exSizeBits = -1; }; static const WorkPackage NullWorkPackage; /// Default value of the local work size. Also known as workgroup size. static const unsigned defaultLocalWorkSize; /// Default value of the global work size as a multiplier of the local work size static const unsigned defaultGlobalWorkSizeMultiplier; /// Default value of the milliseconds per global work size (per batch) static const unsigned defaultMSPerBatch; }; enum class DAGEraseMode { None, Old, Bench, All }; class EthashAux { public: ~EthashAux(); static EthashAux* get(); struct LightAllocation { LightAllocation(h256 const& _seedHash); ~LightAllocation(); bytesConstRef data() const; EthashProofOfWork::Result compute(h256 const& _headerHash, Nonce const& _nonce) const; ethash_light_t light; uint64_t size; }; struct FullAllocation { FullAllocation(ethash_light_t _light, ethash_callback_t _cb); ~FullAllocation(); EthashProofOfWork::Result compute(h256 const& _headerHash, Nonce const& _nonce) const; bytesConstRef data() const; uint64_t size() const { return ethash_full_dag_size(full); } ethash_full_t full; }; using LightType = std::shared_ptr; using FullType = std::shared_ptr; static h256 seedHash(unsigned _number); static uint64_t number(h256 const& _seedHash); static uint64_t cacheSize(BlockInfo const& _header); static uint64_t dataSize(uint64_t _blockNumber); static void setDAGDirName(const char * custom_dir_name); static char * dagDirName(); static void setDAGEraseMode(DAGEraseMode mode); static void eraseDAGs(); static LightType light(h256 const& _seedHash); static const uint64_t NotGenerating = (uint64_t)-1; /// Kicks off generation of DAG for @a _seedHash and @returns false or @returns true if ready. static unsigned computeFull(h256 const& _seedHash, bool _createIfMissing = true); /// Information on the generation progress. static std::pair fullGeneratingProgress() { return std::make_pair(get()->m_generatingFullNumber, get()->m_fullProgress); } /// Kicks off generation of DAG for @a _blocknumber and blocks until ready; @returns result or empty pointer if not existing and _createIfMissing is false. static FullType full(h256 const& _seedHash, bool _createIfMissing = false, std::function const& _f = std::function()); static EthashProofOfWork::Result eval(h256 const& _seedHash, h256 const& _headerHash, Nonce const& _nonce); private: EthashAux() {} /// Kicks off generation of DAG for @a _blocknumber and blocks until ready; @returns result. void killCache(h256 const& _s); static EthashAux* s_this; static char s_dagDirName[256]; static DAGEraseMode s_dagEraseMode; SharedMutex x_lights; std::unordered_map> m_lights; Mutex x_fulls; std::condition_variable m_fullsChanged; std::unordered_map> m_fulls; FullType m_lastUsedFull; std::unique_ptr m_fullGenerator; uint64_t m_generatingFullNumber = NotGenerating; unsigned m_fullProgress; Mutex x_epochs; std::unordered_map m_epochs; h256s m_seedHashes; }; } }