forked from Parchive/par2cmdline
-
Notifications
You must be signed in to change notification settings - Fork 0
/
par1repairer.cpp
1481 lines (1217 loc) · 39.6 KB
/
par1repairer.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
// This file is part of par2cmdline (a PAR 2.0 compatible file verification and
// repair tool). See http://parchive.sourceforge.net for details of PAR 2.0.
//
// Copyright (c) 2003 Peter Brian Clements
//
// par2cmdline 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.
//
// par2cmdline 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#include "par2cmdline.h"
#ifdef _MSC_VER
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif
#endif
static u32 smartpar11 = 0x03000101;
Par1Repairer::Par1Repairer(void)
{
filelist = 0;
filelistsize = 0;
blocksize = 0;
completefilecount = 0;
renamedfilecount = 0;
damagedfilecount = 0;
missingfilecount = 0;
inputbuffer = 0;
outputbuffer = 0;
noiselevel = CommandLine::nlNormal;
}
Par1Repairer::~Par1Repairer(void)
{
delete [] (u8*)inputbuffer;
delete [] (u8*)outputbuffer;
map<u32,DataBlock*>::iterator i = recoveryblocks.begin();
while (i != recoveryblocks.end())
{
DataBlock *datablock = i->second;
delete datablock;
++i;
}
vector<Par1RepairerSourceFile*>::iterator sourceiterator = sourcefiles.begin();
while (sourceiterator != sourcefiles.end())
{
Par1RepairerSourceFile *sourcefile = *sourceiterator;
delete sourcefile;
++sourceiterator;
}
sourceiterator = extrafiles.begin();
while (sourceiterator != extrafiles.end())
{
Par1RepairerSourceFile *sourcefile = *sourceiterator;
delete sourcefile;
++sourceiterator;
}
delete [] filelist;
}
Result Par1Repairer::Process(const CommandLine &commandline, bool dorepair)
{
// How noisy should we be
noiselevel = commandline.GetNoiseLevel();
// do we want to purge par files on success ?
bool purgefiles = commandline.GetPurgeFiles();
// Get filesnames from the command line
string par1filename = commandline.GetParFilename();
const list<CommandLine::ExtraFile> &extrafiles = commandline.GetExtraFiles();
// Determine the searchpath from the location of the main PAR file
string name;
DiskFile::SplitFilename(par1filename, searchpath, name);
// Load the main PAR file
if (!LoadRecoveryFile(searchpath + name))
return eLogicError;
// Load other PAR files related to the main PAR file
if (!LoadOtherRecoveryFiles(par1filename))
return eLogicError;
// Load any extra PAR files specified on the command line
if (!LoadExtraRecoveryFiles(extrafiles))
return eLogicError;
if (noiselevel > CommandLine::nlQuiet)
cout << endl << "Verifying source files:" << endl << endl;
// Check for the existence of and verify each of the source files
if (!VerifySourceFiles())
return eFileIOError;
if (completefilecount<sourcefiles.size())
{
if (noiselevel > CommandLine::nlQuiet)
cout << endl << "Scanning extra files:" << endl << endl;
// Check any other files specified on the command line to see if they are
// actually copies of the source files that have the wrong filename
if (!VerifyExtraFiles(extrafiles))
return eLogicError;
}
// Find out how much data we have found
UpdateVerificationResults();
if (noiselevel > CommandLine::nlSilent)
cout << endl;
// Check the verification results and report the details
if (!CheckVerificationResults())
return eRepairNotPossible;
// Are any of the files incomplete
if (completefilecount<sourcefiles.size())
{
// Do we want to carry out a repair
if (dorepair)
{
if (noiselevel > CommandLine::nlSilent)
cout << endl;
// Rename any damaged or missnamed target files.
if (!RenameTargetFiles())
return eFileIOError;
// Are we still missing any files
if (completefilecount<sourcefiles.size())
{
// Work out which files are being repaired, create them, and allocate
// target DataBlocks to them, and remember them for later verification.
if (!CreateTargetFiles())
return eFileIOError;
// Work out which data blocks are available, which need to be recreated,
// and compute the appropriate Reed Solomon matrix.
if (!ComputeRSmatrix())
{
// Delete all of the partly reconstructed files
DeleteIncompleteTargetFiles();
return eFileIOError;
}
// Allocate memory buffers for reading and writing data to disk.
if (!AllocateBuffers(commandline.GetMemoryLimit()))
{
// Delete all of the partly reconstructed files
DeleteIncompleteTargetFiles();
return eMemoryError;
}
if (noiselevel > CommandLine::nlSilent)
cout << endl;
// Set the total amount of data to be processed.
progress = 0;
totaldata = blocksize * sourcefiles.size() * verifylist.size();
// Start at an offset of 0 within a block.
u64 blockoffset = 0;
while (blockoffset < blocksize) // Continue until the end of the block.
{
// Work out how much data to process this time.
size_t blocklength = (size_t)min((u64)chunksize, blocksize-blockoffset);
// Read source data, process it through the RS matrix and write it to disk.
if (!ProcessData(blockoffset, blocklength))
{
// Delete all of the partly reconstructed files
DeleteIncompleteTargetFiles();
return eFileIOError;
}
// Advance to the need offset within each block
blockoffset += blocklength;
}
if (noiselevel > CommandLine::nlSilent)
cout << endl << "Verifying repaired files:" << endl << endl;
// Verify that all of the reconstructed target files are now correct
if (!VerifyTargetFiles())
{
// Delete all of the partly reconstructed files
DeleteIncompleteTargetFiles();
return eFileIOError;
}
}
// Are all of the target files now complete?
if (completefilecount<sourcefiles.size())
{
cerr << "Repair Failed." << endl;
return eRepairFailed;
}
else
{
if (noiselevel > CommandLine::nlSilent)
cout << endl << "Repair complete." << endl;
}
}
else
{
return eRepairPossible;
}
}
if (purgefiles == true)
{
RemoveBackupFiles();
RemoveParFiles();
}
return eSuccess;
}
bool Par1Repairer::LoadRecoveryFile(string filename)
{
// Skip the file if it has already been processed
if (diskfilemap.Find(filename) != 0)
{
return true;
}
DiskFile *diskfile = new DiskFile;
// Open the file
if (!diskfile->Open(filename))
{
// If we could not open the file, ignore the error and
// proceed to the next file
delete diskfile;
return true;
}
if (noiselevel > CommandLine::nlSilent)
{
string path;
string name;
DiskFile::SplitFilename(filename, path, name);
cout << "Loading \"" << name << "\"." << endl;
}
parlist.push_back(filename);
bool havevolume = false;
u32 volumenumber = 0;
// How big is the file
u64 filesize = diskfile->FileSize();
if (filesize >= sizeof(PAR1FILEHEADER))
{
// Allocate a buffer to read data into
size_t buffersize = (size_t)min((u64)1048576, filesize);
u8 *buffer = new u8[buffersize];
do
{
PAR1FILEHEADER fileheader;
if (!diskfile->Read(0, &fileheader, sizeof(fileheader)))
break;
// Is this really a PAR file?
if (fileheader.magic != par1_magic)
break;
// Is the version number correct?
if (fileheader.fileversion != 0x00010000)
break;
ignore16kfilehash = (fileheader.programversion == smartpar11);
// Prepare to carry out MD5 Hash check of the Control Hash
MD5Context context;
u64 offset = offsetof(PAR1FILEHEADER, sethash);
// Process until the end of the file is reached
while (offset < filesize)
{
// How much data should we read?
size_t want = (size_t)min((u64)buffersize, filesize-offset);
if (!diskfile->Read(offset, buffer, want))
break;
context.Update(buffer, want);
offset += want;
}
// Did we read the whole file
if (offset < filesize)
break;
// Compute the hash value
MD5Hash hash;
context.Final(hash);
// Is it correct?
if (hash != fileheader.controlhash)
break;
// Check that the volume number is ok
if (fileheader.volumenumber >= 256)
break;
// Are there any files?
if (fileheader.numberoffiles == 0 ||
fileheader.filelistoffset < sizeof(PAR1FILEHEADER) ||
fileheader.filelistsize == 0)
break;
// Verify that the file list and data offsets are ok
if ((fileheader.filelistoffset + fileheader.filelistsize > filesize)
||
(fileheader.datasize && (fileheader.dataoffset < sizeof(fileheader) || fileheader.dataoffset + fileheader.datasize > filesize))
||
(fileheader.datasize && ((fileheader.filelistoffset <= fileheader.dataoffset && fileheader.dataoffset < fileheader.filelistoffset+fileheader.filelistsize) || (fileheader.dataoffset <= fileheader.filelistoffset && fileheader.filelistoffset < fileheader.dataoffset + fileheader.datasize))))
break;
// Check the size of the file list
if (fileheader.filelistsize > 200000)
break;
// If we already have a copy of the file list, make sure this one has the same size
if (filelist != 0 && filelistsize != fileheader.filelistsize)
break;
// Allocate a buffer to hold a copy of the file list
unsigned char *temp = new unsigned char[(size_t)fileheader.filelistsize];
// Read the file list into the buffer
if (!diskfile->Read(fileheader.filelistoffset, temp, (size_t)fileheader.filelistsize))
{
delete [] temp;
break;
}
// If we already have a copy of the file list, make sure this copy is identical
if (filelist != 0)
{
bool match = (0 == memcmp(filelist, temp, filelistsize));
delete [] temp;
if (!match)
break;
}
else
{
// Prepare to scan the file list
unsigned char *current = temp;
size_t remaining = (size_t)fileheader.filelistsize;
unsigned int fileindex = 0;
// Allocate a buffer to copy each file entry into so that
// all fields will be correctly aligned in memory.
PAR1FILEENTRY *fileentry = (PAR1FILEENTRY*)new u64[(remaining + sizeof(u64)-1)/sizeof(u64)];
// Process until we run out of files or data
while (remaining > 0 && fileindex < fileheader.numberoffiles)
{
// Copy fixed portion of file entry
memcpy((void*)fileentry, (void*)current, sizeof(PAR1FILEENTRY));
// Is there enough data remaining
if (remaining < sizeof(fileentry->entrysize) ||
remaining < fileentry->entrysize)
break;
// Check the length of the filename
if (fileentry->entrysize <= sizeof(PAR1FILEENTRY))
break;
// Check the file size
if (blocksize < fileentry->filesize)
blocksize = fileentry->filesize;
// Copy whole of file entry
memcpy((void*)fileentry, (void*)current, (size_t)(u64)fileentry->entrysize);
// Create source file and add it to the appropriate list
Par1RepairerSourceFile *sourcefile = new Par1RepairerSourceFile(fileentry, searchpath);
if (fileentry->status & INPARITYVOLUME)
{
sourcefiles.push_back(sourcefile);
}
else
{
extrafiles.push_back(sourcefile);
}
remaining -= (size_t)fileentry->entrysize;
current += (size_t)fileentry->entrysize;
fileindex++;
}
delete [] (u64*)fileentry;
// Did we find the correct number of files
if (fileindex < fileheader.numberoffiles)
{
vector<Par1RepairerSourceFile*>::iterator i = sourcefiles.begin();
while (i != sourcefiles.end())
{
Par1RepairerSourceFile *sourcefile = *i;
delete sourcefile;
++i;
}
sourcefiles.clear();
i = extrafiles.begin();
while (i != extrafiles.end())
{
Par1RepairerSourceFile *sourcefile = *i;
delete sourcefile;
++i;
}
extrafiles.clear();
delete [] temp;
break;
}
filelist = temp;
filelistsize = (u32)fileheader.filelistsize;
}
// Is this a recovery volume?
if (fileheader.volumenumber > 0)
{
// Make sure there is data and that it is the correct size
if (fileheader.dataoffset == 0 || fileheader.datasize != blocksize)
break;
// What volume number is this?
volumenumber = (u32)(fileheader.volumenumber - 1);
// Do we already have this volume?
if (recoveryblocks.find(volumenumber) == recoveryblocks.end())
{
// Create a data block
DataBlock *datablock = new DataBlock;
datablock->SetLength(blocksize);
datablock->SetLocation(diskfile, fileheader.dataoffset);
// Store it in the map
recoveryblocks.insert(pair<u32, DataBlock*>(volumenumber, datablock));
havevolume = true;
}
}
} while (false);
delete [] buffer;
}
// We have finished with the file for now
diskfile->Close();
if (noiselevel > CommandLine::nlQuiet)
{
if (havevolume)
{
cout << "Loaded recovery volume " << volumenumber << endl;
}
else
{
cout << "No new recovery volumes found" << endl;
}
}
// Remember that the file was processed
bool success = diskfilemap.Insert(diskfile);
assert(success);
return true;
}
bool Par1Repairer::LoadOtherRecoveryFiles(string filename)
{
// Split the original PAR filename into path and name parts
string path;
string name;
DiskFile::SplitFilename(filename, path, name);
// Find the file extension
string::size_type where = name.find_last_of('.');
if (where != string::npos)
{
// remove it
name = name.substr(0, where);
}
// Search for additional PAR files
string wildcard = name + ".???";
list<string> *files = DiskFile::FindFiles(path, wildcard, false);
for (list<string>::const_iterator s=files->begin(); s!=files->end(); ++s)
{
string filename = *s;
// Find the file extension
where = filename.find_last_of('.');
if (where != string::npos)
{
string tail = filename.substr(where+1);
// Check the the file extension is the correct form
if ((tail[0] == 'P' || tail[0] == 'p') &&
(
((tail[1] == 'A' || tail[1] == 'a') && (tail[2] == 'R' || tail[2] == 'r'))
||
(isdigit(tail[1]) && isdigit(tail[2]))
))
{
LoadRecoveryFile(filename);
}
}
}
delete files;
return true;
}
// Load packets from any other PAR files whose names are given on the command line
bool Par1Repairer::LoadExtraRecoveryFiles(const list<CommandLine::ExtraFile> &extrafiles)
{
for (ExtraFileIterator i=extrafiles.begin(); i!=extrafiles.end(); i++)
{
string filename = i->FileName();
// Find the file extension
string::size_type where = filename.find_last_of('.');
if (where != string::npos)
{
string tail = filename.substr(where+1);
// Check the the file extension is the correct form
if ((tail[0] == 'P' || tail[0] == 'p') &&
(
((tail[1] == 'A' || tail[1] == 'a') && (tail[2] == 'R' || tail[2] == 'r'))
||
(isdigit(tail[1]) && isdigit(tail[2]))
))
{
LoadRecoveryFile(filename);
}
}
}
return true;
}
// Attempt to verify all of the source files
bool Par1Repairer::VerifySourceFiles(void)
{
bool finalresult = true;
u32 filenumber = 0;
vector<Par1RepairerSourceFile*>::iterator sourceiterator = sourcefiles.begin();
while (sourceiterator != sourcefiles.end())
{
Par1RepairerSourceFile *sourcefile = *sourceiterator;
string filename = sourcefile->FileName();
// Check to see if we have already used this file
if (diskfilemap.Find(filename) != 0)
{
string path;
string name;
DiskFile::SplitRelativeFilename(filename, path, name);
// The file has already been used!
cerr << "Source file " << name << " is a duplicate." << endl;
finalresult = false;
}
else
{
DiskFile *diskfile = new DiskFile;
// Does the target file exist
if (diskfile->Open(filename))
{
// Yes. Record that fact.
sourcefile->SetTargetExists(true);
// Remember that the DiskFile is the target file
sourcefile->SetTargetFile(diskfile);
// Remember that we have processed this file
bool success = diskfilemap.Insert(diskfile);
assert(success);
// Do the actual verification
if (!VerifyDataFile(diskfile, sourcefile))
finalresult = false;
// We have finished with the file for now
diskfile->Close();
// Find out how much data we have found
UpdateVerificationResults();
}
else
{
// The file does not exist.
delete diskfile;
if (noiselevel > CommandLine::nlSilent)
{
string path;
string name;
DiskFile::SplitFilename(filename, path, name);
cout << "Target: \"" << name << "\" - missing." << endl;
}
}
}
++sourceiterator;
++filenumber;
}
return finalresult;
}
// Scan any extra files specified on the command line
bool Par1Repairer::VerifyExtraFiles(const list<CommandLine::ExtraFile> &extrafiles)
{
for (ExtraFileIterator i=extrafiles.begin();
i!=extrafiles.end() && completefilecount<sourcefiles.size();
++i)
{
string filename = i->FileName();
bool skip = false;
// Find the file extension
string::size_type where = filename.find_last_of('.');
if (where != string::npos)
{
string tail = filename.substr(where+1);
// Check the the file extension is the correct form
if ((tail[0] == 'P' || tail[0] == 'p') &&
(
((tail[1] == 'A' || tail[1] == 'a') && (tail[2] == 'R' || tail[2] == 'r'))
||
(isdigit(tail[1]) && isdigit(tail[2]))
))
{
skip = true;
}
}
if (!skip)
{
filename = DiskFile::GetCanonicalPathname(filename);
// Has this file already been dealt with
if (diskfilemap.Find(filename) == 0)
{
DiskFile *diskfile = new DiskFile;
// Does the file exist
if (!diskfile->Open(filename))
{
delete diskfile;
continue;
}
// Remember that we have processed this file
bool success = diskfilemap.Insert(diskfile);
assert(success);
// Do the actual verification
VerifyDataFile(diskfile, 0);
// Ignore errors
// We have finished with the file for now
diskfile->Close();
// Find out how much data we have found
UpdateVerificationResults();
}
}
}
return true;
}
bool Par1Repairer::VerifyDataFile(DiskFile *diskfile, Par1RepairerSourceFile *sourcefile)
{
Par1RepairerSourceFile *match = 0;
string path;
string name;
DiskFile::SplitFilename(diskfile->FileName(), path, name);
// How big is the file we are checking
u64 filesize = diskfile->FileSize();
if (filesize == 0)
{
if (noiselevel > CommandLine::nlSilent)
{
cout << "Target: \"" << name << "\" - empty." << endl;
}
return true;
}
// Search for the first file that is the correct size
vector<Par1RepairerSourceFile*>::iterator sourceiterator = sourcefiles.begin();
while (sourceiterator != sourcefiles.end() &&
filesize != (*sourceiterator)->FileSize())
{
++sourceiterator;
}
// Are there any files that are the correct size?
if (sourceiterator != sourcefiles.end())
{
// Allocate a buffer to compute the file hash
size_t buffersize = (size_t)min((u64)1048576, filesize);
char *buffer = new char[buffersize];
// Read the first 16k of the file
size_t want = (size_t)min((u64)16384, filesize);
if (!diskfile->Read(0, buffer, want))
{
delete [] buffer;
return false;
}
// Compute the MD5 hash of the first 16k
MD5Context contextfull;
contextfull.Update(buffer, want);
MD5Context context16k = contextfull;
MD5Hash hash16k;
context16k.Final(hash16k);
if (!ignore16kfilehash)
{
// Search for the first file that has the correct 16k hash
while (sourceiterator != sourcefiles.end() &&
(filesize != (*sourceiterator)->FileSize() ||
hash16k != (*sourceiterator)->Hash16k()))
{
++sourceiterator;
}
}
// Are there any files with the correct 16k hash?
if (sourceiterator != sourcefiles.end())
{
// Compute the MD5 hash of the whole file
if (filesize > 16384)
{
u64 progress = 0;
u64 offset = 16384;
while (offset < filesize)
{
if (noiselevel > CommandLine::nlQuiet)
{
// Update a progress indicator
u32 oldfraction = (u32)(1000 * (progress) / filesize);
u32 newfraction = (u32)(1000 * (progress=offset) / filesize);
if (oldfraction != newfraction)
{
cout << "Scanning: \"" << name << "\": " << newfraction/10 << '.' << newfraction%10 << "%\r" << flush;
}
}
want = (size_t)min((u64)buffersize, filesize-offset);
if (!diskfile->Read(offset, buffer, want))
{
delete [] buffer;
return false;
}
contextfull.Update(buffer, want);
offset += want;
}
}
MD5Hash hashfull;
contextfull.Final(hashfull);
// Search for the first file that has the correct full hash
while (sourceiterator != sourcefiles.end() &&
(filesize != (*sourceiterator)->FileSize() ||
(!ignore16kfilehash && hash16k != (*sourceiterator)->Hash16k()) ||
hashfull != (*sourceiterator)->HashFull()))
{
++sourceiterator;
}
// Are there any files with the correct full hash?
if (sourceiterator != sourcefiles.end())
{
// If a source file was originally specified, check to see if it is a match
if (sourcefile != 0 &&
sourcefile->FileSize() == filesize &&
(ignore16kfilehash || sourcefile->Hash16k() == hash16k) &&
sourcefile->HashFull() == hashfull)
{
match = sourcefile;
}
else
{
// Search for a file which matches and has not already been matched
while (sourceiterator != sourcefiles.end() &&
(filesize != (*sourceiterator)->FileSize() ||
(!ignore16kfilehash && hash16k != (*sourceiterator)->Hash16k()) ||
hashfull != (*sourceiterator)->HashFull() ||
(*sourceiterator)->GetCompleteFile() != 0))
{
++sourceiterator;
}
// Did we find a match
if (sourceiterator != sourcefiles.end())
{
match = *sourceiterator;
}
}
}
}
delete [] buffer;
}
// Did we find a match
if (match != 0)
{
match->SetCompleteFile(diskfile);
if (noiselevel > CommandLine::nlSilent)
{
// Was the match the file we were originally looking for
if (match == sourcefile)
{
cout << "Target: \"" << name << "\" - found." << endl;
}
// Were we looking for a specific file
else if (sourcefile != 0)
{
string targetname;
DiskFile::SplitFilename(sourcefile->FileName(), path, targetname);
cout << "Target: \""
<< name
<< "\" - is a match for \""
<< targetname
<< "\"."
<< endl;
}
}
else
{
if (noiselevel > CommandLine::nlSilent)
{
string targetname;
DiskFile::SplitFilename(match->FileName(), path, targetname);
cout << "File: \""
<< name
<< "\" - is a match for \""
<< targetname
<< "\"."
<< endl;
}
}
}
else
{
if (noiselevel > CommandLine:: nlSilent)
cout << "File: \""
<< name
<< "\" - no data found."
<< endl;
}
return true;
}
void Par1Repairer::UpdateVerificationResults(void)
{
completefilecount = 0;
renamedfilecount = 0;
damagedfilecount = 0;
missingfilecount = 0;
vector<Par1RepairerSourceFile*>::iterator sf = sourcefiles.begin();
// Check the recoverable files
while (sf != sourcefiles.end())
{
Par1RepairerSourceFile *sourcefile = *sf;
// Was a perfect match for the file found
if (sourcefile->GetCompleteFile() != 0)
{
// Is it the target file or a different one
if (sourcefile->GetCompleteFile() == sourcefile->GetTargetFile())
{
completefilecount++;
}
else
{
renamedfilecount++;
}
}
else
{
// Does the target file exist
if (sourcefile->GetTargetExists())
{
damagedfilecount++;
}
else
{
missingfilecount++;
}
}
++sf;
}
}
bool Par1Repairer::CheckVerificationResults(void)
{
// Is repair needed
if (completefilecount < sourcefiles.size() ||
renamedfilecount > 0 ||
damagedfilecount > 0 ||
missingfilecount > 0)
{
if (noiselevel > CommandLine::nlSilent)
cout << "Repair is required." << endl;
if (noiselevel > CommandLine::nlQuiet)
{
if (renamedfilecount > 0) cout << renamedfilecount << " file(s) have the wrong name." << endl;
if (missingfilecount > 0) cout << missingfilecount << " file(s) are missing." << endl;
if (damagedfilecount > 0) cout << damagedfilecount << " file(s) exist but are damaged." << endl;
if (completefilecount > 0) cout << completefilecount << " file(s) are ok." << endl;
}
// Is repair possible
if (recoveryblocks.size() >= damagedfilecount+missingfilecount)
{
if (noiselevel > CommandLine::nlSilent)
cout << "Repair is possible." << endl;
if (noiselevel > CommandLine::nlQuiet)
{
if (recoveryblocks.size() > damagedfilecount+missingfilecount)
cout << "You have an excess of "
<< (u32)recoveryblocks.size() - (damagedfilecount+missingfilecount)
<< " recovery files." << endl;
if (damagedfilecount+missingfilecount > 0)
cout << damagedfilecount+missingfilecount
<< " recovery files will be used to repair." << endl;
else if (recoveryblocks.size())
cout << "None of the recovery files will be used for the repair." << endl;
}
return true;
}