mirror of https://github.com/bitcoin/bitcoin
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1202 lines
32 KiB
1202 lines
32 KiB
// Copyright (c) 2009-2010 Satoshi Nakamoto
|
|
// Copyright (c) 2009-2012 The Bitcoin developers
|
|
// Distributed under the MIT/X11 software license, see the accompanying
|
|
// file license.txt or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#include "headers.h"
|
|
#include "strlcpy.h"
|
|
#include <boost/algorithm/string/join.hpp>
|
|
#include <boost/program_options/detail/config_file.hpp>
|
|
#include <boost/program_options/parsers.hpp>
|
|
#include <boost/filesystem.hpp>
|
|
#include <boost/filesystem/fstream.hpp>
|
|
#include <boost/interprocess/sync/interprocess_mutex.hpp>
|
|
#include <boost/interprocess/sync/interprocess_recursive_mutex.hpp>
|
|
#include <boost/foreach.hpp>
|
|
|
|
using namespace std;
|
|
using namespace boost;
|
|
|
|
map<string, string> mapArgs;
|
|
map<string, vector<string> > mapMultiArgs;
|
|
bool fDebug = false;
|
|
bool fPrintToConsole = false;
|
|
bool fPrintToDebugger = false;
|
|
char pszSetDataDir[MAX_PATH] = "";
|
|
bool fRequestShutdown = false;
|
|
bool fShutdown = false;
|
|
bool fDaemon = false;
|
|
bool fServer = false;
|
|
bool fCommandLine = false;
|
|
string strMiscWarning;
|
|
bool fTestNet = false;
|
|
bool fNoListen = false;
|
|
bool fLogTimestamps = false;
|
|
CMedianFilter<int64> vTimeOffsets(200,0);
|
|
|
|
// Init openssl library multithreading support
|
|
static boost::interprocess::interprocess_mutex** ppmutexOpenSSL;
|
|
void locking_callback(int mode, int i, const char* file, int line)
|
|
{
|
|
if (mode & CRYPTO_LOCK)
|
|
ppmutexOpenSSL[i]->lock();
|
|
else
|
|
ppmutexOpenSSL[i]->unlock();
|
|
}
|
|
|
|
// Init
|
|
class CInit
|
|
{
|
|
public:
|
|
CInit()
|
|
{
|
|
// Init openssl library multithreading support
|
|
ppmutexOpenSSL = (boost::interprocess::interprocess_mutex**)OPENSSL_malloc(CRYPTO_num_locks() * sizeof(boost::interprocess::interprocess_mutex*));
|
|
for (int i = 0; i < CRYPTO_num_locks(); i++)
|
|
ppmutexOpenSSL[i] = new boost::interprocess::interprocess_mutex();
|
|
CRYPTO_set_locking_callback(locking_callback);
|
|
|
|
#ifdef WIN32
|
|
// Seed random number generator with screen scrape and other hardware sources
|
|
RAND_screen();
|
|
#endif
|
|
|
|
// Seed random number generator with performance counter
|
|
RandAddSeed();
|
|
}
|
|
~CInit()
|
|
{
|
|
// Shutdown openssl library multithreading support
|
|
CRYPTO_set_locking_callback(NULL);
|
|
for (int i = 0; i < CRYPTO_num_locks(); i++)
|
|
delete ppmutexOpenSSL[i];
|
|
OPENSSL_free(ppmutexOpenSSL);
|
|
}
|
|
}
|
|
instance_of_cinit;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void RandAddSeed()
|
|
{
|
|
// Seed with CPU performance counter
|
|
int64 nCounter = GetPerformanceCounter();
|
|
RAND_add(&nCounter, sizeof(nCounter), 1.5);
|
|
memset(&nCounter, 0, sizeof(nCounter));
|
|
}
|
|
|
|
void RandAddSeedPerfmon()
|
|
{
|
|
RandAddSeed();
|
|
|
|
// This can take up to 2 seconds, so only do it every 10 minutes
|
|
static int64 nLastPerfmon;
|
|
if (GetTime() < nLastPerfmon + 10 * 60)
|
|
return;
|
|
nLastPerfmon = GetTime();
|
|
|
|
#ifdef WIN32
|
|
// Don't need this on Linux, OpenSSL automatically uses /dev/urandom
|
|
// Seed with the entire set of perfmon data
|
|
unsigned char pdata[250000];
|
|
memset(pdata, 0, sizeof(pdata));
|
|
unsigned long nSize = sizeof(pdata);
|
|
long ret = RegQueryValueExA(HKEY_PERFORMANCE_DATA, "Global", NULL, NULL, pdata, &nSize);
|
|
RegCloseKey(HKEY_PERFORMANCE_DATA);
|
|
if (ret == ERROR_SUCCESS)
|
|
{
|
|
RAND_add(pdata, nSize, nSize/100.0);
|
|
memset(pdata, 0, nSize);
|
|
printf("%s RandAddSeed() %d bytes\n", DateTimeStrFormat("%x %H:%M", GetTime()).c_str(), nSize);
|
|
}
|
|
#endif
|
|
}
|
|
|
|
uint64 GetRand(uint64 nMax)
|
|
{
|
|
if (nMax == 0)
|
|
return 0;
|
|
|
|
// The range of the random source must be a multiple of the modulus
|
|
// to give every possible output value an equal possibility
|
|
uint64 nRange = (std::numeric_limits<uint64>::max() / nMax) * nMax;
|
|
uint64 nRand = 0;
|
|
do
|
|
RAND_bytes((unsigned char*)&nRand, sizeof(nRand));
|
|
while (nRand >= nRange);
|
|
return (nRand % nMax);
|
|
}
|
|
|
|
int GetRandInt(int nMax)
|
|
{
|
|
return GetRand(nMax);
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
inline int OutputDebugStringF(const char* pszFormat, ...)
|
|
{
|
|
int ret = 0;
|
|
if (fPrintToConsole)
|
|
{
|
|
// print to console
|
|
va_list arg_ptr;
|
|
va_start(arg_ptr, pszFormat);
|
|
ret = vprintf(pszFormat, arg_ptr);
|
|
va_end(arg_ptr);
|
|
}
|
|
else
|
|
{
|
|
// print to debug.log
|
|
static FILE* fileout = NULL;
|
|
|
|
if (!fileout)
|
|
{
|
|
char pszFile[MAX_PATH+100];
|
|
GetDataDir(pszFile);
|
|
strlcat(pszFile, "/debug.log", sizeof(pszFile));
|
|
fileout = fopen(pszFile, "a");
|
|
if (fileout) setbuf(fileout, NULL); // unbuffered
|
|
}
|
|
if (fileout)
|
|
{
|
|
static bool fStartedNewLine = true;
|
|
|
|
// Debug print useful for profiling
|
|
if (fLogTimestamps && fStartedNewLine)
|
|
fprintf(fileout, "%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
|
|
if (pszFormat[strlen(pszFormat) - 1] == '\n')
|
|
fStartedNewLine = true;
|
|
else
|
|
fStartedNewLine = false;
|
|
|
|
va_list arg_ptr;
|
|
va_start(arg_ptr, pszFormat);
|
|
ret = vfprintf(fileout, pszFormat, arg_ptr);
|
|
va_end(arg_ptr);
|
|
}
|
|
}
|
|
|
|
#ifdef WIN32
|
|
if (fPrintToDebugger)
|
|
{
|
|
static CCriticalSection cs_OutputDebugStringF;
|
|
|
|
// accumulate a line at a time
|
|
{
|
|
LOCK(cs_OutputDebugStringF);
|
|
static char pszBuffer[50000];
|
|
static char* pend;
|
|
if (pend == NULL)
|
|
pend = pszBuffer;
|
|
va_list arg_ptr;
|
|
va_start(arg_ptr, pszFormat);
|
|
int limit = END(pszBuffer) - pend - 2;
|
|
int ret = _vsnprintf(pend, limit, pszFormat, arg_ptr);
|
|
va_end(arg_ptr);
|
|
if (ret < 0 || ret >= limit)
|
|
{
|
|
pend = END(pszBuffer) - 2;
|
|
*pend++ = '\n';
|
|
}
|
|
else
|
|
pend += ret;
|
|
*pend = '\0';
|
|
char* p1 = pszBuffer;
|
|
char* p2;
|
|
while (p2 = strchr(p1, '\n'))
|
|
{
|
|
p2++;
|
|
char c = *p2;
|
|
*p2 = '\0';
|
|
OutputDebugStringA(p1);
|
|
*p2 = c;
|
|
p1 = p2;
|
|
}
|
|
if (p1 != pszBuffer)
|
|
memmove(pszBuffer, p1, pend - p1 + 1);
|
|
pend -= (p1 - pszBuffer);
|
|
}
|
|
}
|
|
#endif
|
|
return ret;
|
|
}
|
|
|
|
|
|
// Safer snprintf
|
|
// - prints up to limit-1 characters
|
|
// - output string is always null terminated even if limit reached
|
|
// - return value is the number of characters actually printed
|
|
int my_snprintf(char* buffer, size_t limit, const char* format, ...)
|
|
{
|
|
if (limit == 0)
|
|
return 0;
|
|
va_list arg_ptr;
|
|
va_start(arg_ptr, format);
|
|
int ret = _vsnprintf(buffer, limit, format, arg_ptr);
|
|
va_end(arg_ptr);
|
|
if (ret < 0 || ret >= limit)
|
|
{
|
|
ret = limit - 1;
|
|
buffer[limit-1] = 0;
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
string real_strprintf(const std::string &format, int dummy, ...)
|
|
{
|
|
char buffer[50000];
|
|
char* p = buffer;
|
|
int limit = sizeof(buffer);
|
|
int ret;
|
|
loop
|
|
{
|
|
va_list arg_ptr;
|
|
va_start(arg_ptr, dummy);
|
|
ret = _vsnprintf(p, limit, format.c_str(), arg_ptr);
|
|
va_end(arg_ptr);
|
|
if (ret >= 0 && ret < limit)
|
|
break;
|
|
if (p != buffer)
|
|
delete[] p;
|
|
limit *= 2;
|
|
p = new char[limit];
|
|
if (p == NULL)
|
|
throw std::bad_alloc();
|
|
}
|
|
string str(p, p+ret);
|
|
if (p != buffer)
|
|
delete[] p;
|
|
return str;
|
|
}
|
|
|
|
bool error(const char *format, ...)
|
|
{
|
|
char buffer[50000];
|
|
int limit = sizeof(buffer);
|
|
va_list arg_ptr;
|
|
va_start(arg_ptr, format);
|
|
int ret = _vsnprintf(buffer, limit, format, arg_ptr);
|
|
va_end(arg_ptr);
|
|
if (ret < 0 || ret >= limit)
|
|
{
|
|
ret = limit - 1;
|
|
buffer[limit-1] = 0;
|
|
}
|
|
printf("ERROR: %s\n", buffer);
|
|
return false;
|
|
}
|
|
|
|
|
|
void ParseString(const string& str, char c, vector<string>& v)
|
|
{
|
|
if (str.empty())
|
|
return;
|
|
string::size_type i1 = 0;
|
|
string::size_type i2;
|
|
loop
|
|
{
|
|
i2 = str.find(c, i1);
|
|
if (i2 == str.npos)
|
|
{
|
|
v.push_back(str.substr(i1));
|
|
return;
|
|
}
|
|
v.push_back(str.substr(i1, i2-i1));
|
|
i1 = i2+1;
|
|
}
|
|
}
|
|
|
|
|
|
string FormatMoney(int64 n, bool fPlus)
|
|
{
|
|
// Note: not using straight sprintf here because we do NOT want
|
|
// localized number formatting.
|
|
int64 n_abs = (n > 0 ? n : -n);
|
|
int64 quotient = n_abs/COIN;
|
|
int64 remainder = n_abs%COIN;
|
|
string str = strprintf("%"PRI64d".%08"PRI64d, quotient, remainder);
|
|
|
|
// Right-trim excess 0's before the decimal point:
|
|
int nTrim = 0;
|
|
for (int i = str.size()-1; (str[i] == '0' && isdigit(str[i-2])); --i)
|
|
++nTrim;
|
|
if (nTrim)
|
|
str.erase(str.size()-nTrim, nTrim);
|
|
|
|
if (n < 0)
|
|
str.insert((unsigned int)0, 1, '-');
|
|
else if (fPlus && n > 0)
|
|
str.insert((unsigned int)0, 1, '+');
|
|
return str;
|
|
}
|
|
|
|
|
|
bool ParseMoney(const string& str, int64& nRet)
|
|
{
|
|
return ParseMoney(str.c_str(), nRet);
|
|
}
|
|
|
|
bool ParseMoney(const char* pszIn, int64& nRet)
|
|
{
|
|
string strWhole;
|
|
int64 nUnits = 0;
|
|
const char* p = pszIn;
|
|
while (isspace(*p))
|
|
p++;
|
|
for (; *p; p++)
|
|
{
|
|
if (*p == '.')
|
|
{
|
|
p++;
|
|
int64 nMult = CENT*10;
|
|
while (isdigit(*p) && (nMult > 0))
|
|
{
|
|
nUnits += nMult * (*p++ - '0');
|
|
nMult /= 10;
|
|
}
|
|
break;
|
|
}
|
|
if (isspace(*p))
|
|
break;
|
|
if (!isdigit(*p))
|
|
return false;
|
|
strWhole.insert(strWhole.end(), *p);
|
|
}
|
|
for (; *p; p++)
|
|
if (!isspace(*p))
|
|
return false;
|
|
if (strWhole.size() > 10) // guard against 63 bit overflow
|
|
return false;
|
|
if (nUnits < 0 || nUnits > COIN)
|
|
return false;
|
|
int64 nWhole = atoi64(strWhole);
|
|
int64 nValue = nWhole*COIN + nUnits;
|
|
|
|
nRet = nValue;
|
|
return true;
|
|
}
|
|
|
|
|
|
static char phexdigit[256] =
|
|
{ -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
|
|
-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
|
|
-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
|
|
0,1,2,3,4,5,6,7,8,9,-1,-1,-1,-1,-1,-1,
|
|
-1,0xa,0xb,0xc,0xd,0xe,0xf,-1,-1,-1,-1,-1,-1,-1,-1,-1,
|
|
-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
|
|
-1,0xa,0xb,0xc,0xd,0xe,0xf,-1,-1,-1,-1,-1,-1,-1,-1,-1
|
|
-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
|
|
-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
|
|
-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
|
|
-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
|
|
-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
|
|
-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
|
|
-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
|
|
-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
|
|
-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, };
|
|
|
|
bool IsHex(const string& str)
|
|
{
|
|
BOOST_FOREACH(unsigned char c, str)
|
|
{
|
|
if (phexdigit[c] < 0)
|
|
return false;
|
|
}
|
|
return (str.size() > 0) && (str.size()%2 == 0);
|
|
}
|
|
|
|
vector<unsigned char> ParseHex(const char* psz)
|
|
{
|
|
// convert hex dump to vector
|
|
vector<unsigned char> vch;
|
|
loop
|
|
{
|
|
while (isspace(*psz))
|
|
psz++;
|
|
char c = phexdigit[(unsigned char)*psz++];
|
|
if (c == (char)-1)
|
|
break;
|
|
unsigned char n = (c << 4);
|
|
c = phexdigit[(unsigned char)*psz++];
|
|
if (c == (char)-1)
|
|
break;
|
|
n |= c;
|
|
vch.push_back(n);
|
|
}
|
|
return vch;
|
|
}
|
|
|
|
vector<unsigned char> ParseHex(const string& str)
|
|
{
|
|
return ParseHex(str.c_str());
|
|
}
|
|
|
|
static void InterpretNegativeSetting(string name, map<string, string>& mapSettingsRet)
|
|
{
|
|
// interpret -nofoo as -foo=0 (and -nofoo=0 as -foo=1) as long as -foo not set
|
|
if (name.find("-no") == 0)
|
|
{
|
|
std::string positive("-");
|
|
positive.append(name.begin()+3, name.end());
|
|
if (mapSettingsRet.count(positive) == 0)
|
|
{
|
|
bool value = !GetBoolArg(name);
|
|
mapSettingsRet[positive] = (value ? "1" : "0");
|
|
}
|
|
}
|
|
}
|
|
|
|
void ParseParameters(int argc, const char*const argv[])
|
|
{
|
|
mapArgs.clear();
|
|
mapMultiArgs.clear();
|
|
for (int i = 1; i < argc; i++)
|
|
{
|
|
char psz[10000];
|
|
strlcpy(psz, argv[i], sizeof(psz));
|
|
char* pszValue = (char*)"";
|
|
if (strchr(psz, '='))
|
|
{
|
|
pszValue = strchr(psz, '=');
|
|
*pszValue++ = '\0';
|
|
}
|
|
#ifdef WIN32
|
|
_strlwr(psz);
|
|
if (psz[0] == '/')
|
|
psz[0] = '-';
|
|
#endif
|
|
if (psz[0] != '-')
|
|
break;
|
|
|
|
mapArgs[psz] = pszValue;
|
|
mapMultiArgs[psz].push_back(pszValue);
|
|
}
|
|
|
|
// New 0.6 features:
|
|
BOOST_FOREACH(const PAIRTYPE(string,string)& entry, mapArgs)
|
|
{
|
|
string name = entry.first;
|
|
|
|
// interpret --foo as -foo (as long as both are not set)
|
|
if (name.find("--") == 0)
|
|
{
|
|
std::string singleDash(name.begin()+1, name.end());
|
|
if (mapArgs.count(singleDash) == 0)
|
|
mapArgs[singleDash] = entry.second;
|
|
name = singleDash;
|
|
}
|
|
|
|
// interpret -nofoo as -foo=0 (and -nofoo=0 as -foo=1) as long as -foo not set
|
|
InterpretNegativeSetting(name, mapArgs);
|
|
}
|
|
}
|
|
|
|
std::string GetArg(const std::string& strArg, const std::string& strDefault)
|
|
{
|
|
if (mapArgs.count(strArg))
|
|
return mapArgs[strArg];
|
|
return strDefault;
|
|
}
|
|
|
|
int64 GetArg(const std::string& strArg, int64 nDefault)
|
|
{
|
|
if (mapArgs.count(strArg))
|
|
return atoi64(mapArgs[strArg]);
|
|
return nDefault;
|
|
}
|
|
|
|
bool GetBoolArg(const std::string& strArg, bool fDefault)
|
|
{
|
|
if (mapArgs.count(strArg))
|
|
{
|
|
if (mapArgs[strArg].empty())
|
|
return true;
|
|
return (atoi(mapArgs[strArg]) != 0);
|
|
}
|
|
return fDefault;
|
|
}
|
|
|
|
bool SoftSetArg(const std::string& strArg, const std::string& strValue)
|
|
{
|
|
if (mapArgs.count(strArg))
|
|
return false;
|
|
mapArgs[strArg] = strValue;
|
|
return true;
|
|
}
|
|
|
|
bool SoftSetBoolArg(const std::string& strArg, bool fValue)
|
|
{
|
|
if (fValue)
|
|
return SoftSetArg(strArg, std::string("1"));
|
|
else
|
|
return SoftSetArg(strArg, std::string("0"));
|
|
}
|
|
|
|
|
|
string EncodeBase64(const unsigned char* pch, size_t len)
|
|
{
|
|
static const char *pbase64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
|
|
|
|
string strRet="";
|
|
strRet.reserve((len+2)/3*4);
|
|
|
|
int mode=0, left=0;
|
|
const unsigned char *pchEnd = pch+len;
|
|
|
|
while (pch<pchEnd)
|
|
{
|
|
int enc = *(pch++);
|
|
switch (mode)
|
|
{
|
|
case 0: // we have no bits
|
|
strRet += pbase64[enc >> 2];
|
|
left = (enc & 3) << 4;
|
|
mode = 1;
|
|
break;
|
|
|
|
case 1: // we have two bits
|
|
strRet += pbase64[left | (enc >> 4)];
|
|
left = (enc & 15) << 2;
|
|
mode = 2;
|
|
break;
|
|
|
|
case 2: // we have four bits
|
|
strRet += pbase64[left | (enc >> 6)];
|
|
strRet += pbase64[enc & 63];
|
|
mode = 0;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (mode)
|
|
{
|
|
strRet += pbase64[left];
|
|
strRet += '=';
|
|
if (mode == 1)
|
|
strRet += '=';
|
|
}
|
|
|
|
return strRet;
|
|
}
|
|
|
|
string EncodeBase64(const string& str)
|
|
{
|
|
return EncodeBase64((const unsigned char*)str.c_str(), str.size());
|
|
}
|
|
|
|
vector<unsigned char> DecodeBase64(const char* p, bool* pfInvalid)
|
|
{
|
|
static const int decode64_table[256] =
|
|
{
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
-1, -1, -1, 62, -1, -1, -1, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1,
|
|
-1, -1, -1, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
|
|
15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1, -1, 26, 27, 28,
|
|
29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48,
|
|
49, 50, 51, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1
|
|
};
|
|
|
|
if (pfInvalid)
|
|
*pfInvalid = false;
|
|
|
|
vector<unsigned char> vchRet;
|
|
vchRet.reserve(strlen(p)*3/4);
|
|
|
|
int mode = 0;
|
|
int left = 0;
|
|
|
|
while (1)
|
|
{
|
|
int dec = decode64_table[*p];
|
|
if (dec == -1) break;
|
|
p++;
|
|
switch (mode)
|
|
{
|
|
case 0: // we have no bits and get 6
|
|
left = dec;
|
|
mode = 1;
|
|
break;
|
|
|
|
case 1: // we have 6 bits and keep 4
|
|
vchRet.push_back((left<<2) | (dec>>4));
|
|
left = dec & 15;
|
|
mode = 2;
|
|
break;
|
|
|
|
case 2: // we have 4 bits and get 6, we keep 2
|
|
vchRet.push_back((left<<4) | (dec>>2));
|
|
left = dec & 3;
|
|
mode = 3;
|
|
break;
|
|
|
|
case 3: // we have 2 bits and get 6
|
|
vchRet.push_back((left<<6) | dec);
|
|
mode = 0;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (pfInvalid)
|
|
switch (mode)
|
|
{
|
|
case 0: // 4n base64 characters processed: ok
|
|
break;
|
|
|
|
case 1: // 4n+1 base64 character processed: impossible
|
|
*pfInvalid = true;
|
|
break;
|
|
|
|
case 2: // 4n+2 base64 characters processed: require '=='
|
|
if (left || p[0] != '=' || p[1] != '=' || decode64_table[p[2]] != -1)
|
|
*pfInvalid = true;
|
|
break;
|
|
|
|
case 3: // 4n+3 base64 characters processed: require '='
|
|
if (left || p[0] != '=' || decode64_table[p[1]] != -1)
|
|
*pfInvalid = true;
|
|
break;
|
|
}
|
|
|
|
return vchRet;
|
|
}
|
|
|
|
string DecodeBase64(const string& str)
|
|
{
|
|
vector<unsigned char> vchRet = DecodeBase64(str.c_str());
|
|
return string((const char*)&vchRet[0], vchRet.size());
|
|
}
|
|
|
|
|
|
bool WildcardMatch(const char* psz, const char* mask)
|
|
{
|
|
loop
|
|
{
|
|
switch (*mask)
|
|
{
|
|
case '\0':
|
|
return (*psz == '\0');
|
|
case '*':
|
|
return WildcardMatch(psz, mask+1) || (*psz && WildcardMatch(psz+1, mask));
|
|
case '?':
|
|
if (*psz == '\0')
|
|
return false;
|
|
break;
|
|
default:
|
|
if (*psz != *mask)
|
|
return false;
|
|
break;
|
|
}
|
|
psz++;
|
|
mask++;
|
|
}
|
|
}
|
|
|
|
bool WildcardMatch(const string& str, const string& mask)
|
|
{
|
|
return WildcardMatch(str.c_str(), mask.c_str());
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void FormatException(char* pszMessage, std::exception* pex, const char* pszThread)
|
|
{
|
|
#ifdef WIN32
|
|
char pszModule[MAX_PATH];
|
|
pszModule[0] = '\0';
|
|
GetModuleFileNameA(NULL, pszModule, sizeof(pszModule));
|
|
#else
|
|
const char* pszModule = "bitcoin";
|
|
#endif
|
|
if (pex)
|
|
snprintf(pszMessage, 1000,
|
|
"EXCEPTION: %s \n%s \n%s in %s \n", typeid(*pex).name(), pex->what(), pszModule, pszThread);
|
|
else
|
|
snprintf(pszMessage, 1000,
|
|
"UNKNOWN EXCEPTION \n%s in %s \n", pszModule, pszThread);
|
|
}
|
|
|
|
void LogException(std::exception* pex, const char* pszThread)
|
|
{
|
|
char pszMessage[10000];
|
|
FormatException(pszMessage, pex, pszThread);
|
|
printf("\n%s", pszMessage);
|
|
}
|
|
|
|
void PrintException(std::exception* pex, const char* pszThread)
|
|
{
|
|
char pszMessage[10000];
|
|
FormatException(pszMessage, pex, pszThread);
|
|
printf("\n\n************************\n%s\n", pszMessage);
|
|
fprintf(stderr, "\n\n************************\n%s\n", pszMessage);
|
|
strMiscWarning = pszMessage;
|
|
throw;
|
|
}
|
|
|
|
void PrintExceptionContinue(std::exception* pex, const char* pszThread)
|
|
{
|
|
char pszMessage[10000];
|
|
FormatException(pszMessage, pex, pszThread);
|
|
printf("\n\n************************\n%s\n", pszMessage);
|
|
fprintf(stderr, "\n\n************************\n%s\n", pszMessage);
|
|
strMiscWarning = pszMessage;
|
|
}
|
|
|
|
#ifdef WIN32
|
|
string MyGetSpecialFolderPath(int nFolder, bool fCreate)
|
|
{
|
|
char pszPath[MAX_PATH] = "";
|
|
if(SHGetSpecialFolderPathA(NULL, pszPath, nFolder, fCreate))
|
|
{
|
|
return pszPath;
|
|
}
|
|
else if (nFolder == CSIDL_STARTUP)
|
|
{
|
|
return string(getenv("USERPROFILE")) + "\\Start Menu\\Programs\\Startup";
|
|
}
|
|
else if (nFolder == CSIDL_APPDATA)
|
|
{
|
|
return getenv("APPDATA");
|
|
}
|
|
return "";
|
|
}
|
|
#endif
|
|
|
|
string GetDefaultDataDir()
|
|
{
|
|
// Windows: C:\Documents and Settings\username\Application Data\Bitcoin
|
|
// Mac: ~/Library/Application Support/Bitcoin
|
|
// Unix: ~/.bitcoin
|
|
#ifdef WIN32
|
|
// Windows
|
|
return MyGetSpecialFolderPath(CSIDL_APPDATA, true) + "\\Bitcoin";
|
|
#else
|
|
char* pszHome = getenv("HOME");
|
|
if (pszHome == NULL || strlen(pszHome) == 0)
|
|
pszHome = (char*)"/";
|
|
string strHome = pszHome;
|
|
if (strHome[strHome.size()-1] != '/')
|
|
strHome += '/';
|
|
#ifdef MAC_OSX
|
|
// Mac
|
|
strHome += "Library/Application Support/";
|
|
filesystem::create_directory(strHome.c_str());
|
|
return strHome + "Bitcoin";
|
|
#else
|
|
// Unix
|
|
return strHome + ".bitcoin";
|
|
#endif
|
|
#endif
|
|
}
|
|
|
|
void GetDataDir(char* pszDir)
|
|
{
|
|
// pszDir must be at least MAX_PATH length.
|
|
int nVariation;
|
|
if (pszSetDataDir[0] != 0)
|
|
{
|
|
strlcpy(pszDir, pszSetDataDir, MAX_PATH);
|
|
nVariation = 0;
|
|
}
|
|
else
|
|
{
|
|
// This can be called during exceptions by printf, so we cache the
|
|
// value so we don't have to do memory allocations after that.
|
|
static char pszCachedDir[MAX_PATH];
|
|
if (pszCachedDir[0] == 0)
|
|
strlcpy(pszCachedDir, GetDefaultDataDir().c_str(), sizeof(pszCachedDir));
|
|
strlcpy(pszDir, pszCachedDir, MAX_PATH);
|
|
nVariation = 1;
|
|
}
|
|
if (fTestNet)
|
|
{
|
|
char* p = pszDir + strlen(pszDir);
|
|
if (p > pszDir && p[-1] != '/' && p[-1] != '\\')
|
|
*p++ = '/';
|
|
strcpy(p, "testnet");
|
|
nVariation += 2;
|
|
}
|
|
static bool pfMkdir[4];
|
|
if (!pfMkdir[nVariation])
|
|
{
|
|
pfMkdir[nVariation] = true;
|
|
boost::filesystem::create_directory(pszDir);
|
|
}
|
|
}
|
|
|
|
string GetDataDir()
|
|
{
|
|
char pszDir[MAX_PATH];
|
|
GetDataDir(pszDir);
|
|
return pszDir;
|
|
}
|
|
|
|
string GetConfigFile()
|
|
{
|
|
namespace fs = boost::filesystem;
|
|
|
|
fs::path pathConfigFile(GetArg("-conf", "bitcoin.conf"));
|
|
if (!pathConfigFile.is_complete()) pathConfigFile = fs::path(GetDataDir()) / pathConfigFile;
|
|
pathConfigFile.make_preferred();
|
|
return pathConfigFile.string();
|
|
}
|
|
|
|
bool ReadConfigFile(map<string, string>& mapSettingsRet,
|
|
map<string, vector<string> >& mapMultiSettingsRet)
|
|
{
|
|
namespace fs = boost::filesystem;
|
|
namespace pod = boost::program_options::detail;
|
|
|
|
if (mapSettingsRet.count("-datadir"))
|
|
{
|
|
if (fs::is_directory(fs::system_complete(mapSettingsRet["-datadir"])))
|
|
{
|
|
fs::path pathDataDir(fs::system_complete(mapSettingsRet["-datadir"]));
|
|
pathDataDir.make_preferred();
|
|
|
|
strlcpy(pszSetDataDir, pathDataDir.string().c_str(), sizeof(pszSetDataDir));
|
|
}
|
|
else
|
|
{
|
|
return false;
|
|
}
|
|
}
|
|
|
|
fs::ifstream streamConfig(GetConfigFile());
|
|
if (!streamConfig.good())
|
|
return true; // No bitcoin.conf file is OK
|
|
|
|
set<string> setOptions;
|
|
setOptions.insert("*");
|
|
|
|
for (pod::config_file_iterator it(streamConfig, setOptions), end; it != end; ++it)
|
|
{
|
|
// Don't overwrite existing settings so command line settings override bitcoin.conf
|
|
string strKey = string("-") + it->string_key;
|
|
if (mapSettingsRet.count(strKey) == 0)
|
|
{
|
|
mapSettingsRet[strKey] = it->value[0];
|
|
// interpret nofoo=1 as foo=0 (and nofoo=0 as foo=1) as long as foo not set)
|
|
InterpretNegativeSetting(strKey, mapSettingsRet);
|
|
}
|
|
mapMultiSettingsRet[strKey].push_back(it->value[0]);
|
|
}
|
|
return true;
|
|
}
|
|
|
|
string GetPidFile()
|
|
{
|
|
namespace fs = boost::filesystem;
|
|
|
|
fs::path pathPidFile(GetArg("-pid", "bitcoind.pid"));
|
|
if (!pathPidFile.is_complete()) pathPidFile = fs::path(GetDataDir()) / pathPidFile;
|
|
pathPidFile.make_preferred();
|
|
return pathPidFile.string();
|
|
}
|
|
|
|
void CreatePidFile(string pidFile, pid_t pid)
|
|
{
|
|
FILE* file = fopen(pidFile.c_str(), "w");
|
|
if (file)
|
|
{
|
|
fprintf(file, "%d\n", pid);
|
|
fclose(file);
|
|
}
|
|
}
|
|
|
|
int GetFilesize(FILE* file)
|
|
{
|
|
int nSavePos = ftell(file);
|
|
int nFilesize = -1;
|
|
if (fseek(file, 0, SEEK_END) == 0)
|
|
nFilesize = ftell(file);
|
|
fseek(file, nSavePos, SEEK_SET);
|
|
return nFilesize;
|
|
}
|
|
|
|
void ShrinkDebugFile()
|
|
{
|
|
// Scroll debug.log if it's getting too big
|
|
string strFile = GetDataDir() + "/debug.log";
|
|
FILE* file = fopen(strFile.c_str(), "r");
|
|
if (file && GetFilesize(file) > 10 * 1000000)
|
|
{
|
|
// Restart the file with some of the end
|
|
char pch[200000];
|
|
fseek(file, -sizeof(pch), SEEK_END);
|
|
int nBytes = fread(pch, 1, sizeof(pch), file);
|
|
fclose(file);
|
|
|
|
file = fopen(strFile.c_str(), "w");
|
|
if (file)
|
|
{
|
|
fwrite(pch, 1, nBytes, file);
|
|
fclose(file);
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//
|
|
// "Never go to sea with two chronometers; take one or three."
|
|
// Our three time sources are:
|
|
// - System clock
|
|
// - Median of other nodes's clocks
|
|
// - The user (asking the user to fix the system clock if the first two disagree)
|
|
//
|
|
static int64 nMockTime = 0; // For unit testing
|
|
|
|
int64 GetTime()
|
|
{
|
|
if (nMockTime) return nMockTime;
|
|
|
|
return time(NULL);
|
|
}
|
|
|
|
void SetMockTime(int64 nMockTimeIn)
|
|
{
|
|
nMockTime = nMockTimeIn;
|
|
}
|
|
|
|
static int64 nTimeOffset = 0;
|
|
|
|
int64 GetAdjustedTime()
|
|
{
|
|
return GetTime() + nTimeOffset;
|
|
}
|
|
|
|
void AddTimeData(const CNetAddr& ip, int64 nTime)
|
|
{
|
|
int64 nOffsetSample = nTime - GetTime();
|
|
|
|
// Ignore duplicates
|
|
static set<CNetAddr> setKnown;
|
|
if (!setKnown.insert(ip).second)
|
|
return;
|
|
|
|
// Add data
|
|
vTimeOffsets.input(nOffsetSample);
|
|
printf("Added time data, samples %d, offset %+"PRI64d" (%+"PRI64d" minutes)\n", vTimeOffsets.size(), nOffsetSample, nOffsetSample/60);
|
|
if (vTimeOffsets.size() >= 5 && vTimeOffsets.size() % 2 == 1)
|
|
{
|
|
int64 nMedian = vTimeOffsets.median();
|
|
std::vector<int64> vSorted = vTimeOffsets.sorted();
|
|
// Only let other nodes change our time by so much
|
|
if (abs64(nMedian) < 70 * 60)
|
|
{
|
|
nTimeOffset = nMedian;
|
|
}
|
|
else
|
|
{
|
|
nTimeOffset = 0;
|
|
|
|
static bool fDone;
|
|
if (!fDone)
|
|
{
|
|
// If nobody has a time different than ours but within 5 minutes of ours, give a warning
|
|
bool fMatch = false;
|
|
BOOST_FOREACH(int64 nOffset, vSorted)
|
|
if (nOffset != 0 && abs64(nOffset) < 5 * 60)
|
|
fMatch = true;
|
|
|
|
if (!fMatch)
|
|
{
|
|
fDone = true;
|
|
string strMessage = _("Warning: Please check that your computer's date and time are correct. If your clock is wrong Bitcoin will not work properly.");
|
|
strMiscWarning = strMessage;
|
|
printf("*** %s\n", strMessage.c_str());
|
|
ThreadSafeMessageBox(strMessage+" ", string("Bitcoin"), wxOK | wxICON_EXCLAMATION);
|
|
}
|
|
}
|
|
}
|
|
if (fDebug) {
|
|
BOOST_FOREACH(int64 n, vSorted)
|
|
printf("%+"PRI64d" ", n);
|
|
printf("| ");
|
|
}
|
|
printf("nTimeOffset = %+"PRI64d" (%+"PRI64d" minutes)\n", nTimeOffset, nTimeOffset/60);
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
string FormatVersion(int nVersion)
|
|
{
|
|
if (nVersion%100 == 0)
|
|
return strprintf("%d.%d.%d", nVersion/1000000, (nVersion/10000)%100, (nVersion/100)%100);
|
|
else
|
|
return strprintf("%d.%d.%d.%d", nVersion/1000000, (nVersion/10000)%100, (nVersion/100)%100, nVersion%100);
|
|
}
|
|
|
|
string FormatFullVersion()
|
|
{
|
|
string s = FormatVersion(CLIENT_VERSION);
|
|
if (VERSION_IS_BETA) {
|
|
s += "-";
|
|
s += _("beta");
|
|
}
|
|
return s;
|
|
}
|
|
|
|
// Format the subversion field according to BIP 14 spec (https://en.bitcoin.it/wiki/BIP_0014)
|
|
std::string FormatSubVersion(const std::string& name, int nClientVersion, const std::vector<std::string>& comments)
|
|
{
|
|
std::ostringstream ss;
|
|
ss << "/";
|
|
ss << name << ":" << FormatVersion(nClientVersion);
|
|
if (!comments.empty())
|
|
ss << "(" << boost::algorithm::join(comments, "; ") << ")";
|
|
ss << "/";
|
|
return ss.str();
|
|
}
|
|
|
|
|
|
|
|
#ifdef DEBUG_LOCKORDER
|
|
//
|
|
// Early deadlock detection.
|
|
// Problem being solved:
|
|
// Thread 1 locks A, then B, then C
|
|
// Thread 2 locks D, then C, then A
|
|
// --> may result in deadlock between the two threads, depending on when they run.
|
|
// Solution implemented here:
|
|
// Keep track of pairs of locks: (A before B), (A before C), etc.
|
|
// Complain if any thread trys to lock in a different order.
|
|
//
|
|
|
|
struct CLockLocation
|
|
{
|
|
CLockLocation(const char* pszName, const char* pszFile, int nLine)
|
|
{
|
|
mutexName = pszName;
|
|
sourceFile = pszFile;
|
|
sourceLine = nLine;
|
|
}
|
|
|
|
std::string ToString() const
|
|
{
|
|
return mutexName+" "+sourceFile+":"+itostr(sourceLine);
|
|
}
|
|
|
|
private:
|
|
std::string mutexName;
|
|
std::string sourceFile;
|
|
int sourceLine;
|
|
};
|
|
|
|
typedef std::vector< std::pair<void*, CLockLocation> > LockStack;
|
|
|
|
static boost::interprocess::interprocess_mutex dd_mutex;
|
|
static std::map<std::pair<void*, void*>, LockStack> lockorders;
|
|
static boost::thread_specific_ptr<LockStack> lockstack;
|
|
|
|
|
|
static void potential_deadlock_detected(const std::pair<void*, void*>& mismatch, const LockStack& s1, const LockStack& s2)
|
|
{
|
|
printf("POTENTIAL DEADLOCK DETECTED\n");
|
|
printf("Previous lock order was:\n");
|
|
BOOST_FOREACH(const PAIRTYPE(void*, CLockLocation)& i, s2)
|
|
{
|
|
if (i.first == mismatch.first) printf(" (1)");
|
|
if (i.first == mismatch.second) printf(" (2)");
|
|
printf(" %s\n", i.second.ToString().c_str());
|
|
}
|
|
printf("Current lock order is:\n");
|
|
BOOST_FOREACH(const PAIRTYPE(void*, CLockLocation)& i, s1)
|
|
{
|
|
if (i.first == mismatch.first) printf(" (1)");
|
|
if (i.first == mismatch.second) printf(" (2)");
|
|
printf(" %s\n", i.second.ToString().c_str());
|
|
}
|
|
}
|
|
|
|
static void push_lock(void* c, const CLockLocation& locklocation, bool fTry)
|
|
{
|
|
bool fOrderOK = true;
|
|
if (lockstack.get() == NULL)
|
|
lockstack.reset(new LockStack);
|
|
|
|
if (fDebug) printf("Locking: %s\n", locklocation.ToString().c_str());
|
|
dd_mutex.lock();
|
|
|
|
(*lockstack).push_back(std::make_pair(c, locklocation));
|
|
|
|
if (!fTry) BOOST_FOREACH(const PAIRTYPE(void*, CLockLocation)& i, (*lockstack))
|
|
{
|
|
if (i.first == c) break;
|
|
|
|
std::pair<void*, void*> p1 = std::make_pair(i.first, c);
|
|
if (lockorders.count(p1))
|
|
continue;
|
|
lockorders[p1] = (*lockstack);
|
|
|
|
std::pair<void*, void*> p2 = std::make_pair(c, i.first);
|
|
if (lockorders.count(p2))
|
|
{
|
|
potential_deadlock_detected(p1, lockorders[p2], lockorders[p1]);
|
|
break;
|
|
}
|
|
}
|
|
dd_mutex.unlock();
|
|
}
|
|
|
|
static void pop_lock()
|
|
{
|
|
if (fDebug)
|
|
{
|
|
const CLockLocation& locklocation = (*lockstack).rbegin()->second;
|
|
printf("Unlocked: %s\n", locklocation.ToString().c_str());
|
|
}
|
|
dd_mutex.lock();
|
|
(*lockstack).pop_back();
|
|
dd_mutex.unlock();
|
|
}
|
|
|
|
void EnterCritical(const char* pszName, const char* pszFile, int nLine, void* cs, bool fTry)
|
|
{
|
|
push_lock(cs, CLockLocation(pszName, pszFile, nLine), fTry);
|
|
}
|
|
|
|
void LeaveCritical()
|
|
{
|
|
pop_lock();
|
|
}
|
|
|
|
#endif /* DEBUG_LOCKORDER */
|