Assert
Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
Assert(cur_match < s->strstart, "no future");
Assert(scan[2] == match[2], "scan[2]?");
Assert(scan <= s->window + (unsigned)(s->window_size - 1),
Assert(*scan == *match, "match[2]?");
Assert(scan <= s->window + (unsigned)(s->window_size - 1),
Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
Assert(cur_match < s->strstart, "no future");
Assert(*scan == *match, "match[2]?");
Assert(scan <= s->window + (unsigned)(s->window_size - 1), "wild scan");
Assert (flush != Z_NO_FLUSH, "no flush?");
Assert(scan <= s->window + (uInt)(s->window_size - 1),
Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead");
Assert(more >= 2, "more < 2");
Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
Assert(buf != (char*)0, "lost buf");
Assert (s->compressed_len == s->bits_sent, "bad compressed size");
Assert((ush)dist < (ush)MAX_DIST(s) &&
Assert (code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
Assert(length > 0 && length <= 15, "invalid length");
Assert (length == 256, "tr_static_init: length != 256");
Assert (dist == 256, "tr_static_init: dist != 256");
Assert (dist == 256, "tr_static_init: 256 + dist != 512");
Assert (header != NULL, "Can't open trees.h");
Assert(count >= 3 && count <= 6, " 3_6?");
Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
Assert (code < D_CODES, "bad d_code");
Assert(s->pending < 2 * (s->lit_bufsize + sx), "pendingBuf overflow");
Assert(s->pending < s->lit_bufsize + sx, "pendingBuf overflow");
Assert(0, "zcfree: ptr not found");
Assert(output[0] < 64);
Assert(output[1] < 64);
Assert(output[2] < 64);
Assert(output[3] < 64);
Assert(output[0] < 64);
Assert(output[1] < 64);
Assert(output[2] < 64);
Assert(strm->avail_out > 0, "bug2");
Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
Assert(cur_match < s->strstart, "no future");
Assert(scan[2] == match[2], "scan[2]?");
Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
Assert(*scan == *match, "match[2]?");
Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
Assert(cur_match < s->strstart, "no future");
Assert(*scan == *match, "match[2]?");
Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
Assert(more >= 2, "more < 2");
Assert(s->strstart < s->w_size+MAX_DIST(s) ||
Assert(s->block_start >= 0L, "block gone");
Assert (flush != Z_NO_FLUSH, "no flush?");
Assert(length > 0 && length <= 15, "invalid length");
Assert (length == 256, "tr_static_init: length != 256");
Assert (dist == 256, "tr_static_init: dist != 256");
Assert (dist == 256, "tr_static_init: 256+dist != 512");
Assert (header != NULL, "Can't open trees.h");
Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
Assert(count >= 3 && count <= 6, " 3_6?");
Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
Assert(buf != (char*)0, "lost buf");
Assert (s->compressed_len == s->bits_sent, "bad compressed size");
Assert((ush)dist < (ush)MAX_DIST(s) &&
Assert (code < D_CODES, "bad d_code");
Assert(s->pending < s->lit_bufsize + 2*lx, "pendingBuf overflow");
Assert(k < 16, "inflate_codes grabbed too many bytes")
Assert(0, "zcfree: ptr not found");