mirrors/zlib
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Avoid implicit conversion warnings in deflate.c and trees.c.

Browse Source
This commit is contained in:
Levi Broderick 2023-08-30 10:50:57 -07:00 committed by Mark Adler
parent df3b265064
commit 8a76f02e0e
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
deflate.c
View File

@ -1671,10 +1671,10 @@ local block_state deflate_stored(deflate_state *s, int flush) {
_tr_stored_block(s, (char *)0, 0L, last); _tr_stored_block(s, (char *)0, 0L, last);
/* Replace the lengths in the dummy stored block with len. */ /* Replace the lengths in the dummy stored block with len. */
s->pending_buf[s->pending - 4] = len; s->pending_buf[s->pending - 4] = (Bytef)len;
s->pending_buf[s->pending - 3] = len >> 8; s->pending_buf[s->pending - 3] = (Bytef)(len >> 8);
s->pending_buf[s->pending - 2] = ~len; s->pending_buf[s->pending - 2] = (Bytef)~len;
s->pending_buf[s->pending - 1] = ~len >> 8; s->pending_buf[s->pending - 1] = (Bytef)(~len >> 8);
/* Write the stored block header bytes. */ /* Write the stored block header bytes. */
flush_pending(s->strm); flush_pending(s->strm);

2
trees.c
View File

@ -724,7 +724,7 @@ local void scan_tree(deflate_state *s, ct_data *tree, int max_code) {
if (++count < max_count && curlen == nextlen) { if (++count < max_count && curlen == nextlen) {
continue; continue;
} else if (count < min_count) { } else if (count < min_count) {
s->bl_tree[curlen].Freq += count; s->bl_tree[curlen].Freq += (ush)count;
} else if (curlen != 0) { } else if (curlen != 0) {
if (curlen != prevlen) s->bl_tree[curlen].Freq++; if (curlen != prevlen) s->bl_tree[curlen].Freq++;
s->bl_tree[REP_3_6].Freq++; s->bl_tree[REP_3_6].Freq++;