blob: a709fc60c48916d67b8064486962514c2fe2dcff (
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
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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
|
/**
Copyright (c) Scott Gasch
Module Name:
testhash.c
Abstract:
Test of the main hash table code.
Author:
Scott Gasch ([email protected]) 19 Oct 2004
Revision History:
**/
#ifdef TEST
#include "chess.h"
extern UCHAR g_cDirty;
#define CONVERT_HASH_DEPTH_TO_SEARCH_DEPTH(x) \
ASSERT(((x) & 0xffffff00) == 0); \
(x) <<= 4
FLAG
SanityCheckHashEntry(HASH_ENTRY *p)
/**
Routine description:
Make sure a hash table entry looks valid.
Parameters:
HASH_ENTRY *p
Return value:
FLAG
**/
{
ULONG uDepth;
if (p->u64Sig == 0)
{
if ((p->mv.uMove != 0) ||
(p->uDepth != 0) ||
(p->bvFlags != 0) ||
(p->iValue != 0))
{
ASSERT(FALSE);
return(FALSE);
}
}
else
{
uDepth = p->uDepth;
CONVERT_HASH_DEPTH_TO_SEARCH_DEPTH(uDepth);
if (!IS_VALID_DEPTH(uDepth))
{
ASSERT(FALSE);
return(FALSE);
}
switch(p->bvFlags & HASH_FLAG_VALID_BOUNDS)
{
case HASH_FLAG_LOWER:
case HASH_FLAG_UPPER:
break;
case HASH_FLAG_EXACT:
if (p->mv.uMove == 0)
{
ASSERT(FALSE);
return(FALSE);
}
break;
default:
ASSERT(FALSE);
return(FALSE);
}
}
return(TRUE);
}
void
AnalyzeFullHashTable(void)
/**
Routine description:
Walk over the hash table and validate populated entries.
Parameters:
void
Return value:
void
**/
{
ULONG uEntry;
ULONG uLine;
ULONG uNumEntries = g_uHashTableSizeBytes / sizeof(HASH_ENTRY);
HASH_ENTRY *p;
ULONG uEmpty = 0;
ULONG uStale = 0;
ULONG uUnique = 0;
ULONG uCount = 0;
ULONG u;
double d;
FLAG fUnique;
uLine = 0;
for (uEntry = 0;
uEntry < uNumEntries;
uEntry++)
{
if ((uEntry % NUM_HASH_ENTRIES_PER_LINE) == 0)
{
uLine++;
}
p = &(g_pHashTable[uEntry]);
//
// See if it's stale
//
if ((p->bvFlags & 0xF0) != g_cDirty)
{
uStale++;
}
//
// Sanity checks
//
if (FALSE == SanityCheckHashEntry(p))
{
UtilPanic(TESTCASE_FAILURE,
NULL, "TestHash", NULL, NULL,
__FILE__, __LINE__);
}
//
// See if it's empty
//
if (p->u64Sig == 0)
{
uEmpty++;
}
else
{
uCount++;
//
// See if it's unique
//
if (uEntry % NUM_HASH_ENTRIES_PER_LINE)
{
fUnique = TRUE;
u = uEntry - 1;
do
{
if (p->u64Sig == g_pHashTable[u].u64Sig)
{
fUnique = FALSE;
break;
}
u--;
}
while(u % NUM_HASH_ENTRIES_PER_LINE);
}
else
{
fUnique = TRUE;
}
uUnique += fUnique;
}
}
//
// Show results
//
Trace("There are %u entries in the hash table.\n", uNumEntries);
d = (double)uStale / (double)uNumEntries * 100.0;
Trace("The hash table is %6.3f percent stale.\n", d);
d = (double)uEmpty / (double)uNumEntries * 100.0;
Trace("The hash table is %6.3f percent empty.\n", d);
d = (double)uUnique / (double)uCount * 100.0;
Trace("The hash table is %6.3f percent unique.\n", d);
}
#endif
|
