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
|
#include "comparison.h"
#include "library/globalFunctions.h"
#include <wx/intl.h>
#include "library/globalFunctions.h"
#include <wx/ffile.h>
#include <wx/msgdlg.h>
#include <wx/log.h>
#include "library/multithreading.h"
#include "algorithm.h"
#include <wx/thread.h>
#ifdef FFS_WIN
#include <wx/msw/wrapwin.h> //includes "windows.h"
#endif //FFS_WIN
using namespace FreeFileSync;
class GetAllFilesFull : public FullDetailFileTraverser
{
public:
GetAllFilesFull(DirectoryDescrType& output, Zstring dirThatIsSearched, StatusHandler* handler) :
m_output(output),
directory(dirThatIsSearched),
statusHandler(handler)
{
prefixLength = directory.length();
textScanning = Zstring(_("Scanning:")) + wxT(" \n"); //performance optimization
}
inline
void writeText(const wxChar* text, const int length, wxChar*& currentPos)
{
memcpy(currentPos, text, length * sizeof(wxChar));
currentPos+=length;
}
wxDirTraverseResult GetAllFilesFull::OnFile(const Zstring& fullFileName, const FileInfo& details) //virtual impl.
{
FileDescrLine fileDescr;
fileDescr.fullName = fullFileName;
fileDescr.directory = directory;
fileDescr.relativeName = fullFileName.substr(prefixLength);
fileDescr.lastWriteTimeRaw = details.lastWriteTimeRaw;
fileDescr.fileSize = details.fileSize;
fileDescr.objType = FileDescrLine::TYPE_FILE;
m_output.push_back(fileDescr);
//assemble status message (performance optimized) = textScanning + wxT("\"") + fullFileName + wxT("\"")
const unsigned int statusTextMaxLen = 2000;
wxChar statusText[statusTextMaxLen];
wxChar* position = statusText;
if (textScanning.length() + fullFileName.length() + 2 < statusTextMaxLen) //leave room for 0 terminating char!
{
writeText(textScanning.c_str(), textScanning.length(), position);
writeText(wxT("\""), 1, position);
writeText(fullFileName.c_str(), fullFileName.length(), position);
writeText(wxT("\""), 1, position);
}
*position = 0;
//update UI/commandline status information
statusHandler->updateStatusText(statusText);
//add 1 element to the progress indicator
statusHandler->updateProcessedData(1, 0); //NO performance issue at all
//trigger display refresh
statusHandler->requestUiRefresh();
return wxDIR_CONTINUE;
}
wxDirTraverseResult GetAllFilesFull::OnDir(const Zstring& fullDirName) //virtual impl.
{
#ifdef FFS_WIN
if ( fullDirName.EndsWith(wxT("\\RECYCLER")) ||
fullDirName.EndsWith(wxT("\\System Volume Information")))
return wxDIR_IGNORE;
#endif // FFS_WIN
FileDescrLine fileDescr;
fileDescr.fullName = fullDirName;
fileDescr.directory = directory;
fileDescr.relativeName = fullDirName.substr(prefixLength);
fileDescr.lastWriteTimeRaw = 0; //irrelevant for directories
fileDescr.fileSize = wxULongLong(0); //currently used by getBytesToTransfer
fileDescr.objType = FileDescrLine::TYPE_DIRECTORY;
m_output.push_back(fileDescr);
//assemble status message (performance optimized) = textScanning + wxT("\"") + fullDirName + wxT("\"")
const unsigned int statusTextMaxLen = 2000;
wxChar statusText[statusTextMaxLen];
wxChar* position = statusText;
if (textScanning.length() + fullDirName.length() + 2 < statusTextMaxLen) //leave room for 0 terminating char!
{
writeText(textScanning.c_str(), textScanning.length(), position);
writeText(wxT("\""), 1, position);
writeText(fullDirName.c_str(), fullDirName.length(), position);
writeText(wxT("\""), 1, position);
}
*position = 0;
//update UI/commandline status information
statusHandler->updateStatusText(statusText);
//add 1 element to the progress indicator
statusHandler->updateProcessedData(1, 0); //NO performance issue at all
//trigger display refresh
statusHandler->requestUiRefresh();
return wxDIR_CONTINUE;
}
wxDirTraverseResult GetAllFilesFull::OnError(const Zstring& errorText) //virtual impl.
{
while (true)
{
ErrorHandler::Response rv = statusHandler->reportError(errorText);
if (rv == ErrorHandler::IGNORE_ERROR)
return wxDIR_CONTINUE;
else if (rv == ErrorHandler::RETRY)
; //I have to admit "retry" is a bit of a fake here... at least the user has opportunity to abort!
else
{
assert (false);
return wxDIR_CONTINUE;
}
}
return wxDIR_CONTINUE;
}
private:
DirectoryDescrType& m_output;
Zstring directory;
int prefixLength;
Zstring textScanning;
StatusHandler* statusHandler;
};
struct DescrBufferLine
{
Zstring directoryName;
DirectoryDescrType* directoryDesc;
bool operator < (const DescrBufferLine& b) const
{
#ifdef FFS_WIN //Windows does NOT distinguish between upper/lower-case
return (directoryName.CmpNoCase(b.directoryName) < 0);
#elif defined FFS_LINUX //Linux DOES distinguish between upper/lower-case
return (directoryName.Cmp(b.directoryName) < 0);
#endif
}
};
class FreeFileSync::DirectoryDescrBuffer //buffer multiple scans of the same directories
{
public:
DirectoryDescrBuffer(const bool traverseSymbolicLinks, StatusHandler* statusUpdater) :
m_traverseSymbolicLinks(traverseSymbolicLinks),
m_statusUpdater(statusUpdater) {}
~DirectoryDescrBuffer()
{
//clean up
for (std::set<DescrBufferLine>::iterator i = buffer.begin(); i != buffer.end(); ++i)
delete i->directoryDesc;
}
DirectoryDescrType* getDirectoryDescription(const Zstring& directoryFormatted)
{
DescrBufferLine bufferEntry;
bufferEntry.directoryName = directoryFormatted;
std::set<DescrBufferLine>::iterator entryFound = buffer.find(bufferEntry);
if (entryFound != buffer.end())
{
//entry found in buffer; return
return entryFound->directoryDesc;
}
else
{
//entry not found; create new one
bufferEntry.directoryDesc = new DirectoryDescrType;
buffer.insert(bufferEntry); //exception safety: insert into buffer right after creation!
bufferEntry.directoryDesc->reserve(400000); //reserve space for up to 400000 files to avoid too many vector reallocations
//get all files and folders from directoryFormatted (and subdirectories)
GetAllFilesFull traverser(*bufferEntry.directoryDesc, directoryFormatted, m_statusUpdater); //exceptions may be thrown!
traverseInDetail(directoryFormatted, m_traverseSymbolicLinks, &traverser);
return bufferEntry.directoryDesc;
}
}
private:
std::set<DescrBufferLine> buffer;
const bool m_traverseSymbolicLinks;
StatusHandler* m_statusUpdater;
};
bool foldersAreValidForComparison(const std::vector<FolderPair>& folderPairs, wxString& errorMessage)
{
errorMessage.Clear();
for (std::vector<FolderPair>::const_iterator i = folderPairs.begin(); i != folderPairs.end(); ++i)
{
const Zstring leftFolderName = getFormattedDirectoryName(i->leftDirectory);
const Zstring rightFolderName = getFormattedDirectoryName(i->rightDirectory);
//check if folder name is empty
if (leftFolderName.empty() || rightFolderName.empty())
{
errorMessage = _("Please fill all empty directory fields.");
return false;
}
//check if folder exists
if (!wxDirExists(leftFolderName))
{
errorMessage = wxString(_("Directory does not exist:")) + wxT(" \"") + leftFolderName + wxT("\"");
return false;
}
if (!wxDirExists(rightFolderName))
{
errorMessage = wxString(_("Directory does not exist:")) + wxT(" \"") + rightFolderName + wxT("\"");
return false;
}
}
return true;
}
bool dependencyExists(const std::vector<Zstring>& folders, const Zstring& newFolder, wxString& warningMessage)
{
warningMessage.Clear();
for (std::vector<Zstring>::const_iterator i = folders.begin(); i != folders.end(); ++i)
if (newFolder.StartsWith(*i) || i->StartsWith(newFolder))
{
warningMessage = wxString(_("Directories are dependent! Be careful when setting up synchronization rules:\n")) +
wxT("\"") + *i + wxT("\",\n") +
wxT("\"") + newFolder + wxT("\"");
return true;
}
return false;
}
bool foldersHaveDependencies(const std::vector<FolderPair>& folderPairs, wxString& warningMessage)
{
warningMessage.Clear();
std::vector<Zstring> folders;
for (std::vector<FolderPair>::const_iterator i = folderPairs.begin(); i != folderPairs.end(); ++i)
{
const Zstring leftFolderName = getFormattedDirectoryName(i->leftDirectory);
const Zstring rightFolderName = getFormattedDirectoryName(i->rightDirectory);
if (dependencyExists(folders, leftFolderName, warningMessage))
return true;
folders.push_back(leftFolderName);
if (dependencyExists(folders, rightFolderName, warningMessage))
return true;
folders.push_back(rightFolderName);
}
return false;
}
CompareProcess::CompareProcess(const bool traverseSymLinks,
const bool handleDstOnFat32Drives,
bool& warningDependentFolders,
StatusHandler* handler) :
traverseSymbolicLinks(traverseSymLinks),
handleDstOnFat32(handleDstOnFat32Drives),
m_warningDependentFolders(warningDependentFolders),
statusUpdater(handler),
txtComparingContentOfFiles(_("Comparing content of files %x"))
{
descriptionBuffer = new DirectoryDescrBuffer(traverseSymLinks, handler);
txtComparingContentOfFiles.Replace(wxT("%x"), wxT("\n\"%x\""), false);
}
CompareProcess::~CompareProcess()
{
delete descriptionBuffer;
}
struct MemoryAllocator
{
MemoryAllocator()
{
buffer1 = new unsigned char[bufferSize];
buffer2 = new unsigned char[bufferSize];
}
~MemoryAllocator()
{
delete [] buffer1;
delete [] buffer2;
}
static const unsigned int bufferSize = 1024 * 512; //512 kb seems to be the perfect buffer size
unsigned char* buffer1;
unsigned char* buffer2;
};
bool filesHaveSameContent(const Zstring& filename1, const Zstring& filename2)
{
static MemoryAllocator memory;
wxFFile file1(filename1.c_str(), wxT("rb"));
if (!file1.IsOpened())
throw FileError(Zstring(_("Error reading file:")) + wxT(" \"") + filename1 + wxT("\""));
wxFFile file2(filename2.c_str(), wxT("rb"));
if (!file2.IsOpened()) //NO cleanup necessary for (wxFFile) file1
throw FileError(Zstring(_("Error reading file:")) + wxT(" \"") + filename2 + wxT("\""));
do
{
size_t length1 = file1.Read(memory.buffer1, memory.bufferSize);
if (file1.Error()) throw FileError(Zstring(_("Error reading file:")) + wxT(" \"") + filename1 + wxT("\""));
size_t length2 = file2.Read(memory.buffer2, memory.bufferSize);
if (file2.Error()) throw FileError(Zstring(_("Error reading file:")) + wxT(" \"") + filename2 + wxT("\""));
if (length1 != length2 || memcmp(memory.buffer1, memory.buffer2, length1) != 0)
return false;
}
while (!file1.Eof());
if (!file2.Eof())
return false;
return true;
}
//handle execution of a method while updating the UI
class UpdateWhileComparing : public UpdateWhileExecuting
{
public:
UpdateWhileComparing() {}
~UpdateWhileComparing() {}
Zstring file1;
Zstring file2;
bool success;
Zstring errorMessage;
bool sameContent;
private:
void longRunner() //virtual method implementation
{
try
{
sameContent = filesHaveSameContent(file1, file2);
success = true;
}
catch (FileError& error)
{
success = false;
errorMessage = error.show();
}
}
};
bool filesHaveSameContentMultithreaded(const Zstring& filename1, const Zstring& filename2, StatusHandler* updateClass)
{
static UpdateWhileComparing cmpAndUpdate; //single instantiation: thread enters wait phase after each execution
cmpAndUpdate.waitUntilReady();
//longRunner is called from thread, but no mutex needed here, since thread is in waiting state!
cmpAndUpdate.file1 = filename1;
cmpAndUpdate.file2 = filename2;
cmpAndUpdate.execute(updateClass);
//no mutex needed here since longRunner is finished
if (!cmpAndUpdate.success)
throw FileError(cmpAndUpdate.errorMessage);
return cmpAndUpdate.sameContent;
}
void calcTotalDataForCompare(int& objectsTotal, double& dataTotal, const FileCompareResult& grid, const std::set<int>& rowsToCompare)
{
dataTotal = 0;
for (std::set<int>::iterator i = rowsToCompare.begin(); i != rowsToCompare.end(); ++i)
{
const FileCompareLine& gridline = grid[*i];
dataTotal+= gridline.fileDescrLeft.fileSize.ToDouble();
dataTotal+= gridline.fileDescrRight.fileSize.ToDouble();
}
objectsTotal = rowsToCompare.size() * 2;
}
inline
bool sameFileTime(const time_t a, const time_t b, const time_t tolerance)
{
if (a < b)
return b - a <= tolerance;
else
return a - b <= tolerance;
}
void CompareProcess::startCompareProcess(const std::vector<FolderPair>& directoryPairs,
const CompareVariant cmpVar,
FileCompareResult& output) throw(AbortThisProcess)
{
#ifndef __WXDEBUG__
wxLogNull noWxLogs; //hide wxWidgets log messages in release build
#endif
//format directory pairs
std::vector<FolderPair> directoryPairsFormatted;
for (std::vector<FolderPair>::const_iterator i = directoryPairs.begin(); i != directoryPairs.end(); ++i)
{
FolderPair newEntry;
newEntry.leftDirectory = FreeFileSync::getFormattedDirectoryName(i->leftDirectory);
newEntry.rightDirectory = FreeFileSync::getFormattedDirectoryName(i->rightDirectory);
directoryPairsFormatted.push_back(newEntry);
}
//some basic checks:
//check if folders are valid
wxString errorMessage;
if (!foldersAreValidForComparison(directoryPairsFormatted, errorMessage))
{
statusUpdater->reportFatalError(errorMessage.c_str());
return; //should be obsolete!
}
//check if folders have dependencies
if (m_warningDependentFolders) //test if check should be executed
{
wxString warningMessage;
if (foldersHaveDependencies(directoryPairsFormatted, warningMessage))
{
bool dontShowAgain = false;
statusUpdater->reportWarning(warningMessage.c_str(),
dontShowAgain);
m_warningDependentFolders = !dontShowAgain;
}
}
try
{
FileCompareResult output_tmp; //write to output not before END of process!
if (cmpVar == CMP_BY_TIME_SIZE)
compareByTimeSize(directoryPairsFormatted, output_tmp);
else if (cmpVar == CMP_BY_CONTENT)
compareByContent(directoryPairsFormatted, output_tmp);
else assert(false);
//only if everything was processed correctly output is written to! output mustn't change to be in sync with GUI grid view!!!
output_tmp.swap(output);
}
catch (const RuntimeException& theException)
{
statusUpdater->reportFatalError(theException.show().c_str());
return; //should be obsolete!
}
catch (std::bad_alloc& e)
{
statusUpdater->reportFatalError((wxString(_("System out of memory!")) + wxT(" ") + wxString::From8BitData(e.what())).c_str());
return; //should be obsolete!
}
}
void CompareProcess::compareByTimeSize(const std::vector<FolderPair>& directoryPairsFormatted, FileCompareResult& output)
{
//inform about the total amount of data that will be processed from now on
statusUpdater->initNewProcess(-1, 0, StatusHandler::PROCESS_SCANNING); //it's not known how many files will be scanned => -1 objects
//process one folder pair after each other
unsigned tableSizeOld = 0;
for (std::vector<FolderPair>::const_iterator pair = directoryPairsFormatted.begin(); pair != directoryPairsFormatted.end(); ++pair)
{
//do basis scan: only result lines of type FILE_UNDEFINED (files that exist on both sides) need to be determined after this call
this->performBaseComparison(*pair, output);
//add some tolerance if one of the folders is FAT/FAT32
time_t tolerance = 0;
#ifdef FFS_WIN
if (handleDstOnFat32 && (isFatDrive(pair->leftDirectory) || isFatDrive(pair->rightDirectory)))
tolerance = FILE_TIME_PRECISION + 3600; //tolerate filetime diff <= 1 h to handle daylight saving time issues
else
tolerance = FILE_TIME_PRECISION;
#elif defined FFS_LINUX
tolerance = FILE_TIME_PRECISION;
#endif
//categorize files that exist on both sides
for (FileCompareResult::iterator i = output.begin() + tableSizeOld; i != output.end(); ++i)
{
if (i->cmpResult == FILE_UNDEFINED)
{
//last write time may differ by up to 2 seconds (NTFS vs FAT32)
if (sameFileTime(i->fileDescrLeft.lastWriteTimeRaw, i->fileDescrRight.lastWriteTimeRaw, tolerance))
{
if (i->fileDescrLeft.fileSize == i->fileDescrRight.fileSize)
i->cmpResult = FILE_EQUAL;
else
i->cmpResult = FILE_DIFFERENT;
}
else
{
if (i->fileDescrLeft.lastWriteTimeRaw < i->fileDescrRight.lastWriteTimeRaw)
i->cmpResult = FILE_RIGHT_NEWER;
else
i->cmpResult = FILE_LEFT_NEWER;
}
}
}
tableSizeOld = output.size();
}
}
void CompareProcess::compareByContent(const std::vector<FolderPair>& directoryPairsFormatted, FileCompareResult& output)
{
//inform about the total amount of data that will be processed from now on
statusUpdater->initNewProcess(-1, 0, StatusHandler::PROCESS_SCANNING); //it's not known how many files will be scanned => -1 objects
//process one folder pair after each other
for (std::vector<FolderPair>::const_iterator pair = directoryPairsFormatted.begin(); pair != directoryPairsFormatted.end(); ++pair)
{
//do basis scan: only result lines of type FILE_UNDEFINED (files that exist on both sides) need to be determined after this call
this->performBaseComparison(*pair, output);
}
std::set<int> rowsToCompareBytewise; //content comparison of file content happens AFTER finding corresponding files
//in order to separate into two processes (scanning and comparing)
//pre-check: files have different content if they have a different filesize
for (FileCompareResult::iterator i = output.begin(); i != output.end(); ++i)
{
if (i->cmpResult == FILE_UNDEFINED)
{
if (i->fileDescrLeft.fileSize != i->fileDescrRight.fileSize)
i->cmpResult = FILE_DIFFERENT;
else
rowsToCompareBytewise.insert(i - output.begin());
}
}
int objectsTotal = 0;
double dataTotal = 0;
calcTotalDataForCompare(objectsTotal, dataTotal, output, rowsToCompareBytewise);
statusUpdater->initNewProcess(objectsTotal, dataTotal, StatusHandler::PROCESS_COMPARING_CONTENT);
std::set<int> rowsToDelete; //if errors occur during file access and user skips, these rows need to be deleted from result
//compare files (that have same size) bytewise...
for (std::set<int>::iterator i = rowsToCompareBytewise.begin(); i != rowsToCompareBytewise.end(); ++i)
{
FileCompareLine& gridline = output[*i];
Zstring statusText = txtComparingContentOfFiles;
statusText.Replace(wxT("%x"), gridline.fileDescrLeft.relativeName, 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 (filesHaveSameContentMultithreaded(gridline.fileDescrLeft.fullName, gridline.fileDescrRight.fullName, statusUpdater))
gridline.cmpResult = FILE_EQUAL;
else
gridline.cmpResult = FILE_DIFFERENT;
statusUpdater->updateProcessedData(2, (gridline.fileDescrLeft.fileSize * 2).ToDouble());
break;
}
catch (FileError& error)
{
ErrorHandler::Response rv = statusUpdater->reportError(error.show());
if (rv == ErrorHandler::IGNORE_ERROR)
{
rowsToDelete.insert(*i);
break;
}
else if (rv == ErrorHandler::RETRY)
; //continue with loop
else
assert (false);
}
}
}
//delete invalid rows that have no valid cmpResult
if (rowsToDelete.size() > 0)
removeRowsFromVector(output, rowsToDelete);
}
class ThreadSorting : public wxThread
{
public:
ThreadSorting(DirectoryDescrType* directory) :
wxThread(wxTHREAD_JOINABLE),
m_directory(directory)
{
if (Create() != wxTHREAD_NO_ERROR)
throw RuntimeException(wxString(wxT("Error creating thread for sorting!")));
}
~ThreadSorting() {}
ExitCode Entry()
{
std::sort(m_directory->begin(), m_directory->end());
return 0;
}
private:
DirectoryDescrType* m_directory;
};
void CompareProcess::performBaseComparison(const FolderPair& pair, FileCompareResult& output)
{
//PERF_START;
//retrieve sets of files (with description data)
DirectoryDescrType* directoryLeft = descriptionBuffer->getDirectoryDescription(pair.leftDirectory);
DirectoryDescrType* directoryRight = descriptionBuffer->getDirectoryDescription(pair.rightDirectory);
statusUpdater->updateStatusText(_("Generating file list..."));
statusUpdater->forceUiRefresh(); //keep total number of scanned files up to date
//PERF_STOP;
//we use binary search when comparing the directory structures: so sort() first
if (wxThread::GetCPUCount() >= 2) //do it the multithreaded way:
{
//no synchronization (multithreading) needed here: directoryLeft and directoryRight are disjunct
//reference counting Zstring also shouldn't be an issue, as no strings are deleted during std::sort()
std::auto_ptr<ThreadSorting> sortLeft(new ThreadSorting(directoryLeft));
std::auto_ptr<ThreadSorting> sortRight(new ThreadSorting(directoryRight));
if (sortLeft->Run() != wxTHREAD_NO_ERROR)
throw RuntimeException(wxString(wxT("Error starting thread for sorting!")));
if (directoryLeft != directoryRight) //attention: might point to the same vector because of buffer!
{
if (sortRight->Run() != wxTHREAD_NO_ERROR)
throw RuntimeException(wxString(wxT("Error starting thread for sorting!")));
if (sortRight->Wait() != 0)
throw RuntimeException(wxString(wxT("Error waiting for thread (sorting)!")));
}
if (sortLeft->Wait() != 0)
throw RuntimeException(wxString(wxT("Error waiting for thread (sorting)!")));
}
else //single threaded
{
std::sort(directoryLeft->begin(), directoryLeft->end());
if (directoryLeft != directoryRight) //attention: might point to the same vector because of buffer!
std::sort(directoryRight->begin(), directoryRight->end());
}
//PERF_STOP;
//reserve some space to avoid too many vector reallocations
output.reserve(output.size() + unsigned(std::max(directoryLeft->size(), directoryRight->size()) * 1.2));
//begin base comparison
FileCompareLine newline;
DirectoryDescrType::iterator j;
for (DirectoryDescrType::const_iterator i = directoryLeft->begin(); i != directoryLeft->end(); ++i)
{ //find files/folders that exist in left file tree but not in right one
if ((j = custom_binary_search(directoryRight->begin(), directoryRight->end(), *i)) == directoryRight->end())
{
newline.fileDescrLeft = *i;
newline.fileDescrRight = FileDescrLine();
newline.fileDescrRight.directory = pair.rightDirectory;
newline.cmpResult = FILE_LEFT_SIDE_ONLY;
output.push_back(newline);
}
//find files/folders that exist on left and right side
else
{
const FileDescrLine::ObjectType typeLeft = i->objType;
const FileDescrLine::ObjectType typeRight = j->objType;
//files...
if (typeLeft == FileDescrLine::TYPE_FILE && typeRight == FileDescrLine::TYPE_FILE)
{
newline.fileDescrLeft = *i;
newline.fileDescrRight = *j;
newline.cmpResult = FILE_UNDEFINED; //not yet determined!
output.push_back(newline);
}
//directories...
else if (typeLeft == FileDescrLine::TYPE_DIRECTORY && typeRight == FileDescrLine::TYPE_DIRECTORY)
{
newline.fileDescrLeft = *i;
newline.fileDescrRight = *j;
newline.cmpResult = FILE_EQUAL;
output.push_back(newline);
}
//if we have a nameclash between a file and a directory: split into two separate rows
else
{
assert (typeLeft != typeRight);
newline.fileDescrLeft = *i;
newline.fileDescrRight = FileDescrLine();
newline.fileDescrRight.directory = pair.rightDirectory;
newline.cmpResult = FILE_LEFT_SIDE_ONLY;
output.push_back(newline);
newline.fileDescrLeft = FileDescrLine();
newline.fileDescrLeft.directory = pair.leftDirectory;
newline.fileDescrRight = *j;
newline.cmpResult = FILE_RIGHT_SIDE_ONLY;
output.push_back(newline);
}
}
}
for (DirectoryDescrType::const_iterator j = directoryRight->begin(); j != directoryRight->end(); ++j)
{
//find files/folders that exist in right file model but not in left model
if (custom_binary_search(directoryLeft->begin(), directoryLeft->end(), *j) == directoryLeft->end())
{
newline.fileDescrLeft = FileDescrLine();
newline.fileDescrLeft.directory = pair.leftDirectory; //directory info is needed when creating new directories
newline.fileDescrRight = *j;
newline.cmpResult = FILE_RIGHT_SIDE_ONLY;
output.push_back(newline);
}
}
//PERF_STOP
}
|