OptIO/src/lzo_mchw.ch

/* lzo_mchw.ch -- matching functions using a window

   This file is part of the LZO real-time data compression library.

   Copyright (C) 2008 Markus Franz Xaver Johannes Oberhumer
   Copyright (C) 2007 Markus Franz Xaver Johannes Oberhumer
   Copyright (C) 2006 Markus Franz Xaver Johannes Oberhumer
   Copyright (C) 2005 Markus Franz Xaver Johannes Oberhumer
   Copyright (C) 2004 Markus Franz Xaver Johannes Oberhumer
   Copyright (C) 2003 Markus Franz Xaver Johannes Oberhumer
   Copyright (C) 2002 Markus Franz Xaver Johannes Oberhumer
   Copyright (C) 2001 Markus Franz Xaver Johannes Oberhumer
   Copyright (C) 2000 Markus Franz Xaver Johannes Oberhumer
   Copyright (C) 1999 Markus Franz Xaver Johannes Oberhumer
   Copyright (C) 1998 Markus Franz Xaver Johannes Oberhumer
   Copyright (C) 1997 Markus Franz Xaver Johannes Oberhumer
   Copyright (C) 1996 Markus Franz Xaver Johannes Oberhumer
   All Rights Reserved.

   The LZO library is free software; you can redistribute it and/or
   modify it under the terms of the GNU General Public License as
   published by the Free Software Foundation; either version 2 of
   the License, or (at your option) any later version.

   The LZO library is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with the LZO library; see the file COPYING.
   If not, write to the Free Software Foundation, Inc.,
   51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.

   Markus F.X.J. Oberhumer
   <markus@oberhumer.com>
   http://www.oberhumer.com/opensource/lzo/
 */


/***********************************************************************
//
************************************************************************/

typedef struct
{
    int init;

    lzo_uint look;          /* bytes in lookahead buffer */

    lzo_uint m_len;
    lzo_uint m_off;

    lzo_uint last_m_len;
    lzo_uint last_m_off;

    const lzo_bytep bp;
    const lzo_bytep ip;
    const lzo_bytep in;
    const lzo_bytep in_end;
    lzo_bytep out;

    lzo_callback_p cb;

    lzo_uint textsize;      /* text size counter */
    lzo_uint codesize;      /* code size counter */
    lzo_uint printcount;    /* counter for reporting progress every 1K bytes */

    /* some stats */
    unsigned long lit_bytes;
    unsigned long match_bytes;
    unsigned long rep_bytes;
    unsigned long lazy;

#if defined(LZO1B)
    lzo_uint r1_m_len;

    /* some stats */
    unsigned long r1_r, m3_r, m2_m, m3_m;
#endif

#if defined(LZO1C)
    lzo_uint r1_m_len;
    lzo_bytep m3;

    /* some stats */
    unsigned long r1_r, m3_r, m2_m, m3_m;
#endif

#if defined(LZO1F)
    lzo_uint r1_lit;
    lzo_uint r1_m_len;

    /* some stats */
    unsigned long r1_r, m2_m, m3_m;
#endif

#if defined(LZO1X) || defined(LZO1Y) || defined(LZO1Z)
    lzo_uint r1_lit;
    lzo_uint r1_m_len;

    /* some stats */
    unsigned long m1a_m, m1b_m, m2_m, m3_m, m4_m;
    unsigned long lit1_r, lit2_r, lit3_r;
#endif

#if defined(LZO2A)
    /* some stats */
    unsigned long m1, m2, m3, m4;
#endif
}
LZO_COMPRESS_T;


#if (LZO_CC_BORLANDC && LZO_ARCH_I086) && (__BORLANDC__ < 0x0450)
   /* work around a Borland C 3.1 bug */
#  define getbyte(c)  ((c).ip < (c).in_end ? (c).ip +=1, (c).ip[-1] : (-1))
#elif defined(__TURBOC__) && defined(__TOS__)
   /* work around a bug in Turbo C / Pure C (Atari ST) */
#  define getbyte(c)  ((c).ip < (c).in_end ? (int)(unsigned) *((c).ip)++ : (-1))
#else
#  define getbyte(c)  ((c).ip < (c).in_end ? *((c).ip)++ : (-1))
#endif

