lzoruby 0.1.2 → 0.1.3

data/ext/lzo1b_cm.ch

@@ -1,294 +0,0 @@
-/* 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

@@ -1,126 +0,0 @@
-/* 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
-*/

data/ext/lzo1b_d.ch

@@ -1,282 +0,0 @@
-/* lzo1b_d.ch -- implementation of the LZO1B decompression 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/
- */
-
-
-#include "lzo1_d.ch"
-
-
-/***********************************************************************
-// decompress a block of data.
-************************************************************************/
-
-LZO_PUBLIC(int)
-DO_DECOMPRESS    ( const lzo_bytep in , lzo_uint  in_len,
-                         lzo_bytep out, lzo_uintp out_len,
-                         lzo_voidp wrkmem )
-{
-    register lzo_bytep op;
-    register const lzo_bytep ip;
-    register lzo_uint t;
-    register const lzo_bytep m_pos;
-
-    const lzo_bytep const ip_end = in + in_len;
-#if defined(HAVE_ANY_OP)
-    lzo_bytep const op_end = out + *out_len;
-#endif
-
-    LZO_UNUSED(wrkmem);
-
-    op = out;
-    ip = in;
-
-    while (TEST_IP && TEST_OP)
-    {
-        t = *ip++;      /* get marker */
-
-        if (t < R0MIN)      /* a literal run */
-        {
-            if (t == 0)             /* a R0 literal run */
-            {
-                NEED_IP(1);
-                t = *ip++;
-                if (t >= R0FAST - R0MIN)            /* a long R0 run */
-                {
-                    t -= R0FAST - R0MIN;
-                    if (t == 0)
-                        t = R0FAST;
-                    else
-                    {
-#if 0
-                        t = 256u << ((unsigned) t);
-#else
-                        /* help the optimizer */
-                        lzo_uint tt = 256;
-                        do tt <<= 1; while (--t > 0);
-                        t = tt;
-#endif
-                    }
-
-                    NEED_IP(t); NEED_OP(t);
-#if 1 && defined(LZO_UNALIGNED_OK_4)
-                    do {
-                        * (lzo_uint32p) (op+0) = * (const lzo_uint32p) (ip+0);
-                        * (lzo_uint32p) (op+4) = * (const lzo_uint32p) (ip+4);
-                        op += 8; ip += 8;
-                        t -= 8;
-                    } while (t > 0);
-#else
-                    MEMCPY8_DS(op,ip,t);
-#endif
-                    continue;
-                }
-                t += R0MIN;                         /* a short R0 run */
-            }
-
-            NEED_IP(t); NEED_OP(t);
-            /* copy literal run */
-#if 1 && defined(LZO_UNALIGNED_OK_4)
-            if (t >= 4)
-            {
-                do {
-                    * (lzo_uint32p) op = * (const lzo_uint32p) ip;
-                    op += 4; ip += 4; t -= 4;
-                } while (t >= 4);
-                if (t > 0) do *op++ = *ip++; while (--t > 0);
-            }
-            else
-#endif
-            {
-#if (M3O_BITS < 7)
-literal1:
-#endif
-                do *op++ = *ip++; while (--t > 0);
-            }
-
-#if (M3O_BITS == 7)
-literal2:
-#endif
-
-            /* after a literal a match must follow */
-            while (TEST_IP && TEST_OP)
-            {
-                t = *ip++;          /* get R1 marker */
-                if (t >= R0MIN)
-                    goto match;
-
-                NEED_IP(2); NEED_OP(M2_MIN_LEN + 1);
-
-            /* R1 match - a M2_MIN_LEN match + 1 byte literal */
-                assert((t & M2O_MASK) == t);
-                m_pos = op - M2_MIN_OFFSET;
-                m_pos -= t | (((lzo_uint) *ip++) << M2O_BITS);
-                assert(m_pos >= out); assert(m_pos < op);
-                TEST_LB(m_pos);
-                COPY_M2;
-                *op++ = *ip++;
-            }
-
-#if defined(HAVE_TEST_IP) || defined(HAVE_TEST_OP)
-            break;
-#endif
-        }
-
-match:
-
-        if (t >= M2_MARKER)             /* a M2 match */
-        {
-            /* get match offset */
-            NEED_IP(1);
-            m_pos = op - M2_MIN_OFFSET;
-            m_pos -= (t & M2O_MASK) | (((lzo_uint) *ip++) << M2O_BITS);
-            assert(m_pos >= out); assert(m_pos < op);
-            TEST_LB(m_pos);
-
-            /* get match len */
-            t = (t >> M2O_BITS) - 1;
-            NEED_OP(t + M2_MIN_LEN - 1);
-            COPY_M2X;
-            MEMCPY_DS(op,m_pos,t);
-        }
-        else                            /* a M3 or M4 match */
-        {
-            /* get match len */
-            t &= M3L_MASK;
-            if (t == 0)         /* a M4 match */
-            {
-                NEED_IP(1);
-                while (*ip == 0)
-                {
-                    t += 255;
-                    ip++;
-                    NEED_IP(1);
-                }
-                t += (M4_MIN_LEN - M3_MIN_LEN) + *ip++;
-            }
-
-            /* get match offset */
-            NEED_IP(2);
-            m_pos = op - (M3_MIN_OFFSET - M3_EOF_OFFSET);
-            m_pos -= *ip++ & M3O_MASK;
-            m_pos -= (lzo_uint)(*ip++) << M3O_BITS;
-#if defined(LZO_EOF_CODE)
-            if (m_pos == op)
-                goto eof_found;
-#endif
-
-            /* copy match */
-            assert(m_pos >= out); assert(m_pos < op);
-            TEST_LB(m_pos); NEED_OP(t + M3_MIN_LEN - 1);
-#if defined(LZO_UNALIGNED_OK_4)
-            if (t >= 2 * 4 - (M3_MIN_LEN - 1) && (op - m_pos) >= 4)
-            {
-                * (lzo_uint32p) op = * (const lzo_uint32p) m_pos;
-                op += 4; m_pos += 4; t -= 4 - (M3_MIN_LEN - 1);
-                do {
-                    * (lzo_uint32p) op = * (const lzo_uint32p) m_pos;
-                    op += 4; m_pos += 4; t -= 4;
-                } while (t >= 4);
-                if (t > 0) do *op++ = *m_pos++; while (--t > 0);
-            }
-            else
-#endif
-            {
-            COPY_M3X;
-            MEMCPY_DS(op,m_pos,t);
-            }
-
-
-#if (M3O_BITS < 7)
-            t = ip[-2] >> M3O_BITS;
-            if (t)
-            {
-                NEED_IP(t); NEED_OP(t);
-                goto literal1;
-            }
-#elif (M3O_BITS == 7)
-            /* optimized version */
-            if (ip[-2] & (1 << M3O_BITS))
-            {
-                NEED_IP(1); NEED_OP(1);
-                *op++ = *ip++;
-                goto literal2;
-            }
-#endif
-        }
-    }
-
-
-#if defined(LZO_EOF_CODE)
-#if defined(HAVE_TEST_IP) || defined(HAVE_TEST_OP)
-    /* no EOF code was found */
-    *out_len = pd(op, out);
-    return LZO_E_EOF_NOT_FOUND;
-#endif
-
-eof_found:
-    assert(t == 1);
-#endif
-    *out_len = pd(op, out);
-    return (ip == ip_end ? LZO_E_OK :
-           (ip < ip_end  ? LZO_E_INPUT_NOT_CONSUMED : LZO_E_INPUT_OVERRUN));
-
-
-#if defined(HAVE_NEED_IP)
-input_overrun:
-    *out_len = pd(op, out);
-    return LZO_E_INPUT_OVERRUN;
-#endif
-
-#if defined(HAVE_NEED_OP)
-output_overrun:
-    *out_len = pd(op, out);
-    return LZO_E_OUTPUT_OVERRUN;
-#endif
-
-#if defined(LZO_TEST_OVERRUN_LOOKBEHIND)
-lookbehind_overrun:
-    *out_len = pd(op, out);
-    return LZO_E_LOOKBEHIND_OVERRUN;
-#endif
-}
-
-
-/*
-vi:ts=4:et
-*/
-