lib/libz/deflate.c

1358

ds->d_buf = (ushf *)(ds->pending_buf + (ds->lit_bufsize << 1));

lib/libz/deflate.c

1405

ush scan_start = *(ushf*)scan;

lib/libz/deflate.c

1406

ush scan_end = *(ushf*)(scan + best_len - 1);

lib/libz/deflate.c

1446

if (*(ushf*)(match + best_len - 1) != scan_end ||

lib/libz/deflate.c

1447

*(ushf*)match != scan_start) continue;

lib/libz/deflate.c

1461

} while (*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&

lib/libz/deflate.c

1462

*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&

lib/libz/deflate.c

1463

*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&

lib/libz/deflate.c

1464

*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&

lib/libz/deflate.c

1515

scan_end = *(ushf*)(scan + best_len - 1);

lib/libz/deflate.c

512

s->d_buf = (ushf *)(s->pending_buf + (s->lit_bufsize << 1));

lib/libz/deflate.h

224

ushf *d_buf; /* buffer for distances */

lib/libz/trees.c

201

local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {

sys/lib/libz/deflate.c

1358

ds->d_buf = (ushf *)(ds->pending_buf + (ds->lit_bufsize << 1));

sys/lib/libz/deflate.c

1405

ush scan_start = *(ushf*)scan;

sys/lib/libz/deflate.c

1406

ush scan_end = *(ushf*)(scan + best_len - 1);

sys/lib/libz/deflate.c

1446

if (*(ushf*)(match + best_len - 1) != scan_end ||

sys/lib/libz/deflate.c

1447

*(ushf*)match != scan_start) continue;

sys/lib/libz/deflate.c

1461

} while (*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&

sys/lib/libz/deflate.c

1462

*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&

sys/lib/libz/deflate.c

1463

*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&

sys/lib/libz/deflate.c

1464

*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&

sys/lib/libz/deflate.c

1515

scan_end = *(ushf*)(scan + best_len - 1);

sys/lib/libz/deflate.c

512

s->d_buf = (ushf *)(s->pending_buf + (s->lit_bufsize << 1));

sys/lib/libz/deflate.h

224

ushf *d_buf; /* buffer for distances */

sys/lib/libz/trees.c

201

local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {