-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathlzss.c
322 lines (277 loc) · 11.4 KB
/
lzss.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
/***************************************************************************
* Lempel, Ziv, Storer, and Szymanski Encoding
*
* File : lzss.c
* Purpose : Use lzss coding (Storer and Szymanski's modified LZ77) to
* compress lzss data files.
* Author : Michael Dipperstein
* Date : November 28, 2014
*
****************************************************************************
*
* LZss: An ANSI C LZSS Encoding/Decoding Routines
* Copyright (C) 2003 - 2007, 2014 by
* Michael Dipperstein ([email protected])
*
* This file is part of the lzss library.
*
* The lzss library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation; either version 3 of the
* License, or (at your option) any later version.
*
* The lzss 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 Lesser
* General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
***************************************************************************/
/***************************************************************************
* INCLUDED FILES
***************************************************************************/
#include <stdio.h>
#include <string.h>
#include <errno.h>
#include "lzlocal.h"
#include "bitfile.h"
/***************************************************************************
* TYPE DEFINITIONS
***************************************************************************/
/***************************************************************************
* CONSTANTS
***************************************************************************/
/***************************************************************************
* GLOBAL VARIABLES
***************************************************************************/
/* cyclic buffer sliding window of already read characters */
unsigned char slidingWindow[WINDOW_SIZE];
unsigned char uncodedLookahead[MAX_CODED];
/***************************************************************************
* PROTOTYPES
***************************************************************************/
/***************************************************************************
* FUNCTIONS
***************************************************************************/
/****************************************************************************
* Function : EncodeLZSS
* Description: This function will read an input file and write an output
* file encoded according to the traditional LZSS algorithm.
* This algorithm encodes strings as 16 bits (a 12 bit offset
* + a 4 bit length).
* Parameters : fpIn - pointer to the open binary file to encode
* fpOut - pointer to the open binary file to write encoded
* output
* Effects : fpIn is encoded and written to fpOut. Neither file is
* closed after exit.
* Returned : 0 for success, -1 for failure. errno will be set in the
* event of a failure.
****************************************************************************/
int EncodeLZSS(FILE *fpIn, FILE *fpOut)
{
bit_file_t *bfpOut;
encoded_string_t matchData;
int c;
unsigned int i;
unsigned int len; /* length of string */
/* head of sliding window and lookahead */
unsigned int windowHead, uncodedHead;
/* validate arguments */
if ((NULL == fpIn) || (NULL == fpOut))
{
errno = ENOENT;
return -1;
}
/* convert output file to bitfile */
bfpOut = MakeBitFile(fpOut, BF_WRITE);
if (NULL == bfpOut)
{
perror("Making Output File a BitFile");
return -1;
}
windowHead = 0;
uncodedHead = 0;
/************************************************************************
* Fill the sliding window buffer with some known vales. DecodeLZSS must
* use the same values. If common characters are used, there's an
* increased chance of matching to the earlier strings.
************************************************************************/
memset(slidingWindow, ' ', WINDOW_SIZE * sizeof(unsigned char));
/************************************************************************
* Copy MAX_CODED bytes from the input file into the uncoded lookahead
* buffer.
************************************************************************/
for (len = 0; len < MAX_CODED && (c = getc(fpIn)) != EOF; len++)
{
uncodedLookahead[len] = c;
}
if (0 == len)
{
return 0; /* inFile was empty */
}
/* Look for matching string in sliding window */
i = InitializeSearchStructures();
if (0 != i)
{
return i; /* InitializeSearchStructures returned an error */
}
matchData = FindMatch(windowHead, uncodedHead);
/* now encoded the rest of the file until an EOF is read */
while (len > 0)
{
if (matchData.length > len)
{
/* garbage beyond last data happened to extend match length */
matchData.length = len;
}
if (matchData.length <= MAX_UNCODED)
{
/* not long enough match. write uncoded flag and character */
BitFilePutBit(UNCODED, bfpOut);
BitFilePutChar(uncodedLookahead[uncodedHead], bfpOut);
matchData.length = 1; /* set to 1 for 1 byte uncoded */
}
else
{
unsigned int adjustedLen;
/* adjust the length of the match so minimun encoded len is 0*/
adjustedLen = matchData.length - (MAX_UNCODED + 1);
/* match length > MAX_UNCODED. Encode as offset and length. */
BitFilePutBit(ENCODED, bfpOut);
BitFilePutBitsNum(bfpOut, &matchData.offset, OFFSET_BITS,
sizeof(unsigned int));
BitFilePutBitsNum(bfpOut, &adjustedLen, LENGTH_BITS,
sizeof(unsigned int));
}
/********************************************************************
* Replace the matchData.length worth of bytes we've matched in the
* sliding window with new bytes from the input file.
********************************************************************/
i = 0;
while ((i < matchData.length) && ((c = getc(fpIn)) != EOF))
{
/* add old byte into sliding window and new into lookahead */
ReplaceChar(windowHead, uncodedLookahead[uncodedHead]);
uncodedLookahead[uncodedHead] = c;
windowHead = Wrap((windowHead + 1), WINDOW_SIZE);
uncodedHead = Wrap((uncodedHead + 1), MAX_CODED);
i++;
}
/* handle case where we hit EOF before filling lookahead */
while (i < matchData.length)
{
ReplaceChar(windowHead, uncodedLookahead[uncodedHead]);
/* nothing to add to lookahead here */
windowHead = Wrap((windowHead + 1), WINDOW_SIZE);
uncodedHead = Wrap((uncodedHead + 1), MAX_CODED);
len--;
i++;
}
/* find match for the remaining characters */
matchData = FindMatch(windowHead, uncodedHead);
}
/* we've encoded everything, free bitfile structure */
BitFileToFILE(bfpOut);
return 0;
}
/****************************************************************************
* Function : DecodeLZSSByFile
* Description: This function will read an LZSS encoded input file and
* write an output file. This algorithm encodes strings as 16
* bits (a 12 bit offset + a 4 bit length).
* Parameters : fpIn - pointer to the open binary file to decode
* fpOut - pointer to the open binary file to write decoded
* output
* Effects : fpIn is decoded and written to fpOut. Neither file is
* closed after exit.
* Returned : 0 for success, -1 for failure. errno will be set in the
* event of a failure.
****************************************************************************/
int DecodeLZSS(FILE *fpIn, FILE *fpOut)
{
bit_file_t *bfpIn;
int c;
unsigned int i, nextChar;
encoded_string_t code; /* offset/length code for string */
/* use stdin if no input file */
if ((NULL == fpIn) || (NULL == fpOut))
{
errno = ENOENT;
return -1;
}
/* convert input file to bitfile */
bfpIn = MakeBitFile(fpIn, BF_READ);
if (NULL == bfpIn)
{
perror("Making Input File a BitFile");
return -1;
}
/************************************************************************
* Fill the sliding window buffer with some known vales. EncodeLZSS must
* use the same values. If common characters are used, there's an
* increased chance of matching to the earlier strings.
************************************************************************/
memset(slidingWindow, ' ', WINDOW_SIZE * sizeof(unsigned char));
nextChar = 0;
while (1)
{
if ((c = BitFileGetBit(bfpIn)) == EOF)
{
/* we hit the EOF */
break;
}
if (c == UNCODED)
{
/* uncoded character */
if ((c = BitFileGetChar(bfpIn)) == EOF)
{
break;
}
/* write out byte and put it in sliding window */
putc(c, fpOut);
slidingWindow[nextChar] = c;
nextChar = Wrap((nextChar + 1), WINDOW_SIZE);
}
else
{
/* offset and length */
code.offset = 0;
code.length = 0;
if ((BitFileGetBitsNum(bfpIn, &code.offset, OFFSET_BITS,
sizeof(unsigned int))) == EOF)
{
break;
}
if ((BitFileGetBitsNum(bfpIn, &code.length, LENGTH_BITS,
sizeof(unsigned int))) == EOF)
{
break;
}
code.length += MAX_UNCODED + 1;
/****************************************************************
* Write out decoded string to file and lookahead. It would be
* nice to write to the sliding window instead of the lookahead,
* but we could end up overwriting the matching string with the
* new string if abs(offset - next char) < match length.
****************************************************************/
for (i = 0; i < code.length; i++)
{
c = slidingWindow[Wrap((code.offset + i), WINDOW_SIZE)];
putc(c, fpOut);
uncodedLookahead[i] = c;
}
/* write out decoded string to sliding window */
for (i = 0; i < code.length; i++)
{
slidingWindow[Wrap((nextChar + i), WINDOW_SIZE)] =
uncodedLookahead[i];
}
nextChar = Wrap((nextChar + code.length), WINDOW_SIZE);
}
}
/* we've decoded everything, free bitfile structure */
BitFileToFILE(bfpIn);
return 0;
}