/src/libscca/libfwnt/libfwnt_huffman_tree.c

Source (jump to first uncovered line)
/*
 * Huffman tree functions
 *
 * Copyright (C) 2009-2024, Joachim Metz <joachim.metz@gmail.com>
 *
 * Refer to AUTHORS for acknowledgements.
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation, either version 3 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 Lesser General Public License
 * along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */

#include <common.h>
#include <memory.h>
#include <types.h>

#include "libfwnt_bit_stream.h"
#include "libfwnt_huffman_tree.h"
#include "libfwnt_libcerror.h"
#include "libfwnt_libcnotify.h"

/* Creates a Huffman tree
 * Make sure the value huffman_tree is referencing, is set to NULL
 * Returns 1 if successful or -1 on error
 */
int libfwnt_huffman_tree_initialize(
     libfwnt_huffman_tree_t **huffman_tree,
     int number_of_symbols,
     uint8_t maximum_code_size,
     libcerror_error_t **error )
{
  static char *function = "libfwnt_huffman_tree_initialize";
  size_t array_size     = 0;

  if( huffman_tree == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,
     "%s: invalid Huffman tree.",
     function );

    return( -1 );
  }
  if( *huffman_tree != NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_RUNTIME,
     LIBCERROR_RUNTIME_ERROR_VALUE_ALREADY_SET,
     "%s: invalid Huffman tree value already set.",
     function );

    return( -1 );
  }
  if( ( number_of_symbols < 0 )
   || ( number_of_symbols > 1024 ) )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
     LIBCERROR_ARGUMENT_ERROR_VALUE_OUT_OF_BOUNDS,
     "%s: invalid number of symbols value out of bounds.",
     function );

    return( -1 );
  }
  if( maximum_code_size > 32 )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
     LIBCERROR_ARGUMENT_ERROR_VALUE_OUT_OF_BOUNDS,
     "%s: invalid maximum code size value out of bounds.",
     function );

    return( -1 );
  }
  *huffman_tree = memory_allocate_structure(
                   libfwnt_huffman_tree_t );

  if( *huffman_tree == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_MEMORY,
     LIBCERROR_MEMORY_ERROR_INSUFFICIENT,
     "%s: unable to create Huffman tree.",
     function );

    goto on_error;
  }
  if( memory_set(
       *huffman_tree,
       0,
       sizeof( libfwnt_huffman_tree_t ) ) == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_MEMORY,
     LIBCERROR_MEMORY_ERROR_SET_FAILED,
     "%s: unable to clear Huffman tree.",
     function );

    memory_free(
     *huffman_tree );

    *huffman_tree = NULL;

    return( -1 );
  }
  array_size = sizeof( int ) * number_of_symbols;

  ( *huffman_tree )->symbols = (int *) memory_allocate(
                                        array_size );

  if( ( *huffman_tree )->symbols == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_MEMORY,
     LIBCERROR_MEMORY_ERROR_INSUFFICIENT,
     "%s: unable to create symbols.",
     function );

    goto on_error;
  }
  if( memory_set(
       ( *huffman_tree )->symbols,
       0,
       array_size ) == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_MEMORY,
     LIBCERROR_MEMORY_ERROR_SET_FAILED,
     "%s: unable to clear symbols.",
     function );

    goto on_error;
  }
  array_size = sizeof( int ) * ( maximum_code_size + 1 );

  ( *huffman_tree )->code_size_counts = (int *) memory_allocate(
                                                 array_size );

  if( ( *huffman_tree )->code_size_counts == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_MEMORY,
     LIBCERROR_MEMORY_ERROR_INSUFFICIENT,
     "%s: unable to create code size counts.",
     function );

    goto on_error;
  }
  if( memory_set(
       ( *huffman_tree )->code_size_counts,
       0,
       array_size ) == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_MEMORY,
     LIBCERROR_MEMORY_ERROR_SET_FAILED,
     "%s: unable to clear code size counts.",
     function );

    goto on_error;
  }
  ( *huffman_tree )->maximum_code_size = maximum_code_size;

  return( 1 );

on_error:
  if( *huffman_tree != NULL )
  {
    if( ( *huffman_tree )->code_size_counts != NULL )
    {
      memory_free(
       ( *huffman_tree )->code_size_counts );
    }
    if( ( *huffman_tree )->symbols != NULL )
    {
      memory_free(
       ( *huffman_tree )->symbols );
    }
    memory_free(
     *huffman_tree );

    *huffman_tree = NULL;
  }
  return( -1 );
}

