mirror of
https://github.com/edk2-porting/linux-next.git
synced 2024-12-27 14:43:58 +08:00
bc22c17e12
Impact: Replaces inflate.c with a wrapper around zlib_inflate; new library code This is the first part of the bzip2/lzma patch The bzip patch is based on an idea by Christian Ludwig, includes support for compressing the kernel with bzip2 or lzma rather than gzip. Both compressors give smaller sizes than gzip. Lzma's decompresses faster than bzip2. It also supports ramdisks and initramfs' compressed using these two compressors. The functionality has been successfully used for a couple of years by the udpcast project This version applies to "tip" kernel 2.6.28 This part contains: - changed inflate.c to accomodate rest of patch - implementation of bzip2 compression (not used at this stage yet) - implementation of lzma compression (not used at this stage yet) - Makefile routines to support bzip2 and lzma kernel compression Signed-off-by: Alain Knaff <alain@knaff.lu> Signed-off-by: H. Peter Anvin <hpa@zytor.com>
60 lines
2.3 KiB
C
60 lines
2.3 KiB
C
#ifndef INFTREES_H
|
|
#define INFTREES_H
|
|
|
|
/* 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);
|
|
#endif
|