n64: use xxh3 instead of crc32 for rsp cache
This is a significantly faster and stronger algorithm than crc32
このコミットが含まれているのは:
コミット
9985c693bd
35
LICENSE
35
LICENSE
|
@ -146,3 +146,38 @@ If you redistribute modified sources, we would appreciate that you include in
|
|||
the file ChangeLog history information documenting your changes. Please read
|
||||
the FAQ for more information on the distribution of modified source versions.
|
||||
----------------------------------------------------------------------
|
||||
|
||||
----------------------------------------------------------------------
|
||||
|
||||
xxHash - Extremely Fast Hash algorithm
|
||||
Header File
|
||||
Copyright (C) 2012-2021 Yann Collet
|
||||
|
||||
BSD 2-Clause License (https://www.opensource.org/licenses/bsd-license.php)
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are
|
||||
met:
|
||||
|
||||
* Redistributions of source code must retain the above copyright
|
||||
notice, this list of conditions and the following disclaimer.
|
||||
* Redistributions in binary form must reproduce the above
|
||||
copyright notice, this list of conditions and the following disclaimer
|
||||
in the documentation and/or other materials provided with the
|
||||
distribution.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
You can contact the author at:
|
||||
- xxHash homepage: https://www.xxhash.com
|
||||
- xxHash source repository: https://github.com/Cyan4973/xxHash
|
||||
|
|
|
@ -1,6 +1,8 @@
|
|||
#pragma once
|
||||
//started: 2020-04-28
|
||||
|
||||
#define XXH_INLINE_ALL
|
||||
#include <xxhash.h>
|
||||
#include <ares/ares.hpp>
|
||||
#include <nall/hashset.hpp>
|
||||
#include <nall/recompiler/generic/generic.hpp>
|
||||
|
|
|
@ -1,14 +1,11 @@
|
|||
auto RSP::Recompiler::pool(u32 address) -> Pool* {
|
||||
if(context[address >> 8]) return context[address >> 8];
|
||||
|
||||
nall::Hash::CRC32 hashcode;
|
||||
for(u32 offset : range(256)) {
|
||||
hashcode.input(self.imem.read<Byte>(address + offset));
|
||||
}
|
||||
auto hashcode = XXH3_64bits(self.imem.data + address, 256);
|
||||
|
||||
PoolHashPair pair;
|
||||
pair.pool = (Pool*)allocator.acquire();
|
||||
pair.hashcode = hashcode.value();
|
||||
pair.hashcode = hashcode;
|
||||
|
||||
auto result = pools[address >> 8].find(pair);
|
||||
if(result) {
|
||||
|
|
ファイル差分が大きすぎるため省略します
差分を読み込み
読み込み中…
新しいイシューから参照