/* Frees a Huffman tree
 * Returns 1 if successful or -1 on error
 */
int libfwnt_huffman_tree_free(
     libfwnt_huffman_tree_t **huffman_tree,
     libcerror_error_t **error )
{
  static char *function = "libfwnt_huffman_tree_free";

  if( huffman_tree == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,
     "%s: invalid Huffman tree.",
     function );

    return( -1 );
  }
  if( *huffman_tree != NULL )
  {
    if( ( *huffman_tree )->code_size_counts != NULL )
    {
      memory_free(
       ( *huffman_tree )->code_size_counts );
    }
    if( ( *huffman_tree )->symbols != NULL )
    {
      memory_free(
       ( *huffman_tree )->symbols );
    }
    memory_free(
     *huffman_tree );

    *huffman_tree = NULL;
  }
  return( 1 );
}

/* Builds the Huffman tree
 * Returns 1 on success, 0 if the tree is empty or -1 on error
 */
int libfwnt_huffman_tree_build(
     libfwnt_huffman_tree_t *huffman_tree,
     const uint8_t *code_sizes_array,
     int number_of_code_sizes,
     libcerror_error_t **error )
{
  int *symbol_offsets   = NULL;
  static char *function = "libfwnt_huffman_tree_build";
  size_t array_size     = 0;
  uint8_t bit_index     = 0;
  uint8_t code_size     = 0;
  int code_offset       = 0;
  int left_value        = 0;
  int symbol            = 0;

  if( huffman_tree == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,
     "%s: invalid Huffman tree.",
     function );

    return( -1 );
  }
  if( code_sizes_array == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,
     "%s: invalid code sizes array.",
     function );

    return( -1 );
  }
  if( number_of_code_sizes < 0 )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
     LIBCERROR_ARGUMENT_ERROR_VALUE_OUT_OF_BOUNDS,
     "%s: invalid number of code sizes value out of bounds.",
     function );

    return( -1 );
  }
  /* Determine the code size frequencies
   */
  array_size = sizeof( int ) * ( huffman_tree->maximum_code_size + 1 );

  if( memory_set(
       huffman_tree->code_size_counts,
       0,
       array_size ) == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_MEMORY,
     LIBCERROR_MEMORY_ERROR_SET_FAILED,
     "%s: unable to clear code size counts.",
     function );

    goto on_error;
  }
  for( symbol = 0;
       symbol < number_of_code_sizes;
       symbol++ )
  {
    code_size = code_sizes_array[ symbol ];

    if( code_size > huffman_tree->maximum_code_size )
    {
      libcerror_error_set(
       error,
       LIBCERROR_ERROR_DOMAIN_RUNTIME,
       LIBCERROR_RUNTIME_ERROR_VALUE_OUT_OF_BOUNDS,
       "%s: invalid symbol: %d code size: %" PRIu8 " value out of bounds.",
       function,
       symbol,
       code_size );

      goto on_error;
    }
    huffman_tree->code_size_counts[ code_size ] += 1;
  }
  /* The tree has no codes
   */
  if( huffman_tree->code_size_counts[ 0 ] == number_of_code_sizes )
  {
    return( 0 );
  }
  /* Check if the set of code sizes is incomplete or over-subscribed
   */
  left_value = 1;

  for( bit_index = 1;
       bit_index <= huffman_tree->maximum_code_size;
       bit_index++ )
  {
    left_value <<= 1;
    left_value  -= huffman_tree->code_size_counts[ bit_index ];

    if( left_value < 0 )
    {
      libcerror_error_set(
       error,
       LIBCERROR_ERROR_DOMAIN_RUNTIME,
       LIBCERROR_RUNTIME_ERROR_VALUE_OUT_OF_BOUNDS,
       "%s: code sizes are over-subscribed.",
       function );

      goto on_error;
    }
  }
