ushf
ds->d_buf = (ushf *)(ds->pending_buf + (ds->lit_bufsize << 1));
ush scan_start = *(ushf*)scan;
ush scan_end = *(ushf*)(scan + best_len - 1);
if (*(ushf*)(match + best_len - 1) != scan_end ||
*(ushf*)match != scan_start) continue;
} while (*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
scan_end = *(ushf*)(scan + best_len - 1);
s->d_buf = (ushf *)(s->pending_buf + (s->lit_bufsize << 1));
ushf *d_buf; /* buffer for distances */
local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {
ushf *overlay;
overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);
ush scan_start = *(ushf*)scan;
ush scan_end = *(ushf*)(scan+best_len-1);
if (*(ushf*)(match+best_len-1) != scan_end ||
*(ushf*)match != scan_start) continue;
} while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
scan_end = *(ushf*)(scan+best_len-1);
local void gen_codes(ct_data *tree, int max_code, ushf *bl_count);
ushf *bl_count) /* number of codes at each bit length */
ushf *d_buf;
ushf *overlay;
overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);