-
Notifications
You must be signed in to change notification settings - Fork 0
/
commandline.cpp
executable file
·1354 lines (1212 loc) · 41.4 KB
/
commandline.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
//
// Modifications for concurrent processing, Unicode support, and hierarchial
// directory support are Copyright (c) 2007-2008 Vincent Tan.
// Search for "#if WANT_CONCURRENT" for concurrent code.
// Concurrent processing utilises Intel Thread Building Blocks 2.0,
// Copyright (c) 2007 Intel Corp.
#include "par2cmdline.h"
#if __APPLE__
#include <sys/types.h>
#include <sys/sysctl.h>
#endif
#include <set>
#include <algorithm>
#undef min // Windows header defines this
#undef max // Windows header defines this
#ifdef _MSC_VER
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif
#endif
#if defined(WIN32) || defined(__APPLE__)
struct less_stri {
bool operator()(const string& lhs, const string& rhs) const {
return stricmp(lhs.c_str(), rhs.c_str()) < 0;
}
};
#endif
#ifdef WIN32
#include <tchar.h>
enum { OS_SEPARATOR = '\\', OTHER_OS_SEPARATOR = '/' };
#define ATOI _ttoi
#define ATOUL _tcstoul
wstring
UTF8_to_UTF16(const char* utf8_str, size_t utf8_length)
{
int i, j;
// NTFS filenames are precomposed UCS-2 (UTF-16) characters
// but par2 files require decomposed (aka composite) UCS-1
// (UTF-8) characters, so first convert from UTF-8 and then
// precompose the string
if (utf8_length == 0) {
i = 0;
} else {
i = ::MultiByteToWideChar(CP_UTF8, // UTF-8
0, // character-type options
utf8_str, // string to map
(int) utf8_length, // number of bytes in string
NULL, // wide-character buffer
0 // size of buffer
);
if (i == 0)
return wstring();
}
wstring tmp(i, '\0');
if (!tmp.data())
return wstring();
if (utf8_length != 0) {
j = ::MultiByteToWideChar(CP_UTF8, // UTF-8
0, // character-type options
utf8_str, // string to map
(int) utf8_length, // number of bytes in string
&tmp[0], // wide-character buffer
i // size of buffer
);
assert(j == i);
}
i = ::FoldStringW(MAP_PRECOMPOSED, tmp.c_str(), (int) tmp.length(), NULL, 0);
if (0 == i)
return wstring();
wstring res(i, '\0'); // i does not include the end '\0' char
j = ::FoldStringW(MAP_PRECOMPOSED, tmp.c_str(), (int) tmp.length(), &res[0], i);
assert(j == i);
if (0 == j || j != i)
return wstring();
//cout << "UTF8_to_UTF16 translated '" << utf8_str << "' [" << utf8_length << "] char utf8 string to " << i << " char wide string." << endl;
return res;
}
wstring
UTF8_to_UTF16(const string& utf8)
{
return UTF8_to_UTF16(utf8.c_str(), utf8.length());
}
static
string
UTF16_to_console_code_page(const wstring& utf16)
{
int i, j;
UINT cp = ::GetConsoleOutputCP();
{
i = ::WideCharToMultiByte(cp, // code page
0, // performance and mapping flags
utf16.c_str(), // wide-character string
(int) utf16.length(), // number of chars in string
NULL, // buffer for new string
0, // size of buffer in bytes
NULL, NULL);
if (i == 0)
return string();
}
string res(i, '\0');
if (!res.data())
return string();
//size_t sz = (size_t) (j-1);
{
j = ::WideCharToMultiByte(cp, // code page
0, // performance and mapping flags
utf16.c_str(), // wide-character string
(int) utf16.length(), // number of chars in string
&res[0], // buffer for new string
i, // size of buffer in bytes
NULL, NULL);
assert(j == i);
}
//cout << "UTF16_to_UTF8 translated " << sz << " char utf16 string to '" << res << "' [" << i << " chars]." << endl;
return res;
}
string
UTF8_string_to_cout_string(const string& utf8)
{
// on Win32, cout outputs to the console which is
// DOS-compatible, meaning that it doesn't understand
// UTF-8, which means that the input string needs
// to be translated to the console's code page
return ::UTF16_to_console_code_page(::UTF8_to_UTF16(utf8));
}
string
UTF16_to_UTF8(const wchar_t* utf16)
{
int i, j;
// NTFS filenames are precomposed UCS-2 (UTF-16) characters
// but par2 files require decomposed (aka composite) UCS-1
// (UTF-8) characters, so first decompose the string then
// convert it to UTF-8
i = ::FoldStringW(MAP_COMPOSITE, utf16, -1, NULL, 0);
if (0 == i)
return string();
wstring tmp(i, '\0'); // i includes the '\0' char
j = ::FoldStringW(MAP_COMPOSITE, utf16, -1, &tmp[0], i);
assert(j == i);
if (0 == j || j != i)
return string();
{
i = ::WideCharToMultiByte(CP_UTF8, // UTF-8
0, // performance and mapping flags
tmp.c_str(), // wide-character string
j-1, // number of chars in string
NULL, // buffer for new string
0, // size of buffer in bytes
NULL, NULL);
if (i == 0)
return string();
}
string res(i, '\0');
if (!res.data())
return string();
//size_t sz = (size_t) (j-1);
{
j = ::WideCharToMultiByte(CP_UTF8, // UTF-8
0, // performance and mapping flags
tmp.c_str(), // wide-character string
j-1, // number of chars in string
&res[0], // buffer for new string
i, // size of buffer in bytes
NULL, NULL);
assert(j == i);
}
//cout << "UTF16_to_UTF8 translated " << sz << " char utf16 string to '" << res << "' [" << i << " chars]." << endl;
return res;
}
#else
enum { OS_SEPARATOR = '/', OTHER_OS_SEPARATOR = '\\' };
#include <dirent.h>
#define ATOI atoi
#define ATOUL strtoul
/*#include <CoreFoundation/CoreFoundation.h>
extern void
dump_utf8_as_utf16(const string& name);
void
dump_utf8_as_utf16(const string& name)
{
printf("name[utf8]: ");
for (size_t z = 0; z != name.length(); ++z)
printf("'%c' %02X ", (unsigned) (0xFF & name[z]), (unsigned) (0xFF & name[z]));
printf("\n");
CFStringRef s = ::CFStringCreateWithBytes(NULL,
(const UInt8*) name.c_str(),
name.length(), kCFStringEncodingUTF8, false);
size_t sz = (size_t) ::CFStringGetLength(s);
UniChar* buf = (UniChar*) malloc(sizeof(UniChar) * sz);
if (buf != NULL)
::CFStringGetCharacters(s, ::CFRangeMake(0, sz), buf);
printf("name[utf16]: ");
for (size_t z = 0; z != sz; ++z)
printf("'%c' %02X ", buf[z] < 0x80 ? buf[z] : '?', buf[z]);
printf("\n");
free(buf);
} */
#define _tcstod strtod
#endif
extern bool is_existing_folder(const string& dir);
bool
is_existing_folder(const string& dir)
{
struct_stat st;
if (stat(utf8_string_to_native_char_array(dir), &st))
return false;
return (st.st_mode & S_IFDIR) != 0;
}
static
void
build_file_list_in_imp(string dir, list<string>* l)
{
#ifdef WIN32
dir += OS_SEPARATOR;
dir += '*';
WIN32_FIND_DATA fd;
HANDLE h = ::FindFirstFile(utf8_string_to_native_char_array(dir), &fd);
dir.erase(dir.length()-1);
if (h == INVALID_HANDLE_VALUE)
return;
do {
if (0 == _tcscmp/*strcmp*/(fd.cFileName, TEXT(".")) || 0 == _tcscmp/*strcmp*/(fd.cFileName, TEXT("..")))
continue;
if (fd.cFileName[0] == '.' ||
(FILE_ATTRIBUTE_HIDDEN & fd.dwFileAttributes)) // ignore invisible files/folders
continue;
if (fd.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY)
build_file_list_in_imp(dir + native_char_array_to_utf8_string(fd.cFileName), l);
else
l->push_back(dir + native_char_array_to_utf8_string(fd.cFileName));
} while (::FindNextFile(h, &fd));
::FindClose(h);
#else
DIR *dirp = opendir(dir.c_str());
if (dirp == 0)
return;
dir += OS_SEPARATOR;
struct dirent *d;
while ((d = readdir(dirp)) != 0) {
string name = d->d_name;
if (name == "." || name == "..")
continue;
if (name[0] == '.') // ignore invisible files/folders
continue;
// 2011/06/27: the portable way is to use stat, esp. for Solaris
#if HAVE_SYS_STAT_H
string path(dir + name);
struct stat statbuf;
if (0 != stat(path.c_str(), &statbuf))
continue;
if (S_ISDIR(statbuf.st_mode) /* d_type == DT_DIR */)
/* dump_utf8_as_utf16(name), */ build_file_list_in_imp(path, l);
else
l->push_back(path);
#else
if (d->d_type == DT_DIR)
/* dump_utf8_as_utf16(name), */ build_file_list_in_imp(dir + name, l);
else
l->push_back(dir + name);
#endif
}
closedir(dirp);
#endif
}
static
list<string>*
build_file_list_in(const char* dir)
{
string s(dir);
if (s.empty())
return NULL;
size_t i = s.length()-1;
char c = s[i];
if (OTHER_OS_SEPARATOR == c || OS_SEPARATOR == c)
s.erase(i);
std_auto_ptr< list<string> > res(new list<string>);
if (!res.get())
return NULL;
build_file_list_in_imp(s, res.get());
return res.release();
}
CommandLine::ExtraFile::ExtraFile(void)
: filename()
, filesize(0)
{
}
CommandLine::ExtraFile::ExtraFile(const CommandLine::ExtraFile &other)
: filename(other.filename)
, filesize(other.filesize)
{
}
CommandLine::ExtraFile& CommandLine::ExtraFile::operator=(const CommandLine::ExtraFile &other)
{
filename = other.filename;
filesize = other.filesize;
return *this;
}
CommandLine::ExtraFile::ExtraFile(const string &name, u64 size)
: filename(name)
, filesize(size)
{
}
/* static */ CommandLine* CommandLine::sInstance = NULL;
// static
CommandLine*
CommandLine::get(void)
{
return sInstance;
}
// static
string
CommandLine::FileOrPathForCout(const string& path)
{
CommandLine* cl = get();
if (!cl) {
cerr << "error: missing cmd line - this should not happen!" << endl;
return string(); // something is wrong
}
const string& bd = cl->GetBaseDirectory();
if (bd.empty()) {
string parent_dir;
string file_name;
DiskFile::SplitFilename(path, parent_dir, file_name);
return file_name;
}
return path;
}
CommandLine::CommandLine(void)
: operation(opNone)
, version(verUnknown)
, noiselevel(nlUnknown)
, opening_message_limit(200) // default
, blockcount(0)
, blocksize(0)
, firstblock(0)
, recoveryfilescheme(scUnknown)
, recoveryfilecount(0)
, recoveryblockcount(0)
, recoveryblockcountset(false)
, redundancy(0.0f)
, redundancyset(false)
, parfilename()
, extrafiles()
, totalsourcesize(0)
, largestsourcesize(0)
, memorylimit(0)
#if WANT_CONCURRENT
, concurrent_processing_level(tbb::task_scheduler_init::default_num_threads()) // with concurrent verification
#endif
, create_dummy_par_files(false)
{
sInstance = this;
}
CommandLine::~CommandLine(void)
{
sInstance = NULL;
}
void CommandLine::usage(void)
{
cout <<
"\n"
"Usage:\n"
"\n"
" par2 c(reate) [options] <par2 file> [files] : Create PAR2 files\n"
" par2 v(erify) [options] <par2 file> [files] : Verify files using PAR2 file\n"
" par2 r(epair) [options] <par2 file> [files] : Repair files using PAR2 files\n"
"\n"
"You may also leave out the \"c\", \"v\", and \"r\" commands by using \"parcreate\",\n"
"\"par2verify\", or \"par2repair\" instead.\n"
"\n"
"Options:\n"
"\n"
" -b<n> : Set the Block-Count\n"
" -s<n> : Set the Block-Size (Don't use both -b and -s)\n"
" -r<n> : Level of Redundancy (%)\n"
" -c<n> : Recovery block count (Don't use both -r and -c)\n"
" -f<n> : First Recovery-Block-Number\n"
" -u : Uniform recovery file sizes\n"
" -l : Limit size of recovery files (Don't use both -u and -l)\n"
" -n<n> : Number of recovery files (Don't use both -n and -l)\n"
" -m<n> : Memory (in MB) to use\n"
" -v [-v]: Be more verbose\n"
" -q [-q]: Be more quiet (-q -q gives silence)\n"
" -z<n> : Number of \"Opening: <file>\" messages when creating parity files (zero for no limit)\n" // 2014/11/25
#if WANT_CONCURRENT
#if 1
// 2014/10/07 added ability to specify how many logical CPUs (threads) to use;
// "all available logical CPUs" means whatever the OS allows the executable to
// use, so on a 8 CPU system where par2 is allowed to use 6 CPUs, then "all
// available logical CPUs" is 6. On Windows, this value is determined by the
// "processor affinity mask" assigned to each Windows process by the system.
" -t<+<n>|0<n>|-<n>>: Threaded processing. The options are:\n"
" -t+ to checksum and create/repair concurrently - uses all available logical CPUs - good for hard disk files - [default]\n"
" -t0 to checksum serially but create/repair concurrently with all available logical CPUs - better for slow media such as CDs/DVDs\n"
" -t- to checksum/create/repair serially - uses a single logical CPU - good for testing this program\n"
" -t+n to checksum and create/repair concurrently - uses n logical CPUs (up to all of the available logical CPUs)\n"
" -t0n to checksum serially but create/repair concurrently - uses n logical CPUs if n > 0, or all available CPUs minus n if n < 0\n"
" -t-n to checksum and create/repair concurrently - uses available logical CPUs minus n, eg, -t-1 on a 6 CPU system will use up to 5 CPUs\n"
#elif 0
" -t<+|0|->: Threaded processing. The options are:\n"
" -t+ to checksum and create/repair concurrently - uses multiple threads - good for hard disk files - [default]\n"
" -t0 to checksum serially but create/repair concurrently - good for slow media such as CDs/DVDs\n"
" -t- to checksum/create/repair serially - uses a single thread - good for testing this program\n"
#endif
#endif
#if defined(WIN32)
// 2014/10/07
" -p<N|L|I>: Processing priority. The options are:\n"
" -pN to process at normal priority [default]\n"
" -pL to process at low priority\n"
" -pI to process at idle priority\n"
#endif
// 2007/10/21
" -d<dir>: root directory for paths to be put in par2 files OR root directory for files to repair from par2 files\n"
// 2008/07/07
" -0 : create dummy par2 files - for getting actual final par2 files sizes without doing any computing\n"
" -- : Treat all remaining CommandLine as filenames\n"
"\n"
"If you wish to create par2 files for a single source file, you may leave\n"
"out the name of the par2 file from the command line.\n";
}
bool CommandLine::Parse(int argc, TCHAR *argv[])
{
if (argc<1)
{
return false;
}
// Split the program name into path and filename
string path, name;
DiskFile::SplitFilename(native_char_array_to_utf8_string(argv[0]), path, name);
argc--;
argv++;
// Strip ".exe" from the end
if (name.size() > 4 && 0 == stricmp(".exe", name.substr(name.length()-4).c_str()))
{
name = name.substr(0, name.length()-4);
}
// Check the resulting program name
if (0 == stricmp("par2create", name.c_str()))
{
operation = opCreate;
}
else if (0 == stricmp("par2verify", name.c_str()))
{
operation = opVerify;
}
else if (0 == stricmp("par2repair", name.c_str()))
{
operation = opRepair;
}
// Have we determined what operation we want?
if (operation == opNone)
{
if (argc<2)
{
cerr << "Not enough command line arguments." << endl;
return false;
}
switch (tolower(argv[0][0]))
{
case 'c':
if (argv[0][1] == 0 || 0 == stricmp(native_char_array_to_utf8_char_array(argv[0]), "create"))
operation = opCreate;
break;
case 'v':
if (argv[0][1] == 0 || 0 == stricmp(native_char_array_to_utf8_char_array(argv[0]), "verify"))
operation = opVerify;
break;
case 'r':
if (argv[0][1] == 0 || 0 == stricmp(native_char_array_to_utf8_char_array(argv[0]), "repair"))
operation = opRepair;
break;
}
if (operation == opNone)
{
cerr << "Invalid operation specified: " << argv[0] << endl;
return false;
}
argc--;
argv++;
}
bool options = true;
#if defined(WIN32) || defined(__APPLE__)
std::set<string, less_stri> accepted_filenames;
#else
std::set<string> accepted_filenames;
#endif
while (argc>0)
{
if (argv[0][0])
{
if (options && argv[0][0] != '-')
options = false;
if (options)
{
switch (tolower(argv[0][1]))
{
case 'b': // Set the block count
{
if (operation != opCreate)
{
cerr << "Cannot specify block count unless creating." << endl;
return false;
}
if (blockcount > 0)
{
cerr << "Cannot specify block count twice." << endl;
return false;
}
else if (blocksize > 0)
{
cerr << "Cannot specify both block count and block size." << endl;
return false;
}
TCHAR *p = &argv[0][2];
while (blockcount <= 3276 && *p && isdigit(*p))
{
blockcount = blockcount * 10 + (*p - '0');
p++;
}
if (0 == blockcount || blockcount > 32768 || *p)
{
cerr << "Invalid block count option: " << argv[0] << endl;
return false;
}
}
break;
case 's': // Set the block size
{
if (operation != opCreate)
{
cerr << "Cannot specify block size unless creating." << endl;
return false;
}
if (blocksize > 0)
{
cerr << "Cannot specify block size twice." << endl;
return false;
}
else if (blockcount > 0)
{
cerr << "Cannot specify both block count and block size." << endl;
return false;
}
TCHAR *p = &argv[0][2];
while (blocksize <= 429496729 && *p && isdigit(*p))
{
blocksize = blocksize * 10 + (*p - '0');
p++;
}
if (*p || blocksize == 0)
{
cerr << "Invalid block size option: " << argv[0] << endl;
return false;
}
if (blocksize & 3)
{
cerr << "Block size must be a multiple of 4." << endl;
return false;
}
}
break;
case 'r': // Set the amount of redundancy required
{
if (operation != opCreate)
{
cerr << "Cannot specify redundancy unless creating." << endl;
return false;
}
if (redundancyset)
{
cerr << "Cannot specify redundancy twice." << endl;
return false;
}
else if (recoveryblockcountset)
{
cerr << "Cannot specify both redundancy and recovery block count." << endl;
return false;
}
TCHAR *p = &argv[0][2];
#if 1
redundancy = (float) _tcstod(p, &p);
#else
while (redundancy <= 10 && *p && isdigit(*p))
{
redundancy = redundancy * 10 + (*p - '0');
p++;
}
#endif
if (redundancy > 100.0f || *p)
{
cerr << "Invalid redundancy option: " << argv[0] << endl;
return false;
}
if (redundancy == 0.0f && recoveryfilecount > 0)
{
cerr << "Cannot set redundancy to 0 and file count > 0" << endl;
return false;
}
redundancyset = true;
}
break;
case 'c': // Set the number of recovery blocks to create
{
if (operation != opCreate)
{
cerr << "Cannot specify recovery block count unless creating." << endl;
return false;
}
if (recoveryblockcountset)
{
cerr << "Cannot specify recovery block count twice." << endl;
return false;
}
else if (redundancyset)
{
cerr << "Cannot specify both recovery block count and redundancy." << endl;
return false;
}
TCHAR *p = &argv[0][2];
while (recoveryblockcount <= 32768 && *p && isdigit(*p))
{
recoveryblockcount = recoveryblockcount * 10 + (*p - '0');
p++;
}
if (recoveryblockcount > 32768 || *p)
{
cerr << "Invalid recoveryblockcount option: " << argv[0] << endl;
return false;
}
if (recoveryblockcount == 0 && recoveryfilecount > 0)
{
cerr << "Cannot set recoveryblockcount to 0 and file count > 0" << endl;
return false;
}
recoveryblockcountset = true;
}
break;
case 'f': // Specify the First block recovery number
{
if (operation != opCreate)
{
cerr << "Cannot specify first block number unless creating." << endl;
return false;
}
if (firstblock > 0)
{
cerr << "Cannot specify first block twice." << endl;
return false;
}
TCHAR *p = &argv[0][2];
while (firstblock <= 3276 && *p && isdigit(*p))
{
firstblock = firstblock * 10 + (*p - '0');
p++;
}
if (firstblock > 32768 || *p)
{
cerr << "Invalid first block option: " << argv[0] << endl;
return false;
}
}
break;
case 'u': // Specify uniformly sized recovery files
{
if (operation != opCreate)
{
cerr << "Cannot specify uniform files unless creating." << endl;
return false;
}
if (argv[0][2])
{
cerr << "Invalid option: " << argv[0] << endl;
return false;
}
if (recoveryfilescheme != scUnknown)
{
cerr << "Cannot specify two recovery file size schemes." << endl;
return false;
}
recoveryfilescheme = scUniform;
}
break;
case 'l': // Limit the size of the recovery files
{
if (operation != opCreate)
{
cerr << "Cannot specify limit files unless creating." << endl;
return false;
}
if (argv[0][2])
{
cerr << "Invalid option: " << argv[0] << endl;
return false;
}
if (recoveryfilescheme != scUnknown)
{
cerr << "Cannot specify two recovery file size schemes." << endl;
return false;
}
if (recoveryfilecount > 0)
{
cerr << "Cannot specify limited size and number of files at the same time." << endl;
return false;
}
recoveryfilescheme = scLimited;
}
break;
case 'n': // Specify the number of recovery files
{
if (operation != opCreate)
{
cerr << "Cannot specify recovery file count unless creating." << endl;
return false;
}
if (recoveryfilecount > 0)
{
cerr << "Cannot specify recovery file count twice." << endl;
return false;
}
if (redundancyset && redundancy == 0)
{
cerr << "Cannot set file count when redundancy is set to 0." << endl;
return false;
}
if (recoveryblockcountset && recoveryblockcount == 0)
{
cerr << "Cannot set file count when recovery block count is set to 0." << endl;
return false;
}
if (recoveryfilescheme == scLimited)
{
cerr << "Cannot specify limited size and number of files at the same time." << endl;
return false;
}
TCHAR *p = &argv[0][2];
while (*p && isdigit(*p))
{
recoveryfilecount = recoveryfilecount * 10 + (*p - '0');
p++;
}
if (recoveryfilecount == 0 || *p)
{
cerr << "Invalid recovery file count option: " << argv[0] << endl;
return false;
}
}
break;
case 'm': // Specify how much memory to use for output buffers
{
if (memorylimit > 0)
{
cerr << "Cannot specify memory limit twice." << endl;
return false;
}
TCHAR *p = &argv[0][2];
while (*p && isdigit(*p))
{
memorylimit = memorylimit * 10 + (*p - '0');
p++;
}
if (memorylimit == 0 || *p)
{
cerr << "Invalid memory limit option: " << argv[0] << endl;
return false;
}
}
break;
case 'v':
{
switch (noiselevel)
{
case nlUnknown:
{
if (argv[0][2] == 'v')
noiselevel = nlDebug;
else
noiselevel = nlNoisy;
}
break;
case nlNoisy:
case nlDebug:
noiselevel = nlDebug;
break;
default:
cerr << "Cannot use both -v and -q." << endl;
return false;
break;
}
}
break;
case 'q':
{
switch (noiselevel)
{
case nlUnknown:
{
if (argv[0][2] == 'q')
noiselevel = nlSilent;
else
noiselevel = nlQuiet;
}
break;
case nlQuiet:
case nlSilent:
noiselevel = nlSilent;
break;
default:
cerr << "Cannot use both -v and -q." << endl;
return false;
break;
}
}
break;
case 'z': // 2014/11/25 added message limit
opening_message_limit = (u32) ATOUL(2 + argv[0], NULL, 10);
if (opening_message_limit > 32767) {
cerr << "Value for -z must be between 0 and 32767." << endl;
return false;
}
break;
case 'd':
{
base_directory = DiskFile::GetCanonicalPathname(native_char_array_to_utf8_string(2 + argv[0]));
if (base_directory.empty()) {
cerr << "base directory for hierarchy support must specify a folder" << endl;
return false;
} else if (operation == opCreate && !is_existing_folder(base_directory)) {
cerr << "the base directory (" << base_directory << ") for hierarchy support must specify an accessible and existing folder" << endl;
return false;
}
if (base_directory[base_directory.length()-1] != OS_SEPARATOR)
base_directory += OS_SEPARATOR;
}
break;
#if WANT_CONCURRENT
case 't':
{
#if 1
int n;
const size_t max_concurrency = tbb::task_scheduler_init::default_num_threads();
switch (argv[0][2]) {
case '-':
case '+': {
if ('\0' == argv[0][3])
concurrent_processing_level = '-' == argv[0][2] ? 1 : max_concurrency;
else {
n = ATOI(3 + argv[0]);
if (0 < n)
concurrent_processing_level = '-' == argv[0][2] ? std::max(size_t(1), size_t(max_concurrency - n)) : std::min(max_concurrency, size_t(n));
else {
cerr << "Cannot specify negative or zero value for n in parameter -t" << char(argv[0][2]) << "<n>." << endl;
return false;
}
}
break;
}
case '0': {
if ('\0' == argv[0][3])
concurrent_processing_level = max_concurrency;
else {
n = ATOI(3 + argv[0]);
if (0 != n)
concurrent_processing_level = n < 0 ? std::max(size_t(1), size_t(max_concurrency + n)) : std::min(max_concurrency, size_t(n));
else {
cerr << "Cannot specify zero value for n in parameter -t0<n>." << endl;
return false;
}
}
concurrent_processing_level |= SERIAL_VERIFICATION_MASK;
break;
}
default:
cerr << "Expected -t+ (use multiple cores) or -t0 (checksum serially, process concurrently) or -t- (use single core)" << endl
<< "or -t+n (use up to n cores) or -t-n (use all available cores minus n) or -t0n (checksum serially, process " << endl
<< "concurrently using up to n cores if n > 0, or all available cores minus n if n < 0)." << endl;