| Revision: | 1.1 |
| Committed: | Tue Feb 24 11:56:43 2009 UTC (16 years, 2 months ago) by loizides |
| Content type: | text/plain |
| 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 | /* lzo1x_d3.c -- LZO1X decompression with preset dictionary |
| 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 | #include "config1x.h" | ||
| 42 | |||
| 43 | #define LZO_TEST_OVERRUN | ||
| 44 | |||
| 45 | |||
| 46 | #define SLOW_MEMCPY(a,b,l) { do *a++ = *b++; while (--l > 0); } | ||
| 47 | #define FAST_MEMCPY(a,b,l) { lzo_memcpy(a,b,l); a += l; } | ||
| 48 | |||
| 49 | #if 1 && defined(FAST_MEMCPY) | ||
| 50 | # define DICT_MEMMOVE(op,m_pos,m_len,m_off) \ | ||
| 51 | if (m_off >= (m_len)) \ | ||
| 52 | FAST_MEMCPY(op,m_pos,m_len) \ | ||
| 53 | else \ | ||
| 54 | SLOW_MEMCPY(op,m_pos,m_len) | ||
| 55 | #else | ||
| 56 | # define DICT_MEMMOVE(op,m_pos,m_len,m_off) \ | ||
| 57 | SLOW_MEMCPY(op,m_pos,m_len) | ||
| 58 | #endif | ||
| 59 | |||
| 60 | #if !defined(FAST_MEMCPY) | ||
| 61 | # define FAST_MEMCPY SLOW_MEMCPY | ||
| 62 | #endif | ||
| 63 | |||
| 64 | |||
| 65 | #define COPY_DICT_DICT(m_len,m_off) \ | ||
| 66 | { \ | ||
| 67 | register const lzo_bytep m_pos; \ | ||
| 68 | m_off -= pd(op, out); assert(m_off > 0); \ | ||
| 69 | if (m_off > dict_len) goto lookbehind_overrun; \ | ||
| 70 | m_pos = dict_end - m_off; \ | ||
| 71 | if (m_len > m_off) \ | ||
| 72 | { \ | ||
| 73 | m_len -= m_off; \ | ||
| 74 | FAST_MEMCPY(op,m_pos,m_off) \ | ||
| 75 | m_pos = out; \ | ||
| 76 | SLOW_MEMCPY(op,m_pos,m_len) \ | ||
| 77 | } \ | ||
| 78 | else \ | ||
| 79 | FAST_MEMCPY(op,m_pos,m_len) \ | ||
| 80 | } | ||
| 81 | |||
| 82 | #define COPY_DICT(m_len,m_off) \ | ||
| 83 | assert(m_len >= 2); assert(m_off > 0); assert(op > out); \ | ||
| 84 | if (m_off <= pd(op, out)) \ | ||
| 85 | { \ | ||
| 86 | register const lzo_bytep m_pos = op - m_off; \ | ||
| 87 | DICT_MEMMOVE(op,m_pos,m_len,m_off) \ | ||
| 88 | } \ | ||
| 89 | else \ | ||
| 90 | COPY_DICT_DICT(m_len,m_off) | ||
| 91 | |||
| 92 | |||
| 93 | |||
| 94 | |||
| 95 | LZO_PUBLIC(int) | ||
| 96 | lzo1x_decompress_dict_safe ( const lzo_bytep in, lzo_uint in_len, | ||
| 97 | lzo_bytep out, lzo_uintp out_len, | ||
| 98 | lzo_voidp wrkmem /* NOT USED */, | ||
| 99 | const lzo_bytep dict, lzo_uint dict_len) | ||
| 100 | |||
| 101 | |||
| 102 | #include "lzo1x_d.ch" | ||
| 103 | |||
| 104 | |||
| 105 | /* | ||
| 106 | vi:ts=4:et | ||
| 107 | */ | ||
| 108 |