Revision: | 1.1 |
Committed: | Tue Feb 24 11:56:44 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. |
# | Content |
---|---|
1 | /* stats1a.h -- statistics for the the LZO1A algorithm |
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 | /* WARNING: this file should *not* be used by applications. It is |
42 | part of the implementation of the LZO package and is subject |
43 | to change. |
44 | */ |
45 | |
46 | |
47 | #ifndef __LZO_STATS1A_H |
48 | #define __LZO_STATS1A_H |
49 | |
50 | #ifdef __cplusplus |
51 | extern "C" { |
52 | #endif |
53 | |
54 | |
55 | |
56 | /*********************************************************************** |
57 | // collect statistical information when compressing |
58 | // used for finetuning, view with a debugger |
59 | ************************************************************************/ |
60 | |
61 | #if defined(LZO_COLLECT_STATS) |
62 | # define LZO_STATS(expr) expr |
63 | #else |
64 | # define LZO_STATS(expr) ((void) 0) |
65 | #endif |
66 | |
67 | |
68 | /*********************************************************************** |
69 | // |
70 | ************************************************************************/ |
71 | |
72 | typedef struct { |
73 | |
74 | /* configuration */ |
75 | unsigned rbits; |
76 | unsigned clevel; |
77 | |
78 | /* internal configuration */ |
79 | unsigned dbits; |
80 | unsigned lbits; |
81 | |
82 | /* constants */ |
83 | unsigned min_match_short; |
84 | unsigned max_match_short; |
85 | unsigned min_match_long; |
86 | unsigned max_match_long; |
87 | unsigned min_offset; |
88 | unsigned max_offset; |
89 | unsigned r0min; |
90 | unsigned r0fast; |
91 | unsigned r0max; |
92 | |
93 | /* counts */ |
94 | long short_matches; |
95 | long long_matches; |
96 | long r1_matches; |
97 | long lit_runs; |
98 | long lit_runs_after_long_match; |
99 | long r0short_runs; |
100 | long r0fast_runs; |
101 | long r0long_runs; |
102 | |
103 | /* */ |
104 | long lit_run[RSIZE]; |
105 | long lit_run_after_long_match[RSIZE]; |
106 | long short_match[MAX_MATCH_SHORT + 1]; |
107 | long long_match[MAX_MATCH_LONG + 1]; |
108 | long marker[256]; |
109 | |
110 | /* these could prove useful for further optimizations */ |
111 | long short_match_offset_osize[MAX_MATCH_SHORT + 1]; |
112 | long short_match_offset_256[MAX_MATCH_SHORT + 1]; |
113 | long short_match_offset_1024[MAX_MATCH_SHORT + 1]; |
114 | long matches_out_of_range; |
115 | long matches_out_of_range_2; |
116 | long matches_out_of_range_4; |
117 | long match_out_of_range[MAX_MATCH_SHORT + 1]; |
118 | |
119 | /* */ |
120 | long in_len; |
121 | long out_len; |
122 | } |
123 | lzo1a_stats_t; |
124 | |
125 | extern lzo1a_stats_t *lzo1a_stats; |
126 | |
127 | |
128 | |
129 | #ifdef __cplusplus |
130 | } /* extern "C" */ |
131 | #endif |
132 | |
133 | #endif /* already included */ |
134 | |
135 | /* |
136 | vi:ts=4:et |
137 | */ |