250 |
|
|
251 |
/* Special case for KwKwK string. */ |
/* Special case for KwKwK string. */ |
252 |
if (code >= free_ent) { |
if (code >= free_ent) { |
253 |
*stackp++ = finchar; |
*stackp++ = (unsigned char)finchar; |
254 |
code = oldcode; |
code = oldcode; |
255 |
} |
} |
256 |
|
|
259 |
*stackp++ = tab_suffixof(code); |
*stackp++ = tab_suffixof(code); |
260 |
code = tab_prefixof(code); |
code = tab_prefixof(code); |
261 |
} |
} |
262 |
*stackp++ = finchar = tab_suffixof(code); |
*stackp++ = (unsigned char)(finchar = tab_suffixof(code)); |
263 |
|
|
264 |
/* And put them out in forward order. */ |
/* And put them out in forward order. */ |
265 |
middle: |
middle: |
277 |
/* Generate the new entry. */ |
/* Generate the new entry. */ |
278 |
if ((code = free_ent) < maxmaxcode) { |
if ((code = free_ent) < maxmaxcode) { |
279 |
tab_prefixof(code) = (unsigned short) oldcode; |
tab_prefixof(code) = (unsigned short) oldcode; |
280 |
tab_suffixof(code) = finchar; |
tab_suffixof(code) = (unsigned char) finchar; |
281 |
free_ent = code + 1; |
free_ent = code + 1; |
282 |
} |
} |
283 |
|
|
322 |
} |
} |
323 |
if ( zs->avail_in < (unsigned int)n_bits && in_count > (long)n_bits ) { |
if ( zs->avail_in < (unsigned int)n_bits && in_count > (long)n_bits ) { |
324 |
memcpy (buf, zs->next_in, zs->avail_in); |
memcpy (buf, zs->next_in, zs->avail_in); |
325 |
buf_len = zs->avail_in; |
buf_len = (unsigned char)zs->avail_in; |
326 |
zs->avail_in = 0; |
zs->avail_in = 0; |
327 |
return -1; |
return -1; |
328 |
} |
} |