190 |
s->head[s->ins_h] = static_cast<Pos>(str)) |
<> |
190 |
s->head[s->ins_h] = (Pos)(str)) |
|
195 |
s->head[s->ins_h] = static_cast<Pos>(str)) |
<> |
195 |
s->head[s->ins_h] = (Pos)(str)) |
|
342 |
// Line to stop compiler warning about unused mandatory global variable |
<> |
342 |
// Line to stop compiler warning about unused mandatory global variable 'deflate_copyright' |
343 |
char __z=deflate_copyright[0]; __z=__z; |
|
343 |
char dontCare = deflate_copyright[0]; dontCare = dontCare; |
|
1446 |
//Call UPDATE_HASH() MIN_MATCH-3 more times |
<> |
1446 |
Call UPDATE_HASH() MIN_MATCH-3 more times |
|
1633 |
//Call UPDATE_HASH() MIN_MATCH-3 more times |
<> |
1633 |
Call UPDATE_HASH() MIN_MATCH-3 more times |
243 |
s->bi_buf = static_cast<ush>(val >> (Buf_size - s->bi_valid));\ |
<> |
243 |
s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\ |
|
630 |
//next_code[bits] = code = (code + bl_count[bits-1]) << 1; |
<> |
630 |
next_code[bits] = code = (code + bl_count[bits-1]) << 1; |
631 |
next_code[bits] = code = static_cast<ush>((code + bl_count[bits-1]) << 1); |
|
|
|
|
644 |
//tree[n].Code = bi_reverse(next_code[len]++, len); |
<> |
643 |
tree[n].Code = bi_reverse(next_code[len]++, len); |
645 |
tree[n].Code = static_cast<ush>(bi_reverse(next_code[len]++, len)); |
|
|
|
|
721 |
//tree[node].Freq = tree[n].Freq + tree[m].Freq; |
<> |
719 |
tree[node].Freq = tree[n].Freq + tree[m].Freq; |
722 |
tree[node].Freq = static_cast<ush>(tree[n].Freq + tree[m].Freq); |
|
|
|
|
778 |
//s->bl_tree[curlen].Freq += count; |
<> |
775 |
s->bl_tree[curlen].Freq += count; |
779 |
s->bl_tree[curlen].Freq = static_cast<ush>(s->bl_tree[curlen].Freq + count); |
|
|
|