/src/lzo-2.10/src/lzo1b_9x.c

Source
/* lzo1b_9x.c -- implementation of the LZO1B-999 compression algorithm

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

   Copyright (C) 1996-2017 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/
 */


#include "config1b.h"


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

#define SWD_N          0xffffL          /* size of ring buffer */
#define SWD_THRESHOLD       2           /* lower limit for match length */
#define SWD_F            2048           /* upper limit for match length */


#define LZO1B 1
#define LZO_COMPRESS_T  lzo1b_999_t
#define lzo_swd_t       lzo1b_999_swd_t
#include "lzo_mchw.ch"



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

static lzo_bytep
code_match ( LZO_COMPRESS_T *c, lzo_bytep op, lzo_uint m_len, lzo_uint m_off )
{
    if (m_len <= M2_MAX_LEN && m_off <= M2_MAX_OFFSET)
    {
        assert(m_len >= M2_MIN_LEN);
        assert(m_off >= M2_MIN_OFFSET);

        m_off -= M2_MIN_OFFSET;
        /* code match len + low offset bits */
        *op++ = LZO_BYTE(((m_len - (M2_MIN_LEN - 2)) << M2O_BITS) |
                          (m_off & M2O_MASK));
        /* code high offset bits */
        *op++ = LZO_BYTE(m_off >> M2O_BITS);
        c->m2_m++;
    }
    else
    {
        assert(m_len >= M3_MIN_LEN);
        assert(m_off <= M3_MAX_OFFSET);

        m_off -= M3_MIN_OFFSET - M3_EOF_OFFSET;
        /* code match len */
        if (m_len <= M3_MAX_LEN)
            *op++ = LZO_BYTE(M3_MARKER | (m_len - (M3_MIN_LEN - 1)));
        else
        {
            assert(m_len >= M4_MIN_LEN);
            /* code M4 match len flag */
            *op++ = M4_MARKER;
            /* code match len */
            m_len -= M4_MIN_LEN - 1;
            while (m_len > 255)
            {
                m_len -= 255;
                *op++ = 0;
            }
            assert(m_len > 0);
            *op++ = LZO_BYTE(m_len);
        }
        /* code low offset bits */
        *op++ = LZO_BYTE(m_off & M3O_MASK);
        /* code high offset bits */
        *op++ = LZO_BYTE(m_off >> M3O_BITS);

        c->r1_m_len = 0;
        c->m3_m++;
    }
    return op;
}


/***********************************************************************
// this is a public function, but there is no prototype in a header file
************************************************************************/

LZO_EXTERN(int)
lzo1b_999_compress_callback ( const lzo_bytep in , lzo_uint  in_len,
                                    lzo_bytep out, lzo_uintp out_len,
                                    lzo_voidp wrkmem,
                                    lzo_callback_p cb,
                                    lzo_uint max_chain );

