liblzf/lzf_c.c

/*
 * Copyright (c) 2000-2003 Marc Alexander Lehmann <pcg@goof.com>
 * 
 * Redistribution and use in source and binary forms, with or without modifica-
 * tion, are permitted provided that the following conditions are met:
 * 
 *   1.  Redistributions of source code must retain the above copyright notice,
 *       this list of conditions and the following disclaimer.
 * 
 *   2.  Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 * 
 *   3.  The name of the author may not be used to endorse or promote products
 *       derived from this software without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO
 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
 * OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include "lzfP.h"

#define HSIZE (1 << (HLOG))

/*
 * don't play with this unless you benchmark!
 * decompression is not dependent on the hash function
 * the hashing function might seem strange, just believe me
 * it works ;)
 */
#define FRST(p) (((p[0]) << 8) + p[1])
#define NEXT(v,p) (((v) << 8) + p[2])
#define IDX(h) ((((h ^ (h << 5)) >> (3*8 - HLOG)) + h*3) & (HSIZE - 1))
/*
 * IDX works because it is very similar to a multiplicative hash, e.g.
 * (h * 57321 >> (3*8 - HLOG))
 * the next one is also quite good, albeit slow ;)
 * (int)(cos(h & 0xffffff) * 1e6)
 */

#if 0
/* original lzv-like hash function */
# define FRST(p) (p[0] << 5) ^ p[1]
# define NEXT(v,p) ((v) << 5) ^ p[2]
# define IDX(h) ((h) & (HSIZE - 1))
#endif

#define        MAX_LIT        (1 <<  5)
#define        MAX_OFF        (1 << 13)
#define        MAX_REF        ((1 <<  8) + (1 << 3))

/*
 * compressed format
 *
 * 000LLLLL <L+1>    ; literal
 * LLLOOOOO oooooooo ; backref L
 * 111OOOOO LLLLLLLL oooooooo ; backref L+7
 *
 */

