-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
GBPTreeRecoveryTest.java
427 lines (380 loc) · 14.9 KB
/
GBPTreeRecoveryTest.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
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
/*
* Copyright (c) 2002-2017 "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.gbptree;
import org.apache.commons.lang3.mutable.MutableLong;
import org.junit.Rule;
import org.junit.Test;
import org.junit.rules.RuleChain;
import java.io.File;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.TreeMap;
import org.neo4j.cursor.RawCursor;
import org.neo4j.index.Hit;
import org.neo4j.index.Index;
import org.neo4j.index.IndexWriter;
import org.neo4j.index.ValueMerger;
import org.neo4j.io.pagecache.IOLimiter;
import org.neo4j.io.pagecache.PageCache;
import org.neo4j.io.pagecache.PageSwapperFactory;
import org.neo4j.io.pagecache.impl.SingleFilePageSwapperFactory;
import org.neo4j.io.pagecache.impl.muninn.MuninnPageCache;
import org.neo4j.test.rule.RandomRule;
import org.neo4j.test.rule.TestDirectory;
import org.neo4j.test.rule.fs.EphemeralFileSystemRule;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;
import static org.neo4j.index.gbptree.GBPTree.NO_MONITOR;
import static org.neo4j.index.gbptree.ThrowingRunnable.throwing;
import static org.neo4j.io.pagecache.IOLimiter.unlimited;
import static org.neo4j.io.pagecache.tracing.PageCacheTracer.NULL;
public class GBPTreeRecoveryTest
{
private static final int PAGE_SIZE = 256;
private static final Action CHECKPOINT = ( index, forRecovery ) ->
{
if ( !forRecovery )
{
index.checkpoint( unlimited() );
}
};
private final RandomRule random = new RandomRule();
private final EphemeralFileSystemRule fs = new EphemeralFileSystemRule();
private final TestDirectory directory = TestDirectory.testDirectory( getClass(), fs.get() );
@Rule
public RuleChain ruleChain = RuleChain.outerRule( random ).around( fs ).around( directory );
private final MutableLong key = new MutableLong();
private final MutableLong value = new MutableLong();
@Test
public void shouldRecoverFromCrashBeforeFirstCheckpoint() throws Exception
{
// GIVEN
// a tree with only small amount of data that has not yet seen checkpoint from outside
File file = directory.file( "index" );
{
PageCache pageCache = createPageCache();
GBPTree<MutableLong,MutableLong> index = createIndex( pageCache, file );
IndexWriter<MutableLong,MutableLong> writer = index.writer();
key.setValue( 1L );
value.setValue( 10L );
writer.put( key, value );
pageCache.flushAndForce();
fs.snapshot( throwing( () ->
{
writer.close();
index.close();
pageCache.close();
} ) );
}
// WHEN
try ( PageCache pageCache = createPageCache();
GBPTree<MutableLong,MutableLong> index = createIndex( pageCache, file ) )
{
// this is the mimic:ed recovery
index.prepareForRecovery();
try ( IndexWriter<MutableLong,MutableLong> writer = index.writer() )
{
writer.put( key, value );
}
// THEN
// we should end up with a consistent index
index.consistencyCheck();
// ... containing all the stuff load says
try ( RawCursor<Hit<MutableLong,MutableLong>,IOException> cursor =
index.seek( new MutableLong( Long.MIN_VALUE ), new MutableLong( Long.MAX_VALUE ) ) )
{
assertTrue( cursor.next() );
Hit<MutableLong,MutableLong> hit = cursor.get();
assertEquals( key.getValue(), hit.key().getValue() );
assertEquals( value.getValue(), hit.value().getValue() );
}
}
}
@Test
public void shouldRecoverFromAnythingReplayExactFromCheckpoint() throws Exception
{
doShouldRecoverFromAnything( true );
}
@Test
public void shouldRecoverFromAnythingReplayFromBeforeLastCheckpoint() throws Exception
{
doShouldRecoverFromAnything( false );
}
private void doShouldRecoverFromAnything( boolean replayRecoveryExactlyFromCheckpoint ) throws Exception
{
// GIVEN
// a tree which has had random updates and checkpoints in it, load generated with specific seed
File file = directory.file( "index" );
List<Action> load = generateLoad();
int lastCheckPointIndex = indexOfLastCheckpoint( load );
{
// _,_,_,_,_,_,_,c,_,_,_,_,_,_,_,_,_,_,_,_,_,_,_,_,c,_,_,_,_,_,_,_,_,_,_,_
// ^ ^
// | |------------ crash flush index
// |-------------------------- last checkpoint index
//
PageCache pageCache = createPageCache();
GBPTree<MutableLong,MutableLong> index = createIndex( pageCache, file );
// Execute all actions up to and including last checkpoint ...
execute( load.subList( 0, lastCheckPointIndex + 1 ), index, false );
// ... a random amount of the remaining "unsafe" actions ...
int numberOfRemainingActions = load.size() - lastCheckPointIndex - 1;
int crashFlushIndex = lastCheckPointIndex + random.nextInt( numberOfRemainingActions ) + 1;
execute( load.subList( lastCheckPointIndex + 1, crashFlushIndex ), index, false );
// ... flush ...
pageCache.flushAndForce();
// ... execute the remaining actions
execute( load.subList( crashFlushIndex, load.size() ), index, false );
// ... and finally crash
fs.snapshot( throwing( () ->
{
index.close();
pageCache.close();
} ) );
}
// WHEN doing recovery
List<Action> recoveryActions;
if ( replayRecoveryExactlyFromCheckpoint )
{
recoveryActions = load.subList( lastCheckPointIndex + 1, load.size() );
}
else
{
recoveryActions = load.subList( random.nextInt( lastCheckPointIndex ), load.size() );
}
// first crashing during recovery
int numberOfCrashesDuringRecovery = random.intBetween( 0, 3 );
for ( int i = 0; i < numberOfCrashesDuringRecovery; i++ )
{
PageCache pageCache = createPageCache();
GBPTree<MutableLong,MutableLong> index = createIndex( pageCache, file );
int numberOfActionsToRecoverBeforeCrashing = random.intBetween( 1, recoveryActions.size() );
recover( recoveryActions.subList( 0, numberOfActionsToRecoverBeforeCrashing ), index );
pageCache.flushAndForce();
fs.snapshot( throwing( () ->
{
index.close();
pageCache.close();
} ) );
}
// to finally apply all actions after last checkpoint and verify tree
try ( PageCache pageCache = createPageCache();
GBPTree<MutableLong,MutableLong> index = createIndex( pageCache, file ) )
{
recover( recoveryActions, index );
// THEN
// we should end up with a consistent index containing all the stuff load says
index.consistencyCheck();
long[/*key,value,key,value...*/] aggregate = expectedSortedAggregatedDataFromGeneratedLoad( load );
try ( RawCursor<Hit<MutableLong,MutableLong>,IOException> cursor =
index.seek( new MutableLong( Long.MIN_VALUE ), new MutableLong( Long.MAX_VALUE ) ) )
{
for ( int i = 0; i < aggregate.length; )
{
assertTrue( cursor.next() );
Hit<MutableLong,MutableLong> hit = cursor.get();
assertEquals( aggregate[i++], hit.key().longValue() );
assertEquals( aggregate[i++], hit.value().longValue() );
}
assertFalse( cursor.next() );
}
}
}
private void recover( List<Action> load, GBPTree<MutableLong,MutableLong> index ) throws IOException
{
index.prepareForRecovery();
execute( load, index, true );
}
private static void execute( List<Action> load, Index<MutableLong,MutableLong> index, boolean forRecovery )
throws IOException
{
for ( Action action : load )
{
action.execute( index, forRecovery );
}
}
private static long[] expectedSortedAggregatedDataFromGeneratedLoad( List<Action> load ) throws IOException
{
CapturingIndex index = new CapturingIndex();
execute( load, index, false );
@SuppressWarnings( "unchecked" )
Map.Entry<Long,Long>[] entries = index.map.entrySet().toArray( new Map.Entry[index.map.size()] );
long[] result = new long[entries.length * 2];
for ( int i = 0, c = 0; i < entries.length; i++ )
{
result[c++] = entries[i].getKey().longValue();
result[c++] = entries[i].getValue().longValue();
}
return result;
}
private static int indexOfLastCheckpoint( List<Action> actions )
{
int i = 0;
int lastCheckpoint = -1;
for ( Action action : actions )
{
if ( action == CHECKPOINT )
{
lastCheckpoint = i;
}
i++;
}
return lastCheckpoint;
}
private List<Action> generateLoad()
{
List<Action> actions = new ArrayList<>();
int count = random.intBetween( 300, 1_000 );
boolean hasCheckPoint = false;
for ( int i = 0; i < count; i++ )
{
Action action = randomAction( true );
actions.add( action );
if ( action == CHECKPOINT )
{
hasCheckPoint = true;
}
}
// Guarantee that there's at least one check point, i.e. if there's none then append one at the end
if ( !hasCheckPoint )
{
actions.add( CHECKPOINT );
}
// Guarantee that there are at least some non-checkpoint actions after last checkpoint
if ( actions.get( actions.size() - 1 ) == CHECKPOINT )
{
int additional = random.intBetween( 1, 10 );
for ( int i = 0; i < additional; i++ )
{
actions.add( randomAction( false ) );
}
}
return actions;
}
private Action randomAction( boolean allowCheckPoint )
{
float randomized = random.nextFloat();
if ( randomized <= 0.7 )
{
// put
long[] data = modificationData( 30, 200 );
return ( index, forRecovery ) ->
{
try ( IndexWriter<MutableLong,MutableLong> writer = index.writer() )
{
for ( int i = 0; i < data.length; )
{
key.setValue( data[i++] );
value.setValue( data[i++] );
writer.put( key, value );
}
}
};
}
else if ( randomized <= 0.95 || !allowCheckPoint )
{
// remove
long[] data = modificationData( 5, 20 );
return ( index, forRecovery ) ->
{
try ( IndexWriter<MutableLong,MutableLong> writer = index.writer() )
{
for ( int i = 0; i < data.length; )
{
key.setValue( data[i++] );
i++; // value
writer.remove( key );
}
}
};
}
else
{
return CHECKPOINT;
}
}
private long[] modificationData( int min, int max )
{
int count = random.intBetween( min, max );
long[] data = new long[count * 2];
for ( int i = 0, c = 0; i < count; i++ )
{
data[c++] = random.intBetween( 0, 1_000_000 ); // key
data[c++] = random.intBetween( 0, 1_000_000 ); // value
}
return data;
}
private static GBPTree<MutableLong,MutableLong> createIndex( PageCache pageCache, File file ) throws IOException
{
return new GBPTree<>( pageCache, file, new SimpleLongLayout(), 0, NO_MONITOR );
}
private PageCache createPageCache()
{
PageSwapperFactory swapper = new SingleFilePageSwapperFactory();
swapper.setFileSystemAbstraction( fs.get() );
return new MuninnPageCache( swapper, 4_000, PAGE_SIZE, NULL );
}
interface Action
{
void execute( Index<MutableLong,MutableLong> index, boolean forRecovery ) throws IOException;
}
private static class CapturingIndex implements Index<MutableLong,MutableLong>, IndexWriter<MutableLong,MutableLong>
{
private final TreeMap<Long,Long> map = new TreeMap<>();
@Override
public void close() throws IOException
{ // no
}
@Override
public RawCursor<Hit<MutableLong,MutableLong>,IOException> seek( MutableLong fromInclusive,
MutableLong toExclusive ) throws IOException
{
throw new UnsupportedOperationException();
}
@Override
public IndexWriter<MutableLong,MutableLong> writer() throws IOException
{
return this;
}
@Override
public void checkpoint( IOLimiter ioLimiter ) throws IOException
{
}
@Override
public void put( MutableLong key, MutableLong value ) throws IOException
{
map.put( key.getValue(), value.getValue() );
}
@Override
public void merge( MutableLong key, MutableLong value, ValueMerger<MutableLong> valueMerger ) throws IOException
{
throw new UnsupportedOperationException();
}
@Override
public MutableLong remove( MutableLong key ) throws IOException
{
Long value = map.remove( key.getValue() );
return value == null ? null : new MutableLong( value );
}
}
}