2025-02-21 11:27:50 +01:00
|
|
|
/* Lziprecover - Data recovery tool for the lzip format
|
2025-02-21 11:29:28 +01:00
|
|
|
Copyright (C) 2009-2019 Antonio Diaz Diaz.
|
2025-02-21 11:27:50 +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
|
|
|
|
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/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define _FILE_OFFSET_BITS 64
|
|
|
|
|
|
|
|
#include <cstdio>
|
|
|
|
#include <cstring>
|
|
|
|
#include <string>
|
|
|
|
#include <vector>
|
|
|
|
#include <stdint.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
|
|
|
|
#include "lzip.h"
|
2025-02-21 11:29:28 +01:00
|
|
|
#include "lzip_index.h"
|
2025-02-21 11:27:50 +01:00
|
|
|
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
|
|
|
|
void list_line( const unsigned long long uncomp_size,
|
|
|
|
const unsigned long long comp_size,
|
|
|
|
const char * const input_filename )
|
|
|
|
{
|
|
|
|
if( uncomp_size > 0 )
|
|
|
|
std::printf( "%15llu %15llu %6.2f%% %s\n", uncomp_size, comp_size,
|
2025-02-21 11:28:40 +01:00
|
|
|
100.0 - ( ( 100.0 * comp_size ) / uncomp_size ),
|
2025-02-21 11:27:50 +01:00
|
|
|
input_filename );
|
|
|
|
else
|
|
|
|
std::printf( "%15llu %15llu -INF%% %s\n", uncomp_size, comp_size,
|
|
|
|
input_filename );
|
|
|
|
}
|
|
|
|
|
|
|
|
} // end namespace
|
|
|
|
|
|
|
|
|
|
|
|
int list_files( const std::vector< std::string > & filenames,
|
2025-02-21 11:29:28 +01:00
|
|
|
const bool ignore_errors,
|
2025-02-21 11:28:40 +01:00
|
|
|
const bool ignore_trailing, const bool loose_trailing )
|
2025-02-21 11:27:50 +01:00
|
|
|
{
|
|
|
|
unsigned long long total_comp = 0, total_uncomp = 0;
|
|
|
|
int files = 0, retval = 0;
|
|
|
|
bool first_post = true;
|
|
|
|
bool stdin_used = false;
|
|
|
|
for( unsigned i = 0; i < filenames.size(); ++i )
|
|
|
|
{
|
|
|
|
const bool from_stdin = ( filenames[i] == "-" );
|
|
|
|
if( from_stdin ) { if( stdin_used ) continue; else stdin_used = true; }
|
|
|
|
const char * const input_filename =
|
|
|
|
from_stdin ? "(stdin)" : filenames[i].c_str();
|
|
|
|
struct stat in_stats; // not used
|
|
|
|
const int infd = from_stdin ? STDIN_FILENO :
|
|
|
|
open_instream( input_filename, &in_stats, true, true );
|
|
|
|
if( infd < 0 ) { if( retval < 1 ) retval = 1; continue; }
|
|
|
|
|
2025-02-21 11:29:28 +01:00
|
|
|
const Lzip_index lzip_index( infd, ignore_trailing, loose_trailing,
|
|
|
|
ignore_errors, ignore_errors );
|
2025-02-21 11:27:50 +01:00
|
|
|
close( infd );
|
2025-02-21 11:29:28 +01:00
|
|
|
if( lzip_index.retval() != 0 )
|
2025-02-21 11:27:50 +01:00
|
|
|
{
|
2025-02-21 11:29:28 +01:00
|
|
|
show_file_error( input_filename, lzip_index.error().c_str() );
|
|
|
|
if( retval < lzip_index.retval() ) retval = lzip_index.retval();
|
2025-02-21 11:27:50 +01:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if( verbosity >= 0 )
|
|
|
|
{
|
2025-02-21 11:29:28 +01:00
|
|
|
const unsigned long long udata_size = lzip_index.udata_size();
|
|
|
|
const unsigned long long cdata_size = lzip_index.cdata_size();
|
2025-02-21 11:27:50 +01:00
|
|
|
total_comp += cdata_size; total_uncomp += udata_size; ++files;
|
|
|
|
if( first_post )
|
|
|
|
{
|
|
|
|
first_post = false;
|
|
|
|
if( verbosity >= 1 ) std::fputs( " dict memb trail ", stdout );
|
|
|
|
std::fputs( " uncompressed compressed saved name\n", stdout );
|
|
|
|
}
|
|
|
|
if( verbosity >= 1 )
|
|
|
|
{
|
|
|
|
unsigned dictionary_size = 0;
|
2025-02-21 11:29:28 +01:00
|
|
|
for( long i = 0; i < lzip_index.members(); ++i )
|
2025-02-21 11:27:50 +01:00
|
|
|
dictionary_size =
|
2025-02-21 11:29:28 +01:00
|
|
|
std::max( dictionary_size, lzip_index.dictionary_size( i ) );
|
|
|
|
const long long trailing_size = lzip_index.file_size() - cdata_size;
|
2025-02-21 11:27:50 +01:00
|
|
|
std::printf( "%s %5ld %6lld ", format_ds( dictionary_size ),
|
2025-02-21 11:29:28 +01:00
|
|
|
lzip_index.members(), trailing_size );
|
2025-02-21 11:27:50 +01:00
|
|
|
}
|
|
|
|
list_line( udata_size, cdata_size, input_filename );
|
|
|
|
|
2025-02-21 11:29:28 +01:00
|
|
|
if( verbosity >= 2 && lzip_index.members() > 1 )
|
2025-02-21 11:27:50 +01:00
|
|
|
{
|
|
|
|
std::fputs( " member data_pos data_size member_pos member_size\n", stdout );
|
2025-02-21 11:29:28 +01:00
|
|
|
long long prev_end = 0;
|
|
|
|
for( long i = 0, gaps = 0; i < lzip_index.members(); ++i )
|
2025-02-21 11:27:50 +01:00
|
|
|
{
|
2025-02-21 11:29:28 +01:00
|
|
|
const Block & db = lzip_index.dblock( i );
|
|
|
|
const Block & mb = lzip_index.mblock( i );
|
|
|
|
if( mb.pos() > prev_end )
|
|
|
|
{
|
|
|
|
std::printf( " gap - - %15llu %15llu\n",
|
|
|
|
prev_end, mb.pos() - prev_end );
|
|
|
|
++gaps;
|
|
|
|
}
|
2025-02-21 11:27:50 +01:00
|
|
|
std::printf( "%5ld %15llu %15llu %15llu %15llu\n",
|
2025-02-21 11:29:28 +01:00
|
|
|
i + gaps + 1, db.pos(), db.size(), mb.pos(), mb.size() );
|
|
|
|
prev_end = mb.end();
|
2025-02-21 11:27:50 +01:00
|
|
|
}
|
|
|
|
first_post = true; // reprint heading after list of members
|
|
|
|
}
|
|
|
|
std::fflush( stdout );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if( verbosity >= 0 && files > 1 )
|
|
|
|
{
|
|
|
|
if( verbosity >= 1 ) std::fputs( " ", stdout );
|
|
|
|
list_line( total_uncomp, total_comp, "(totals)" );
|
|
|
|
std::fflush( stdout );
|
|
|
|
}
|
|
|
|
return retval;
|
|
|
|
}
|