LZO_PUBLIC(int)
lzo1b_999_compress_callback ( const lzo_bytep in , lzo_uint  in_len,
                                    lzo_bytep out, lzo_uintp out_len,
                                    lzo_voidp wrkmem,
                                    lzo_callback_p cb,
                                    lzo_uint max_chain )
{
    lzo_bytep op;
    const lzo_bytep ii;
    lzo_uint lit;
    lzo_uint m_len, m_off;
    LZO_COMPRESS_T cc;
    LZO_COMPRESS_T * const c = &cc;
    lzo_swd_p const swd = (lzo_swd_p) wrkmem;
    int r;

    /* sanity check */
    LZO_COMPILE_TIME_ASSERT(LZO1B_999_MEM_COMPRESS >= SIZEOF_LZO_SWD_T)

    c->init = 0;
    c->ip = c->in = in;
    c->in_end = in + in_len;
    c->cb = cb;
    c->r1_r = c->m3_r = c->m2_m = c->m3_m = 0;

    op = out;
    ii = c->ip;             /* point to start of literal run */
    lit = 0;
    c->r1_m_len = 0;

    r = init_match(c,swd,NULL,0,0);
    if (r != 0)
        return r;
    if (max_chain > 0)
        swd->max_chain = max_chain;

    r = find_match(c,swd,0,0);
    if (r != 0)
        return r;
    while (c->look > 0)
    {
        int lazy_match_min_gain = -1;
        lzo_uint ahead = 0;

        m_len = c->m_len;
        m_off = c->m_off;

#if 0
        printf("%5ld: %5d len:%3d off:%5d\n", (c->ip-c->look)-in, c->look,
                m_len, m_off);
#endif

        assert(c->ip - c->look >= in);
        if (lit == 0)
            ii = c->ip - c->look;
        assert(ii + lit == c->ip - c->look);
        assert(swd->b_char == *(c->ip - c->look));

        if ((m_len < M2_MIN_LEN) ||
            (m_len < M3_MIN_LEN && m_off > M2_MAX_OFFSET))
        {
            m_len = 0;
        }
        else
        {
            assert(c->ip - c->look - m_off >= in);
            assert(c->ip - c->look - m_off + m_len < c->ip);
            assert(lzo_memcmp(c->ip - c->look, c->ip - c->look - m_off,
                              m_len) == 0);

            if (lit > 0)
            {
                /* we have a current literal run: do not try a lazy match,
                   if the literal could be coded into a r1 match */
                if (lit == 1 && c->r1_m_len == M2_MIN_LEN)
                    lazy_match_min_gain = -1;
                else
                    lazy_match_min_gain = 1;

#if (M2_MIN_LEN == 2)
                if (m_len == 2)
                {
                    /* don't code a match of len 2 if we have to
                       code a literal run. Code a literal instead. */
                    m_len = 0;
                }
#endif
#if (M2_MIN_LEN == M3_MIN_LEN)
                if (m_len == M2_MIN_LEN && m_off > M2_MAX_OFFSET)
                {
                    /* don't code a M3 match of len 3 if we have to
                       code a literal run. Code a literal instead. */
                    m_len = 0;
                }
#endif
            }
            else
            {
                /* no current literal run: only try a lazy match,
                   if the literal could be coded into a r1 match */
                if (c->r1_m_len == M2_MIN_LEN)
                    lazy_match_min_gain = 0;
                else
                    lazy_match_min_gain = -1;
            }
        }


        /* try a lazy match */
        if (m_len == 0)
            lazy_match_min_gain = -1;
        if (lazy_match_min_gain >= 0 && c->look > m_len)
        {
            assert(m_len > 0);

            r = find_match(c,swd,1,0);
            assert(r == 0); LZO_UNUSED(r);
            assert(c->look > 0);

            if (m_len <= M2_MAX_LEN && m_off <= M2_MAX_OFFSET &&
                c->m_off > M2_MAX_OFFSET)
                lazy_match_min_gain += 1;

            if (c->m_len >= m_len + lazy_match_min_gain)
            {
                c->lazy++;
#if !defined(NDEBUG)
                m_len = c->m_len;
                m_off = c->m_off;
                assert(lzo_memcmp(c->ip - c->look, c->ip - c->look - m_off,
                                  m_len) == 0);
#endif
                lit++;
                assert(ii + lit == c->ip - c->look);
                continue;
            }
            else
            {
                ahead = 1;
                assert(ii + lit + 1 == c->ip - c->look);
            }
            assert(m_len > 0);
        }
        assert(ii + lit + ahead == c->ip - c->look);


        if (m_len == 0)
        {
            /* a literal */
            lit++;
            r = find_match(c,swd,1,0);
            assert(r == 0); LZO_UNUSED(r);
        }
        else
        {
            /* 1 - store run */
            if (lit > 0)
            {
                /* code current literal run */
                if (lit == 1 && c->r1_m_len == M2_MIN_LEN)
                {
                    /* Code a context sensitive R1 match. */
                    assert((op[-2] >> M2O_BITS) == (M2_MARKER >> M2O_BITS));
                    op[-2] &= M2O_MASK;
                    assert((op[-2] >> M2O_BITS) == 0);
                    /* copy 1 literal */
                    *op++ = *ii++;
                    assert(ii + ahead == c->ip - c->look);
                    c->r1_r++;
                }
                else
                {
                    op = STORE_RUN(op,ii,lit);
                }
                if (lit < R0FAST)
                    c->r1_m_len = m_len;
                else
                    c->r1_m_len = 0;
                lit = 0;
            }
            else
                c->r1_m_len = 0;

            /* 2 - code match */
            op = code_match(c,op,m_len,m_off);
            r = find_match(c,swd,m_len,1+ahead);
            assert(r == 0); LZO_UNUSED(r);
        }

        c->codesize = pd(op, out);
    }


    /* store final run */
    if (lit > 0)
        op = STORE_RUN(op,ii,lit);

#if defined(LZO_EOF_CODE)
    *op++ = M3_MARKER | 1;
    *op++ = 0;
    *op++ = 0;
#endif

    c->codesize = pd(op, out);
    assert(c->textsize == in_len);

    *out_len = pd(op, out);

    if (c->cb && c->cb->nprogress)
        (*c->cb->nprogress)(c->cb, c->textsize, c->codesize, 0);

#if 0
    printf("%ld %ld -> %ld: %ld %ld %ld %ld %ld\n",
        (long) c->textsize, (long)in_len, (long) c->codesize,
        c->r1_r, c->m3_r, c->m2_m, c->m3_m, c->lazy);
#endif
    return LZO_E_OK;
}



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

