-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
GenerationSafePointerTest.java
355 lines (312 loc) · 9.86 KB
/
GenerationSafePointerTest.java
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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
/*
* Copyright (c) 2002-2018 "Neo Technology,"
* Network Engine for Objects in Lund AB [http://neotechnology.com]
*
* This file is part of Neo4j.
*
* Neo4j 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/>.
*/
package org.neo4j.index.internal.gbptree;
import org.junit.Rule;
import org.junit.Test;
import org.neo4j.io.pagecache.ByteArrayPageCursor;
import org.neo4j.io.pagecache.PageCursor;
import org.neo4j.test.rule.RandomRule;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;
import static org.junit.Assert.fail;
public class GenerationSafePointerTest
{
private static final int PAGE_SIZE = GenerationSafePointer.SIZE * 2;
private final PageCursor cursor = ByteArrayPageCursor.wrap( new byte[PAGE_SIZE] );
private final GSP read = new GSP();
@Rule
public final RandomRule random = new RandomRule();
@Test
public void shouldWriteAndReadGsp() throws Exception
{
// GIVEN
int offset = 3;
GSP expected = gsp( 10, 110 );
// WHEN
write( cursor, offset, expected );
// THEN
boolean matches = read( cursor, offset, read );
assertTrue( matches );
assertEquals( expected, read );
}
@Test
public void shouldReadGspWithZeroValues() throws Exception
{
// GIVEN
int offset = 3;
GSP expected = gsp( 0, 0 );
// THEN
boolean matches = read( cursor, offset, read );
assertTrue( matches );
assertEquals( expected, read );
}
@Test
public void shouldDetectInvalidChecksumOnReadDueToChangedGeneration() throws Exception
{
// GIVEN
int offset = 0;
GSP initial = gsp( 123, 456 );
write( cursor, offset, initial );
// WHEN
cursor.putInt( offset, (int) (initial.generation + 5) );
// THEN
boolean matches = read( cursor, offset, read );
assertFalse( matches );
}
@Test
public void shouldDetectInvalidChecksumOnReadDueToChangedChecksum() throws Exception
{
// GIVEN
int offset = 0;
GSP initial = gsp( 123, 456 );
write( cursor, offset, initial );
// WHEN
cursor.putShort( offset + GenerationSafePointer.SIZE - GenerationSafePointer.CHECKSUM_SIZE,
(short) (checksumOf( initial ) - 2) );
// THEN
boolean matches = read( cursor, offset, read );
assertFalse( matches );
}
@Test
public void shouldWriteAndReadGspCloseToGenerationMax() throws Exception
{
// GIVEN
long generation = GenerationSafePointer.MAX_GENERATION;
GSP expected = gsp( generation, 12345 );
write( cursor, 0, expected );
// WHEN
GSP read = new GSP();
boolean matches = read( cursor, 0, read );
// THEN
assertTrue( matches );
assertEquals( expected, read );
assertEquals( generation, read.generation );
}
@Test
public void shouldWriteAndReadGspCloseToPointerMax() throws Exception
{
// GIVEN
long pointer = GenerationSafePointer.MAX_POINTER;
GSP expected = gsp( 12345, pointer );
write( cursor, 0, expected );
// WHEN
GSP read = new GSP();
boolean matches = read( cursor, 0, read );
// THEN
assertTrue( matches );
assertEquals( expected, read );
assertEquals( pointer, read.pointer );
}
@Test
public void shouldWriteAndReadGspCloseToGenerationAndPointerMax() throws Exception
{
// GIVEN
long generation = GenerationSafePointer.MAX_GENERATION;
long pointer = GenerationSafePointer.MAX_POINTER;
GSP expected = gsp( generation, pointer );
write( cursor, 0, expected );
// WHEN
GSP read = new GSP();
boolean matches = read( cursor, 0, read );
// THEN
assertTrue( matches );
assertEquals( expected, read );
assertEquals( generation, read.generation );
assertEquals( pointer, read.pointer );
}
@Test
public void shouldThrowIfPointerToLarge() throws Exception
{
// GIVEN
long generation = GenerationSafePointer.MIN_GENERATION;
long pointer = GenerationSafePointer.MAX_POINTER + 1;
GSP broken = gsp( generation, pointer );
// WHEN
try
{
write( cursor, 0, broken );
fail( "Expected to throw" );
}
catch ( IllegalArgumentException e )
{
// THEN
// good
}
}
@Test
public void shouldThrowIfPointerToSmall() throws Exception
{
// GIVEN
long generation = GenerationSafePointer.MIN_GENERATION;
long pointer = GenerationSafePointer.MIN_POINTER - 1;
GSP broken = gsp( generation, pointer );
// WHEN
try
{
write( cursor, 0, broken );
fail( "Expected to throw" );
}
catch ( IllegalArgumentException e )
{
// THEN
// good
}
}
@Test
public void shouldThrowIfGenerationToLarge() throws Exception
{
// GIVEN
long generation = GenerationSafePointer.MAX_GENERATION + 1;
long pointer = GenerationSafePointer.MIN_POINTER;
GSP broken = gsp( generation, pointer );
// WHEN
try
{
write( cursor, 0, broken );
fail( "Expected to throw" );
}
catch ( IllegalArgumentException e )
{
// THEN
// good
}
}
@Test
public void shouldThrowIfGenerationToSmall() throws Exception
{
// GIVEN
long generation = GenerationSafePointer.MIN_GENERATION - 1;
long pointer = GenerationSafePointer.MIN_POINTER;
GSP broken = gsp( generation, pointer );
// WHEN
try
{
write( cursor, 0, broken );
fail( "Expected to throw" );
}
catch ( IllegalArgumentException e )
{
// THEN
// good
}
}
@Test
public void shouldHaveLowAccidentalChecksumCollision() throws Exception
{
// GIVEN
int count = 100_000;
// WHEN
GSP gsp = new GSP();
int collisions = 0;
short reference = 0;
for ( int i = 0; i < count; i++ )
{
gsp.generation = random.nextLong( GenerationSafePointer.MAX_GENERATION );
gsp.pointer = random.nextLong( GenerationSafePointer.MAX_POINTER );
short checksum = checksumOf( gsp );
if ( i == 0 )
{
reference = checksum;
}
else
{
boolean unique = checksum != reference;
collisions += unique ? 0 : 1;
}
}
// THEN
assertTrue( (double) collisions / count < 0.0001 );
}
private GSP gsp( long generation, long pointer )
{
GSP gsp = new GSP();
gsp.generation = generation;
gsp.pointer = pointer;
return gsp;
}
private boolean read( PageCursor cursor, int offset, GSP into )
{
cursor.setOffset( offset );
into.generation = GenerationSafePointer.readGeneration( cursor );
into.pointer = GenerationSafePointer.readPointer( cursor );
return GenerationSafePointer.verifyChecksum( cursor, into.generation, into.pointer );
}
private void write( PageCursor cursor, int offset, GSP gsp )
{
cursor.setOffset( offset );
GenerationSafePointer.write( cursor, gsp.generation, gsp.pointer );
}
private static short checksumOf( GSP gsp )
{
return GenerationSafePointer.checksumOf( gsp.generation, gsp.pointer );
}
/**
* Data for a GSP, i.e. generation and pointer. Checksum is generated from those two fields and
* so isn't a field in this struct - ahem class. The reason this class exists is that we, when reading,
* want to read two fields and a checksum and match the two fields with the checksum. This class
* is designed to be mutable and should be reused in as many places as possible.
*/
private static class GSP
{
long generation; // unsigned int
long pointer;
@Override
public int hashCode()
{
final int prime = 31;
int result = 1;
result = prime * result + (int) (generation ^ (generation >>> 32));
result = prime * result + (int) (pointer ^ (pointer >>> 32));
return result;
}
@Override
public boolean equals( Object obj )
{
if ( this == obj )
{
return true;
}
if ( obj == null )
{
return false;
}
if ( getClass() != obj.getClass() )
{
return false;
}
GSP other = (GSP) obj;
if ( generation != other.generation )
{
return false;
}
if ( pointer != other.pointer )
{
return false;
}
return true;
}
@Override
public String toString()
{
return "[generation:" + generation + ",p:" + pointer + "]";
}
}
}