lzoruby 0.1.0

data/ext/lzo1b_cc.c

@@ -0,0 +1,167 @@
+/* lzo1b_cc.c -- LZO1B compression internal entry point
+
+   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/
+ */
+
+
+#define LZO_NEED_DICT_H
+#include "config1b.h"
+
+
+/***********************************************************************
+// compression internal entry point.
+************************************************************************/
+
+int _lzo1b_do_compress   ( const lzo_bytep in,  lzo_uint  in_len,
+                                 lzo_bytep out, lzo_uintp out_len,
+                                 lzo_voidp wrkmem,
+                                 lzo_compress_t func )
+{
+    int r;
+#if defined(LZO_TEST_COMPRESS_OVERRUN)
+    lzo_uint avail_out = *out_len;
+#endif
+
+
+#if defined(LZO_COLLECT_STATS)
+    _lzo1b_stats_init(lzo_stats);
+    lzo_stats->in_len = in_len;
+#endif
+
+
+    /* don't try to compress a block that's too short */
+    if (in_len <= 0)
+    {
+        *out_len = 0;
+        r = LZO_E_OK;
+    }
+    else if (in_len <= MIN_LOOKAHEAD + 1)
+    {
+#if defined(LZO_RETURN_IF_NOT_COMPRESSIBLE)
+        *out_len = 0;
+        r = LZO_E_NOT_COMPRESSIBLE;
+#else
+        *out_len = pd(STORE_RUN(out,in,in_len), out);
+        r = (*out_len > in_len) ? LZO_E_OK : LZO_E_ERROR;
+#endif
+    }
+    else
+        r = func(in,in_len,out,out_len,wrkmem);
+
+
+#if defined(LZO_EOF_CODE)
+#if defined(LZO_TEST_COMPRESS_OVERRUN)
+    if (r == LZO_E_OK && avail_out - *out_len < 3)
+        r = LZO_E_COMPRESS_OVERRUN;
+#endif
+    if (r == LZO_E_OK)
+    {
+        lzo_bytep op = out + *out_len;
+        *op++ = M3_MARKER | 1;
+        *op++ = 0;
+        *op++ = 0;
+        *out_len += 3;
+    }
+#endif
+
+
+#if defined(LZO_COLLECT_STATS)
+    lzo_stats->out_len = *out_len;
+    lzo_stats->match_bytes =
+       1 * lzo_stats->m1_matches + 2 * lzo_stats->m2_matches +
+       3 * lzo_stats->m3_matches + 4 * lzo_stats->m4_matches;
+    _lzo1b_stats_calc(lzo_stats);
+#endif
+
+    return r;
+}
+
+
+/***********************************************************************
+// note: this is not thread safe, but as it is used for finetuning only
+//       we don't care
+************************************************************************/
+
+#undef lzo_stats
+/* lzo_stats_t is still defined */
+
+
+#if defined(LZO_COLLECT_STATS)
+
+static lzo_stats_t lzo_statistics;
+lzo_stats_t * const lzo1b_stats = &lzo_statistics;
+
+
+void _lzo1b_stats_init(lzo_stats_t *lzo_stats)
+{
+    lzo_memset(lzo_stats,0,sizeof(*lzo_stats));
+}
+
+
+void _lzo1b_stats_calc(lzo_stats_t *lzo_stats)
+{
+    lzo_stats->matches =
+       lzo_stats->m1_matches + lzo_stats->m2_matches +
+       lzo_stats->m3_matches + lzo_stats->m4_matches;
+
+    lzo_stats->literal_overhead = lzo_stats->lit_runs +
+       2 * (lzo_stats->r0short_runs + lzo_stats->r0fast_runs +
+            lzo_stats->r0long_runs);
+    lzo_stats->literal_bytes = lzo_stats->literals +
+       lzo_stats->literal_overhead;
+
+#if 0
+    assert(lzo_stats->match_bytes + lzo_stats->literal_bytes ==
+       lzo_stats->out_len);
+#endif
+
+    lzo_stats->m2_matches -= lzo_stats->r1_matches;
+    lzo_stats->m2_match[M2_MIN_LEN] -= lzo_stats->r1_matches;
+
+    if (lzo_stats->literals > 0)
+        lzo_stats->literal_overhead_percent =
+           100.0 * lzo_stats->literal_overhead / lzo_stats->literals;
+}
+
+
+#endif
+
+
+/*
+vi:ts=4:et
+*/
+

data/ext/lzo1b_cc.h

