lzoruby 0.1.2 → 0.1.3

data/ext/lzo1b_rr.c

@@ -1,43 +0,0 @@
-/* lzo1b_rr.c -- literal run handling
-
-   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 "config1b.h"
-
-#include "lzo1b_r.ch"

data/ext/lzo1b_sm.ch

@@ -1,210 +0,0 @@
-/* lzo1b_sm.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.
- */
-
-
-
-/***********************************************************************
-// search for a match
-************************************************************************/
-
-#if (DD_BITS == 0)
-
-        /* search ip in the dictionary */
-        DINDEX1(dindex,ip);
-        GINDEX(m_pos,m_off,dict,dindex,in);
-        if (LZO_CHECK_MPOS_NON_DET(m_pos,m_off,in,ip,M3_MAX_OFFSET))
-            goto literal;
-#if 1
-        if (m_off <= M2_MAX_OFFSET || m_pos[3] == ip[3])
-            goto try_match;
-        DINDEX2(dindex,ip);
-#endif
-        GINDEX(m_pos,m_off,dict,dindex,in);
-        if (LZO_CHECK_MPOS_NON_DET(m_pos,m_off,in,ip,M3_MAX_OFFSET))
-            goto literal;
-        if (m_off <= M2_MAX_OFFSET || m_pos[3] == ip[3])
-            goto try_match;
-        goto literal;
-
-
-#else /* (DD_BITS == 0) */
-
-
-
-        /* search ip in the deepened dictionary */
-        {
-            lzo_dict_p d = &dict [ DINDEX(dv,ip) ];
-            const lzo_bytep ip_sav;
-            unsigned j = DD_SIZE;
-            lzo_uint x_len;
-            lzo_uint x_off;
-
-            DVAL_ASSERT(dv,ip);
-
-            ip_sav = ip;
-            m_len = 0;
-            do {
-#if !defined(NDEBUG)
-                const lzo_bytep z_pos = NULL;
-#endif
-#if defined(LZO_DICT_USE_PTR)
-                m_pos = *d;
-                assert((z_pos = m_pos) == *d);
-#if defined(LZO_DETERMINISTIC)
-                assert(m_pos == NULL || m_pos >= in);
-                assert(m_pos == NULL || m_pos < ip);
-#endif
-#else
-                x_off = *d;
-#endif
-                assert(ip == ip_sav);
-
-                if (LZO_CHECK_MPOS(m_pos,x_off,in,ip,MAX_OFFSET))
-#if (CLEVEL == 9)
-                    *d = DENTRY(ip,in);
-#else
-                    ((void)(0));
-#endif
-                else if (m_pos[m_len] != ip[m_len])
-                    ((void)(0));
-                else if (*m_pos++ == *ip++ && *m_pos++ == *ip++ && *m_pos++ == *ip++)
-                {
-#if !defined(LZO_DICT_USE_PTR)
-                    assert((z_pos = ip - 3 - x_off) == (m_pos - 3));
-#endif
-                    /* a match */
-                    if (MATCH_M2)
-                    {
-                        x_len = pd((ip - 1), ip_sav);
-                        if (x_len > m_len)
-                        {
-                            m_len = x_len;
-                            m_off = x_off;
-                            assert((m_pos_sav = z_pos) != NULL);
-                        }
-#if (CLEVEL == 9)
-                        /* try to find a closer match */
-                        else if (x_len == m_len && x_off < m_off)
-                        {
-                            m_off = x_off;
-                            assert((m_pos_sav = z_pos) != NULL);
-                        }
-#endif
-                    }
-                    else
-                    {
-                        assert((ip - ip_sav) == M2_MAX_LEN + 1);
-#if (CLEVEL == 9)
-#if defined(MATCH_IP_END)
-                        {
-                            const lzo_bytep end;
-                            end = MATCH_IP_END;
-                            while (ip < end  &&  *m_pos == *ip)
-                                m_pos++, ip++;
-                            assert(ip <= in_end);
-                            x_len = pd(ip, ip_sav);
-                        }
-                        if (x_len > m_len)
-                        {
-                            m_len = x_len;
-                            m_off = x_off;
-                            assert((m_pos_sav = z_pos) != NULL);
-                            if (ip >= MATCH_IP_END)
-                            {
-                                ip = ip_sav;
-#if 0
-                                /* not needed - we are at the end */
-                                d -= DD_SIZE - j;
-                                assert(d == &dict [ DINDEX(dv,ip) ]);
-                                UPDATE_P(d,drun,ip,in);
-#endif
-                                goto match;
-                            }
-                        }
-                        else if (x_len == m_len && x_off < m_off)
-                        {
-                            m_off = x_off;
-                            assert((m_pos_sav = z_pos) != NULL);
-                        }
-#else
-                        /* try to find a closer match */
-                        if (m_len < M2_MAX_LEN + 1 || x_off < m_off)
-                        {
-                            m_len = M2_MAX_LEN + 1;
-                            m_off = x_off;
-                            assert((m_pos_sav = z_pos) != NULL);
-                        }
-#endif
-#else
-                        /* don't search for a longer/closer match */
-                        m_len = M2_MAX_LEN + 1;
-                        m_off = x_off;
-                        assert((m_pos_sav = z_pos) != NULL);
-                        ip = ip_sav;
-                        d -= DD_SIZE - j;
-                        assert(d == &dict [ DINDEX(dv,ip) ]);
-                        UPDATE_P(d,drun,ip,in);
-                        goto match;
-#endif
-                    }
-                    ip = ip_sav;
-                }
-                else
-                    ip = ip_sav;
-                d++;
-            } while (--j > 0);
-            assert(ip == ip_sav);
-
-            d -= DD_SIZE;
-            assert(d == &dict [ DINDEX(dv,ip) ]);
-            UPDATE_P(d,drun,ip,in);
-        }
-
-#endif /* (DD_BITS == 0) */
-
-
-/*
-vi:ts=4:et
-*/