#include "lzo_swd.ch"


/***********************************************************************
//
************************************************************************/

static int
init_match ( LZO_COMPRESS_T *c, lzo_swd_p s,
             const lzo_bytep dict, lzo_uint dict_len,
             lzo_uint32 flags )
{
    int r;

    assert(!c->init);
    c->init = 1;

    s->c = c;

    c->last_m_len = c->last_m_off = 0;

    c->textsize = c->codesize = c->printcount = 0;
    c->lit_bytes = c->match_bytes = c->rep_bytes = 0;
    c->lazy = 0;

    r = swd_init(s,dict,dict_len);
    if (r != 0)
        return r;

    s->use_best_off = (flags & 1) ? 1 : 0;
    return r;
}


/***********************************************************************
//
************************************************************************/

static int
find_match ( LZO_COMPRESS_T *c, lzo_swd_p s,
             lzo_uint this_len, lzo_uint skip )
{
    assert(c->init);

    if (skip > 0)
    {
        assert(this_len >= skip);
        swd_accept(s, this_len - skip);
        c->textsize += this_len - skip + 1;
    }
    else
    {
        assert(this_len <= 1);
        c->textsize += this_len - skip;
    }

    s->m_len = 1;
    s->m_len = THRESHOLD;
#ifdef SWD_BEST_OFF
    if (s->use_best_off)
        lzo_memset(s->best_pos,0,sizeof(s->best_pos));
#endif
    swd_findbest(s);
    c->m_len = s->m_len;
    c->m_off = s->m_off;

    swd_getbyte(s);

    if (s->b_char < 0)
    {
        c->look = 0;
        c->m_len = 0;
        swd_exit(s);
    }
    else
    {
        c->look = s->look + 1;
    }
    c->bp = c->ip - c->look;

#if 0
    /* brute force match search */
    if (c->m_len > THRESHOLD && c->m_len + 1 <= c->look)
    {
        const lzo_bytep ip = c->bp;
        const lzo_bytep m  = c->bp - c->m_off;
        const lzo_bytep in = c->in;

        if (ip - in > N)
            in = ip - N;
        for (;;)
        {
            while (*in != *ip)
                in++;
            if (in == ip)
                break;
            if (in != m)
                if (lzo_memcmp(in,ip,c->m_len+1) == 0)
                    printf("%p %p %p %5d\n",in,ip,m,c->m_len);
            in++;
        }
    }
#endif

    if (c->cb && c->cb->nprogress && c->textsize > c->printcount)
    {
        (*c->cb->nprogress)(c->cb, c->textsize, c->codesize, 0);
        c->printcount += 1024;
    }

    return LZO_E_OK;
}


/*
vi:ts=4:et
*/

