blob: b1f583e9021d6e03652a19205a30e0a24bfbb94b (
plain)
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
|
/*
This file is part of ctak.
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 ctak. If not, see <https://www.gnu.org/licenses/>.
*/
#include "tt.h"
#include <string.h>
// ===================================================================
// Variables
// ===================================================================
static tt_entry_t table[TT_SIZE + 1];
static uint16_t tt_gen = 0;
// ===================================================================
// Exported functions
// ===================================================================
int tt_init(void) {
tt_gen++;
if (tt_gen == 0)
memset(table, 0, sizeof(table));
return EXIT_SUCCESS;
}
tt_entry_t *tt_seek(const uint64_t key) {
tt_entry_t *e = &table[key & TT_SIZE];
if (e->gen == tt_gen && e->key == key)
return e;
return NULL;
}
int tt_insert(const uint64_t key, const enum TT_FLAG flag,
const uint8_t depth, const float value,
const action_t action) {
tt_entry_t *e = &table[key & TT_SIZE];
// Replacement scheme: keep a stale-but-deeper entry over a shallower new one.
if (e->gen == tt_gen && e->depth > depth)
return EXIT_SUCCESS;
e->key = key;
e->value = value;
e->action = action;
e->gen = tt_gen;
e->flag = flag;
e->depth = depth;
return EXIT_SUCCESS;
}
|
