2011-05-14 10:31:46 +02:00
|
|
|
// Copyright (c) 2009-2010 Satoshi Nakamoto
|
2012-02-07 17:28:30 +01:00
|
|
|
// Copyright (c) 2009-2012 The Bitcoin developers
|
2011-05-14 10:31:46 +02:00
|
|
|
// Distributed under the MIT/X11 software license, see the accompanying
|
2012-05-18 16:02:28 +02:00
|
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
2011-05-14 10:31:46 +02:00
|
|
|
#ifndef BITCOIN_UTIL_H
|
|
|
|
#define BITCOIN_UTIL_H
|
|
|
|
|
|
|
|
#include "uint256.h"
|
|
|
|
|
2011-10-07 17:02:21 +02:00
|
|
|
#ifndef WIN32
|
2011-05-14 10:31:46 +02:00
|
|
|
#include <sys/types.h>
|
2011-05-14 11:18:39 +02:00
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/resource.h>
|
2012-03-18 23:14:03 +01:00
|
|
|
#else
|
2012-08-02 10:09:29 +02:00
|
|
|
typedef int pid_t; /* define for Windows compatibility */
|
2011-05-15 16:50:28 +02:00
|
|
|
#endif
|
2011-05-14 10:31:46 +02:00
|
|
|
#include <map>
|
2013-03-07 04:16:05 +01:00
|
|
|
#include <list>
|
|
|
|
#include <utility>
|
2011-05-14 10:31:46 +02:00
|
|
|
#include <vector>
|
|
|
|
#include <string>
|
|
|
|
|
|
|
|
#include <boost/thread.hpp>
|
2012-04-09 23:50:56 +02:00
|
|
|
#include <boost/filesystem.hpp>
|
|
|
|
#include <boost/filesystem/path.hpp>
|
2011-05-14 10:31:46 +02:00
|
|
|
#include <boost/date_time/gregorian/gregorian_types.hpp>
|
|
|
|
#include <boost/date_time/posix_time/posix_time_types.hpp>
|
|
|
|
|
2012-04-15 22:10:54 +02:00
|
|
|
#include "netbase.h" // for AddTimeData
|
2011-05-14 10:31:46 +02:00
|
|
|
|
2011-12-21 22:33:19 +01:00
|
|
|
typedef long long int64;
|
|
|
|
typedef unsigned long long uint64;
|
|
|
|
|
2012-04-15 22:10:54 +02:00
|
|
|
static const int64 COIN = 100000000;
|
|
|
|
static const int64 CENT = 1000000;
|
|
|
|
|
2011-05-14 10:31:46 +02:00
|
|
|
#define loop for (;;)
|
|
|
|
#define BEGIN(a) ((char*)&(a))
|
|
|
|
#define END(a) ((char*)&((&(a))[1]))
|
|
|
|
#define UBEGIN(a) ((unsigned char*)&(a))
|
|
|
|
#define UEND(a) ((unsigned char*)&((&(a))[1]))
|
|
|
|
#define ARRAYLEN(array) (sizeof(array)/sizeof((array)[0]))
|
|
|
|
|
|
|
|
#ifndef PRI64d
|
2011-12-19 22:27:15 +01:00
|
|
|
#if defined(_MSC_VER) || defined(__MSVCRT__)
|
2011-05-14 10:31:46 +02:00
|
|
|
#define PRI64d "I64d"
|
|
|
|
#define PRI64u "I64u"
|
|
|
|
#define PRI64x "I64x"
|
|
|
|
#else
|
|
|
|
#define PRI64d "lld"
|
|
|
|
#define PRI64u "llu"
|
|
|
|
#define PRI64x "llx"
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
2012-09-09 15:04:25 +02:00
|
|
|
/* Format characters for (s)size_t and ptrdiff_t */
|
|
|
|
#if defined(_MSC_VER) || defined(__MSVCRT__)
|
2012-09-30 14:34:05 +02:00
|
|
|
/* (s)size_t and ptrdiff_t have the same size specifier in MSVC:
|
|
|
|
http://msdn.microsoft.com/en-us/library/tcxf1dw6%28v=vs.100%29.aspx
|
|
|
|
*/
|
2012-09-30 11:57:25 +02:00
|
|
|
#define PRIszx "Ix"
|
|
|
|
#define PRIszu "Iu"
|
|
|
|
#define PRIszd "Id"
|
2012-09-30 14:34:05 +02:00
|
|
|
#define PRIpdx "Ix"
|
|
|
|
#define PRIpdu "Iu"
|
|
|
|
#define PRIpdd "Id"
|
|
|
|
#else /* C99 standard */
|
2012-09-30 11:57:25 +02:00
|
|
|
#define PRIszx "zx"
|
|
|
|
#define PRIszu "zu"
|
|
|
|
#define PRIszd "zd"
|
2012-09-30 14:34:05 +02:00
|
|
|
#define PRIpdx "tx"
|
|
|
|
#define PRIpdu "tu"
|
|
|
|
#define PRIpdd "td"
|
2012-09-09 15:04:25 +02:00
|
|
|
#endif
|
|
|
|
|
2011-05-14 10:31:46 +02:00
|
|
|
// This is needed because the foreach macro can't get over the comma in pair<t1, t2>
|
2011-06-01 17:13:25 +02:00
|
|
|
#define PAIRTYPE(t1, t2) std::pair<t1, t2>
|
2011-05-14 10:31:46 +02:00
|
|
|
|
|
|
|
// Align by increasing pointer, must have extra space at end of buffer
|
|
|
|
template <size_t nBytes, typename T>
|
|
|
|
T* alignup(T* p)
|
|
|
|
{
|
|
|
|
union
|
|
|
|
{
|
|
|
|
T* ptr;
|
|
|
|
size_t n;
|
|
|
|
} u;
|
|
|
|
u.ptr = p;
|
|
|
|
u.n = (u.n + (nBytes-1)) & ~(nBytes-1);
|
|
|
|
return u.ptr;
|
|
|
|
}
|
|
|
|
|
2011-10-07 17:02:21 +02:00
|
|
|
#ifdef WIN32
|
2011-05-14 10:31:46 +02:00
|
|
|
#define MSG_NOSIGNAL 0
|
|
|
|
#define MSG_DONTWAIT 0
|
2011-12-19 23:08:25 +01:00
|
|
|
|
2011-05-14 10:31:46 +02:00
|
|
|
#ifndef S_IRUSR
|
|
|
|
#define S_IRUSR 0400
|
|
|
|
#define S_IWUSR 0200
|
|
|
|
#endif
|
|
|
|
#else
|
|
|
|
#define MAX_PATH 1024
|
2013-03-07 20:25:21 +01:00
|
|
|
#endif
|
|
|
|
|
|
|
|
inline void MilliSleep(int64 n)
|
2011-05-14 10:31:46 +02:00
|
|
|
{
|
2013-03-07 20:25:21 +01:00
|
|
|
#if BOOST_VERSION >= 105000
|
|
|
|
boost::this_thread::sleep_for(boost::chrono::milliseconds(n));
|
|
|
|
#else
|
|
|
|
boost::this_thread::sleep(boost::posix_time::milliseconds(n));
|
2011-05-14 10:31:46 +02:00
|
|
|
#endif
|
2013-03-07 20:25:21 +01:00
|
|
|
}
|
2011-05-14 10:31:46 +02:00
|
|
|
|
2012-09-09 14:43:06 +02:00
|
|
|
/* This GNU C extension enables the compiler to check the format string against the parameters provided.
|
|
|
|
* X is the number of the "format string" parameter, and Y is the number of the first variadic parameter.
|
|
|
|
* Parameters count from 1.
|
|
|
|
*/
|
|
|
|
#ifdef __GNUC__
|
|
|
|
#define ATTR_WARN_PRINTF(X,Y) __attribute__((format(printf,X,Y)))
|
|
|
|
#else
|
|
|
|
#define ATTR_WARN_PRINTF(X,Y)
|
|
|
|
#endif
|
2011-05-14 10:31:46 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
extern std::map<std::string, std::string> mapArgs;
|
|
|
|
extern std::map<std::string, std::vector<std::string> > mapMultiArgs;
|
|
|
|
extern bool fDebug;
|
2012-06-22 19:11:57 +02:00
|
|
|
extern bool fDebugNet;
|
2011-05-14 10:31:46 +02:00
|
|
|
extern bool fPrintToConsole;
|
|
|
|
extern bool fPrintToDebugger;
|
|
|
|
extern bool fDaemon;
|
|
|
|
extern bool fServer;
|
|
|
|
extern bool fCommandLine;
|
|
|
|
extern std::string strMiscWarning;
|
|
|
|
extern bool fTestNet;
|
|
|
|
extern bool fNoListen;
|
|
|
|
extern bool fLogTimestamps;
|
2013-01-01 23:12:30 +01:00
|
|
|
extern volatile bool fReopenDebugLog;
|
2011-05-14 10:31:46 +02:00
|
|
|
|
|
|
|
void RandAddSeed();
|
|
|
|
void RandAddSeedPerfmon();
|
2012-09-09 14:43:06 +02:00
|
|
|
int ATTR_WARN_PRINTF(1,2) OutputDebugStringF(const char* pszFormat, ...);
|
2012-03-18 23:14:03 +01:00
|
|
|
|
2012-09-09 14:43:06 +02:00
|
|
|
/*
|
|
|
|
Rationale for the real_strprintf / strprintf construction:
|
|
|
|
It is not allowed to use va_start with a pass-by-reference argument.
|
|
|
|
(C++ standard, 18.7, paragraph 3). Use a dummy argument to work around this, and use a
|
|
|
|
macro to keep similar semantics.
|
2012-03-18 23:14:03 +01:00
|
|
|
*/
|
2012-09-09 14:43:06 +02:00
|
|
|
|
|
|
|
/** Overload strprintf for char*, so that GCC format type warnings can be given */
|
|
|
|
std::string ATTR_WARN_PRINTF(1,3) real_strprintf(const char *format, int dummy, ...);
|
|
|
|
/** Overload strprintf for std::string, to be able to use it with _ (translation).
|
|
|
|
* This will not support GCC format type warnings (-Wformat) so be careful.
|
|
|
|
*/
|
2012-03-18 23:14:03 +01:00
|
|
|
std::string real_strprintf(const std::string &format, int dummy, ...);
|
|
|
|
#define strprintf(format, ...) real_strprintf(format, 0, __VA_ARGS__)
|
2012-09-09 14:43:06 +02:00
|
|
|
std::string vstrprintf(const char *format, va_list ap);
|
|
|
|
|
2012-09-30 14:34:05 +02:00
|
|
|
bool ATTR_WARN_PRINTF(1,2) error(const char *format, ...);
|
|
|
|
|
2012-09-09 14:43:06 +02:00
|
|
|
/* Redefine printf so that it directs output to debug.log
|
|
|
|
*
|
|
|
|
* Do this *after* defining the other printf-like functions, because otherwise the
|
|
|
|
* __attribute__((format(printf,X,Y))) gets expanded to __attribute__((format(OutputDebugStringF,X,Y)))
|
|
|
|
* which confuses gcc.
|
|
|
|
*/
|
|
|
|
#define printf OutputDebugStringF
|
2012-03-18 23:14:03 +01:00
|
|
|
|
2011-05-14 10:31:46 +02:00
|
|
|
void LogException(std::exception* pex, const char* pszThread);
|
|
|
|
void PrintException(std::exception* pex, const char* pszThread);
|
|
|
|
void PrintExceptionContinue(std::exception* pex, const char* pszThread);
|
|
|
|
void ParseString(const std::string& str, char c, std::vector<std::string>& v);
|
2011-12-21 22:33:19 +01:00
|
|
|
std::string FormatMoney(int64 n, bool fPlus=false);
|
|
|
|
bool ParseMoney(const std::string& str, int64& nRet);
|
|
|
|
bool ParseMoney(const char* pszIn, int64& nRet);
|
2011-05-14 10:31:46 +02:00
|
|
|
std::vector<unsigned char> ParseHex(const char* psz);
|
|
|
|
std::vector<unsigned char> ParseHex(const std::string& str);
|
2012-01-05 03:40:52 +01:00
|
|
|
bool IsHex(const std::string& str);
|
2011-09-20 15:38:29 +02:00
|
|
|
std::vector<unsigned char> DecodeBase64(const char* p, bool* pfInvalid = NULL);
|
|
|
|
std::string DecodeBase64(const std::string& str);
|
|
|
|
std::string EncodeBase64(const unsigned char* pch, size_t len);
|
|
|
|
std::string EncodeBase64(const std::string& str);
|
2012-01-22 20:32:58 +01:00
|
|
|
std::vector<unsigned char> DecodeBase32(const char* p, bool* pfInvalid = NULL);
|
|
|
|
std::string DecodeBase32(const std::string& str);
|
|
|
|
std::string EncodeBase32(const unsigned char* pch, size_t len);
|
|
|
|
std::string EncodeBase32(const std::string& str);
|
2012-02-06 18:37:49 +01:00
|
|
|
void ParseParameters(int argc, const char*const argv[]);
|
2011-05-14 10:31:46 +02:00
|
|
|
bool WildcardMatch(const char* psz, const char* mask);
|
|
|
|
bool WildcardMatch(const std::string& str, const std::string& mask);
|
2012-05-12 07:24:27 +02:00
|
|
|
void FileCommit(FILE *fileout);
|
2011-05-14 10:31:46 +02:00
|
|
|
int GetFilesize(FILE* file);
|
2013-01-30 04:17:33 +01:00
|
|
|
bool TruncateFile(FILE *file, unsigned int length);
|
2012-08-16 02:21:28 +02:00
|
|
|
void AllocateFileRange(FILE *file, unsigned int offset, unsigned int length);
|
2012-05-12 07:24:27 +02:00
|
|
|
bool RenameOver(boost::filesystem::path src, boost::filesystem::path dest);
|
2012-04-09 23:50:56 +02:00
|
|
|
boost::filesystem::path GetDefaultDataDir();
|
|
|
|
const boost::filesystem::path &GetDataDir(bool fNetSpecific = true);
|
|
|
|
boost::filesystem::path GetConfigFile();
|
|
|
|
boost::filesystem::path GetPidFile();
|
|
|
|
void CreatePidFile(const boost::filesystem::path &path, pid_t pid);
|
2012-04-22 14:35:22 +02:00
|
|
|
void ReadConfigFile(std::map<std::string, std::string>& mapSettingsRet, std::map<std::string, std::vector<std::string> >& mapMultiSettingsRet);
|
2012-04-22 16:22:45 +02:00
|
|
|
#ifdef WIN32
|
|
|
|
boost::filesystem::path GetSpecialFolderPath(int nFolder, bool fCreate = true);
|
|
|
|
#endif
|
2012-11-29 00:33:12 +01:00
|
|
|
boost::filesystem::path GetTempPath();
|
2011-05-14 10:31:46 +02:00
|
|
|
void ShrinkDebugFile();
|
|
|
|
int GetRandInt(int nMax);
|
2011-12-21 22:33:19 +01:00
|
|
|
uint64 GetRand(uint64 nMax);
|
2012-05-17 18:13:14 +02:00
|
|
|
uint256 GetRandHash();
|
2011-12-21 22:33:19 +01:00
|
|
|
int64 GetTime();
|
|
|
|
void SetMockTime(int64 nMockTimeIn);
|
|
|
|
int64 GetAdjustedTime();
|
2013-01-11 12:11:34 +01:00
|
|
|
int64 GetTimeOffset();
|
2011-05-14 10:31:46 +02:00
|
|
|
std::string FormatFullVersion();
|
2011-12-16 22:26:14 +01:00
|
|
|
std::string FormatSubVersion(const std::string& name, int nClientVersion, const std::vector<std::string>& comments);
|
2012-01-03 23:33:31 +01:00
|
|
|
void AddTimeData(const CNetAddr& ip, int64 nTime);
|
2012-05-24 05:10:59 +02:00
|
|
|
void runCommand(std::string strCommand);
|
2011-05-14 10:31:46 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-12-21 22:33:19 +01:00
|
|
|
inline std::string i64tostr(int64 n)
|
2011-05-14 10:31:46 +02:00
|
|
|
{
|
|
|
|
return strprintf("%"PRI64d, n);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline std::string itostr(int n)
|
|
|
|
{
|
|
|
|
return strprintf("%d", n);
|
|
|
|
}
|
|
|
|
|
2011-12-21 22:33:19 +01:00
|
|
|
inline int64 atoi64(const char* psz)
|
2011-05-14 10:31:46 +02:00
|
|
|
{
|
|
|
|
#ifdef _MSC_VER
|
|
|
|
return _atoi64(psz);
|
|
|
|
#else
|
|
|
|
return strtoll(psz, NULL, 10);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2011-12-21 22:33:19 +01:00
|
|
|
inline int64 atoi64(const std::string& str)
|
2011-05-14 10:31:46 +02:00
|
|
|
{
|
|
|
|
#ifdef _MSC_VER
|
|
|
|
return _atoi64(str.c_str());
|
|
|
|
#else
|
|
|
|
return strtoll(str.c_str(), NULL, 10);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
inline int atoi(const std::string& str)
|
|
|
|
{
|
|
|
|
return atoi(str.c_str());
|
|
|
|
}
|
|
|
|
|
|
|
|
inline int roundint(double d)
|
|
|
|
{
|
|
|
|
return (int)(d > 0 ? d + 0.5 : d - 0.5);
|
|
|
|
}
|
|
|
|
|
2011-12-21 22:33:19 +01:00
|
|
|
inline int64 roundint64(double d)
|
2011-05-14 10:31:46 +02:00
|
|
|
{
|
2011-12-21 22:33:19 +01:00
|
|
|
return (int64)(d > 0 ? d + 0.5 : d - 0.5);
|
2011-05-14 10:31:46 +02:00
|
|
|
}
|
|
|
|
|
2011-12-21 22:33:19 +01:00
|
|
|
inline int64 abs64(int64 n)
|
2011-05-14 10:31:46 +02:00
|
|
|
{
|
|
|
|
return (n >= 0 ? n : -n);
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
std::string HexStr(const T itbegin, const T itend, bool fSpaces=false)
|
|
|
|
{
|
2012-09-09 14:52:07 +02:00
|
|
|
std::string rv;
|
|
|
|
static const char hexmap[16] = { '0', '1', '2', '3', '4', '5', '6', '7',
|
|
|
|
'8', '9', 'a', 'b', 'c', 'd', 'e', 'f' };
|
2012-04-21 20:15:25 +02:00
|
|
|
rv.reserve((itend-itbegin)*3);
|
|
|
|
for(T it = itbegin; it < itend; ++it)
|
|
|
|
{
|
|
|
|
unsigned char val = (unsigned char)(*it);
|
|
|
|
if(fSpaces && it != itbegin)
|
|
|
|
rv.push_back(' ');
|
|
|
|
rv.push_back(hexmap[val>>4]);
|
|
|
|
rv.push_back(hexmap[val&15]);
|
|
|
|
}
|
|
|
|
|
2012-09-09 14:52:07 +02:00
|
|
|
return rv;
|
2011-05-14 10:31:46 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
inline std::string HexStr(const std::vector<unsigned char>& vch, bool fSpaces=false)
|
|
|
|
{
|
|
|
|
return HexStr(vch.begin(), vch.end(), fSpaces);
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
void PrintHex(const T pbegin, const T pend, const char* pszFormat="%s", bool fSpaces=true)
|
|
|
|
{
|
|
|
|
printf(pszFormat, HexStr(pbegin, pend, fSpaces).c_str());
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void PrintHex(const std::vector<unsigned char>& vch, const char* pszFormat="%s", bool fSpaces=true)
|
|
|
|
{
|
|
|
|
printf(pszFormat, HexStr(vch, fSpaces).c_str());
|
|
|
|
}
|
|
|
|
|
2011-12-21 22:33:19 +01:00
|
|
|
inline int64 GetPerformanceCounter()
|
2011-05-14 10:31:46 +02:00
|
|
|
{
|
2011-12-21 22:33:19 +01:00
|
|
|
int64 nCounter = 0;
|
2011-10-07 17:02:21 +02:00
|
|
|
#ifdef WIN32
|
2011-05-14 10:31:46 +02:00
|
|
|
QueryPerformanceCounter((LARGE_INTEGER*)&nCounter);
|
|
|
|
#else
|
|
|
|
timeval t;
|
|
|
|
gettimeofday(&t, NULL);
|
2012-06-07 19:11:15 +02:00
|
|
|
nCounter = (int64) t.tv_sec * 1000000 + t.tv_usec;
|
2011-05-14 10:31:46 +02:00
|
|
|
#endif
|
|
|
|
return nCounter;
|
|
|
|
}
|
|
|
|
|
2011-12-21 22:33:19 +01:00
|
|
|
inline int64 GetTimeMillis()
|
2011-05-14 10:31:46 +02:00
|
|
|
{
|
|
|
|
return (boost::posix_time::ptime(boost::posix_time::microsec_clock::universal_time()) -
|
|
|
|
boost::posix_time::ptime(boost::gregorian::date(1970,1,1))).total_milliseconds();
|
|
|
|
}
|
|
|
|
|
2012-12-01 18:07:55 +01:00
|
|
|
inline int64 GetTimeMicros()
|
|
|
|
{
|
|
|
|
return (boost::posix_time::ptime(boost::posix_time::microsec_clock::universal_time()) -
|
|
|
|
boost::posix_time::ptime(boost::gregorian::date(1970,1,1))).total_microseconds();
|
|
|
|
}
|
|
|
|
|
2011-12-21 22:33:19 +01:00
|
|
|
inline std::string DateTimeStrFormat(const char* pszFormat, int64 nTime)
|
2011-05-14 10:31:46 +02:00
|
|
|
{
|
|
|
|
time_t n = nTime;
|
|
|
|
struct tm* ptmTime = gmtime(&n);
|
|
|
|
char pszTime[200];
|
|
|
|
strftime(pszTime, sizeof(pszTime), pszFormat, ptmTime);
|
|
|
|
return pszTime;
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
void skipspaces(T& it)
|
|
|
|
{
|
|
|
|
while (isspace(*it))
|
|
|
|
++it;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool IsSwitchChar(char c)
|
|
|
|
{
|
2011-10-07 17:02:21 +02:00
|
|
|
#ifdef WIN32
|
2011-05-14 10:31:46 +02:00
|
|
|
return c == '-' || c == '/';
|
|
|
|
#else
|
|
|
|
return c == '-';
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2012-02-06 18:37:49 +01:00
|
|
|
/**
|
|
|
|
* Return string argument or default value
|
|
|
|
*
|
|
|
|
* @param strArg Argument to get (e.g. "-foo")
|
|
|
|
* @param default (e.g. "1")
|
|
|
|
* @return command-line argument or default value
|
|
|
|
*/
|
|
|
|
std::string GetArg(const std::string& strArg, const std::string& strDefault);
|
2011-05-14 10:31:46 +02:00
|
|
|
|
2012-02-06 18:37:49 +01:00
|
|
|
/**
|
|
|
|
* Return integer argument or default value
|
|
|
|
*
|
|
|
|
* @param strArg Argument to get (e.g. "-foo")
|
|
|
|
* @param default (e.g. 1)
|
|
|
|
* @return command-line argument (0 if invalid number) or default value
|
|
|
|
*/
|
|
|
|
int64 GetArg(const std::string& strArg, int64 nDefault);
|
2011-05-14 10:31:46 +02:00
|
|
|
|
2012-02-06 18:37:49 +01:00
|
|
|
/**
|
|
|
|
* Return boolean argument or default value
|
|
|
|
*
|
|
|
|
* @param strArg Argument to get (e.g. "-foo")
|
|
|
|
* @param default (true or false)
|
|
|
|
* @return command-line argument or default value
|
|
|
|
*/
|
|
|
|
bool GetBoolArg(const std::string& strArg, bool fDefault=false);
|
2011-05-14 10:31:46 +02:00
|
|
|
|
2012-01-03 16:14:22 +01:00
|
|
|
/**
|
|
|
|
* Set an argument if it doesn't already have a value
|
|
|
|
*
|
|
|
|
* @param strArg Argument to set (e.g. "-foo")
|
|
|
|
* @param strValue Value (e.g. "1")
|
|
|
|
* @return true if argument gets set, false if it already had a value
|
|
|
|
*/
|
|
|
|
bool SoftSetArg(const std::string& strArg, const std::string& strValue);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Set a boolean argument if it doesn't already have a value
|
|
|
|
*
|
|
|
|
* @param strArg Argument to set (e.g. "-foo")
|
|
|
|
* @param fValue Value (e.g. false)
|
|
|
|
* @return true if argument gets set, false if it already had a value
|
|
|
|
*/
|
2012-02-06 21:48:00 +01:00
|
|
|
bool SoftSetBoolArg(const std::string& strArg, bool fValue);
|
2011-05-14 10:31:46 +02:00
|
|
|
|
2013-02-16 00:27:57 +01:00
|
|
|
/**
|
|
|
|
* MWC RNG of George Marsaglia
|
|
|
|
* This is intended to be fast. It has a period of 2^59.3, though the
|
|
|
|
* least significant 16 bits only have a period of about 2^30.1.
|
|
|
|
*
|
|
|
|
* @return random value
|
|
|
|
*/
|
|
|
|
extern uint32_t insecure_rand_Rz;
|
|
|
|
extern uint32_t insecure_rand_Rw;
|
|
|
|
static inline uint32_t insecure_rand(void)
|
|
|
|
{
|
2013-04-04 11:30:55 +02:00
|
|
|
insecure_rand_Rz = 36969 * (insecure_rand_Rz & 65535) + (insecure_rand_Rz >> 16);
|
|
|
|
insecure_rand_Rw = 18000 * (insecure_rand_Rw & 65535) + (insecure_rand_Rw >> 16);
|
|
|
|
return (insecure_rand_Rw << 16) + insecure_rand_Rz;
|
2013-02-16 00:27:57 +01:00
|
|
|
}
|
2011-05-14 10:31:46 +02:00
|
|
|
|
2013-02-16 00:27:57 +01:00
|
|
|
/**
|
|
|
|
* Seed insecure_rand using the random pool.
|
|
|
|
* @param Deterministic Use a determinstic seed
|
|
|
|
*/
|
|
|
|
void seed_insecure_rand(bool fDeterministic=false);
|
2011-05-14 10:31:46 +02:00
|
|
|
|
2012-09-18 21:07:58 +02:00
|
|
|
/** Median filter over a stream of values.
|
2012-03-26 16:48:23 +02:00
|
|
|
* Returns the median of the last N numbers
|
|
|
|
*/
|
2011-09-28 21:35:58 +02:00
|
|
|
template <typename T> class CMedianFilter
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
std::vector<T> vValues;
|
|
|
|
std::vector<T> vSorted;
|
2012-04-22 20:01:25 +02:00
|
|
|
unsigned int nSize;
|
2011-09-28 21:35:58 +02:00
|
|
|
public:
|
2012-04-22 20:01:25 +02:00
|
|
|
CMedianFilter(unsigned int size, T initial_value):
|
2011-09-28 21:35:58 +02:00
|
|
|
nSize(size)
|
|
|
|
{
|
|
|
|
vValues.reserve(size);
|
|
|
|
vValues.push_back(initial_value);
|
|
|
|
vSorted = vValues;
|
|
|
|
}
|
2012-09-18 21:07:58 +02:00
|
|
|
|
2011-09-28 21:35:58 +02:00
|
|
|
void input(T value)
|
|
|
|
{
|
|
|
|
if(vValues.size() == nSize)
|
|
|
|
{
|
|
|
|
vValues.erase(vValues.begin());
|
|
|
|
}
|
|
|
|
vValues.push_back(value);
|
|
|
|
|
|
|
|
vSorted.resize(vValues.size());
|
|
|
|
std::copy(vValues.begin(), vValues.end(), vSorted.begin());
|
|
|
|
std::sort(vSorted.begin(), vSorted.end());
|
|
|
|
}
|
|
|
|
|
|
|
|
T median() const
|
|
|
|
{
|
|
|
|
int size = vSorted.size();
|
2011-09-29 17:17:42 +02:00
|
|
|
assert(size>0);
|
2011-09-28 21:35:58 +02:00
|
|
|
if(size & 1) // Odd number of elements
|
|
|
|
{
|
|
|
|
return vSorted[size/2];
|
|
|
|
}
|
|
|
|
else // Even number of elements
|
|
|
|
{
|
|
|
|
return (vSorted[size/2-1] + vSorted[size/2]) / 2;
|
|
|
|
}
|
|
|
|
}
|
Retain only the most recent time samples
Remembering all time samples makes nTimeOffset slow to respond to
system clock corrections. For instance, I start my node with a system
clock that's 30 minutes slow and run it for a few days. During that
time, I accumulate 10,000 offset samples with a median of 1800
seconds. Now I correct my system clock. Without this change, my node
must collect another 10,000 samples before nTimeOffset is correct
again. With this change, I must only accumulate 100 samples to
correct the offset.
Storing unlimited time samples also allows an attacker with many IP
addresses (ex, a large botnet) to perform a memory exhaustion attack
against Bitcoin nodes. The attacker sends a version message from each
IP to his target, consuming more of the target's memory each time.
Time samples are small, so this attack might be impractical under the
old code, but it's impossible with the new code.
2011-11-30 04:15:59 +01:00
|
|
|
|
|
|
|
int size() const
|
|
|
|
{
|
|
|
|
return vValues.size();
|
|
|
|
}
|
|
|
|
|
|
|
|
std::vector<T> sorted () const
|
|
|
|
{
|
|
|
|
return vSorted;
|
|
|
|
}
|
2011-09-28 21:35:58 +02:00
|
|
|
};
|
|
|
|
|
2012-08-29 20:25:37 +02:00
|
|
|
bool NewThread(void(*pfn)(void*), void* parg);
|
2011-05-14 10:31:46 +02:00
|
|
|
|
2011-10-07 17:02:21 +02:00
|
|
|
#ifdef WIN32
|
2011-05-14 10:31:46 +02:00
|
|
|
inline void SetThreadPriority(int nPriority)
|
|
|
|
{
|
|
|
|
SetThreadPriority(GetCurrentThread(), nPriority);
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
|
|
|
|
#define THREAD_PRIORITY_LOWEST PRIO_MAX
|
|
|
|
#define THREAD_PRIORITY_BELOW_NORMAL 2
|
|
|
|
#define THREAD_PRIORITY_NORMAL 0
|
|
|
|
#define THREAD_PRIORITY_ABOVE_NORMAL 0
|
|
|
|
|
|
|
|
inline void SetThreadPriority(int nPriority)
|
|
|
|
{
|
|
|
|
// It's unclear if it's even possible to change thread priorities on Linux,
|
|
|
|
// but we really and truly need it for the generation threads.
|
|
|
|
#ifdef PRIO_THREAD
|
|
|
|
setpriority(PRIO_THREAD, 0, nPriority);
|
|
|
|
#else
|
|
|
|
setpriority(PRIO_PROCESS, 0, nPriority);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2011-07-12 14:24:14 +02:00
|
|
|
inline void ExitThread(size_t nExitCode)
|
2011-05-14 10:31:46 +02:00
|
|
|
{
|
|
|
|
pthread_exit((void*)nExitCode);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2012-06-24 17:03:57 +02:00
|
|
|
void RenameThread(const char* name);
|
2011-05-14 10:31:46 +02:00
|
|
|
|
2011-09-27 20:16:07 +02:00
|
|
|
inline uint32_t ByteReverse(uint32_t value)
|
|
|
|
{
|
2012-01-14 12:14:36 +01:00
|
|
|
value = ((value & 0xFF00FF00) >> 8) | ((value & 0x00FF00FF) << 8);
|
|
|
|
return (value<<16) | (value>>16);
|
2011-09-27 20:16:07 +02:00
|
|
|
}
|
|
|
|
|
2013-03-09 02:19:17 +01:00
|
|
|
// Standard wrapper for do-something-forever thread functions.
|
|
|
|
// "Forever" really means until the thread is interrupted.
|
|
|
|
// Use it like:
|
|
|
|
// new boost::thread(boost::bind(&LoopForever<void (*)()>, "dumpaddr", &DumpAddresses, 10000));
|
|
|
|
// or maybe:
|
|
|
|
// boost::function<void()> f = boost::bind(&FunctionWithArg, argument);
|
|
|
|
// threadGroup.create_thread(boost::bind(&LoopForever<boost::function<void()> >, "nothing", f, milliseconds));
|
|
|
|
template <typename Callable> void LoopForever(const char* name, Callable func, int64 msecs)
|
|
|
|
{
|
|
|
|
std::string s = strprintf("bitcoin-%s", name);
|
|
|
|
RenameThread(s.c_str());
|
|
|
|
printf("%s thread start\n", name);
|
|
|
|
try
|
|
|
|
{
|
|
|
|
while (1)
|
|
|
|
{
|
|
|
|
func();
|
|
|
|
MilliSleep(msecs);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
catch (boost::thread_interrupted)
|
|
|
|
{
|
|
|
|
printf("%s thread stop\n", name);
|
|
|
|
throw;
|
|
|
|
}
|
|
|
|
catch (std::exception& e) {
|
|
|
|
PrintException(&e, name);
|
|
|
|
}
|
|
|
|
catch (...) {
|
|
|
|
PrintException(NULL, name);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// .. and a wrapper that just calls func once
|
|
|
|
template <typename Callable> void TraceThread(const char* name, Callable func)
|
|
|
|
{
|
|
|
|
std::string s = strprintf("bitcoin-%s", name);
|
|
|
|
RenameThread(s.c_str());
|
|
|
|
try
|
|
|
|
{
|
|
|
|
printf("%s thread start\n", name);
|
|
|
|
func();
|
|
|
|
printf("%s thread exit\n", name);
|
|
|
|
}
|
|
|
|
catch (boost::thread_interrupted)
|
|
|
|
{
|
|
|
|
printf("%s thread interrupt\n", name);
|
|
|
|
throw;
|
|
|
|
}
|
|
|
|
catch (std::exception& e) {
|
|
|
|
PrintException(&e, name);
|
|
|
|
}
|
|
|
|
catch (...) {
|
|
|
|
PrintException(NULL, name);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-05-14 10:31:46 +02:00
|
|
|
#endif
|