@@ -0,0 +1,93 @@
+/* lzo1b_cc.h -- definitions for the the LZO1B compression driver
+
+   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/
+ */
+
+
+/* WARNING: this file should *not* be used by applications. It is
+   part of the implementation of the library and is subject
+   to change.
+ */
+
+
+#ifndef __LZO1B_CC_H
+#define __LZO1B_CC_H
+
+
+/***********************************************************************
+//
+************************************************************************/
+
+extern const lzo_compress_t _lzo1b_1_compress_func;
+extern const lzo_compress_t _lzo1b_2_compress_func;
+extern const lzo_compress_t _lzo1b_3_compress_func;
+extern const lzo_compress_t _lzo1b_4_compress_func;
+extern const lzo_compress_t _lzo1b_5_compress_func;
+extern const lzo_compress_t _lzo1b_6_compress_func;
+extern const lzo_compress_t _lzo1b_7_compress_func;
+extern const lzo_compress_t _lzo1b_8_compress_func;
+extern const lzo_compress_t _lzo1b_9_compress_func;
+
+extern const lzo_compress_t _lzo1b_99_compress_func;
+
+
+/***********************************************************************
+//
+************************************************************************/
+
+LZO_EXTERN(lzo_bytep )
+_lzo1b_store_run ( lzo_bytep const oo, const lzo_bytep const ii,
+                   lzo_uint r_len);
+
+#define STORE_RUN   _lzo1b_store_run
+
+
+lzo_compress_t _lzo1b_get_compress_func(int clevel);
+
+int _lzo1b_do_compress   ( const lzo_bytep in,  lzo_uint  in_len,
+                                 lzo_bytep out, lzo_uintp out_len,
+                                 lzo_voidp wrkmem,
+                                 lzo_compress_t func );
+
+
+#endif /* already included */
+
+/*
+vi:ts=4:et
+*/
+
+

data/ext/lzo1b_cm.ch

