uch
unsigned char ch, uch;
uch = toupper(ch);
} else if (Word[i] == uch) {
Known[i] = uch;
uch depth[2*L_CODES+1];
extern uch ZLIB_INTERNAL _length_code[];
extern uch ZLIB_INTERNAL _dist_code[];
extern const uch ZLIB_INTERNAL _length_code[];
extern const uch ZLIB_INTERNAL _dist_code[];
{ uch cc = (c); \
{ uch len = (length); \
s->l_buf[s->last_lit++] = (uch)lc;
uch _length_code[MAX_MATCH-MIN_MATCH+1];
put_byte(s, (uch)((w) & 0xff)); \
put_byte(s, (uch)((ush)(w) >> 8)); \
_length_code[length++] = (uch)code;
_length_code[length-1] = (uch)code;
_dist_code[dist++] = (uch)code;
_dist_code[256 + dist++] = (uch)code;
s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
local const uch bl_order[BL_CODES]
uch _dist_code[DIST_CODE_LEN];
const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
const uch ZLIB_INTERNAL _dist_code[DIST_CODE_LEN] = {
typedef uch FAR uchf;
local uch bl_order[BL_CODES]
local uch dist_code[512];
local uch length_code[MAX_MATCH-MIN_MATCH+1];
put_byte(s, (uch)((w) & 0xff)); \
put_byte(s, (uch)((ush)(w) >> 8)); \
length_code[length++] = (uch)code;
length_code[length-1] = (uch)code;
dist_code[dist++] = (uch)code;
dist_code[256 + dist++] = (uch)code;
s->depth[node] = (uch) (MAX(s->depth[n], s->depth[m]) + 1);
s->l_buf[s->last_lit++] = (uch)lc;
uch depth[2*L_CODES+1];
*((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
typedef uch FAR uchf;
uch depth[2*L_CODES+1];
extern uch ZLIB_INTERNAL _length_code[];
extern uch ZLIB_INTERNAL _dist_code[];
extern const uch ZLIB_INTERNAL _length_code[];
extern const uch ZLIB_INTERNAL _dist_code[];
{ uch cc = (c); \
{ uch len = (length); \
s->l_buf[s->last_lit++] = (uch)lc;
uch _length_code[MAX_MATCH-MIN_MATCH+1];
put_byte(s, (uch)((w) & 0xff)); \
put_byte(s, (uch)((ush)(w) >> 8)); \
_length_code[length++] = (uch)code;
_length_code[length-1] = (uch)code;
_dist_code[dist++] = (uch)code;
_dist_code[256 + dist++] = (uch)code;
s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
local const uch bl_order[BL_CODES]
uch _dist_code[DIST_CODE_LEN];
const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
const uch ZLIB_INTERNAL _dist_code[DIST_CODE_LEN] = {
typedef uch FAR uchf;
uch depth[2*L_CODES+1];
extern uch ZLIB_INTERNAL _length_code[];
extern uch ZLIB_INTERNAL _dist_code[];
extern const uch ZLIB_INTERNAL _length_code[];
extern const uch ZLIB_INTERNAL _dist_code[];
{ uch cc = (c); \
{ uch len = (length); \
s->l_buf[s->last_lit++] = (uch)lc;
uch _length_code[MAX_MATCH-MIN_MATCH+1];
put_byte(s, (uch)((w) & 0xff)); \
put_byte(s, (uch)((ush)(w) >> 8)); \
_length_code[length++] = (uch)code;
_length_code[length-1] = (uch)code;
_dist_code[dist++] = (uch)code;
_dist_code[256 + dist++] = (uch)code;
s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
local const uch bl_order[BL_CODES]
uch _dist_code[DIST_CODE_LEN];
const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
const uch ZLIB_INTERNAL _dist_code[DIST_CODE_LEN] = {
typedef uch FAR uchf;