mirror of
https://github.com/torvalds/linux.git
synced 2024-11-13 23:51:39 +00:00
64c70b1cf4
This is a hybrid version of the patch to add the LZO1X compression algorithm to the kernel. Nitin and myself have merged the best parts of the various patches to form this version which we're both happy with (and are jointly signing off). The performance of this version is equivalent to the original minilzo code it was based on. Bytecode comparisons have also been made on ARM, i386 and x86_64 with favourable results. There are several users of LZO lined up including jffs2, crypto and reiser4 since its much faster than zlib. Signed-off-by: Nitin Gupta <nitingupta910@gmail.com> Signed-off-by: Richard Purdie <rpurdie@openedhand.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
44 lines
1.1 KiB
C
44 lines
1.1 KiB
C
/*
|
|
* lzodefs.h -- architecture, OS and compiler specific defines
|
|
*
|
|
* Copyright (C) 1996-2005 Markus F.X.J. Oberhumer <markus@oberhumer.com>
|
|
*
|
|
* The full LZO package can be found at:
|
|
* http://www.oberhumer.com/opensource/lzo/
|
|
*
|
|
* Changed for kernel use by:
|
|
* Nitin Gupta <nitingupta910@gmail.com>
|
|
* Richard Purdie <rpurdie@openedhand.com>
|
|
*/
|
|
|
|
#define LZO_VERSION 0x2020
|
|
#define LZO_VERSION_STRING "2.02"
|
|
#define LZO_VERSION_DATE "Oct 17 2005"
|
|
|
|
#define M1_MAX_OFFSET 0x0400
|
|
#define M2_MAX_OFFSET 0x0800
|
|
#define M3_MAX_OFFSET 0x4000
|
|
#define M4_MAX_OFFSET 0xbfff
|
|
|
|
#define M1_MIN_LEN 2
|
|
#define M1_MAX_LEN 2
|
|
#define M2_MIN_LEN 3
|
|
#define M2_MAX_LEN 8
|
|
#define M3_MIN_LEN 3
|
|
#define M3_MAX_LEN 33
|
|
#define M4_MIN_LEN 3
|
|
#define M4_MAX_LEN 9
|
|
|
|
#define M1_MARKER 0
|
|
#define M2_MARKER 64
|
|
#define M3_MARKER 32
|
|
#define M4_MARKER 16
|
|
|
|
#define D_BITS 14
|
|
#define D_MASK ((1u << D_BITS) - 1)
|
|
#define D_HIGH ((D_MASK >> 1) + 1)
|
|
|
|
#define DX2(p, s1, s2) (((((size_t)((p)[2]) << (s2)) ^ (p)[1]) \
|
|
<< (s1)) ^ (p)[0])
|
|
#define DX3(p, s1, s2, s3) ((DX2((p)+1, s2, s3) << (s1)) ^ (p)[0])
|