File tree 1 file changed +8
-2
lines changed
1 file changed +8
-2
lines changed Original file line number Diff line number Diff line change @@ -575,7 +575,10 @@ tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_nex
575
575
{
576
576
mz_uint8 * p = r -> m_tables [0 ].m_code_size ; mz_uint i ;
577
577
r -> m_table_sizes [0 ] = 288 ; r -> m_table_sizes [1 ] = 32 ; TINFL_MEMSET (r -> m_tables [1 ].m_code_size , 5 , 32 );
578
- for ( i = 0 ; i <= 143 ; ++ i ) * p ++ = 8 ; for ( ; i <= 255 ; ++ i ) * p ++ = 9 ; for ( ; i <= 279 ; ++ i ) * p ++ = 7 ; for ( ; i <= 287 ; ++ i ) * p ++ = 8 ;
578
+ for ( i = 0 ; i <= 143 ; ++ i ) * p ++ = 8 ;
579
+ for ( ; i <= 255 ; ++ i ) * p ++ = 9 ;
580
+ for ( ; i <= 279 ; ++ i ) * p ++ = 7 ;
581
+ for ( ; i <= 287 ; ++ i ) * p ++ = 8 ;
579
582
}
580
583
else
581
584
{
@@ -1393,7 +1396,10 @@ static MZ_FORCEINLINE void tdefl_find_match(tdefl_compressor *d, mz_uint lookahe
1393
1396
if ((d->m_dict[probe_pos + match_len] == c0) && (d->m_dict[probe_pos + match_len - 1] == c1)) break;
1394
1397
TDEFL_PROBE ; TDEFL_PROBE ; TDEFL_PROBE ;
1395
1398
}
1396
- if (!dist ) break ; p = s ; q = d -> m_dict + probe_pos ; for (probe_len = 0 ; probe_len < max_match_len ; probe_len ++ ) if (* p ++ != * q ++ ) break ;
1399
+ if (!dist ) break ;
1400
+ p = s ; q = d -> m_dict + probe_pos ;
1401
+ for (probe_len = 0 ; probe_len < max_match_len ; probe_len ++ )
1402
+ if (* p ++ != * q ++ ) break ;
1397
1403
if (probe_len > match_len )
1398
1404
{
1399
1405
* pMatch_dist = dist ; if ((* pMatch_len = match_len = probe_len ) == max_match_len ) return ;
You can’t perform that action at this time.
0 commit comments