1 /* Lziprecover - Data recovery tool for the lzip format
2 Copyright (C) 2009-2021 Antonio Diaz Diaz.
3
4 This program is free software: you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation, either version 2 of the License, or
7 (at your option) any later version.
8
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
13
14 You should have received a copy of the GNU General Public License
15 along with this program. If not, see <http://www.gnu.org/licenses/>.
16 */
17
18 #define _FILE_OFFSET_BITS 64
19
20 #include <algorithm>
21 #include <cerrno>
22 #include <climits>
23 #include <cstdio>
24 #include <cstdlib>
25 #include <cstring>
26 #include <string>
27 #include <vector>
28 #include <stdint.h>
29 #include <unistd.h>
30 #include <sys/stat.h>
31
32 #include "lzip.h"
33 #include "decoder.h"
34 #include "lzip_index.h"
35
36
split(const long long pos)37 Block Block::split( const long long pos )
38 {
39 if( pos > pos_ && pos < end() )
40 {
41 const Block b( pos_, pos - pos_ );
42 pos_ = pos; size_ -= b.size_;
43 return b;
44 }
45 return Block( 0, 0 );
46 }
47
48 namespace {
49
50 bool pending_newline = false;
51
print_pending_newline(const char terminator)52 void print_pending_newline( const char terminator )
53 { if( pending_newline && terminator != '\n' ) std::fputc( '\n', stdout );
54 pending_newline = false; }
55
56
file_crc(uint32_t & crc,const int infd,const char * const filename)57 bool file_crc( uint32_t & crc, const int infd, const char * const filename )
58 {
59 const int buffer_size = 65536;
60 crc = 0xFFFFFFFFU;
61 uint8_t * const buffer = new uint8_t[buffer_size];
62 bool error = false;
63
64 while( true )
65 {
66 const int rd = readblock( infd, buffer, buffer_size );
67 if( rd != buffer_size && errno )
68 { show_file_error( filename, "Error reading input file", errno );
69 error = true; break; }
70 if( rd > 0 )
71 crc32.update_buf( crc, buffer, rd );
72 if( rd < buffer_size ) break; // EOF
73 }
74 delete[] buffer;
75 crc ^= 0xFFFFFFFFU;
76 return !error;
77 }
78
79
80 // Add 'bv' to 'block_vector' splitting blocks as needed to keep all the
81 // edges (pos and end of every block).
82 // 'block_vector' contains the result. 'bv' is destroyed.
combine(std::vector<Block> & block_vector,std::vector<Block> & bv)83 void combine( std::vector< Block > & block_vector, std::vector< Block > & bv )
84 {
85 if( block_vector.empty() ) { block_vector.swap( bv ); return; }
86 unsigned i1 = 0, i2 = 0;
87 while( i1 < block_vector.size() && i2 < bv.size() )
88 {
89 Block & b1 = block_vector[i1];
90 Block & b2 = bv[i2];
91 if( b1.overlaps( b2 ) )
92 {
93 if( b1 < b2 )
94 {
95 Block b = b1.split( b2.pos() );
96 block_vector.insert( block_vector.begin() + i1, b ); ++i1;
97 }
98 else if( b2 < b1 )
99 {
100 Block b( b2.pos(), b1.pos() - b2.pos() );
101 b2.split( b1.pos() );
102 block_vector.insert( block_vector.begin() + i1, b ); ++i1;
103 }
104 else if( b1.end() < b2.end() ) { b2.split( b1.end() ); ++i1; }
105 else if( b2.end() < b1.end() )
106 {
107 Block b = b1.split( b2.end() );
108 block_vector.insert( block_vector.begin() + i1, b ); ++i1; ++i2;
109 }
110 else { ++i1; ++i2; } // blocks are identical
111 }
112 else if( b1 < b2 ) ++i1;
113 else { block_vector.insert( block_vector.begin() + i1, b2 ); ++i1; ++i2; }
114 }
115 if( i2 < bv.size() ) // tail copy
116 block_vector.insert( block_vector.end(), bv.begin() + i2, bv.end() );
117 }
118
119
120 // positions in 'block_vector' are absolute file positions.
121 // blocks in 'block_vector' are ascending and don't overlap.
diff_member(const long long mpos,const long long msize,const std::vector<std::string> & filenames,const std::vector<int> & infd_vector,std::vector<Block> & block_vector,std::vector<int> & color_vector)122 bool diff_member( const long long mpos, const long long msize,
123 const std::vector< std::string > & filenames,
124 const std::vector< int > & infd_vector,
125 std::vector< Block > & block_vector,
126 std::vector< int > & color_vector )
127 {
128 const int files = infd_vector.size();
129 const int buffer_size = 65536;
130 uint8_t * const buffer1 = new uint8_t[buffer_size];
131 uint8_t * const buffer2 = new uint8_t[buffer_size];
132 int next_color = 1;
133
134 bool error = false;
135 for( int i1 = 0; i1 < files && !error; ++i1 )
136 {
137 for( int i2 = i1 + 1; i2 < files && !error; ++i2 )
138 {
139 if( color_vector[i1] != 0 && color_vector[i1] == color_vector[i2] )
140 continue;
141 std::vector< Block > bv;
142 long long partial_pos = 0;
143 const int fd1 = infd_vector[i1], fd2 = infd_vector[i2];
144 int begin = -1; // begin of block. -1 means no block
145 bool prev_equal = true;
146 if( !safe_seek( fd1, mpos ) || !safe_seek( fd2, mpos ) )
147 { error = true; break; }
148
149 while( partial_pos < msize )
150 {
151 const int size = std::min( (long long)buffer_size, msize - partial_pos );
152 const int rd = readblock( fd1, buffer1, size );
153 if( rd != size && errno )
154 { show_file_error( filenames[i1].c_str(), "Error reading input file",
155 errno ); error = true; break; }
156 if( rd > 0 )
157 {
158 if( readblock( fd2, buffer2, rd ) != rd )
159 { show_file_error( filenames[i2].c_str(), "Error reading input file",
160 errno ); error = true; break; }
161 for( int i = 0; i < rd; ++i )
162 {
163 if( buffer1[i] != buffer2[i] )
164 {
165 prev_equal = false;
166 if( begin < 0 ) begin = partial_pos + i; // begin block
167 }
168 else if( !prev_equal ) prev_equal = true;
169 else if( begin >= 0 ) // end block
170 {
171 Block b( mpos + begin, partial_pos + i - 1 - begin );
172 begin = -1;
173 bv.push_back( b );
174 }
175 }
176 partial_pos += rd;
177 }
178 if( rd < buffer_size ) break; // EOF
179 }
180 if( begin >= 0 ) // finish last block
181 {
182 Block b( mpos + begin, partial_pos - prev_equal - begin );
183 bv.push_back( b );
184 }
185 if( bv.empty() ) // members are identical, set to same color
186 {
187 if( color_vector[i1] == 0 )
188 {
189 if( color_vector[i2] != 0 ) color_vector[i1] = color_vector[i2];
190 else color_vector[i1] = color_vector[i2] = next_color++;
191 }
192 else if( color_vector[i2] == 0 ) color_vector[i2] = color_vector[i1];
193 else internal_error( "different colors assigned to identical members." );
194 }
195 combine( block_vector, bv );
196 }
197 if( color_vector[i1] == 0 ) color_vector[i1] = next_color++;
198 }
199 delete[] buffer2; delete[] buffer1;
200 return !error;
201 }
202
203
ipow(const unsigned base,const unsigned exponent)204 long ipow( const unsigned base, const unsigned exponent )
205 {
206 unsigned long result = 1;
207 for( unsigned i = 0; i < exponent; ++i )
208 {
209 if( LONG_MAX / result >= base ) result *= base;
210 else { result = LONG_MAX; break; }
211 }
212 return result;
213 }
214
215
open_input_files(const std::vector<std::string> & filenames,std::vector<int> & infd_vector,Lzip_index & lzip_index,struct stat * const in_statsp)216 int open_input_files( const std::vector< std::string > & filenames,
217 std::vector< int > & infd_vector,
218 Lzip_index & lzip_index, struct stat * const in_statsp )
219 {
220 const int files = filenames.size();
221 for( int i = 0; i + 1 < files; ++i )
222 for( int j = i + 1; j < files; ++j )
223 if( filenames[i] == filenames[j] )
224 { show_file_error( filenames[i].c_str(), "Input file given twice." );
225 return 2; }
226 {
227 std::vector< uint32_t > crc_vector( files );
228 for( int i = 0; i < files; ++i )
229 {
230 struct stat in_stats; // not used
231 infd_vector[i] = open_instream( filenames[i].c_str(),
232 ( i == 0 ) ? in_statsp : &in_stats, false, true );
233 if( infd_vector[i] < 0 ) return 1;
234 if( !file_crc( crc_vector[i], infd_vector[i], filenames[i].c_str() ) )
235 return 1;
236 for( int j = 0; j < i; ++j )
237 if( crc_vector[i] == crc_vector[j] )
238 { show_2file_error( "Input files", filenames[j].c_str(),
239 filenames[i].c_str(), "are identical." ); return 2; }
240 }
241 }
242
243 long long insize = 0;
244 int good_i = -1;
245 for( int i = 0; i < files; ++i )
246 {
247 long long tmp;
248 const Lzip_index li( infd_vector[i], true, true, true );
249 if( li.retval() == 0 ) // file format is intact
250 {
251 if( good_i < 0 ) { good_i = i; lzip_index = li; }
252 else if( lzip_index != li )
253 { show_2file_error( "Input files", filenames[good_i].c_str(),
254 filenames[i].c_str(), "are different." ); return 2; }
255 tmp = lzip_index.file_size();
256 }
257 else // file format is damaged
258 {
259 tmp = lseek( infd_vector[i], 0, SEEK_END );
260 if( tmp < 0 )
261 {
262 show_file_error( filenames[i].c_str(), "Input file is not seekable." );
263 return 1;
264 }
265 }
266 if( tmp < min_member_size )
267 { show_file_error( filenames[i].c_str(), "Input file is too short." );
268 return 2; }
269 if( i == 0 ) insize = tmp;
270 else if( insize != tmp )
271 { show_2file_error( "Sizes of input files", filenames[0].c_str(),
272 filenames[i].c_str(), "are different." ); return 2; }
273 }
274
275 if( lzip_index.retval() != 0 )
276 {
277 const Lzip_index li( infd_vector, insize );
278 if( li.retval() == 0 ) // file format could be recovered
279 lzip_index = li;
280 else
281 { show_error( "Format damaged in all input files." ); return 2; }
282 }
283
284 for( int i = 0; i < files; ++i )
285 {
286 const int infd = infd_vector[i];
287 bool error = false;
288 for( long j = 0; j < lzip_index.members(); ++j )
289 {
290 const long long mpos = lzip_index.mblock( j ).pos();
291 const long long msize = lzip_index.mblock( j ).size();
292 if( !safe_seek( infd, mpos ) ) return 1;
293 if( test_member_from_file( infd, msize ) != 0 ) { error = true; break; }
294 }
295 if( !error )
296 {
297 if( verbosity >= 1 )
298 std::printf( "File '%s' has no errors. Recovery is not needed.\n",
299 filenames[i].c_str() );
300 return 0;
301 }
302 }
303 return -1;
304 }
305
306
maybe_cluster_blocks(std::vector<Block> & block_vector)307 void maybe_cluster_blocks( std::vector< Block > & block_vector )
308 {
309 const unsigned long old_size = block_vector.size();
310 if( old_size <= 16 ) return;
311 do {
312 int min_gap = INT_MAX;
313 bool same = true; // all gaps have the same size
314 for( unsigned i = 1; i < block_vector.size(); ++i )
315 {
316 const long long gap = block_vector[i].pos() - block_vector[i-1].end();
317 if( gap < min_gap )
318 { if( min_gap < INT_MAX ) same = false; min_gap = gap; }
319 else if( gap != min_gap ) same = false;
320 }
321 if( min_gap >= INT_MAX || same ) break;
322 for( unsigned i = block_vector.size() - 1; i > 0; --i )
323 {
324 const long long gap = block_vector[i].pos() - block_vector[i-1].end();
325 if( gap == min_gap )
326 {
327 block_vector[i-1].size( block_vector[i-1].size() + gap +
328 block_vector[i].size() );
329 block_vector.erase( block_vector.begin() + i );
330 }
331 }
332 } while( block_vector.size() > 16 );
333 if( verbosity >= 1 && old_size > block_vector.size() )
334 std::printf( " %lu errors have been grouped in %lu clusters.\n",
335 old_size, (long)block_vector.size() );
336 }
337
338
color_done(const std::vector<int> & color_vector,const int i)339 bool color_done( const std::vector< int > & color_vector, const int i )
340 {
341 for( int j = i - 1; j >= 0; --j )
342 if( color_vector[j] == color_vector[i] ) return true;
343 return false;
344 }
345
346
347 // try dividing blocks in 2 color groups at every gap
try_merge_member2(const long long mpos,const long long msize,const std::vector<Block> & block_vector,const std::vector<int> & color_vector,const std::vector<int> & infd_vector,const char terminator)348 bool try_merge_member2( const long long mpos, const long long msize,
349 const std::vector< Block > & block_vector,
350 const std::vector< int > & color_vector,
351 const std::vector< int > & infd_vector,
352 const char terminator )
353 {
354 const int blocks = block_vector.size();
355 const int files = infd_vector.size();
356 const int variations = files * ( files - 1 );
357
358 for( int i1 = 0; i1 < files; ++i1 )
359 for( int i2 = 0; i2 < files; ++i2 )
360 {
361 if( i1 == i2 || color_vector[i1] == color_vector[i2] ||
362 color_done( color_vector, i1 ) ) continue;
363 for( int bi = 0; bi < blocks; ++bi )
364 if( !safe_seek( infd_vector[i2], block_vector[bi].pos() ) ||
365 !safe_seek( outfd, block_vector[bi].pos() ) ||
366 !copy_file( infd_vector[i2], outfd, block_vector[bi].size() ) )
367 cleanup_and_fail( 1 );
368 const int infd = infd_vector[i1];
369 const int var = ( i1 * ( files - 1 ) ) + i2 - ( i2 > i1 ) + 1;
370 for( int bi = 0; bi + 1 < blocks; ++bi )
371 {
372 if( verbosity >= 2 )
373 {
374 std::printf( " Trying variation %d of %d, block %d %c",
375 var, variations, bi + 1, terminator );
376 std::fflush( stdout ); pending_newline = true;
377 }
378 if( !safe_seek( infd, block_vector[bi].pos() ) ||
379 !safe_seek( outfd, block_vector[bi].pos() ) ||
380 !copy_file( infd, outfd, block_vector[bi].size() ) ||
381 !safe_seek( outfd, mpos ) )
382 cleanup_and_fail( 1 );
383 long long failure_pos = 0;
384 if( test_member_from_file( outfd, msize, &failure_pos ) == 0 )
385 return true;
386 if( mpos + failure_pos < block_vector[bi].end() ) break;
387 }
388 }
389 return false;
390 }
391
392
393 // merge block by block
try_merge_member(const long long mpos,const long long msize,const std::vector<Block> & block_vector,const std::vector<int> & color_vector,const std::vector<int> & infd_vector,const char terminator)394 bool try_merge_member( const long long mpos, const long long msize,
395 const std::vector< Block > & block_vector,
396 const std::vector< int > & color_vector,
397 const std::vector< int > & infd_vector,
398 const char terminator )
399 {
400 const int blocks = block_vector.size();
401 const int files = infd_vector.size();
402 const long variations = ipow( files, blocks );
403 if( variations >= LONG_MAX )
404 {
405 if( files > 2 )
406 show_error( "Too many damaged blocks. Try merging fewer files." );
407 else
408 show_error( "Too many damaged blocks. Merging is not possible." );
409 cleanup_and_fail( 2 );
410 }
411 int bi = 0; // block index
412 std::vector< int > file_idx( blocks, 0 ); // file to read each block from
413
414 while( bi >= 0 )
415 {
416 if( verbosity >= 2 )
417 {
418 long var = 0;
419 for( int i = 0; i < blocks; ++i )
420 var = ( var * files ) + file_idx[i];
421 std::printf( " Trying variation %ld of %ld %c",
422 var + 1, variations, terminator );
423 std::fflush( stdout ); pending_newline = true;
424 }
425 while( bi < blocks )
426 {
427 const int infd = infd_vector[file_idx[bi]];
428 if( !safe_seek( infd, block_vector[bi].pos() ) ||
429 !safe_seek( outfd, block_vector[bi].pos() ) ||
430 !copy_file( infd, outfd, block_vector[bi].size() ) )
431 cleanup_and_fail( 1 );
432 ++bi;
433 }
434 if( !safe_seek( outfd, mpos ) ) cleanup_and_fail( 1 );
435 long long failure_pos = 0;
436 if( test_member_from_file( outfd, msize, &failure_pos ) == 0 ) return true;
437 while( bi > 0 && mpos + failure_pos < block_vector[bi-1].pos() ) --bi;
438 while( --bi >= 0 )
439 {
440 while( ++file_idx[bi] < files &&
441 color_done( color_vector, file_idx[bi] ) );
442 if( file_idx[bi] < files ) break;
443 file_idx[bi] = 0;
444 }
445 }
446 return false;
447 }
448
449
450 // merge a single block split at every possible position
try_merge_member1(const long long mpos,const long long msize,const std::vector<Block> & block_vector,const std::vector<int> & color_vector,const std::vector<int> & infd_vector,const char terminator)451 bool try_merge_member1( const long long mpos, const long long msize,
452 const std::vector< Block > & block_vector,
453 const std::vector< int > & color_vector,
454 const std::vector< int > & infd_vector,
455 const char terminator )
456 {
457 if( block_vector.size() != 1 || block_vector[0].size() <= 1 ) return false;
458 const long long pos = block_vector[0].pos();
459 const long long size = block_vector[0].size();
460 const int files = infd_vector.size();
461 const int variations = files * ( files - 1 );
462 uint8_t byte;
463
464 for( int i1 = 0; i1 < files; ++i1 )
465 for( int i2 = 0; i2 < files; ++i2 )
466 {
467 if( i1 == i2 || color_vector[i1] == color_vector[i2] ||
468 color_done( color_vector, i1 ) ) continue;
469 const int infd = infd_vector[i1];
470 if( !safe_seek( infd, pos ) ||
471 !safe_seek( infd_vector[i2], pos ) ||
472 !safe_seek( outfd, pos ) ||
473 !copy_file( infd_vector[i2], outfd, size ) )
474 cleanup_and_fail( 1 );
475 const int var = ( i1 * ( files - 1 ) ) + i2 - ( i2 > i1 ) + 1;
476 for( long long i = 0; i + 1 < size; ++i )
477 {
478 if( verbosity >= 2 )
479 {
480 std::printf( " Trying variation %d of %d, position %lld %c",
481 var, variations, pos + i, terminator );
482 std::fflush( stdout ); pending_newline = true;
483 }
484 if( !safe_seek( outfd, pos + i ) ||
485 readblock( infd, &byte, 1 ) != 1 ||
486 writeblock( outfd, &byte, 1 ) != 1 ||
487 !safe_seek( outfd, mpos ) )
488 cleanup_and_fail( 1 );
489 long long failure_pos = 0;
490 if( test_member_from_file( outfd, msize, &failure_pos ) == 0 )
491 return true;
492 if( mpos + failure_pos <= pos + i ) break;
493 }
494 }
495 return false;
496 }
497
498 } // end namespace
499
500
501 // infd and outfd can refer to the same file if copying to a lower file
502 // position or if source and destination blocks don't overlap.
503 // max_size < 0 means no size limit.
copy_file(const int infd,const int outfd,const long long max_size)504 bool copy_file( const int infd, const int outfd, const long long max_size )
505 {
506 const int buffer_size = 65536;
507 // remaining number of bytes to copy
508 long long rest = ( ( max_size >= 0 ) ? max_size : buffer_size );
509 long long copied_size = 0;
510 uint8_t * const buffer = new uint8_t[buffer_size];
511 bool error = false;
512
513 while( rest > 0 )
514 {
515 const int size = std::min( (long long)buffer_size, rest );
516 if( max_size >= 0 ) rest -= size;
517 const int rd = readblock( infd, buffer, size );
518 if( rd != size && errno )
519 { show_error( "Error reading input file", errno ); error = true; break; }
520 if( rd > 0 )
521 {
522 const int wr = writeblock( outfd, buffer, rd );
523 if( wr != rd )
524 { show_error( "Error writing output file", errno );
525 error = true; break; }
526 copied_size += rd;
527 }
528 if( rd < size ) break; // EOF
529 }
530 delete[] buffer;
531 if( !error && max_size >= 0 && copied_size != max_size )
532 { show_error( "Input file ends unexpectedly." ); error = true; }
533 return !error;
534 }
535
536
537 // Return value: 0 = OK, 1 = bad msize, 2 = data error
538 // 'failure_pos' is relative to the beginning of the member
test_member_from_file(const int infd,const unsigned long long msize,long long * const failure_posp)539 int test_member_from_file( const int infd, const unsigned long long msize,
540 long long * const failure_posp )
541 {
542 Range_decoder rdec( infd );
543 Lzip_header header;
544 rdec.read_data( header.data, Lzip_header::size );
545 const unsigned dictionary_size = header.dictionary_size();
546 bool done = false;
547 if( !rdec.finished() && header.verify_magic() &&
548 header.verify_version() && isvalid_ds( dictionary_size ) )
549 {
550 LZ_decoder decoder( rdec, dictionary_size, -1 );
551 const int old_verbosity = verbosity;
552 verbosity = -1; // suppress all messages
553 Pretty_print dummy_pp( "" );
554 done = ( decoder.decode_member( dummy_pp ) == 0 );
555 verbosity = old_verbosity; // restore verbosity level
556 if( done && rdec.member_position() == msize ) return 0;
557 }
558 if( failure_posp ) *failure_posp = rdec.member_position();
559 return done ? 1 : 2;
560 }
561
562
merge_files(const std::vector<std::string> & filenames,const std::string & default_output_filename,const char terminator,const bool force)563 int merge_files( const std::vector< std::string > & filenames,
564 const std::string & default_output_filename,
565 const char terminator, const bool force )
566 {
567 const int files = filenames.size();
568 std::vector< int > infd_vector( files );
569 Lzip_index lzip_index;
570 struct stat in_stats;
571 const int retval =
572 open_input_files( filenames, infd_vector, lzip_index, &in_stats );
573 if( retval >= 0 ) return retval;
574 if( !safe_seek( infd_vector[0], 0 ) ) return 1;
575
576 output_filename = default_output_filename.empty() ?
577 insert_fixed( filenames[0] ) : default_output_filename;
578 set_signal_handler();
579 if( !open_outstream( force, true, true, false ) ) return 1;
580 if( !copy_file( infd_vector[0], outfd ) ) // copy whole file
581 cleanup_and_fail( 1 );
582
583 for( long j = 0; j < lzip_index.members(); ++j )
584 {
585 const long long mpos = lzip_index.mblock( j ).pos();
586 const long long msize = lzip_index.mblock( j ).size();
587 // vector of data blocks differing among the copies of the current member
588 std::vector< Block > block_vector;
589 // different color means members are different
590 std::vector< int > color_vector( files, 0 );
591 if( !diff_member( mpos, msize, filenames, infd_vector, block_vector,
592 color_vector ) || !safe_seek( outfd, mpos ) )
593 cleanup_and_fail( 1 );
594
595 if( block_vector.empty() )
596 {
597 if( lzip_index.members() > 1 && test_member_from_file( outfd, msize ) == 0 )
598 continue;
599 if( verbosity >= 0 )
600 std::fprintf( stderr, "Member %ld is damaged and identical in all files."
601 " Merging is not possible.\n", j + 1 );
602 cleanup_and_fail( 2 );
603 }
604
605 if( verbosity >= 2 )
606 {
607 std::printf( "Merging member %ld of %ld (%lu error%s)\n",
608 j + 1, lzip_index.members(), (long)block_vector.size(),
609 ( block_vector.size() == 1 ) ? "" : "s" );
610 std::fflush( stdout );
611 }
612
613 bool done = false;
614 if( block_vector.size() > 1 )
615 {
616 maybe_cluster_blocks( block_vector );
617 done = try_merge_member2( mpos, msize, block_vector, color_vector,
618 infd_vector, terminator );
619 print_pending_newline( terminator );
620 }
621 // With just one member and one differing block the merge can't succeed.
622 if( !done && ( lzip_index.members() > 1 || block_vector.size() > 1 ) )
623 {
624 done = try_merge_member( mpos, msize, block_vector, color_vector,
625 infd_vector, terminator );
626 print_pending_newline( terminator );
627 }
628 if( !done )
629 {
630 done = try_merge_member1( mpos, msize, block_vector, color_vector,
631 infd_vector, terminator );
632 print_pending_newline( terminator );
633 }
634 if( !done )
635 {
636 if( verbosity >= 3 )
637 for( unsigned i = 0; i < block_vector.size(); ++i )
638 std::fprintf( stderr, "area %2d from position %6lld to %6lld\n", i + 1,
639 block_vector[i].pos(), block_vector[i].end() - 1 );
640 show_error( "Some error areas overlap. Merging is not possible." );
641 cleanup_and_fail( 2 );
642 }
643 }
644
645 if( close_outstream( &in_stats ) != 0 ) return 1;
646 if( verbosity >= 1 )
647 std::fputs( "Input files merged successfully.\n", stdout );
648 return 0;
649 }
650