mirror of
https://github.com/torvalds/linux.git
synced 2024-12-17 00:21:32 +00:00
4f3865fb57
Upgrade the zlib_inflate implementation in the kernel from a patched version 1.1.3/4 to a patched 1.2.3. The code in the kernel is about seven years old and I noticed that the external zlib library's inflate performance was significantly faster (~50%) than the code in the kernel on ARM (and faster again on x86_32). For comparison the newer deflate code is 20% slower on ARM and 50% slower on x86_32 but gives an approx 1% compression ratio improvement. I don't consider this to be an improvement for kernel use so have no plans to change the zlib_deflate code. Various changes have been made to the zlib code in the kernel, the most significant being the extra functions/flush option used by ppp_deflate. This update reimplements the features PPP needs to ensure it continues to work. This code has been tested on ARM under both JFFS2 (with zlib compression enabled) and ppp_deflate and on x86_32. JFFS2 sees an approx. 10% real world file read speed improvement. This patch also removes ZLIB_VERSION as it no longer has a correct value. We don't need version checks anyway as the kernel's module handling will take care of that for us. This removal is also more in keeping with the zlib author's wishes (http://www.zlib.net/zlib_faq.html#faq24) and I've added something to the zlib.h header to note its a modified version. Signed-off-by: Richard Purdie <rpurdie@rpsys.net> Acked-by: Joern Engel <joern@wh.fh-wedel.de> Signed-off-by: Andrew Morton <akpm@osdl.org> Signed-off-by: Linus Torvalds <torvalds@osdl.org>
56 lines
2.3 KiB
C
56 lines
2.3 KiB
C
/* inftrees.h -- header to use inftrees.c
|
|
* Copyright (C) 1995-2005 Mark Adler
|
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
|
*/
|
|
|
|
/* WARNING: this file should *not* be used by applications. It is
|
|
part of the implementation of the compression library and is
|
|
subject to change. Applications should only use zlib.h.
|
|
*/
|
|
|
|
/* Structure for decoding tables. Each entry provides either the
|
|
information needed to do the operation requested by the code that
|
|
indexed that table entry, or it provides a pointer to another
|
|
table that indexes more bits of the code. op indicates whether
|
|
the entry is a pointer to another table, a literal, a length or
|
|
distance, an end-of-block, or an invalid code. For a table
|
|
pointer, the low four bits of op is the number of index bits of
|
|
that table. For a length or distance, the low four bits of op
|
|
is the number of extra bits to get after the code. bits is
|
|
the number of bits in this code or part of the code to drop off
|
|
of the bit buffer. val is the actual byte to output in the case
|
|
of a literal, the base length or distance, or the offset from
|
|
the current table to the next table. Each entry is four bytes. */
|
|
typedef struct {
|
|
unsigned char op; /* operation, extra bits, table bits */
|
|
unsigned char bits; /* bits in this part of the code */
|
|
unsigned short val; /* offset in table or code value */
|
|
} code;
|
|
|
|
/* op values as set by inflate_table():
|
|
00000000 - literal
|
|
0000tttt - table link, tttt != 0 is the number of table index bits
|
|
0001eeee - length or distance, eeee is the number of extra bits
|
|
01100000 - end of block
|
|
01000000 - invalid code
|
|
*/
|
|
|
|
/* Maximum size of dynamic tree. The maximum found in a long but non-
|
|
exhaustive search was 1444 code structures (852 for length/literals
|
|
and 592 for distances, the latter actually the result of an
|
|
exhaustive search). The true maximum is not known, but the value
|
|
below is more than safe. */
|
|
#define ENOUGH 2048
|
|
#define MAXD 592
|
|
|
|
/* Type of code to build for inftable() */
|
|
typedef enum {
|
|
CODES,
|
|
LENS,
|
|
DISTS
|
|
} codetype;
|
|
|
|
extern int zlib_inflate_table (codetype type, unsigned short *lens,
|
|
unsigned codes, code **table,
|
|
unsigned *bits, unsigned short *work);
|