/* TODO
  if( left_value > 0 )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_RUNTIME,
     LIBCERROR_RUNTIME_ERROR_VALUE_OUT_OF_BOUNDS,
     "%s: code sizes are incomplete.",
     function );

    goto on_error;
  }
*/
  symbol_offsets = (int *) memory_allocate(
                            array_size );

  if( symbol_offsets == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_MEMORY,
     LIBCERROR_MEMORY_ERROR_INSUFFICIENT,
     "%s: unable to create symbol offsets.",
     function );

    goto on_error;
  }
  /* Calculate the offsets to sort the symbols per code size
   */
  symbol_offsets[ 0 ] = 0;
  symbol_offsets[ 1 ] = 0;

  for( bit_index = 1;
       bit_index < huffman_tree->maximum_code_size;
       bit_index++ )
  {
    symbol_offsets[ bit_index + 1 ] = symbol_offsets[ bit_index ] + huffman_tree->code_size_counts[ bit_index ];
  }
  /* Fill the symbols sorted by code size
   */
  for( symbol = 0;
       symbol < number_of_code_sizes;
       symbol++ )
  {
    code_size = code_sizes_array[ symbol ];

    if( code_size == 0 )
    {
      continue;
    }
    code_offset = symbol_offsets[ code_size ];

    if( ( code_offset < 0 )
     || ( code_offset > number_of_code_sizes ) )
    {
      libcerror_error_set(
       error,
       LIBCERROR_ERROR_DOMAIN_RUNTIME,
       LIBCERROR_RUNTIME_ERROR_VALUE_OUT_OF_BOUNDS,
       "%s: invalid symbol: %d code offset: %d value out of bounds.",
       function,
       symbol,
       code_offset );

      goto on_error;
    }
    symbol_offsets[ code_size ] += 1;

    huffman_tree->symbols[ code_offset ] = symbol;
  }
  memory_free(
   symbol_offsets );

  return( 1 );

on_error:
  if( symbol_offsets != NULL )
  {
    memory_free(
     symbol_offsets );
  }
  return( -1 );
}

/* Retrieves a symbol based on the Huffman code read from the bit-stream
 * Returns 1 on success or -1 on error
 */
int libfwnt_huffman_tree_get_symbol_from_bit_stream(
     libfwnt_huffman_tree_t *huffman_tree,
     libfwnt_bit_stream_t *bit_stream,
     uint32_t *symbol,
     libcerror_error_t **error )
{
  static char *function  = "libfwnt_huffman_tree_get_symbol_from_bit_stream";
  uint32_t safe_symbol   = 0;
  uint32_t value_32bit   = 0;
  uint8_t bit_index      = 0;
  uint8_t number_of_bits = 0;
  int code_size_count    = 0;
  int first_huffman_code = 0;
  int first_index        = 0;
  int huffman_code       = 0;
  int result             = 0;

  if( huffman_tree == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,
     "%s: invalid Huffman tree.",
     function );

    return( -1 );
  }
  if( bit_stream == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,
     "%s: invalid bit stream.",
     function );

    return( -1 );
  }
  if( symbol == NULL )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,
     "%s: invalid symbol.",
     function );

    return( -1 );
  }
  /* Try to fill the bit buffer with the maximum number of bits
   */
  while( bit_stream->bit_buffer_size < huffman_tree->maximum_code_size )
  {
    result = libfwnt_bit_stream_read(
              bit_stream,
              huffman_tree->maximum_code_size,
              error );

    if( result == -1 )
    {
      libcerror_error_set(
       error,
       LIBCERROR_ERROR_DOMAIN_IO,
       LIBCERROR_IO_ERROR_READ_FAILED,
       "%s: unable to read bits.",
       function );

      return( -1 );
    }
    else if( result == 0 )
    {
      break;
    }
  }
  if( huffman_tree->maximum_code_size < bit_stream->bit_buffer_size )
  {
    number_of_bits = huffman_tree->maximum_code_size;
  }
  else
  {
    number_of_bits = bit_stream->bit_buffer_size;
  }
  for( bit_index = 1;
       bit_index <= number_of_bits;
       bit_index++ )
  {
/* TODO get maximum_code_size of bits into local bit buffer */
    if( libfwnt_bit_stream_get_value(
         bit_stream,
         1,
         &value_32bit,
         error ) != 1 )
    {
      libcerror_error_set(
       error,
       LIBCERROR_ERROR_DOMAIN_RUNTIME,
       LIBCERROR_RUNTIME_ERROR_GET_FAILED,
       "%s: unable to retrieve value from bit stream.",
       function );

      return( -1 );
    }
    huffman_code <<= 1;
    huffman_code  |= (int) value_32bit;

    code_size_count = huffman_tree->code_size_counts[ bit_index ];

    if( ( huffman_code - code_size_count ) < first_huffman_code )
    {
      safe_symbol = huffman_tree->symbols[ first_index + ( huffman_code - first_huffman_code ) ];

      result = 1;

      break;
    }
    first_huffman_code  += code_size_count;
    first_huffman_code <<= 1;
    first_index         += code_size_count;
  }
  if( result != 1 )
  {
    libcerror_error_set(
     error,
     LIBCERROR_ERROR_DOMAIN_RUNTIME,
     LIBCERROR_RUNTIME_ERROR_VALUE_OUT_OF_BOUNDS,
     "%s: invalid Huffman code: 0x%08" PRIx32 ".",
     function,
     huffman_code );

    return( -1 );
  }
  *symbol = safe_symbol;

  return( 1 );
}