@@ -0,0 +1,294 @@
+/* lzo1b_cm.ch -- implementation of the LZO1B compression algorithm
+
+   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/
+ */
+
+
+/* WARNING: this file should *not* be used by applications. It is
+   part of the implementation of the library and is subject
+   to change.
+ */
+
+
+
+/***********************************************************************
+// code the match
+************************************************************************/
+
+#if (DD_BITS == 0)
+
+        /* we already matched M2_MIN_LEN bytes,
+         * m_pos also already advanced M2_MIN_LEN bytes */
+        ip += M2_MIN_LEN;
+        assert(m_pos < ip);
+
+        /* try to match another M2_MAX_LEN + 1 - M2_MIN_LEN bytes
+         * to see if we get more than a M2 match */
+#define M2_OR_M3    (MATCH_M2)
+
+#else /* (DD_BITS == 0) */
+
+        /* we already matched m_len bytes */
+        assert(m_len >= M2_MIN_LEN);
+        ip += m_len;
+        assert(ip <= in_end);
+
+#define M2_OR_M3    (m_len <= M2_MAX_LEN)
+
+#endif /* (DD_BITS == 0) */
+
+
+
+        if (M2_OR_M3)
+        {
+        /* we've found a M2 or M3 match */
+            assert(ip <= in_end);
+
+        /* 2a) compute match parameters */
+#if (DD_BITS == 0)
+            assert(pd(ip,m_pos) == m_off);
+            --ip;   /* ran one too far, point back to non-match */
+            m_len = pd(ip, ii);
+#endif
+
+        /* 2a2) verify match parameters */
+            assert(m_len >= M2_MIN_LEN);
+            assert(m_len <= M2_MAX_LEN);
+            assert(m_len <= M3_MAX_LEN);
+
+            assert(m_off >= M2_MIN_OFFSET);
+            assert(m_off >= M3_MIN_OFFSET);
+            assert(m_off <= M3_MAX_OFFSET);
+            assert(ii-m_off == m_pos_sav);
+            assert(lzo_memcmp(m_pos_sav,ii,m_len) == 0);
+
+        /* 2b) code the match */
+#if (_M2_MAX_OFFSET != _M3_MAX_OFFSET)
+            if (m_off <= M2_MAX_OFFSET)
+            {
+#else
+                assert(m_off <= M2_MAX_OFFSET);
+#endif
+                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);
+                LZO_STATS(lzo_stats->m2_matches++);
+                LZO_STATS(lzo_stats->m2_match[m_len]++);
+#if (_M2_MAX_OFFSET != _M3_MAX_OFFSET)
+            }
+            else
+            {
+#if defined(LZO_HAVE_R1)
+#if (M3_MIN_LEN == M2_MIN_LEN)
+                r1 = ip_end;    /* invalidate R1 pointer */
+#endif
+#endif
+                assert(m_len >= M3_MIN_LEN);
+                m_off -= M3_MIN_OFFSET - M3_EOF_OFFSET;
+                /* code match len */
+                *op++ = LZO_BYTE(M3_MARKER | (m_len - (M3_MIN_LEN - 1)));
+                /* code low offset bits */
+                *op++ = LZO_BYTE(m_off & M3O_MASK);
+                /* code high offset bits */
+                *op++ = LZO_BYTE(m_off >> M3O_BITS);
+                LZO_STATS(lzo_stats->m3_matches++);
+                LZO_STATS(lzo_stats->m3_match[m_len]++);
+#if defined(LZO_HAVE_M3)
+                m3 = op;        /* set M3 pointer */
+#endif
+            }
+#endif /* (_M2_MAX_OFFSET != _M3_MAX_OFFSET) */
+
+
+            if (ip >= ip_end)
+            {
+                ii = ip;
+                break;
+            }
+
+
+        /* 2c) Insert phrases (beginning with ii+1) into the dictionary. */
+
+#if (CLEVEL == 9) || (CLEVEL >= 7 && M2L_BITS <= 4) || (CLEVEL >= 5 && M2L_BITS <= 3)
+        /* Insert the whole match (ii+1)..(ip-1) into dictionary.  */
+            ++ii;
+            do {
+                DVAL_NEXT(dv,ii);
+#if 0
+                UPDATE_D(dict,drun,dv,ii,in);
+#else
+                dict[ DINDEX(dv,ii) ] = DENTRY(ii,in);
+#endif
+                MI
+            } while (++ii < ip);
+            DVAL_NEXT(dv,ii);
+            assert(ii == ip);
+            DVAL_ASSERT(dv,ip);
+#elif (CLEVEL >= 3)
+            SI   DI DI   XI
+#elif (CLEVEL >= 2)
+            SI   DI      XI
+#else
+                         XI
+#endif
+        }
+
+        else
+
+        {
+        /* we've found a M3 or M4 match - see how far we can still go */
+            assert(ip <= in_end);
+            assert(lzo_memcmp(m_pos_sav,ii,(lzo_uint)(ip-ii)) == 0);
+
+        /* 2a) compute match parameters */
+#if !defined(MATCH_IP_END)
+            assert(ii == ip - (M2_MAX_LEN + 1));
+#if (DD_BITS > 0)
+            assert(m_len == (lzo_uint)(ip-ii));
+            m_pos = ip - m_off;
+            assert(m_pos == m_pos_sav + m_len);
+#endif
+            {
+                const lzo_bytep end;
+                end = in_end;
+                while (ip < end  &&  *m_pos == *ip)
+                    m_pos++, ip++;
+                assert(ip <= in_end);
+                m_len = pd(ip, ii);
+            }
+            assert(pd(ip,m_pos) == m_off);
+#endif
+
+        /* 2a2) verify match parameters */
+            assert(m_len >= M3_MIN_LEN);
+
+            assert(m_off >= M3_MIN_OFFSET);
+            assert(m_off >= M4_MIN_OFFSET);
+            assert(m_off <= M3_MAX_OFFSET);
+            assert(m_off <= M4_MAX_OFFSET);
+            assert(ii-m_off == m_pos_sav);
+            assert(lzo_memcmp(m_pos_sav,ii,m_len) == 0);
+
+        /* 2b) code the match */
+            if (m_len <= M3_MAX_LEN)
+            {
+                /* code match len */
+                *op++ = LZO_BYTE(M3_MARKER | (m_len - (M3_MIN_LEN - 1)));
+                LZO_STATS(lzo_stats->m3_matches++);
+                LZO_STATS(lzo_stats->m3_match[m_len]++);
+            }
+            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);
+                LZO_STATS(lzo_stats->m4_matches++);
+            }
+
+            m_off -= M3_MIN_OFFSET - M3_EOF_OFFSET;
+            /* code low offset bits */
+            *op++ = LZO_BYTE(m_off & M3O_MASK);
+            /* code high offset bits */
+            *op++ = LZO_BYTE(m_off >> M3O_BITS);
+
+#if defined(LZO_HAVE_M3)
+            m3 = op;        /* set M3 pointer */
+#endif
+
+
+            if (ip >= ip_end)
+            {
+                ii = ip;
+                break;
+            }
+
+
+        /* 2c) Insert phrases (beginning with ii+1) into the dictionary. */
+#if (CLEVEL == 9)
+        /* Insert the whole match (ii+1)..(ip-1) into dictionary.  */
+        /* This is not recommended because it can be slow. */
+            ++ii;
+            do {
+                DVAL_NEXT(dv,ii);
+#if 0
+                UPDATE_D(dict,drun,dv,ii,in);
+#else
+                dict[ DINDEX(dv,ii) ] = DENTRY(ii,in);
+#endif
+                MI
+            } while (++ii < ip);
+            DVAL_NEXT(dv,ii);
+            assert(ii == ip);
+            DVAL_ASSERT(dv,ip);
+#elif (CLEVEL >= 8)
+            SI   DI DI DI DI DI DI DI DI   XI
+#elif (CLEVEL >= 7)
+            SI   DI DI DI DI DI DI DI      XI
+#elif (CLEVEL >= 6)
+            SI   DI DI DI DI DI DI         XI
+#elif (CLEVEL >= 5)
+            SI   DI DI DI DI               XI
+#elif (CLEVEL >= 4)
+            SI   DI DI DI                  XI
+#elif (CLEVEL >= 3)
+            SI   DI DI                     XI
+#elif (CLEVEL >= 2)
+            SI   DI                        XI
+#else
+                                           XI
+#endif
+        }
+
+        /* ii now points to the start of the next literal run */
+        assert(ii == ip);
+
+
+/*
+vi:ts=4:et
+*/