unsigned int
lzf_compress (const void *const in_data, unsigned int in_len,
              void *out_data, unsigned int out_len
#if !LZF_STATE_ARG
              , LZF_STATE *htab
#endif
              )
{
#if LZF_STATE_ARG
  LZF_STATE htab;
#endif
  const u8 **hslot;
  const u8 *ip = (const u8 *)in_data;
        u8 *op = (u8 *)out_data;
  const u8 *in_end  = ip + in_len;
        u8 *out_end = op + out_len;
  const u8 *ref;

  unsigned int hval = FRST (ip);
  unsigned long off;
           int lit = 0;

#if INIT_HTAB
# if USE_MEMCPY
    memset (htab, 0, sizeof (htab));
# else
    for (hslot = htab; hslot < htab + HSIZE; hslot++)
      *hslot++ = ip;
# endif
#endif

  do
    {
      hval = NEXT (hval, ip);
      hslot = htab + IDX (hval);
      ref = *hslot; *hslot = ip;

      if (1
#if INIT_HTAB && !USE_MEMCPY
          && ref < ip /* the next test will actually take care of this, but it is faster */
#endif
          && (off = ip - ref - 1) < MAX_OFF
          && ip + 4 < in_end
          && ref > (u8 *)in_data
#if STRICT_ALIGN
          && ref[0] == ip[0]
          && ref[1] == ip[1]
          && ref[2] == ip[2]
#else
          && *(u16 *)ref == *(u16 *)ip
          && ref[2] == ip[2]
#endif
        )
        {
          /* match found at *ref++ */
          unsigned int len = 2;
          unsigned int maxlen = in_end - ip - len;
          maxlen = maxlen > MAX_REF ? MAX_REF : maxlen;

          do
            len++;
          while (len < maxlen && ref[len] == ip[len]);

          if (op + lit + 1 + 3 >= out_end)
            return 0;

          if (lit)
            {
              *op++ = lit - 1;
              lit = -lit;
              do
                *op++ = ip[lit];
              while (++lit);
            }

          len -= 2;
          ip++;

          if (len < 7)
            {
              *op++ = (off >> 8) + (len << 5);
            }
          else
            {
              *op++ = (off >> 8) + (  7 << 5);
              *op++ = len - 7;
            }

          *op++ = off;

#if ULTRA_FAST
          ip += len;
          hval = FRST (ip);
          hval = NEXT (hval, ip);
          htab[IDX (hval)] = ip;
          ip++;
#else
          do
            {
              hval = NEXT (hval, ip);
              htab[IDX (hval)] = ip;
              ip++;
            }
          while (len--);
#endif
        }
      else
        {
          /* one more literal byte we must copy */
          lit++;
          ip++;

          if (lit == MAX_LIT)
            {
              if (op + 1 + MAX_LIT >= out_end)
                return 0;

              *op++ = MAX_LIT - 1;
#if USE_MEMCPY
              memcpy (op, ip - MAX_LIT, MAX_LIT);
              op += MAX_LIT;
              lit = 0;
#else
              lit = -lit;
              do
                *op++ = ip[lit];
              while (++lit);
#endif
            }
        }
    }
  while (ip < in_end);

  if (lit)
    {
      if (op + lit + 1 >= out_end)
        return 0;

      *op++ = lit - 1;
      lit = -lit;
      do
        *op++ = ip[lit];
      while (++lit);
    }

  return op - (u8 *) out_data;
}
Revision:	1.4
Committed:	Tue Dec 23 04:52:00 2003 UTC (20 years, 4 months ago) by pcg
Content type:	text/plain
Branch:	MAIN
Changes since 1.3:	+11 -5 lines
Log Message:	* empty log message *
#	User	Rev	Content
1	root	1.1	/*
2	pcg	1.4	* Copyright (c) 2000-2003 Marc Alexander Lehmann <pcg@goof.com>
3	root	1.1	*
4			* Redistribution and use in source and binary forms, with or without modifica-
5			* tion, are permitted provided that the following conditions are met:
6			*
7			* 1. Redistributions of source code must retain the above copyright notice,
8			* this list of conditions and the following disclaimer.
9			*
10			* 2. Redistributions in binary form must reproduce the above copyright
11			* notice, this list of conditions and the following disclaimer in the
12			* documentation and/or other materials provided with the distribution.
13			*
14			* 3. The name of the author may not be used to endorse or promote products
15			* derived from this software without specific prior written permission.
16			*
17			* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
18			* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
19			* CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
20			* EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
21			* CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
22			* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
23			* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
24			* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
25			* ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
26			* OF THE POSSIBILITY OF SUCH DAMAGE.
27			*/
28
29			#include "lzfP.h"
30
31			#define HSIZE (1 << (HLOG))
32
33			/*
34			* don't play with this unless you benchmark!
35			* decompression is not dependent on the hash function
36			* the hashing function might seem strange, just believe me
37			* it works ;)
38			*/
39			#define FRST(p) (((p[0]) << 8) + p[1])
40			#define NEXT(v,p) (((v) << 8) + p[2])
41	root	1.2	#define IDX(h) ((((h ^ (h << 5)) >> (38 - HLOG)) + h3) & (HSIZE - 1))
42	root	1.1	/*
43			* IDX works because it is very similar to a multiplicative hash, e.g.
44			* (h * 57321 >> (3*8 - HLOG))
45			* the next one is also quite good, albeit slow ;)
46			* (int)(cos(h & 0xffffff) * 1e6)
47			*/
48
49			#if 0
50			/* original lzv-like hash function */
51			# define FRST(p) (p[0] << 5) ^ p[1]
52	root	1.2	# define NEXT(v,p) ((v) << 5) ^ p[2]
53			# define IDX(h) ((h) & (HSIZE - 1))
54	root	1.1	#endif
55
56			#define MAX_LIT (1 << 5)
57			#define MAX_OFF (1 << 13)
58			#define MAX_REF ((1 << 8) + (1 << 3))
59
60			/*
61			* compressed format
62			*
63			* 000LLLLL <L+1> ; literal
64			* LLLOOOOO oooooooo ; backref L
65			* 111OOOOO LLLLLLLL oooooooo ; backref L+7
66			*
67			*/
68
69			unsigned int
70			lzf_compress (const void *const in_data, unsigned int in_len,
71	pcg	1.4	void *out_data, unsigned int out_len
72			#if !LZF_STATE_ARG
73			, LZF_STATE *htab
74			#endif
75			)
76	root	1.1	{
77	pcg	1.4	#if LZF_STATE_ARG
78			LZF_STATE htab;
79			#endif
80	root	1.1	const u8 **hslot;
81	pcg	1.4	const u8 ip = (const u8 )in_data;
82			u8 op = (u8 )out_data;
83	root	1.1	const u8 *in_end = ip + in_len;
84			u8 *out_end = op + out_len;
85			const u8 *ref;
86
87			unsigned int hval = FRST (ip);
88			unsigned long off;
89			int lit = 0;
90
91			#if INIT_HTAB
92			# if USE_MEMCPY
93			memset (htab, 0, sizeof (htab));
94			# else
95			for (hslot = htab; hslot < htab + HSIZE; hslot++)
96			*hslot++ = ip;
97			# endif
98			#endif
99
100			do
101			{
102			hval = NEXT (hval, ip);
103			hslot = htab + IDX (hval);
104			ref = hslot; hslot = ip;
105
106			if (1
107			#if INIT_HTAB && !USE_MEMCPY
108			&& ref < ip /* the next test will actually take care of this, but it is faster */
109			#endif
110			&& (off = ip - ref - 1) < MAX_OFF
111			&& ip + 4 < in_end
112			&& ref > (u8 *)in_data
113			#if STRICT_ALIGN
114			&& ref[0] == ip[0]
115			&& ref[1] == ip[1]
116			&& ref[2] == ip[2]
117			#else
118			&& (u16 )ref == (u16 )ip
119			&& ref[2] == ip[2]
120			#endif
121			)
122			{
123			/* match found at ref++ /
124			unsigned int len = 2;
125			unsigned int maxlen = in_end - ip - len;
126			maxlen = maxlen > MAX_REF ? MAX_REF : maxlen;
127
128			do
129			len++;
130			while (len < maxlen && ref[len] == ip[len]);
131
132			if (op + lit + 1 + 3 >= out_end)
133			return 0;
134
135			if (lit)
136			{
137			*op++ = lit - 1;
138			lit = -lit;
139			do
140			*op++ = ip[lit];
141			while (++lit);
142			}
143
144			len -= 2;
145			ip++;
146
147			if (len < 7)
148			{
149			*op++ = (off >> 8) + (len << 5);
150			}
151			else
152			{
153			*op++ = (off >> 8) + ( 7 << 5);
154			*op++ = len - 7;
155			}
156
157			*op++ = off;
158
159			#if ULTRA_FAST
160			ip += len;
161			hval = FRST (ip);
162			hval = NEXT (hval, ip);
163			htab[IDX (hval)] = ip;
164			ip++;
165			#else
166			do
167			{
168			hval = NEXT (hval, ip);
169			htab[IDX (hval)] = ip;
170			ip++;
171			}
172			while (len--);
173			#endif
174			}
175			else
176			{
177			/* one more literal byte we must copy */
178			lit++;
179			ip++;
180
181			if (lit == MAX_LIT)
182			{
183			if (op + 1 + MAX_LIT >= out_end)
184			return 0;
185
186			*op++ = MAX_LIT - 1;
187			#if USE_MEMCPY
188			memcpy (op, ip - MAX_LIT, MAX_LIT);
189			op += MAX_LIT;
190			lit = 0;
191			#else
192			lit = -lit;
193			do
194			*op++ = ip[lit];
195			while (++lit);
196			#endif
197			}
198			}
199			}
200			while (ip < in_end);
201
202			if (lit)
203			{
204			if (op + lit + 1 >= out_end)
205			return 0;
206
207			*op++ = lit - 1;
208			lit = -lit;
209			do
210			*op++ = ip[lit];
211			while (++lit);
212			}
213
214			return op - (u8 *) out_data;
215			}