ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/liblzf/lzfP.h
(Generate patch)

Comparing liblzf/lzfP.h (file contents):
Revision 1.21 by root, Tue Jun 1 01:15:34 2010 UTC vs.
Revision 1.31 by root, Mon Jun 29 23:34:41 2015 UTC

1/* 1/*
2 * Copyright (c) 2000-2007 Marc Alexander Lehmann <schmorp@schmorp.de> 2 * Copyright (c) 2000-2007 Marc Alexander Lehmann <schmorp@schmorp.de>
3 * 3 *
4 * Redistribution and use in source and binary forms, with or without modifica- 4 * Redistribution and use in source and binary forms, with or without modifica-
5 * tion, are permitted provided that the following conditions are met: 5 * tion, are permitted provided that the following conditions are met:
6 * 6 *
7 * 1. Redistributions of source code must retain the above copyright notice, 7 * 1. Redistributions of source code must retain the above copyright notice,
8 * this list of conditions and the following disclaimer. 8 * this list of conditions and the following disclaimer.
9 * 9 *
10 * 2. Redistributions in binary form must reproduce the above copyright 10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the 11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution. 12 * documentation and/or other materials provided with the distribution.
13 * 13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED 14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
15 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- 15 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
16 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO 16 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
17 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- 17 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
18 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 18 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
… …
47 * Size of hashtable is (1 << HLOG) * sizeof (char *) 47 * Size of hashtable is (1 << HLOG) * sizeof (char *)
48 * decompression is independent of the hash table size 48 * decompression is independent of the hash table size
49 * the difference between 15 and 14 is very small 49 * the difference between 15 and 14 is very small
50 * for small blocks (and 14 is usually a bit faster). 50 * for small blocks (and 14 is usually a bit faster).
51 * For a low-memory/faster configuration, use HLOG == 13; 51 * For a low-memory/faster configuration, use HLOG == 13;
52 * For best compression, use 15 or 16 (or more, up to 23). 52 * For best compression, use 15 or 16 (or more, up to 22).
53 */ 53 */
54#ifndef HLOG 54#ifndef HLOG
55# define HLOG 16 55# define HLOG 16
56#endif 56#endif
57 57
… …
86 * You may choose to pre-set the hash table (might be faster on some 86 * You may choose to pre-set the hash table (might be faster on some
87 * modern cpus and large (>>64k) blocks, and also makes compression 87 * modern cpus and large (>>64k) blocks, and also makes compression
88 * deterministic/repeatable when the configuration otherwise is the same). 88 * deterministic/repeatable when the configuration otherwise is the same).
89 */ 89 */
90#ifndef INIT_HTAB 90#ifndef INIT_HTAB
91# define INIT_HTAB 0 91# define INIT_HTAB 1
92#endif 92#endif
93 93
94/* 94/*
95 * Avoid assigning values to errno variable? for some embedding purposes 95 * Avoid assigning values to errno variable? for some embedding purposes
96 * (linux kernel for example), this is necessary. NOTE: this breaks 96 * (linux kernel for example), this is necessary. NOTE: this breaks
… …
119 */ 119 */
120#ifndef CHECK_INPUT 120#ifndef CHECK_INPUT
121# define CHECK_INPUT 1 121# define CHECK_INPUT 1
122#endif 122#endif
123 123
124/*
125 * Whether the target CPU has a slow multiplication. This affects
126 * the default hash function for the compressor, and enables a slightly
127 * worse hash function that needs only shifts.
128 */
129#ifndef MULTIPLICATION_IS_SLOW
130# define MULTIPLICATION_IS_SLOW 0
131#endif
132
133/*
134 * If defined, then this data type will be used for storing offsets.
135 * This can be useful if you want to use a huge hashtable, want to
136 * conserve memory, or both, and your data fits into e.g. 64kb.
137 * If instead you want to compress data > 4GB, then it's better to
138 * to "#define LZF_USE_OFFSETS 0" instead.
139 */
140/*#define LZF_HSLOT unsigned short*/
141
142/*
143 * Whether to store pointers or offsets inside the hash table. On
144 * 64 bit architetcures, pointers take up twice as much space,
145 * and might also be slower. Default is to autodetect.
146 */
147/*#define LZF_USE_OFFSETS autodetect */
148
149/*
150 * Whether to optimise code for size, at the expense of speed. Use
151 * this when you are extremely tight on memory, perhaps in combination
152 * with AVOID_ERRNO 1 and CHECK_INPUT 0.
153 */
154#ifndef OPTIMISE_SIZE
155# ifdef __OPTIMIZE_SIZE__
156# define OPTIMISE_SIZE 1
157# else
158# define OPTIMISE_SIZE 0
159# endif
160#endif
161
124/*****************************************************************************/ 162/*****************************************************************************/
125/* nothing should be changed below */ 163/* nothing should be changed below */
126 164
127#ifdef __cplusplus 165#ifdef __cplusplus
128# include <cstring> 166# include <cstring>
167# include <climits>
129using namespace std; 168using namespace std;
130#else 169#else
131# include <string.h> 170# include <string.h>
132#endif
133
134typedef unsigned char u8;
135
136typedef const u8 *LZF_STATE[1 << (HLOG)];
137
138#if !STRICT_ALIGN
139/* for unaligned accesses we need a 16 bit datatype. */
140# ifdef __cplusplus
141# include <climits>
142# else
143# include <limits.h> 171# include <limits.h>
144# endif
145# if USHRT_MAX == 65535
146 typedef unsigned short u16;
147# elif UINT_MAX == 65535
148 typedef unsigned int u16;
149# else
150# undef STRICT_ALIGN
151# define STRICT_ALIGN 1
152# endif
153#endif 172#endif
154 173
155#if ULTRA_FAST 174#if ULTRA_FAST
156# undef VERY_FAST 175# undef VERY_FAST
157#endif 176#endif
158 177
178#ifndef LZF_USE_OFFSETS
179# ifdef _WIN32
180# define LZF_USE_OFFSETS defined(_M_X64)
181# else
182# if __cplusplus > 199711L
183# include <cstdint>
184# else
185# include <stdint.h>
186# endif
187# define LZF_USE_OFFSETS (UINTPTR_MAX > 0xffffffffU)
159#endif 188# endif
189#endif
160 190
191typedef unsigned char u8;
192
193#ifdef LZF_HSLOT
194# define LZF_HSLOT_BIAS ((const u8 *)in_data)
195#else
196# if LZF_USE_OFFSETS
197# define LZF_HSLOT_BIAS ((const u8 *)in_data)
198 typedef unsigned int LZF_HSLOT;
199# else
200# define LZF_HSLOT_BIAS 0
201 typedef const u8 *LZF_HSLOT;
202# endif
203#endif
204
205#if USHRT_MAX == 65535
206 typedef unsigned short u16;
207#elif UINT_MAX == 65535
208 typedef unsigned int u16;
209#else
210# undef STRICT_ALIGN
211# define STRICT_ALIGN 1
212#endif
213
214#define LZF_MAX_LIT (1 << 5)
215#define LZF_MAX_OFF (1 << 13)
216#define LZF_MAX_REF ((1 << 8) + (1 << 3))
217
218typedef LZF_HSLOT LZF_STATE[1 << (HLOG)];
219
220typedef struct
221{
222 const u8 *first [1 << (6+8)]; /* most recent occurance of a match */
223 u16 prev [LZF_MAX_OFF]; /* how many bytes to go backwards for the next match */
224} LZF_STATE_BEST[1];
225
226#endif
227

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines