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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
|
#include "comparison.h"
#include <stdexcept>
#include "shared/globalFunctions.h"
#include <wx/intl.h>
#include <wx/timer.h>
#include <wx/ffile.h>
#include <wx/msgdlg.h>
#include <wx/log.h>
#include "algorithm.h"
#include "ui/util.h"
#include <wx/thread.h>
#include <memory>
#include "shared/stringConv.h"
#include "library/statusHandler.h"
#include "shared/fileHandling.h"
#include "shared/systemFunctions.h"
#include "shared/fileTraverser.h"
#include "library/filter.h"
#include <map>
#include "fileHierarchy.h"
#include <boost/bind.hpp>
#include <boost/scoped_array.hpp>
using namespace FreeFileSync;
std::vector<FreeFileSync::FolderPairCfg> FreeFileSync::extractCompareCfg(const MainConfiguration& mainCfg)
{
//merge first and additional pairs
std::vector<FolderPairEnh> allPairs;
allPairs.push_back(mainCfg.firstPair);
allPairs.insert(allPairs.end(),
mainCfg.additionalPairs.begin(), //add additional pairs
mainCfg.additionalPairs.end());
const FilterProcess::FilterRef globalFilter(new NameFilter(mainCfg.includeFilter, mainCfg.excludeFilter));
std::vector<FolderPairCfg> output;
for (std::vector<FolderPairEnh>::const_iterator i = allPairs.begin(); i != allPairs.end(); ++i)
output.push_back(
FolderPairCfg(i->leftDirectory,
i->rightDirectory,
mainCfg.filterIsActive ?
combineFilters(globalFilter,
FilterProcess::FilterRef(
new NameFilter(
i->localFilter.includeFilter,
i->localFilter.excludeFilter))) :
FilterProcess::FilterRef(new NullFilter),
i->altSyncConfig.get() ? i->altSyncConfig->syncConfiguration : mainCfg.syncConfiguration));
return output;
}
class BaseDirCallback;
class DirCallback : public FreeFileSync::TraverseCallback
{
public:
DirCallback(BaseDirCallback* baseCallback,
const Zstring& relNameParentPf, //postfixed with FILE_NAME_SEPARATOR!
DirContainer& output,
StatusHandler* handler) :
baseCallback_(baseCallback),
relNameParentPf_(relNameParentPf),
output_(output),
statusHandler(handler) {}
virtual ~DirCallback() {}
virtual ReturnValue onFile(const DefaultChar* shortName, const Zstring& fullName, const FileInfo& details);
virtual ReturnValDir onDir(const DefaultChar* shortName, const Zstring& fullName);
virtual ReturnValue onError(const wxString& errorText);
private:
BaseDirCallback* const baseCallback_;
const Zstring relNameParentPf_;
DirContainer& output_;
StatusHandler* const statusHandler;
};
class BaseDirCallback : public DirCallback
{
friend class DirCallback;
public:
BaseDirCallback(DirContainer& output, const FilterProcess::FilterRef& filter, StatusHandler* handler) :
DirCallback(this, Zstring(), output, handler),
textScanning(wxToZ(wxString(_("Scanning:")) + wxT(" \n"))),
filterInstance(filter) {}
virtual TraverseCallback::ReturnValue onFile(const DefaultChar* shortName, const Zstring& fullName, const TraverseCallback::FileInfo& details);
private:
typedef boost::shared_ptr<const DirCallback> CallbackPointer;
const Zstring textScanning;
std::vector<CallbackPointer> callBackBox; //collection of callback pointers to handle ownership
const FilterProcess::FilterRef filterInstance; //always bound!
};
TraverseCallback::ReturnValue DirCallback::onFile(const DefaultChar* shortName, const Zstring& fullName, const FileInfo& details)
{
//assemble status message (performance optimized) = textScanning + wxT("\"") + fullName + wxT("\"")
Zstring statusText = baseCallback_->textScanning;
statusText.reserve(statusText.length() + fullName.length() + 2);
statusText += DefaultChar('\"');
statusText += fullName;
statusText += DefaultChar('\"');
//update UI/commandline status information
statusHandler->updateStatusText(statusText);
//------------------------------------------------------------------------------------
//apply filter before processing (use relative name!)
if (!baseCallback_->filterInstance->passFileFilter(relNameParentPf_ + shortName))
{
statusHandler->requestUiRefresh();
return TRAVERSING_CONTINUE;
}
output_.addSubFile(shortName, FileDescriptor(details.lastWriteTimeRaw, details.fileSize));
//add 1 element to the progress indicator
statusHandler->updateProcessedData(1, 0); //NO performance issue at all
//trigger display refresh
statusHandler->requestUiRefresh();
return TRAVERSING_CONTINUE;
}
TraverseCallback::ReturnValDir DirCallback::onDir(const DefaultChar* shortName, const Zstring& fullName)
{
using globalFunctions::FILE_NAME_SEPARATOR;
//assemble status message (performance optimized) = textScanning + wxT("\"") + fullName + wxT("\"")
Zstring statusText = baseCallback_->textScanning;
statusText.reserve(statusText.length() + fullName.length() + 2);
statusText += DefaultChar('\"');
statusText += fullName;
statusText += DefaultChar('\"');
//update UI/commandline status information
statusHandler->updateStatusText(statusText);
//------------------------------------------------------------------------------------
Zstring relName = relNameParentPf_;
relName += shortName;
//apply filter before processing (use relative name!)
bool subObjMightMatch = true;
if (!baseCallback_->filterInstance->passDirFilter(relName, &subObjMightMatch))
{
statusHandler->requestUiRefresh();
if (subObjMightMatch)
{
DirContainer& subDir = output_.addSubDir(shortName);
DirCallback* subDirCallback = new DirCallback(baseCallback_, relName += FILE_NAME_SEPARATOR, subDir, statusHandler);
baseCallback_->callBackBox.push_back(BaseDirCallback::CallbackPointer(subDirCallback)); //handle ownership
//attention: ensure directory filtering is applied later to exclude actually filtered directories
return ReturnValDir(ReturnValDir::Continue(), subDirCallback);
}
else
return ReturnValDir::Ignore(); //do NOT traverse subdirs
}
DirContainer& subDir = output_.addSubDir(shortName);
//add 1 element to the progress indicator
statusHandler->updateProcessedData(1, 0); //NO performance issue at all
//trigger display refresh
statusHandler->requestUiRefresh();
DirCallback* subDirCallback = new DirCallback(baseCallback_, relName += FILE_NAME_SEPARATOR, subDir, statusHandler);
baseCallback_->callBackBox.push_back(BaseDirCallback::CallbackPointer(subDirCallback)); //handle ownership
return ReturnValDir(ReturnValDir::Continue(), subDirCallback);
}
TraverseCallback::ReturnValue DirCallback::onError(const wxString& errorText)
{
while (true)
{
switch (statusHandler->reportError(errorText))
{
case ErrorHandler::IGNORE_ERROR:
return TRAVERSING_CONTINUE;
case ErrorHandler::RETRY:
break; //I have to admit "retry" is a bit of a fake here... at least the user has opportunity to abort!
}
}
return TRAVERSING_CONTINUE; //dummy value
}
TraverseCallback::ReturnValue BaseDirCallback::onFile(
const DefaultChar* shortName,
const Zstring& fullName,
const TraverseCallback::FileInfo& details)
{
//do not scan the database file
#ifdef FFS_WIN
if (getSyncDBFilename().CmpNoCase(shortName) == 0)
#elif defined FFS_LINUX
if (getSyncDBFilename().Cmp(shortName) == 0)
#endif
return TraverseCallback::TRAVERSING_CONTINUE;
return DirCallback::onFile(shortName, fullName, details);
}
//------------------------------------------------------------------------------------------
struct DirBufferKey
{
DirBufferKey(const Zstring& dirname,
const FilterProcess::FilterRef& filterIn) : //filter interface: always bound by design!
directoryName(dirname),
filter(filterIn->isNull() ? //some optimization of "Null" filter
FilterProcess::FilterRef(new NullFilter) :
filterIn) {}
const Zstring directoryName;
const FilterProcess::FilterRef filter; //buffering has to consider filtering!
bool operator < (const DirBufferKey& b) const
{
#ifdef FFS_WIN //Windows does NOT distinguish between upper/lower-case
const int rv = directoryName.CmpNoCase(b.directoryName);
#elif defined FFS_LINUX //Linux DOES distinguish between upper/lower-case
const int rv = directoryName.Cmp(b.directoryName);
#endif
if (rv != 0)
return rv < 0;
return *filter < *b.filter;
}
};
//------------------------------------------------------------------------------------------
class CompareProcess::DirectoryBuffer //buffer multiple scans of the same directories
{
public:
DirectoryBuffer(const bool traverseDirectorySymlinks, StatusHandler* statusUpdater) :
m_traverseDirectorySymlinks(traverseDirectorySymlinks),
m_statusUpdater(statusUpdater) {}
const DirContainer& getDirectoryDescription(const Zstring& directoryPostfixed, const FilterProcess::FilterRef& filter);
private:
typedef boost::shared_ptr<DirContainer> DirBufferValue; //exception safety: avoid memory leak
typedef std::map<DirBufferKey, DirBufferValue> BufferType;
DirContainer& insertIntoBuffer(const DirBufferKey& newKey);
BufferType buffer;
const bool m_traverseDirectorySymlinks;
StatusHandler* m_statusUpdater;
};
//------------------------------------------------------------------------------------------
DirContainer& CompareProcess::DirectoryBuffer::insertIntoBuffer(const DirBufferKey& newKey)
{
DirBufferValue baseContainer(new DirContainer);
buffer.insert(std::make_pair(newKey, baseContainer));
if (FreeFileSync::dirExists(newKey.directoryName.c_str())) //folder existence already checked in startCompareProcess(): do not treat as error when arriving here!
{
std::auto_ptr<TraverseCallback> traverser(new BaseDirCallback(*baseContainer, newKey.filter, m_statusUpdater));
//get all files and folders from directoryPostfixed (and subdirectories)
traverseFolder(newKey.directoryName, m_traverseDirectorySymlinks, traverser.get()); //exceptions may be thrown!
}
return *baseContainer.get();
}
const DirContainer& CompareProcess::DirectoryBuffer::getDirectoryDescription(
const Zstring& directoryPostfixed,
const FilterProcess::FilterRef& filter)
{
const DirBufferKey searchKey(directoryPostfixed, filter);
BufferType::const_iterator entryFound = buffer.find(searchKey);
if (entryFound != buffer.end())
return *entryFound->second.get(); //entry found in buffer; return
else
return insertIntoBuffer(searchKey); //entry not found; create new one
}
//------------------------------------------------------------------------------------------
void foldersAreValidForComparison(const std::vector<FolderPairCfg>& folderPairsForm, StatusHandler* statusUpdater)
{
bool checkEmptyDirnameActive = true; //check for empty dirs just once
const wxString additionalInfo = _("You can ignore the error to consider not existing directories as empty.");
for (std::vector<FolderPairCfg>::const_iterator i = folderPairsForm.begin(); i != folderPairsForm.end(); ++i)
{
//check if folder name is empty
if (i->leftDirectory.empty() || i->rightDirectory.empty())
{
if (checkEmptyDirnameActive)
{
checkEmptyDirnameActive = false;
while (true)
{
const ErrorHandler::Response rv = statusUpdater->reportError(wxString(_("Please fill all empty directory fields.")) + wxT(" \n\n") +
+ wxT("(") + additionalInfo + wxT(")"));
if (rv == ErrorHandler::IGNORE_ERROR)
break;
else if (rv == ErrorHandler::RETRY)
; //continue with loop
else
throw std::logic_error("Programming Error: Unknown return value!");
}
}
}
//check if folders exist
if (!i->leftDirectory.empty())
while (!FreeFileSync::dirExists(i->leftDirectory.c_str()))
{
ErrorHandler::Response rv = statusUpdater->reportError(wxString(_("Directory does not exist:")) + wxT(" \n") +
wxT("\"") + zToWx(i->leftDirectory) + wxT("\"") + wxT("\n\n") +
FreeFileSync::getLastErrorFormatted() + wxT(" ") + additionalInfo);
if (rv == ErrorHandler::IGNORE_ERROR)
break;
else if (rv == ErrorHandler::RETRY)
; //continue with loop
else
throw std::logic_error("Programming Error: Unknown return value!");
}
if (!i->rightDirectory.empty())
while (!FreeFileSync::dirExists(i->rightDirectory.c_str()))
{
ErrorHandler::Response rv = statusUpdater->reportError(wxString(_("Directory does not exist:")) + wxT("\n") +
wxT("\"") + zToWx(i->rightDirectory) + wxT("\"") + wxT("\n\n") +
FreeFileSync::getLastErrorFormatted() + wxT(" ") + additionalInfo);
if (rv == ErrorHandler::IGNORE_ERROR)
break;
else if (rv == ErrorHandler::RETRY)
; //continue with loop
else
throw std::logic_error("Programming Error: Unknown return value!");
}
}
}
bool dependencyExists(const std::set<Zstring>& folders, const Zstring& newFolder, wxString& warningMessage)
{
for (std::set<Zstring>::const_iterator i = folders.begin(); i != folders.end(); ++i)
{
Zstring newFolderFmt = newFolder;
Zstring refFolderFmt = *i;
#ifdef FFS_WIN //Windows does NOT distinguish between upper/lower-case
newFolderFmt.MakeLower();
refFolderFmt.MakeLower();
#elif defined FFS_LINUX //Linux DOES distinguish between upper/lower-case
//nothing to do here
#endif
if (newFolderFmt.StartsWith(refFolderFmt) || refFolderFmt.StartsWith(newFolderFmt))
{
warningMessage = wxString(_("Directories are dependent! Be careful when setting up synchronization rules:")) + wxT("\n") +
wxT("\"") + zToWx(*i) + wxT("\"\n") +
wxT("\"") + zToWx(newFolder) + wxT("\"");
return true;
}
}
return false;
}
bool foldersHaveDependencies(const std::vector<FolderPairCfg>& folderPairsFrom, wxString& warningMessage)
{
warningMessage.Clear();
std::set<Zstring> folders;
for (std::vector<FolderPairCfg>::const_iterator i = folderPairsFrom.begin(); i != folderPairsFrom.end(); ++i)
{
if (!i->leftDirectory.empty()) //empty folders names might be accepted by user
{
if (dependencyExists(folders, i->leftDirectory, warningMessage))
return true;
folders.insert(i->leftDirectory);
}
if (!i->rightDirectory.empty()) //empty folders names might be accepted by user
{
if (dependencyExists(folders, i->rightDirectory, warningMessage))
return true;
folders.insert(i->rightDirectory);
}
}
return false;
}
CompareProcess::CompareProcess(const bool traverseSymLinks,
const unsigned int fileTimeTol,
const bool ignoreOneHourDiff,
xmlAccess::OptionalDialogs& warnings,
StatusHandler* handler) :
fileTimeTolerance(fileTimeTol),
ignoreOneHourDifference(ignoreOneHourDiff),
m_warnings(warnings),
statusUpdater(handler),
txtComparingContentOfFiles(wxToZ(_("Comparing content of files %x")).Replace(DefaultStr("%x"), DefaultStr("\n\"%x\""), false))
{
directoryBuffer.reset(new DirectoryBuffer(traverseSymLinks, handler));
}
//callback functionality for status updates while comparing
class CompareCallback
{
public:
virtual ~CompareCallback() {}
virtual void updateCompareStatus(const wxLongLong& totalBytesTransferred) = 0;
};
bool filesHaveSameContent(const Zstring& filename1, const Zstring& filename2, CompareCallback* callback)
{
const unsigned int BUFFER_SIZE = 512 * 1024; //512 kb seems to be the perfect buffer size
static boost::scoped_array<unsigned char> memory1(new unsigned char[BUFFER_SIZE]);
static boost::scoped_array<unsigned char> memory2(new unsigned char[BUFFER_SIZE]);
#ifdef FFS_WIN
wxFFile file1(filename1.c_str(), DefaultStr("rb"));
#elif defined FFS_LINUX
wxFFile file1(::fopen(filename1.c_str(), DefaultStr("rb"))); //utilize UTF-8 filename
#endif
if (!file1.IsOpened())
throw FileError(wxString(_("Error opening file:")) + wxT(" \"") + zToWx(filename1) + wxT("\""));
#ifdef FFS_WIN
wxFFile file2(filename2.c_str(), DefaultStr("rb"));
#elif defined FFS_LINUX
wxFFile file2(::fopen(filename2.c_str(), DefaultStr("rb"))); //utilize UTF-8 filename
#endif
if (!file2.IsOpened()) //NO cleanup necessary for (wxFFile) file1
throw FileError(wxString(_("Error opening file:")) + wxT(" \"") + zToWx(filename2) + wxT("\""));
wxLongLong bytesCompared;
do
{
const size_t length1 = file1.Read(memory1.get(), BUFFER_SIZE);
if (file1.Error()) throw FileError(wxString(_("Error reading file:")) + wxT(" \"") + zToWx(filename1) + wxT("\""));
const size_t length2 = file2.Read(memory2.get(), BUFFER_SIZE);
if (file2.Error()) throw FileError(wxString(_("Error reading file:")) + wxT(" \"") + zToWx(filename2) + wxT("\""));
if (length1 != length2 || ::memcmp(memory1.get(), memory2.get(), length1) != 0)
return false;
bytesCompared += length1 * 2;
//send progress updates
callback->updateCompareStatus(bytesCompared);
}
while (!file1.Eof());
if (!file2.Eof())
return false;
return true;
}
//callback implementation
class CmpCallbackImpl : public CompareCallback
{
public:
CmpCallbackImpl(StatusHandler* handler, wxLongLong& bytesComparedLast) :
m_handler(handler),
m_bytesComparedLast(bytesComparedLast) {}
virtual void updateCompareStatus(const wxLongLong& totalBytesTransferred)
{
//called every 512 kB
//inform about the (differential) processed amount of data
m_handler->updateProcessedData(0, totalBytesTransferred - m_bytesComparedLast);
m_bytesComparedLast = totalBytesTransferred;
m_handler->requestUiRefresh(); //exceptions may be thrown here!
}
private:
StatusHandler* m_handler;
wxLongLong& m_bytesComparedLast;
};
bool filesHaveSameContentUpdating(const Zstring& filename1, const Zstring& filename2, const wxULongLong& totalBytesToCmp, StatusHandler* handler)
{
wxLongLong bytesComparedLast; //amount of bytes that have been compared and communicated to status handler
CmpCallbackImpl callback(handler, bytesComparedLast);
bool sameContent = true;
try
{
sameContent = filesHaveSameContent(filename1, filename2, &callback);
}
catch (...)
{
//error situation: undo communication of processed amount of data
handler->updateProcessedData(0, bytesComparedLast * -1);
throw;
}
//inform about the (remaining) processed amount of data
handler->updateProcessedData(0, globalFunctions::convertToSigned(totalBytesToCmp) - bytesComparedLast);
return sameContent;
}
struct ToBeRemoved
{
bool operator()(const DirMapping& dirObj) const
{
return !dirObj.isActive() && dirObj.subDirs.size() == 0 && dirObj.subFiles.size() == 0;
}
};
class RemoveFilteredDirs
{
public:
RemoveFilteredDirs(const FilterProcess& filterProc) :
filterProc_(filterProc) {}
void execute(HierarchyObject& hierObj)
{
//process subdirs recursively
std::for_each(hierObj.subDirs.begin(), hierObj.subDirs.end(), *this);
//remove superfluous directories
hierObj.subDirs.erase(std::remove_if(hierObj.subDirs.begin(), hierObj.subDirs.end(), ::ToBeRemoved()), hierObj.subDirs.end());
}
private:
template<typename Iterator, typename Function>
friend Function std::for_each(Iterator, Iterator, Function);
void operator()(DirMapping& dirObj)
{
dirObj.setActive(filterProc_.passDirFilter(dirObj.getObjRelativeName().c_str(), NULL)); //subObjMightMatch is always true in this context!
execute(dirObj);
}
const FilterProcess& filterProc_;
};
inline
void formatPair(FolderPairCfg& input)
{
//ensure they end with globalFunctions::FILE_NAME_SEPARATOR and replace macros
input.leftDirectory = FreeFileSync::getFormattedDirectoryName(input.leftDirectory);
input.rightDirectory = FreeFileSync::getFormattedDirectoryName(input.rightDirectory);
}
//#############################################################################################################################
void CompareProcess::startCompareProcess(const std::vector<FolderPairCfg>& directoryPairs,
const CompareVariant cmpVar,
FolderComparison& output)
{
#ifndef __WXDEBUG__
wxLogNull noWxLogs; //hide wxWidgets log messages in release build
#endif
//PERF_START;
//init process: keep at beginning so that all gui elements are initialized properly
statusUpdater->initNewProcess(-1, 0, StatusHandler::PROCESS_SCANNING); //it's not known how many files will be scanned => -1 objects
//format directory pairs: ensure they end with globalFunctions::FILE_NAME_SEPARATOR and replace macros!
std::vector<FolderPairCfg> directoryPairsFormatted = directoryPairs;
std::for_each(directoryPairsFormatted.begin(), directoryPairsFormatted.end(), formatPair);
//-------------------some basic checks:------------------------------------------
//check if folders are valid
foldersAreValidForComparison(directoryPairsFormatted, statusUpdater);
//check if folders have dependencies
{
wxString warningMessage;
if (foldersHaveDependencies(directoryPairsFormatted, warningMessage))
statusUpdater->reportWarning(warningMessage.c_str(), m_warnings.warningDependentFolders);
}
//-------------------end of basic checks------------------------------------------
try
{
FolderComparison output_tmp; //write to output not before END of process!
switch (cmpVar)
{
case CMP_BY_TIME_SIZE:
compareByTimeSize(directoryPairsFormatted, output_tmp);
break;
case CMP_BY_CONTENT:
compareByContent(directoryPairsFormatted, output_tmp);
break;
}
assert (output_tmp.size() == directoryPairsFormatted.size());
for (FolderComparison::iterator j = output_tmp.begin(); j != output_tmp.end(); ++j)
{
const FolderPairCfg& fpCfg = directoryPairsFormatted[j - output_tmp.begin()];
//attention: some filtered directories are still in the comparison result! (see include filter handling!)
if (!fpCfg.filter->isNull()) //let's filter them now... (and remove those that contain excluded elements only)
{
//filters and removes all excluded directories (but keeps those serving as parent folders)
RemoveFilteredDirs(*fpCfg.filter).execute(*j);
}
//set initial sync-direction
class RedetermineCallback : public DeterminationProblem
{
public:
RedetermineCallback(bool& warningSyncDatabase, StatusHandler& statusUpdater) :
warningSyncDatabase_(warningSyncDatabase),
statusUpdater_(statusUpdater) {}
virtual void reportWarning(const wxString& text)
{
statusUpdater_.reportWarning(text, warningSyncDatabase_);
}
private:
bool& warningSyncDatabase_;
StatusHandler& statusUpdater_;
} redetCallback(m_warnings.warningSyncDatabase, *statusUpdater);
FreeFileSync::redetermineSyncDirection(fpCfg.syncConfiguration, *j, &redetCallback);
}
//only if everything was processed correctly output is written to!
//note: output mustn't change during this process to be in sync with GUI grid view!!!
output_tmp.swap(output);
}
catch (const std::exception& e)
{
if (dynamic_cast<const std::bad_alloc*>(&e) != NULL)
statusUpdater->reportFatalError(wxString(_("System out of memory!")) + wxT(" ") + wxString::FromAscii(e.what()));
else
statusUpdater->reportFatalError(wxString::FromAscii(e.what()));
return; //should be obsolete!
}
}
//--------------------assemble conflict descriptions---------------------------
//check for very old dates or dates in the future
wxString getConflictInvalidDate(const Zstring& fileNameFull, const wxLongLong& utcTime)
{
wxString msg = _("File %x has an invalid date!");
msg.Replace(wxT("%x"), wxString(wxT("\"")) + zToWx(fileNameFull) + wxT("\""));
msg += wxString(wxT("\n\n")) + _("Date") + wxT(": ") + utcTimeToLocalString(utcTime, fileNameFull);
return wxString(_("Conflict detected:")) + wxT("\n") + msg;
}
//check for changed files with same modification date
wxString getConflictSameDateDiffSize(const FileMapping& fileObj)
{
//some beautification...
wxString left = wxString(_("Left")) + wxT(": ");
wxString right = wxString(_("Right")) + wxT(": ");
const size_t maxPref = std::max(left.length(), right.length());
left.Pad(maxPref - left.length(), wxT(' '), true);
right.Pad(maxPref - right.length(), wxT(' '), true);
wxString msg = _("Files %x have the same date but a different size!");
msg.Replace(wxT("%x"), wxString(wxT("\"")) + zToWx(fileObj.getRelativeName<LEFT_SIDE>()) + wxT("\""));
msg += wxT("\n\n");
msg += left + wxT("\t") + _("Date") + wxT(": ") + utcTimeToLocalString(fileObj.getLastWriteTime<LEFT_SIDE>(),
fileObj.getFullName<LEFT_SIDE>()) + wxT(" \t") + _("Size") + wxT(": ") + fileObj.getFileSize<LEFT_SIDE>().ToString() + wxT("\n");
msg += right + wxT("\t") + _("Date") + wxT(": ") + utcTimeToLocalString(fileObj.getLastWriteTime<RIGHT_SIDE>(),
fileObj.getFullName<RIGHT_SIDE>()) + wxT(" \t") + _("Size") + wxT(": ") + fileObj.getFileSize<RIGHT_SIDE>().ToString();
return wxString(_("Conflict detected:")) + wxT("\n") + msg;
}
//check for files that have a difference in file modification date below 1 hour when DST check is active
wxString getConflictChangeWithinHour(const FileMapping& fileObj)
{
//some beautification...
wxString left = wxString(_("Left")) + wxT(": ");
wxString right = wxString(_("Right")) + wxT(": ");
const size_t maxPref = std::max(left.length(), right.length());
left.Pad(maxPref - left.length(), wxT(' '), true);
right.Pad(maxPref - right.length(), wxT(' '), true);
wxString msg = _("Files %x have a file time difference of less than 1 hour!\n\nIt's not safe to decide which one is newer due to Daylight Saving Time issues.");
msg += wxString(wxT("\n")) + _("(Note that only FAT/FAT32 drives are affected by this problem!\nIn all other cases you can disable the setting \"ignore 1-hour difference\".)");
msg.Replace(wxT("%x"), wxString(wxT("\"")) + zToWx(fileObj.getRelativeName<LEFT_SIDE>()) + wxT("\""));
msg += wxT("\n\n");
msg += left + wxT("\t") + _("Date") + wxT(": ") + utcTimeToLocalString(fileObj.getLastWriteTime<LEFT_SIDE>(), fileObj.getFullName<LEFT_SIDE>()) + wxT("\n");
msg += right + wxT("\t") + _("Date") + wxT(": ") + utcTimeToLocalString(fileObj.getLastWriteTime<RIGHT_SIDE>(), fileObj.getFullName<RIGHT_SIDE>());
return wxString(_("Conflict detected:")) + wxT("\n") + msg;
}
//-----------------------------------------------------------------------------
inline
bool sameFileTime(const wxLongLong& a, const wxLongLong& b, const unsigned int tolerance)
{
if (a < b)
return b - a <= tolerance;
else
return a - b <= tolerance;
}
void CompareProcess::compareByTimeSize(const std::vector<FolderPairCfg>& directoryPairsFormatted, FolderComparison& output)
{
output.reserve(output.size() + directoryPairsFormatted.size());
//process one folder pair after each other
for (std::vector<FolderPairCfg>::const_iterator pair = directoryPairsFormatted.begin(); pair != directoryPairsFormatted.end(); ++pair)
{
BaseDirMapping newEntry(pair->leftDirectory,
pair->rightDirectory,
pair->filter);
output.push_back(newEntry); //attention: push_back() copies by value!!! performance: append BEFORE writing values into fileCmp!
//do basis scan and retrieve files existing on both sides as "compareCandidates"
std::vector<FileMapping*> compareCandidates;
performBaseComparison(output.back(), compareCandidates);
//PERF_START;
//categorize files that exist on both sides
for (std::vector<FileMapping*>::iterator i = compareCandidates.begin(); i != compareCandidates.end(); ++i)
{
FileMapping* const line = *i;
if (line->getLastWriteTime<LEFT_SIDE>() != line->getLastWriteTime<RIGHT_SIDE>())
{
//number of seconds since Jan 1st 1970 + 1 year (needn't be too precise)
static const long oneYearFromNow = wxGetUTCTime() + 365 * 24 * 3600;
//check for erroneous dates (but only if dates are not (EXACTLY) the same)
if ( line->getLastWriteTime<LEFT_SIDE>() < 0 || //earlier than Jan 1st 1970
line->getLastWriteTime<RIGHT_SIDE>() < 0 || //earlier than Jan 1st 1970
line->getLastWriteTime<LEFT_SIDE>() > oneYearFromNow || //dated more than one year in future
line->getLastWriteTime<RIGHT_SIDE>() > oneYearFromNow) //dated more than one year in future
{
if (line->getLastWriteTime<LEFT_SIDE>() < 0 || line->getLastWriteTime<LEFT_SIDE>() > oneYearFromNow)
line->setCategoryConflict(getConflictInvalidDate(line->getFullName<LEFT_SIDE>(), line->getLastWriteTime<LEFT_SIDE>()));
else
line->setCategoryConflict(getConflictInvalidDate(line->getFullName<RIGHT_SIDE>(), line->getLastWriteTime<RIGHT_SIDE>()));
}
else //from this block on all dates are at least "valid"
{
//last write time may differ by up to 2 seconds (NTFS vs FAT32)
if (sameFileTime(line->getLastWriteTime<LEFT_SIDE>(), line->getLastWriteTime<RIGHT_SIDE>(), fileTimeTolerance))
{
if (line->getFileSize<LEFT_SIDE>() == line->getFileSize<RIGHT_SIDE>())
line->setCategory<FILE_EQUAL>();
else
line->setCategoryConflict(getConflictSameDateDiffSize(*line)); //same date, different filesize
}
else
{
//finally: DST +/- 1-hour check: test if time diff is exactly +/- 1-hour (respecting 2 second FAT precision)
if (ignoreOneHourDifference && sameFileTime(line->getLastWriteTime<LEFT_SIDE>(), line->getLastWriteTime<RIGHT_SIDE>(), 3600 + 2))
{
//date diff < 1 hour is a conflict: it's not safe to determine which file is newer
if (sameFileTime(line->getLastWriteTime<LEFT_SIDE>(), line->getLastWriteTime<RIGHT_SIDE>(), 3600 - 2 - 1))
line->setCategoryConflict(getConflictChangeWithinHour(*line));
else //exact +/- 1-hour detected: treat as equal
{
if (line->getFileSize<LEFT_SIDE>() == line->getFileSize<RIGHT_SIDE>())
line->setCategory<FILE_EQUAL>();
else
line->setCategoryConflict(getConflictSameDateDiffSize(*line)); //same date, different filesize
}
}
else
{
if (line->getLastWriteTime<LEFT_SIDE>() < line->getLastWriteTime<RIGHT_SIDE>())
line->setCategory<FILE_RIGHT_NEWER>();
else
line->setCategory<FILE_LEFT_NEWER>();
}
}
}
}
else //same write time
{
if (line->getFileSize<LEFT_SIDE>() == line->getFileSize<RIGHT_SIDE>())
line->setCategory<FILE_EQUAL>();
else
line->setCategoryConflict(getConflictSameDateDiffSize(*line)); //same date, different filesize
}
}
}
}
wxULongLong getBytesToCompare(const std::vector<FileMapping*>& rowsToCompare)
{
wxULongLong dataTotal;
for (std::vector<FileMapping*>::const_iterator j = rowsToCompare.begin(); j != rowsToCompare.end(); ++j)
dataTotal += (*j)->getFileSize<LEFT_SIDE>(); //left and right filesizes should be the same
return dataTotal * 2;
}
void CompareProcess::compareByContent(const std::vector<FolderPairCfg>& directoryPairsFormatted, FolderComparison& output)
{
//PERF_START;
std::vector<FileMapping*> compareCandidates;
//attention: make sure pointers in "compareCandidates" remain valid!!!
output.reserve(output.size() + directoryPairsFormatted.size());
//process one folder pair after each other
for (std::vector<FolderPairCfg>::const_iterator pair = directoryPairsFormatted.begin(); pair != directoryPairsFormatted.end(); ++pair)
{
BaseDirMapping newEntry(pair->leftDirectory,
pair->rightDirectory,
pair->filter);
output.push_back(newEntry); //attention: push_back() copies by value!!! performance: append BEFORE writing values into fileCmp!
//do basis scan and retrieve candidates for binary comparison (files existing on both sides)
performBaseComparison(output.back(), compareCandidates);
}
//finish categorization...
std::vector<FileMapping*> filesToCompareBytewise;
//content comparison of file content happens AFTER finding corresponding files
//in order to separate into two processes (scanning and comparing)
for (std::vector<FileMapping*>::iterator i = compareCandidates.begin(); i != compareCandidates.end(); ++i)
{
//pre-check: files have different content if they have a different filesize
if ((*i)->getFileSize<LEFT_SIDE>() != (*i)->getFileSize<RIGHT_SIDE>())
(*i)->setCategory<FILE_DIFFERENT>();
else
filesToCompareBytewise.push_back(*i);
}
const size_t objectsTotal = filesToCompareBytewise.size() * 2;
const wxULongLong bytesTotal = getBytesToCompare(filesToCompareBytewise);
statusUpdater->initNewProcess(objectsTotal,
globalFunctions::convertToSigned(bytesTotal),
StatusHandler::PROCESS_COMPARING_CONTENT);
//compare files (that have same size) bytewise...
for (std::vector<FileMapping*>::const_iterator j = filesToCompareBytewise.begin(); j != filesToCompareBytewise.end(); ++j)
{
FileMapping* const gridline = *j;
Zstring statusText = txtComparingContentOfFiles;
statusText.Replace(DefaultStr("%x"), gridline->getRelativeName<LEFT_SIDE>(), false);
statusUpdater->updateStatusText(statusText);
//check files that exist in left and right model but have different content
while (true)
{
//trigger display refresh
statusUpdater->requestUiRefresh();
try
{
if (filesHaveSameContentUpdating(gridline->getFullName<LEFT_SIDE>(),
gridline->getFullName<RIGHT_SIDE>(),
gridline->getFileSize<LEFT_SIDE>() * 2,
statusUpdater))
gridline->setCategory<FILE_EQUAL>();
else
gridline->setCategory<FILE_DIFFERENT>();
statusUpdater->updateProcessedData(2, 0); //processed data is communicated in subfunctions!
break;
}
catch (FileError& error)
{
ErrorHandler::Response rv = statusUpdater->reportError(error.show());
if (rv == ErrorHandler::IGNORE_ERROR)
{
gridline->setCategoryConflict(wxString(_("Conflict detected:")) + wxT("\n") + _("Comparing files by content failed."));
break;
}
else if (rv == ErrorHandler::RETRY)
; //continue with loop
else
throw std::logic_error("Programming Error: Unknown return value!");
}
}
}
}
class MergeSides
{
public:
MergeSides(std::vector<FileMapping*>& appendUndefinedOut) :
appendUndefined(appendUndefinedOut) {}
void execute(const DirContainer& leftSide, const DirContainer& rightSide, HierarchyObject& output)
{
//ATTENTION: HierarchyObject::retrieveById() can only work correctly if the following conditions are fulfilled:
//1. on each level, files are added first, then directories (=> file id < dir id)
//2. when a directory is added, all subdirectories must be added immediately (recursion) before the next dir on this level is added
//3. entries may be deleted but NEVER new ones inserted!!!
//=> this allows for a quasi-binary search by id!
//reserve() fulfills two task here: 1. massive performance improvement! 2. ensure references in appendUndefined remain valid!
output.subFiles.reserve(leftSide.getSubFiles().size() + rightSide.getSubFiles().size()); //assume worst case!
output.subDirs.reserve( leftSide.getSubDirs().size() + rightSide.getSubDirs().size()); //
for (DirContainer::SubFileList::const_iterator i = leftSide.getSubFiles().begin(); i != leftSide.getSubFiles().end(); ++i)
{
DirContainer::SubFileList::const_iterator j = rightSide.getSubFiles().find(i->first);
//find files that exist on left but not on right
if (j == rightSide.getSubFiles().end())
output.addSubFile(i->second.getData(), i->first);
//find files that exist on left and right
else
{
appendUndefined.push_back(
&output.addSubFile(i->second.getData(), i->first, FILE_EQUAL, j->second.getData())); //FILE_EQUAL is just a dummy-value here
}
}
//find files that exist on right but not on left
for (DirContainer::SubFileList::const_iterator j = rightSide.getSubFiles().begin(); j != rightSide.getSubFiles().end(); ++j)
{
if (leftSide.getSubFiles().find(j->first) == leftSide.getSubFiles().end())
output.addSubFile(j->first, j->second.getData());
}
//-----------------------------------------------------------------------------------------------
for (DirContainer::SubDirList::const_iterator i = leftSide.getSubDirs().begin(); i != leftSide.getSubDirs().end(); ++i)
{
DirContainer::SubDirList::const_iterator j = rightSide.getSubDirs().find(i->first);
//find directories that exist on left but not on right
if (j == rightSide.getSubDirs().end())
{
DirMapping& newDirMap = output.addSubDir(true, i->first, false);
fillOneSide<true>(i->second, newDirMap); //recurse into subdirectories
}
else //directories that exist on both sides
{
DirMapping& newDirMap = output.addSubDir(true, i->first, true);
execute(i->second, j->second, newDirMap); //recurse into subdirectories
}
}
//find directories that exist on right but not on left
for (DirContainer::SubDirList::const_iterator j = rightSide.getSubDirs().begin(); j != rightSide.getSubDirs().end(); ++j)
{
if (leftSide.getSubDirs().find(j->first) == leftSide.getSubDirs().end())
{
DirMapping& newDirMap = output.addSubDir(false, j->first, true);
fillOneSide<false>(j->second, newDirMap); //recurse into subdirectories
}
}
}
private:
template <bool leftSide>
void fillOneSide(const DirContainer& dirCont, HierarchyObject& output)
{
//reserve() fulfills two task here: 1. massive performance improvement! 2. ensure references in appendUndefined remain valid!
output.subFiles.reserve(dirCont.getSubFiles().size());
output.subDirs.reserve( dirCont.getSubDirs(). size());
for (DirContainer::SubFileList::const_iterator i = dirCont.getSubFiles().begin(); i != dirCont.getSubFiles().end(); ++i)
{
if (leftSide)
output.addSubFile(i->second.getData(), i->first);
else
output.addSubFile(i->first, i->second.getData());
}
for (DirContainer::SubDirList::const_iterator i = dirCont.getSubDirs().begin(); i != dirCont.getSubDirs().end(); ++i)
{
DirMapping& newDirMap = leftSide ?
output.addSubDir(true, i->first, false) :
output.addSubDir(false, i->first, true);
fillOneSide<leftSide>(i->second, newDirMap); //recurse into subdirectories
}
}
std::vector<FileMapping*>& appendUndefined;
};
void CompareProcess::performBaseComparison(BaseDirMapping& output, std::vector<FileMapping*>& appendUndefined)
{
assert(output.subDirs.empty());
assert(output.subFiles.empty());
//PERF_START;
//scan directories
const DirContainer& directoryLeft = directoryBuffer->getDirectoryDescription(
output.getBaseDir<LEFT_SIDE>(),
output.getFilter());
const DirContainer& directoryRight = directoryBuffer->getDirectoryDescription(
output.getBaseDir<RIGHT_SIDE>(),
output.getFilter());
statusUpdater->updateStatusText(wxToZ(_("Generating file list...")));
statusUpdater->forceUiRefresh(); //keep total number of scanned files up to date
//PERF_STOP;
MergeSides(appendUndefined).execute(directoryLeft, directoryRight, output);
}
|