data/ext/lzo1b_cr.ch

@@ -0,0 +1,126 @@
+/* lzo1b_cr.ch -- implementation of the LZO1B compression algorithm
+
+   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/
+ */
+
+
+/* WARNING: this file should *not* be used by applications. It is
+   part of the implementation of the library and is subject
+   to change.
+ */
+
+
+
+/***********************************************************************
+// store the current literal run
+************************************************************************/
+
+        assert(ip < ip_end);
+        if (pd(ip,ii) > 0)
+        {
+            lzo_uint t = pd(ip,ii);
+
+#if defined(LZO_HAVE_R1)
+            if (ip == r1)
+            {
+                /* Code a context sensitive R1 match. */
+                LZO_STATS(lzo_stats->literals += t);
+                LZO_STATS(lzo_stats->r1_matches++);
+                assert(t == 1);
+                /* modify marker byte */
+                assert((op[-2] >> M2O_BITS) == (M2_MARKER >> M2O_BITS));
+                op[-2] &= M2O_MASK;
+                assert((op[-2] >> M2O_BITS) == 0);
+                /* copy 1 literal */
+                *op++ = *ii++;
+                r1 = ip + (M2_MIN_LEN + 1);     /* set new R1 pointer */
+            }
+            else
+#endif
+            if (t < R0MIN)
+            {
+                /* inline the copying of a short run */
+                LZO_STATS(lzo_stats->literals += t);
+                LZO_STATS(lzo_stats->lit_runs++);
+                LZO_STATS(lzo_stats->lit_run[t]++);
+#if defined(LZO_HAVE_M3)
+                if (t < LZO_SIZE(8-M3O_BITS) && op == m3)
+                {
+                /* Code a very short literal run into the low offset bits
+                 * of the previous M3/M4 match.
+                 */
+                    LZO_STATS(lzo_stats->lit_runs_after_m3_match++);
+                    LZO_STATS(lzo_stats->lit_run_after_m3_match[t]++);
+                    assert((m3[-2] >> M3O_BITS) == 0);
+                    m3[-2] |= LZO_BYTE(t << M3O_BITS);
+                }
+                else
+#endif
+                {
+                    *op++ = LZO_BYTE(t);
+                }
+                MEMCPY_DS(op, ii, t);
+#if defined(LZO_HAVE_R1)
+                r1 = ip + (M2_MIN_LEN + 1);     /* set new R1 pointer */
+#endif
+            }
+            else if (t < R0FAST)
+            {
+                /* inline the copying of a short R0 run */
+                LZO_STATS(lzo_stats->literals += t);
+                LZO_STATS(lzo_stats->r0short_runs++);
+                *op++ = 0; *op++ = LZO_BYTE(t - R0MIN);
+                MEMCPY_DS(op, ii, t);
+#if defined(LZO_HAVE_R1)
+                r1 = ip + (M2_MIN_LEN + 1);     /* set new R1 pointer */
+#endif
+            }
+            else
+            {
+                op = STORE_RUN(op,ii,t);
+                ii = ip;
+            }
+        }
+
+
+        /* ii now points to the start of the current match */
+        assert(ii == ip);
+
+
+/*
+vi:ts=4:et
+*/