summaryrefslogtreecommitdiff
path: root/src/common/hash.cpp
diff options
context:
space:
mode:
authorGravatar bunnei2015-02-20 11:41:30 -0500
committerGravatar bunnei2015-02-20 11:41:30 -0500
commit5f9939070e81691e04facca9ff431070988e5b05 (patch)
tree9bd54cdde2c34dd2f63e0396260335f267a46ce1 /src/common/hash.cpp
parentMerge pull request #587 from archshift/assert (diff)
parentMisc cleanup of common and related functions (diff)
downloadyuzu-5f9939070e81691e04facca9ff431070988e5b05.tar.gz
yuzu-5f9939070e81691e04facca9ff431070988e5b05.tar.xz
yuzu-5f9939070e81691e04facca9ff431070988e5b05.zip
Merge pull request #588 from archshift/somebranch
Sweeping cleanup of Common
Diffstat (limited to 'src/common/hash.cpp')
-rw-r--r--src/common/hash.cpp13
1 files changed, 7 insertions, 6 deletions
diff --git a/src/common/hash.cpp b/src/common/hash.cpp
index fe2c9e636..0624dab8d 100644
--- a/src/common/hash.cpp
+++ b/src/common/hash.cpp
@@ -2,6 +2,7 @@
2// Licensed under GPLv2 or any later version 2// Licensed under GPLv2 or any later version
3// Refer to the license.txt file included. 3// Refer to the license.txt file included.
4 4
5#include <algorithm>
5 6
6#include "common/hash.h" 7#include "common/hash.h"
7#if _M_SSE >= 0x402 8#if _M_SSE >= 0x402
@@ -155,7 +156,7 @@ u64 GetMurmurHash3(const u8 *src, int len, u32 samples)
155 const u8 * data = (const u8*)src; 156 const u8 * data = (const u8*)src;
156 const int nblocks = len / 16; 157 const int nblocks = len / 16;
157 u32 Step = (len / 8); 158 u32 Step = (len / 8);
158 if(samples == 0) samples = max(Step, 1u); 159 if(samples == 0) samples = std::max(Step, 1u);
159 Step = Step / samples; 160 Step = Step / samples;
160 if(Step < 1) Step = 1; 161 if(Step < 1) Step = 1;
161 162
@@ -233,7 +234,7 @@ u64 GetCRC32(const u8 *src, int len, u32 samples)
233 u32 Step = (len / 8); 234 u32 Step = (len / 8);
234 const u64 *data = (const u64 *)src; 235 const u64 *data = (const u64 *)src;
235 const u64 *end = data + Step; 236 const u64 *end = data + Step;
236 if(samples == 0) samples = max(Step, 1u); 237 if(samples == 0) samples = std::max(Step, 1u);
237 Step = Step / samples; 238 Step = Step / samples;
238 if(Step < 1) Step = 1; 239 if(Step < 1) Step = 1;
239 while(data < end) 240 while(data < end)
@@ -265,7 +266,7 @@ u64 GetHashHiresTexture(const u8 *src, int len, u32 samples)
265 u32 Step = (len / 8); 266 u32 Step = (len / 8);
266 const u64 *data = (const u64 *)src; 267 const u64 *data = (const u64 *)src;
267 const u64 *end = data + Step; 268 const u64 *end = data + Step;
268 if(samples == 0) samples = max(Step, 1u); 269 if(samples == 0) samples = std::max(Step, 1u);
269 Step = Step / samples; 270 Step = Step / samples;
270 if(Step < 1) Step = 1; 271 if(Step < 1) Step = 1;
271 while(data < end) 272 while(data < end)
@@ -308,7 +309,7 @@ u64 GetCRC32(const u8 *src, int len, u32 samples)
308 u32 Step = (len/4); 309 u32 Step = (len/4);
309 const u32 *data = (const u32 *)src; 310 const u32 *data = (const u32 *)src;
310 const u32 *end = data + Step; 311 const u32 *end = data + Step;
311 if(samples == 0) samples = max(Step, 1u); 312 if(samples == 0) samples = std::max(Step, 1u);
312 Step = Step / samples; 313 Step = Step / samples;
313 if(Step < 1) Step = 1; 314 if(Step < 1) Step = 1;
314 while(data < end) 315 while(data < end)
@@ -380,7 +381,7 @@ u64 GetMurmurHash3(const u8* src, int len, u32 samples)
380 u32 out[2]; 381 u32 out[2];
381 const int nblocks = len / 8; 382 const int nblocks = len / 8;
382 u32 Step = (len / 4); 383 u32 Step = (len / 4);
383 if(samples == 0) samples = max(Step, 1u); 384 if(samples == 0) samples = std::max(Step, 1u);
384 Step = Step / samples; 385 Step = Step / samples;
385 if(Step < 1) Step = 1; 386 if(Step < 1) Step = 1;
386 387
@@ -456,7 +457,7 @@ u64 GetHashHiresTexture(const u8 *src, int len, u32 samples)
456 u32 Step = (len / 8); 457 u32 Step = (len / 8);
457 const u64 *data = (const u64 *)src; 458 const u64 *data = (const u64 *)src;
458 const u64 *end = data + Step; 459 const u64 *end = data + Step;
459 if(samples == 0) samples = max(Step, 1u); 460 if(samples == 0) samples = std::max(Step, 1u);
460 Step = Step / samples; 461 Step = Step / samples;
461 if(Step < 1) Step = 1; 462 if(Step < 1) Step = 1;
462 while(data < end) 463 while(data < end)