-
Notifications
You must be signed in to change notification settings - Fork 15
/
main.cc
981 lines (890 loc) · 41 KB
/
main.cc
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
/* GNU ddrescue - Data recovery tool
Copyright (C) 2004-2019 Antonio Diaz Diaz.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/*
Exit status: 0 for a normal exit, 1 for environmental problems
(file not found, invalid flags, I/O errors, etc), 2 to indicate a
corrupt or invalid input file, 3 for an internal consistency error
(eg, bug) which caused ddrescue to panic.
*/
#define _FILE_OFFSET_BITS 64
#include <algorithm>
#include <cctype>
#include <cerrno>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <string>
#include <vector>
#include <fcntl.h>
#include <stdint.h>
#include <unistd.h>
#include <sys/stat.h>
#include "arg_parser.h"
#include "rational.h"
#include "block.h"
#include "loggers.h"
#include "mapbook.h"
#include "non_posix.h"
#include "rescuebook.h"
#ifndef O_BINARY
#define O_BINARY 0
#endif
#ifndef O_DIRECT
#define O_DIRECT 0
#endif
namespace {
const char * const Program_name = "GNU ddrescue";
const char * const program_name = "ddrescue";
const char * invocation_name = program_name; // default value
enum Mode { m_none, m_command, m_fill, m_generate };
const mode_t outmode = S_IRUSR | S_IWUSR | S_IRGRP | S_IWGRP | S_IROTH | S_IWOTH;
void show_help( const int cluster, const int hardbs )
{
std::printf( "GNU ddrescue is a data recovery tool. It copies data from one file or block\n"
"device (hard disc, cdrom, etc) to another, trying to rescue the good parts\n"
"first in case of read errors.\n"
"\nAlways use a mapfile unless you know you won't need it. Without a\n"
"mapfile, ddrescue can't resume a rescue, only reinitiate it.\n"
"NOTE: In versions of ddrescue prior to 1.20 the mapfile was called\n"
"'logfile'. The format is the same; only the name has changed.\n"
"\nIf you reboot, check the device names before restarting ddrescue.\n"
"Don't use options '-F' or '-G' without reading the manual first.\n"
"\nUsage: %s [options] infile outfile [mapfile]\n", invocation_name );
std::printf( "\nOptions:\n"
" -h, --help display this help and exit\n"
" -V, --version output version information and exit\n"
" -a, --min-read-rate=<bytes> minimum read rate of good areas in bytes/s\n"
" -A, --try-again mark non-trimmed, non-scraped as non-tried\n"
" -b, --sector-size=<bytes> sector size of input device [default %d]\n", hardbs );
std::printf( " -B, --binary-prefixes show binary multipliers in numbers [SI]\n"
" -c, --cluster-size=<sectors> sectors to copy at a time [%d]\n", cluster );
std::printf( " -C, --complete-only don't read new data beyond mapfile limits\n"
" -d, --idirect use direct disc access for input file\n"
" -D, --odirect use direct disc access for output file\n"
" -e, --max-bad-areas=[+]<n> maximum number of [new] bad areas allowed\n"
" -E, --max-error-rate=<bytes> maximum allowed rate of read errors per second\n"
" -f, --force overwrite output device or partition\n"
" -F, --fill-mode=<types> fill blocks of given types with data (?*/-+l)\n"
" -G, --generate-mode generate approximate mapfile from partial copy\n"
" -H, --test-mode=<file> set map of good/bad blocks from given mapfile\n"
" -i, --input-position=<bytes> starting position of domain in input file [0]\n"
" -I, --verify-input-size verify input file size with size in mapfile\n"
" -J, --verify-on-error reread latest good sector after every error\n"
" -K, --skip-size=[<i>][,<max>] initial,maximum size to skip on read error\n"
" -L, --loose-domain accept an incomplete domain mapfile\n"
" -m, --domain-mapfile=<file> restrict domain to finished blocks in <file>\n"
" -M, --retrim mark all failed blocks as non-trimmed\n"
" -n, --no-scrape skip the scraping phase\n"
" -N, --no-trim skip the trimming phase\n"
" -o, --output-position=<bytes> starting position in output file [ipos]\n"
" -O, --reopen-on-error reopen input file after every read error\n"
" -p, --preallocate preallocate space on disc for output file\n"
" -P, --data-preview[=<lines>] show some lines of the latest data read [3]\n"
" -q, --quiet suppress all messages\n"
" -r, --retry-passes=<n> exit after <n> retry passes (-1=infinity) [0]\n"
" -R, --reverse reverse the direction of all passes\n"
" -s, --size=<bytes> maximum size of input data to be copied\n"
" -S, --sparse use sparse writes for output file\n"
" -t, --truncate truncate output file to zero size\n"
" -T, --timeout=<interval> maximum time since last successful read\n"
" -u, --unidirectional run all passes in the same direction\n"
" -v, --verbose be verbose (a 2nd -v gives more)\n"
" -w, --ignore-write-errors make fill mode ignore write errors\n"
" -x, --extend-outfile=<bytes> extend outfile size to be at least this long\n"
" -X, --max-read-errors=<n> maximum number of read errors allowed\n"
" -y, --synchronous use synchronous writes for output file\n"
" -Z, --max-read-rate=<bytes> maximum read rate in bytes/s\n"
" --ask ask for confirmation before starting the copy\n"
" --command-mode execute commands from standard input\n"
" --cpass=<n>[,<n>] select what copying pass(es) to run\n"
" --delay-slow=<interval> initial delay before checking slow reads [30]\n"
" --log-events=<file> log significant events in <file>\n"
" --log-rates=<file> log rates and error sizes in <file>\n"
" --log-reads=<file> log all read operations in <file>\n"
" --mapfile-interval=[i][,i] save/sync mapfile at given interval [auto]\n"
" --max-slow-reads=<n> maximum number of slow reads allowed\n"
" --pause-on-error=<interval> time to wait after each read error [0]\n"
" --pause-on-pass=<interval> time to wait between passes [0]\n"
" --reset-slow reset slow reads if rate rises above min\n"
" --same-file allow infile and outfile to be the same file\n"
"\nNumbers may be in decimal, hexadecimal, or octal, and may be followed by a\n"
"multiplier: s = sectors, k = 1000, Ki = 1024, M = 10^6, Mi = 2^20, etc...\n"
"Time intervals have the format 1[.5][smhd] or 1/2[smhd].\n"
"\nExit status: 0 for a normal exit, 1 for environmental problems (file\n"
"not found, invalid flags, I/O errors, etc), 2 to indicate a corrupt or\n"
"invalid input file, 3 for an internal consistency error (eg, bug) which\n"
"caused ddrescue to panic.\n"
"\nReport bugs to bug-ddrescue@gnu.org\n"
"Ddrescue home page: http://www.gnu.org/software/ddrescue/ddrescue.html\n"
"General help using GNU software: http://www.gnu.org/gethelp\n" );
}
// Recognized formats: <rational_number>[unit]
// Where the optional "unit" is one of 's', 'm', 'h', or 'd'.
// Returns the number of seconds, or exits with 1 status if error.
//
Rational parse_rational_time( const char * const ptr, const bool comma = false,
const int max_den = 100 )
{
Rational r;
int c = r.parse( ptr );
if( c > 0 )
{
bool error = false;
switch( ptr[c] )
{
case 'd': r *= 86400; break; // 24 * 60 * 60
case 'h': r *= 3600; break; // 60 * 60
case 'm': r *= 60; break;
case 's':
case 0 : break;
case ',': if( comma ) break;
default : error = true;
}
if( error || ( !comma && ptr[c] != 0 && ptr[c] != ',' && ptr[c+1] == ',' ) )
{ show_error( "Bad unit in time interval.", 0, true ); std::exit( 1 ); }
if( !r.error() && r >= 0 && r.denominator() <= max_den ) return r;
}
show_error( "Bad value for time interval.", 0, true );
std::exit( 1 );
}
int parse_time_interval( const char * const ptr, const bool comma = false )
{ return parse_rational_time( ptr, comma, 1 ).trunc(); }
bool check_identical( const char * const iname, const char * const oname,
const char * const mapname,
const std::string & mapname_bak, const bool same_file )
{
struct stat istat, ostat, mapstat;
bool iexists = false, oexists = false, mapexists = false;
bool same = ( std::strcmp( iname, oname ) == 0 );
if( !same )
{
iexists = ( stat( iname, &istat ) == 0 );
oexists = ( stat( oname, &ostat ) == 0 );
if( iexists && oexists && istat.st_ino == ostat.st_ino &&
istat.st_dev == ostat.st_dev ) same = true;
}
if( same && !same_file )
{ show_error( "Infile and outfile are the same." ); return true; }
if( mapname )
{
same = ( std::strcmp( iname, mapname ) == 0 );
if( !same )
{
mapexists = ( stat( mapname, &mapstat ) == 0 );
if( iexists && mapexists && istat.st_ino == mapstat.st_ino &&
istat.st_dev == mapstat.st_dev ) same = true;
}
if( same )
{ show_error( "Infile and mapfile are the same." ); return true; }
if( std::strcmp( oname, mapname ) == 0 ||
( oexists && mapexists && ostat.st_ino == mapstat.st_ino &&
ostat.st_dev == mapstat.st_dev ) )
{ show_error( "Outfile and mapfile are the same." ); return true; }
// just compare names because std::remove will break existing links
if( mapname_bak == iname )
{ show_error( "Infile and <mapfile>.bak are the same." ); return true; }
if( mapname_bak == oname )
{ show_error( "Outfile and <mapfile>.bak are the same." ); return true; }
}
return false;
}
bool check_files( const char * const iname, const char * const oname,
const char * const mapname, const Rb_options & rb_opts,
const bool force, const bool generate,
const bool preallocate )
{
if( !iname || !oname )
{
show_error( "Both input and output files must be specified.", 0, true );
return false;
}
std::string mapname_bak;
if( mapname ) { mapname_bak = mapname; mapname_bak += ".bak"; }
if( check_identical( iname, oname, mapname, mapname_bak, rb_opts.same_file ) )
return false;
if( mapname )
{
struct stat st;
if( stat( mapname, &st ) == 0 && !S_ISREG( st.st_mode ) )
{ show_error( "Mapfile exists and is not a regular file." );
return false; }
if( stat( mapname_bak.c_str(), &st ) == 0 && !S_ISREG( st.st_mode ) )
{ show_error( "<mapfile>.bak exists and is not a regular file." );
return false; }
}
if( !generate && ( rb_opts.min_outfile_size > 0 || !force ||
preallocate || rb_opts.sparse ) )
{
struct stat st;
if( stat( oname, &st ) == 0 && !S_ISREG( st.st_mode ) )
{
show_error( "Output file exists and is not a regular file." );
if( !force )
show_error( "Use '--force' if you really want to overwrite it, but be\n"
" aware that all existing data in the output file will be lost.",
0, true );
else if( rb_opts.min_outfile_size > 0 )
show_error( "Only regular files can be extended.", 0, true );
else if( preallocate )
show_error( "Only regular files can be preallocated.", 0, true );
else if( rb_opts.sparse )
show_error( "Only regular files can be sparse.", 0, true );
return false;
}
}
return true;
}
int do_fill( const long long offset, Domain & domain,
const Fb_options & fb_opts, const Mb_options & mb_opts,
const char * const iname, const char * const oname,
const char * const mapname, const int cluster, const int hardbs,
const int o_direct_out, const bool synchronous )
{
if( !mapname )
{ show_error( "Mapfile required in fill mode.", 0, true ); return 1; }
Fillbook fillbook( offset, domain, fb_opts, mb_opts, mapname, cluster,
hardbs, synchronous );
if( !fillbook.mapfile_exists() ) return not_readable( mapname );
if( fillbook.domain().empty() ) return empty_domain();
if( fillbook.read_only() ) return not_writable( mapname );
const int ides = open( iname, O_RDONLY | O_BINARY );
if( ides < 0 )
{ show_error( "Can't open input file", errno ); return 1; }
if( !fillbook.read_buffer( ides ) )
{ show_error( "Error reading fill data from input file", errno ); return 1; }
if( close( ides ) != 0 )
{ show_error( "Error closing infile", errno ); return 1; }
const int odes = open( oname, O_CREAT | O_WRONLY | o_direct_out | O_BINARY,
outmode );
if( odes < 0 )
{ show_error( "Can't open output file", errno ); return 1; }
if( lseek( odes, 0, SEEK_SET ) )
{ show_error( "Output file is not seekable." ); return 1; }
if( verbosity >= 0 )
std::printf( "%s %s\n", Program_name, PROGVERSION );
if( verbosity >= 1 )
{
std::printf( "About to fill with data from '%s' blocks of '%s' marked '%s'\n",
iname, oname, fb_opts.filltypes.c_str() );
std::printf( " Maximum size to fill: %sBytes\n",
format_num( fillbook.domain().in_size() ) );
std::printf( " Starting positions: infile = %sB, outfile = %sB\n",
format_num( fillbook.domain().pos() ),
format_num( fillbook.domain().pos() + fillbook.offset() ) );
std::printf( " Copy block size: %3d sectors\n", cluster );
std::printf( "Sector size: %sBytes\n", format_num( hardbs, 99999 ) );
std::printf( "Direct out: %s\n\n", o_direct_out ? "yes" : "no" );
}
return fillbook.do_fill( odes );
}
int do_generate( const long long offset, Domain & domain,
const Mb_options & mb_opts, const char * const iname,
const char * const oname, const char * const mapname,
const int cluster, const int hardbs )
{
if( !mapname )
{
show_error( "Mapfile must be specified in generate mode.", 0, true );
return 1;
}
const int ides = open( iname, O_RDONLY | O_BINARY );
if( ides < 0 )
{ show_error( "Can't open input file", errno ); return 1; }
const long long insize = lseek( ides, 0, SEEK_END );
if( insize < 0 )
{ show_error( "Input file is not seekable." ); return 1; }
Genbook genbook( offset, insize, domain, mb_opts, mapname, cluster, hardbs );
if( genbook.domain().empty() ) return empty_domain();
if( !genbook.blank() && genbook.current_status() != Mapfile::generating )
{
show_error( "Mapfile alredy exists and is not empty.", 0, true );
return 1;
}
if( genbook.read_only() ) return not_writable( mapname );
const int odes = open( oname, O_RDONLY | O_BINARY );
if( odes < 0 )
{ show_error( "Can't open output file", errno ); return 1; }
if( lseek( odes, 0, SEEK_SET ) )
{ show_error( "Output file is not seekable." ); return 1; }
if( verbosity >= 0 )
std::printf( "%s %s\n", Program_name, PROGVERSION );
if( verbosity >= 1 )
{
std::printf( "About to generate an approximate mapfile for '%s' and '%s'\n",
iname, oname );
std::printf( " Starting positions: infile = %sB, outfile = %sB\n",
format_num( genbook.domain().pos() ),
format_num( genbook.domain().pos() + genbook.offset() ) );
std::printf( " Copy block size: %3d sectors\n", cluster );
std::printf( "Sector size: %sBytes\n\n", format_num( hardbs, 99999 ) );
}
return genbook.do_generate( odes );
}
void device_id_and_size( const long long size, const int fd,
std::string & id_str )
{
struct stat st;
if( fstat( fd, &st ) == 0 && S_ISBLK( st.st_mode ) )
{
if( device_id( fd, id_str ) ) { id_str.insert( 0, " [" ); id_str += ']'; }
else id_str = " [UNKNOWN]";
}
id_str += " ("; id_str += format_num3( size ); id_str += ')';
}
void about_to_copy( const Rescuebook & rescuebook, const char * const iname,
const char * const oname, const long long insize,
const int ides, const bool ask )
{
if( ask || verbosity >= 0 )
std::printf( "%s %s\n", Program_name, PROGVERSION );
if( ask || verbosity >= 1 )
{
std::string iid, oid;
char c = ' '; const char * p = " "; // show on one line
if( ask || verbosity >= 2 )
{
device_id_and_size( insize, ides, iid );
const int odes = open( oname, O_RDONLY );
if( odes >= 0 )
{
device_id_and_size( lseek( odes, 0, SEEK_END ), odes, oid );
close( odes );
}
if( ask ) { c = '\n'; p = "\n "; } // show on separate lines
}
std::printf( "About to copy %sBytes%cfrom '%s'%s%sto '%s'%s\n",
rescuebook.domain().full() ? "an unknown number of " :
format_num( rescuebook.domain().in_size() ),
c, iname, iid.c_str(), p, oname, oid.c_str() );
}
}
bool user_agrees_ids( const Rescuebook & rescuebook, const char * const iname,
const char * const oname, const long long insize,
const int ides )
{
about_to_copy( rescuebook, iname, oname, insize, ides, true );
std::fputs( "Proceed (y/N)? ", stdout );
std::fflush( stdout );
return ( std::tolower( std::fgetc( stdin ) ) == 'y' );
}
long long adjusted_insize( const int ides, const Domain * const test_domain )
{
long long insize = lseek( ides, 0, SEEK_END );
if( insize >= 0 && test_domain )
{
const long long size = test_domain->end();
if( insize <= 0 || insize > size ) insize = size;
}
return insize;
}
int do_rescue( const long long offset, Domain & domain,
const Domain * const test_domain, const Mb_options & mb_opts,
const Rb_options & rb_opts, const char * const iname,
const char * const oname, const char * const mapname,
const int cluster, const int hardbs, const int o_direct_out,
const int o_trunc, const bool ask, const bool command_mode,
const bool preallocate, const bool synchronous,
const bool verify_input_size )
{
if( rb_opts.same_file && o_trunc )
{
show_error( "Option '--same-file' is incompatible with '--truncate'.", 0, true );
return 1;
}
// use same flags as reopen_infile
const int ides = open( iname, O_RDONLY | rb_opts.o_direct_in | O_BINARY );
if( ides < 0 )
{ show_error( "Can't open input file", errno ); return 1; }
const long long insize = adjusted_insize( ides, test_domain );
if( insize < 0 )
{ show_error( "Input file is not seekable." ); return 1; }
Rescuebook rescuebook( offset, insize, domain, test_domain, mb_opts, rb_opts,
iname, mapname, cluster, hardbs, synchronous );
if( verify_input_size )
{
if( !rescuebook.mapfile_exists() || insize <= 0 ||
rescuebook.mapfile_insize() <= 0 ||
rescuebook.mapfile_insize() >= LLONG_MAX )
{
show_error( "Can't verify input file size.\n"
" Mapfile is unfinished or missing, or size is invalid." );
return 1;
}
if( rescuebook.mapfile_insize() != insize )
{
show_error( "Input file size differs from size calculated from mapfile." );
return 1;
}
}
if( rescuebook.domain().empty() )
{
if( rescuebook.complete_only && !rescuebook.mapfile_exists() )
{ show_error( "Nothing to complete; mapfile is missing or empty.", 0, true );
return 1; }
return empty_domain();
}
if( o_trunc && !rescuebook.blank() )
{
show_error( "Outfile truncation and mapfile input are incompatible.", 0, true );
return 1;
}
if( rescuebook.read_only() ) return not_writable( mapname );
if( ask && !user_agrees_ids( rescuebook, iname, oname, insize, ides ) )
return 1;
const int odes = open( oname, O_CREAT | O_WRONLY | o_direct_out |
o_trunc | O_BINARY, outmode );
if( odes < 0 )
{ show_error( "Can't open output file", errno ); return 1; }
if( lseek( odes, 0, SEEK_SET ) )
{ show_error( "Output file is not seekable." ); return 1; }
if( preallocate && lseek( odes, 0, SEEK_END ) - rescuebook.offset() <
rescuebook.domain().end() )
{
#if defined _POSIX_ADVISORY_INFO && _POSIX_ADVISORY_INFO > 0
if( posix_fallocate( odes, rescuebook.domain().pos() + rescuebook.offset(),
rescuebook.domain().size() ) != 0 )
{ show_error( "Can't preallocate output file", errno ); return 1; }
#else
show_error( "warning: Preallocation not available." );
#endif
}
if( rescuebook.filename() && !rescuebook.mapfile_exists() &&
!rescuebook.write_mapfile( 0, true ) )
{ show_error( "Can't create mapfile", errno ); return 1; }
if( command_mode ) return rescuebook.do_commands( ides, odes );
if( !event_logger.open_file() )
{ show_error( "Can't open file for logging events", errno ); return 1; }
if( !rate_logger.open_file() )
{ show_error( "Can't open file for logging rates", errno ); return 1; }
if( !read_logger.open_file() )
{ show_error( "Can't open file for logging reads", errno ); return 1; }
if( !ask ) about_to_copy( rescuebook, iname, oname, insize, ides, false );
if( verbosity >= 1 )
{
std::printf( " Starting positions: infile = %sB, outfile = %sB\n",
format_num( rescuebook.domain().pos() ),
format_num( rescuebook.domain().pos() + rescuebook.offset() ) );
std::printf( " Copy block size: %3d sectors", cluster );
if( rescuebook.skipbs > 0 )
std::printf( " Initial skip size: %lld sectors\n",
rescuebook.skipbs / hardbs );
else
std::fputs( " Skipping disabled\n", stdout );
std::printf( "Sector size: %sBytes\n", format_num( hardbs, 99999 ) );
if( verbosity >= 2 )
{
bool nl = false;
if( rescuebook.max_error_rate >= 0 )
{ nl = true; std::printf( "Max error rate: %6sB/s ",
format_num( rescuebook.max_error_rate, 99999 ) ); }
if( rescuebook.max_bad_areas < ULONG_MAX )
{
nl = true;
std::printf( "Max %sbad areas: %lu ", rescuebook.new_bad_areas_only ?
"new " : "", rescuebook.max_bad_areas );
}
if( nl ) { nl = false; std::fputc( '\n', stdout ); }
if( rescuebook.max_read_rate > 0 )
{ nl = true; std::printf( "Max read rate: %6sB/s ",
format_num( rescuebook.max_read_rate, 99999 ) ); }
if( rescuebook.min_read_rate == 0 )
{ nl = true; std::fputs( "Min read rate: auto ", stdout ); }
else if( rescuebook.min_read_rate > 0 )
{ nl = true; std::printf( "Min read rate: %6sB/s ",
format_num( rescuebook.min_read_rate, 99999 ) ); }
if( nl ) { nl = false; std::fputc( '\n', stdout ); }
if( rescuebook.timeout >= 0 )
{ nl = true; std::printf( "Timeout: %-7s ",
format_time( rescuebook.timeout ) ); }
if( rescuebook.pause_on_error > 0 )
{ nl = true; std::printf( "Pause on error: %ss ",
rescuebook.pause_on_error.to_decimal().c_str() ); }
if( rescuebook.pause_on_pass > 0 )
{ nl = true; std::printf( "Pause on pass: %s",
format_time( rescuebook.pause_on_pass ) ); }
if( nl ) { nl = false; std::fputc( '\n', stdout ); }
std::printf( "Direct in: %s ", rescuebook.o_direct_in ? "yes" : "no " );
std::printf( "Direct out: %s ", o_direct_out ? "yes" : "no " );
std::printf( "Sparse: %s ", rescuebook.sparse ? "yes" : "no " );
std::printf( "Truncate: %s ", o_trunc ? "yes" : "no " );
std::fputc( '\n', stdout );
std::printf( "Trim: %s ", !rescuebook.notrim ? "yes" : "no " );
std::printf( "Scrape: %s ", !rescuebook.noscrape ? "yes" : "no " );
if( rescuebook.max_retries >= 0 )
std::printf( "Max retry passes: %d", rescuebook.max_retries );
std::fputc( '\n', stdout );
if( rescuebook.complete_only )
{ nl = true; std::fputs( "Complete only ", stdout ); }
if( rescuebook.reverse )
{ nl = true; std::fputs( "Reverse mode", stdout ); }
if( nl ) { nl = false; std::fputc( '\n', stdout ); }
}
std::fputc( '\n', stdout );
}
return rescuebook.do_rescue( ides, odes );
}
} // end namespace
#include "main_common.cc"
namespace {
void parse_cpass( const char * p, Rb_options & rb_opts )
{
rb_opts.cpass_bitset = 0;
if( *p == '0' ) { if( p[1] == 0 ) return; }
else while( true )
{
const unsigned char ch1 = *p++;
if( ch1 < '1' || ch1 > '5' ) break;
if( *p != '-' ) rb_opts.cpass_bitset |= ( 1 << ( ch1 - '1' ) );
else
{
++p;
if( *p < '1' || *p > '5' || ch1 > *p ) break;
for( int c = ch1; c <= *p; ++c )
rb_opts.cpass_bitset |= ( 1 << ( c - '1' ) );
++p;
}
if( *p == 0 ) return;
if( *p == ',' ) ++p; else break;
}
show_error( "Invalid pass or range of passes in option '--cpass'" );
std::exit( 1 );
}
void parse_mapfile_intervals( const char * const ptr, Mb_options & mb_opts )
{
const char * const ptr2 = std::strchr( ptr, ',' );
if( !ptr2 || ptr2 != ptr )
{
if( ptr[0] == '-' && ptr[1] == '1' && ( ptr[2] == 0 || ptr[2] == ',' ) )
mb_opts.mapfile_save_interval = -1;
else mb_opts.mapfile_save_interval = parse_time_interval( ptr, true );
}
if( ptr2 )
mb_opts.mapfile_sync_interval = parse_time_interval( ptr2 + 1 );
if( mb_opts.mapfile_sync_interval < 5 )
{
show_error( "Minimum 'mapfile sync interval' is 5 seconds." );
std::exit( 1 );
}
if( mb_opts.mapfile_save_interval > mb_opts.mapfile_sync_interval )
{
show_error( "'mapfile save interval' is larger than 'mapfile sync interval'." );
std::exit( 1 );
}
}
void parse_pause_on_error( const char * const p, Rb_options & rb_opts )
{
rb_opts.simulated_poe = ( p[0] == 's' );
if( rb_opts.simulated_poe )
rb_opts.pause_on_error = parse_rational_time( p + 1 );
else
rb_opts.pause_on_error = parse_time_interval( p );
}
void parse_skipbs( const char * const ptr, Rb_options & rb_opts,
const int hardbs )
{
const char * tail = ptr;
if( tail[0] != ',' )
rb_opts.skipbs = getnum( ptr, hardbs, 0, rb_opts.max_max_skipbs, &tail );
if( tail[0] == ',' )
rb_opts.max_skipbs = getnum( tail + 1, hardbs, Rb_options::min_skipbs,
rb_opts.max_max_skipbs, &tail );
if( tail[0] )
{
show_error( "Bad separator in argument of '--skip-size'", 0, true );
std::exit( 1 );
}
if( rb_opts.skipbs > 0 && rb_opts.skipbs < Rb_options::min_skipbs )
{
show_error( "Minimum initial skip size is 64KiB." );
std::exit( 1 );
}
if( rb_opts.skipbs > rb_opts.max_skipbs )
{
show_error( "'initial skip size' is larger than 'max skip size'." );
std::exit( 1 );
}
}
void check_o_direct()
{
if( O_DIRECT == 0 )
{ show_error( "Direct disc access not available." ); std::exit( 1 ); }
}
} // end namespace
bool Rescuebook::reopen_infile()
{
if( ides_ >= 0 ) close( ides_ );
// use same flags as do_rescue
ides_ = open( iname_, O_RDONLY | o_direct_in | O_BINARY );
if( ides_ < 0 )
{ final_msg( "Can't reopen input file", errno ); return false; }
const long long insize = lseek( ides_, 0, SEEK_END );
if( insize < 0 )
{ final_msg( "Input file has become not seekable", errno ); return false; }
return true;
}
// separates large numbers in groups of 3 digits using '_'
const char * format_num3( long long num )
{
enum { buffers = 8, bufsize = 4 * sizeof (long long) };
static char buffer[buffers][bufsize]; // circle of static buffers for printf
static int current = 0;
char * const buf = buffer[current++]; current %= buffers;
char * p = buf + bufsize - 1; // fill the buffer backwards
*p = 0; // terminator
const bool negative = num < 0;
if( negative ) num = -num;
const bool split = num >= 100000;
for( int i = 0; ; )
{
*(--p) = num % 10 + '0'; num /= 10; if( num == 0 ) break;
if( split && ++i >= 3 ) { i = 0; *(--p) = '_'; }
}
if( negative ) *(--p) = '-';
return p;
}
int main( const int argc, const char * const argv[] )
{
long long ipos = 0;
long long opos = -1;
long long max_size = -1;
const char * domain_mapfile_name = 0;
const char * test_mode_mapfile_name = 0;
const int cluster_bytes = 65536;
const int default_hardbs = 512;
const int max_hardbs = 1 << 28;
int cluster = 0;
int hardbs = default_hardbs;
int o_direct_out = 0; // O_DIRECT or 0
int o_trunc = 0; // O_TRUNC or 0
Mode program_mode = m_none;
Fb_options fb_opts;
Mb_options mb_opts;
Rb_options rb_opts;
bool ask = false;
bool force = false;
bool loose = false;
bool preallocate = false;
bool synchronous = false;
bool verify_input_size = false;
if( argc > 0 ) invocation_name = argv[0];
command_line = invocation_name;
for( int i = 1; i < argc; ++i )
{ command_line += ' '; command_line += argv[i]; }
enum { opt_ask = 256, opt_cm, opt_cpa, opt_ds, opt_eoe, opt_eve, opt_mi,
opt_msr, opt_poe, opt_pop, opt_rat, opt_rea, opt_rs, opt_sf };
const Arg_parser::Option options[] =
{
{ 'a', "min-read-rate", Arg_parser::yes },
{ 'A', "try-again", Arg_parser::no },
{ 'b', "sector-size", Arg_parser::yes },
{ 'B', "binary-prefixes", Arg_parser::no },
{ 'c', "cluster-size", Arg_parser::yes },
{ 'C', "complete-only", Arg_parser::no },
{ 'd', "direct", Arg_parser::no },
{ 'd', "idirect", Arg_parser::no },
{ 'D', "odirect", Arg_parser::no },
{ 'e', "max-bad-areas", Arg_parser::yes },
{ 'e', "max-errors", Arg_parser::yes },
{ 'E', "max-error-rate", Arg_parser::yes },
{ 'f', "force", Arg_parser::no },
{ 'F', "fill-mode", Arg_parser::yes },
{ 'G', "generate-mode", Arg_parser::no },
{ 'h', "help", Arg_parser::no },
{ 'H', "test-mode", Arg_parser::yes },
{ 'i', "input-position", Arg_parser::yes },
{ 'I', "verify-input-size", Arg_parser::no },
{ 'J', "verify-on-error", Arg_parser::no },
{ 'K', "skip-size", Arg_parser::yes },
{ 'L', "loose-domain", Arg_parser::no },
{ 'm', "domain-mapfile", Arg_parser::yes },
{ 'm', "domain-logfile", Arg_parser::yes },
{ 'M', "retrim", Arg_parser::no },
{ 'n', "no-scrape", Arg_parser::no },
{ 'N', "no-trim", Arg_parser::no },
{ 'o', "output-position", Arg_parser::yes },
{ 'O', "reopen-on-error", Arg_parser::no },
{ 'p', "preallocate", Arg_parser::no },
{ 'P', "data-preview", Arg_parser::maybe },
{ 'q', "quiet", Arg_parser::no },
{ 'r', "retry-passes", Arg_parser::yes },
{ 'R', "reverse", Arg_parser::no },
{ 's', "size", Arg_parser::yes },
{ 'S', "sparse", Arg_parser::no },
{ 't', "truncate", Arg_parser::no },
{ 'T', "timeout", Arg_parser::yes },
{ 'u', "unidirectional", Arg_parser::no },
{ 'v', "verbose", Arg_parser::no },
{ 'V', "version", Arg_parser::no },
{ 'w', "ignore-write-errors", Arg_parser::no },
{ 'x', "extend-outfile", Arg_parser::yes },
{ 'X', "max-read-errors", Arg_parser::yes },
{ 'y', "synchronous", Arg_parser::no },
{ 'Z', "max-read-rate", Arg_parser::yes },
{ opt_ask, "ask", Arg_parser::no },
{ opt_cm, "command-mode", Arg_parser::no },
{ opt_cpa, "cpass", Arg_parser::yes },
{ opt_ds, "delay-slow", Arg_parser::yes },
{ opt_eoe, "exit-on-error", Arg_parser::no },
{ opt_eve, "log-events", Arg_parser::yes },
{ opt_mi, "mapfile-interval", Arg_parser::yes },
{ opt_msr, "max-slow-reads", Arg_parser::yes },
{ opt_poe, "pause-on-error", Arg_parser::yes },
{ opt_pop, "pause-on-pass", Arg_parser::yes },
{ opt_pop, "pause", Arg_parser::yes },
{ opt_rat, "log-rates", Arg_parser::yes },
{ opt_rea, "log-reads", Arg_parser::yes },
{ opt_rs, "reset-slow", Arg_parser::no },
{ opt_sf, "same-file", Arg_parser::no },
{ 0 , 0, Arg_parser::no } };
const Arg_parser parser( argc, argv, options );
if( parser.error().size() ) // bad option
{ show_error( parser.error().c_str(), 0, true ); return 1; }
int argind = 0;
for( ; argind < parser.arguments(); ++argind )
{
const int code = parser.code( argind );
if( !code ) break; // no more options
const std::string & sarg = parser.argument( argind );
const char * const arg = sarg.c_str();
switch( code )
{
case 'a': rb_opts.min_read_rate = getnum( arg, hardbs, 0 ); break;
case 'A': rb_opts.try_again = true; break;
case 'b': hardbs = getnum( arg, 0, 1, max_hardbs ); break;
case 'B': format_num( 0, 0, -1 ); break; // set binary prefixes
case 'c': cluster = getnum( arg, 0, 1, INT_MAX ); break;
case 'C': rb_opts.complete_only = true; break;
case 'd': rb_opts.o_direct_in = O_DIRECT; check_o_direct(); break;
case 'D': o_direct_out = O_DIRECT; check_o_direct(); break;
case 'e': rb_opts.new_bad_areas_only = ( arg[0] == '+' );
rb_opts.max_bad_areas = getnum( arg, 0, 0, LONG_MAX ); break;
case 'E': rb_opts.max_error_rate = getnum( arg, hardbs, 0 ); break;
case 'f': force = true; break;
case 'F': set_mode( program_mode, m_fill ); fb_opts.filltypes = sarg;
fb_opts.write_location_data =
check_types( fb_opts.filltypes, "fill-mode", true ); break;
case 'G': set_mode( program_mode, m_generate ); break;
case 'h': show_help( cluster_bytes / default_hardbs, default_hardbs );
return 0;
case 'H': set_name( &test_mode_mapfile_name, arg, code ); break;
case 'i': ipos = getnum( arg, hardbs, 0 ); break;
case 'I': verify_input_size = true; break;
case 'J': rb_opts.verify_on_error = true; break;
case 'K': parse_skipbs( arg, rb_opts, hardbs ); break;
case 'L': loose = true; break;
case 'm': set_name( &domain_mapfile_name, arg, code ); break;
case 'M': rb_opts.retrim = true; break;
case 'n': rb_opts.noscrape = true; break;
case 'N': rb_opts.notrim = true; break;
case 'o': opos = getnum( arg, hardbs, 0 ); break;
case 'O': rb_opts.reopen_on_error = true; break;
case 'p': preallocate = true; break;
case 'P': rb_opts.preview_lines = arg[0] ? getnum( arg, 0, 1, 32 ) : 3;
break;
case 'q': verbosity = -1; break;
case 'r': rb_opts.max_retries = getnum( arg, 0, -1, INT_MAX / 2 ); break;
case 'R': rb_opts.reverse = true; break;
case 's': max_size = getnum( arg, hardbs, -1 ); break;
case 'S': rb_opts.sparse = true; break;
case 't': o_trunc = O_TRUNC; break;
case 'T': rb_opts.timeout = parse_time_interval( arg ); break;
case 'u': rb_opts.unidirectional = true; break;
case 'v': if( verbosity < 4 ) ++verbosity; break;
case 'V': show_version(); return 0;
case 'w': fb_opts.ignore_write_errors = true; break;
case 'x': rb_opts.min_outfile_size = getnum( arg, hardbs, 1 ); break;
case 'X': rb_opts.max_read_errors = getnum( arg, 0, 0, LONG_MAX ); break;
case 'y': synchronous = true; break;
case 'Z': rb_opts.max_read_rate = getnum( arg, hardbs, 1 ); break;
case opt_ask: ask = true; break;
case opt_cm: set_mode( program_mode, m_command ); break;
case opt_cpa: parse_cpass( arg, rb_opts ); break;
case opt_ds: rb_opts.delay_slow = parse_time_interval( arg ); break;
case opt_eoe: rb_opts.max_read_errors = 0; break;
case opt_eve: if( event_logger.set_filename( arg ) ) break;
show_error( "Events logfile exists and is not a regular file." );
return 1;
case opt_mi: parse_mapfile_intervals( arg, mb_opts ); break;
case opt_msr: rb_opts.max_slow_reads = getnum( arg, 0, 0, LONG_MAX );
break;
case opt_poe: parse_pause_on_error( arg, rb_opts ); break;
case opt_pop: rb_opts.pause_on_pass = parse_time_interval( arg ); break;
case opt_rat: if( rate_logger.set_filename( arg ) ) break;
show_error( "Rates logfile exists and is not a regular file." );
return 1;
case opt_rea: if( read_logger.set_filename( arg ) ) break;
show_error( "Reads logfile exists and is not a regular file." );
return 1;
case opt_rs: rb_opts.reset_slow = true; break;
case opt_sf: rb_opts.same_file = true; break;
default : internal_error( "uncaught option." );
}
} // end process options
if( opos < 0 ) opos = ipos;
if( hardbs < 1 ) hardbs = default_hardbs;
if( cluster >= INT_MAX / hardbs ) cluster = ( INT_MAX / hardbs ) - 1;
if( cluster < 1 ) cluster = cluster_bytes / hardbs;
if( cluster < 1 ) cluster = 1;
const char *iname = 0, *oname = 0, *mapname = 0;
if( argind < parser.arguments() ) iname = parser.argument( argind++ ).c_str();
if( argind < parser.arguments() ) oname = parser.argument( argind++ ).c_str();
if( argind < parser.arguments() ) mapname = parser.argument( argind++ ).c_str();
if( argind < parser.arguments() )
{ show_error( "Too many files.", 0, true ); return 1; }
// end scan arguments
if( !check_files( iname, oname, mapname, rb_opts, force,
program_mode == m_generate, preallocate ) )
return 1;
Domain domain( ipos, max_size, domain_mapfile_name, loose );
switch( program_mode )
{
case m_fill:
if( ask )
{ show_error( "Option '--ask' is incompatible with fill mode.", 0, true );
return 1; }
if( rb_opts.same_file )
{ show_error( "Option '--same-file' is incompatible with fill mode.", 0, true );
return 1; }
if( rb_opts != Rb_options() || test_mode_mapfile_name ||
verify_input_size || preallocate || o_trunc )
show_error( "warning: Options -aACdeEHIJKlMnOpPrRStTuxX are ignored in fill mode." );
return do_fill( opos - ipos, domain, fb_opts, mb_opts, iname, oname,
mapname, cluster, hardbs, o_direct_out, synchronous );
case m_generate:
if( ask )
{ show_error( "Option '--ask' is incompatible with generate mode.", 0, true );
return 1; }
if( fb_opts != Fb_options() || rb_opts != Rb_options() || synchronous ||
test_mode_mapfile_name || verify_input_size || preallocate ||
o_direct_out || o_trunc )
show_error( "warning: Options -aACdDeEHIJKlMnOpPrRStTuwxXy are ignored in generate mode." );
return do_generate( opos - ipos, domain, mb_opts, iname, oname, mapname,
cluster, hardbs );
case m_command:
case m_none:
{
if( fb_opts != Fb_options() )
{ show_error( "Option '-w' is incompatible with rescue mode.", 0, true );
return 1; }
const Domain test_domain( 0, -1, test_mode_mapfile_name, loose );
return do_rescue( opos - ipos, domain,
test_mode_mapfile_name ? &test_domain : 0, mb_opts,
rb_opts, iname, oname, mapname, cluster, hardbs,
o_direct_out, o_trunc, ask, program_mode == m_command,
preallocate, synchronous, verify_input_size );
}
}
}