]>
Commit | Line | Data |
---|---|---|
2097c09a | 1 | // Copyright (c) 2009-2010 Satoshi Nakamoto |
88216419 | 2 | // Copyright (c) 2009-2012 The Bitcoin developers |
2097c09a WL |
3 | // Distributed under the MIT/X11 software license, see the accompanying |
4 | // file license.txt or http://www.opensource.org/licenses/mit-license.php. | |
69d605f4 | 5 | #include "headers.h" |
0eeb4f5d | 6 | #include "strlcpy.h" |
f8ded588 | 7 | #include <boost/algorithm/string/join.hpp> |
0eeb4f5d WL |
8 | #include <boost/program_options/detail/config_file.hpp> |
9 | #include <boost/program_options/parsers.hpp> | |
e8ef3da7 | 10 | #include <boost/filesystem.hpp> |
0eeb4f5d WL |
11 | #include <boost/filesystem/fstream.hpp> |
12 | #include <boost/interprocess/sync/interprocess_mutex.hpp> | |
13 | #include <boost/interprocess/sync/interprocess_recursive_mutex.hpp> | |
14 | #include <boost/foreach.hpp> | |
2097c09a WL |
15 | |
16 | using namespace std; | |
69d605f4 | 17 | using namespace boost; |
2097c09a WL |
18 | |
19 | map<string, string> mapArgs; | |
20 | map<string, vector<string> > mapMultiArgs; | |
21 | bool fDebug = false; | |
22 | bool fPrintToConsole = false; | |
23 | bool fPrintToDebugger = false; | |
24 | char pszSetDataDir[MAX_PATH] = ""; | |
25 | bool fRequestShutdown = false; | |
26 | bool fShutdown = false; | |
27 | bool fDaemon = false; | |
28 | bool fServer = false; | |
29 | bool fCommandLine = false; | |
30 | string strMiscWarning; | |
31 | bool fTestNet = false; | |
32 | bool fNoListen = false; | |
33 | bool fLogTimestamps = false; | |
bde280b9 | 34 | CMedianFilter<int64> vTimeOffsets(200,0); |
2097c09a WL |
35 | |
36 | ||
37 | ||
38 | // Workaround for "multiple definition of `_tls_used'" | |
39 | // http://svn.boost.org/trac/boost/ticket/4258 | |
40 | extern "C" void tss_cleanup_implemented() { } | |
41 | ||
42 | ||
43 | ||
44 | ||
45 | ||
46 | // Init openssl library multithreading support | |
47 | static boost::interprocess::interprocess_mutex** ppmutexOpenSSL; | |
48 | void locking_callback(int mode, int i, const char* file, int line) | |
49 | { | |
50 | if (mode & CRYPTO_LOCK) | |
51 | ppmutexOpenSSL[i]->lock(); | |
52 | else | |
53 | ppmutexOpenSSL[i]->unlock(); | |
54 | } | |
55 | ||
56 | // Init | |
57 | class CInit | |
58 | { | |
59 | public: | |
60 | CInit() | |
61 | { | |
62 | // Init openssl library multithreading support | |
63 | ppmutexOpenSSL = (boost::interprocess::interprocess_mutex**)OPENSSL_malloc(CRYPTO_num_locks() * sizeof(boost::interprocess::interprocess_mutex*)); | |
64 | for (int i = 0; i < CRYPTO_num_locks(); i++) | |
65 | ppmutexOpenSSL[i] = new boost::interprocess::interprocess_mutex(); | |
66 | CRYPTO_set_locking_callback(locking_callback); | |
67 | ||
6853e627 | 68 | #ifdef WIN32 |
2097c09a WL |
69 | // Seed random number generator with screen scrape and other hardware sources |
70 | RAND_screen(); | |
71 | #endif | |
72 | ||
73 | // Seed random number generator with performance counter | |
74 | RandAddSeed(); | |
75 | } | |
76 | ~CInit() | |
77 | { | |
78 | // Shutdown openssl library multithreading support | |
79 | CRYPTO_set_locking_callback(NULL); | |
80 | for (int i = 0; i < CRYPTO_num_locks(); i++) | |
81 | delete ppmutexOpenSSL[i]; | |
82 | OPENSSL_free(ppmutexOpenSSL); | |
83 | } | |
84 | } | |
85 | instance_of_cinit; | |
86 | ||
87 | ||
88 | ||
89 | ||
90 | ||
91 | ||
92 | ||
93 | ||
94 | void RandAddSeed() | |
95 | { | |
96 | // Seed with CPU performance counter | |
bde280b9 | 97 | int64 nCounter = GetPerformanceCounter(); |
2097c09a WL |
98 | RAND_add(&nCounter, sizeof(nCounter), 1.5); |
99 | memset(&nCounter, 0, sizeof(nCounter)); | |
100 | } | |
101 | ||
102 | void RandAddSeedPerfmon() | |
103 | { | |
104 | RandAddSeed(); | |
105 | ||
106 | // This can take up to 2 seconds, so only do it every 10 minutes | |
bde280b9 | 107 | static int64 nLastPerfmon; |
2097c09a WL |
108 | if (GetTime() < nLastPerfmon + 10 * 60) |
109 | return; | |
110 | nLastPerfmon = GetTime(); | |
111 | ||
6853e627 | 112 | #ifdef WIN32 |
2097c09a WL |
113 | // Don't need this on Linux, OpenSSL automatically uses /dev/urandom |
114 | // Seed with the entire set of perfmon data | |
115 | unsigned char pdata[250000]; | |
116 | memset(pdata, 0, sizeof(pdata)); | |
117 | unsigned long nSize = sizeof(pdata); | |
118 | long ret = RegQueryValueExA(HKEY_PERFORMANCE_DATA, "Global", NULL, NULL, pdata, &nSize); | |
119 | RegCloseKey(HKEY_PERFORMANCE_DATA); | |
120 | if (ret == ERROR_SUCCESS) | |
121 | { | |
122 | RAND_add(pdata, nSize, nSize/100.0); | |
123 | memset(pdata, 0, nSize); | |
124 | printf("%s RandAddSeed() %d bytes\n", DateTimeStrFormat("%x %H:%M", GetTime()).c_str(), nSize); | |
125 | } | |
126 | #endif | |
127 | } | |
128 | ||
bde280b9 | 129 | uint64 GetRand(uint64 nMax) |
2097c09a WL |
130 | { |
131 | if (nMax == 0) | |
132 | return 0; | |
133 | ||
134 | // The range of the random source must be a multiple of the modulus | |
135 | // to give every possible output value an equal possibility | |
bde280b9 WL |
136 | uint64 nRange = (std::numeric_limits<uint64>::max() / nMax) * nMax; |
137 | uint64 nRand = 0; | |
2097c09a WL |
138 | do |
139 | RAND_bytes((unsigned char*)&nRand, sizeof(nRand)); | |
140 | while (nRand >= nRange); | |
141 | return (nRand % nMax); | |
142 | } | |
143 | ||
144 | int GetRandInt(int nMax) | |
145 | { | |
146 | return GetRand(nMax); | |
147 | } | |
148 | ||
149 | ||
150 | ||
151 | ||
152 | ||
153 | ||
154 | ||
155 | ||
156 | ||
157 | ||
158 | ||
159 | inline int OutputDebugStringF(const char* pszFormat, ...) | |
160 | { | |
161 | int ret = 0; | |
162 | if (fPrintToConsole) | |
163 | { | |
164 | // print to console | |
165 | va_list arg_ptr; | |
166 | va_start(arg_ptr, pszFormat); | |
167 | ret = vprintf(pszFormat, arg_ptr); | |
168 | va_end(arg_ptr); | |
169 | } | |
170 | else | |
171 | { | |
172 | // print to debug.log | |
173 | static FILE* fileout = NULL; | |
174 | ||
175 | if (!fileout) | |
176 | { | |
177 | char pszFile[MAX_PATH+100]; | |
178 | GetDataDir(pszFile); | |
179 | strlcat(pszFile, "/debug.log", sizeof(pszFile)); | |
180 | fileout = fopen(pszFile, "a"); | |
181 | if (fileout) setbuf(fileout, NULL); // unbuffered | |
182 | } | |
183 | if (fileout) | |
184 | { | |
185 | static bool fStartedNewLine = true; | |
186 | ||
187 | // Debug print useful for profiling | |
188 | if (fLogTimestamps && fStartedNewLine) | |
189 | fprintf(fileout, "%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str()); | |
190 | if (pszFormat[strlen(pszFormat) - 1] == '\n') | |
191 | fStartedNewLine = true; | |
192 | else | |
193 | fStartedNewLine = false; | |
194 | ||
195 | va_list arg_ptr; | |
196 | va_start(arg_ptr, pszFormat); | |
197 | ret = vfprintf(fileout, pszFormat, arg_ptr); | |
198 | va_end(arg_ptr); | |
199 | } | |
200 | } | |
201 | ||
6853e627 | 202 | #ifdef WIN32 |
2097c09a WL |
203 | if (fPrintToDebugger) |
204 | { | |
205 | static CCriticalSection cs_OutputDebugStringF; | |
206 | ||
207 | // accumulate a line at a time | |
208 | CRITICAL_BLOCK(cs_OutputDebugStringF) | |
209 | { | |
210 | static char pszBuffer[50000]; | |
211 | static char* pend; | |
212 | if (pend == NULL) | |
213 | pend = pszBuffer; | |
214 | va_list arg_ptr; | |
215 | va_start(arg_ptr, pszFormat); | |
216 | int limit = END(pszBuffer) - pend - 2; | |
217 | int ret = _vsnprintf(pend, limit, pszFormat, arg_ptr); | |
218 | va_end(arg_ptr); | |
219 | if (ret < 0 || ret >= limit) | |
220 | { | |
221 | pend = END(pszBuffer) - 2; | |
222 | *pend++ = '\n'; | |
223 | } | |
224 | else | |
225 | pend += ret; | |
226 | *pend = '\0'; | |
227 | char* p1 = pszBuffer; | |
228 | char* p2; | |
229 | while (p2 = strchr(p1, '\n')) | |
230 | { | |
231 | p2++; | |
232 | char c = *p2; | |
233 | *p2 = '\0'; | |
234 | OutputDebugStringA(p1); | |
235 | *p2 = c; | |
236 | p1 = p2; | |
237 | } | |
238 | if (p1 != pszBuffer) | |
239 | memmove(pszBuffer, p1, pend - p1 + 1); | |
240 | pend -= (p1 - pszBuffer); | |
241 | } | |
242 | } | |
243 | #endif | |
244 | return ret; | |
245 | } | |
246 | ||
247 | ||
248 | // Safer snprintf | |
249 | // - prints up to limit-1 characters | |
250 | // - output string is always null terminated even if limit reached | |
251 | // - return value is the number of characters actually printed | |
252 | int my_snprintf(char* buffer, size_t limit, const char* format, ...) | |
253 | { | |
254 | if (limit == 0) | |
255 | return 0; | |
256 | va_list arg_ptr; | |
257 | va_start(arg_ptr, format); | |
258 | int ret = _vsnprintf(buffer, limit, format, arg_ptr); | |
259 | va_end(arg_ptr); | |
260 | if (ret < 0 || ret >= limit) | |
261 | { | |
262 | ret = limit - 1; | |
263 | buffer[limit-1] = 0; | |
264 | } | |
265 | return ret; | |
266 | } | |
267 | ||
39cf857d | 268 | string strprintf(const std::string &format, ...) |
2097c09a WL |
269 | { |
270 | char buffer[50000]; | |
271 | char* p = buffer; | |
272 | int limit = sizeof(buffer); | |
273 | int ret; | |
274 | loop | |
275 | { | |
276 | va_list arg_ptr; | |
277 | va_start(arg_ptr, format); | |
39cf857d | 278 | ret = _vsnprintf(p, limit, format.c_str(), arg_ptr); |
2097c09a WL |
279 | va_end(arg_ptr); |
280 | if (ret >= 0 && ret < limit) | |
281 | break; | |
282 | if (p != buffer) | |
822f2e3d | 283 | delete[] p; |
2097c09a WL |
284 | limit *= 2; |
285 | p = new char[limit]; | |
286 | if (p == NULL) | |
287 | throw std::bad_alloc(); | |
288 | } | |
289 | string str(p, p+ret); | |
290 | if (p != buffer) | |
822f2e3d | 291 | delete[] p; |
2097c09a WL |
292 | return str; |
293 | } | |
294 | ||
39cf857d | 295 | bool error(const std::string &format, ...) |
2097c09a WL |
296 | { |
297 | char buffer[50000]; | |
298 | int limit = sizeof(buffer); | |
299 | va_list arg_ptr; | |
300 | va_start(arg_ptr, format); | |
39cf857d | 301 | int ret = _vsnprintf(buffer, limit, format.c_str(), arg_ptr); |
2097c09a WL |
302 | va_end(arg_ptr); |
303 | if (ret < 0 || ret >= limit) | |
304 | { | |
305 | ret = limit - 1; | |
306 | buffer[limit-1] = 0; | |
307 | } | |
308 | printf("ERROR: %s\n", buffer); | |
309 | return false; | |
310 | } | |
311 | ||
312 | ||
313 | void ParseString(const string& str, char c, vector<string>& v) | |
314 | { | |
315 | if (str.empty()) | |
316 | return; | |
317 | string::size_type i1 = 0; | |
318 | string::size_type i2; | |
319 | loop | |
320 | { | |
321 | i2 = str.find(c, i1); | |
322 | if (i2 == str.npos) | |
323 | { | |
324 | v.push_back(str.substr(i1)); | |
325 | return; | |
326 | } | |
327 | v.push_back(str.substr(i1, i2-i1)); | |
328 | i1 = i2+1; | |
329 | } | |
330 | } | |
331 | ||
332 | ||
bde280b9 | 333 | string FormatMoney(int64 n, bool fPlus) |
2097c09a WL |
334 | { |
335 | // Note: not using straight sprintf here because we do NOT want | |
336 | // localized number formatting. | |
bde280b9 WL |
337 | int64 n_abs = (n > 0 ? n : -n); |
338 | int64 quotient = n_abs/COIN; | |
339 | int64 remainder = n_abs%COIN; | |
2097c09a WL |
340 | string str = strprintf("%"PRI64d".%08"PRI64d, quotient, remainder); |
341 | ||
342 | // Right-trim excess 0's before the decimal point: | |
343 | int nTrim = 0; | |
344 | for (int i = str.size()-1; (str[i] == '0' && isdigit(str[i-2])); --i) | |
345 | ++nTrim; | |
346 | if (nTrim) | |
347 | str.erase(str.size()-nTrim, nTrim); | |
348 | ||
2097c09a WL |
349 | if (n < 0) |
350 | str.insert((unsigned int)0, 1, '-'); | |
351 | else if (fPlus && n > 0) | |
352 | str.insert((unsigned int)0, 1, '+'); | |
353 | return str; | |
354 | } | |
355 | ||
356 | ||
bde280b9 | 357 | bool ParseMoney(const string& str, int64& nRet) |
2097c09a WL |
358 | { |
359 | return ParseMoney(str.c_str(), nRet); | |
360 | } | |
361 | ||
bde280b9 | 362 | bool ParseMoney(const char* pszIn, int64& nRet) |
2097c09a WL |
363 | { |
364 | string strWhole; | |
bde280b9 | 365 | int64 nUnits = 0; |
2097c09a WL |
366 | const char* p = pszIn; |
367 | while (isspace(*p)) | |
368 | p++; | |
369 | for (; *p; p++) | |
370 | { | |
2097c09a WL |
371 | if (*p == '.') |
372 | { | |
373 | p++; | |
bde280b9 | 374 | int64 nMult = CENT*10; |
2097c09a WL |
375 | while (isdigit(*p) && (nMult > 0)) |
376 | { | |
377 | nUnits += nMult * (*p++ - '0'); | |
378 | nMult /= 10; | |
379 | } | |
380 | break; | |
381 | } | |
382 | if (isspace(*p)) | |
383 | break; | |
384 | if (!isdigit(*p)) | |
385 | return false; | |
386 | strWhole.insert(strWhole.end(), *p); | |
387 | } | |
388 | for (; *p; p++) | |
389 | if (!isspace(*p)) | |
390 | return false; | |
2f7f2a5f | 391 | if (strWhole.size() > 10) // guard against 63 bit overflow |
2097c09a WL |
392 | return false; |
393 | if (nUnits < 0 || nUnits > COIN) | |
394 | return false; | |
bde280b9 WL |
395 | int64 nWhole = atoi64(strWhole); |
396 | int64 nValue = nWhole*COIN + nUnits; | |
2097c09a WL |
397 | |
398 | nRet = nValue; | |
399 | return true; | |
400 | } | |
401 | ||
402 | ||
922e8e29 GA |
403 | static char phexdigit[256] = |
404 | { -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, | |
405 | -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, | |
406 | -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, | |
407 | 0,1,2,3,4,5,6,7,8,9,-1,-1,-1,-1,-1,-1, | |
408 | -1,0xa,0xb,0xc,0xd,0xe,0xf,-1,-1,-1,-1,-1,-1,-1,-1,-1, | |
409 | -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, | |
410 | -1,0xa,0xb,0xc,0xd,0xe,0xf,-1,-1,-1,-1,-1,-1,-1,-1,-1 | |
411 | -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, | |
412 | -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, | |
413 | -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, | |
414 | -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, | |
415 | -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, | |
416 | -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, | |
417 | -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, | |
418 | -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, | |
419 | -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, }; | |
420 | ||
421 | bool IsHex(const string& str) | |
2097c09a | 422 | { |
922e8e29 GA |
423 | BOOST_FOREACH(unsigned char c, str) |
424 | { | |
425 | if (phexdigit[c] < 0) | |
426 | return false; | |
427 | } | |
428 | return (str.size() > 0) && (str.size()%2 == 0); | |
429 | } | |
2097c09a | 430 | |
922e8e29 GA |
431 | vector<unsigned char> ParseHex(const char* psz) |
432 | { | |
2097c09a WL |
433 | // convert hex dump to vector |
434 | vector<unsigned char> vch; | |
435 | loop | |
436 | { | |
437 | while (isspace(*psz)) | |
438 | psz++; | |
439 | char c = phexdigit[(unsigned char)*psz++]; | |
440 | if (c == (char)-1) | |
441 | break; | |
442 | unsigned char n = (c << 4); | |
443 | c = phexdigit[(unsigned char)*psz++]; | |
444 | if (c == (char)-1) | |
445 | break; | |
446 | n |= c; | |
447 | vch.push_back(n); | |
448 | } | |
449 | return vch; | |
450 | } | |
451 | ||
452 | vector<unsigned char> ParseHex(const string& str) | |
453 | { | |
454 | return ParseHex(str.c_str()); | |
455 | } | |
456 | ||
3ae07355 | 457 | void ParseParameters(int argc, const char*const argv[]) |
2097c09a WL |
458 | { |
459 | mapArgs.clear(); | |
460 | mapMultiArgs.clear(); | |
461 | for (int i = 1; i < argc; i++) | |
462 | { | |
463 | char psz[10000]; | |
464 | strlcpy(psz, argv[i], sizeof(psz)); | |
465 | char* pszValue = (char*)""; | |
466 | if (strchr(psz, '=')) | |
467 | { | |
468 | pszValue = strchr(psz, '='); | |
469 | *pszValue++ = '\0'; | |
470 | } | |
6853e627 | 471 | #ifdef WIN32 |
2097c09a WL |
472 | _strlwr(psz); |
473 | if (psz[0] == '/') | |
474 | psz[0] = '-'; | |
475 | #endif | |
476 | if (psz[0] != '-') | |
477 | break; | |
3ad9f8a7 | 478 | |
2097c09a WL |
479 | mapArgs[psz] = pszValue; |
480 | mapMultiArgs[psz].push_back(pszValue); | |
481 | } | |
3ad9f8a7 GA |
482 | |
483 | // New 0.6 features: | |
484 | BOOST_FOREACH(const PAIRTYPE(string,string)& entry, mapArgs) | |
485 | { | |
486 | string name = entry.first; | |
487 | ||
488 | // interpret --foo as -foo (as long as both are not set) | |
489 | if (name.find("--") == 0) | |
490 | { | |
491 | std::string singleDash(name.begin()+1, name.end()); | |
492 | if (mapArgs.count(singleDash) == 0) | |
493 | mapArgs[singleDash] = entry.second; | |
494 | name = singleDash; | |
495 | } | |
496 | ||
497 | // interpret -nofoo as -foo=0 (and -nofoo=0 as -foo=1, as long as -foo not set) | |
498 | if (name.find("-no") == 0) | |
499 | { | |
500 | std::string positive("-"); | |
501 | positive.append(name.begin()+3, name.end()); | |
502 | if (mapArgs.count(positive) == 0) | |
503 | { | |
504 | bool value = !GetBoolArg(name); | |
505 | mapArgs[positive] = (value ? "1" : "0"); | |
506 | } | |
507 | } | |
508 | } | |
2097c09a WL |
509 | } |
510 | ||
3ae07355 GA |
511 | std::string GetArg(const std::string& strArg, const std::string& strDefault) |
512 | { | |
513 | if (mapArgs.count(strArg)) | |
514 | return mapArgs[strArg]; | |
515 | return strDefault; | |
516 | } | |
517 | ||
518 | int64 GetArg(const std::string& strArg, int64 nDefault) | |
519 | { | |
520 | if (mapArgs.count(strArg)) | |
521 | return atoi64(mapArgs[strArg]); | |
522 | return nDefault; | |
523 | } | |
524 | ||
525 | bool GetBoolArg(const std::string& strArg, bool fDefault) | |
526 | { | |
527 | if (mapArgs.count(strArg)) | |
528 | { | |
529 | if (mapArgs[strArg].empty()) | |
530 | return true; | |
531 | return (atoi(mapArgs[strArg]) != 0); | |
532 | } | |
533 | return fDefault; | |
534 | } | |
535 | ||
0fcf91ea GA |
536 | bool SoftSetArg(const std::string& strArg, const std::string& strValue) |
537 | { | |
538 | if (mapArgs.count(strArg)) | |
539 | return false; | |
540 | mapArgs[strArg] = strValue; | |
541 | return true; | |
542 | } | |
543 | ||
7bf8b7c2 | 544 | bool SoftSetBoolArg(const std::string& strArg, bool fValue) |
0fcf91ea GA |
545 | { |
546 | if (fValue) | |
547 | return SoftSetArg(strArg, std::string("1")); | |
548 | else | |
549 | return SoftSetArg(strArg, std::string("0")); | |
550 | } | |
551 | ||
552 | ||
4b603f1c | 553 | string EncodeBase64(const unsigned char* pch, size_t len) |
4e67a621 | 554 | { |
4b603f1c PW |
555 | static const char *pbase64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; |
556 | ||
557 | string strRet=""; | |
558 | strRet.reserve((len+2)/3*4); | |
559 | ||
560 | int mode=0, left=0; | |
561 | const unsigned char *pchEnd = pch+len; | |
562 | ||
563 | while (pch<pchEnd) | |
564 | { | |
565 | int enc = *(pch++); | |
566 | switch (mode) | |
567 | { | |
568 | case 0: // we have no bits | |
569 | strRet += pbase64[enc >> 2]; | |
570 | left = (enc & 3) << 4; | |
571 | mode = 1; | |
572 | break; | |
573 | ||
574 | case 1: // we have two bits | |
575 | strRet += pbase64[left | (enc >> 4)]; | |
576 | left = (enc & 15) << 2; | |
577 | mode = 2; | |
578 | break; | |
579 | ||
580 | case 2: // we have four bits | |
581 | strRet += pbase64[left | (enc >> 6)]; | |
582 | strRet += pbase64[enc & 63]; | |
583 | mode = 0; | |
584 | break; | |
585 | } | |
586 | } | |
587 | ||
588 | if (mode) | |
589 | { | |
590 | strRet += pbase64[left]; | |
591 | strRet += '='; | |
592 | if (mode == 1) | |
593 | strRet += '='; | |
594 | } | |
595 | ||
596 | return strRet; | |
597 | } | |
598 | ||
599 | string EncodeBase64(const string& str) | |
4e67a621 | 600 | { |
4b603f1c PW |
601 | return EncodeBase64((const unsigned char*)str.c_str(), str.size()); |
602 | } | |
4e67a621 | 603 | |
4b603f1c PW |
604 | vector<unsigned char> DecodeBase64(const char* p, bool* pfInvalid) |
605 | { | |
606 | static const int decode64_table[256] = | |
607 | { | |
608 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
609 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
610 | -1, -1, -1, 62, -1, -1, -1, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, | |
611 | -1, -1, -1, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, | |
612 | 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1, -1, 26, 27, 28, | |
613 | 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, | |
614 | 49, 50, 51, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
615 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
616 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
617 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
618 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
619 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
620 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1 | |
621 | }; | |
622 | ||
623 | if (pfInvalid) | |
624 | *pfInvalid = false; | |
625 | ||
626 | vector<unsigned char> vchRet; | |
627 | vchRet.reserve(strlen(p)*3/4); | |
628 | ||
629 | int mode = 0; | |
630 | int left = 0; | |
631 | ||
632 | while (1) | |
4e67a621 | 633 | { |
4b603f1c PW |
634 | int dec = decode64_table[*p]; |
635 | if (dec == -1) break; | |
636 | p++; | |
637 | switch (mode) | |
4e67a621 J |
638 | { |
639 | case 0: // we have no bits and get 6 | |
640 | left = dec; | |
641 | mode = 1; | |
642 | break; | |
643 | ||
644 | case 1: // we have 6 bits and keep 4 | |
4b603f1c | 645 | vchRet.push_back((left<<2) | (dec>>4)); |
4e67a621 J |
646 | left = dec & 15; |
647 | mode = 2; | |
648 | break; | |
4b603f1c PW |
649 | |
650 | case 2: // we have 4 bits and get 6, we keep 2 | |
651 | vchRet.push_back((left<<4) | (dec>>2)); | |
4e67a621 J |
652 | left = dec & 3; |
653 | mode = 3; | |
654 | break; | |
4b603f1c | 655 | |
4e67a621 | 656 | case 3: // we have 2 bits and get 6 |
4b603f1c PW |
657 | vchRet.push_back((left<<6) | dec); |
658 | mode = 0; | |
4e67a621 J |
659 | break; |
660 | } | |
661 | } | |
662 | ||
4b603f1c PW |
663 | if (pfInvalid) |
664 | switch (mode) | |
665 | { | |
666 | case 0: // 4n base64 characters processed: ok | |
667 | break; | |
668 | ||
669 | case 1: // 4n+1 base64 character processed: impossible | |
670 | *pfInvalid = true; | |
671 | break; | |
672 | ||
673 | case 2: // 4n+2 base64 characters processed: require '==' | |
674 | if (left || p[0] != '=' || p[1] != '=' || decode64_table[p[2]] != -1) | |
675 | *pfInvalid = true; | |
676 | break; | |
677 | ||
678 | case 3: // 4n+3 base64 characters processed: require '=' | |
679 | if (left || p[0] != '=' || decode64_table[p[1]] != -1) | |
680 | *pfInvalid = true; | |
681 | break; | |
682 | } | |
683 | ||
684 | return vchRet; | |
4e67a621 J |
685 | } |
686 | ||
4b603f1c PW |
687 | string DecodeBase64(const string& str) |
688 | { | |
689 | vector<unsigned char> vchRet = DecodeBase64(str.c_str()); | |
690 | return string((const char*)&vchRet[0], vchRet.size()); | |
691 | } | |
2097c09a | 692 | |
2097c09a WL |
693 | |
694 | bool WildcardMatch(const char* psz, const char* mask) | |
695 | { | |
696 | loop | |
697 | { | |
698 | switch (*mask) | |
699 | { | |
700 | case '\0': | |
701 | return (*psz == '\0'); | |
702 | case '*': | |
703 | return WildcardMatch(psz, mask+1) || (*psz && WildcardMatch(psz+1, mask)); | |
704 | case '?': | |
705 | if (*psz == '\0') | |
706 | return false; | |
707 | break; | |
708 | default: | |
709 | if (*psz != *mask) | |
710 | return false; | |
711 | break; | |
712 | } | |
713 | psz++; | |
714 | mask++; | |
715 | } | |
716 | } | |
717 | ||
718 | bool WildcardMatch(const string& str, const string& mask) | |
719 | { | |
720 | return WildcardMatch(str.c_str(), mask.c_str()); | |
721 | } | |
722 | ||
723 | ||
724 | ||
725 | ||
726 | ||
727 | ||
728 | ||
729 | ||
730 | void FormatException(char* pszMessage, std::exception* pex, const char* pszThread) | |
731 | { | |
6853e627 | 732 | #ifdef WIN32 |
2097c09a WL |
733 | char pszModule[MAX_PATH]; |
734 | pszModule[0] = '\0'; | |
735 | GetModuleFileNameA(NULL, pszModule, sizeof(pszModule)); | |
736 | #else | |
737 | const char* pszModule = "bitcoin"; | |
738 | #endif | |
739 | if (pex) | |
740 | snprintf(pszMessage, 1000, | |
741 | "EXCEPTION: %s \n%s \n%s in %s \n", typeid(*pex).name(), pex->what(), pszModule, pszThread); | |
742 | else | |
743 | snprintf(pszMessage, 1000, | |
744 | "UNKNOWN EXCEPTION \n%s in %s \n", pszModule, pszThread); | |
745 | } | |
746 | ||
747 | void LogException(std::exception* pex, const char* pszThread) | |
748 | { | |
749 | char pszMessage[10000]; | |
750 | FormatException(pszMessage, pex, pszThread); | |
751 | printf("\n%s", pszMessage); | |
752 | } | |
753 | ||
754 | void PrintException(std::exception* pex, const char* pszThread) | |
755 | { | |
756 | char pszMessage[10000]; | |
757 | FormatException(pszMessage, pex, pszThread); | |
758 | printf("\n\n************************\n%s\n", pszMessage); | |
759 | fprintf(stderr, "\n\n************************\n%s\n", pszMessage); | |
760 | strMiscWarning = pszMessage; | |
2097c09a WL |
761 | throw; |
762 | } | |
763 | ||
764 | void ThreadOneMessageBox(string strMessage) | |
765 | { | |
766 | // Skip message boxes if one is already open | |
767 | static bool fMessageBoxOpen; | |
768 | if (fMessageBoxOpen) | |
769 | return; | |
770 | fMessageBoxOpen = true; | |
771 | ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION); | |
772 | fMessageBoxOpen = false; | |
773 | } | |
774 | ||
775 | void PrintExceptionContinue(std::exception* pex, const char* pszThread) | |
776 | { | |
777 | char pszMessage[10000]; | |
778 | FormatException(pszMessage, pex, pszThread); | |
779 | printf("\n\n************************\n%s\n", pszMessage); | |
780 | fprintf(stderr, "\n\n************************\n%s\n", pszMessage); | |
781 | strMiscWarning = pszMessage; | |
2097c09a WL |
782 | } |
783 | ||
784 | ||
785 | ||
786 | ||
787 | ||
788 | ||
789 | ||
790 | ||
6853e627 | 791 | #ifdef WIN32 |
2097c09a WL |
792 | typedef WINSHELLAPI BOOL (WINAPI *PSHGETSPECIALFOLDERPATHA)(HWND hwndOwner, LPSTR lpszPath, int nFolder, BOOL fCreate); |
793 | ||
794 | string MyGetSpecialFolderPath(int nFolder, bool fCreate) | |
795 | { | |
796 | char pszPath[MAX_PATH+100] = ""; | |
797 | ||
798 | // SHGetSpecialFolderPath isn't always available on old Windows versions | |
799 | HMODULE hShell32 = LoadLibraryA("shell32.dll"); | |
800 | if (hShell32) | |
801 | { | |
802 | PSHGETSPECIALFOLDERPATHA pSHGetSpecialFolderPath = | |
803 | (PSHGETSPECIALFOLDERPATHA)GetProcAddress(hShell32, "SHGetSpecialFolderPathA"); | |
804 | if (pSHGetSpecialFolderPath) | |
805 | (*pSHGetSpecialFolderPath)(NULL, pszPath, nFolder, fCreate); | |
806 | FreeModule(hShell32); | |
807 | } | |
808 | ||
809 | // Backup option | |
810 | if (pszPath[0] == '\0') | |
811 | { | |
812 | if (nFolder == CSIDL_STARTUP) | |
813 | { | |
814 | strcpy(pszPath, getenv("USERPROFILE")); | |
815 | strcat(pszPath, "\\Start Menu\\Programs\\Startup"); | |
816 | } | |
817 | else if (nFolder == CSIDL_APPDATA) | |
818 | { | |
819 | strcpy(pszPath, getenv("APPDATA")); | |
820 | } | |
821 | } | |
822 | ||
823 | return pszPath; | |
824 | } | |
825 | #endif | |
826 | ||
827 | string GetDefaultDataDir() | |
828 | { | |
829 | // Windows: C:\Documents and Settings\username\Application Data\Bitcoin | |
830 | // Mac: ~/Library/Application Support/Bitcoin | |
831 | // Unix: ~/.bitcoin | |
6853e627 | 832 | #ifdef WIN32 |
2097c09a WL |
833 | // Windows |
834 | return MyGetSpecialFolderPath(CSIDL_APPDATA, true) + "\\Bitcoin"; | |
835 | #else | |
836 | char* pszHome = getenv("HOME"); | |
837 | if (pszHome == NULL || strlen(pszHome) == 0) | |
838 | pszHome = (char*)"/"; | |
839 | string strHome = pszHome; | |
840 | if (strHome[strHome.size()-1] != '/') | |
841 | strHome += '/'; | |
6853e627 | 842 | #ifdef MAC_OSX |
2097c09a WL |
843 | // Mac |
844 | strHome += "Library/Application Support/"; | |
845 | filesystem::create_directory(strHome.c_str()); | |
846 | return strHome + "Bitcoin"; | |
847 | #else | |
848 | // Unix | |
849 | return strHome + ".bitcoin"; | |
850 | #endif | |
851 | #endif | |
852 | } | |
853 | ||
854 | void GetDataDir(char* pszDir) | |
855 | { | |
856 | // pszDir must be at least MAX_PATH length. | |
857 | int nVariation; | |
858 | if (pszSetDataDir[0] != 0) | |
859 | { | |
860 | strlcpy(pszDir, pszSetDataDir, MAX_PATH); | |
861 | nVariation = 0; | |
862 | } | |
863 | else | |
864 | { | |
865 | // This can be called during exceptions by printf, so we cache the | |
866 | // value so we don't have to do memory allocations after that. | |
867 | static char pszCachedDir[MAX_PATH]; | |
868 | if (pszCachedDir[0] == 0) | |
869 | strlcpy(pszCachedDir, GetDefaultDataDir().c_str(), sizeof(pszCachedDir)); | |
870 | strlcpy(pszDir, pszCachedDir, MAX_PATH); | |
871 | nVariation = 1; | |
872 | } | |
873 | if (fTestNet) | |
874 | { | |
875 | char* p = pszDir + strlen(pszDir); | |
876 | if (p > pszDir && p[-1] != '/' && p[-1] != '\\') | |
877 | *p++ = '/'; | |
878 | strcpy(p, "testnet"); | |
879 | nVariation += 2; | |
880 | } | |
881 | static bool pfMkdir[4]; | |
882 | if (!pfMkdir[nVariation]) | |
883 | { | |
884 | pfMkdir[nVariation] = true; | |
69d605f4 | 885 | boost::filesystem::create_directory(pszDir); |
2097c09a WL |
886 | } |
887 | } | |
888 | ||
889 | string GetDataDir() | |
890 | { | |
891 | char pszDir[MAX_PATH]; | |
892 | GetDataDir(pszDir); | |
893 | return pszDir; | |
894 | } | |
895 | ||
896 | string GetConfigFile() | |
897 | { | |
898 | namespace fs = boost::filesystem; | |
899 | fs::path pathConfig(GetArg("-conf", "bitcoin.conf")); | |
900 | if (!pathConfig.is_complete()) | |
901 | pathConfig = fs::path(GetDataDir()) / pathConfig; | |
902 | return pathConfig.string(); | |
903 | } | |
904 | ||
905 | void ReadConfigFile(map<string, string>& mapSettingsRet, | |
906 | map<string, vector<string> >& mapMultiSettingsRet) | |
907 | { | |
908 | namespace fs = boost::filesystem; | |
909 | namespace pod = boost::program_options::detail; | |
910 | ||
911 | fs::ifstream streamConfig(GetConfigFile()); | |
912 | if (!streamConfig.good()) | |
913 | return; | |
914 | ||
915 | set<string> setOptions; | |
916 | setOptions.insert("*"); | |
917 | ||
918 | for (pod::config_file_iterator it(streamConfig, setOptions), end; it != end; ++it) | |
919 | { | |
920 | // Don't overwrite existing settings so command line settings override bitcoin.conf | |
921 | string strKey = string("-") + it->string_key; | |
922 | if (mapSettingsRet.count(strKey) == 0) | |
923 | mapSettingsRet[strKey] = it->value[0]; | |
924 | mapMultiSettingsRet[strKey].push_back(it->value[0]); | |
925 | } | |
926 | } | |
927 | ||
928 | string GetPidFile() | |
929 | { | |
930 | namespace fs = boost::filesystem; | |
931 | fs::path pathConfig(GetArg("-pid", "bitcoind.pid")); | |
932 | if (!pathConfig.is_complete()) | |
933 | pathConfig = fs::path(GetDataDir()) / pathConfig; | |
934 | return pathConfig.string(); | |
935 | } | |
936 | ||
937 | void CreatePidFile(string pidFile, pid_t pid) | |
938 | { | |
f85c0974 GS |
939 | FILE* file = fopen(pidFile.c_str(), "w"); |
940 | if (file) | |
2097c09a WL |
941 | { |
942 | fprintf(file, "%d\n", pid); | |
943 | fclose(file); | |
944 | } | |
945 | } | |
946 | ||
947 | int GetFilesize(FILE* file) | |
948 | { | |
949 | int nSavePos = ftell(file); | |
950 | int nFilesize = -1; | |
951 | if (fseek(file, 0, SEEK_END) == 0) | |
952 | nFilesize = ftell(file); | |
953 | fseek(file, nSavePos, SEEK_SET); | |
954 | return nFilesize; | |
955 | } | |
956 | ||
957 | void ShrinkDebugFile() | |
958 | { | |
959 | // Scroll debug.log if it's getting too big | |
960 | string strFile = GetDataDir() + "/debug.log"; | |
961 | FILE* file = fopen(strFile.c_str(), "r"); | |
962 | if (file && GetFilesize(file) > 10 * 1000000) | |
963 | { | |
964 | // Restart the file with some of the end | |
965 | char pch[200000]; | |
966 | fseek(file, -sizeof(pch), SEEK_END); | |
967 | int nBytes = fread(pch, 1, sizeof(pch), file); | |
968 | fclose(file); | |
f85c0974 GS |
969 | |
970 | file = fopen(strFile.c_str(), "w"); | |
971 | if (file) | |
2097c09a WL |
972 | { |
973 | fwrite(pch, 1, nBytes, file); | |
974 | fclose(file); | |
975 | } | |
976 | } | |
977 | } | |
978 | ||
979 | ||
980 | ||
981 | ||
982 | ||
983 | ||
984 | ||
985 | ||
986 | // | |
987 | // "Never go to sea with two chronometers; take one or three." | |
988 | // Our three time sources are: | |
989 | // - System clock | |
990 | // - Median of other nodes's clocks | |
991 | // - The user (asking the user to fix the system clock if the first two disagree) | |
992 | // | |
bde280b9 | 993 | static int64 nMockTime = 0; // For unit testing |
54d02f15 | 994 | |
bde280b9 | 995 | int64 GetTime() |
2097c09a | 996 | { |
54d02f15 GA |
997 | if (nMockTime) return nMockTime; |
998 | ||
2097c09a WL |
999 | return time(NULL); |
1000 | } | |
1001 | ||
bde280b9 | 1002 | void SetMockTime(int64 nMockTimeIn) |
54d02f15 GA |
1003 | { |
1004 | nMockTime = nMockTimeIn; | |
1005 | } | |
1006 | ||
bde280b9 | 1007 | static int64 nTimeOffset = 0; |
2097c09a | 1008 | |
bde280b9 | 1009 | int64 GetAdjustedTime() |
2097c09a WL |
1010 | { |
1011 | return GetTime() + nTimeOffset; | |
1012 | } | |
1013 | ||
67a42f92 | 1014 | void AddTimeData(const CNetAddr& ip, int64 nTime) |
2097c09a | 1015 | { |
bde280b9 | 1016 | int64 nOffsetSample = nTime - GetTime(); |
2097c09a WL |
1017 | |
1018 | // Ignore duplicates | |
67a42f92 | 1019 | static set<CNetAddr> setKnown; |
2097c09a WL |
1020 | if (!setKnown.insert(ip).second) |
1021 | return; | |
1022 | ||
1023 | // Add data | |
1c4aab92 MH |
1024 | vTimeOffsets.input(nOffsetSample); |
1025 | printf("Added time data, samples %d, offset %+"PRI64d" (%+"PRI64d" minutes)\n", vTimeOffsets.size(), nOffsetSample, nOffsetSample/60); | |
2097c09a WL |
1026 | if (vTimeOffsets.size() >= 5 && vTimeOffsets.size() % 2 == 1) |
1027 | { | |
bde280b9 WL |
1028 | int64 nMedian = vTimeOffsets.median(); |
1029 | std::vector<int64> vSorted = vTimeOffsets.sorted(); | |
2097c09a WL |
1030 | // Only let other nodes change our time by so much |
1031 | if (abs64(nMedian) < 70 * 60) | |
1032 | { | |
1033 | nTimeOffset = nMedian; | |
1034 | } | |
1035 | else | |
1036 | { | |
1037 | nTimeOffset = 0; | |
1038 | ||
1039 | static bool fDone; | |
1040 | if (!fDone) | |
1041 | { | |
1042 | // If nobody has a time different than ours but within 5 minutes of ours, give a warning | |
1043 | bool fMatch = false; | |
bde280b9 | 1044 | BOOST_FOREACH(int64 nOffset, vSorted) |
2097c09a WL |
1045 | if (nOffset != 0 && abs64(nOffset) < 5 * 60) |
1046 | fMatch = true; | |
1047 | ||
1048 | if (!fMatch) | |
1049 | { | |
1050 | fDone = true; | |
1051 | string strMessage = _("Warning: Please check that your computer's date and time are correct. If your clock is wrong Bitcoin will not work properly."); | |
1052 | strMiscWarning = strMessage; | |
1053 | printf("*** %s\n", strMessage.c_str()); | |
1054 | boost::thread(boost::bind(ThreadSafeMessageBox, strMessage+" ", string("Bitcoin"), wxOK | wxICON_EXCLAMATION, (wxWindow*)NULL, -1, -1)); | |
1055 | } | |
1056 | } | |
1057 | } | |
5e1ddc42 | 1058 | if (fDebug) { |
bde280b9 | 1059 | BOOST_FOREACH(int64 n, vSorted) |
5e1ddc42 MH |
1060 | printf("%+"PRI64d" ", n); |
1061 | printf("| "); | |
1062 | } | |
1063 | printf("nTimeOffset = %+"PRI64d" (%+"PRI64d" minutes)\n", nTimeOffset, nTimeOffset/60); | |
2097c09a WL |
1064 | } |
1065 | } | |
1066 | ||
1067 | ||
1068 | ||
1069 | ||
1070 | ||
1071 | ||
1072 | ||
1073 | ||
2097c09a WL |
1074 | string FormatVersion(int nVersion) |
1075 | { | |
1076 | if (nVersion%100 == 0) | |
1077 | return strprintf("%d.%d.%d", nVersion/1000000, (nVersion/10000)%100, (nVersion/100)%100); | |
1078 | else | |
1079 | return strprintf("%d.%d.%d.%d", nVersion/1000000, (nVersion/10000)%100, (nVersion/100)%100, nVersion%100); | |
1080 | } | |
1081 | ||
1082 | string FormatFullVersion() | |
1083 | { | |
f8ded588 | 1084 | string s = FormatVersion(CLIENT_VERSION); |
0eeb4f5d WL |
1085 | if (VERSION_IS_BETA) { |
1086 | s += "-"; | |
1087 | s += _("beta"); | |
1088 | } | |
2097c09a WL |
1089 | return s; |
1090 | } | |
1091 | ||
f8ded588 GA |
1092 | // Format the subversion field according to BIP 14 spec (https://en.bitcoin.it/wiki/BIP_0014) |
1093 | std::string FormatSubVersion(const std::string& name, int nClientVersion, const std::vector<std::string>& comments) | |
1094 | { | |
1095 | std::ostringstream ss; | |
1096 | ss << "/"; | |
1097 | ss << name << ":" << FormatVersion(nClientVersion); | |
1098 | if (!comments.empty()) | |
1099 | ss << "(" << boost::algorithm::join(comments, "; ") << ")"; | |
1100 | ss << "/"; | |
1101 | return ss.str(); | |
1102 | } | |
2097c09a WL |
1103 | |
1104 | ||
1105 | ||
865ed8a1 GA |
1106 | #ifdef DEBUG_LOCKORDER |
1107 | // | |
1108 | // Early deadlock detection. | |
1109 | // Problem being solved: | |
1110 | // Thread 1 locks A, then B, then C | |
1111 | // Thread 2 locks D, then C, then A | |
1112 | // --> may result in deadlock between the two threads, depending on when they run. | |
1113 | // Solution implemented here: | |
1114 | // Keep track of pairs of locks: (A before B), (A before C), etc. | |
1115 | // Complain if any thread trys to lock in a different order. | |
1116 | // | |
1117 | ||
1118 | struct CLockLocation | |
1119 | { | |
865ed8a1 GA |
1120 | CLockLocation(const char* pszName, const char* pszFile, int nLine) |
1121 | { | |
1122 | mutexName = pszName; | |
1123 | sourceFile = pszFile; | |
1124 | sourceLine = nLine; | |
1125 | } | |
c591cc50 GA |
1126 | |
1127 | std::string ToString() const | |
1128 | { | |
1129 | return mutexName+" "+sourceFile+":"+itostr(sourceLine); | |
1130 | } | |
1131 | ||
1132 | private: | |
1133 | std::string mutexName; | |
1134 | std::string sourceFile; | |
1135 | int sourceLine; | |
865ed8a1 GA |
1136 | }; |
1137 | ||
1138 | typedef std::vector< std::pair<CCriticalSection*, CLockLocation> > LockStack; | |
1139 | ||
1140 | static boost::interprocess::interprocess_mutex dd_mutex; | |
1141 | static std::map<std::pair<CCriticalSection*, CCriticalSection*>, LockStack> lockorders; | |
1142 | static boost::thread_specific_ptr<LockStack> lockstack; | |
1143 | ||
1144 | ||
b0243da7 | 1145 | static void potential_deadlock_detected(const std::pair<CCriticalSection*, CCriticalSection*>& mismatch, const LockStack& s1, const LockStack& s2) |
865ed8a1 GA |
1146 | { |
1147 | printf("POTENTIAL DEADLOCK DETECTED\n"); | |
1148 | printf("Previous lock order was:\n"); | |
1149 | BOOST_FOREACH(const PAIRTYPE(CCriticalSection*, CLockLocation)& i, s2) | |
1150 | { | |
b0243da7 GA |
1151 | if (i.first == mismatch.first) printf(" (1)"); |
1152 | if (i.first == mismatch.second) printf(" (2)"); | |
c591cc50 | 1153 | printf(" %s\n", i.second.ToString().c_str()); |
865ed8a1 GA |
1154 | } |
1155 | printf("Current lock order is:\n"); | |
1156 | BOOST_FOREACH(const PAIRTYPE(CCriticalSection*, CLockLocation)& i, s1) | |
1157 | { | |
b0243da7 GA |
1158 | if (i.first == mismatch.first) printf(" (1)"); |
1159 | if (i.first == mismatch.second) printf(" (2)"); | |
c591cc50 | 1160 | printf(" %s\n", i.second.ToString().c_str()); |
865ed8a1 GA |
1161 | } |
1162 | } | |
1163 | ||
1164 | static void push_lock(CCriticalSection* c, const CLockLocation& locklocation) | |
1165 | { | |
1166 | bool fOrderOK = true; | |
1167 | if (lockstack.get() == NULL) | |
1168 | lockstack.reset(new LockStack); | |
1169 | ||
c591cc50 | 1170 | if (fDebug) printf("Locking: %s\n", locklocation.ToString().c_str()); |
865ed8a1 GA |
1171 | dd_mutex.lock(); |
1172 | ||
1173 | (*lockstack).push_back(std::make_pair(c, locklocation)); | |
1174 | ||
1175 | BOOST_FOREACH(const PAIRTYPE(CCriticalSection*, CLockLocation)& i, (*lockstack)) | |
1176 | { | |
1177 | if (i.first == c) break; | |
1178 | ||
1179 | std::pair<CCriticalSection*, CCriticalSection*> p1 = std::make_pair(i.first, c); | |
1180 | if (lockorders.count(p1)) | |
1181 | continue; | |
1182 | lockorders[p1] = (*lockstack); | |
1183 | ||
1184 | std::pair<CCriticalSection*, CCriticalSection*> p2 = std::make_pair(c, i.first); | |
1185 | if (lockorders.count(p2)) | |
1186 | { | |
b0243da7 | 1187 | potential_deadlock_detected(p1, lockorders[p2], lockorders[p1]); |
865ed8a1 GA |
1188 | break; |
1189 | } | |
1190 | } | |
1191 | dd_mutex.unlock(); | |
1192 | } | |
1193 | ||
1194 | static void pop_lock() | |
1195 | { | |
c591cc50 GA |
1196 | if (fDebug) |
1197 | { | |
1198 | const CLockLocation& locklocation = (*lockstack).rbegin()->second; | |
1199 | printf("Unlocked: %s\n", locklocation.ToString().c_str()); | |
1200 | } | |
1201 | dd_mutex.lock(); | |
865ed8a1 | 1202 | (*lockstack).pop_back(); |
c591cc50 | 1203 | dd_mutex.unlock(); |
865ed8a1 GA |
1204 | } |
1205 | ||
1206 | void CCriticalSection::Enter(const char* pszName, const char* pszFile, int nLine) | |
1207 | { | |
1208 | push_lock(this, CLockLocation(pszName, pszFile, nLine)); | |
198fb229 MC |
1209 | #ifdef DEBUG_LOCKCONTENTION |
1210 | bool result = mutex.try_lock(); | |
1211 | if (!result) | |
1212 | { | |
1213 | printf("LOCKCONTENTION: %s\n", pszName); | |
1214 | printf("Locker: %s:%d\n", pszFile, nLine); | |
1215 | mutex.lock(); | |
1216 | printf("Locked\n"); | |
1217 | } | |
1218 | #else | |
865ed8a1 | 1219 | mutex.lock(); |
198fb229 | 1220 | #endif |
865ed8a1 GA |
1221 | } |
1222 | void CCriticalSection::Leave() | |
1223 | { | |
1224 | mutex.unlock(); | |
1225 | pop_lock(); | |
1226 | } | |
1227 | bool CCriticalSection::TryEnter(const char* pszName, const char* pszFile, int nLine) | |
1228 | { | |
1229 | push_lock(this, CLockLocation(pszName, pszFile, nLine)); | |
1230 | bool result = mutex.try_lock(); | |
1231 | if (!result) pop_lock(); | |
1232 | return result; | |
1233 | } | |
1234 | ||
1235 | #else | |
1236 | ||
198fb229 | 1237 | void CCriticalSection::Enter(const char* pszName, const char* pszFile, int nLine) |
865ed8a1 | 1238 | { |
198fb229 MC |
1239 | #ifdef DEBUG_LOCKCONTENTION |
1240 | bool result = mutex.try_lock(); | |
1241 | if (!result) | |
1242 | { | |
1243 | printf("LOCKCONTENTION: %s\n", pszName); | |
1244 | printf("Locker: %s:%d\n", pszFile, nLine); | |
1245 | mutex.lock(); | |
1246 | } | |
1247 | #else | |
865ed8a1 | 1248 | mutex.lock(); |
198fb229 | 1249 | #endif |
865ed8a1 GA |
1250 | } |
1251 | ||
1252 | void CCriticalSection::Leave() | |
1253 | { | |
1254 | mutex.unlock(); | |
1255 | } | |
1256 | ||
1257 | bool CCriticalSection::TryEnter(const char*, const char*, int) | |
1258 | { | |
1259 | bool result = mutex.try_lock(); | |
1260 | return result; | |
1261 | } | |
2097c09a | 1262 | |
865ed8a1 | 1263 | #endif /* DEBUG_LOCKORDER */ |
67a42f92 | 1264 |