2007-12-08 23:42:33 +01:00
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
//
|
|
|
|
/// \file process.c
|
|
|
|
/// \brief Compresses or uncompresses a file
|
|
|
|
//
|
2009-04-13 10:27:40 +02:00
|
|
|
// Author: Lasse Collin
|
2007-12-08 23:42:33 +01:00
|
|
|
//
|
2009-04-13 10:27:40 +02:00
|
|
|
// This file has been put into the public domain.
|
|
|
|
// You can do whatever you want with this file.
|
2007-12-08 23:42:33 +01:00
|
|
|
//
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
#include "private.h"
|
|
|
|
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
enum operation_mode opt_mode = MODE_COMPRESS;
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
enum format_type opt_format = FORMAT_AUTO;
|
2007-12-08 23:42:33 +01:00
|
|
|
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
/// Stream used to communicate with liblzma
|
|
|
|
static lzma_stream strm = LZMA_STREAM_INIT;
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
/// Filters needed for all encoding all formats, and also decoding in raw data
|
|
|
|
static lzma_filter filters[LZMA_FILTERS_MAX + 1];
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
/// Number of filters. Zero indicates that we are using a preset.
|
|
|
|
static size_t filters_count = 0;
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-12-27 18:30:19 +01:00
|
|
|
/// Number of the preset (0-9)
|
|
|
|
static size_t preset_number = 6;
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-12-27 18:30:19 +01:00
|
|
|
/// True if we should auto-adjust the compression settings to use less memory
|
|
|
|
/// if memory usage limit is too low for the original settings.
|
|
|
|
static bool auto_adjust = true;
|
|
|
|
|
|
|
|
/// Indicate if no preset has been explicitly given. In that case, if we need
|
|
|
|
/// to auto-adjust for lower memory usage, we won't print a warning.
|
2008-11-19 19:46:52 +01:00
|
|
|
static bool preset_default = true;
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-12-27 18:30:19 +01:00
|
|
|
/// If a preset is used (no custom filter chain) and preset_extreme is true,
|
|
|
|
/// a significantly slower compression is used to achieve slightly better
|
|
|
|
/// compression ratio.
|
|
|
|
static bool preset_extreme = false;
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
/// Integrity check type
|
2009-02-13 16:30:30 +01:00
|
|
|
#ifdef HAVE_CHECK_CRC64
|
2008-11-19 19:46:52 +01:00
|
|
|
static lzma_check check = LZMA_CHECK_CRC64;
|
2009-02-13 16:30:30 +01:00
|
|
|
#else
|
|
|
|
static lzma_check check = LZMA_CHECK_CRC32;
|
|
|
|
#endif
|
2007-12-08 23:42:33 +01:00
|
|
|
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
extern void
|
|
|
|
coder_set_check(lzma_check new_check)
|
|
|
|
{
|
|
|
|
check = new_check;
|
|
|
|
return;
|
|
|
|
}
|
2007-12-08 23:42:33 +01:00
|
|
|
|
|
|
|
|
|
|
|
extern void
|
2008-11-19 19:46:52 +01:00
|
|
|
coder_set_preset(size_t new_preset)
|
2007-12-08 23:42:33 +01:00
|
|
|
{
|
2008-11-19 19:46:52 +01:00
|
|
|
preset_number = new_preset;
|
|
|
|
preset_default = false;
|
|
|
|
return;
|
|
|
|
}
|
2007-12-08 23:42:33 +01:00
|
|
|
|
|
|
|
|
2008-12-27 18:30:19 +01:00
|
|
|
extern void
|
|
|
|
coder_set_extreme(void)
|
|
|
|
{
|
|
|
|
preset_extreme = true;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
extern void
|
|
|
|
coder_add_filter(lzma_vli id, void *options)
|
|
|
|
{
|
|
|
|
if (filters_count == LZMA_FILTERS_MAX)
|
|
|
|
message_fatal(_("Maximum number of filters is four"));
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
filters[filters_count].id = id;
|
|
|
|
filters[filters_count].options = options;
|
|
|
|
++filters_count;
|
2007-12-08 23:42:33 +01:00
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-12-27 18:30:19 +01:00
|
|
|
static void lzma_attribute((noreturn))
|
|
|
|
memlimit_too_small(uint64_t memory_usage, uint64_t memory_limit)
|
|
|
|
{
|
|
|
|
message_fatal(_("Memory usage limit (%" PRIu64 " MiB) is too small "
|
|
|
|
"for the given filter setup (%" PRIu64 " MiB)"),
|
|
|
|
memory_limit >> 20, memory_usage >> 20);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
extern void
|
|
|
|
coder_set_compression_settings(void)
|
2007-12-08 23:42:33 +01:00
|
|
|
{
|
2008-11-19 19:46:52 +01:00
|
|
|
// Options for LZMA1 or LZMA2 in case we are using a preset.
|
|
|
|
static lzma_options_lzma opt_lzma;
|
|
|
|
|
|
|
|
if (filters_count == 0) {
|
|
|
|
// We are using a preset. This is not a good idea in raw mode
|
|
|
|
// except when playing around with things. Different versions
|
|
|
|
// of this software may use different options in presets, and
|
|
|
|
// thus make uncompressing the raw data difficult.
|
|
|
|
if (opt_format == FORMAT_RAW) {
|
|
|
|
// The message is shown only if warnings are allowed
|
|
|
|
// but the exit status isn't changed.
|
|
|
|
message(V_WARNING, _("Using a preset in raw mode "
|
|
|
|
"is discouraged."));
|
|
|
|
message(V_WARNING, _("The exact options of the "
|
|
|
|
"presets may vary between software "
|
|
|
|
"versions."));
|
|
|
|
}
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
// Get the preset for LZMA1 or LZMA2.
|
2008-12-27 18:30:19 +01:00
|
|
|
if (preset_extreme)
|
|
|
|
preset_number |= LZMA_PRESET_EXTREME;
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
if (lzma_lzma_preset(&opt_lzma, preset_number))
|
|
|
|
message_bug();
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
// Use LZMA2 except with --format=lzma we use LZMA1.
|
|
|
|
filters[0].id = opt_format == FORMAT_LZMA
|
|
|
|
? LZMA_FILTER_LZMA1 : LZMA_FILTER_LZMA2;
|
|
|
|
filters[0].options = &opt_lzma;
|
|
|
|
filters_count = 1;
|
2008-12-27 18:30:19 +01:00
|
|
|
} else {
|
|
|
|
preset_default = false;
|
2007-12-08 23:42:33 +01:00
|
|
|
}
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
// Terminate the filter options array.
|
|
|
|
filters[filters_count].id = LZMA_VLI_UNKNOWN;
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
// If we are using the LZMA_Alone format, allow exactly one filter
|
|
|
|
// which has to be LZMA.
|
|
|
|
if (opt_format == FORMAT_LZMA && (filters_count != 1
|
|
|
|
|| filters[0].id != LZMA_FILTER_LZMA1))
|
|
|
|
message_fatal(_("With --format=lzma only the LZMA1 filter "
|
|
|
|
"is supported"));
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-12-17 19:11:23 +01:00
|
|
|
// Print the selected filter chain.
|
|
|
|
message_filters(V_DEBUG, filters);
|
|
|
|
|
2008-12-01 22:04:12 +01:00
|
|
|
// If using --format=raw, we can be decoding. The memusage function
|
|
|
|
// also validates the filter chain and the options used for the
|
|
|
|
// filters.
|
2009-05-22 10:29:50 +02:00
|
|
|
const uint64_t memory_limit = hardware_memlimit_get();
|
2008-11-19 19:46:52 +01:00
|
|
|
uint64_t memory_usage;
|
2009-05-22 10:29:50 +02:00
|
|
|
if (opt_mode == MODE_COMPRESS)
|
2009-01-17 13:24:25 +01:00
|
|
|
memory_usage = lzma_raw_encoder_memusage(filters);
|
2009-05-22 10:29:50 +02:00
|
|
|
else
|
2009-01-17 13:24:25 +01:00
|
|
|
memory_usage = lzma_raw_decoder_memusage(filters);
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
if (memory_usage == UINT64_MAX)
|
2008-12-01 22:04:12 +01:00
|
|
|
message_fatal("Unsupported filter chain or filter options");
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-12-17 19:11:23 +01:00
|
|
|
// Print memory usage info.
|
2009-06-26 19:36:45 +02:00
|
|
|
message(V_DEBUG, _("%s MiB (%s B) of memory is required per thread, "
|
|
|
|
"limit is %s MiB (%s B)"),
|
|
|
|
uint64_to_str(memory_usage >> 20, 0),
|
|
|
|
uint64_to_str(memory_usage, 1),
|
|
|
|
uint64_to_str(memory_limit >> 20, 2),
|
|
|
|
uint64_to_str(memory_limit, 3));
|
2008-12-27 18:30:19 +01:00
|
|
|
|
|
|
|
if (memory_usage > memory_limit) {
|
|
|
|
// If --no-auto-adjust was used or we didn't find LZMA1 or
|
|
|
|
// LZMA2 as the last filter, give an error immediatelly.
|
|
|
|
// --format=raw implies --no-auto-adjust.
|
|
|
|
if (!auto_adjust || opt_format == FORMAT_RAW)
|
|
|
|
memlimit_too_small(memory_usage, memory_limit);
|
|
|
|
|
|
|
|
assert(opt_mode == MODE_COMPRESS);
|
|
|
|
|
|
|
|
// Look for the last filter if it is LZMA2 or LZMA1, so
|
|
|
|
// we can make it use less RAM. With other filters we don't
|
|
|
|
// know what to do.
|
|
|
|
size_t i = 0;
|
|
|
|
while (filters[i].id != LZMA_FILTER_LZMA2
|
|
|
|
&& filters[i].id != LZMA_FILTER_LZMA1) {
|
|
|
|
if (filters[i].id == LZMA_VLI_UNKNOWN)
|
|
|
|
memlimit_too_small(memory_usage, memory_limit);
|
|
|
|
|
|
|
|
++i;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decrease the dictionary size until we meet the memory
|
|
|
|
// usage limit. First round down to full mebibytes.
|
|
|
|
lzma_options_lzma *opt = filters[i].options;
|
|
|
|
const uint32_t orig_dict_size = opt->dict_size;
|
|
|
|
opt->dict_size &= ~((UINT32_C(1) << 20) - 1);
|
|
|
|
while (true) {
|
|
|
|
// If it is below 1 MiB, auto-adjusting failed. We
|
|
|
|
// could be more sophisticated and scale it down even
|
|
|
|
// more, but let's see if many complain about this
|
|
|
|
// version.
|
|
|
|
//
|
|
|
|
// FIXME: Displays the scaled memory usage instead
|
|
|
|
// of the original.
|
|
|
|
if (opt->dict_size < (UINT32_C(1) << 20))
|
|
|
|
memlimit_too_small(memory_usage, memory_limit);
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2009-01-17 13:24:25 +01:00
|
|
|
memory_usage = lzma_raw_encoder_memusage(filters);
|
2008-12-27 18:30:19 +01:00
|
|
|
if (memory_usage == UINT64_MAX)
|
|
|
|
message_bug();
|
|
|
|
|
|
|
|
// Accept it if it is low enough.
|
|
|
|
if (memory_usage <= memory_limit)
|
|
|
|
break;
|
|
|
|
|
|
|
|
// Otherwise 1 MiB down and try again. I hope this
|
|
|
|
// isn't too slow method for cases where the original
|
|
|
|
// dict_size is very big.
|
|
|
|
opt->dict_size -= UINT32_C(1) << 20;
|
2007-12-08 23:42:33 +01:00
|
|
|
}
|
2008-12-27 18:30:19 +01:00
|
|
|
|
|
|
|
// Tell the user that we decreased the dictionary size.
|
|
|
|
// However, omit the message if no preset or custom chain
|
|
|
|
// was given. FIXME: Always warn?
|
|
|
|
if (!preset_default)
|
|
|
|
message(V_WARNING, "Adjusted LZMA%c dictionary size "
|
2009-06-26 19:36:45 +02:00
|
|
|
"from %s MiB to %s MiB to not exceed "
|
|
|
|
"the memory usage limit of %s MiB",
|
2008-12-27 18:30:19 +01:00
|
|
|
filters[i].id == LZMA_FILTER_LZMA2
|
|
|
|
? '2' : '1',
|
2009-06-26 19:36:45 +02:00
|
|
|
uint64_to_str(orig_dict_size >> 20, 0),
|
|
|
|
uint64_to_str(opt->dict_size >> 20, 1),
|
|
|
|
uint64_to_str(memory_limit >> 20, 2));
|
2007-12-08 23:42:33 +01:00
|
|
|
}
|
|
|
|
|
2009-02-13 23:45:29 +01:00
|
|
|
/*
|
2008-11-22 16:44:33 +01:00
|
|
|
// Limit the number of worker threads so that memory usage
|
2008-11-19 19:46:52 +01:00
|
|
|
// limit isn't exceeded.
|
|
|
|
assert(memory_usage > 0);
|
|
|
|
size_t thread_limit = memory_limit / memory_usage;
|
|
|
|
if (thread_limit == 0)
|
|
|
|
thread_limit = 1;
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
if (opt_threads > thread_limit)
|
|
|
|
opt_threads = thread_limit;
|
2009-02-13 23:45:29 +01:00
|
|
|
*/
|
2008-11-19 19:46:52 +01:00
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
2007-12-08 23:42:33 +01:00
|
|
|
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
static bool
|
|
|
|
coder_init(void)
|
2007-12-08 23:42:33 +01:00
|
|
|
{
|
2008-09-11 09:46:14 +02:00
|
|
|
lzma_ret ret = LZMA_PROG_ERROR;
|
2007-12-08 23:42:33 +01:00
|
|
|
|
|
|
|
if (opt_mode == MODE_COMPRESS) {
|
2008-10-02 21:51:46 +02:00
|
|
|
switch (opt_format) {
|
|
|
|
case FORMAT_AUTO:
|
|
|
|
// args.c ensures this.
|
|
|
|
assert(0);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case FORMAT_XZ:
|
2008-11-19 19:46:52 +01:00
|
|
|
ret = lzma_stream_encoder(&strm, filters, check);
|
2008-09-04 10:53:06 +02:00
|
|
|
break;
|
|
|
|
|
2008-10-02 21:51:46 +02:00
|
|
|
case FORMAT_LZMA:
|
2008-11-19 19:46:52 +01:00
|
|
|
ret = lzma_alone_encoder(&strm, filters[0].options);
|
2008-09-04 10:53:06 +02:00
|
|
|
break;
|
|
|
|
|
2008-10-02 21:51:46 +02:00
|
|
|
case FORMAT_RAW:
|
2008-11-19 19:46:52 +01:00
|
|
|
ret = lzma_raw_encoder(&strm, filters);
|
2008-09-04 10:53:06 +02:00
|
|
|
break;
|
2007-12-08 23:42:33 +01:00
|
|
|
}
|
|
|
|
} else {
|
2008-09-06 14:14:30 +02:00
|
|
|
const uint32_t flags = LZMA_TELL_UNSUPPORTED_CHECK
|
2008-09-04 10:53:06 +02:00
|
|
|
| LZMA_CONCATENATED;
|
|
|
|
|
2008-10-02 21:51:46 +02:00
|
|
|
switch (opt_format) {
|
|
|
|
case FORMAT_AUTO:
|
2008-11-19 19:46:52 +01:00
|
|
|
ret = lzma_auto_decoder(&strm,
|
2009-05-22 10:29:50 +02:00
|
|
|
hardware_memlimit_get(), flags);
|
2008-09-04 10:53:06 +02:00
|
|
|
break;
|
|
|
|
|
2008-10-02 21:51:46 +02:00
|
|
|
case FORMAT_XZ:
|
2008-11-19 19:46:52 +01:00
|
|
|
ret = lzma_stream_decoder(&strm,
|
2009-05-22 10:29:50 +02:00
|
|
|
hardware_memlimit_get(), flags);
|
2008-09-04 10:53:06 +02:00
|
|
|
break;
|
|
|
|
|
2008-10-02 21:51:46 +02:00
|
|
|
case FORMAT_LZMA:
|
2008-11-19 19:46:52 +01:00
|
|
|
ret = lzma_alone_decoder(&strm,
|
2009-05-22 10:29:50 +02:00
|
|
|
hardware_memlimit_get());
|
2008-09-04 10:53:06 +02:00
|
|
|
break;
|
|
|
|
|
2008-10-02 21:51:46 +02:00
|
|
|
case FORMAT_RAW:
|
2008-12-27 18:30:19 +01:00
|
|
|
// Memory usage has already been checked in
|
|
|
|
// coder_set_compression_settings().
|
2008-11-19 19:46:52 +01:00
|
|
|
ret = lzma_raw_decoder(&strm, filters);
|
2008-09-04 10:53:06 +02:00
|
|
|
break;
|
|
|
|
}
|
2007-12-08 23:42:33 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
if (ret != LZMA_OK) {
|
|
|
|
if (ret == LZMA_MEM_ERROR)
|
2008-11-19 19:46:52 +01:00
|
|
|
message_error("%s", message_strm(LZMA_MEM_ERROR));
|
2007-12-08 23:42:33 +01:00
|
|
|
else
|
2008-11-19 19:46:52 +01:00
|
|
|
message_bug();
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
return true;
|
2007-12-08 23:42:33 +01:00
|
|
|
}
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
return false;
|
2007-12-08 23:42:33 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
static bool
|
|
|
|
coder_run(file_pair *pair)
|
2007-12-08 23:42:33 +01:00
|
|
|
{
|
2008-11-19 19:46:52 +01:00
|
|
|
// Buffers to hold input and output data.
|
|
|
|
uint8_t in_buf[IO_BUFFER_SIZE];
|
|
|
|
uint8_t out_buf[IO_BUFFER_SIZE];
|
|
|
|
|
|
|
|
// Initialize the progress indicator.
|
|
|
|
const uint64_t in_size = pair->src_st.st_size <= (off_t)(0)
|
|
|
|
? 0 : (uint64_t)(pair->src_st.st_size);
|
2009-02-22 17:52:49 +01:00
|
|
|
message_progress_start(&strm, pair->src_name, in_size);
|
2007-12-08 23:42:33 +01:00
|
|
|
|
|
|
|
lzma_action action = LZMA_RUN;
|
2008-09-02 18:33:32 +02:00
|
|
|
lzma_ret ret;
|
2009-02-22 17:52:49 +01:00
|
|
|
bool success = false; // Assume that something goes wrong.
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
strm.avail_in = 0;
|
|
|
|
strm.next_out = out_buf;
|
|
|
|
strm.avail_out = IO_BUFFER_SIZE;
|
2007-12-08 23:42:33 +01:00
|
|
|
|
|
|
|
while (!user_abort) {
|
2008-11-19 19:46:52 +01:00
|
|
|
// Fill the input buffer if it is empty and we haven't reached
|
|
|
|
// end of file yet.
|
|
|
|
if (strm.avail_in == 0 && !pair->src_eof) {
|
|
|
|
strm.next_in = in_buf;
|
|
|
|
strm.avail_in = io_read(pair, in_buf, IO_BUFFER_SIZE);
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
if (strm.avail_in == SIZE_MAX)
|
2007-12-08 23:42:33 +01:00
|
|
|
break;
|
2008-08-28 21:53:15 +02:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
// Encoder needs to know when we have given all the
|
|
|
|
// input to it. The decoders need to know it too when
|
|
|
|
// we are using LZMA_CONCATENATED.
|
|
|
|
if (pair->src_eof)
|
2007-12-08 23:42:33 +01:00
|
|
|
action = LZMA_FINISH;
|
|
|
|
}
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
// Let liblzma do the actual work.
|
|
|
|
ret = lzma_code(&strm, action);
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
// Write out if the output buffer became full.
|
|
|
|
if (strm.avail_out == 0) {
|
|
|
|
if (opt_mode != MODE_TEST && io_write(pair, out_buf,
|
|
|
|
IO_BUFFER_SIZE - strm.avail_out))
|
2009-02-22 17:52:49 +01:00
|
|
|
break;
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
strm.next_out = out_buf;
|
|
|
|
strm.avail_out = IO_BUFFER_SIZE;
|
2008-08-28 21:53:15 +02:00
|
|
|
}
|
|
|
|
|
2007-12-08 23:42:33 +01:00
|
|
|
if (ret != LZMA_OK) {
|
2008-11-19 19:46:52 +01:00
|
|
|
// Determine if the return value indicates that we
|
|
|
|
// won't continue coding.
|
|
|
|
const bool stop = ret != LZMA_NO_CHECK
|
|
|
|
&& ret != LZMA_UNSUPPORTED_CHECK;
|
|
|
|
|
|
|
|
if (stop) {
|
|
|
|
// Write the remaining bytes even if something
|
|
|
|
// went wrong, because that way the user gets
|
|
|
|
// as much data as possible, which can be good
|
|
|
|
// when trying to get at least some useful
|
|
|
|
// data out of damaged files.
|
|
|
|
if (opt_mode != MODE_TEST && io_write(pair,
|
|
|
|
out_buf, IO_BUFFER_SIZE
|
|
|
|
- strm.avail_out))
|
2009-02-22 17:52:49 +01:00
|
|
|
break;
|
2007-12-08 23:42:33 +01:00
|
|
|
}
|
2008-08-28 21:53:15 +02:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
if (ret == LZMA_STREAM_END) {
|
|
|
|
// Check that there is no trailing garbage.
|
|
|
|
// This is needed for LZMA_Alone and raw
|
|
|
|
// streams.
|
2009-02-22 17:52:49 +01:00
|
|
|
if (strm.avail_in == 0 && !pair->src_eof) {
|
|
|
|
// Try reading one more byte.
|
|
|
|
// Hopefully we don't get any more
|
|
|
|
// input, and thus pair->src_eof
|
|
|
|
// becomes true.
|
|
|
|
strm.avail_in = io_read(
|
|
|
|
pair, in_buf, 1);
|
|
|
|
if (strm.avail_in == SIZE_MAX)
|
|
|
|
break;
|
|
|
|
|
|
|
|
assert(strm.avail_in == 0
|
|
|
|
|| strm.avail_in == 1);
|
2008-11-19 19:46:52 +01:00
|
|
|
}
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2009-02-22 17:52:49 +01:00
|
|
|
if (strm.avail_in == 0) {
|
|
|
|
assert(pair->src_eof);
|
|
|
|
success = true;
|
|
|
|
break;
|
|
|
|
}
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
// We hadn't reached the end of the file.
|
|
|
|
ret = LZMA_DATA_ERROR;
|
|
|
|
assert(stop);
|
|
|
|
}
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
// If we get here and stop is true, something went
|
|
|
|
// wrong and we print an error. Otherwise it's just
|
|
|
|
// a warning and coding can continue.
|
|
|
|
if (stop) {
|
|
|
|
message_error("%s: %s", pair->src_name,
|
|
|
|
message_strm(ret));
|
|
|
|
} else {
|
|
|
|
message_warning("%s: %s", pair->src_name,
|
|
|
|
message_strm(ret));
|
|
|
|
|
|
|
|
// When compressing, all possible errors set
|
|
|
|
// stop to true.
|
|
|
|
assert(opt_mode != MODE_COMPRESS);
|
|
|
|
}
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
if (ret == LZMA_MEMLIMIT_ERROR) {
|
2008-12-17 19:11:23 +01:00
|
|
|
// Figure out how much memory it would have
|
2008-11-19 19:46:52 +01:00
|
|
|
// actually needed.
|
2008-12-17 19:11:23 +01:00
|
|
|
uint64_t memusage = lzma_memusage(&strm);
|
2009-05-22 10:29:50 +02:00
|
|
|
uint64_t memlimit = hardware_memlimit_get();
|
2008-12-17 19:11:23 +01:00
|
|
|
|
|
|
|
// Round the memory limit down and usage up.
|
|
|
|
// This way we don't display a ridiculous
|
|
|
|
// message like "Limit was 9 MiB, but 9 MiB
|
|
|
|
// would have been needed".
|
|
|
|
memusage = (memusage + 1024 * 1024 - 1)
|
|
|
|
/ (1024 * 1024);
|
|
|
|
memlimit /= 1024 * 1024;
|
|
|
|
|
2009-06-26 19:36:45 +02:00
|
|
|
message_error(_("Limit was %s MiB, "
|
|
|
|
"but %s MiB would "
|
2008-12-17 19:11:23 +01:00
|
|
|
"have been needed"),
|
2009-06-26 19:36:45 +02:00
|
|
|
uint64_to_str(memlimit, 0),
|
|
|
|
uint64_to_str(memusage, 1));
|
2008-11-19 19:46:52 +01:00
|
|
|
}
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
if (stop)
|
2009-02-22 17:52:49 +01:00
|
|
|
break;
|
2007-12-08 23:42:33 +01:00
|
|
|
}
|
|
|
|
|
2009-02-22 17:52:49 +01:00
|
|
|
// Show progress information under certain conditions.
|
|
|
|
message_progress_update();
|
2007-12-08 23:42:33 +01:00
|
|
|
}
|
|
|
|
|
2009-02-22 17:52:49 +01:00
|
|
|
message_progress_end(success);
|
|
|
|
|
|
|
|
return success;
|
2008-11-19 19:46:52 +01:00
|
|
|
}
|
2007-12-08 23:42:33 +01:00
|
|
|
|
|
|
|
|
|
|
|
extern void
|
|
|
|
process_file(const char *filename)
|
|
|
|
{
|
2008-11-19 19:46:52 +01:00
|
|
|
// First try initializing the coder. If it fails, it's useless to try
|
|
|
|
// opening the file. Check also for user_abort just in case if we had
|
|
|
|
// got a signal while initializing the coder.
|
|
|
|
if (coder_init() || user_abort)
|
2007-12-08 23:42:33 +01:00
|
|
|
return;
|
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
// Try to open the input and output files.
|
|
|
|
file_pair *pair = io_open(filename);
|
|
|
|
if (pair == NULL)
|
|
|
|
return;
|
2007-12-08 23:42:33 +01:00
|
|
|
|
2008-11-19 19:46:52 +01:00
|
|
|
// Do the actual coding.
|
|
|
|
const bool success = coder_run(pair);
|
|
|
|
|
|
|
|
// Close the file pair. It needs to know if coding was successful to
|
|
|
|
// know if the source or target file should be unlinked.
|
|
|
|
io_close(pair, success);
|
2007-12-08 23:42:33 +01:00
|
|
|
|
|
|
|
return;
|
|
|
|
}
|