-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
NativeSchemaNumberIndexPopulator.java
204 lines (183 loc) · 6.27 KB
/
NativeSchemaNumberIndexPopulator.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
/*
* 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.kernel.impl.index.schema;
import java.io.File;
import java.io.IOException;
import java.nio.charset.StandardCharsets;
import java.util.Collection;
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.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.impl.index.GBPTreeUtil;
/**
* {@link IndexPopulator} backed by a {@link GBPTree}.
*
* @param <KEY> type of {@link NumberKey}.
* @param <VALUE> type of {@link NumberValue}.
*/
public abstract class NativeSchemaNumberIndexPopulator<KEY extends NumberKey, VALUE extends NumberValue>
extends NativeSchemaNumberIndex<KEY,VALUE> implements IndexPopulator
{
static final byte BYTE_ONLINE = 1;
static final byte BYTE_FAILED = 0;
private final KEY treeKey;
private final VALUE treeValue;
private final ConflictDetectingValueMerger<VALUE> conflictDetectingValueMerger;
private final NativeSchemaNumberIndexUpdater<KEY,VALUE> singleUpdater;
private Writer<KEY,VALUE> singleTreeWriter;
private byte[] failureBytes;
private boolean dropped;
NativeSchemaNumberIndexPopulator( PageCache pageCache, File storeFile, Layout<KEY,VALUE> layout )
{
super( pageCache, storeFile, layout );
this.treeKey = layout.newKey();
this.treeValue = layout.newValue();
this.conflictDetectingValueMerger = new ConflictDetectingValueMerger<>();
singleUpdater = new NativeSchemaNumberIndexUpdater<>( layout.newKey(), layout.newValue() );
}
@Override
public synchronized void create() throws IOException
{
GBPTreeUtil.deleteIfPresent( pageCache, storeFile );
instantiateTree( RecoveryCleanupWorkCollector.IMMEDIATE );
instantiateWriter();
}
void instantiateWriter() throws IOException
{
assert singleTreeWriter == null;
singleTreeWriter = tree.writer();
}
@Override
public synchronized void drop() throws IOException
{
try
{
closeWriter();
closeTree();
GBPTreeUtil.deleteIfPresent( pageCache, storeFile );
}
finally
{
dropped = true;
}
}
@Override
public void add( Collection<? extends IndexEntryUpdate<?>> updates ) throws IndexEntryConflictException, IOException
{
for ( IndexEntryUpdate<?> update : updates )
{
add( update );
}
}
@Override
public void add( IndexEntryUpdate<?> update ) throws IndexEntryConflictException, IOException
{
NativeSchemaNumberIndexUpdater
.processAdd( treeKey, treeValue, update, singleTreeWriter, conflictDetectingValueMerger );
}
@Override
public void verifyDeferredConstraints( PropertyAccessor propertyAccessor )
throws IndexEntryConflictException, IOException
{
// No-op, uniqueness is checked for each update in add(IndexEntryUpdate)
}
@Override
public IndexUpdater newPopulatingUpdater( PropertyAccessor accessor ) throws IOException
{
return singleUpdater.initialize( singleTreeWriter, false );
}
@Override
public synchronized void close( boolean populationCompletedSuccessfully ) throws IOException
{
try
{
closeWriter();
if ( populationCompletedSuccessfully && failureBytes != null )
{
throw new IllegalStateException( "Can't mark index as online after it has been marked as failure" );
}
if ( populationCompletedSuccessfully )
{
assertPopulatorOpen();
markTreeAsOnline();
}
else
{
assertNotDropped();
ensureTreeInstantiated();
markTreeAsFailed();
}
}
finally
{
closeTree();
}
}
private void assertNotDropped()
{
if ( dropped )
{
throw new IllegalStateException( "Populator has already been dropped." );
}
}
@Override
public void markAsFailed( String failure ) throws IOException
{
failureBytes = failure.getBytes( StandardCharsets.UTF_8 );
}
private void ensureTreeInstantiated() throws IOException
{
if ( tree == null )
{
instantiateTree( RecoveryCleanupWorkCollector.NULL );
}
}
private void assertPopulatorOpen()
{
if ( tree == null )
{
throw new IllegalStateException( "Populator has already been closed." );
}
}
private void markTreeAsFailed() throws IOException
{
if ( failureBytes == null )
{
failureBytes = "".getBytes();
}
tree.checkpoint( IOLimiter.unlimited(), new FailureHeaderWriter( failureBytes ) );
}
private void markTreeAsOnline() throws IOException
{
tree.checkpoint( IOLimiter.unlimited(), ( pc ) -> pc.putByte( BYTE_ONLINE ) );
}
void closeWriter() throws IOException
{
singleTreeWriter = closeIfPresent( singleTreeWriter );
}
}