[go: up one dir, main page]

Menu

[r1130]: / src / hash.h  Maximize  Restore  History

Download this file

104 lines (83 with data), 3.0 kB

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
/*
Protector -- a UCI chess engine
Copyright (C) 2009-2010 Raimund Heid (Raimund_Heid@yahoo.com)
This program 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.
This program 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 _hash_h_
#define _hash_h_
#include "protector.h"
#include "position.h"
/**
* Define the size of the specified hashtable.
*
* @param size the size of the hashtable in bytes
*/
void setHashtableSize(Hashtable * hashtable, UINT64 size);
/**
* Initialize the specified hashtable. Call this function exactly once
* for every hashtable before using it.
*/
void resetNodetable(void);
void initializeHashtable(Hashtable * hashtable);
bool isPrimeNumber(UINT64 n);
UINT64 getNextPrime(UINT64 n);
UINT64 getPreviousPrime(UINT64 n);
UINT64 getHashIndex(Hashtable * hashtable, UINT64 key);
/**
* Reset the specified hashtable. Call this function in order to
* erase all stored data.
*/
void resetHashtable(Hashtable * hashtable);
/**
* Increment the date of the specified hashtable.
*/
void incrementDate(Hashtable * hashtable);
/**
* Construct a hashentry from the given values.
*/
Hashentry constructHashEntry(UINT64 key, INT16 value, INT16 staticValue,
UINT8 importance, UINT16 bestMove, UINT8 date,
UINT8 flag);
/**
* Put the specified entry into the hashtable.
*/
void setHashentry(Hashtable * hashtable, UINT64 key, INT16 value,
UINT8 importance, UINT16 bestMove, UINT8 flag,
INT16 staticValue);
/**
* Get the entry specified by key.
*/
Hashentry *getHashentry(Hashtable * hashtable, UINT64 key);
UINT64 getNodeIndex(UINT64 key);
INT16 getHashentryValue(const Hashentry * entry);
UINT8 getHashentryImportance(const Hashentry * entry);
UINT16 getHashentryMove(const Hashentry * entry);
UINT8 getHashentryDate(const Hashentry * entry);
UINT8 getHashentryFlag(const Hashentry * entry);
UINT64 getHashentryKey(const Hashentry * entry);
INT16 getHashentryStaticValue(const Hashentry * entry);
bool nodeIsInUse(UINT64 key, UINT8 depth);
bool setNodeUsage(UINT64 key, UINT8 depth);
void resetNodeUsage(UINT64 key, UINT8 depth);
/**
* Initialize this module.
*
* @return 0 if no errors occurred.
*/
int initializeModuleHash(void);
/**
* Test this module.
*
* @return 0 if all tests succeed.
*/
int testModuleHash(void);
#endif