dany/libwebp
1
0
Fork 0
mirror of https://github.com/webmproject/libwebp.git synced 2024-12-27 22:28:22 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

lossless: Remove unaligned read warning

Browse Source 
(typecast uint32 pointer to uint64).
The proposed change is little (0.05%) slower but avoids uint32 to uint64
pointer conversion.

Change-Id: I6b8828077ea1324fabd04bfa7e7439e324776250
This commit is contained in:
Vikas Arora 2014-07-02 20:39:47 +00:00 committed by James Zern
parent b8b596f6c3
commit 516971b136
1 changed files with 3 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/enc/backward_references.c
View File

@ -265,10 +265,8 @@ static int HashChainFindCopy(const VP8LHashChain* const p,
uint64_t val; uint64_t val;
uint32_t curr_length; uint32_t curr_length;
uint32_t distance; uint32_t distance;
const uint64_t* const ptr1 = const uint32_t* const ptr1 = (argb + pos + best_length - 1);
(const uint64_t*)(argb + pos + best_length - 1); const uint32_t* const ptr2 = (argb_start + best_length - 1);
const uint64_t* const ptr2 =
(const uint64_t*)(argb_start + best_length - 1);
if (iter_pos < 0) { if (iter_pos < 0) {
if (iter_pos < iter_limit || best_val >= 0xff0000) { if (iter_pos < iter_limit || best_val >= 0xff0000) {
@ -279,7 +277,7 @@ static int HashChainFindCopy(const VP8LHashChain* const p,
// Before 'expensive' linear match, check if the two arrays match at the // Before 'expensive' linear match, check if the two arrays match at the
// current best length index and also for the succeeding elements. // current best length index and also for the succeeding elements.
if (*ptr1 != *ptr2) continue; if (ptr1[0] != ptr2[0] || ptr1[1] != ptr2[1]) continue;
curr_length = FindMatchLength(argb + pos, argb_start, max_len); curr_length = FindMatchLength(argb + pos, argb_start, max_len);
if (curr_length < best_length) continue; if (curr_length < best_length) continue;