-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathGlobal.cpp
1288 lines (1115 loc) · 39.7 KB
/
Global.cpp
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
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// WinDjView
// Copyright (C) 2004-2015 Andrew Zhezherun
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this program; if not, write to the Free Software Foundation, Inc.,
// 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
// http://www.gnu.org/copyleft/gpl.html
//
//-----------------------------------------------------------------------------
// MD5 digest implementation is based on libmd5-rfc
// http://sourceforge.net/projects/libmd5-rfc/
// Begin copyright notice for libmd5-rfc
// ***************************************************************************
// Copyright (C) 1999, 2000, 2002 Aladdin Enterprises. All rights reserved.
//
// This software is provided 'as-is', without any express or implied
// warranty. In no event will the authors be held liable for any damages
// arising from the use of this software.
//
// Permission is granted to anyone to use this software for any purpose,
// including commercial applications, and to alter it and redistribute it
// freely, subject to the following restrictions:
//
// 1. The origin of this software must not be misrepresented; you must not
// claim that you wrote the original software. If you use this software
// in a product, an acknowledgment in the product documentation would be
// appreciated but is not required.
// 2. Altered source versions must be plainly marked as such, and must not be
// misrepresented as being the original software.
// 3. This notice may not be removed or altered from any source distribution.
//
// L. Peter Deutsch
// ***************************************************************************
// End copyright notice for libmd5-rfc
//
//-----------------------------------------------------------------------------
// Base64 encoder/decoder implementation is based on stringencoders
// Begin copyright notice for stringencoders
// ***************************************************************************
// MODP_B64 - High performance base64 encoder/decoder
// http://code.google.com/p/stringencoders/
//
// Copyright © 2005, 2006, 2007 Nick Galbreath -- nickg [at] modp [dot] com
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// Neither the name of the modp.com nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// This is the standard "new" BSD license:
// http://www.opensource.org/licenses/bsd-license.php
// ***************************************************************************
// End copyright notice for stringencoders
#include "stdafx.h"
#include "Global.h"
#include "MyTheme.h"
// RefCount
RefCount::~RefCount()
{
}
// Observable
void Observable::AddObserver(Observer* observer)
{
m_observers.insert(observer);
}
void Observable::RemoveObserver(Observer* observer)
{
m_observers.erase(observer);
}
void Observable::UpdateObservers(const Message& message)
{
for (std::set<Observer*>::iterator it = m_observers.begin(); it != m_observers.end(); )
{
Observer* observer = *it++;
observer->OnUpdate(this, &message);
}
}
// Version
struct VersionInfo
{
VersionInfo();
bool bVistaPlus;
};
static VersionInfo theVersionInfo;
VersionInfo::VersionInfo()
: bVistaPlus(false)
{
OSVERSIONINFO vi;
vi.dwOSVersionInfoSize = sizeof(OSVERSIONINFO);
if (::GetVersionEx(&vi))
{
bool bNT = (vi.dwPlatformId == VER_PLATFORM_WIN32_NT);
if (bNT)
{
bVistaPlus = (vi.dwMajorVersion >= 6);
}
}
}
bool IsWinVistaOrLater()
{
return theVersionInfo.bVistaPlus;
}
// File functions
bool MoveToTrash(LPCTSTR lpszFileName)
{
size_t nLength = _tcslen(lpszFileName);
if (nLength >= _MAX_PATH)
return false;
// SHFileOperation needs an extra NULL character at the end
TCHAR pszFileToDelete[_MAX_PATH + 1];
_tcscpy(pszFileToDelete, lpszFileName);
pszFileToDelete[nLength + 1] = 0;
// Move to recycle bin
SHFILEOPSTRUCT fo;
ZeroMemory(&fo, sizeof(fo));
fo.wFunc = FO_DELETE;
fo.pFrom = pszFileToDelete;
fo.fFlags = FOF_ALLOWUNDO | FOF_NOCONFIRMATION | FOF_NOERRORUI | FOF_SILENT;
return (SHFileOperation(&fo) == 0);
}
// String conversion
GUTF8String MakeUTF8String(const CString& strText)
{
LPCWSTR pszUnicodeText = strText;
int nSize = ::WideCharToMultiByte(CP_UTF8, 0, pszUnicodeText, -1, NULL, 0, NULL, NULL);
if (nSize == 0)
return "";
LPSTR pszTextUTF8 = new CHAR[nSize];
::WideCharToMultiByte(CP_UTF8, 0, pszUnicodeText, -1, pszTextUTF8, nSize, NULL, NULL);
GUTF8String utf8String(pszTextUTF8);
delete[] pszTextUTF8;
return utf8String;
}
GUTF8String MakeUTF8String(const wstring& strText)
{
LPCWSTR pszUnicodeText = (LPCWSTR)strText.c_str();
int nSize = ::WideCharToMultiByte(CP_UTF8, 0, pszUnicodeText, -1, NULL, 0, NULL, NULL);
if (nSize == 0)
return "";
LPSTR pszTextUTF8 = new CHAR[nSize];
::WideCharToMultiByte(CP_UTF8, 0, pszUnicodeText, -1, pszTextUTF8, nSize, NULL, NULL);
GUTF8String utf8String(pszTextUTF8);
delete[] pszTextUTF8;
return utf8String;
}
int ReadUTF8Character(const char* str, int& nBytes)
{
const unsigned char* s = reinterpret_cast<const unsigned char*>(str);
unsigned char c = s[0];
if (c < 0x80)
{
nBytes = 1;
return c;
}
else if (c < 0xC2)
{
return -1;
}
else if (c < 0xE0)
{
if (s[1] == 0 || (s[1] ^ 0x80) >= 0x40)
return -1;
nBytes = 2;
return ((s[0] & 0x1F) << 6) + (s[1] ^ 0x80);
}
else if (c < 0xF0)
{
if (s[1] == 0 || s[2] == 0 || (s[1] ^ 0x80) >= 0x40
|| (s[2] ^ 0x80) >= 0x40 || (c == 0xE0 && s[1] < 0xA0))
return -1;
nBytes = 3;
return ((s[0] & 0xF) << 12) + ((s[1] ^ 0x80) << 6) + (s[2] ^ 0x80);
}
else if (c < 0xF5)
{
if (s[1] == 0 || s[2] == 0 || s[3] == 0 || (s[1] ^ 0x80) >= 0x40
|| (s[2] ^ 0x80) >= 0x40 || (s[3] ^ 0x80) >= 0x40
|| (c == 0xF0 && s[1] < 0x90) || (c == 0xF4 && s[1] > 0x8F))
return -1;
nBytes = 4;
return ((s[0] & 0x07) << 18) + ((s[1] ^ 0x80) << 12) + ((s[2] ^ 0x80) << 6)
+ (s[3] ^ 0x80);
}
else
return -1;
}
bool IsValidUTF8(const char* pszText)
{
const char* s = pszText;
while (*s != 0)
{
int nBytes = 0;
if (ReadUTF8Character(s, nBytes) < 0)
return false;
s += nBytes;
}
return true;
}
CString MakeCString(const GUTF8String& text)
{
CString strResult;
if (text.length() == 0)
return strResult;
// Prepare Unicode text
LPWSTR pszUnicodeText = NULL;
int nResult = 0;
// Bookmarks or annotations may not be encoded in UTF-8
// (when file was created by old software)
// Treat input string as non-UTF8 if it is not well-formed
DWORD dwFlags = 0;
// Check for invalid characters in UTF8 encoding
dwFlags |= MB_ERR_INVALID_CHARS;
// Make our own check anyway
if (!IsValidUTF8(text))
{
strResult = (LPCSTR)text;
return strResult;
}
int nSize = ::MultiByteToWideChar(CP_UTF8, dwFlags, (LPCSTR)text, -1, NULL, 0);
if (nSize != 0)
{
pszUnicodeText = new WCHAR[nSize];
nResult = ::MultiByteToWideChar(CP_UTF8, dwFlags, (LPCSTR)text, -1, pszUnicodeText, nSize);
}
if (nResult != 0)
strResult = pszUnicodeText;
else
strResult = (LPCSTR)text;
delete[] pszUnicodeText;
return strResult;
}
CString MakeCString(const wstring& text)
{
return CString((LPCWSTR)text.c_str());
}
void MakeWString(const CString& strText, wstring& result)
{
LPCTSTR pszText = (LPCTSTR)strText;
result = (const wchar_t*)pszText;
}
bool MakeWString(const GUTF8String& text, wstring& result)
{
if (text.length() == 0)
{
result.resize(0);
return true;
}
// Prepare Unicode text
LPWSTR pszUnicodeText = NULL;
int nResult = 0;
DWORD dwFlags = 0;
// Check for invalid characters in UTF8 encoding
dwFlags |= MB_ERR_INVALID_CHARS;
// Make our own check anyway
int nSize;
if (IsValidUTF8(text) && (nSize = ::MultiByteToWideChar(CP_UTF8, dwFlags,
(LPCSTR)text, -1, NULL, 0)) > 1)
{
result.resize(nSize - 1);
nResult = ::MultiByteToWideChar(CP_UTF8, dwFlags, (LPCSTR)text, -1,
(LPWSTR)result.data(), nSize);
return (nResult != 0);
}
else
{
int nSize = ::MultiByteToWideChar(CP_ACP, 0, (LPCSTR) text, -1, NULL, 0);
result.resize(nSize - 1);
if (nSize > 1)
::MultiByteToWideChar(CP_ACP, 0, (LPCSTR) text, -1, (LPWSTR) result.data(), nSize);
return true;
}
}
void MakeANSIString(const wstring& text, string& result)
{
int nSize = ::WideCharToMultiByte(CP_ACP, WC_COMPOSITECHECK | WC_DISCARDNS,
(LPCWSTR)text.c_str(), -1, NULL, 0, NULL, NULL);
result.resize(nSize - 1);
::WideCharToMultiByte(CP_ACP, WC_COMPOSITECHECK | WC_DISCARDNS,
(LPCWSTR)text.c_str(), -1, (LPSTR)result.data(), nSize, NULL, NULL);
}
void MakeANSIString(const CString& strText, string& result)
{
int nSize = ::WideCharToMultiByte(CP_ACP, WC_COMPOSITECHECK | WC_DISCARDNS,
(LPCWSTR)strText, -1, NULL, 0, NULL, NULL);
result.resize(nSize - 1);
::WideCharToMultiByte(CP_ACP, WC_COMPOSITECHECK | WC_DISCARDNS,
(LPCWSTR)strText, -1, (LPSTR)result.data(), nSize, NULL, NULL);
}
// System fonts
void CreateSystemDialogFont(CFont& font)
{
if (font.m_hObject != NULL)
font.DeleteObject();
LOGFONT lf;
HGDIOBJ hFont = (HFONT)::GetStockObject(DEFAULT_GUI_FONT);
::GetObject(hFont, sizeof(LOGFONT), &lf);
_tcscpy(lf.lfFaceName, _T("MS Shell Dlg 2"));
font.CreateFontIndirect(&lf);
}
void CreateSystemIconFont(CFont& font)
{
if (font.m_hObject != NULL)
font.DeleteObject();
LOGFONT lf;
if (IsThemed())
{
LOGFONTW lfw;
HRESULT hr = XPGetThemeSysFont(NULL, TMT_ICONTITLEFONT, &lfw);
if (SUCCEEDED(hr))
{
memcpy(&lf, &lfw, sizeof(LOGFONT));
font.CreateFontIndirect(&lf);
return;
}
}
if (!SystemParametersInfo(SPI_GETICONTITLELOGFONT, sizeof(LOGFONT), &lf, 0))
{
CreateSystemDialogFont(font);
return;
}
font.CreateFontIndirect(&lf);
}
void CreateSystemMenuFont(CFont& font)
{
if (font.m_hObject != NULL)
font.DeleteObject();
LOGFONT lf;
if (IsThemed())
{
LOGFONTW lfw;
HRESULT hr = XPGetThemeSysFont(NULL, TMT_MENUFONT, &lfw);
if (SUCCEEDED(hr))
{
memcpy(&lf, &lfw, sizeof(LOGFONT));
font.CreateFontIndirect(&lf);
return;
}
}
NONCLIENTMETRICS ncm;
ncm.cbSize = sizeof(NONCLIENTMETRICS);
if (!SystemParametersInfo(SPI_GETNONCLIENTMETRICS, sizeof(NONCLIENTMETRICS), &ncm, 0))
{
CreateSystemDialogFont(font);
return;
}
font.CreateFontIndirect(&ncm.lfMenuFont);
}
// MonitorAPI
struct MonitorAPI
{
MonitorAPI();
~MonitorAPI();
struct MonitorInfo
{
MonitorInfo() : cbSize(sizeof(MonitorInfo)) {}
DWORD cbSize;
RECT rcMonitor;
RECT rcWork;
DWORD dwFlags;
};
enum
{
DefaultToNull = 0,
DefaultToPrimary = 1,
DefaultToNearest = 2
};
typedef HANDLE (WINAPI* pfnMonitorFromPoint)(POINT pt, DWORD dwFlags);
typedef BOOL (WINAPI* pfnGetMonitorInfo)(HANDLE hMonitor, MonitorInfo* pmi);
typedef HANDLE (WINAPI* pfnMonitorFromWindow)(HWND hWnd, DWORD dwFlags);
pfnMonitorFromPoint pMonitorFromPoint;
pfnMonitorFromWindow pMonitorFromWindow;
pfnGetMonitorInfo pGetMonitorInfo;
bool IsLoaded() const { return hUser32 != NULL; }
HINSTANCE hUser32;
};
static MonitorAPI theMonitorAPI;
MonitorAPI::MonitorAPI()
: pMonitorFromPoint(NULL),
pMonitorFromWindow(NULL),
pGetMonitorInfo(NULL)
{
hUser32 = ::LoadLibrary(_T("user32.dll"));
if (hUser32 != NULL)
{
pMonitorFromPoint = (pfnMonitorFromPoint) ::GetProcAddress(hUser32, "MonitorFromPoint");
pMonitorFromWindow = (pfnMonitorFromWindow) ::GetProcAddress(hUser32, "MonitorFromWindow");
pGetMonitorInfo = (pfnGetMonitorInfo) ::GetProcAddress(hUser32, "GetMonitorInfoA");
if (pMonitorFromPoint == NULL
|| pMonitorFromWindow == NULL
|| pGetMonitorInfo == NULL)
{
::FreeLibrary(hUser32);
hUser32 = NULL;
}
}
}
MonitorAPI::~MonitorAPI()
{
if (hUser32 != NULL)
::FreeLibrary(hUser32);
}
CRect GetMonitorWorkArea(const CPoint& point)
{
CRect rcWorkArea;
if (!::SystemParametersInfo(SPI_GETWORKAREA, 0, (PVOID)&rcWorkArea, false))
{
CSize szScreen(::GetSystemMetrics(SM_CXSCREEN), ::GetSystemMetrics(SM_CYSCREEN));
rcWorkArea = CRect(CPoint(0, 0), szScreen);
}
if (theMonitorAPI.IsLoaded())
{
MonitorAPI::MonitorInfo mi;
HANDLE hMonitor = theMonitorAPI.pMonitorFromPoint(point, MonitorAPI::DefaultToNearest);
if (hMonitor != NULL && theMonitorAPI.pGetMonitorInfo(hMonitor, &mi))
rcWorkArea = mi.rcWork;
}
return rcWorkArea;
}
CRect GetMonitorWorkArea(CWnd* pWnd)
{
CRect rcWorkArea;
if (!::SystemParametersInfo(SPI_GETWORKAREA, 0, (PVOID)&rcWorkArea, false))
{
CSize szScreen(::GetSystemMetrics(SM_CXSCREEN), ::GetSystemMetrics(SM_CYSCREEN));
rcWorkArea = CRect(CPoint(0, 0), szScreen);
}
if (theMonitorAPI.IsLoaded())
{
MonitorAPI::MonitorInfo mi;
HANDLE hMonitor = theMonitorAPI.pMonitorFromWindow(pWnd->GetSafeHwnd(), MonitorAPI::DefaultToNearest);
if (hMonitor != NULL && theMonitorAPI.pGetMonitorInfo(hMonitor, &mi))
rcWorkArea = mi.rcWork;
}
return rcWorkArea;
}
CRect GetMonitorRect(CWnd* pWnd)
{
CSize szScreen(::GetSystemMetrics(SM_CXSCREEN), ::GetSystemMetrics(SM_CYSCREEN));
CRect rcMonitor(CPoint(0, 0), szScreen);
if (theMonitorAPI.IsLoaded())
{
MonitorAPI::MonitorInfo mi;
HANDLE hMonitor = theMonitorAPI.pMonitorFromWindow(pWnd->GetSafeHwnd(), MonitorAPI::DefaultToNearest);
if (hMonitor != NULL && theMonitorAPI.pGetMonitorInfo(hMonitor, &mi))
rcMonitor = mi.rcMonitor;
}
return rcMonitor;
}
UINT GetMouseScrollLines()
{
static UINT uCachedScrollLines = 0;
if (uCachedScrollLines == 0)
{
::SystemParametersInfo(SPI_GETWHEELSCROLLLINES, 0, &uCachedScrollLines, false);
if (uCachedScrollLines == 0)
uCachedScrollLines = 3; // reasonable default
}
return uCachedScrollLines;
}
bool IsFromCurrentProcess(CWnd* pWnd)
{
DWORD dwProcessId = 0;
::GetWindowThreadProcessId(pWnd->GetSafeHwnd(), &dwProcessId);
return (dwProcessId == ::GetCurrentProcessId());
}
void ParseVersion(const CString& strVersion, vector<int>& result)
{
result.clear();
int num = 0;
for (int i = 0; i < strVersion.GetLength(); ++i)
{
TCHAR c = strVersion[i];
if (c >= '0' && c <= '9')
{
num = num*10 + (c - '0');
}
else if (c == '.')
{
result.push_back(num);
num = 0;
}
else
break;
}
if (num != 0)
result.push_back(num);
while (!result.empty() && result.back() == 0)
result.pop_back();
}
int CompareVersions(const CString& strFirst, const CString& strSecond)
{
vector<int> v1, v2;
ParseVersion(strFirst, v1);
ParseVersion(strSecond, v2);
for (size_t i = 0; i < v1.size() || i < v2.size(); ++i)
{
if (i >= v1.size())
return -1;
else if (i >= v2.size())
return 1;
else if (v1[i] < v2[i])
return -1;
else if (v1[i] > v2[i])
return 1;
}
return 0;
}
CString FormatDouble(double fValue)
{
char nDecimalPoint = localeconv()->decimal_point[0];
CString strResult = FormatString(_T("%.6f"), fValue);
while (!strResult.IsEmpty() && strResult[strResult.GetLength() - 1] == '0')
strResult = strResult.Left(strResult.GetLength() - 1);
if (!strResult.IsEmpty() && strResult[strResult.GetLength() - 1] == nDecimalPoint)
strResult = strResult.Left(strResult.GetLength() - 1);
if (strResult.IsEmpty())
strResult = _T("0");
return strResult;
}
void AFXAPI DDX_MyText(CDataExchange* pDX, int nIDC, double& value, double def, LPCTSTR pszSuffix)
{
CString strText = FormatDouble(value) + pszSuffix;
DDX_Text(pDX, nIDC, strText);
if (pDX->m_bSaveAndValidate)
{
if (_stscanf(strText, _T("%lf"), &value) != 1)
value = def;
}
}
void AFXAPI DDX_MyText(CDataExchange* pDX, int nIDC, DWORD& value, DWORD def, LPCTSTR pszSuffix)
{
CString strText = FormatString(_T("%u%s"), value, CString(pszSuffix));
DDX_Text(pDX, nIDC, strText);
if (pDX->m_bSaveAndValidate)
{
if (_stscanf(strText, _T("%u"), &value) != 1)
value = def;
}
}
void SendMessageToVisibleDescendants(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam)
{
for (HWND hWndChild = ::GetTopWindow(hWnd); hWndChild != NULL;
hWndChild = ::GetNextWindow(hWndChild, GW_HWNDNEXT))
{
LONG lStyle = ::GetWindowLong(hWndChild, GWL_STYLE);
if ((lStyle & WS_VISIBLE) == 0)
continue;
::SendMessage(hWndChild, message, wParam, lParam);
// send to child windows after parent
if (::GetTopWindow(hWndChild) != NULL)
SendMessageToVisibleDescendants(hWndChild, message, wParam, lParam);
}
}
// MD5 digest implementation
struct MD5::State
{
DWORD abcd[4];
DWORD count[2];
BYTE buf[64];
State()
{
abcd[0] = 0x67452301UL;
abcd[1] = 0xefcdab89UL;
abcd[2] = 0x98badcfeUL;
abcd[3] = 0x10325476UL;
count[0] = 0;
count[1] = 0;
}
};
static const unsigned char pad[64] =
{
0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
};
#define F(b, c, d) ((((c) ^ (d)) & (b)) ^ (d))
#define G(b, c, d) ((((b) ^ (c)) & (d)) ^ (c))
#define H(b, c, d) ((b) ^ (c) ^ (d))
#define I(b, c, d) (((~(d)) | (b)) ^ (c))
#define ROTATE(a, n) _lrotl(a, n)
#define STEP(f, a, b, c, d, k, s, t) \
{\
a += ((k) + (t) + f((b), (c), (d)));\
a = ROTATE(a, s) + b;\
};
MD5::MD5(const MD5& md5)
: state(NULL)
{
memmove(md, md5.md, sizeof(md));
}
CString MD5::ToString() const
{
CString result;
LPTSTR psz = result.GetBuffer(2*sizeof(md));
for (size_t i = 0; i < sizeof(md); ++i)
{
unsigned char lo = md[i] & 0x0F;
unsigned char hi = md[i] >> 4;
psz[2*i] = (hi <= 9 ? '0' + hi : 'A' + hi - 10);
psz[2*i + 1] = (lo <= 9 ? '0' + lo : 'A' + lo - 10);
}
result.ReleaseBuffer(2*sizeof(md));
return result;
}
MD5::MD5()
{
state = new State();
}
MD5::MD5(const void* data, size_t len)
{
state = new State();
Append(data, len);
Finish();
}
void MD5::Block(const void* data)
{
const DWORD* x = (const DWORD*) data;
DWORD a, b, c, d;
DWORD xbuf[16];
if ((reinterpret_cast<size_t>(data) & 3) != 0)
{
// Not properly aligned, need to copy the data first
memcpy(xbuf, data, 64);
x = xbuf;
}
a = state->abcd[0];
b = state->abcd[1];
c = state->abcd[2];
d = state->abcd[3];
STEP(F, a, b, c, d, x[ 0], 7, 0xd76aa478L);
STEP(F, d, a, b, c, x[ 1], 12, 0xe8c7b756L);
STEP(F, c, d, a, b, x[ 2], 17, 0x242070dbL);
STEP(F, b, c, d, a, x[ 3], 22, 0xc1bdceeeL);
STEP(F, a, b, c, d, x[ 4], 7, 0xf57c0fafL);
STEP(F, d, a, b, c, x[ 5], 12, 0x4787c62aL);
STEP(F, c, d, a, b, x[ 6], 17, 0xa8304613L);
STEP(F, b, c, d, a, x[ 7], 22, 0xfd469501L);
STEP(F, a, b, c, d, x[ 8], 7, 0x698098d8L);
STEP(F, d, a, b, c, x[ 9], 12, 0x8b44f7afL);
STEP(F, c, d, a, b, x[10], 17, 0xffff5bb1L);
STEP(F, b, c, d, a, x[11], 22, 0x895cd7beL);
STEP(F, a, b, c, d, x[12], 7, 0x6b901122L);
STEP(F, d, a, b, c, x[13], 12, 0xfd987193L);
STEP(F, c, d, a, b, x[14], 17, 0xa679438eL);
STEP(F, b, c, d, a, x[15], 22, 0x49b40821L);
STEP(G, a, b, c, d, x[ 1], 5, 0xf61e2562L);
STEP(G, d, a, b, c, x[ 6], 9, 0xc040b340L);
STEP(G, c, d, a, b, x[11], 14, 0x265e5a51L);
STEP(G, b, c, d, a, x[ 0], 20, 0xe9b6c7aaL);
STEP(G, a, b, c, d, x[ 5], 5, 0xd62f105dL);
STEP(G, d, a, b, c, x[10], 9, 0x02441453L);
STEP(G, c, d, a, b, x[15], 14, 0xd8a1e681L);
STEP(G, b, c, d, a, x[ 4], 20, 0xe7d3fbc8L);
STEP(G, a, b, c, d, x[ 9], 5, 0x21e1cde6L);
STEP(G, d, a, b, c, x[14], 9, 0xc33707d6L);
STEP(G, c, d, a, b, x[ 3], 14, 0xf4d50d87L);
STEP(G, b, c, d, a, x[ 8], 20, 0x455a14edL);
STEP(G, a, b, c, d, x[13], 5, 0xa9e3e905L);
STEP(G, d, a, b, c, x[ 2], 9, 0xfcefa3f8L);
STEP(G, c, d, a, b, x[ 7], 14, 0x676f02d9L);
STEP(G, b, c, d, a, x[12], 20, 0x8d2a4c8aL);
STEP(H, a, b, c, d, x[ 5], 4, 0xfffa3942L);
STEP(H, d, a, b, c, x[ 8], 11, 0x8771f681L);
STEP(H, c, d, a, b, x[11], 16, 0x6d9d6122L);
STEP(H, b, c, d, a, x[14], 23, 0xfde5380cL);
STEP(H, a, b, c, d, x[ 1], 4, 0xa4beea44L);
STEP(H, d, a, b, c, x[ 4], 11, 0x4bdecfa9L);
STEP(H, c, d, a, b, x[ 7], 16, 0xf6bb4b60L);
STEP(H, b, c, d, a, x[10], 23, 0xbebfbc70L);
STEP(H, a, b, c, d, x[13], 4, 0x289b7ec6L);
STEP(H, d, a, b, c, x[ 0], 11, 0xeaa127faL);
STEP(H, c, d, a, b, x[ 3], 16, 0xd4ef3085L);
STEP(H, b, c, d, a, x[ 6], 23, 0x04881d05L);
STEP(H, a, b, c, d, x[ 9], 4, 0xd9d4d039L);
STEP(H, d, a, b, c, x[12], 11, 0xe6db99e5L);
STEP(H, c, d, a, b, x[15], 16, 0x1fa27cf8L);
STEP(H, b, c, d, a, x[ 2], 23, 0xc4ac5665L);
STEP(I, a, b, c, d, x[ 0], 6, 0xf4292244L);
STEP(I, d, a, b, c, x[ 7], 10, 0x432aff97L);
STEP(I, c, d, a, b, x[14], 15, 0xab9423a7L);
STEP(I, b, c, d, a, x[ 5], 21, 0xfc93a039L);
STEP(I, a, b, c, d, x[12], 6, 0x655b59c3L);
STEP(I, d, a, b, c, x[ 3], 10, 0x8f0ccc92L);
STEP(I, c, d, a, b, x[10], 15, 0xffeff47dL);
STEP(I, b, c, d, a, x[ 1], 21, 0x85845dd1L);
STEP(I, a, b, c, d, x[ 8], 6, 0x6fa87e4fL);
STEP(I, d, a, b, c, x[15], 10, 0xfe2ce6e0L);
STEP(I, c, d, a, b, x[ 6], 15, 0xa3014314L);
STEP(I, b, c, d, a, x[13], 21, 0x4e0811a1L);
STEP(I, a, b, c, d, x[ 4], 6, 0xf7537e82L);
STEP(I, d, a, b, c, x[11], 10, 0xbd3af235L);
STEP(I, c, d, a, b, x[ 2], 15, 0x2ad7d2bbL);
STEP(I, b, c, d, a, x[ 9], 21, 0xeb86d391L);
state->abcd[0] += a;
state->abcd[1] += b;
state->abcd[2] += c;
state->abcd[3] += d;
}
void MD5::Append(const void *data, size_t len)
{
ASSERT(state != NULL);
if (len == 0)
return;
const unsigned char* p = (unsigned char*) data;
size_t left = len;
size_t offset = (state->count[0] >> 3) & 63;
DWORD nbits = static_cast<DWORD>(len << 3);
// Update the message length
state->count[1] += static_cast<DWORD>(len >> 29);
state->count[0] += nbits;
if (state->count[0] < nbits)
state->count[1]++;
// Process an initial partial block
if (offset)
{
size_t ncopy = min(64 - offset, len);
memcpy(state->buf + offset, p, ncopy);
if (offset + ncopy < 64)
return;
p += ncopy;
left -= ncopy;
Block(state->buf);
}
// Process full blocks
for (; left >= 64; left -= 64, p += 64)
Block(p);
// Process a final partial block
if (left)
memcpy(state->buf, p, left);
}
void MD5::Finish()
{
ASSERT(state != NULL);
unsigned char data[8];
int i;
// Save the length before padding
for (i = 0; i < 8; ++i)
data[i] = static_cast<unsigned char>(state->count[i >> 2] >> ((i & 3) << 3));
// Pad to 56 bytes mod 64
Append(pad, ((55 - (state->count[0] >> 3)) & 63) + 1);
// Append the length
Append(data, 8);
for (i = 0; i < 16; ++i)
md[i] = static_cast<unsigned char>(state->abcd[i >> 2] >> ((i & 3) << 3));
delete state;
state = NULL;
}
// Base64 encoder/decoder
#define CHARPAD '='
static const char e0[] =
"AAAABBBBCCCCDDDDEEEEFFFFGGGGHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPP"
"QQQQRRRRSSSSTTTTUUUUVVVVWWWWXXXXYYYYZZZZaaaabbbbccccddddeeeeffff"
"gggghhhhiiiijjjjkkkkllllmmmmnnnnooooppppqqqqrrrrssssttttuuuuvvvv"
"wwwwxxxxyyyyzzzz0000111122223333444455556666777788889999++++////";
static const char e1[] =
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
static const UINT d0[] =
{
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x000000f8, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x000000fc,
0x000000d0, 0x000000d4, 0x000000d8, 0x000000dc, 0x000000e0, 0x000000e4,
0x000000e8, 0x000000ec, 0x000000f0, 0x000000f4, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x00000000,
0x00000004, 0x00000008, 0x0000000c, 0x00000010, 0x00000014, 0x00000018,
0x0000001c, 0x00000020, 0x00000024, 0x00000028, 0x0000002c, 0x00000030,
0x00000034, 0x00000038, 0x0000003c, 0x00000040, 0x00000044, 0x00000048,
0x0000004c, 0x00000050, 0x00000054, 0x00000058, 0x0000005c, 0x00000060,
0x00000064, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x00000068, 0x0000006c, 0x00000070, 0x00000074, 0x00000078,
0x0000007c, 0x00000080, 0x00000084, 0x00000088, 0x0000008c, 0x00000090,
0x00000094, 0x00000098, 0x0000009c, 0x000000a0, 0x000000a4, 0x000000a8,
0x000000ac, 0x000000b0, 0x000000b4, 0x000000b8, 0x000000bc, 0x000000c0,
0x000000c4, 0x000000c8, 0x000000cc, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff
};
static const UINT d1[256] =
{
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,
0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff,