Home
last modified time | relevance | path

Searched refs:Assert (Results 1 – 3 of 3) sorted by relevance

/lib/zlib_deflate/
Ddeftree.c186 Assert(length > 0 && length <= 15, "invalid length"); in send_bits()
246 Assert (length == 256, "tr_static_init: length != 256"); in tr_static_init()
261 Assert (dist == 256, "tr_static_init: dist != 256"); in tr_static_init()
269 Assert (dist == 256, "tr_static_init: 256+dist != 512"); in tr_static_init()
515 Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1, in gen_codes()
700 Assert(count >= 3 && count <= 6, " 3_6?"); in send_tree()
769 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
770 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()
900 Assert(buf != (char*)0, "lost buf");
952 Assert (s->compressed_len == s->bits_sent, "bad compressed size");
[all …]
Ddeflate.c448 Assert(strm->avail_out > 0, "bug2"); in zlib_deflate()
589 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); in longest_match()
600 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); in longest_match()
603 Assert(cur_match < s->strstart, "no future"); in longest_match()
625 Assert(scan[2] == match[2], "scan[2]?"); in longest_match()
636 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); in longest_match()
656 Assert(*scan == *match, "match[2]?"); in longest_match()
668 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); in longest_match()
803 Assert(more >= 2, "more < 2"); in fill_window()
873 Assert(s->strstart < s->w_size+MAX_DIST(s) || in deflate_stored()
[all …]
Ddefutil.h4 #define Assert(err, str) macro