2025-02-21 11:21:25 +01:00
|
|
|
/* Lziprecover - Data recovery tool for the lzip format
|
2025-02-21 11:23:37 +01:00
|
|
|
Copyright (C) 2009-2015 Antonio Diaz Diaz.
|
2025-02-21 10:09:52 +01:00
|
|
|
|
|
|
|
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
|
2025-02-21 11:20:57 +01:00
|
|
|
the Free Software Foundation, either version 2 of the License, or
|
2025-02-21 10:09:52 +01:00
|
|
|
(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/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define _FILE_OFFSET_BITS 64
|
|
|
|
|
|
|
|
#include <cerrno>
|
|
|
|
#include <climits>
|
|
|
|
#include <cstdio>
|
2025-02-21 11:20:27 +01:00
|
|
|
#include <cstdlib>
|
2025-02-21 10:09:52 +01:00
|
|
|
#include <cstring>
|
|
|
|
#include <string>
|
|
|
|
#include <vector>
|
|
|
|
#include <stdint.h>
|
2025-02-21 10:12:48 +01:00
|
|
|
#include <unistd.h>
|
2025-02-21 10:09:52 +01:00
|
|
|
#include <sys/stat.h>
|
|
|
|
|
|
|
|
#include "lzip.h"
|
2025-02-21 11:20:27 +01:00
|
|
|
#include "mtester.h"
|
2025-02-21 11:23:37 +01:00
|
|
|
#include "block.h"
|
|
|
|
#include "file_index.h"
|
|
|
|
|
2025-02-21 11:11:34 +01:00
|
|
|
|
2025-02-21 11:23:37 +01:00
|
|
|
namespace {
|
2025-02-21 11:11:34 +01:00
|
|
|
|
2025-02-21 11:25:43 +01:00
|
|
|
bool gross_damage( const long long msize, const uint8_t * const mbuffer )
|
|
|
|
{
|
|
|
|
enum { maxlen = 6 }; // max number of consecutive identical bytes
|
|
|
|
long i = File_header::size;
|
|
|
|
const long end = msize - File_trailer::size - maxlen;
|
|
|
|
while( i < end )
|
|
|
|
{
|
2025-02-21 11:25:59 +01:00
|
|
|
const uint8_t byte = mbuffer[i];
|
2025-02-21 11:25:43 +01:00
|
|
|
int len = 0; // does not count the first byte
|
|
|
|
while( mbuffer[++i] == byte && ++len < maxlen ) {}
|
|
|
|
if( len >= maxlen ) return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2025-02-21 11:11:34 +01:00
|
|
|
int seek_write( const int fd, const uint8_t * const buf, const int size,
|
|
|
|
const long long pos )
|
|
|
|
{
|
|
|
|
if( lseek( fd, pos, SEEK_SET ) == pos )
|
|
|
|
return writeblock( fd, buf, size );
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2025-02-21 11:25:43 +01:00
|
|
|
// Return value: -1 = master failed, 0 = begin reached, >0 = repaired pos
|
|
|
|
long repair_member( const long long mpos, const long long msize,
|
|
|
|
uint8_t * const mbuffer, const long begin, const long end,
|
|
|
|
const int verbosity )
|
|
|
|
{
|
|
|
|
for( long pos = end; pos >= begin && pos > end - 50000; )
|
|
|
|
{
|
|
|
|
const long min_pos = std::max( begin, pos - 100 );
|
|
|
|
const LZ_mtester * master = prepare_master( mbuffer, msize, min_pos - 16 );
|
|
|
|
if( !master ) return -1;
|
|
|
|
for( ; pos >= min_pos; --pos )
|
|
|
|
{
|
|
|
|
if( verbosity >= 1 )
|
|
|
|
{
|
|
|
|
std::printf( "Trying position %llu \r", mpos + pos );
|
|
|
|
std::fflush( stdout );
|
|
|
|
}
|
|
|
|
for( int j = 0; j < 255; ++j )
|
|
|
|
{
|
|
|
|
++mbuffer[pos];
|
|
|
|
if( test_member_rest( *master ) ) { delete master; return pos; }
|
|
|
|
}
|
|
|
|
++mbuffer[pos];
|
|
|
|
}
|
|
|
|
delete master;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2025-02-21 11:23:37 +01:00
|
|
|
} // end namespace
|
|
|
|
|
2025-02-21 11:11:34 +01:00
|
|
|
|
2025-02-21 10:09:52 +01:00
|
|
|
int repair_file( const std::string & input_filename,
|
2025-02-21 11:11:34 +01:00
|
|
|
const std::string & output_filename, const int verbosity,
|
|
|
|
const bool force )
|
2025-02-21 10:09:52 +01:00
|
|
|
{
|
2025-02-21 11:25:43 +01:00
|
|
|
struct stat in_stats; // not used
|
2025-02-21 11:19:58 +01:00
|
|
|
const int infd = open_instream( input_filename.c_str(), &in_stats, true, true );
|
2025-02-21 10:09:52 +01:00
|
|
|
if( infd < 0 ) return 1;
|
2025-02-21 11:16:43 +01:00
|
|
|
|
2025-02-21 11:19:58 +01:00
|
|
|
Pretty_print pp( input_filename, verbosity );
|
2025-02-21 11:16:43 +01:00
|
|
|
const File_index file_index( infd );
|
|
|
|
if( file_index.retval() != 0 )
|
2025-02-21 11:19:58 +01:00
|
|
|
{ pp( file_index.error().c_str() ); return file_index.retval(); }
|
2025-02-21 11:16:43 +01:00
|
|
|
|
2025-02-21 11:25:43 +01:00
|
|
|
if( !force && file_exists( output_filename ) ) return 1;
|
2025-02-21 11:16:43 +01:00
|
|
|
int outfd = -1;
|
2025-02-21 11:20:27 +01:00
|
|
|
for( long i = 0; i < file_index.members(); ++i )
|
2025-02-21 10:09:52 +01:00
|
|
|
{
|
2025-02-21 11:16:43 +01:00
|
|
|
const long long mpos = file_index.mblock( i ).pos();
|
|
|
|
const long long msize = file_index.mblock( i ).size();
|
|
|
|
if( !safe_seek( infd, mpos ) )
|
|
|
|
cleanup_and_fail( output_filename, outfd, 1 );
|
|
|
|
long long failure_pos = 0;
|
|
|
|
if( try_decompress_member( infd, msize, &failure_pos ) ) continue;
|
|
|
|
if( failure_pos < File_header::size )
|
|
|
|
{ show_error( "Can't repair error in input file." );
|
|
|
|
cleanup_and_fail( output_filename, outfd, 2 ); }
|
|
|
|
|
2025-02-21 11:20:27 +01:00
|
|
|
if( verbosity >= 1 ) // damaged member found
|
2025-02-21 11:16:43 +01:00
|
|
|
{
|
2025-02-21 11:23:19 +01:00
|
|
|
std::printf( "Repairing member %ld of %ld (failure pos = %llu)\n",
|
2025-02-21 11:24:05 +01:00
|
|
|
i + 1, file_index.members(), mpos + failure_pos );
|
2025-02-21 10:09:52 +01:00
|
|
|
std::fflush( stdout );
|
|
|
|
}
|
2025-02-21 11:25:43 +01:00
|
|
|
if( failure_pos >= msize - 8 ) failure_pos = msize - 8 - 1;
|
2025-02-21 11:20:27 +01:00
|
|
|
uint8_t * const mbuffer = read_member( infd, mpos, msize );
|
|
|
|
if( !mbuffer )
|
|
|
|
cleanup_and_fail( output_filename, outfd, 1 );
|
2025-02-21 11:25:43 +01:00
|
|
|
long pos = 0;
|
|
|
|
if( !gross_damage( msize, mbuffer ) )
|
2025-02-21 10:09:52 +01:00
|
|
|
{
|
2025-02-21 11:25:43 +01:00
|
|
|
pos = repair_member( mpos, msize, mbuffer, File_header::size + 1,
|
|
|
|
File_header::size + 2, verbosity );
|
|
|
|
if( pos == 0 )
|
|
|
|
pos = repair_member( mpos, msize, mbuffer, File_header::size + 3,
|
|
|
|
failure_pos, verbosity );
|
|
|
|
}
|
|
|
|
if( pos < 0 )
|
|
|
|
cleanup_and_fail( output_filename, outfd, 1 );
|
|
|
|
if( pos > 0 )
|
|
|
|
{
|
|
|
|
if( outfd < 0 ) // first damaged member repaired
|
2025-02-21 11:16:43 +01:00
|
|
|
{
|
2025-02-21 11:25:43 +01:00
|
|
|
if( !safe_seek( infd, 0 ) ) return 1;
|
|
|
|
outfd = open_outstream_rw( output_filename, true );
|
|
|
|
if( outfd < 0 ) { close( infd ); return 1; }
|
|
|
|
if( !copy_file( infd, outfd ) ) // copy whole file
|
|
|
|
cleanup_and_fail( output_filename, outfd, 1 );
|
2025-02-21 11:16:43 +01:00
|
|
|
}
|
2025-02-21 11:25:43 +01:00
|
|
|
if( seek_write( outfd, mbuffer + pos, 1, mpos + pos ) != 1 )
|
|
|
|
{ show_error( "Error writing output file", errno );
|
|
|
|
cleanup_and_fail( output_filename, outfd, 1 ); }
|
2025-02-21 11:16:43 +01:00
|
|
|
}
|
2025-02-21 11:20:27 +01:00
|
|
|
delete[] mbuffer;
|
2025-02-21 11:25:43 +01:00
|
|
|
if( verbosity >= 1 ) std::fputc( '\n', stdout );
|
|
|
|
if( pos == 0 )
|
2025-02-21 11:16:43 +01:00
|
|
|
{
|
2025-02-21 11:20:27 +01:00
|
|
|
show_error( "Can't repair input file. Error is probably larger than 1 byte." );
|
2025-02-21 11:16:43 +01:00
|
|
|
cleanup_and_fail( output_filename, outfd, 2 );
|
2025-02-21 10:09:52 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2025-02-21 11:16:43 +01:00
|
|
|
if( outfd < 0 )
|
|
|
|
{
|
|
|
|
if( verbosity >= 1 )
|
2025-02-21 11:23:19 +01:00
|
|
|
std::fputs( "Input file has no errors. Recovery is not needed.\n", stdout );
|
2025-02-21 11:16:43 +01:00
|
|
|
return 0;
|
|
|
|
}
|
2025-02-21 10:09:52 +01:00
|
|
|
if( close( outfd ) != 0 )
|
|
|
|
{
|
|
|
|
show_error( "Error closing output file", errno );
|
|
|
|
cleanup_and_fail( output_filename, -1, 1 );
|
|
|
|
}
|
|
|
|
if( verbosity >= 1 )
|
2025-02-21 11:23:19 +01:00
|
|
|
std::fputs( "Copy of input file repaired successfully.\n", stdout );
|
2025-02-21 10:09:52 +01:00
|
|
|
return 0;
|
|
|
|
}
|
2025-02-21 11:23:37 +01:00
|
|
|
|
|
|
|
|
|
|
|
int debug_delay( const std::string & input_filename, Block range,
|
|
|
|
const int verbosity )
|
|
|
|
{
|
2025-02-21 11:25:43 +01:00
|
|
|
struct stat in_stats; // not used
|
2025-02-21 11:23:37 +01:00
|
|
|
const int infd = open_instream( input_filename.c_str(), &in_stats, true, true );
|
|
|
|
if( infd < 0 ) return 1;
|
|
|
|
|
|
|
|
Pretty_print pp( input_filename, verbosity );
|
|
|
|
const File_index file_index( infd );
|
|
|
|
if( file_index.retval() != 0 )
|
|
|
|
{ pp( file_index.error().c_str() ); return file_index.retval(); }
|
|
|
|
|
|
|
|
if( range.end() > file_index.file_end() )
|
|
|
|
range.size( std::max( 0LL, file_index.file_end() - range.pos() ) );
|
|
|
|
if( range.size() <= 0 )
|
|
|
|
{ if( verbosity >= 0 ) pp( "Nothing to do." ); return 0; }
|
|
|
|
|
|
|
|
for( long i = 0; i < file_index.members(); ++i )
|
|
|
|
{
|
|
|
|
const Block & mb = file_index.mblock( i );
|
|
|
|
if( !range.overlaps( mb ) ) continue;
|
|
|
|
const long long mpos = file_index.mblock( i ).pos();
|
|
|
|
const long long msize = file_index.mblock( i ).size();
|
2025-02-21 11:25:43 +01:00
|
|
|
if( verbosity >= 1 )
|
2025-02-21 11:23:37 +01:00
|
|
|
{
|
2025-02-21 11:24:05 +01:00
|
|
|
std::printf( "Finding max delay in member %ld of %ld (mpos = %llu, msize = %llu)\n",
|
|
|
|
i + 1, file_index.members(), mpos, msize );
|
2025-02-21 11:23:37 +01:00
|
|
|
std::fflush( stdout );
|
|
|
|
}
|
|
|
|
uint8_t * const mbuffer = read_member( infd, mpos, msize );
|
2025-02-21 11:25:43 +01:00
|
|
|
if( !mbuffer ) return 1;
|
2025-02-21 11:23:37 +01:00
|
|
|
long pos = std::max( range.pos() - mpos, File_header::size + 1LL );
|
|
|
|
const long end = std::min( range.end() - mpos, msize );
|
|
|
|
long max_delay = 0;
|
|
|
|
while( pos < end )
|
|
|
|
{
|
|
|
|
const LZ_mtester * master = prepare_master( mbuffer, msize, pos - 16 );
|
|
|
|
if( !master )
|
|
|
|
{ show_error( "Can't prepare master." ); return 1; }
|
|
|
|
const long partial_end = std::min( pos + 100, end );
|
|
|
|
for( ; pos < partial_end; ++pos )
|
|
|
|
{
|
|
|
|
if( verbosity >= 1 )
|
|
|
|
{
|
|
|
|
std::printf( "Delays in position %llu \r", mpos + pos );
|
|
|
|
std::fflush( stdout );
|
|
|
|
}
|
|
|
|
int value = -1;
|
|
|
|
for( int j = 0; j < 256; ++j )
|
|
|
|
{
|
|
|
|
++mbuffer[pos];
|
|
|
|
if( j == 255 ) break;
|
|
|
|
long failure_pos;
|
|
|
|
if( test_member_rest( *master, &failure_pos ) ) continue;
|
|
|
|
const long delay = failure_pos - pos;
|
|
|
|
if( delay > max_delay ) { max_delay = delay; value = mbuffer[pos]; }
|
|
|
|
}
|
|
|
|
if( value >= 0 && verbosity >= 0 )
|
|
|
|
{
|
|
|
|
std::printf( "New max delay %lu at position %llu (0x%02X)\n",
|
|
|
|
max_delay, mpos + pos, value );
|
|
|
|
std::fflush( stdout );
|
|
|
|
}
|
|
|
|
if( pos + max_delay >= msize ) { pos = end; break; }
|
|
|
|
}
|
|
|
|
delete master;
|
|
|
|
}
|
|
|
|
delete[] mbuffer;
|
2025-02-21 11:25:43 +01:00
|
|
|
if( verbosity >= 1 ) std::fputc( '\n', stdout );
|
2025-02-21 11:23:37 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
if( verbosity >= 1 ) std::fputs( "Done.\n", stdout );
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int debug_repair( const std::string & input_filename, const long long bad_pos,
|
|
|
|
const int verbosity, const uint8_t bad_value )
|
|
|
|
{
|
2025-02-21 11:25:43 +01:00
|
|
|
struct stat in_stats; // not used
|
2025-02-21 11:23:37 +01:00
|
|
|
const int infd = open_instream( input_filename.c_str(), &in_stats, true, true );
|
|
|
|
if( infd < 0 ) return 1;
|
|
|
|
|
|
|
|
Pretty_print pp( input_filename, verbosity );
|
|
|
|
const File_index file_index( infd );
|
|
|
|
if( file_index.retval() != 0 )
|
|
|
|
{ pp( file_index.error().c_str() ); return file_index.retval(); }
|
|
|
|
|
|
|
|
long idx = 0;
|
|
|
|
for( ; idx < file_index.members(); ++idx )
|
|
|
|
if( file_index.mblock( idx ).includes( bad_pos ) ) break;
|
|
|
|
if( idx >= file_index.members() )
|
|
|
|
{ if( verbosity >= 0 ) pp( "Nothing to do." ); return 0; }
|
|
|
|
|
|
|
|
const long long mpos = file_index.mblock( idx ).pos();
|
|
|
|
const long long msize = file_index.mblock( idx ).size();
|
|
|
|
{
|
|
|
|
long long failure_pos = 0;
|
2025-02-21 11:25:43 +01:00
|
|
|
if( !safe_seek( infd, mpos ) ) return 1;
|
2025-02-21 11:23:37 +01:00
|
|
|
if( !try_decompress_member( infd, msize, &failure_pos ) )
|
|
|
|
{
|
|
|
|
if( verbosity >= 0 )
|
|
|
|
std::printf( "Member %ld of %ld already damaged (failure pos = %llu)\n",
|
2025-02-21 11:24:05 +01:00
|
|
|
idx + 1, file_index.members(), mpos + failure_pos );
|
2025-02-21 11:23:37 +01:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
uint8_t * const mbuffer = read_member( infd, mpos, msize );
|
2025-02-21 11:25:43 +01:00
|
|
|
if( !mbuffer ) return 1;
|
|
|
|
const uint8_t good_value = mbuffer[bad_pos-mpos];
|
|
|
|
mbuffer[bad_pos-mpos] = bad_value;
|
2025-02-21 11:23:37 +01:00
|
|
|
long failure_pos = 0;
|
|
|
|
{
|
|
|
|
const LZ_mtester * master = prepare_master( mbuffer, msize, 0 );
|
|
|
|
if( !master )
|
2025-02-21 11:25:43 +01:00
|
|
|
{ show_error( "Can't prepare master." ); delete[] mbuffer; return 1; }
|
2025-02-21 11:23:37 +01:00
|
|
|
if( test_member_rest( *master, &failure_pos ) )
|
|
|
|
{
|
|
|
|
if( verbosity >= 1 )
|
|
|
|
std::fputs( "Member decompressed with no errors.\n", stdout );
|
2025-02-21 11:25:43 +01:00
|
|
|
delete master;
|
|
|
|
delete[] mbuffer;
|
2025-02-21 11:23:37 +01:00
|
|
|
return 0;
|
|
|
|
}
|
2025-02-21 11:25:43 +01:00
|
|
|
delete master;
|
2025-02-21 11:23:37 +01:00
|
|
|
if( verbosity >= 1 )
|
|
|
|
{
|
2025-02-21 11:24:05 +01:00
|
|
|
std::printf( "Test repairing member %ld of %ld (mpos = %llu, msize = %llu)\n"
|
2025-02-21 11:23:37 +01:00
|
|
|
" (damage pos = %llu (0x%02X->0x%02X), failure pos = %llu)\n",
|
2025-02-21 11:24:05 +01:00
|
|
|
idx + 1, file_index.members(), mpos, msize,
|
2025-02-21 11:25:43 +01:00
|
|
|
bad_pos, good_value, bad_value, mpos + failure_pos );
|
2025-02-21 11:23:37 +01:00
|
|
|
std::fflush( stdout );
|
|
|
|
}
|
|
|
|
}
|
2025-02-21 11:25:43 +01:00
|
|
|
if( failure_pos >= msize ) failure_pos = msize - 1;
|
|
|
|
long pos = repair_member( mpos, msize, mbuffer, File_header::size + 1,
|
|
|
|
File_header::size + 2, verbosity );
|
|
|
|
if( pos == 0 )
|
|
|
|
pos = repair_member( mpos, msize, mbuffer, File_header::size + 3,
|
|
|
|
failure_pos, verbosity );
|
|
|
|
delete[] mbuffer;
|
|
|
|
if( pos < 0 )
|
|
|
|
{ show_error( "Can't prepare master." ); return 1; }
|
|
|
|
if( verbosity >= 1 ) std::fputc( '\n', stdout );
|
|
|
|
if( pos == 0 ) internal_error( "can't repair input file." );
|
|
|
|
if( verbosity >= 1 )
|
|
|
|
std::fputs( "Member repaired successfully.\n", stdout );
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int debug_show_packets( const std::string & input_filename,
|
|
|
|
const long long bad_pos, const int verbosity,
|
|
|
|
const uint8_t bad_value )
|
|
|
|
{
|
|
|
|
struct stat in_stats; // not used
|
|
|
|
const int infd = open_instream( input_filename.c_str(), &in_stats, true, true );
|
|
|
|
if( infd < 0 ) return 1;
|
|
|
|
|
|
|
|
Pretty_print pp( input_filename, verbosity );
|
|
|
|
const File_index file_index( infd );
|
|
|
|
if( file_index.retval() != 0 )
|
|
|
|
{ pp( file_index.error().c_str() ); return file_index.retval(); }
|
|
|
|
|
|
|
|
int retval = 0;
|
|
|
|
for( long i = 0; i < file_index.members(); ++i )
|
2025-02-21 11:23:37 +01:00
|
|
|
{
|
2025-02-21 11:25:43 +01:00
|
|
|
const long long dpos = file_index.dblock( i ).pos();
|
|
|
|
const long long mpos = file_index.mblock( i ).pos();
|
|
|
|
const long long msize = file_index.mblock( i ).size();
|
|
|
|
if( verbosity >= 1 )
|
|
|
|
std::printf( "Decoding LZMA packets in member %ld of %ld (mpos = %llu, msize = %llu)\n"
|
|
|
|
" mpos dpos\n",
|
|
|
|
i + 1, file_index.members(), mpos, msize );
|
|
|
|
uint8_t * const mbuffer = read_member( infd, mpos, msize );
|
|
|
|
if( !mbuffer ) return 1;
|
|
|
|
const File_header & header = *(File_header *)mbuffer;
|
|
|
|
const unsigned dictionary_size = header.dictionary_size();
|
|
|
|
if( !header.verify_magic() || !header.verify_version() ||
|
|
|
|
dictionary_size < min_dictionary_size ||
|
|
|
|
dictionary_size > max_dictionary_size )
|
|
|
|
{ show_error( "Header error." ); return 2; }
|
|
|
|
if( bad_pos >= 0 && file_index.mblock( i ).includes( bad_pos ) )
|
2025-02-21 11:23:37 +01:00
|
|
|
{
|
|
|
|
if( verbosity >= 1 )
|
2025-02-21 11:25:43 +01:00
|
|
|
std::printf( "Byte at pos %llu changed from 0x%02X to 0x%02X\n",
|
|
|
|
bad_pos, mbuffer[bad_pos-mpos], bad_value );
|
|
|
|
mbuffer[bad_pos-mpos] = bad_value;
|
2025-02-21 11:23:37 +01:00
|
|
|
}
|
2025-02-21 11:25:43 +01:00
|
|
|
LZ_mtester mtester( mbuffer, msize, dictionary_size );
|
|
|
|
const int result = mtester.debug_decode_member( dpos, mpos, true );
|
|
|
|
delete[] mbuffer;
|
|
|
|
if( result != 0 )
|
|
|
|
{
|
|
|
|
if( verbosity >= 0 && result <= 2 )
|
|
|
|
std::printf( "%s at pos %llu\n", ( result == 2 ) ?
|
|
|
|
"File ends unexpectedly" : "Decoder error",
|
|
|
|
mpos + mtester.member_position() );
|
|
|
|
retval = 2; break;
|
|
|
|
}
|
|
|
|
if( i + 1 < file_index.members() ) std::fputc( '\n', stdout );
|
2025-02-21 11:23:37 +01:00
|
|
|
}
|
2025-02-21 11:25:43 +01:00
|
|
|
|
|
|
|
if( verbosity >= 1 ) std::fputs( "Done.\n", stdout );
|
|
|
|
return retval;
|
2025-02-21 11:23:37 +01:00
|
|
|
}
|