blob: 33276b28b537bc07b6da7f441fdcd53eccb652fa (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
///////////////////////////////////////////////////////////////////////////////
//
/// \file chunk_size.c
/// \brief Finds out the minimal reasonable chunk size for a filter chain
//
// Copyright (C) 2007 Lasse Collin
//
// This library 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 2.1 of the License, or (at your option) any later version.
//
// This library 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
// Lesser General Public License for more details.
//
///////////////////////////////////////////////////////////////////////////////
#include "common.h"
/**
* \brief Finds out the minimal reasonable chunk size for a filter chain
*
* This function helps determining the Uncompressed Sizes of the Blocks when
* doing multi-threaded encoding.
*
* When compressing a large file on a system having multiple CPUs or CPU
* cores, the file can be splitted in smaller chunks, that are compressed
* independently into separate Blocks in the same .lzma Stream.
*
* \return Minimum reasonable Uncompressed Size of a Block. The
* recommended minimum Uncompressed Size is between this value
* and the value times two.
Zero if the Uncompressed Sizes of Blocks don't matter
*/
extern LZMA_API size_t
lzma_chunk_size(const lzma_options_filter *filters)
{
while (filters->id != LZMA_VLI_UNKNOWN) {
switch (filters->id) {
// TODO LZMA_FILTER_SPARSE
case LZMA_FILTER_COPY:
case LZMA_FILTER_SUBBLOCK:
case LZMA_FILTER_X86:
case LZMA_FILTER_POWERPC:
case LZMA_FILTER_IA64:
case LZMA_FILTER_ARM:
case LZMA_FILTER_ARMTHUMB:
case LZMA_FILTER_SPARC:
// These are very fast, thus there is no point in
// splitting the data in smaller blocks.
break;
case LZMA_FILTER_LZMA1:
// The block sizes of the possible next filters in
// the chain are irrelevant after the LZMA filter.
return ((lzma_options_lzma *)(filters->options))
->dictionary_size;
default:
// Unknown filters
return 0;
}
++filters;
}
// Indicate that splitting would be useless.
return SIZE_MAX;
}
|