data/ext/lzo1b_tm.ch

@@ -1,99 +0,0 @@
-/* lzo1b_tm.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.
- */
-
-
-
-/***********************************************************************
-// test for a potential match
-************************************************************************/
-
-
-#if (DD_BITS == 0)
-
-try_match:
-#if !defined(NDEBUG) && defined(LZO_DICT_USE_PTR)
-#if defined(LZO_DETERMINISTIC)
-        assert(m_pos == NULL || m_pos >= in);
-        assert(m_pos == NULL || m_pos < ip);
-#endif
-        m_pos_sav = m_pos;
-#endif
-        if (m_pos[0] == ip[0] && m_pos[1] == ip[1] && m_pos[2] == ip[2])
-        {
-            m_pos += 3;
-            goto match;
-        }
-
-
-#else /* (DD_BITS == 0) */
-
-
-    /* test potential match */
-
-        if (m_len > M2_MIN_LEN)
-            goto match;
-        if (m_len == M2_MIN_LEN)
-        {
-#if (_MAX_OFFSET == _M2_MAX_OFFSET)
-            goto match;
-#else
-            if (m_off <= M2_MAX_OFFSET)
-                goto match;
-#if 0 && (M3_MIN_LEN == M2_MIN_LEN)
-            if (ip == ii)
-                goto match;
-#endif
-#endif
-        }
-        goto literal;
-
-
-#endif /* (DD_BITS == 0) */
-
-
-
-/*
-vi:ts=4:et
-*/

data/ext/lzo1b_xx.c

@@ -1,98 +0,0 @@
-/* lzo1b_xx.c -- LZO1B compression public 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/
- */
-
-
-#include "config1b.h"
-
-
-/***********************************************************************
-//
-************************************************************************/
-
-static const lzo_compress_t * const c_funcs [9] =
-{
-    &_lzo1b_1_compress_func,
-    &_lzo1b_2_compress_func,
-    &_lzo1b_3_compress_func,
-    &_lzo1b_4_compress_func,
-    &_lzo1b_5_compress_func,
-    &_lzo1b_6_compress_func,
-    &_lzo1b_7_compress_func,
-    &_lzo1b_8_compress_func,
-    &_lzo1b_9_compress_func
-};
-
-
-lzo_compress_t _lzo1b_get_compress_func(int clevel)
-{
-    const lzo_compress_t *f;
-
-    if (clevel < LZO1B_BEST_SPEED || clevel > LZO1B_BEST_COMPRESSION)
-    {
-        if (clevel == LZO1B_DEFAULT_COMPRESSION)
-            clevel = LZO1B_BEST_SPEED;
-        else
-            return 0;
-    }
-    f = c_funcs[clevel-1];
-    assert(f && *f);
-    return *f;
-}
-
-
-LZO_PUBLIC(int)
-lzo1b_compress ( const lzo_bytep src, lzo_uint  src_len,
-                       lzo_bytep dst, lzo_uintp dst_len,
-                       lzo_voidp wrkmem,
-                       int clevel )
-{
-    lzo_compress_t f;
-
-    f = _lzo1b_get_compress_func(clevel);
-    if (!f)
-        return LZO_E_ERROR;
-    return _lzo1b_do_compress(src,src_len,dst,dst_len,wrkmem,f);
-}
-
-
-
-/*
-vi:ts=4:et
-*/
-