Adding upstream version 1.24.upstream/1.24upstream

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

1 files changed, 373 insertions, 0 deletions

diff --git a/mtester.cc b/mtester.cc
new file mode 100644
index 0000000..fb9eb97
--- /dev/null
+++ b/mtester.cc
@@ -0,0 +1,373 @@
+/* Lziprecover - Data recovery tool for the lzip format
+   Copyright (C) 2009-2024 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/>.
+*/
+
+#define _FILE_OFFSET_BITS 64
+
+#include <algorithm>
+#include <cerrno>
+#include <climits>
+#include <cstdio>
+#include <cstdlib>
+#include <cstring>
+#include <string>
+#include <vector>
+#include <stdint.h>
+#include <unistd.h>
+
+#include "lzip.h"
+#include "md5.h"
+#include "mtester.h"
+
+
+namespace {
+
+const char * format_byte( const uint8_t byte )
+  {
+  enum { buffers = 8, bufsize = 16 };
+  static char buffer[buffers][bufsize];	// circle of static buffers for printf
+  static int current = 0;
+  char * const buf = buffer[current++]; current %= buffers;
+  if( ( byte >= 0x20 && byte <= 0x7E ) || byte >= 0xA0 )
+    snprintf( buf, bufsize, "'%c' (0x%02X)", byte, byte );
+  else
+    snprintf( buf, bufsize, "    (0x%02X)", byte );
+  return buf;
+  }
+
+} // end namespace
+
+
+void LZ_mtester::print_block( const int len )
+  {
+  std::fputs( " \"", stdout );
+  for( int i = len - 1; i >= 0; --i )
+    {
+    uint8_t byte = peek( i );
+    if( byte < 0x20 || ( byte > 0x7E && byte < 0xA0 ) ) byte = '.';
+    std::fputc( byte, stdout );
+    }
+  std::fputs( "\"\n", stdout );
+  }
+
+
+void LZ_mtester::duplicate_buffer( uint8_t * const buffer2 )
+  {
+  if( data_position() > 0 )
+    std::memcpy( buffer2, buffer, std::min( data_position(),
+                                    (unsigned long long)dictionary_size ) );
+  else buffer2[dictionary_size-1] = 0;		// prev_byte of first byte
+  buffer = buffer2;
+  buffer_is_external = true;
+  }
+
+
+void LZ_mtester::flush_data()
+  {
+  if( pos > stream_pos )
+    {
+    const int size = pos - stream_pos;
+    crc32.update_buf( crc_, buffer + stream_pos, size );
+    if( md5sum ) md5sum->md5_update( buffer + stream_pos, size );
+    if( outfd >= 0 && writeblock( outfd, buffer + stream_pos, size ) != size )
+      throw Error( "Write error" );
+    if( pos >= dictionary_size )
+      { partial_data_pos += pos; pos = 0; pos_wrapped = true; }
+    stream_pos = pos;
+    }
+  }
+
+
+bool LZ_mtester::check_trailer( FILE * const f, unsigned long long byte_pos )
+  {
+  const Lzip_trailer * const trailer = rdec.get_trailer();
+  if( !trailer )
+    {
+    if( verbosity >= 0 && f )
+      { if( byte_pos )
+          { std::fprintf( f, "byte %llu\n", byte_pos ); byte_pos = 0; }
+        std::fputs( "Can't get trailer.\n", f ); }
+    return false;
+    }
+  bool error = false;
+
+  const unsigned td_crc = trailer->data_crc();
+  if( td_crc != crc() )
+    {
+    error = true;
+    if( verbosity >= 0 && f )
+      { if( byte_pos )
+          { std::fprintf( f, "byte %llu\n", byte_pos ); byte_pos = 0; }
+        std::fprintf( f, "CRC mismatch; stored %08X, computed %08X\n",
+                      td_crc, crc() ); }
+    }
+  const unsigned long long data_size = data_position();
+  const unsigned long long td_size = trailer->data_size();
+  if( td_size != data_size )
+    {
+    error = true;
+    if( verbosity >= 0 && f )
+      { if( byte_pos )
+          { std::fprintf( f, "byte %llu\n", byte_pos ); byte_pos = 0; }
+        std::fprintf( f, "Data size mismatch; stored %llu (0x%llX), computed %llu (0x%llX)\n",
+                      td_size, td_size, data_size, data_size ); }
+    }
+  const unsigned long member_size = rdec.member_position();
+  const unsigned long long tm_size = trailer->member_size();
+  if( tm_size != member_size )
+    {
+    error = true;
+    if( verbosity >= 0 && f )
+      { if( byte_pos )
+          { std::fprintf( f, "byte %llu\n", byte_pos ); byte_pos = 0; }
+        std::fprintf( f, "Member size mismatch; stored %llu (0x%llX), computed %lu (0x%lX)\n",
+                      tm_size, tm_size, member_size, member_size ); }
+    }
+  return !error;
+  }
+
+
+/* Return value: 0 = OK, 1 = decoder error, 2 = unexpected EOF,
+                 3 = trailer error, 4 = unknown marker found,
+                 -1 = pos_limit reached. */
+int LZ_mtester::test_member( const unsigned long mpos_limit,
+                             const unsigned long long dpos_limit,
+                             FILE * const f, const unsigned long long byte_pos )
+  {
+  if( mpos_limit < Lzip_header::size + 5 ) return -1;
+  if( member_position() == Lzip_header::size ) rdec.load();
+  while( !rdec.finished() )
+    {
+    if( member_position() >= mpos_limit || data_position() >= dpos_limit )
+      { flush_data(); return -1; }
+    const int pos_state = data_position() & pos_state_mask;
+    if( rdec.decode_bit( bm_match[state()][pos_state] ) == 0 )	// 1st bit
+      {
+      // literal byte
+      Bit_model * const bm = bm_literal[get_lit_state(peek_prev())];
+      if( state.is_char_set_char() )
+        put_byte( rdec.decode_tree8( bm ) );
+      else
+        put_byte( rdec.decode_matched( bm, peek( rep0 ) ) );
+      continue;
+      }
+    // match or repeated match
+    int len;
+    if( rdec.decode_bit( bm_rep[state()] ) != 0 )		// 2nd bit
+      {
+      if( rdec.decode_bit( bm_rep0[state()] ) == 0 )		// 3rd bit
+        {
+        if( rdec.decode_bit( bm_len[state()][pos_state] ) == 0 ) // 4th bit
+          { state.set_short_rep(); put_byte( peek( rep0 ) ); continue; }
+        }
+      else
+        {
+        unsigned distance;
+        if( rdec.decode_bit( bm_rep1[state()] ) == 0 )		// 4th bit
+          distance = rep1;
+        else
+          {
+          if( rdec.decode_bit( bm_rep2[state()] ) == 0 )	// 5th bit
+            distance = rep2;
+          else
+            { distance = rep3; rep3 = rep2; }
+          rep2 = rep1;
+          }
+        rep1 = rep0;
+        rep0 = distance;
+        }
+      state.set_rep();
+      len = rdec.decode_len( rep_len_model, pos_state );
+      }
+    else					// match
+      {
+      len = rdec.decode_len( match_len_model, pos_state );
+      unsigned distance = rdec.decode_tree6( bm_dis_slot[get_len_state(len)] );
+      if( distance >= start_dis_model )
+        {
+        const unsigned dis_slot = distance;
+        const int direct_bits = ( dis_slot >> 1 ) - 1;
+        distance = ( 2 | ( dis_slot & 1 ) ) << direct_bits;
+        if( dis_slot < end_dis_model )
+          distance += rdec.decode_tree_reversed(
+                      bm_dis + ( distance - dis_slot ), direct_bits );
+        else
+          {
+          distance +=
+            rdec.decode( direct_bits - dis_align_bits ) << dis_align_bits;
+          distance += rdec.decode_tree_reversed4( bm_align );
+          if( distance == 0xFFFFFFFFU )		// marker found
+            {
+            rdec.normalize();
+            flush_data();
+            if( len == min_match_len )		// End Of Stream marker
+              { if( check_trailer( f, byte_pos ) ) return 0; else return 3; }
+            if( verbosity >= 0 && f )
+              {
+              if( byte_pos ) std::fprintf( f, "byte %llu\n", byte_pos );
+              std::fprintf( f, "Unsupported marker code '%d'\n", len );
+              }
+            return 4;
+            }
+          }
+        }
+      rep3 = rep2; rep2 = rep1; rep1 = rep0; rep0 = distance;
+      if( rep0 > max_rep0 ) max_rep0 = rep0;
+      state.set_match();
+      if( rep0 >= dictionary_size || ( rep0 >= pos && !pos_wrapped ) )
+        { if( outfd >= 0 ) { flush_data(); } return 1; }
+      }
+    copy_block( rep0, len );
+    }
+  if( outfd >= 0 ) flush_data();	// else no need to flush if error
+  return 2;
+  }
+
+
+/* Return value: 0 = OK, 1 = decoder error, 2 = unexpected EOF,
+                 3 = trailer error, 4 = unknown marker found. */
+int LZ_mtester::debug_decode_member( const long long dpos, const long long mpos,
+                                     const bool show_packets )
+  {
+  rdec.load();
+  unsigned old_tmpos = member_position();	// truncated member position
+  while( !rdec.finished() )
+    {
+    const unsigned long long dp = data_position() + dpos;
+    const unsigned long long mp = member_position() + mpos - 4;
+    const unsigned tmpos = member_position();
+    set_max_packet( tmpos - old_tmpos, mp );
+    old_tmpos = tmpos;
+    ++total_packets_;
+    const int pos_state = data_position() & pos_state_mask;
+    if( rdec.decode_bit( bm_match[state()][pos_state] ) == 0 )	// 1st bit
+      {
+      // literal byte
+      Bit_model * const bm = bm_literal[get_lit_state(peek_prev())];
+      if( state.is_char_set_char() )
+        {
+        const uint8_t cur_byte = rdec.decode_tree8( bm );
+        put_byte( cur_byte );
+        if( show_packets )
+          std::printf( "%6llu %6llu  literal %s\n",
+                       mp, dp, format_byte( cur_byte ) );
+        }
+      else
+        {
+        const uint8_t match_byte = peek( rep0 );
+        const uint8_t cur_byte = rdec.decode_matched( bm, match_byte );
+        put_byte( cur_byte );
+        if( show_packets )
+          std::printf( "%6llu %6llu  literal %s, match byte %6llu %s\n",
+                       mp, dp, format_byte( cur_byte ), dp - rep0 - 1,
+                       format_byte( match_byte ) );
+        }
+      continue;
+      }
+    // match or repeated match
+    int len;
+    if( rdec.decode_bit( bm_rep[state()] ) != 0 )		// 2nd bit
+      {
+      int rep = 0;
+      if( rdec.decode_bit( bm_rep0[state()] ) == 0 )		// 3rd bit
+        {
+        if( rdec.decode_bit( bm_len[state()][pos_state] ) == 0 ) // 4th bit
+          {
+          if( show_packets )
+            std::printf( "%6llu %6llu shortrep %s %6u (%6llu)\n",
+                         mp, dp, format_byte( peek( rep0 ) ),
+                         rep0 + 1, dp - rep0 - 1 );
+          state.set_short_rep(); put_byte( peek( rep0 ) ); continue;
+          }
+        }
+      else
+        {
+        unsigned distance;
+        if( rdec.decode_bit( bm_rep1[state()] ) == 0 )		// 4th bit
+          { distance = rep1; rep = 1; }
+        else
+          {
+          if( rdec.decode_bit( bm_rep2[state()] ) == 0 )	// 5th bit
+            { distance = rep2; rep = 2; }
+          else
+            { distance = rep3; rep3 = rep2; rep = 3; }
+          rep2 = rep1;
+          }
+        rep1 = rep0;
+        rep0 = distance;
+        }
+      state.set_rep();
+      len = rdec.decode_len( rep_len_model, pos_state );
+      if( show_packets )
+        std::printf( "%6llu %6llu  rep%c  %6u,%3d (%6llu)",
+                     mp, dp, rep + '0', rep0 + 1, len, dp - rep0 - 1 );
+      }
+    else					// match
+      {
+      len = rdec.decode_len( match_len_model, pos_state );
+      unsigned distance = rdec.decode_tree6( bm_dis_slot[get_len_state(len)] );
+      if( distance >= start_dis_model )
+        {
+        const unsigned dis_slot = distance;
+        const int direct_bits = ( dis_slot >> 1 ) - 1;
+        distance = ( 2 | ( dis_slot & 1 ) ) << direct_bits;
+        if( dis_slot < end_dis_model )
+          distance += rdec.decode_tree_reversed(
+                      bm_dis + ( distance - dis_slot ), direct_bits );
+        else
+          {
+          distance +=
+            rdec.decode( direct_bits - dis_align_bits ) << dis_align_bits;
+          distance += rdec.decode_tree_reversed4( bm_align );
+          if( distance == 0xFFFFFFFFU )		// marker found
+            {
+            rdec.normalize();
+            flush_data();
+            const unsigned tmpos = member_position();
+            set_max_marker( tmpos - old_tmpos );
+            old_tmpos = tmpos;
+            if( show_packets )
+              std::printf( "%6llu %6llu  marker code '%d'\n", mp, dp, len );
+            if( len == min_match_len )		// End Of Stream marker
+              {
+              if( show_packets )
+                std::printf( "%6llu %6llu  member trailer\n",
+                             mpos + member_position(), dpos + data_position() );
+              if( check_trailer( show_packets ? stdout : 0 ) ) return 0;
+              return 3;
+              }
+            if( len == min_match_len + 1 )	// Sync Flush marker
+              { rdec.load(); continue; }
+            return 4;
+            }
+          }
+        }
+      rep3 = rep2; rep2 = rep1; rep1 = rep0; rep0 = distance;
+      if( rep0 > max_rep0 ) { max_rep0 = rep0; max_rep0_pos = mp; }
+      state.set_match();
+      if( show_packets )
+        std::printf( "%6llu %6llu  match %6u,%3d (%6lld)",
+                     mp, dp, rep0 + 1, len, dp - rep0 - 1 );
+      if( rep0 >= dictionary_size || ( rep0 >= pos && !pos_wrapped ) )
+        { flush_data(); if( show_packets ) std::fputc( '\n', stdout );
+          return 1; }
+      }
+    copy_block( rep0, len );
+    if( show_packets ) print_block( len );
+    }
+  flush_data();
+  return 2;
+  }