|
0
|
1 |
"
|
|
|
2 |
COPYRIGHT (c) 1991-93 by Claus Gittinger
|
|
|
3 |
All Rights Reserved
|
|
|
4 |
|
|
|
5 |
This software is furnished under a license and may be used
|
|
|
6 |
only in accordance with the terms of that license and with the
|
|
|
7 |
inclusion of the above copyright notice. This software may not
|
|
|
8 |
be provided or otherwise made available to, or used by, any
|
|
|
9 |
other person. No title to or ownership of the software is
|
|
|
10 |
hereby transferred.
|
|
|
11 |
"
|
|
|
12 |
|
|
|
13 |
Object subclass:#ImageReader
|
|
|
14 |
instanceVariableNames:'width height data byteOrder inStream outStream
|
|
|
15 |
photometric samplesPerPixel bitsPerSample
|
|
|
16 |
colorMap'
|
|
2
|
17 |
classVariableNames:'ReverseBits'
|
|
0
|
18 |
poolDictionaries:''
|
|
|
19 |
category:'Graphics-Support'
|
|
|
20 |
!
|
|
|
21 |
|
|
|
22 |
ImageReader comment:'
|
|
|
23 |
|
|
|
24 |
COPYRIGHT (c) 1991-93 by Claus Gittinger
|
|
|
25 |
All Rights Reserved
|
|
|
26 |
|
|
|
27 |
common functions for image-readers (i.e. TIFFReader, GIFReader etc.)
|
|
|
28 |
|
|
|
29 |
%W% %E%
|
|
|
30 |
written Summer 91 by claus
|
|
|
31 |
'!
|
|
|
32 |
|
|
|
33 |
!ImageReader class methodsFor:'testing'!
|
|
|
34 |
|
|
|
35 |
isValidImageFile:aFileName
|
|
|
36 |
"return true, if aFileName contains an image this
|
|
|
37 |
reader understands - should be redefined in subclasses"
|
|
|
38 |
|
|
|
39 |
^ false
|
|
|
40 |
! !
|
|
|
41 |
|
|
2
|
42 |
!ImageReader class methodsFor:'constants'!
|
|
|
43 |
|
|
|
44 |
reverseBits
|
|
|
45 |
"return a table filled with bit reverse information.
|
|
|
46 |
To convert from msbit-first to lsbit-first bytes, use
|
|
|
47 |
the value as index into the table, retrieving the reverse
|
|
|
48 |
value. Since indexing must start at 1, use (value + 1) as
|
|
|
49 |
index."
|
|
|
50 |
|
|
|
51 |
|val index|
|
|
|
52 |
|
|
|
53 |
ReverseBits isNil ifTrue:[
|
|
|
54 |
ReverseBits := ByteArray new:256.
|
|
|
55 |
0 to:255 do:[:i |
|
|
|
56 |
val := 0.
|
|
|
57 |
index := i.
|
|
|
58 |
(index bitTest:16r01) ifTrue:[val := val bitOr:16r80].
|
|
|
59 |
(index bitTest:16r02) ifTrue:[val := val bitOr:16r40].
|
|
|
60 |
(index bitTest:16r04) ifTrue:[val := val bitOr:16r20].
|
|
|
61 |
(index bitTest:16r08) ifTrue:[val := val bitOr:16r10].
|
|
|
62 |
(index bitTest:16r10) ifTrue:[val := val bitOr:16r08].
|
|
|
63 |
(index bitTest:16r20) ifTrue:[val := val bitOr:16r04].
|
|
|
64 |
(index bitTest:16r40) ifTrue:[val := val bitOr:16r02].
|
|
|
65 |
(index bitTest:16r80) ifTrue:[val := val bitOr:16r01].
|
|
|
66 |
ReverseBits at:(index + 1) put:val
|
|
|
67 |
]
|
|
|
68 |
].
|
|
|
69 |
^ ReverseBits
|
|
|
70 |
! !
|
|
|
71 |
|
|
0
|
72 |
!ImageReader class methodsFor:'fileIn / fileOut'!
|
|
|
73 |
|
|
|
74 |
fromFile:aFileName
|
|
2
|
75 |
|reader image depth|
|
|
0
|
76 |
|
|
|
77 |
reader := self new.
|
|
2
|
78 |
reader := reader fromFile:aFileName.
|
|
|
79 |
reader notNil ifTrue:[
|
|
|
80 |
depth := reader bitsPerPixel.
|
|
|
81 |
image := (Image implementorForDepth: depth) new.
|
|
0
|
82 |
image width:(reader width).
|
|
|
83 |
image height:(reader height).
|
|
|
84 |
image photometric:(reader photometric).
|
|
|
85 |
image samplesPerPixel:(reader samplesPerPixel).
|
|
|
86 |
image bitsPerSample:(reader bitsPerSample).
|
|
|
87 |
image colorMap:(reader colorMap).
|
|
|
88 |
image data:(reader data).
|
|
|
89 |
^ image
|
|
|
90 |
].
|
|
|
91 |
^ nil
|
|
|
92 |
!
|
|
|
93 |
|
|
|
94 |
save:anImage onFile:aFileName
|
|
|
95 |
^ (self basicNew) save:anImage onFile:aFileName
|
|
|
96 |
! !
|
|
|
97 |
|
|
|
98 |
!ImageReader methodsFor:'accessing'!
|
|
|
99 |
|
|
|
100 |
width
|
|
|
101 |
^ width
|
|
|
102 |
!
|
|
|
103 |
|
|
|
104 |
height
|
|
|
105 |
^ height
|
|
|
106 |
!
|
|
|
107 |
|
|
|
108 |
data
|
|
|
109 |
^ data
|
|
|
110 |
!
|
|
|
111 |
|
|
|
112 |
photometric
|
|
|
113 |
^ photometric
|
|
|
114 |
!
|
|
|
115 |
|
|
|
116 |
colorMap
|
|
|
117 |
^ colorMap
|
|
|
118 |
!
|
|
|
119 |
|
|
|
120 |
samplesPerPixel
|
|
|
121 |
^ samplesPerPixel
|
|
|
122 |
!
|
|
|
123 |
|
|
|
124 |
bitsPerSample
|
|
|
125 |
^ bitsPerSample
|
|
2
|
126 |
!
|
|
|
127 |
|
|
|
128 |
bitsPerPixel
|
|
|
129 |
"return the number of bits per pixel"
|
|
|
130 |
|
|
|
131 |
^ (bitsPerSample inject:0 into:[:sum :i | sum + i])
|
|
0
|
132 |
! !
|
|
|
133 |
|
|
|
134 |
!ImageReader methodsFor:'fileIn / fileOut'!
|
|
|
135 |
|
|
|
136 |
fromFile:aFileName
|
|
|
137 |
^ self subclassResponsibility
|
|
|
138 |
!
|
|
|
139 |
|
|
|
140 |
save:image onFile:aFileName
|
|
|
141 |
^ self subclassResponsibility
|
|
|
142 |
! !
|
|
|
143 |
|
|
|
144 |
!ImageReader methodsFor:'i/o support'!
|
|
|
145 |
|
|
|
146 |
readLong
|
|
2
|
147 |
"return the next 4-byte long, honoring the byte-order"
|
|
|
148 |
|
|
|
149 |
^ inStream nextLongMSB:(byteOrder ~~ #lsb)
|
|
|
150 |
|
|
|
151 |
"
|
|
0
|
152 |
|bytes val|
|
|
|
153 |
|
|
|
154 |
bytes := ByteArray new:4.
|
|
|
155 |
inStream nextBytes:4 into:bytes.
|
|
|
156 |
(byteOrder == #lsb) ifTrue:[
|
|
|
157 |
val := bytes at:4.
|
|
|
158 |
val := val * 256 + (bytes at:3).
|
|
|
159 |
val := val * 256 + (bytes at:2).
|
|
|
160 |
val := val * 256 + (bytes at:1)
|
|
|
161 |
] ifFalse:[
|
|
|
162 |
val := bytes at:1.
|
|
|
163 |
val := val * 256 + (bytes at:2).
|
|
|
164 |
val := val * 256 + (bytes at:3).
|
|
|
165 |
val := val * 256 + (bytes at:4)
|
|
|
166 |
].
|
|
|
167 |
^ val
|
|
2
|
168 |
"
|
|
0
|
169 |
!
|
|
|
170 |
|
|
|
171 |
readShort
|
|
2
|
172 |
"return the next 2-byte short, honoring the byte-order"
|
|
|
173 |
|
|
|
174 |
^ inStream nextShortMSB:(byteOrder ~~ #lsb)
|
|
|
175 |
|
|
|
176 |
"
|
|
0
|
177 |
|bytes val|
|
|
|
178 |
|
|
|
179 |
bytes := ByteArray new:2.
|
|
|
180 |
inStream nextBytes:2 into:bytes.
|
|
|
181 |
(byteOrder == #lsb) ifTrue:[
|
|
|
182 |
val := bytes at:2.
|
|
|
183 |
val := val * 256 + (bytes at:1)
|
|
|
184 |
] ifFalse:[
|
|
|
185 |
val := bytes at:1.
|
|
|
186 |
val := val * 256 + (bytes at:2)
|
|
|
187 |
].
|
|
|
188 |
^ val
|
|
2
|
189 |
"
|
|
0
|
190 |
!
|
|
|
191 |
|
|
|
192 |
readShortLong
|
|
2
|
193 |
"return the next 2-byte short, honoring the byte-order.
|
|
|
194 |
There are actually 4 bytes read, but only 2 looked at."
|
|
|
195 |
|
|
0
|
196 |
|bytes val|
|
|
|
197 |
|
|
|
198 |
bytes := ByteArray new:4.
|
|
|
199 |
inStream nextBytes:4 into:bytes.
|
|
|
200 |
(byteOrder == #lsb) ifTrue:[
|
|
|
201 |
val := bytes at:2.
|
|
|
202 |
val := val * 256 + (bytes at:1)
|
|
|
203 |
] ifFalse:[
|
|
|
204 |
val := bytes at:3.
|
|
|
205 |
val := val * 256 + (bytes at:4)
|
|
|
206 |
].
|
|
|
207 |
^ val
|
|
|
208 |
!
|
|
|
209 |
|
|
|
210 |
writeLong:anInteger
|
|
2
|
211 |
"write a 4-byte long, honoring the byte-order."
|
|
|
212 |
|
|
|
213 |
outStream nextLongPut:anInteger MSB:(byteOrder ~~ #lsb)
|
|
|
214 |
|
|
|
215 |
"
|
|
0
|
216 |
|bytes i|
|
|
|
217 |
|
|
|
218 |
i := anInteger.
|
|
|
219 |
bytes := ByteArray new:4.
|
|
|
220 |
(byteOrder == #lsb) ifTrue:[
|
|
|
221 |
bytes at:1 put:(i bitAnd:16rFF).
|
|
|
222 |
i := i // 256.
|
|
|
223 |
bytes at:2 put:(i bitAnd:16rFF).
|
|
|
224 |
i := i // 256.
|
|
|
225 |
bytes at:3 put:(i bitAnd:16rFF).
|
|
|
226 |
i := i // 256.
|
|
|
227 |
bytes at:4 put:(i bitAnd:16rFF).
|
|
|
228 |
] ifFalse:[
|
|
|
229 |
bytes at:4 put:(i bitAnd:16rFF).
|
|
|
230 |
i := i // 256.
|
|
|
231 |
bytes at:3 put:(i bitAnd:16rFF).
|
|
|
232 |
i := i // 256.
|
|
|
233 |
bytes at:2 put:(i bitAnd:16rFF).
|
|
|
234 |
i := i // 256.
|
|
|
235 |
bytes at:1 put:(i bitAnd:16rFF).
|
|
|
236 |
].
|
|
|
237 |
outStream nextPutBytes:4 from:bytes
|
|
2
|
238 |
"
|
|
0
|
239 |
!
|
|
|
240 |
|
|
|
241 |
writeShort:anInteger
|
|
2
|
242 |
"write a 2-byte short, honoring the byte-order."
|
|
|
243 |
|
|
|
244 |
outStream nextShortPut:anInteger MSB:(byteOrder ~~ #lsb)
|
|
|
245 |
|
|
|
246 |
"
|
|
0
|
247 |
|bytes i|
|
|
|
248 |
|
|
|
249 |
i := anInteger.
|
|
|
250 |
bytes := ByteArray new:2.
|
|
|
251 |
(byteOrder == #lsb) ifTrue:[
|
|
|
252 |
bytes at:1 put:(i bitAnd:16rFF).
|
|
|
253 |
i := i // 256.
|
|
|
254 |
bytes at:2 put:(i bitAnd:16rFF).
|
|
|
255 |
] ifFalse:[
|
|
|
256 |
bytes at:2 put:(i bitAnd:16rFF).
|
|
|
257 |
i := i // 256.
|
|
|
258 |
bytes at:1 put:(i bitAnd:16rFF).
|
|
|
259 |
].
|
|
|
260 |
outStream nextPutBytes:2 from:bytes
|
|
2
|
261 |
"
|
|
0
|
262 |
! !
|
|
|
263 |
|
|
|
264 |
!ImageReader class methodsFor:'decompression support'!
|
|
|
265 |
|
|
|
266 |
decompressCCITT3From:srcBytes into:dstBytes startingAt:offset count:count
|
|
|
267 |
"same as above but using primitive for speed"
|
|
|
268 |
%{
|
|
|
269 |
if ((_Class(srcBytes) == ByteArray)
|
|
|
270 |
&& (_Class(dstBytes) == ByteArray)
|
|
|
271 |
&& _isSmallInteger(offset)
|
|
|
272 |
&& _isSmallInteger(count)) {
|
|
|
273 |
decodeCCITTgroup3(_ByteArrayInstPtr(srcBytes)->ba_element,
|
|
|
274 |
_ByteArrayInstPtr(dstBytes)->ba_element
|
|
|
275 |
+ _intVal(offset) - 1,
|
|
|
276 |
_intVal(count));
|
|
|
277 |
RETURN ( self );
|
|
|
278 |
}
|
|
|
279 |
%}
|
|
|
280 |
.
|
|
|
281 |
self primitiveFailed
|
|
|
282 |
!
|
|
|
283 |
|
|
|
284 |
decompressLZWFrom:srcBytes count:count into:dstBytes startingAt:offset
|
|
|
285 |
%{
|
|
|
286 |
if ((_Class(srcBytes) == ByteArray)
|
|
|
287 |
&& (_Class(dstBytes) == ByteArray)
|
|
|
288 |
&& _isSmallInteger(offset)
|
|
|
289 |
&& _isSmallInteger(count)) {
|
|
|
290 |
decodeLZW(_ByteArrayInstPtr(srcBytes)->ba_element,
|
|
|
291 |
_ByteArrayInstPtr(dstBytes)->ba_element
|
|
|
292 |
+ _intVal(offset) - 1,
|
|
|
293 |
_intVal(count));
|
|
|
294 |
RETURN ( self );
|
|
|
295 |
}
|
|
|
296 |
%}
|
|
|
297 |
.
|
|
|
298 |
self primitiveFailed
|
|
|
299 |
!
|
|
|
300 |
|
|
|
301 |
decodeDelta:step in:data width:width height:height
|
|
|
302 |
(step ~~ 3) ifTrue:[
|
|
|
303 |
^ self error:'only rgb pictures supported'
|
|
|
304 |
].
|
|
|
305 |
|
|
|
306 |
%{
|
|
|
307 |
if ((_Class(data) == ByteArray)
|
|
|
308 |
&& _isSmallInteger(width)
|
|
|
309 |
&& _isSmallInteger(height)) {
|
|
|
310 |
decodeDelta(_ByteArrayInstPtr(data)->ba_element,
|
|
|
311 |
_intVal(width), _intVal(height));
|
|
|
312 |
RETURN ( self );
|
|
|
313 |
}
|
|
|
314 |
%}
|
|
|
315 |
.
|
|
|
316 |
self primitiveFailed
|
|
|
317 |
!
|
|
|
318 |
|
|
|
319 |
decompressGIFFrom:srcBytes count:count into:dstBytes startingAt:offset codeLen:codeLen
|
|
|
320 |
%{
|
|
|
321 |
if ((_Class(srcBytes) == ByteArray)
|
|
|
322 |
&& (_Class(dstBytes) == ByteArray)
|
|
|
323 |
&& _isSmallInteger(codeLen)
|
|
|
324 |
&& _isSmallInteger(offset)
|
|
|
325 |
&& _isSmallInteger(count)) {
|
|
|
326 |
decodeGIF(_ByteArrayInstPtr(srcBytes)->ba_element,
|
|
|
327 |
_ByteArrayInstPtr(dstBytes)->ba_element
|
|
|
328 |
+ _intVal(offset) - 1,
|
|
|
329 |
_intVal(count),
|
|
|
330 |
_intVal(codeLen));
|
|
|
331 |
RETURN ( self );
|
|
|
332 |
}
|
|
|
333 |
%}
|
|
|
334 |
.
|
|
|
335 |
self primitiveFailed
|
|
|
336 |
! !
|
|
|
337 |
|
|
|
338 |
%{
|
|
|
339 |
|
|
|
340 |
/*
|
|
|
341 |
* ccitt decompression
|
|
|
342 |
*/
|
|
|
343 |
static short *whiteCountTable;
|
|
|
344 |
static char *whiteShiftTable;
|
|
|
345 |
static short *blackCountTable;
|
|
|
346 |
static char *blackShiftTable;
|
|
|
347 |
|
|
|
348 |
struct ccitt_def {
|
|
|
349 |
unsigned short bits;
|
|
|
350 |
short nBits;
|
|
|
351 |
};
|
|
|
352 |
|
|
|
353 |
static struct ccitt_def
|
|
|
354 |
whiteDef[] = {
|
|
|
355 |
{ 0x3500, 8 }, /* 0 */
|
|
|
356 |
{ 0x1c00, 6 },
|
|
|
357 |
{ 0x7000, 4 },
|
|
|
358 |
{ 0x8000, 4 },
|
|
|
359 |
{ 0xb000, 4 },
|
|
|
360 |
{ 0xc000, 4 },
|
|
|
361 |
{ 0xe000, 4 },
|
|
|
362 |
{ 0xf000, 4 },
|
|
|
363 |
{ 0x9800, 5 },
|
|
|
364 |
{ 0xA000, 5 },
|
|
|
365 |
{ 0x3800, 5 }, /* 10 */
|
|
|
366 |
{ 0x4000, 5 },
|
|
|
367 |
{ 0x2000, 6 },
|
|
|
368 |
{ 0x0c00, 6 },
|
|
|
369 |
{ 0xd000, 6 },
|
|
|
370 |
{ 0xd400, 6 },
|
|
|
371 |
{ 0xa800, 6 },
|
|
|
372 |
{ 0xac00, 6 },
|
|
|
373 |
{ 0x4e00, 7 },
|
|
|
374 |
{ 0x1800, 7 },
|
|
|
375 |
{ 0x1000, 7 }, /* 20 */
|
|
|
376 |
{ 0x2e00, 7 },
|
|
|
377 |
{ 0x0600, 7 },
|
|
|
378 |
{ 0x0800, 7 },
|
|
|
379 |
{ 0x5000, 7 },
|
|
|
380 |
{ 0x5600, 7 },
|
|
|
381 |
{ 0x2600, 7 },
|
|
|
382 |
{ 0x4800, 7 },
|
|
|
383 |
{ 0x3000, 7 },
|
|
|
384 |
{ 0x0200, 8 },
|
|
|
385 |
{ 0x0300, 8 }, /* 30 */
|
|
|
386 |
{ 0x1a00, 8 },
|
|
|
387 |
{ 0x1b00, 8 },
|
|
|
388 |
{ 0x1200, 8 },
|
|
|
389 |
{ 0x1300, 8 },
|
|
|
390 |
{ 0x1400, 8 },
|
|
|
391 |
{ 0x1500, 8 },
|
|
|
392 |
{ 0x1600, 8 },
|
|
|
393 |
{ 0x1700, 8 },
|
|
|
394 |
{ 0x2800, 8 },
|
|
|
395 |
{ 0x2900, 8 }, /* 40 */
|
|
|
396 |
{ 0x2a00, 8 },
|
|
|
397 |
{ 0x2b00, 8 },
|
|
|
398 |
{ 0x2c00, 8 },
|
|
|
399 |
{ 0x2d00, 8 },
|
|
|
400 |
{ 0x0400, 8 },
|
|
|
401 |
{ 0x0500, 8 },
|
|
|
402 |
{ 0x0a00, 8 },
|
|
|
403 |
{ 0x0b00, 8 },
|
|
|
404 |
{ 0x5200, 8 },
|
|
|
405 |
{ 0x5300, 8 }, /* 50 */
|
|
|
406 |
{ 0x5400, 8 },
|
|
|
407 |
{ 0x5500, 8 },
|
|
|
408 |
{ 0x2400, 8 },
|
|
|
409 |
{ 0x2500, 8 },
|
|
|
410 |
{ 0x5800, 8 },
|
|
|
411 |
{ 0x5900, 8 },
|
|
|
412 |
{ 0x5a00, 8 },
|
|
|
413 |
{ 0x5b00, 8 },
|
|
|
414 |
{ 0x4a00, 8 },
|
|
|
415 |
{ 0x4b00, 8 }, /* 60 */
|
|
|
416 |
{ 0x3200, 8 },
|
|
|
417 |
{ 0x3300, 8 },
|
|
|
418 |
{ 0x3400, 8 },
|
|
|
419 |
/* ---------------- */
|
|
|
420 |
{ 0xd800, 5 }, /* 64 */
|
|
|
421 |
{ 0x9000, 5 }, /* 128 */
|
|
|
422 |
{ 0x5c00, 6 }, /* 192 */
|
|
|
423 |
{ 0x6e00, 7 }, /* 256 */
|
|
|
424 |
{ 0x3600, 8 }, /* 320 */
|
|
|
425 |
{ 0x3700, 8 },
|
|
|
426 |
{ 0x6400, 8 },
|
|
|
427 |
{ 0x6500, 8 },
|
|
|
428 |
{ 0x6800, 8 },
|
|
|
429 |
{ 0x6700, 8 }, /* 640 */
|
|
|
430 |
{ 0x6600, 9 }, /* 704 */
|
|
|
431 |
{ 0x6680, 9 },
|
|
|
432 |
{ 0x6900, 9 },
|
|
|
433 |
{ 0x6980, 9 },
|
|
|
434 |
{ 0x6a00, 9 },
|
|
|
435 |
{ 0x6a80, 9 },
|
|
|
436 |
{ 0x6b00, 9 },
|
|
|
437 |
{ 0x6b80, 9 },
|
|
|
438 |
{ 0x6c00, 9 },
|
|
|
439 |
{ 0x6c80, 9 },
|
|
|
440 |
{ 0x6d00, 9 },
|
|
|
441 |
{ 0x6d80, 9 },
|
|
|
442 |
{ 0x4c00, 9 },
|
|
|
443 |
{ 0x4c80, 9 },
|
|
|
444 |
{ 0x4d00, 9 }, /* 1600 */
|
|
|
445 |
{ 0x6000, 6 }, /* 1664 */
|
|
|
446 |
{ 0x4d80, 9 }, /* 1728 */
|
|
|
447 |
/* -------------------------------- */
|
|
|
448 |
{ 0x0100, 11 }, /* 1792 */
|
|
|
449 |
{ 0x0180, 11 },
|
|
|
450 |
{ 0x01a0, 11 }, /* 1920 */
|
|
|
451 |
{ 0x0120, 12 }, /* 1984 */
|
|
|
452 |
{ 0x0130, 12 },
|
|
|
453 |
{ 0x0140, 12 },
|
|
|
454 |
{ 0x0150, 12 },
|
|
|
455 |
{ 0x0160, 12 },
|
|
|
456 |
{ 0x0170, 12 },
|
|
|
457 |
{ 0x01c0, 12 },
|
|
|
458 |
{ 0x01d0, 12 },
|
|
|
459 |
{ 0x01e0, 12 },
|
|
|
460 |
{ 0x01f0, 12 }, /* 2560 */
|
|
|
461 |
/* -------------------------------- */
|
|
|
462 |
{ 0x0010, 12 }, /* EOL */
|
|
|
463 |
};
|
|
|
464 |
|
|
|
465 |
static struct ccitt_def
|
|
|
466 |
blackDef[] = {
|
|
|
467 |
{ 0x0dc0, 10 }, /* 0 */
|
|
|
468 |
{ 0x4000, 3 },
|
|
|
469 |
{ 0xc000, 2 },
|
|
|
470 |
{ 0x8000, 2 },
|
|
|
471 |
{ 0x6000, 3 },
|
|
|
472 |
{ 0x3000, 4 },
|
|
|
473 |
{ 0x2000, 4 },
|
|
|
474 |
{ 0x1800, 5 },
|
|
|
475 |
{ 0x1400, 6 },
|
|
|
476 |
{ 0x1000, 6 },
|
|
|
477 |
{ 0x0800, 7 }, /* 10 */
|
|
|
478 |
{ 0x0a00, 7 },
|
|
|
479 |
{ 0x0e00, 7 },
|
|
|
480 |
{ 0x0400, 8 },
|
|
|
481 |
{ 0x0700, 8 },
|
|
|
482 |
{ 0x0c00, 9 },
|
|
|
483 |
{ 0x05c0, 10 },
|
|
|
484 |
{ 0x0600, 10 },
|
|
|
485 |
{ 0x0200, 10 },
|
|
|
486 |
{ 0x0ce0, 11 },
|
|
|
487 |
{ 0x0d00, 11 }, /* 20 */
|
|
|
488 |
{ 0x0d80, 11 },
|
|
|
489 |
{ 0x06e0, 11 },
|
|
|
490 |
{ 0x0500, 11 },
|
|
|
491 |
{ 0x02e0, 11 },
|
|
|
492 |
{ 0x0300, 11 },
|
|
|
493 |
{ 0x0ca0, 12 },
|
|
|
494 |
{ 0x0cb0, 12 },
|
|
|
495 |
{ 0x0cc0, 12 },
|
|
|
496 |
{ 0x0cd0, 12 },
|
|
|
497 |
{ 0x0680, 12 }, /* 30 */
|
|
|
498 |
{ 0x0690, 12 },
|
|
|
499 |
{ 0x06a0, 12 },
|
|
|
500 |
{ 0x06b0, 12 },
|
|
|
501 |
{ 0x0d20, 12 },
|
|
|
502 |
{ 0x0d30, 12 },
|
|
|
503 |
{ 0x0d40, 12 },
|
|
|
504 |
{ 0x0d50, 12 },
|
|
|
505 |
{ 0x0d60, 12 },
|
|
|
506 |
{ 0x0d70, 12 },
|
|
|
507 |
{ 0x06c0, 12 }, /* 40 */
|
|
|
508 |
{ 0x06d0, 12 },
|
|
|
509 |
{ 0x0da0, 12 },
|
|
|
510 |
{ 0x0db0, 12 },
|
|
|
511 |
{ 0x0540, 12 },
|
|
|
512 |
{ 0x0550, 12 },
|
|
|
513 |
{ 0x0560, 12 },
|
|
|
514 |
{ 0x0570, 12 },
|
|
|
515 |
{ 0x0640, 12 },
|
|
|
516 |
{ 0x0650, 12 },
|
|
|
517 |
{ 0x0520, 12 }, /* 50 */
|
|
|
518 |
{ 0x0530, 12 },
|
|
|
519 |
{ 0x0240, 12 },
|
|
|
520 |
{ 0x0370, 12 },
|
|
|
521 |
{ 0x0380, 12 },
|
|
|
522 |
{ 0x0270, 12 },
|
|
|
523 |
{ 0x0280, 12 },
|
|
|
524 |
{ 0x0580, 12 },
|
|
|
525 |
{ 0x0590, 12 },
|
|
|
526 |
{ 0x02b0, 12 },
|
|
|
527 |
{ 0x02c0, 12 }, /* 60 */
|
|
|
528 |
{ 0x05a0, 12 },
|
|
|
529 |
{ 0x0660, 12 },
|
|
|
530 |
{ 0x0670, 12 },
|
|
|
531 |
/* ---------------- */
|
|
|
532 |
{ 0x03c0, 10 }, /* 64 */
|
|
|
533 |
{ 0x0c80, 12 }, /* 128 */
|
|
|
534 |
{ 0x0c90, 12 }, /* 192 */
|
|
|
535 |
{ 0x05b0, 12 }, /* 256 */
|
|
|
536 |
{ 0x0330, 12 }, /* 320 */
|
|
|
537 |
{ 0x0340, 12 },
|
|
|
538 |
{ 0x0350, 12 }, /* 448 */
|
|
|
539 |
{ 0x0360, 13 }, /* 512 */
|
|
|
540 |
{ 0x0368, 13 },
|
|
|
541 |
{ 0x0250, 13 }, /* 640 */
|
|
|
542 |
{ 0x0258, 13 }, /* 704 */
|
|
|
543 |
{ 0x0260, 13 },
|
|
|
544 |
{ 0x0268, 13 },
|
|
|
545 |
{ 0x0390, 13 },
|
|
|
546 |
{ 0x0398, 13 },
|
|
|
547 |
{ 0x03a0, 13 },
|
|
|
548 |
{ 0x03a8, 13 },
|
|
|
549 |
{ 0x03b0, 13 },
|
|
|
550 |
{ 0x03b8, 13 },
|
|
|
551 |
{ 0x0290, 13 },
|
|
|
552 |
{ 0x0298, 13 },
|
|
|
553 |
{ 0x02a0, 13 },
|
|
|
554 |
{ 0x02a8, 13 },
|
|
|
555 |
{ 0x02d0, 13 },
|
|
|
556 |
{ 0x02d8, 13 }, /* 1600 */
|
|
|
557 |
{ 0x0320, 13 }, /* 1664 */
|
|
|
558 |
{ 0x0328, 13 }, /* 1728 */
|
|
|
559 |
/* -------------------------------- */
|
|
|
560 |
};
|
|
|
561 |
|
|
|
562 |
static
|
|
|
563 |
initCCITTTables() {
|
|
|
564 |
register cnt, bits, value;
|
|
|
565 |
int nBits, index;
|
|
|
566 |
|
|
|
567 |
if (whiteCountTable != (short *)0) return;
|
|
|
568 |
|
|
|
569 |
whiteCountTable = (short *) malloc(sizeof(short) * 8192);
|
|
|
570 |
whiteShiftTable = (char *) malloc(sizeof(char) * 8192);
|
|
|
571 |
blackCountTable = (short *) malloc(sizeof(short) * 8192);
|
|
|
572 |
blackShiftTable = (char *) malloc(sizeof(char) * 8192);
|
|
|
573 |
|
|
|
574 |
for (index = 0; index < 8192; index++) {
|
|
|
575 |
whiteCountTable[index] = -1;
|
|
|
576 |
blackCountTable[index] = -1;
|
|
|
577 |
}
|
|
|
578 |
|
|
|
579 |
for (value = 0; value <= 63; value++) {
|
|
|
580 |
nBits = whiteDef[value].nBits;
|
|
|
581 |
bits = whiteDef[value].bits >> 3;
|
|
|
582 |
for (cnt = 1 << (13 - nBits); cnt; cnt--, bits++) {
|
|
|
583 |
whiteCountTable[bits] = value;
|
|
|
584 |
whiteShiftTable[bits] = nBits;
|
|
|
585 |
}
|
|
|
586 |
nBits = blackDef[value].nBits;
|
|
|
587 |
bits = blackDef[value].bits >> 3;
|
|
|
588 |
for (cnt = 1 << (13 - nBits); cnt; cnt--, bits++) {
|
|
|
589 |
blackCountTable[bits] = value;
|
|
|
590 |
blackShiftTable[bits] = nBits;
|
|
|
591 |
}
|
|
|
592 |
}
|
|
|
593 |
index = value;
|
|
|
594 |
|
|
|
595 |
for (; value <= 1728; value += 64) {
|
|
|
596 |
nBits = whiteDef[index].nBits;
|
|
|
597 |
bits = whiteDef[index].bits >> 3;
|
|
|
598 |
for (cnt = 1 << (13 - nBits); cnt; cnt--, bits++) {
|
|
|
599 |
whiteCountTable[bits] = value;
|
|
|
600 |
whiteShiftTable[bits] = nBits;
|
|
|
601 |
}
|
|
|
602 |
nBits = blackDef[index].nBits;
|
|
|
603 |
bits = blackDef[index].bits >> 3;
|
|
|
604 |
for (cnt = 1 << (13 - nBits); cnt; cnt--, bits++) {
|
|
|
605 |
blackCountTable[bits] = value;
|
|
|
606 |
blackShiftTable[bits] = nBits;
|
|
|
607 |
}
|
|
|
608 |
index++;
|
|
|
609 |
}
|
|
|
610 |
|
|
|
611 |
for (; value <= 2560; value += 64) {
|
|
|
612 |
nBits = whiteDef[index].nBits;
|
|
|
613 |
bits = whiteDef[index].bits >> 3;
|
|
|
614 |
for (cnt = 1 << (13 - nBits); cnt; cnt--, bits++) {
|
|
|
615 |
whiteCountTable[bits] = value;
|
|
|
616 |
whiteShiftTable[bits] = nBits;
|
|
|
617 |
blackCountTable[bits] = value;
|
|
|
618 |
blackShiftTable[bits] = nBits;
|
|
|
619 |
}
|
|
|
620 |
index++;
|
|
|
621 |
}
|
|
|
622 |
}
|
|
|
623 |
|
|
|
624 |
static short
|
|
|
625 |
leftBits[] = {
|
|
|
626 |
0, 0x80, 0xC0, 0xE0, 0xF0, 0xF8, 0xFC, 0xFE, 0xFF
|
|
|
627 |
};
|
|
|
628 |
|
|
|
629 |
decodeCCITTgroup3(from, to, len)
|
|
|
630 |
unsigned char *from;
|
|
|
631 |
register unsigned char *to;
|
|
|
632 |
{
|
|
|
633 |
register cnt;
|
|
|
634 |
register short *countPtr;
|
|
|
635 |
register char *shiftPtr;
|
|
|
636 |
unsigned bits, bits13;
|
|
|
637 |
int shift, outCount, nBitsLess13;
|
|
|
638 |
int outBitOffset;
|
|
|
639 |
int nLeft, t;
|
|
|
640 |
|
|
|
641 |
if (! whiteCountTable) initCCITTTables();
|
|
|
642 |
|
|
|
643 |
countPtr = whiteCountTable;
|
|
|
644 |
shiftPtr = whiteShiftTable;
|
|
|
645 |
outCount = 0;
|
|
|
646 |
outBitOffset = 0;
|
|
|
647 |
bits = *from++;
|
|
|
648 |
bits = (bits << 8) | *from++;
|
|
|
649 |
nBitsLess13 = 3;
|
|
|
650 |
for (;;) {
|
|
|
651 |
bits13 = (bits >> nBitsLess13) & 0x1FFF;
|
|
|
652 |
cnt = countPtr[bits13];
|
|
|
653 |
if (cnt < 0) return;
|
|
|
654 |
shift = shiftPtr[bits13];
|
|
|
655 |
outCount += cnt;
|
|
|
656 |
if (countPtr == blackCountTable) {
|
|
|
657 |
/* toggle if it was a terminating code */
|
|
|
658 |
if (cnt < 64) {
|
|
|
659 |
countPtr = whiteCountTable;
|
|
|
660 |
shiftPtr = whiteShiftTable;
|
|
|
661 |
}
|
|
|
662 |
|
|
|
663 |
/* draw cnt black bits */
|
|
|
664 |
if (cnt) {
|
|
|
665 |
if (outBitOffset) {
|
|
|
666 |
nLeft = 8 - outBitOffset;
|
|
|
667 |
if (cnt < nLeft) nLeft = cnt;
|
|
|
668 |
t = leftBits[nLeft] >> outBitOffset;
|
|
|
669 |
*to |= t;
|
|
|
670 |
cnt -= nLeft;
|
|
|
671 |
outBitOffset += nLeft;
|
|
|
672 |
if (outBitOffset >= 8) {
|
|
|
673 |
to++;
|
|
|
674 |
outBitOffset -= 8;
|
|
|
675 |
}
|
|
|
676 |
}
|
|
|
677 |
if (cnt > 256) {
|
|
|
678 |
while ((int)to & 3) {
|
|
|
679 |
*to++ = 0xFF;
|
|
|
680 |
cnt -= 8;
|
|
|
681 |
}
|
|
|
682 |
while (cnt >= 32) {
|
|
|
683 |
(*(long *)to) = 0xFFFFFFFF;
|
|
|
684 |
to += 4;
|
|
|
685 |
cnt -= 32;
|
|
|
686 |
}
|
|
|
687 |
}
|
|
|
688 |
while (cnt >= 8) {
|
|
|
689 |
*to++ = 0xFF;
|
|
|
690 |
cnt -= 8;
|
|
|
691 |
}
|
|
|
692 |
*to |= leftBits[cnt];
|
|
|
693 |
outBitOffset += cnt;
|
|
|
694 |
}
|
|
|
695 |
} else {
|
|
|
696 |
/* toggle if it was a terminating code */
|
|
|
697 |
if (cnt < 64) {
|
|
|
698 |
countPtr = blackCountTable;
|
|
|
699 |
shiftPtr = blackShiftTable;
|
|
|
700 |
}
|
|
|
701 |
|
|
|
702 |
/* skip cnt bits */
|
|
|
703 |
to += cnt >> 3;
|
|
|
704 |
outBitOffset += cnt & 7;
|
|
|
705 |
if (outBitOffset >= 8) {
|
|
|
706 |
to++;
|
|
|
707 |
outBitOffset -= 8;
|
|
|
708 |
}
|
|
|
709 |
}
|
|
|
710 |
if (outCount >= len) return;
|
|
|
711 |
|
|
|
712 |
nBitsLess13 -= shift;
|
|
|
713 |
while (nBitsLess13 < 0) {
|
|
|
714 |
bits = (bits << 8) | *from++;
|
|
|
715 |
nBitsLess13 += 8;
|
|
|
716 |
}
|
|
|
717 |
}
|
|
|
718 |
}
|
|
|
719 |
|
|
|
720 |
/*
|
|
|
721 |
* LZW decompression
|
|
|
722 |
*/
|
|
|
723 |
struct buffer {
|
|
|
724 |
struct buffer *prev;
|
|
|
725 |
unsigned char chars[8192 - 4];
|
|
|
726 |
};
|
|
|
727 |
|
|
|
728 |
decodeLZW(from, to, inCount)
|
|
|
729 |
unsigned char *from;
|
|
|
730 |
unsigned char *to;
|
|
|
731 |
{
|
|
|
732 |
register unsigned code;
|
|
|
733 |
unsigned char *strings[4096];
|
|
|
734 |
short stringLen[4096];
|
|
|
735 |
struct buffer *scratchBuffer;
|
|
|
736 |
struct buffer *newBuffer;
|
|
|
737 |
unsigned char *scratchPtr;
|
|
|
738 |
int nScratch;
|
|
|
739 |
unsigned nextCode, oldCode;
|
|
|
740 |
register unsigned bits;
|
|
|
741 |
int nBits, mask, shift;
|
|
|
742 |
int i;
|
|
|
743 |
int len;
|
|
|
744 |
int codeLen = 9;
|
|
|
745 |
|
|
|
746 |
scratchBuffer = (struct buffer *)malloc(sizeof(struct buffer));
|
|
|
747 |
if (! scratchBuffer) return;
|
|
|
748 |
scratchBuffer->prev = (struct buffer *)0;
|
|
|
749 |
scratchPtr = scratchBuffer->chars;
|
|
|
750 |
nScratch = sizeof(scratchBuffer->chars);
|
|
|
751 |
|
|
|
752 |
for (i = 0; i < 256; i++) {
|
|
|
753 |
*scratchPtr = i;
|
|
|
754 |
strings[i] = scratchPtr++;
|
|
|
755 |
stringLen[i] = 1;
|
|
|
756 |
}
|
|
|
757 |
|
|
|
758 |
nextCode = 258;
|
|
|
759 |
nScratch -= 256;
|
|
|
760 |
mask = 0x1FF;
|
|
|
761 |
nBits = 0;
|
|
|
762 |
bits = 0;
|
|
|
763 |
while (inCount) {
|
|
|
764 |
/* fetch code */
|
|
|
765 |
while (nBits < codeLen) {
|
|
|
766 |
bits = (bits<<8) | *from++;
|
|
|
767 |
inCount--;
|
|
|
768 |
nBits += 8;
|
|
|
769 |
}
|
|
|
770 |
shift = nBits - codeLen;
|
|
|
771 |
code = (bits >> shift) & mask;
|
|
|
772 |
bits &= ~(mask << shift);
|
|
|
773 |
nBits -= codeLen;
|
|
|
774 |
if (code == 257) break;
|
|
|
775 |
if (code == 256) {
|
|
|
776 |
if (! inCount)
|
|
|
777 |
break;
|
|
|
778 |
|
|
|
779 |
/* free stuff */
|
|
|
780 |
while (scratchBuffer->prev) {
|
|
|
781 |
newBuffer = scratchBuffer;
|
|
|
782 |
scratchBuffer = scratchBuffer->prev;
|
|
|
783 |
free(newBuffer);
|
|
|
784 |
}
|
|
|
785 |
/* reset everything */
|
|
|
786 |
scratchPtr = scratchBuffer->chars + 256;
|
|
|
787 |
nScratch = sizeof(scratchBuffer->chars) - 256;
|
|
|
788 |
codeLen = 9;
|
|
|
789 |
nextCode = 258;
|
|
|
790 |
mask = 0x1FF;
|
|
|
791 |
/* fetch code */
|
|
|
792 |
while (nBits < codeLen) {
|
|
|
793 |
bits = (bits<<8) | *from++;
|
|
|
794 |
inCount--;
|
|
|
795 |
nBits += 8;
|
|
|
796 |
}
|
|
|
797 |
shift = nBits - codeLen;
|
|
|
798 |
code = (bits >> shift) & mask;
|
|
|
799 |
bits &= ~(mask << shift);
|
|
|
800 |
nBits -= codeLen;
|
|
|
801 |
if (code == 257) break;
|
|
|
802 |
/* add to output */
|
|
|
803 |
*to++ = code;
|
|
|
804 |
oldCode = code;
|
|
|
805 |
} else {
|
|
|
806 |
if (code < nextCode) {
|
|
|
807 |
/* writeString(string[code]) */
|
|
|
808 |
len = stringLen[code];
|
|
|
809 |
bcopy(strings[code], to, len);
|
|
|
810 |
to += len;
|
|
|
811 |
|
|
|
812 |
/* add( string[oldcode] + first(string[code]) ) */
|
|
|
813 |
len = stringLen[oldCode] + 1;
|
|
|
814 |
if (nScratch < len) {
|
|
|
815 |
newBuffer = (struct buffer *)malloc(sizeof(struct buffer));
|
|
|
816 |
newBuffer->prev = scratchBuffer;
|
|
|
817 |
scratchBuffer = newBuffer;
|
|
|
818 |
scratchPtr = scratchBuffer->chars;
|
|
|
819 |
nScratch = sizeof(scratchBuffer->chars);
|
|
|
820 |
}
|
|
|
821 |
stringLen[nextCode] = len;
|
|
|
822 |
strings[nextCode] = scratchPtr;
|
|
|
823 |
bcopy(strings[oldCode], scratchPtr, len-1);
|
|
|
824 |
scratchPtr += len-1;
|
|
|
825 |
*scratchPtr++ = strings[code][0];
|
|
|
826 |
nScratch -= len;
|
|
|
827 |
} else {
|
|
|
828 |
/* writeString(string[oldCode] + first(string[oldCode]) ) */
|
|
|
829 |
len = stringLen[oldCode];
|
|
|
830 |
bcopy(strings[oldCode], to, len);
|
|
|
831 |
to += len;
|
|
|
832 |
*to++ = strings[oldCode][0];
|
|
|
833 |
|
|
|
834 |
/* add( string[oldcode] + first(string[oldCode]) ) */
|
|
|
835 |
len++;
|
|
|
836 |
if (nScratch < len) {
|
|
|
837 |
newBuffer = (struct buffer *)malloc(sizeof(struct buffer));
|
|
|
838 |
newBuffer->prev = scratchBuffer;
|
|
|
839 |
scratchBuffer = newBuffer;
|
|
|
840 |
scratchPtr = scratchBuffer->chars;
|
|
|
841 |
nScratch = sizeof(scratchBuffer->chars);
|
|
|
842 |
}
|
|
|
843 |
stringLen[nextCode] = len;
|
|
|
844 |
strings[nextCode] = scratchPtr;
|
|
|
845 |
bcopy(strings[oldCode], scratchPtr, len-1);
|
|
|
846 |
scratchPtr += len-1;
|
|
|
847 |
*scratchPtr++ = strings[oldCode][0];
|
|
|
848 |
nScratch -= len;
|
|
|
849 |
}
|
|
|
850 |
oldCode = code;
|
|
|
851 |
nextCode++;
|
|
|
852 |
if (nextCode >= 511)
|
|
|
853 |
if (nextCode == 511) {
|
|
|
854 |
codeLen = 10;
|
|
|
855 |
mask = 0x3FF;
|
|
|
856 |
} else if (nextCode >= 1023)
|
|
|
857 |
if (nextCode == 1023) {
|
|
|
858 |
codeLen = 11;
|
|
|
859 |
mask = 0x7FF;
|
|
|
860 |
} else
|
|
|
861 |
if (nextCode == 2047) {
|
|
|
862 |
codeLen = 12;
|
|
|
863 |
mask = 0xFFF;
|
|
|
864 |
}
|
|
|
865 |
}
|
|
|
866 |
}
|
|
|
867 |
/* free stuff */
|
|
|
868 |
while (scratchBuffer) {
|
|
|
869 |
newBuffer = scratchBuffer;
|
|
|
870 |
scratchBuffer = scratchBuffer->prev;
|
|
|
871 |
free(newBuffer);
|
|
|
872 |
}
|
|
|
873 |
}
|
|
|
874 |
|
|
|
875 |
/*
|
|
|
876 |
* delta decoding (TIFF predictor = 2)
|
|
|
877 |
*/
|
|
|
878 |
decodeDelta(bytes, width, height)
|
|
|
879 |
register unsigned char *bytes;
|
|
|
880 |
{
|
|
|
881 |
register w;
|
|
|
882 |
unsigned char r, g, b;
|
|
|
883 |
|
|
|
884 |
while (height--) {
|
|
|
885 |
r = g = b = 0;
|
|
|
886 |
for (w = width; w; w--) {
|
|
|
887 |
r += *bytes;
|
|
|
888 |
*bytes++ = r;
|
|
|
889 |
g += *bytes;
|
|
|
890 |
*bytes++ = g;
|
|
|
891 |
b += *bytes;
|
|
|
892 |
*bytes++ = b;
|
|
|
893 |
}
|
|
|
894 |
}
|
|
|
895 |
}
|
|
|
896 |
|
|
|
897 |
decodeGIF(from, to, inCount, initialCodeLen)
|
|
|
898 |
unsigned char *from;
|
|
|
899 |
unsigned char *to;
|
|
|
900 |
{
|
|
|
901 |
register unsigned code;
|
|
|
902 |
unsigned short prefix[4096];
|
|
|
903 |
unsigned short suffix[4096];
|
|
|
904 |
unsigned short outCode[4096];
|
|
|
905 |
int outCount;
|
|
|
906 |
unsigned maxCode, oldCode, fin, inCode, curCode;
|
|
|
907 |
register unsigned bits;
|
|
|
908 |
register int nBits, mask, shift;
|
|
|
909 |
int i;
|
|
|
910 |
int len;
|
|
|
911 |
int endCode, clearCode, freeCode;
|
|
|
912 |
int codeLen = initialCodeLen;
|
|
|
913 |
static int ranges[] = {0, 1, 2, 4,
|
|
|
914 |
8, 16, 32, 64,
|
|
|
915 |
128, 256, 512, 1024,
|
|
|
916 |
2048 };
|
|
|
917 |
|
|
|
918 |
clearCode = ranges[codeLen]; /* 256 */
|
|
|
919 |
endCode = clearCode + 1; /* 257 */
|
|
|
920 |
freeCode = clearCode + 2; /* 258 */
|
|
|
921 |
maxCode = clearCode << 1; /* 512 */
|
|
|
922 |
outCount = 0;
|
|
|
923 |
|
|
|
924 |
mask = maxCode - 1; /* 1FF */
|
|
|
925 |
nBits = 0;
|
|
|
926 |
bits = 0;
|
|
|
927 |
while (inCount) {
|
|
|
928 |
/* fetch code */
|
|
|
929 |
while (nBits < codeLen) {
|
|
|
930 |
bits = bits | (*from++ << nBits);
|
|
|
931 |
inCount--;
|
|
|
932 |
nBits += 8;
|
|
|
933 |
}
|
|
|
934 |
code = bits & mask;
|
|
|
935 |
bits >>= codeLen;
|
|
|
936 |
nBits -= codeLen;
|
|
|
937 |
if (code == endCode) break;
|
|
|
938 |
if (code == clearCode) {
|
|
|
939 |
if (! inCount)
|
|
|
940 |
break;
|
|
|
941 |
|
|
|
942 |
codeLen = initialCodeLen;
|
|
|
943 |
maxCode = clearCode<<1;
|
|
|
944 |
mask = maxCode - 1;
|
|
|
945 |
freeCode = clearCode + 2;
|
|
|
946 |
|
|
|
947 |
/* fetch code */
|
|
|
948 |
while (nBits < codeLen) {
|
|
|
949 |
bits = bits | (*from++ << nBits);
|
|
|
950 |
inCount--;
|
|
|
951 |
nBits += 8;
|
|
|
952 |
}
|
|
|
953 |
code = bits & mask;
|
|
|
954 |
bits >>= codeLen;
|
|
|
955 |
nBits -= codeLen;
|
|
|
956 |
if (code == endCode) break;
|
|
|
957 |
/* add to output */
|
|
|
958 |
*to++ = code;
|
|
|
959 |
oldCode = fin = curCode = code;
|
|
|
960 |
} else {
|
|
|
961 |
curCode = inCode = code;
|
|
|
962 |
if (curCode >= freeCode) {
|
|
|
963 |
curCode = oldCode;
|
|
|
964 |
outCode[outCount++] = fin;
|
|
|
965 |
}
|
|
|
966 |
|
|
|
967 |
while (curCode >= clearCode) {
|
|
|
968 |
if (outCount > 1024) {
|
|
|
969 |
return;
|
|
|
970 |
}
|
|
|
971 |
outCode[outCount++] = suffix[curCode];
|
|
|
972 |
curCode = prefix[curCode];
|
|
|
973 |
}
|
|
|
974 |
|
|
|
975 |
fin = curCode;
|
|
|
976 |
outCode[outCount++] = fin;
|
|
|
977 |
|
|
|
978 |
for (i = outCount - 1; i >= 0; i--)
|
|
|
979 |
*to++ = outCode[i];
|
|
|
980 |
outCount = 0;
|
|
|
981 |
|
|
|
982 |
prefix[freeCode] = oldCode;
|
|
|
983 |
suffix[freeCode] = fin;
|
|
|
984 |
oldCode = inCode;
|
|
|
985 |
|
|
|
986 |
freeCode++;
|
|
|
987 |
if (freeCode >= maxCode) {
|
|
|
988 |
if (codeLen < 12) {
|
|
|
989 |
codeLen++;
|
|
|
990 |
maxCode *= 2;
|
|
|
991 |
mask = (1 << codeLen) - 1;
|
|
|
992 |
}
|
|
|
993 |
}
|
|
|
994 |
}
|
|
|
995 |
}
|
|
|
996 |
}
|
|
|
997 |
|
|
|
998 |
%}
|