-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
NativeSchemaIndexPopulator.java
367 lines (328 loc) · 12.6 KB
/
NativeSchemaIndexPopulator.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
/*
* 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.kernel.impl.index.schema;
import java.io.File;
import java.io.IOException;
import java.nio.charset.StandardCharsets;
import java.util.ArrayList;
import java.util.Collection;
import java.util.concurrent.ExecutionException;
import org.neo4j.concurrent.Work;
import org.neo4j.concurrent.WorkSync;
import org.neo4j.index.internal.gbptree.GBPTree;
import org.neo4j.index.internal.gbptree.Layout;
import org.neo4j.index.internal.gbptree.RecoveryCleanupWorkCollector;
import org.neo4j.index.internal.gbptree.Writer;
import org.neo4j.io.fs.FileSystemAbstraction;
import org.neo4j.io.pagecache.IOLimiter;
import org.neo4j.io.pagecache.PageCache;
import org.neo4j.kernel.api.exceptions.index.IndexEntryConflictException;
import org.neo4j.kernel.api.index.IndexEntryUpdate;
import org.neo4j.kernel.api.index.IndexPopulator;
import org.neo4j.kernel.api.index.IndexUpdater;
import org.neo4j.kernel.api.index.PropertyAccessor;
import org.neo4j.kernel.api.index.SchemaIndexProvider;
import org.neo4j.kernel.api.schema.index.IndexDescriptor;
import org.neo4j.kernel.impl.api.index.sampling.DefaultNonUniqueIndexSampler;
import org.neo4j.kernel.impl.api.index.sampling.IndexSamplingConfig;
import org.neo4j.kernel.impl.api.index.sampling.NonUniqueIndexSampler;
import org.neo4j.kernel.impl.api.index.sampling.UniqueIndexSampler;
import org.neo4j.storageengine.api.schema.IndexReader;
import org.neo4j.storageengine.api.schema.IndexSample;
import static org.neo4j.index.internal.gbptree.GBPTree.NO_HEADER_WRITER;
import static org.neo4j.kernel.api.schema.index.IndexDescriptor.Type.GENERAL;
import static org.neo4j.kernel.api.schema.index.IndexDescriptor.Type.UNIQUE;
/**
* {@link IndexPopulator} backed by a {@link GBPTree}.
*
* @param <KEY> type of {@link NativeSchemaKey}.
* @param <VALUE> type of {@link NativeSchemaValue}.
*/
abstract class NativeSchemaIndexPopulator<KEY extends NativeSchemaKey, VALUE extends NativeSchemaValue>
extends NativeSchemaIndex<KEY,VALUE> implements IndexPopulator
{
static final byte BYTE_FAILED = 0;
static final byte BYTE_ONLINE = 1;
static final byte BYTE_POPULATING = 2;
private final KEY treeKey;
private final VALUE treeValue;
private final UniqueIndexSampler uniqueSampler;
private final NonUniqueIndexSampler nonUniqueSampler;
final IndexSamplingConfig samplingConfig;
private WorkSync<IndexUpdateApply<KEY,VALUE>,IndexUpdateWork<KEY,VALUE>> additionsWorkSync;
private WorkSync<IndexUpdateApply<KEY,VALUE>,IndexUpdateWork<KEY,VALUE>> updatesWorkSync;
private byte[] failureBytes;
private boolean dropped;
NativeSchemaIndexPopulator( PageCache pageCache, FileSystemAbstraction fs, File storeFile, Layout<KEY,VALUE> layout,
SchemaIndexProvider.Monitor monitor, IndexDescriptor descriptor, long indexId, IndexSamplingConfig samplingConfig )
{
super( pageCache, fs, storeFile, layout, monitor, descriptor, indexId );
this.treeKey = layout.newKey();
this.treeValue = layout.newValue();
this.samplingConfig = samplingConfig;
switch ( descriptor.type() )
{
case GENERAL:
uniqueSampler = null;
nonUniqueSampler = new DefaultNonUniqueIndexSampler( samplingConfig.sampleSizeLimit() );
break;
case UNIQUE:
uniqueSampler = new UniqueIndexSampler();
nonUniqueSampler = null;
break;
default:
throw new IllegalArgumentException( "Unexpected index type " + descriptor.type() );
}
}
public void clear() throws IOException
{
gbpTreeFileUtil.deleteFileIfPresent( storeFile );
}
@Override
public synchronized void create() throws IOException
{
gbpTreeFileUtil.deleteFileIfPresent( storeFile );
instantiateTree( RecoveryCleanupWorkCollector.IMMEDIATE, new NativeSchemaIndexHeaderWriter( BYTE_POPULATING ) );
// true: tree uniqueness is (value,entityId)
// false: tree uniqueness is (value) <-- i.e. more strict
boolean compareIds = descriptor.type() == GENERAL;
additionsWorkSync = new WorkSync<>( new IndexUpdateApply<>( tree, treeKey, treeValue, new ConflictDetectingValueMerger<>( compareIds ) ) );
// for updates we have to have uniqueness on (value,entityId) to allow for intermediary violating updates.
// there are added conflict checks after updates have been applied.
updatesWorkSync = new WorkSync<>( new IndexUpdateApply<>( tree, treeKey, treeValue, new ConflictDetectingValueMerger<>( true ) ) );
}
@Override
public synchronized void drop() throws IOException
{
try
{
closeTree();
gbpTreeFileUtil.deleteFileIfPresent( storeFile );
}
finally
{
dropped = true;
}
}
@Override
public void add( Collection<? extends IndexEntryUpdate<?>> updates ) throws IOException, IndexEntryConflictException
{
applyWithWorkSync( additionsWorkSync, updates );
}
@Override
public void verifyDeferredConstraints( PropertyAccessor propertyAccessor )
{
// No-op, uniqueness is checked for each update in add(IndexEntryUpdate)
}
@Override
public IndexUpdater newPopulatingUpdater( PropertyAccessor accessor )
{
IndexUpdater updater = new IndexUpdater()
{
private boolean closed;
private final Collection<IndexEntryUpdate<?>> updates = new ArrayList<>();
@Override
public void process( IndexEntryUpdate<?> update )
{
assertOpen();
updates.add( update );
}
@Override
public void close() throws IOException, IndexEntryConflictException
{
applyWithWorkSync( updatesWorkSync, updates );
closed = true;
}
private void assertOpen()
{
if ( closed )
{
throw new IllegalStateException( "Updater has been closed" );
}
}
};
if ( descriptor.type() == UNIQUE )
{
// The index population detects conflicts on the fly, however for updates coming in we're in a position
// where we cannot detect conflicts while applying, but instead afterwards.
updater = new DeferredConflictCheckingIndexUpdater( updater, this::newReader, descriptor );
}
return updater;
}
abstract IndexReader newReader();
@Override
public synchronized void close( boolean populationCompletedSuccessfully ) throws IOException
{
if ( populationCompletedSuccessfully && failureBytes != null )
{
throw new IllegalStateException( "Can't mark index as online after it has been marked as failure" );
}
try
{
if ( populationCompletedSuccessfully )
{
assertPopulatorOpen();
markTreeAsOnline();
}
else
{
assertNotDropped();
ensureTreeInstantiated();
markTreeAsFailed();
}
}
finally
{
closeTree();
}
}
private void applyWithWorkSync( WorkSync<IndexUpdateApply<KEY,VALUE>,IndexUpdateWork<KEY,VALUE>> workSync,
Collection<? extends IndexEntryUpdate<?>> updates ) throws IOException, IndexEntryConflictException
{
try
{
workSync.apply( new IndexUpdateWork<>( updates ) );
}
catch ( ExecutionException e )
{
Throwable cause = e.getCause();
if ( cause instanceof IOException )
{
throw (IOException) cause;
}
if ( cause instanceof IndexEntryConflictException )
{
throw (IndexEntryConflictException) cause;
}
throw new IOException( cause );
}
}
private void assertNotDropped()
{
if ( dropped )
{
throw new IllegalStateException( "Populator has already been dropped." );
}
}
@Override
public void markAsFailed( String failure )
{
failureBytes = failure.getBytes( StandardCharsets.UTF_8 );
}
private void ensureTreeInstantiated() throws IOException
{
if ( tree == null )
{
instantiateTree( RecoveryCleanupWorkCollector.IGNORE, NO_HEADER_WRITER );
}
}
private void assertPopulatorOpen()
{
if ( tree == null )
{
throw new IllegalStateException( "Populator has already been closed." );
}
}
private void markTreeAsFailed() throws IOException
{
if ( failureBytes == null )
{
failureBytes = new byte[0];
}
tree.checkpoint( IOLimiter.unlimited(), new FailureHeaderWriter( failureBytes ) );
}
private void markTreeAsOnline() throws IOException
{
tree.checkpoint( IOLimiter.unlimited(), pc -> pc.putByte( BYTE_ONLINE ) );
}
static class IndexUpdateApply<KEY extends NativeSchemaKey, VALUE extends NativeSchemaValue>
{
private final GBPTree<KEY,VALUE> tree;
private final KEY treeKey;
private final VALUE treeValue;
private final ConflictDetectingValueMerger<KEY,VALUE> conflictDetectingValueMerger;
IndexUpdateApply( GBPTree<KEY,VALUE> tree, KEY treeKey, VALUE treeValue, ConflictDetectingValueMerger<KEY,VALUE> conflictDetectingValueMerger )
{
this.tree = tree;
this.treeKey = treeKey;
this.treeValue = treeValue;
this.conflictDetectingValueMerger = conflictDetectingValueMerger;
}
void process( Iterable<? extends IndexEntryUpdate<?>> indexEntryUpdates ) throws Exception
{
try ( Writer<KEY,VALUE> writer = tree.writer() )
{
for ( IndexEntryUpdate<?> indexEntryUpdate : indexEntryUpdates )
{
NativeSchemaIndexUpdater.processUpdate( treeKey, treeValue, indexEntryUpdate, writer, conflictDetectingValueMerger );
}
}
}
}
static class IndexUpdateWork<KEY extends NativeSchemaKey, VALUE extends NativeSchemaValue>
implements Work<IndexUpdateApply<KEY,VALUE>,IndexUpdateWork<KEY,VALUE>>
{
private final Collection<? extends IndexEntryUpdate<?>> updates;
IndexUpdateWork( Collection<? extends IndexEntryUpdate<?>> updates )
{
this.updates = updates;
}
@Override
public IndexUpdateWork<KEY,VALUE> combine( IndexUpdateWork work )
{
ArrayList<IndexEntryUpdate<?>> combined = new ArrayList<>( updates );
combined.addAll( work.updates );
return new IndexUpdateWork<>( combined );
}
@Override
public void apply( IndexUpdateApply<KEY,VALUE> indexUpdateApply ) throws Exception
{
indexUpdateApply.process( updates );
}
}
@Override
public void includeSample( IndexEntryUpdate<?> update )
{
switch ( descriptor.type() )
{
case GENERAL:
nonUniqueSampler.include( SamplingUtil.encodedStringValuesForSampling( (Object[]) update.values() ) );
break;
case UNIQUE:
uniqueSampler.increment( 1 );
break;
default:
throw new IllegalArgumentException( "Unexpected index type " + descriptor.type() );
}
}
@Override
public IndexSample sampleResult()
{
switch ( descriptor.type() )
{
case GENERAL:
return nonUniqueSampler.result();
case UNIQUE:
return uniqueSampler.result();
default:
throw new IllegalArgumentException( "Unexpected index type " + descriptor.type() );
}
}
}