LZO_PUBLIC(int)
lzo1b_999_compress  ( const lzo_bytep in , lzo_uint  in_len,
                            lzo_bytep out, lzo_uintp out_len,
                            lzo_voidp wrkmem )
{
    return lzo1b_999_compress_callback(in,in_len,out,out_len,wrkmem,
                                       (lzo_callback_p) 0, 0);
}


/* vim:set ts=4 sw=4 et: */

Coverage Report

Created: 2026-05-23 07:00

Line	Count	Source
1		/* lzo1b_9x.c -- implementation of the LZO1B-999 compression algorithm
2
3		This file is part of the LZO real-time data compression library.
4
5		Copyright (C) 1996-2017 Markus Franz Xaver Johannes Oberhumer
6		All Rights Reserved.
7
8		The LZO library is free software; you can redistribute it and/or
9		modify it under the terms of the GNU General Public License as
10		published by the Free Software Foundation; either version 2 of
11		the License, or (at your option) any later version.
12
13		The LZO library is distributed in the hope that it will be useful,
14		but WITHOUT ANY WARRANTY; without even the implied warranty of
15		MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16		GNU General Public License for more details.
17
18		You should have received a copy of the GNU General Public License
19		along with the LZO library; see the file COPYING.
20		If not, write to the Free Software Foundation, Inc.,
21		51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
22
23		Markus F.X.J. Oberhumer
24		<markus@oberhumer.com>
25		http://www.oberhumer.com/opensource/lzo/
26		*/
27
28
29		#include "config1b.h"
30
31
32		/***********************************************************************
33		//
34		************************************************************************/
35
36	670	#define SWD_N 0xffffL /* size of ring buffer */
37	4.28M	#define SWD_THRESHOLD 2 /* lower limit for match length */
38	670	#define SWD_F 2048 /* upper limit for match length */
39
40
41		#define LZO1B 1
42	1.34k	#define LZO_COMPRESS_T lzo1b_999_t
43	670	#define lzo_swd_t lzo1b_999_swd_t
44		#include "lzo_mchw.ch"
45
46
47
48		/***********************************************************************
49		//
50		************************************************************************/
51
52		static lzo_bytep
53		code_match ( LZO_COMPRESS_T *c, lzo_bytep op, lzo_uint m_len, lzo_uint m_off )
54	152k	{
55	152k	if (m_len <= M2_MAX_LEN && m_off <= M2_MAX_OFFSET)
56	96.4k	{
57	96.4k	assert(m_len >= M2_MIN_LEN);
58	96.4k	assert(m_off >= M2_MIN_OFFSET);
59
60	96.4k	m_off -= M2_MIN_OFFSET;
61		/* code match len + low offset bits */
62	96.4k	*op++ = LZO_BYTE(((m_len - (M2_MIN_LEN - 2)) << M2O_BITS) \|
63	96.4k	(m_off & M2O_MASK));
64		/* code high offset bits */
65	96.4k	*op++ = LZO_BYTE(m_off >> M2O_BITS);
66	96.4k	c->m2_m++;
67	96.4k	}
68	56.0k	else
69	56.0k	{
70	56.0k	assert(m_len >= M3_MIN_LEN);
71	56.0k	assert(m_off <= M3_MAX_OFFSET);
72
73	56.0k	m_off -= M3_MIN_OFFSET - M3_EOF_OFFSET;
74		/* code match len */
75	56.0k	if (m_len <= M3_MAX_LEN)
76	38.8k	*op++ = LZO_BYTE(M3_MARKER \| (m_len - (M3_MIN_LEN - 1)));
77	17.2k	else
78	17.2k	{
79	17.2k	assert(m_len >= M4_MIN_LEN);
80		/* code M4 match len flag */
81	17.2k	*op++ = M4_MARKER;
82		/* code match len */
83	17.2k	m_len -= M4_MIN_LEN - 1;
84	36.8k	while (m_len > 255)
85	19.6k	{
86	19.6k	m_len -= 255;
87	19.6k	*op++ = 0;
88	19.6k	}
89	17.2k	assert(m_len > 0);
90	17.2k	*op++ = LZO_BYTE(m_len);
91	17.2k	}
92		/* code low offset bits */
93	56.0k	*op++ = LZO_BYTE(m_off & M3O_MASK);
94		/* code high offset bits */
95	56.0k	*op++ = LZO_BYTE(m_off >> M3O_BITS);
96
97	56.0k	c->r1_m_len = 0;
98	56.0k	c->m3_m++;
99	56.0k	}
100	152k	return op;
101	152k	}
102
103
104		/***********************************************************************
105		// this is a public function, but there is no prototype in a header file
106		************************************************************************/
107
108		LZO_EXTERN(int)
109		lzo1b_999_compress_callback ( const lzo_bytep in , lzo_uint in_len,
110		lzo_bytep out, lzo_uintp out_len,
111		lzo_voidp wrkmem,
112		lzo_callback_p cb,
113		lzo_uint max_chain );
114
115		LZO_PUBLIC(int)
116		lzo1b_999_compress_callback ( const lzo_bytep in , lzo_uint in_len,
117		lzo_bytep out, lzo_uintp out_len,
118		lzo_voidp wrkmem,
119		lzo_callback_p cb,
120		lzo_uint max_chain )
121	670	{
122	670	lzo_bytep op;
123	670	const lzo_bytep ii;
124	670	lzo_uint lit;
125	670	lzo_uint m_len, m_off;
126	670	LZO_COMPRESS_T cc;
127	670	LZO_COMPRESS_T * const c = &cc;
128	670	lzo_swd_p const swd = (lzo_swd_p) wrkmem;
129	670	int r;
130
131		/* sanity check */
132	670	LZO_COMPILE_TIME_ASSERT(LZO1B_999_MEM_COMPRESS >= SIZEOF_LZO_SWD_T)
133
134	670	c->init = 0;
135	670	c->ip = c->in = in;
136	670	c->in_end = in + in_len;
137	670	c->cb = cb;
138	670	c->r1_r = c->m3_r = c->m2_m = c->m3_m = 0;
139
140	670	op = out;
141	670	ii = c->ip; /* point to start of literal run */
142	670	lit = 0;
143	670	c->r1_m_len = 0;
144
145	670	r = init_match(c,swd,NULL,0,0);
146	670	if (r != 0)
147	0	return r;
148	670	if (max_chain > 0)
149	0	swd->max_chain = max_chain;
150
151	670	r = find_match(c,swd,0,0);
152	670	if (r != 0)
153	0	return r;
154	4.21M	while (c->look > 0)
155	4.21M	{
156	4.21M	int lazy_match_min_gain = -1;
157	4.21M	lzo_uint ahead = 0;
158
159	4.21M	m_len = c->m_len;
160	4.21M	m_off = c->m_off;
161
162		#if 0
163		printf("%5ld: %5d len:%3d off:%5d\n", (c->ip-c->look)-in, c->look,
164		m_len, m_off);
165		#endif
166
167	4.21M	assert(c->ip - c->look >= in);
168	4.21M	if (lit == 0)
169	152k	ii = c->ip - c->look;
170	4.21M	assert(ii + lit == c->ip - c->look);
171	4.21M	assert(swd->b_char == *(c->ip - c->look));
172
173	4.21M	if ((m_len < M2_MIN_LEN) \|\|
174	185k	(m_len < M3_MIN_LEN && m_off > M2_MAX_OFFSET))
175	4.04M	{
176	4.04M	m_len = 0;
177	4.04M	}
178	163k	else
179	163k	{
180	163k	assert(c->ip - c->look - m_off >= in);
181	163k	assert(c->ip - c->look - m_off + m_len < c->ip);
182	163k	assert(lzo_memcmp(c->ip - c->look, c->ip - c->look - m_off,
183	163k	m_len) == 0);
184
185	163k	if (lit > 0)
186	91.8k	{
187		/* we have a current literal run: do not try a lazy match,
188		if the literal could be coded into a r1 match */
189	91.8k	if (lit == 1 && c->r1_m_len == M2_MIN_LEN)
190	12.9k	lazy_match_min_gain = -1;
191	78.8k	else
192	78.8k	lazy_match_min_gain = 1;
193
194		#if (M2_MIN_LEN == 2)
195		if (m_len == 2)
196		{
197		/* don't code a match of len 2 if we have to
198		code a literal run. Code a literal instead. */
199		m_len = 0;
200		}
201		#endif
202		#if (M2_MIN_LEN == M3_MIN_LEN)
203		if (m_len == M2_MIN_LEN && m_off > M2_MAX_OFFSET)
204		{
205		/* don't code a M3 match of len 3 if we have to
206		code a literal run. Code a literal instead. */
207		m_len = 0;
208		}
209		#endif
210	91.8k	}
211	72.0k	else
212	72.0k	{
213		/* no current literal run: only try a lazy match,
214		if the literal could be coded into a r1 match */
215	72.0k	if (c->r1_m_len == M2_MIN_LEN)
216	8.41k	lazy_match_min_gain = 0;
217	63.6k	else
218	63.6k	lazy_match_min_gain = -1;
219	72.0k	}
220	163k	}
221
222
223		/* try a lazy match */
224	4.21M	if (m_len == 0)
225	4.04M	lazy_match_min_gain = -1;
226	4.21M	if (lazy_match_min_gain >= 0 && c->look > m_len)
227	87.1k	{
228	87.1k	assert(m_len > 0);
229
230	87.1k	r = find_match(c,swd,1,0);
231	87.1k	assert(r == 0); LZO_UNUSED(r);
232	87.1k	assert(c->look > 0);
233
234	87.1k	if (m_len <= M2_MAX_LEN && m_off <= M2_MAX_OFFSET &&
235	59.5k	c->m_off > M2_MAX_OFFSET)
236	3.56k	lazy_match_min_gain += 1;
237
238	87.1k	if (c->m_len >= m_len + lazy_match_min_gain)
239	11.3k	{
240	11.3k	c->lazy++;
241		#if !defined(NDEBUG)
242		m_len = c->m_len;
243		m_off = c->m_off;
244		assert(lzo_memcmp(c->ip - c->look, c->ip - c->look - m_off,
245		m_len) == 0);
246		#endif
247	11.3k	lit++;
248	11.3k	assert(ii + lit == c->ip - c->look);
249	11.3k	continue;
250	11.3k	}
251	75.7k	else
252	75.7k	{
253	75.7k	ahead = 1;
254	75.7k	assert(ii + lit + 1 == c->ip - c->look);
255	75.7k	}
256	87.1k	assert(m_len > 0);
257	75.7k	}
258	4.21M	assert(ii + lit + ahead == c->ip - c->look);
259
260
261	4.20M	if (m_len == 0)
262	4.04M	{
263		/* a literal */
264	4.04M	lit++;
265	4.04M	r = find_match(c,swd,1,0);
266	4.04M	assert(r == 0); LZO_UNUSED(r);
267	4.04M	}
268	152k	else
269	152k	{
270		/* 1 - store run */
271	152k	if (lit > 0)
272	83.7k	{
273		/* code current literal run */
274	83.7k	if (lit == 1 && c->r1_m_len == M2_MIN_LEN)
275	12.9k	{
276		/* Code a context sensitive R1 match. */
277	12.9k	assert((op[-2] >> M2O_BITS) == (M2_MARKER >> M2O_BITS));
278	12.9k	op[-2] &= M2O_MASK;
279	12.9k	assert((op[-2] >> M2O_BITS) == 0);
280		/* copy 1 literal */
281	12.9k	op++ = ii++;
282	12.9k	assert(ii + ahead == c->ip - c->look);
283	12.9k	c->r1_r++;
284	12.9k	}
285	70.8k	else
286	70.8k	{
287	70.8k	op = STORE_RUN(op,ii,lit);
288	70.8k	}
289	83.7k	if (lit < R0FAST)
290	80.7k	c->r1_m_len = m_len;
291	2.98k	else
292	2.98k	c->r1_m_len = 0;
293	83.7k	lit = 0;
294	83.7k	}
295	68.7k	else
296	68.7k	c->r1_m_len = 0;
297
298		/* 2 - code match */
299	152k	op = code_match(c,op,m_len,m_off);
300	152k	r = find_match(c,swd,m_len,1+ahead);
301	152k	assert(r == 0); LZO_UNUSED(r);
302	152k	}
303
304	4.20M	c->codesize = pd(op, out);
305	4.20M	}
306
307
308		/* store final run */
309	670	if (lit > 0)
310	408	op = STORE_RUN(op,ii,lit);
311
312	670	#if defined(LZO_EOF_CODE)
313	670	*op++ = M3_MARKER \| 1;
314	670	*op++ = 0;
315	670	*op++ = 0;
316	670	#endif
317
318	670	c->codesize = pd(op, out);
319	670	assert(c->textsize == in_len);
320
321	670	*out_len = pd(op, out);
322
323	670	if (c->cb && c->cb->nprogress)
324	0	(*c->cb->nprogress)(c->cb, c->textsize, c->codesize, 0);
325
326		#if 0
327		printf("%ld %ld -> %ld: %ld %ld %ld %ld %ld\n",
328		(long) c->textsize, (long)in_len, (long) c->codesize,
329		c->r1_r, c->m3_r, c->m2_m, c->m3_m, c->lazy);
330		#endif
331	670	return LZO_E_OK;
332	670	}
333
334
335
336		/***********************************************************************
337		//
338		************************************************************************/
339
340		LZO_PUBLIC(int)
341		lzo1b_999_compress ( const lzo_bytep in , lzo_uint in_len,
342		lzo_bytep out, lzo_uintp out_len,
343		lzo_voidp wrkmem )
344	670	{
345	670	return lzo1b_999_compress_callback(in,in_len,out,out_len,wrkmem,
346	670	(lzo_callback_p) 0, 0);
347	670	}
348
349
350		/* vim:set ts=4 sw=4 et: */