Coverage Report

Created: 2024-02-25 07:20

Line	Count	Source (jump to first uncovered line)
1		/*
2		* Huffman tree functions
3		*
4		* Copyright (C) 2009-2024, Joachim Metz <joachim.metz@gmail.com>
5		*
6		* Refer to AUTHORS for acknowledgements.
7		*
8		* This program is free software: you can redistribute it and/or modify
9		* it under the terms of the GNU Lesser General Public License as published by
10		* the Free Software Foundation, either version 3 of the License, or
11		* (at your option) any later version.
12		*
13		* This program is distributed in the hope that it will be useful,
14		* but WITHOUT ANY WARRANTY; without even the implied warranty of
15		* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16		* GNU General Public License for more details.
17		*
18		* You should have received a copy of the GNU Lesser General Public License
19		* along with this program. If not, see <https://www.gnu.org/licenses/>.
20		*/
21
22		#include <common.h>
23		#include <memory.h>
24		#include <types.h>
25
26		#include "libfwnt_bit_stream.h"
27		#include "libfwnt_huffman_tree.h"
28		#include "libfwnt_libcerror.h"
29		#include "libfwnt_libcnotify.h"
30
31		/* Creates a Huffman tree
32		* Make sure the value huffman_tree is referencing, is set to NULL
33		* Returns 1 if successful or -1 on error
34		*/
35		int libfwnt_huffman_tree_initialize(
36		libfwnt_huffman_tree_t **huffman_tree,
37		int number_of_symbols,
38		uint8_t maximum_code_size,
39		libcerror_error_t **error )
40	22.4k	{
41	22.4k	static char *function = "libfwnt_huffman_tree_initialize";
42	22.4k	size_t array_size = 0;
43
44	22.4k	if( huffman_tree == NULL )
45	0	{
46	0	libcerror_error_set(
47	0	error,
48	0	LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
49	0	LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,
50	0	"%s: invalid Huffman tree.",
51	0	function );
52
53	0	return( -1 );
54	0	}
55	22.4k	if( *huffman_tree != NULL )
56	0	{
57	0	libcerror_error_set(
58	0	error,
59	0	LIBCERROR_ERROR_DOMAIN_RUNTIME,
60	0	LIBCERROR_RUNTIME_ERROR_VALUE_ALREADY_SET,
61	0	"%s: invalid Huffman tree value already set.",
62	0	function );
63
64	0	return( -1 );
65	0	}
66	22.4k	if( ( number_of_symbols < 0 )
67	22.4k	\|\| ( number_of_symbols > 1024 ) )
68	0	{
69	0	libcerror_error_set(
70	0	error,
71	0	LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
72	0	LIBCERROR_ARGUMENT_ERROR_VALUE_OUT_OF_BOUNDS,
73	0	"%s: invalid number of symbols value out of bounds.",
74	0	function );
75
76	0	return( -1 );
77	0	}
78	22.4k	if( maximum_code_size > 32 )
79	0	{
80	0	libcerror_error_set(
81	0	error,
82	0	LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
83	0	LIBCERROR_ARGUMENT_ERROR_VALUE_OUT_OF_BOUNDS,
84	0	"%s: invalid maximum code size value out of bounds.",
85	0	function );
86
87	0	return( -1 );
88	0	}
89	22.4k	*huffman_tree = memory_allocate_structure(
90	22.4k	libfwnt_huffman_tree_t );
91
92	22.4k	if( *huffman_tree == NULL )
93	0	{
94	0	libcerror_error_set(
95	0	error,
96	0	LIBCERROR_ERROR_DOMAIN_MEMORY,
97	0	LIBCERROR_MEMORY_ERROR_INSUFFICIENT,
98	0	"%s: unable to create Huffman tree.",
99	0	function );
100
101	0	goto on_error;
102	0	}
103	22.4k	if( memory_set(
104	22.4k	*huffman_tree,
105	22.4k	0,
106	22.4k	sizeof( libfwnt_huffman_tree_t ) ) == NULL )
107	0	{
108	0	libcerror_error_set(
109	0	error,
110	0	LIBCERROR_ERROR_DOMAIN_MEMORY,
111	0	LIBCERROR_MEMORY_ERROR_SET_FAILED,
112	0	"%s: unable to clear Huffman tree.",
113	0	function );
114
115	0	memory_free(
116	0	*huffman_tree );
117
118	0	*huffman_tree = NULL;
119
120	0	return( -1 );
121	0	}
122	22.4k	array_size = sizeof( int ) * number_of_symbols;
123
124	22.4k	( huffman_tree )->symbols = (int ) memory_allocate(
125	22.4k	array_size );
126
127	22.4k	if( ( *huffman_tree )->symbols == NULL )
128	0	{
129	0	libcerror_error_set(
130	0	error,
131	0	LIBCERROR_ERROR_DOMAIN_MEMORY,
132	0	LIBCERROR_MEMORY_ERROR_INSUFFICIENT,
133	0	"%s: unable to create symbols.",
134	0	function );
135
136	0	goto on_error;
137	0	}
138	22.4k	if( memory_set(
139	22.4k	( *huffman_tree )->symbols,
140	22.4k	0,
141	22.4k	array_size ) == NULL )
142	0	{
143	0	libcerror_error_set(
144	0	error,
145	0	LIBCERROR_ERROR_DOMAIN_MEMORY,
146	0	LIBCERROR_MEMORY_ERROR_SET_FAILED,
147	0	"%s: unable to clear symbols.",
148	0	function );
149
150	0	goto on_error;
151	0	}
152	22.4k	array_size = sizeof( int ) * ( maximum_code_size + 1 );
153
154	22.4k	( huffman_tree )->code_size_counts = (int ) memory_allocate(
155	22.4k	array_size );
156
157	22.4k	if( ( *huffman_tree )->code_size_counts == NULL )
158	0	{
159	0	libcerror_error_set(
160	0	error,
161	0	LIBCERROR_ERROR_DOMAIN_MEMORY,
162	0	LIBCERROR_MEMORY_ERROR_INSUFFICIENT,
163	0	"%s: unable to create code size counts.",
164	0	function );
165
166	0	goto on_error;
167	0	}
168	22.4k	if( memory_set(
169	22.4k	( *huffman_tree )->code_size_counts,
170	22.4k	0,
171	22.4k	array_size ) == NULL )
172	0	{
173	0	libcerror_error_set(
174	0	error,
175	0	LIBCERROR_ERROR_DOMAIN_MEMORY,
176	0	LIBCERROR_MEMORY_ERROR_SET_FAILED,
177	0	"%s: unable to clear code size counts.",
178	0	function );
179
180	0	goto on_error;
181	0	}
182	22.4k	( *huffman_tree )->maximum_code_size = maximum_code_size;
183
184	22.4k	return( 1 );
185
186	0	on_error:
187	0	if( *huffman_tree != NULL )
188	0	{
189	0	if( ( *huffman_tree )->code_size_counts != NULL )
190	0	{
191	0	memory_free(
192	0	( *huffman_tree )->code_size_counts );
193	0	}
194	0	if( ( *huffman_tree )->symbols != NULL )
195	0	{
196	0	memory_free(
197	0	( *huffman_tree )->symbols );
198	0	}
199	0	memory_free(
200	0	*huffman_tree );
201
202	0	*huffman_tree = NULL;
203	0	}
204	0	return( -1 );
205	22.4k	}
206
207		/* Frees a Huffman tree
208		* Returns 1 if successful or -1 on error
209		*/
210		int libfwnt_huffman_tree_free(
211		libfwnt_huffman_tree_t **huffman_tree,
212		libcerror_error_t **error )
213	22.4k	{
214	22.4k	static char *function = "libfwnt_huffman_tree_free";
215
216	22.4k	if( huffman_tree == NULL )
217	0	{
218	0	libcerror_error_set(
219	0	error,
220	0	LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
221	0	LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,
222	0	"%s: invalid Huffman tree.",
223	0	function );
224
225	0	return( -1 );
226	0	}
227	22.4k	if( *huffman_tree != NULL )
228	22.4k	{
229	22.4k	if( ( *huffman_tree )->code_size_counts != NULL )
230	22.4k	{
231	22.4k	memory_free(
232	22.4k	( *huffman_tree )->code_size_counts );
233	22.4k	}
234	22.4k	if( ( *huffman_tree )->symbols != NULL )
235	22.4k	{
236	22.4k	memory_free(
237	22.4k	( *huffman_tree )->symbols );
238	22.4k	}
239	22.4k	memory_free(
240	22.4k	*huffman_tree );
241
242	22.4k	*huffman_tree = NULL;
243	22.4k	}
244	22.4k	return( 1 );
245	22.4k	}
246
247		/* Builds the Huffman tree
248		* Returns 1 on success, 0 if the tree is empty or -1 on error
249		*/
250		int libfwnt_huffman_tree_build(
251		libfwnt_huffman_tree_t *huffman_tree,
252		const uint8_t *code_sizes_array,
253		int number_of_code_sizes,
254		libcerror_error_t **error )
255	22.2k	{
256	22.2k	int *symbol_offsets = NULL;
257	22.2k	static char *function = "libfwnt_huffman_tree_build";
258	22.2k	size_t array_size = 0;
259	22.2k	uint8_t bit_index = 0;
260	22.2k	uint8_t code_size = 0;
261	22.2k	int code_offset = 0;
262	22.2k	int left_value = 0;
263	22.2k	int symbol = 0;
264
265	22.2k	if( huffman_tree == NULL )
266	0	{
267	0	libcerror_error_set(
268	0	error,
269	0	LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
270	0	LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,
271	0	"%s: invalid Huffman tree.",
272	0	function );
273
274	0	return( -1 );
275	0	}
276	22.2k	if( code_sizes_array == NULL )
277	0	{
278	0	libcerror_error_set(
279	0	error,
280	0	LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
281	0	LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,
282	0	"%s: invalid code sizes array.",
283	0	function );
284
285	0	return( -1 );
286	0	}
287	22.2k	if( number_of_code_sizes < 0 )
288	0	{
289	0	libcerror_error_set(
290	0	error,
291	0	LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
292	0	LIBCERROR_ARGUMENT_ERROR_VALUE_OUT_OF_BOUNDS,
293	0	"%s: invalid number of code sizes value out of bounds.",
294	0	function );
295
296	0	return( -1 );
297	0	}
298		/* Determine the code size frequencies
299		*/
300	22.2k	array_size = sizeof( int ) * ( huffman_tree->maximum_code_size + 1 );
301
302	22.2k	if( memory_set(
303	22.2k	huffman_tree->code_size_counts,
304	22.2k	0,
305	22.2k	array_size ) == NULL )
306	0	{
307	0	libcerror_error_set(
308	0	error,
309	0	LIBCERROR_ERROR_DOMAIN_MEMORY,
310	0	LIBCERROR_MEMORY_ERROR_SET_FAILED,
311	0	"%s: unable to clear code size counts.",
312	0	function );
313
314	0	goto on_error;
315	0	}
316	22.2k	for( symbol = 0;
317	5.36M	symbol < number_of_code_sizes;
318	5.34M	symbol++ )
319	5.34M	{
320	5.34M	code_size = code_sizes_array[ symbol ];
321
322	5.34M	if( code_size > huffman_tree->maximum_code_size )
323	0	{
324	0	libcerror_error_set(
325	0	error,
326	0	LIBCERROR_ERROR_DOMAIN_RUNTIME,
327	0	LIBCERROR_RUNTIME_ERROR_VALUE_OUT_OF_BOUNDS,
328	0	"%s: invalid symbol: %d code size: %" PRIu8 " value out of bounds.",
329	0	function,
330	0	symbol,
331	0	code_size );
332
333	0	goto on_error;
334	0	}
335	5.34M	huffman_tree->code_size_counts[ code_size ] += 1;
336	5.34M	}
337		/* The tree has no codes
338		*/
339	22.2k	if( huffman_tree->code_size_counts[ 0 ] == number_of_code_sizes )
340	178	{
341	178	return( 0 );
342	178	}
343		/* Check if the set of code sizes is incomplete or over-subscribed
344		*/
345	22.0k	left_value = 1;
346
347	22.0k	for( bit_index = 1;
348	358k	bit_index <= huffman_tree->maximum_code_size;
349	336k	bit_index++ )
350	336k	{
351	336k	left_value <<= 1;
352	336k	left_value -= huffman_tree->code_size_counts[ bit_index ];
353
354	336k	if( left_value < 0 )
355	92	{
356	92	libcerror_error_set(
357	92	error,
358	92	LIBCERROR_ERROR_DOMAIN_RUNTIME,
359	92	LIBCERROR_RUNTIME_ERROR_VALUE_OUT_OF_BOUNDS,
360	92	"%s: code sizes are over-subscribed.",
361	92	function );
362
363	92	goto on_error;
364	92	}
365	336k	}
366		/* TODO
367		if( left_value > 0 )
368		{
369		libcerror_error_set(
370		error,
371		LIBCERROR_ERROR_DOMAIN_RUNTIME,
372		LIBCERROR_RUNTIME_ERROR_VALUE_OUT_OF_BOUNDS,
373		"%s: code sizes are incomplete.",
374		function );
375
376		goto on_error;
377		}
378		*/
379	21.9k	symbol_offsets = (int *) memory_allocate(
380	21.9k	array_size );
381
382	21.9k	if( symbol_offsets == NULL )
383	0	{
384	0	libcerror_error_set(
385	0	error,
386	0	LIBCERROR_ERROR_DOMAIN_MEMORY,
387	0	LIBCERROR_MEMORY_ERROR_INSUFFICIENT,
388	0	"%s: unable to create symbol offsets.",
389	0	function );
390
391	0	goto on_error;
392	0	}
393		/* Calculate the offsets to sort the symbols per code size
394		*/
395	21.9k	symbol_offsets[ 0 ] = 0;
396	21.9k	symbol_offsets[ 1 ] = 0;
397
398	21.9k	for( bit_index = 1;
399	336k	bit_index < huffman_tree->maximum_code_size;
400	314k	bit_index++ )
401	314k	{
402	314k	symbol_offsets[ bit_index + 1 ] = symbol_offsets[ bit_index ] + huffman_tree->code_size_counts[ bit_index ];
403	314k	}
404		/* Fill the symbols sorted by code size
405		*/
406	21.9k	for( symbol = 0;
407	5.31M	symbol < number_of_code_sizes;
408	5.29M	symbol++ )
409	5.29M	{
410	5.29M	code_size = code_sizes_array[ symbol ];
411
412	5.29M	if( code_size == 0 )
413	4.07M	{
414	4.07M	continue;
415	4.07M	}
416	1.21M	code_offset = symbol_offsets[ code_size ];
417
418	1.21M	if( ( code_offset < 0 )
419	1.21M	\|\| ( code_offset > number_of_code_sizes ) )
420	0	{
421	0	libcerror_error_set(
422	0	error,
423	0	LIBCERROR_ERROR_DOMAIN_RUNTIME,
424	0	LIBCERROR_RUNTIME_ERROR_VALUE_OUT_OF_BOUNDS,
425	0	"%s: invalid symbol: %d code offset: %d value out of bounds.",
426	0	function,
427	0	symbol,
428	0	code_offset );
429
430	0	goto on_error;
431	0	}
432	1.21M	symbol_offsets[ code_size ] += 1;
433
434	1.21M	huffman_tree->symbols[ code_offset ] = symbol;
435	1.21M	}
436	21.9k	memory_free(
437	21.9k	symbol_offsets );
438
439	21.9k	return( 1 );
440
441	92	on_error:
442	92	if( symbol_offsets != NULL )
443	0	{
444	0	memory_free(
445	0	symbol_offsets );
446	0	}
447	92	return( -1 );
448	21.9k	}
449
450		/* Retrieves a symbol based on the Huffman code read from the bit-stream
451		* Returns 1 on success or -1 on error
452		*/
453		int libfwnt_huffman_tree_get_symbol_from_bit_stream(
454		libfwnt_huffman_tree_t *huffman_tree,
455		libfwnt_bit_stream_t *bit_stream,
456		uint32_t *symbol,
457		libcerror_error_t **error )
458	23.5M	{
459	23.5M	static char *function = "libfwnt_huffman_tree_get_symbol_from_bit_stream";
460	23.5M	uint32_t safe_symbol = 0;
461	23.5M	uint32_t value_32bit = 0;
462	23.5M	uint8_t bit_index = 0;
463	23.5M	uint8_t number_of_bits = 0;
464	23.5M	int code_size_count = 0;
465	23.5M	int first_huffman_code = 0;
466	23.5M	int first_index = 0;
467	23.5M	int huffman_code = 0;
468	23.5M	int result = 0;
469
470	23.5M	if( huffman_tree == NULL )
471	0	{
472	0	libcerror_error_set(
473	0	error,
474	0	LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
475	0	LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,
476	0	"%s: invalid Huffman tree.",
477	0	function );
478
479	0	return( -1 );
480	0	}
481	23.5M	if( bit_stream == NULL )
482	0	{
483	0	libcerror_error_set(
484	0	error,
485	0	LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
486	0	LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,
487	0	"%s: invalid bit stream.",
488	0	function );
489
490	0	return( -1 );
491	0	}
492	23.5M	if( symbol == NULL )
493	0	{
494	0	libcerror_error_set(
495	0	error,
496	0	LIBCERROR_ERROR_DOMAIN_ARGUMENTS,
497	0	LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,
498	0	"%s: invalid symbol.",
499	0	function );
500
501	0	return( -1 );
502	0	}
503		/* Try to fill the bit buffer with the maximum number of bits
504		*/
505	24.7M	while( bit_stream->bit_buffer_size < huffman_tree->maximum_code_size )
506	1.23M	{
507	1.23M	result = libfwnt_bit_stream_read(
508	1.23M	bit_stream,
509	1.23M	huffman_tree->maximum_code_size,
510	1.23M	error );
511
512	1.23M	if( result == -1 )
513	0	{
514	0	libcerror_error_set(
515	0	error,
516	0	LIBCERROR_ERROR_DOMAIN_IO,
517	0	LIBCERROR_IO_ERROR_READ_FAILED,
518	0	"%s: unable to read bits.",
519	0	function );
520
521	0	return( -1 );
522	0	}
523	1.23M	else if( result == 0 )
524	0	{
525	0	break;
526	0	}
527	1.23M	}
528	23.5M	if( huffman_tree->maximum_code_size < bit_stream->bit_buffer_size )
529	23.1M	{
530	23.1M	number_of_bits = huffman_tree->maximum_code_size;
531	23.1M	}
532	411k	else
533	411k	{
534	411k	number_of_bits = bit_stream->bit_buffer_size;
535	411k	}
536	23.5M	for( bit_index = 1;
537	129M	bit_index <= number_of_bits;
538	105M	bit_index++ )
539	128M	{
540		/* TODO get maximum_code_size of bits into local bit buffer */
541	128M	if( libfwnt_bit_stream_get_value(
542	128M	bit_stream,
543	128M	1,
544	128M	&value_32bit,
545	128M	error ) != 1 )
546	0	{
547	0	libcerror_error_set(
548	0	error,
549	0	LIBCERROR_ERROR_DOMAIN_RUNTIME,
550	0	LIBCERROR_RUNTIME_ERROR_GET_FAILED,
551	0	"%s: unable to retrieve value from bit stream.",
552	0	function );
553
554	0	return( -1 );
555	0	}
556	128M	huffman_code <<= 1;
557	128M	huffman_code \|= (int) value_32bit;
558
559	128M	code_size_count = huffman_tree->code_size_counts[ bit_index ];
560
561	128M	if( ( huffman_code - code_size_count ) < first_huffman_code )
562	23.0M	{
563	23.0M	safe_symbol = huffman_tree->symbols[ first_index + ( huffman_code - first_huffman_code ) ];
564
565	23.0M	result = 1;
566
567	23.0M	break;
568	23.0M	}
569	105M	first_huffman_code += code_size_count;
570	105M	first_huffman_code <<= 1;
571	105M	first_index += code_size_count;
572	105M	}
573	23.5M	if( result != 1 )
574	135	{
575	135	libcerror_error_set(
576	135	error,
577	135	LIBCERROR_ERROR_DOMAIN_RUNTIME,
578	135	LIBCERROR_RUNTIME_ERROR_VALUE_OUT_OF_BOUNDS,
579	135	"%s: invalid Huffman code: 0x%08" PRIx32 ".",
580	135	function,
581	135	huffman_code );
582
583	135	return( -1 );
584	135	}
585	23.5M	*symbol = safe_symbol;
586
587	23.5M	return( 1 );
588	23.5M	}
589