Revision:	1.1
Committed:	Tue Feb 24 11:56:44 2009 UTC (16 years, 2 months ago) by loizides
Branch:	MAIN
CVS Tags:	Mit_032, Mit_031, Mit_025c_branch2, Mit_025c_branch1, Mit_030, Mit_029c, Mit_030_pre1, Mit_029a, Mit_029, Mit_029_pre1, Mit_028a, Mit_025c_branch0, Mit_028, Mit_027a, Mit_027, Mit_026, Mit_025e, Mit_025d, Mit_025c, Mit_025b, Mit_025a, Mit_025, Mit_025pre2, Mit_024b, Mit_025pre1, Mit_024a, Mit_024, Mit_023, Mit_022a, Mit_022, Mit_020d, TMit_020d, Mit_020c, Mit_021, Mit_021pre2, Mit_021pre1, Mit_020b, Mit_020a, Mit_020, Mit_020pre1, Mit_018, Mit_017, Mit_017pre3, Mit_017pre2, Mit_017pre1, V07-05-00, Mit_016, Mit_015b, Mit_015a, Mit_015, Mit_014e, Mit_014d, Mit_014c, Mit_014b, ConvRejection-10-06-09, Mit_014a, Mit_014, Mit_014pre3, Mit_014pre2, Mit_014pre1, Mit_013d, Mit_013c, Mit_013b, Mit_013a, Mit_013, Mit_013pre1, Mit_012i, Mit_012g, Mit_012f, Mit_012e, Mit_012d, Mit_012c, Mit_012b, Mit_012a, Mit_012, Mit_011a, Mit_011, Mit_010a, Mit_010, Mit_009c, Mit_009b, Mit_009a, Mit_009, Mit_008, Mit_008pre2, Mit_008pre1, HEAD
Branch point for:	Mit_025c_branch
Log Message:	Preload lib for compression improvements.
#	User	Rev	Content
1	loizides	1.1	/* lzo_mchw.ch -- matching functions using a window
2
3			This file is part of the LZO real-time data compression library.
4
5			Copyright (C) 2008 Markus Franz Xaver Johannes Oberhumer
6			Copyright (C) 2007 Markus Franz Xaver Johannes Oberhumer
7			Copyright (C) 2006 Markus Franz Xaver Johannes Oberhumer
8			Copyright (C) 2005 Markus Franz Xaver Johannes Oberhumer
9			Copyright (C) 2004 Markus Franz Xaver Johannes Oberhumer
10			Copyright (C) 2003 Markus Franz Xaver Johannes Oberhumer
11			Copyright (C) 2002 Markus Franz Xaver Johannes Oberhumer
12			Copyright (C) 2001 Markus Franz Xaver Johannes Oberhumer
13			Copyright (C) 2000 Markus Franz Xaver Johannes Oberhumer
14			Copyright (C) 1999 Markus Franz Xaver Johannes Oberhumer
15			Copyright (C) 1998 Markus Franz Xaver Johannes Oberhumer
16			Copyright (C) 1997 Markus Franz Xaver Johannes Oberhumer
17			Copyright (C) 1996 Markus Franz Xaver Johannes Oberhumer
18			All Rights Reserved.
19
20			The LZO library is free software; you can redistribute it and/or
21			modify it under the terms of the GNU General Public License as
22			published by the Free Software Foundation; either version 2 of
23			the License, or (at your option) any later version.
24
25			The LZO library is distributed in the hope that it will be useful,
26			but WITHOUT ANY WARRANTY; without even the implied warranty of
27			MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
28			GNU General Public License for more details.
29
30			You should have received a copy of the GNU General Public License
31			along with the LZO library; see the file COPYING.
32			If not, write to the Free Software Foundation, Inc.,
33			51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
34
35			Markus F.X.J. Oberhumer
36			<markus@oberhumer.com>
37			http://www.oberhumer.com/opensource/lzo/
38			*/
39
40
41			/***********************************************************************
42			//
43			************************************************************************/
44
45			typedef struct
46			{
47			int init;
48
49			lzo_uint look; /* bytes in lookahead buffer */
50
51			lzo_uint m_len;
52			lzo_uint m_off;
53
54			lzo_uint last_m_len;
55			lzo_uint last_m_off;
56
57			const lzo_bytep bp;
58			const lzo_bytep ip;
59			const lzo_bytep in;
60			const lzo_bytep in_end;
61			lzo_bytep out;
62
63			lzo_callback_p cb;
64
65			lzo_uint textsize; /* text size counter */
66			lzo_uint codesize; /* code size counter */
67			lzo_uint printcount; /* counter for reporting progress every 1K bytes */
68
69			/* some stats */
70			unsigned long lit_bytes;
71			unsigned long match_bytes;
72			unsigned long rep_bytes;
73			unsigned long lazy;
74
75			#if defined(LZO1B)
76			lzo_uint r1_m_len;
77
78			/* some stats */
79			unsigned long r1_r, m3_r, m2_m, m3_m;
80			#endif
81
82			#if defined(LZO1C)
83			lzo_uint r1_m_len;
84			lzo_bytep m3;
85
86			/* some stats */
87			unsigned long r1_r, m3_r, m2_m, m3_m;
88			#endif
89
90			#if defined(LZO1F)
91			lzo_uint r1_lit;
92			lzo_uint r1_m_len;
93
94			/* some stats */
95			unsigned long r1_r, m2_m, m3_m;
96			#endif
97
98			#if defined(LZO1X) \|\| defined(LZO1Y) \|\| defined(LZO1Z)
99			lzo_uint r1_lit;
100			lzo_uint r1_m_len;
101
102			/* some stats */
103			unsigned long m1a_m, m1b_m, m2_m, m3_m, m4_m;
104			unsigned long lit1_r, lit2_r, lit3_r;
105			#endif
106
107			#if defined(LZO2A)
108			/* some stats */
109			unsigned long m1, m2, m3, m4;
110			#endif
111			}
112			LZO_COMPRESS_T;
113
114
115			#if (LZO_CC_BORLANDC && LZO_ARCH_I086) && (__BORLANDC__ < 0x0450)
116			/* work around a Borland C 3.1 bug */
117			# define getbyte(c) ((c).ip < (c).in_end ? (c).ip +=1, (c).ip[-1] : (-1))
118			#elif defined(__TURBOC__) && defined(__TOS__)
119			/* work around a bug in Turbo C / Pure C (Atari ST) */
120			# define getbyte(c) ((c).ip < (c).in_end ? (int)(unsigned) *((c).ip)++ : (-1))
121			#else
122			# define getbyte(c) ((c).ip < (c).in_end ? *((c).ip)++ : (-1))
123			#endif
124
125			#include "lzo_swd.ch"
126
127
128			/***********************************************************************
129			//
130			************************************************************************/
131
132			static int
133			init_match ( LZO_COMPRESS_T *c, lzo_swd_p s,
134			const lzo_bytep dict, lzo_uint dict_len,
135			lzo_uint32 flags )
136			{
137			int r;
138
139			assert(!c->init);
140			c->init = 1;
141
142			s->c = c;
143
144			c->last_m_len = c->last_m_off = 0;
145
146			c->textsize = c->codesize = c->printcount = 0;
147			c->lit_bytes = c->match_bytes = c->rep_bytes = 0;
148			c->lazy = 0;
149
150			r = swd_init(s,dict,dict_len);
151			if (r != 0)
152			return r;
153
154			s->use_best_off = (flags & 1) ? 1 : 0;
155			return r;
156			}
157
158
159			/***********************************************************************
160			//
161			************************************************************************/
162
163			static int
164			find_match ( LZO_COMPRESS_T *c, lzo_swd_p s,
165			lzo_uint this_len, lzo_uint skip )
166			{
167			assert(c->init);
168
169			if (skip > 0)
170			{
171			assert(this_len >= skip);
172			swd_accept(s, this_len - skip);
173			c->textsize += this_len - skip + 1;
174			}
175			else
176			{
177			assert(this_len <= 1);
178			c->textsize += this_len - skip;
179			}
180
181			s->m_len = 1;
182			s->m_len = THRESHOLD;
183			#ifdef SWD_BEST_OFF
184			if (s->use_best_off)
185			lzo_memset(s->best_pos,0,sizeof(s->best_pos));
186			#endif
187			swd_findbest(s);
188			c->m_len = s->m_len;
189			c->m_off = s->m_off;
190
191			swd_getbyte(s);
192
193			if (s->b_char < 0)
194			{
195			c->look = 0;
196			c->m_len = 0;
197			swd_exit(s);
198			}
199			else
200			{
201			c->look = s->look + 1;
202			}
203			c->bp = c->ip - c->look;
204
205			#if 0
206			/* brute force match search */
207			if (c->m_len > THRESHOLD && c->m_len + 1 <= c->look)
208			{
209			const lzo_bytep ip = c->bp;
210			const lzo_bytep m = c->bp - c->m_off;
211			const lzo_bytep in = c->in;
212
213			if (ip - in > N)
214			in = ip - N;
215			for (;;)
216			{
217			while (in != ip)
218			in++;
219			if (in == ip)
220			break;
221			if (in != m)
222			if (lzo_memcmp(in,ip,c->m_len+1) == 0)
223			printf("%p %p %p %5d\n",in,ip,m,c->m_len);
224			in++;
225			}
226			}
227			#endif
228
229			if (c->cb && c->cb->nprogress && c->textsize > c->printcount)
230			{
231			(*c->cb->nprogress)(c->cb, c->textsize, c->codesize, 0);
232			c->printcount += 1024;
233			}
234
235			return LZO_E_OK;
236			}
237
238
239			/*
240			vi:ts=4:et
241			*/
242