1 // Copyright (c) 2009 Satoshi Nakamoto
\r
2 // Distributed under the MIT/X11 software license, see the accompanying
\r
3 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
\r
6 #if defined(_MSC_VER) || defined(__BORLANDC__)
\r
7 typedef __int64 int64;
\r
8 typedef unsigned __int64 uint64;
\r
10 typedef long long int64;
\r
11 typedef unsigned long long uint64;
\r
13 #if defined(_MSC_VER) && _MSC_VER < 1300
\r
14 #define for if (false) ; else for
\r
17 #define __forceinline inline
\r
20 #define foreach BOOST_FOREACH
\r
21 #define loop for (;;)
\r
22 #define BEGIN(a) ((char*)&(a))
\r
23 #define END(a) ((char*)&((&(a))[1]))
\r
24 #define UBEGIN(a) ((unsigned char*)&(a))
\r
25 #define UEND(a) ((unsigned char*)&((&(a))[1]))
\r
26 #define ARRAYLEN(array) (sizeof(array)/sizeof((array)[0]))
\r
27 #define printf OutputDebugStringF
\r
32 #define snprintf my_snprintf
\r
35 #if defined(_MSC_VER) || defined(__BORLANDC__) || defined(__MSVCRT__)
\r
36 #define PRI64d "I64d"
\r
37 #define PRI64u "I64u"
\r
38 #define PRI64x "I64x"
\r
40 #define PRI64d "lld"
\r
41 #define PRI64u "llu"
\r
42 #define PRI64x "llx"
\r
46 // This is needed because the foreach macro can't get over the comma in pair<t1, t2>
\r
47 #define PAIRTYPE(t1, t2) pair<t1, t2>
\r
49 // Used to bypass the rule against non-const reference to temporary
\r
50 // where it makes sense with wrappers such as CFlatData or CTxDB
\r
51 template<typename T>
\r
52 inline T& REF(const T& val)
\r
64 extern bool fPrintToDebugger;
\r
65 extern bool fPrintToConsole;
\r
66 extern map<string, string> mapArgs;
\r
69 void RandAddSeedPerfmon();
\r
70 int my_snprintf(char* buffer, size_t limit, const char* format, ...);
\r
71 string strprintf(const char* format, ...);
\r
72 bool error(const char* format, ...);
\r
73 void PrintException(std::exception* pex, const char* pszThread);
\r
74 void LogException(std::exception* pex, const char* pszThread);
\r
75 void ParseString(const string& str, char c, vector<string>& v);
\r
76 string FormatMoney(int64 n, bool fPlus=false);
\r
77 bool ParseMoney(const char* pszIn, int64& nRet);
\r
78 vector<unsigned char> ParseHex(const char* psz);
\r
79 vector<unsigned char> ParseHex(const std::string& str);
\r
80 bool FileExists(const char* psz);
\r
81 int GetFilesize(FILE* file);
\r
82 uint64 GetRand(uint64 nMax);
\r
84 int64 GetAdjustedTime();
\r
85 void AddTimeData(unsigned int ip, int64 nTime);
\r
98 // Wrapper to automatically initialize critical sections
\r
99 class CCriticalSection
\r
103 CRITICAL_SECTION cs;
\r
105 explicit CCriticalSection() { InitializeCriticalSection(&cs); }
\r
106 ~CCriticalSection() { DeleteCriticalSection(&cs); }
\r
107 void Enter() { EnterCriticalSection(&cs); }
\r
108 void Leave() { LeaveCriticalSection(&cs); }
\r
109 bool TryEnter() { return TryEnterCriticalSection(&cs); }
\r
114 explicit CCriticalSection() { }
\r
115 ~CCriticalSection() { }
\r
116 void Enter() { mutex.Lock(); }
\r
117 void Leave() { mutex.Unlock(); }
\r
118 bool TryEnter() { return mutex.TryLock() == wxMUTEX_NO_ERROR; }
\r
125 // Automatically leave critical section when leaving block, needed for exception safety
\r
126 class CCriticalBlock
\r
129 CCriticalSection* pcs;
\r
131 CCriticalBlock(CCriticalSection& csIn) { pcs = &csIn; pcs->Enter(); }
\r
132 ~CCriticalBlock() { pcs->Leave(); }
\r
135 // WARNING: This will catch continue and break!
\r
136 // break is caught with an assertion, but there's no way to detect continue.
\r
137 // I'd rather be careful than suffer the other more error prone syntax.
\r
138 // The compiler will optimise away all this loop junk.
\r
139 #define CRITICAL_BLOCK(cs) \
\r
140 for (bool fcriticalblockonce=true; fcriticalblockonce; assert(("break caught by CRITICAL_BLOCK!", !fcriticalblockonce)), fcriticalblockonce=false) \
\r
141 for (CCriticalBlock criticalblock(cs); fcriticalblockonce && (cs.pszFile=__FILE__, cs.nLine=__LINE__, true); fcriticalblockonce=false, cs.pszFile=NULL, cs.nLine=0)
\r
143 class CTryCriticalBlock
\r
146 CCriticalSection* pcs;
\r
148 CTryCriticalBlock(CCriticalSection& csIn) { pcs = (csIn.TryEnter() ? &csIn : NULL); }
\r
149 ~CTryCriticalBlock() { if (pcs) pcs->Leave(); }
\r
150 bool Entered() { return pcs != NULL; }
\r
153 #define TRY_CRITICAL_BLOCK(cs) \
\r
154 for (bool fcriticalblockonce=true; fcriticalblockonce; assert(("break caught by TRY_CRITICAL_BLOCK!", !fcriticalblockonce)), fcriticalblockonce=false) \
\r
155 for (CTryCriticalBlock criticalblock(cs); fcriticalblockonce && (fcriticalblockonce = criticalblock.Entered()) && (cs.pszFile=__FILE__, cs.nLine=__LINE__, true); fcriticalblockonce=false, cs.pszFile=NULL, cs.nLine=0)
\r
168 inline int OutputDebugStringF(const char* pszFormat, ...)
\r
172 if (!fPrintToConsole)
\r
174 // print to debug.log
\r
175 FILE* fileout = fopen("debug.log", "a");
\r
179 va_start(arg_ptr, pszFormat);
\r
180 ret = vfprintf(fileout, pszFormat, arg_ptr);
\r
187 if (fPrintToDebugger)
\r
189 // accumulate a line at a time
\r
190 static CCriticalSection cs_OutputDebugStringF;
\r
191 CRITICAL_BLOCK(cs_OutputDebugStringF)
\r
193 static char pszBuffer[50000];
\r
198 va_start(arg_ptr, pszFormat);
\r
199 int limit = END(pszBuffer) - pend - 2;
\r
200 int ret = _vsnprintf(pend, limit, pszFormat, arg_ptr);
\r
202 if (ret < 0 || ret >= limit)
\r
204 pend = END(pszBuffer) - 2;
\r
210 char* p1 = pszBuffer;
\r
212 while (p2 = strchr(p1, '\n'))
\r
217 OutputDebugString(p1);
\r
221 if (p1 != pszBuffer)
\r
222 memmove(pszBuffer, p1, pend - p1 + 1);
\r
223 pend -= (p1 - pszBuffer);
\r
229 if (fPrintToConsole)
\r
231 // print to console
\r
233 va_start(arg_ptr, pszFormat);
\r
234 ret = vprintf(pszFormat, arg_ptr);
\r
249 inline string i64tostr(int64 n)
\r
251 return strprintf("%"PRI64d, n);
\r
254 inline string itostr(int n)
\r
256 return strprintf("%d", n);
\r
259 inline int64 atoi64(const char* psz)
\r
262 return _atoi64(psz);
\r
264 return strtoll(psz, NULL, 10);
\r
268 inline int64 atoi64(const string& str)
\r
271 return _atoi64(str.c_str());
\r
273 return strtoll(str.c_str(), NULL, 10);
\r
277 inline int atoi(const string& str)
\r
279 return atoi(str.c_str());
\r
282 inline int roundint(double d)
\r
284 return (int)(d > 0 ? d + 0.5 : d - 0.5);
\r
287 template<typename T>
\r
288 string HexStr(const T itbegin, const T itend, bool fSpaces=true)
\r
290 const unsigned char* pbegin = (const unsigned char*)&itbegin[0];
\r
291 const unsigned char* pend = pbegin + (itend - itbegin) * sizeof(itbegin[0]);
\r
293 for (const unsigned char* p = pbegin; p != pend; p++)
\r
294 str += strprintf((fSpaces && p != pend-1 ? "%02x " : "%02x"), *p);
\r
298 inline string HexStr(vector<unsigned char> vch, bool fSpaces=true)
\r
300 return HexStr(vch.begin(), vch.end(), fSpaces);
\r
303 template<typename T>
\r
304 string HexNumStr(const T itbegin, const T itend, bool f0x=true)
\r
306 const unsigned char* pbegin = (const unsigned char*)&itbegin[0];
\r
307 const unsigned char* pend = pbegin + (itend - itbegin) * sizeof(itbegin[0]);
\r
308 string str = (f0x ? "0x" : "");
\r
309 for (const unsigned char* p = pend-1; p >= pbegin; p--)
\r
310 str += strprintf("%02X", *p);
\r
314 template<typename T>
\r
315 void PrintHex(const T pbegin, const T pend, const char* pszFormat="%s", bool fSpaces=true)
\r
317 printf(pszFormat, HexStr(pbegin, pend, fSpaces).c_str());
\r
320 inline void PrintHex(vector<unsigned char> vch, const char* pszFormat="%s", bool fSpaces=true)
\r
322 printf(pszFormat, HexStr(vch, fSpaces).c_str());
\r
326 inline int64 PerformanceCounter()
\r
330 QueryPerformanceCounter((LARGE_INTEGER*)&nCounter);
332 // this could be changed to reading /dev/urandom
334 gettimeofday(&t, NULL);
335 nCounter += t.tv_sec * 1000000 + t.tv_usec;
341 inline void Sleep(unsigned int nMilliseconds)
\r
343 wxMilliSleep(nMilliseconds);
\r
355 inline void heapchk()
\r
357 if (_heapchk() != _HEAPOK)
\r
361 // Randomize the stack to help protect against buffer overrun exploits
\r
362 #define IMPLEMENT_RANDOMIZE_STACK(ThreadFn) \
\r
364 static char nLoops; \
\r
366 nLoops = GetRand(50) + 1; \
\r
367 if (nLoops-- > 1) \
\r
374 #define CATCH_PRINT_EXCEPTION(pszFn) \
\r
375 catch (std::exception& e) { \
\r
376 PrintException(&e, (pszFn)); \
\r
378 PrintException(NULL, (pszFn)); \
\r
390 template<typename T1>
\r
391 inline uint256 Hash(const T1 pbegin, const T1 pend)
\r
394 SHA256((unsigned char*)&pbegin[0], (pend - pbegin) * sizeof(pbegin[0]), (unsigned char*)&hash1);
\r
396 SHA256((unsigned char*)&hash1, sizeof(hash1), (unsigned char*)&hash2);
\r
400 template<typename T1, typename T2>
\r
401 inline uint256 Hash(const T1 p1begin, const T1 p1end,
\r
402 const T2 p2begin, const T2 p2end)
\r
407 SHA256_Update(&ctx, (unsigned char*)&p1begin[0], (p1end - p1begin) * sizeof(p1begin[0]));
\r
408 SHA256_Update(&ctx, (unsigned char*)&p2begin[0], (p2end - p2begin) * sizeof(p2begin[0]));
\r
409 SHA256_Final((unsigned char*)&hash1, &ctx);
\r
411 SHA256((unsigned char*)&hash1, sizeof(hash1), (unsigned char*)&hash2);
\r
415 template<typename T1, typename T2, typename T3>
\r
416 inline uint256 Hash(const T1 p1begin, const T1 p1end,
\r
417 const T2 p2begin, const T2 p2end,
\r
418 const T3 p3begin, const T3 p3end)
\r
423 SHA256_Update(&ctx, (unsigned char*)&p1begin[0], (p1end - p1begin) * sizeof(p1begin[0]));
\r
424 SHA256_Update(&ctx, (unsigned char*)&p2begin[0], (p2end - p2begin) * sizeof(p2begin[0]));
\r
425 SHA256_Update(&ctx, (unsigned char*)&p3begin[0], (p3end - p3begin) * sizeof(p3begin[0]));
\r
426 SHA256_Final((unsigned char*)&hash1, &ctx);
\r
428 SHA256((unsigned char*)&hash1, sizeof(hash1), (unsigned char*)&hash2);
\r
432 template<typename T>
\r
433 uint256 SerializeHash(const T& obj, int nType=SER_GETHASH, int nVersion=VERSION)
\r
435 // Most of the time is spent allocating and deallocating CDataStream's
\r
436 // buffer. If this ever needs to be optimized further, make a CStaticStream
\r
437 // class with its buffer on the stack.
\r
438 CDataStream ss(nType, nVersion);
\r
441 return Hash(ss.begin(), ss.end());
\r
444 inline uint160 Hash160(const vector<unsigned char>& vch)
\r
447 SHA256(&vch[0], vch.size(), (unsigned char*)&hash1);
\r
449 RIPEMD160((unsigned char*)&hash1, sizeof(hash1), (unsigned char*)&hash2);
\r