-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
ConsistencyCheckTasks.java
272 lines (254 loc) · 14.5 KB
/
ConsistencyCheckTasks.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
/*
* Copyright (c) 2002-2018 "Neo4j,"
* Neo4j Sweden AB [http://neo4j.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.consistency.checking.full;
import java.util.ArrayList;
import java.util.List;
import org.neo4j.consistency.RecordType;
import org.neo4j.consistency.checking.NodeRecordCheck;
import org.neo4j.consistency.checking.PropertyChain;
import org.neo4j.consistency.checking.RelationshipRecordCheck;
import org.neo4j.consistency.checking.SchemaRecordCheck;
import org.neo4j.consistency.checking.cache.CacheAccess;
import org.neo4j.consistency.checking.cache.CacheTask;
import org.neo4j.consistency.checking.index.IndexAccessors;
import org.neo4j.consistency.checking.index.IndexEntryProcessor;
import org.neo4j.consistency.checking.index.IndexIterator;
import org.neo4j.consistency.checking.labelscan.LabelScanCheck;
import org.neo4j.consistency.checking.labelscan.LabelScanDocumentProcessor;
import org.neo4j.consistency.report.ConsistencyReport;
import org.neo4j.consistency.report.ConsistencyReporter;
import org.neo4j.consistency.statistics.Statistics;
import org.neo4j.consistency.store.synthetic.IndexRecord;
import org.neo4j.consistency.store.synthetic.LabelScanIndex;
import org.neo4j.helpers.collection.BoundedIterable;
import org.neo4j.helpers.progress.ProgressMonitorFactory;
import org.neo4j.kernel.api.labelscan.LabelScanStore;
import org.neo4j.kernel.impl.index.labelscan.NativeLabelScanStore;
import org.neo4j.kernel.impl.store.RecordStore;
import org.neo4j.kernel.impl.store.Scanner;
import org.neo4j.kernel.impl.store.SchemaStorage;
import org.neo4j.kernel.impl.store.StoreAccess;
import org.neo4j.kernel.impl.store.record.AbstractBaseRecord;
import org.neo4j.kernel.api.schema.index.IndexDescriptor;
import static java.lang.String.format;
import static org.neo4j.consistency.checking.full.MultiPassStore.ARRAYS;
import static org.neo4j.consistency.checking.full.MultiPassStore.LABELS;
import static org.neo4j.consistency.checking.full.MultiPassStore.NODES;
import static org.neo4j.consistency.checking.full.MultiPassStore.PROPERTIES;
import static org.neo4j.consistency.checking.full.MultiPassStore.RELATIONSHIPS;
import static org.neo4j.consistency.checking.full.MultiPassStore.RELATIONSHIP_GROUPS;
import static org.neo4j.consistency.checking.full.MultiPassStore.STRINGS;
import static org.neo4j.consistency.checking.full.QueueDistribution.ROUND_ROBIN;
public class ConsistencyCheckTasks
{
private final ProgressMonitorFactory.MultiPartBuilder multiPartBuilder;
private final StoreProcessor defaultProcessor;
private final StoreAccess nativeStores;
private final Statistics statistics;
private final MultiPassStore.Factory multiPass;
private final ConsistencyReporter reporter;
private final LabelScanStore labelScanStore;
private final IndexAccessors indexes;
private final CacheAccess cacheAccess;
private final int numberOfThreads;
ConsistencyCheckTasks( ProgressMonitorFactory.MultiPartBuilder multiPartBuilder,
StoreProcessor defaultProcessor, StoreAccess nativeStores, Statistics statistics,
CacheAccess cacheAccess, LabelScanStore labelScanStore,
IndexAccessors indexes, MultiPassStore.Factory multiPass, ConsistencyReporter reporter, int numberOfThreads )
{
this.multiPartBuilder = multiPartBuilder;
this.defaultProcessor = defaultProcessor;
this.nativeStores = nativeStores;
this.statistics = statistics;
this.cacheAccess = cacheAccess;
this.multiPass = multiPass;
this.reporter = reporter;
this.labelScanStore = labelScanStore;
this.indexes = indexes;
this.numberOfThreads = numberOfThreads;
}
public List<ConsistencyCheckerTask> createTasksForFullCheck( boolean checkLabelScanStore, boolean checkIndexes,
boolean checkGraph )
{
List<ConsistencyCheckerTask> tasks = new ArrayList<>();
if ( checkGraph )
{
MandatoryProperties mandatoryProperties = new MandatoryProperties( nativeStores );
StoreProcessor processor =
multiPass.processor( CheckStage.Stage1_NS_PropsLabels, PROPERTIES );
tasks.add( create( CheckStage.Stage1_NS_PropsLabels.name(), nativeStores.getNodeStore(),
processor, ROUND_ROBIN ) );
//ReltionshipStore pass - check label counts using cached labels, check properties, skip nodes and relationships
processor = multiPass.processor( CheckStage.Stage2_RS_Labels, LABELS );
multiPass.reDecorateRelationship( processor, RelationshipRecordCheck.relationshipRecordCheckForwardPass() );
tasks.add( create( CheckStage.Stage2_RS_Labels.name(), nativeStores.getRelationshipStore(),
processor, ROUND_ROBIN ) );
//NodeStore pass - just cache nextRel and inUse
tasks.add( new CacheTask.CacheNextRel( CheckStage.Stage3_NS_NextRel, cacheAccess,
Scanner.scan( nativeStores.getNodeStore() ) ) );
//RelationshipStore pass - check nodes inUse, FirstInFirst, FirstInSecond using cached info
processor = multiPass.processor( CheckStage.Stage4_RS_NextRel, NODES );
multiPass.reDecorateRelationship( processor, RelationshipRecordCheck.relationshipRecordCheckBackwardPass(
new PropertyChain<>( mandatoryProperties.forRelationships( reporter ) ) ) );
tasks.add( create( CheckStage.Stage4_RS_NextRel.name(), nativeStores.getRelationshipStore(),
processor, ROUND_ROBIN ) );
//NodeStore pass - just cache nextRel and inUse
multiPass.reDecorateNode( processor, NodeRecordCheck.toCheckNextRel(), true );
multiPass.reDecorateNode( processor, NodeRecordCheck.toCheckNextRelationshipGroup(), false );
tasks.add( new CacheTask.CheckNextRel( CheckStage.Stage5_Check_NextRel, cacheAccess, nativeStores, processor ) );
// source chain
//RelationshipStore pass - forward scan of source chain using the cache.
processor = multiPass.processor( CheckStage.Stage6_RS_Forward, RELATIONSHIPS );
multiPass.reDecorateRelationship( processor,
RelationshipRecordCheck.relationshipRecordCheckSourceChain() );
tasks.add( create( CheckStage.Stage6_RS_Forward.name(), nativeStores.getRelationshipStore(),
processor, QueueDistribution.RELATIONSHIPS ) );
//RelationshipStore pass - reverse scan of source chain using the cache.
processor = multiPass.processor( CheckStage.Stage7_RS_Backward, RELATIONSHIPS );
multiPass.reDecorateRelationship( processor,
RelationshipRecordCheck.relationshipRecordCheckSourceChain() );
tasks.add( create( CheckStage.Stage7_RS_Backward.name(), nativeStores.getRelationshipStore(),
processor, QueueDistribution.RELATIONSHIPS ) );
//relationshipGroup
StoreProcessor relGrpProcessor = multiPass.processor( Stage.PARALLEL_FORWARD, RELATIONSHIP_GROUPS );
tasks.add( create( "RelationshipGroupStore-RelGrp", nativeStores.getRelationshipGroupStore(),
relGrpProcessor, ROUND_ROBIN ) );
PropertyReader propertyReader = new PropertyReader( nativeStores );
tasks.add( recordScanner( CheckStage.Stage8_PS_Props.name(),
new IterableStore<>( nativeStores.getNodeStore(), true ),
new PropertyAndNode2LabelIndexProcessor( reporter, checkIndexes ? indexes : null,
propertyReader, cacheAccess, mandatoryProperties.forNodes( reporter ) ),
CheckStage.Stage8_PS_Props, ROUND_ROBIN,
new IterableStore<>( nativeStores.getPropertyStore(), true ) ) );
tasks.add( create( "StringStore-Str", nativeStores.getStringStore(),
multiPass.processor( Stage.SEQUENTIAL_FORWARD, STRINGS ), ROUND_ROBIN ) );
tasks.add( create( "ArrayStore-Arrays", nativeStores.getArrayStore(),
multiPass.processor( Stage.SEQUENTIAL_FORWARD, ARRAYS ), ROUND_ROBIN ) );
}
// The schema store is verified in multiple passes that share state since it fits into memory
// and we care about the consistency of back references (cf. SemanticCheck)
// PASS 1: Dynamic record chains
tasks.add( create( "SchemaStore", nativeStores.getSchemaStore(), ROUND_ROBIN ) );
// PASS 2: Rule integrity and obligation build up
final SchemaRecordCheck schemaCheck =
new SchemaRecordCheck( new SchemaStorage( nativeStores.getSchemaStore() ), indexes );
tasks.add( new SchemaStoreProcessorTask<>( "SchemaStoreProcessor-check_rules", statistics, numberOfThreads,
nativeStores.getSchemaStore(), nativeStores, "check_rules",
schemaCheck, multiPartBuilder, cacheAccess, defaultProcessor, ROUND_ROBIN ) );
// PASS 3: Obligation verification and semantic rule uniqueness
tasks.add( new SchemaStoreProcessorTask<>( "SchemaStoreProcessor-check_obligations", statistics,
numberOfThreads, nativeStores.getSchemaStore(), nativeStores,
"check_obligations", schemaCheck.forObligationChecking(), multiPartBuilder, cacheAccess, defaultProcessor,
ROUND_ROBIN ) );
if ( checkGraph )
{
tasks.add( create( "RelationshipTypeTokenStore", nativeStores.getRelationshipTypeTokenStore(), ROUND_ROBIN ) );
tasks.add( create( "PropertyKeyTokenStore", nativeStores.getPropertyKeyTokenStore(), ROUND_ROBIN ) );
tasks.add( create( "LabelTokenStore", nativeStores.getLabelTokenStore(), ROUND_ROBIN ) );
tasks.add( create( "RelationshipTypeNameStore", nativeStores.getRelationshipTypeNameStore(), ROUND_ROBIN ) );
tasks.add( create( "PropertyKeyNameStore", nativeStores.getPropertyKeyNameStore(), ROUND_ROBIN ) );
tasks.add( create( "LabelNameStore", nativeStores.getLabelNameStore(), ROUND_ROBIN ) );
tasks.add( create( "NodeDynamicLabelStore", nativeStores.getNodeDynamicLabelStore(), ROUND_ROBIN ) );
}
ConsistencyReporter filteredReporter = multiPass.reporter( NODES );
if ( checkLabelScanStore )
{
long highId = nativeStores.getNodeStore().getHighId();
tasks.add( new LabelIndexDirtyCheckTask() );
tasks.add( recordScanner( "LabelScanStore",
new GapFreeAllEntriesLabelScanReader( labelScanStore.allNodeLabelRanges(), highId ),
new LabelScanDocumentProcessor( filteredReporter, new LabelScanCheck() ), Stage.SEQUENTIAL_FORWARD,
ROUND_ROBIN ) );
}
if ( checkIndexes )
{
tasks.add( new IndexDirtyCheckTask() );
for ( IndexDescriptor indexRule : indexes.onlineRules() )
{
tasks.add( recordScanner( format( "Index_%d", indexRule.getId() ),
new IndexIterator( indexes.accessorFor( indexRule ) ),
new IndexEntryProcessor( filteredReporter, new IndexCheck( indexRule ) ),
Stage.SEQUENTIAL_FORWARD, ROUND_ROBIN ) );
}
}
return tasks;
}
private <RECORD> RecordScanner<RECORD> recordScanner( String name,
BoundedIterable<RECORD> store, RecordProcessor<RECORD> processor, Stage stage,
QueueDistribution distribution,
@SuppressWarnings( "rawtypes" ) IterableStore... warmupStores )
{
return stage.isParallel()
? new ParallelRecordScanner<>( name, statistics, numberOfThreads, store, multiPartBuilder, processor,
cacheAccess, distribution, warmupStores )
: new SequentialRecordScanner<>( name, statistics, numberOfThreads, store, multiPartBuilder, processor,
warmupStores );
}
private <RECORD extends AbstractBaseRecord> StoreProcessorTask<RECORD> create( String name,
RecordStore<RECORD> input, QueueDistribution distribution )
{
return new StoreProcessorTask<>( name, statistics, numberOfThreads, input, nativeStores, name, multiPartBuilder,
cacheAccess, defaultProcessor, distribution );
}
private <RECORD extends AbstractBaseRecord> StoreProcessorTask<RECORD> create( String name,
RecordStore<RECORD> input, StoreProcessor processor, QueueDistribution distribution )
{
return new StoreProcessorTask<>( name, statistics, numberOfThreads, input, nativeStores, name, multiPartBuilder,
cacheAccess, processor, distribution );
}
private class LabelIndexDirtyCheckTask extends ConsistencyCheckerTask
{
LabelIndexDirtyCheckTask()
{
super( "Label index dirty check", Statistics.NONE, 1 );
}
@Override
public void run()
{
if ( labelScanStore instanceof NativeLabelScanStore )
{
if ( ((NativeLabelScanStore)labelScanStore).isDirty() )
{
reporter.report( new LabelScanIndex(), ConsistencyReport.LabelScanConsistencyReport.class,
RecordType.LABEL_SCAN_DOCUMENT ).dirtyIndex();
}
}
}
}
private class IndexDirtyCheckTask extends ConsistencyCheckerTask
{
IndexDirtyCheckTask()
{
super( "Indexes dirty check", Statistics.NONE, 1 );
}
@Override
public void run()
{
for ( IndexDescriptor indexRule : indexes.onlineRules() )
{
if ( indexes.accessorFor( indexRule ).isDirty() )
{
reporter.report( new IndexRecord( indexRule ), ConsistencyReport.IndexConsistencyReport.class,
RecordType.INDEX ).dirtyIndex();
}
}
}
}
}