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
|
/* GNU ddrescue - Data recovery tool
Copyright (C) 2004, 2005, 2006 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, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/*
Return values: 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 <cerrno>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <string>
#include <vector>
#include <fcntl.h>
#include <unistd.h>
#include <sys/stat.h>
#include "arg_parser.h"
#include "ddrescue.h"
#include <cstring>
namespace {
// Date of this version: 2006-04-03
const char * invocation_name = 0;
const char * const Program_name = "GNU ddrescue";
const char * const program_name = "ddrescue";
const char * const program_version = "1.2";
const char * const program_year = "2006";
void show_help( const int cluster, const int hardbs ) throw()
{
std::printf( "%s - Data recovery tool.\n", Program_name );
std::printf( "Copies data from one file or block device to another,\n" );
std::printf( "trying hard to rescue data in case of read errors.\n" );
std::printf( "\nUsage: %s [options] infile outfile [logfile]\n", invocation_name );
std::printf( "Options:\n" );
std::printf( " -h, --help display this help and exit\n" );
std::printf( " -V, --version output version information and exit\n" );
std::printf( " -b, --block-size=<bytes> hardware block size of input device [%d]\n", hardbs );
std::printf( " -B, --binary-prefixes show binary multipliers in numbers [default SI]\n" );
std::printf( " -c, --cluster-size=<blocks> hardware blocks to copy at a time [%d]\n", cluster );
std::printf( " -C, --complete-only do not read new data beyond logfile limits\n" );
std::printf( " -e, --max-errors=<n> maximum number of error areas allowed\n" );
std::printf( " -i, --input-position=<pos> starting position in input file [0]\n" );
std::printf( " -n, --no-split do not try to split error areas\n" );
std::printf( " -o, --output-position=<pos> starting position in output file [ipos]\n" );
std::printf( " -q, --quiet quiet operation\n" );
std::printf( " -r, --max-retries=<n> exit after given retries (-1=infinity) [0]\n" );
std::printf( " -s, --max-size=<bytes> maximum size of data to be copied\n" );
std::printf( " -t, --truncate truncate output file\n" );
std::printf( " -v, --verbose verbose operation\n" );
std::printf( "Numbers may be followed by a multiplier: b = blocks, k = kB = 10^3 = 1000,\n" );
std::printf( "Ki = KiB = 2^10 = 1024, M = 10^6, Mi = 2^20, G = 10^9, Gi = 2^30, etc...\n" );
std::printf( "\nReport bugs to bug-ddrescue@gnu.org\n");
}
void show_version() throw()
{
std::printf( "%s version %s\n", Program_name, program_version );
std::printf( "Copyright (C) %s Antonio Diaz Diaz.\n", program_year );
std::printf( "This program is free software; you may redistribute it under the terms of\n" );
std::printf( "the GNU General Public License. This program has absolutely no warranty.\n" );
}
long long getnum( const char * ptr, const int bs,
const long long min = LONG_LONG_MIN + 1,
const long long max = LONG_LONG_MAX ) throw()
{
errno = 0;
char *tail;
long long result = ::strtoll( ptr, &tail, 0 );
if( tail == ptr )
{ show_error( "bad or missing numerical argument", 0, true ); std::exit(1); }
if( !errno && tail[0] )
{
int factor = ( tail[1] == 'i' ) ? 1024 : 1000;
int exponent = 0;
bool bad_multiplier = false;
switch( tail[0] )
{
case ' ': break;
case 'b': if( bs > 0 ) { factor = bs; exponent = 1; }
else bad_multiplier = true;
break;
case 'Y': exponent = 8; break;
case 'Z': exponent = 7; break;
case 'E': exponent = 6; break;
case 'P': exponent = 5; break;
case 'T': exponent = 4; break;
case 'G': exponent = 3; break;
case 'M': exponent = 2; break;
case 'K': if( factor == 1024 ) exponent = 1; else bad_multiplier = true;
break;
case 'k': if( factor == 1000 ) exponent = 1; else bad_multiplier = true;
break;
default: bad_multiplier = true;
}
if( bad_multiplier )
{ show_error( "bad multiplier in numerical argument", 0, true );
std::exit(1); }
for( int i = 0; i < exponent; ++i )
{
if( LONG_LONG_MAX / factor >= ::llabs( result ) ) result *= factor;
else { errno = ERANGE; break; }
}
}
if( !errno && ( result < min || result > max ) ) errno = ERANGE;
if( errno )
{ show_error( "numerical argument out of limits" ); std::exit(1); }
return result;
}
bool check_identical( const char * name1, const char * name2 ) throw()
{
if( !std::strcmp( name1, name2 ) ) return true;
struct stat stat1, stat2;
if( stat( name1, &stat1) || stat( name2, &stat2) ) return false;
return ( stat1.st_ino == stat2.st_ino && stat1.st_dev == stat2.st_dev );
}
} // end namespace
void internal_error( const char * msg ) throw()
{
char buf[80];
::snprintf( buf, sizeof( buf ), "internal error: %s.\n", msg );
show_error( buf );
exit( 3 );
}
void show_error( const char * msg, const int errcode, const bool help ) throw()
{
if( msg && msg[0] != 0 )
{
std::fprintf( stderr, "%s: %s", program_name, msg );
if( errcode > 0 ) std::fprintf( stderr, ": %s", strerror( errcode ) );
std::fprintf( stderr, "\n" );
}
if( help && invocation_name && invocation_name[0] != 0 )
std::fprintf( stderr, "Try `%s --help' for more information.\n", invocation_name );
}
void write_logfile_header( FILE * f ) throw()
{
std::fprintf( f, "# Rescue Logfile. Created by %s version %s\n",
Program_name, program_version );
}
int main( int argc, char * argv[] ) throw()
{
long long ipos = -1, opos = -1, max_size = -1;
const int cluster_bytes = 65536, default_hardbs = 512;
int cluster = 0, hardbs = 512;
int max_errors = -1, max_retries = 0, o_trunc = 0, verbosity = 0;
bool complete_only = false, nosplit = false;
invocation_name = argv[0];
static const Arg_parser::Option options[] =
{
{ 'b', "block-size", Arg_parser::yes },
{ 'B', "binary_prefixes", Arg_parser::no },
{ 'c', "cluster-size", Arg_parser::yes },
{ 'C', "complete-only", Arg_parser::no },
{ 'e', "max-errors", Arg_parser::yes },
{ 'h', "help", Arg_parser::no },
{ 'i', "input-position", Arg_parser::yes },
{ 'n', "no-split", Arg_parser::no },
{ 'o', "output-position", Arg_parser::yes },
{ 'q', "quiet", Arg_parser::no },
{ 'r', "max-retries", Arg_parser::yes },
{ 's', "max-size", Arg_parser::yes },
{ 't', "truncate", Arg_parser::no },
{ 'v', "verbose", Arg_parser::no },
{ 'V', "version", Arg_parser::no },
{ 0 , 0, Arg_parser::no } };
Arg_parser parser( argc, argv, options );
if( parser.error().size() ) // bad option
{ show_error( parser.error().c_str(), 0, true ); return 1; }
int argind;
for( argind = 0; argind < parser.arguments(); ++argind )
{
const int code = parser.code( argind );
if( !code ) break; // no more options
const char * arg = parser.argument( argind ).c_str();
switch( code )
{
case 'b': hardbs = getnum( arg, 0, 1, INT_MAX ); break;
case 'B': format_num( 0, 0, -1 ); break; // set binary prefixes
case 'c': cluster = getnum( arg, 1, 1, INT_MAX ); break;
case 'C': complete_only = true; break;
case 'e': max_errors = getnum( arg, 0, -1, INT_MAX ); break;
case 'h': show_help( cluster_bytes / default_hardbs, default_hardbs ); return 0;
case 'i': ipos = getnum( arg, hardbs, 0 ); break;
case 'n': nosplit = true; break;
case 'o': opos = getnum( arg, hardbs, 0 ); break;
case 'q': verbosity = -1; break;
case 'r': max_retries = getnum( arg, 0, -1, INT_MAX ); break;
case 's': max_size = getnum( arg, hardbs, -1 ); break;
case 't': o_trunc = O_TRUNC; break;
case 'v': verbosity = 1; break;
case 'V': show_version(); return 0;
default : internal_error( "uncaught option" );
}
} // end process options
if( hardbs < 1 ) hardbs = default_hardbs;
if( cluster < 1 ) cluster = cluster_bytes / hardbs;
if( cluster < 1 ) cluster = 1;
const char *iname = 0, *oname = 0, *logname = 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() ) logname = parser.argument( argind++ ).c_str();
if( argind < parser.arguments() )
{ show_error( "too many files", 0, true ); return 1; }
// end scan arguments
if( !iname || !oname )
{ show_error( "both input and output must be specified", 0, true );
return 1; }
if( check_identical ( iname, oname ) )
{ show_error( "infile and outfile are identical" ); return 1; }
int ides = open( iname, O_RDONLY );
if( ides < 0 ) { show_error( "cannot open input file", errno ); return 1; }
long long isize = lseek( ides, 0, SEEK_END );
if( isize < 0 ) { show_error( "input file is not seekable" ); return 1; }
Logbook logbook( ipos, opos, max_size, isize, logname, cluster, hardbs,
max_errors, max_retries, verbosity, complete_only, nosplit );
if( logbook.rescue_size() == 0 )
{ if( verbosity >= 0 ) { show_error( "Nothing to do" ); } return 0; }
if( o_trunc && !logbook.blank() )
{
show_error( "outfile truncation and logfile input are incompatible", 0, true );
return 1;
}
int odes = open( oname, O_WRONLY | O_CREAT | o_trunc, 0644 );
if( odes < 0 ) { show_error( "cannot 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( "\n\n" );
if( verbosity > 0 )
{
std::printf( "About to copy %sBytes from %s to %s\n",
( logbook.rescue_size() >= 0 ) ?
format_num( logbook.rescue_size() ) : "an undefined number of ",
iname, oname );
std::printf( " Starting positions: infile = %sB",
format_num( logbook.rescue_ipos() ) );
std::printf( ", outfile = %sB\n", format_num( logbook.rescue_opos() ) );
std::printf( " Copy block size: %d hard blocks\n", cluster );
std::printf( "Hard block size: %d bytes\n", hardbs );
if( max_errors >= 0 ) std::printf( "Max_errors: %d ", max_errors );
if( max_retries >= 0 ) std::printf( "Max_retries: %d ", max_retries );
std::printf( "Split: %s ", !nosplit ? "yes" : "no" );
std::printf( "Truncate: %s\n", o_trunc ? "yes" : "no" );
if( complete_only ) std::printf( "Complete only\n" );
std::printf( "\n" );
}
return logbook.do_rescue( ides, odes );
}
|