/* * This file is part of the Monero P2Pool * Copyright (c) 2021 SChernykh * * 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, version 3. * * 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 . */ #pragma once #ifdef _MSC_VER #pragma warning(push) #pragma warning(disable : 5027) #endif #define ROBIN_HOOD_MALLOC(size) p2pool::malloc_hook(size) #define ROBIN_HOOD_CALLOC(count, size) p2pool::calloc_hook((count), (size)) #define ROBIN_HOOD_FREE(ptr) p2pool::free_hook(ptr) #include "robin_hood.h" #ifdef _MSC_VER #pragma warning(pop) #endif namespace p2pool { extern const char* VERSION; template struct not_implemented { enum { value = 0 }; }; struct nocopy_nomove { nocopy_nomove() = default; nocopy_nomove(const nocopy_nomove&) = delete; nocopy_nomove(nocopy_nomove&&) = delete; nocopy_nomove& operator=(const nocopy_nomove&) = delete; nocopy_nomove& operator=(nocopy_nomove&&) = delete; }; template struct ScopeGuard { explicit FORCEINLINE ScopeGuard(T&& handler) : m_handler(std::move(handler)) {} FORCEINLINE ~ScopeGuard() { m_handler(); } T m_handler; // Disable copying/moving of ScopeGuard objects // We can't declare copy constructor as explicitly deleted because of copy elision semantics // Just leave it without definition and it'll fail when linking if someone tries to copy a ScopeGuard object ScopeGuard(const ScopeGuard&); private: ScopeGuard& operator=(const ScopeGuard&) = delete; ScopeGuard& operator=(ScopeGuard&&) = delete; }; template FORCEINLINE ScopeGuard on_scope_leave(T&& handler) { return ScopeGuard(std::move(handler)); } #define ON_SCOPE_LEAVE(x) auto CONCAT(scope_guard_, __LINE__) = on_scope_leave(x); struct MinerCallbackHandler { virtual ~MinerCallbackHandler() = 0; virtual void handle_tx(TxMempoolData& tx) = 0; virtual void handle_miner_data(MinerData& data) = 0; virtual void handle_chain_main(ChainMain& data, const char* extra) = 0; }; template static FORCEINLINE bool from_hex(char c, T& out_value) { if ('0' <= c && c <= '9') { out_value = static_cast(c - '0'); return true; } if ('a' <= c && c <= 'f') { out_value = static_cast((c - 'a') + 10); return true; } if ('A' <= c && c <= 'F') { out_value = static_cast((c - 'A') + 10); return true; } return false; } template struct abs_helper {}; template struct abs_helper { static FORCEINLINE T value(T x) { return x; } }; template struct abs_helper { static FORCEINLINE T value(T x) { return (x >= 0) ? x : -x; } }; template FORCEINLINE T abs(T x) { return abs_helper::value>::value(x); } template FORCEINLINE void writeVarint(T value, U&& callback) { while (value >= 0x80) { callback(static_cast((value & 0x7F) | 0x80)); value >>= 7; } callback(static_cast(value)); } template FORCEINLINE void writeVarint(T value, std::vector& out) { writeVarint(value, [&out](uint8_t b) { out.emplace_back(b); }); } template FORCEINLINE constexpr size_t array_size(T(&)[N]) { return N; } template FORCEINLINE constexpr size_t array_size(T(U::*)[N]) { return N; } [[noreturn]] void panic(); void make_thread_background(); class BackgroundJobTracker : public nocopy_nomove { public: BackgroundJobTracker(); ~BackgroundJobTracker(); void start(const char* name); void stop(const char* name); void wait(); void print_status(); private: struct Impl; Impl* m_impl; }; extern BackgroundJobTracker bkg_jobs_tracker; extern thread_local bool is_main_thread; bool resolve_host(std::string& host, bool& is_v6); template using unordered_map = robin_hood::detail::Table, std::equal_to>; template using unordered_set = robin_hood::detail::Table, std::equal_to>; } // namespace p2pool namespace robin_hood { template<> struct hash { FORCEINLINE size_t operator()(const p2pool::hash& value) const noexcept { return hash_bytes(value.h, p2pool::HASH_SIZE); } }; template struct hash> { FORCEINLINE size_t operator()(const std::array& value) const noexcept { return hash_bytes(value.data(), N); } }; } // namespace robin_hood