mirror of
https://github.com/sockspls/badfish
synced 2025-05-01 01:03:09 +00:00
3ac75cd27d
`speedtest [threads] [hash_MiB] [time_s]`. `threads` default to system concurrency. `hash_MiB` defaults to `threads*128`. `time_s` defaults to 150.
Intended to be used with default parameters, as a stable hardware benchmark.
Example:
```
C:\dev\stockfish-master\src>stockfish.exe speedtest
Stockfish dev-20240928-nogit by the Stockfish developers (see AUTHORS file)
info string Using 16 threads
Warmup position 3/3
Position 258/258
===========================
Version : Stockfish dev-20240928-nogit
Compiled by : g++ (GNUC) 13.2.0 on MinGW64
Compilation architecture : x86-64-vnni256
Compilation settings : 64bit VNNI BMI2 AVX2 SSE41 SSSE3 SSE2 POPCNT
Compiler __VERSION__ macro : 13.2.0
Large pages : yes
User invocation : speedtest
Filled invocation : speedtest 16 2048 150
Available processors : 0-15
Thread count : 16
Thread binding : none
TT size [MiB] : 2048
Hash max, avg [per mille] :
single search : 40, 21
single game : 631, 428
Total nodes searched : 2099917842
Total search time [s] : 153.937
Nodes/second : 13641410
```
-------------------------------
Small unrelated tweaks:
- Network verification output is now handled as a callback.
- TT hashfull queries allow specifying maximum entry age.
closes https://github.com/official-stockfish/Stockfish/pull/5354
No functional change
98 lines
3.4 KiB
C++
98 lines
3.4 KiB
C++
/*
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
Copyright (C) 2004-2024 The Stockfish developers (see AUTHORS file)
|
|
|
|
Stockfish is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
Stockfish is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#ifndef TT_H_INCLUDED
|
|
#define TT_H_INCLUDED
|
|
|
|
#include <cstddef>
|
|
#include <cstdint>
|
|
#include <tuple>
|
|
|
|
#include "memory.h"
|
|
#include "types.h"
|
|
|
|
namespace Stockfish {
|
|
|
|
class ThreadPool;
|
|
struct TTEntry;
|
|
struct Cluster;
|
|
|
|
// There is only one global hash table for the engine and all its threads. For chess in particular, we even allow racy
|
|
// updates between threads to and from the TT, as taking the time to synchronize access would cost thinking time and
|
|
// thus elo. As a hash table, collisions are possible and may cause chess playing issues (bizarre blunders, faulty mate
|
|
// reports, etc). Fixing these also loses elo; however such risk decreases quickly with larger TT size.
|
|
//
|
|
// `probe` is the primary method: given a board position, we lookup its entry in the table, and return a tuple of:
|
|
// 1) whether the entry already has this position
|
|
// 2) a copy of the prior data (if any) (may be inconsistent due to read races)
|
|
// 3) a writer object to this entry
|
|
// The copied data and the writer are separated to maintain clear boundaries between local vs global objects.
|
|
|
|
|
|
// A copy of the data already in the entry (possibly collided). `probe` may be racy, resulting in inconsistent data.
|
|
struct TTData {
|
|
Move move;
|
|
Value value, eval;
|
|
Depth depth;
|
|
Bound bound;
|
|
bool is_pv;
|
|
};
|
|
|
|
|
|
// This is used to make racy writes to the global TT.
|
|
struct TTWriter {
|
|
public:
|
|
void write(Key k, Value v, bool pv, Bound b, Depth d, Move m, Value ev, uint8_t generation8);
|
|
|
|
private:
|
|
friend class TranspositionTable;
|
|
TTEntry* entry;
|
|
TTWriter(TTEntry* tte);
|
|
};
|
|
|
|
|
|
class TranspositionTable {
|
|
|
|
public:
|
|
~TranspositionTable() { aligned_large_pages_free(table); }
|
|
|
|
void resize(size_t mbSize, ThreadPool& threads); // Set TT size
|
|
void clear(ThreadPool& threads); // Re-initialize memory, multithreaded
|
|
int hashfull(int maxAge = 0)
|
|
const; // Approximate what fraction of entries (permille) have been written to during this root search
|
|
|
|
void
|
|
new_search(); // This must be called at the beginning of each root search to track entry aging
|
|
uint8_t generation() const; // The current age, used when writing new data to the TT
|
|
std::tuple<bool, TTData, TTWriter>
|
|
probe(const Key key) const; // The main method, whose retvals separate local vs global objects
|
|
TTEntry* first_entry(const Key key)
|
|
const; // This is the hash function; its only external use is memory prefetching.
|
|
|
|
private:
|
|
friend struct TTEntry;
|
|
|
|
size_t clusterCount;
|
|
Cluster* table = nullptr;
|
|
|
|
uint8_t generation8 = 0; // Size must be not bigger than TTEntry::genBound8
|
|
};
|
|
|
|
} // namespace Stockfish
|
|
|
|
#endif // #ifndef TT_H_INCLUDED
|