-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
CountsRecordState.java
329 lines (291 loc) · 11.3 KB
/
CountsRecordState.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
/*
* Copyright (c) 2002-2015 "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.api;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import org.neo4j.kernel.impl.store.counts.keys.CountsKey;
import org.neo4j.kernel.impl.transaction.command.Command;
import org.neo4j.kernel.impl.transaction.state.RecordState;
import org.neo4j.register.Register.DoubleLongRegister;
import org.neo4j.register.Registers;
import static java.util.Objects.requireNonNull;
import static org.neo4j.kernel.api.ReadOperations.ANY_LABEL;
import static org.neo4j.kernel.api.ReadOperations.ANY_RELATIONSHIP_TYPE;
import static org.neo4j.kernel.impl.store.counts.keys.CountsKeyFactory.indexSampleKey;
import static org.neo4j.kernel.impl.store.counts.keys.CountsKeyFactory.indexStatisticsKey;
import static org.neo4j.kernel.impl.store.counts.keys.CountsKeyFactory.nodeKey;
import static org.neo4j.kernel.impl.store.counts.keys.CountsKeyFactory.relationshipKey;
public class CountsRecordState implements CountsAccessor, RecordState, CountsAccessor.Updater, CountsAccessor.IndexStatsUpdater
{
private static final long DEFAULT_FIRST_VALUE = 0, DEFAULT_SECOND_VALUE = 0;
private final Map<CountsKey, DoubleLongRegister> counts = new HashMap<>();
@Override
public DoubleLongRegister nodeCount( int labelId, DoubleLongRegister target )
{
counts( nodeKey( labelId ) ).copyTo( target );
return target;
}
@Override
public void incrementNodeCount( int labelId, long delta )
{
counts( nodeKey( labelId ) ).increment( 0l, delta );
}
@Override
public DoubleLongRegister relationshipCount( int startLabelId, int typeId, int endLabelId,
DoubleLongRegister target )
{
counts( relationshipKey( startLabelId, typeId, endLabelId ) ).copyTo( target );
return target;
}
@Override
public DoubleLongRegister indexSample( int labelId, int propertyKeyId, DoubleLongRegister target )
{
counts( indexSampleKey( labelId, propertyKeyId ) ).copyTo( target );
return target;
}
@Override
public void incrementRelationshipCount( int startLabelId, int typeId, int endLabelId, long delta )
{
if ( delta != 0 )
{
counts( relationshipKey( startLabelId, typeId, endLabelId ) ).increment( 0l, delta );
}
}
@Override
public DoubleLongRegister indexUpdatesAndSize( int labelId, int propertyKeyId, DoubleLongRegister target )
{
counts( indexStatisticsKey( labelId, propertyKeyId ) ).copyTo( target );
return target;
}
@Override
public void replaceIndexUpdateAndSize( int labelId, int propertyKeyId, long updates, long size )
{
counts( indexStatisticsKey( labelId, propertyKeyId ) ).write( updates, size );
}
@Override
public void incrementIndexUpdates( int labelId, int propertyKeyId, long delta )
{
counts( indexStatisticsKey( labelId, propertyKeyId ) ).increment( delta, 0l );
}
@Override
public void replaceIndexSample( int labelId, int propertyKeyId, long unique, long size )
{
counts( indexSampleKey( labelId, propertyKeyId ) ).write( unique, size );
}
@Override
public void close()
{
// this is close() of CountsAccessor.Updater - do nothing.
}
@Override
public void accept( CountsVisitor visitor )
{
for ( Map.Entry<CountsKey, DoubleLongRegister> entry : counts.entrySet() )
{
DoubleLongRegister register = entry.getValue();
entry.getKey().accept( visitor, register.readFirst(), register.readSecond() );
}
}
@Override
public void extractCommands( Collection<Command> target )
{
accept( new CommandCollector( target ) );
}
public List<Difference> verify( CountsVisitor.Visitable visitable )
{
Verifier verifier = new Verifier( counts );
visitable.accept( verifier );
return verifier.differences();
}
@Override
public boolean hasChanges()
{
return !counts.isEmpty();
}
public static final class Difference
{
private final CountsKey key;
private final long expectedFirst;
private final long expectedSecond;
private final long actualFirst;
private final long actualSecond;
public Difference( CountsKey key, long expectedFirst, long expectedSecond, long actualFirst, long actualSecond )
{
this.expectedFirst = expectedFirst;
this.expectedSecond = expectedSecond;
this.actualFirst = actualFirst;
this.actualSecond = actualSecond;
this.key = requireNonNull( key, "key" );
}
@Override
public String toString()
{
return String.format( "%s[%s expected=%d:%d, actual=%d:%d]", getClass().getSimpleName(), key, expectedFirst, expectedSecond, actualFirst, actualSecond );
}
public CountsKey key()
{
return key;
}
@Override
public boolean equals( Object obj )
{
if ( this == obj )
{
return true;
}
if ( (obj instanceof Difference) )
{
Difference that = (Difference) obj;
return actualFirst == that.actualFirst && expectedFirst == that.expectedFirst
&& actualSecond == that.actualSecond && expectedSecond == that.expectedSecond
&& key.equals( that.key );
}
return false;
}
@Override
public int hashCode()
{
int result = key.hashCode();
result = 31 * result + (int) (expectedFirst ^ (expectedFirst >>> 32));
result = 31 * result + (int) (expectedSecond ^ (expectedSecond >>> 32));
result = 31 * result + (int) (actualFirst ^ (actualFirst >>> 32));
result = 31 * result + (int) (actualSecond ^ (actualSecond >>> 32));
return result;
}
}
public void addNode( long[] labels )
{
incrementNodeCount( ANY_LABEL, 1 );
for ( long label : labels )
{
incrementNodeCount( (int) label, 1 );
}
}
public void addRelationship( long[] startLabels, int type, long[] endLabels )
{
incrementRelationshipCount( ANY_LABEL, ANY_RELATIONSHIP_TYPE, ANY_LABEL, 1 );
incrementRelationshipCount( ANY_LABEL, type, ANY_LABEL, 1 );
for ( long startLabelId : startLabels )
{
incrementRelationshipCount( (int) startLabelId, ANY_RELATIONSHIP_TYPE, ANY_LABEL, 1 );
incrementRelationshipCount( (int) startLabelId, type, ANY_LABEL, 1 );
}
for ( long endLabelId : endLabels )
{
incrementRelationshipCount( ANY_LABEL, ANY_RELATIONSHIP_TYPE, (int) endLabelId, 1 );
incrementRelationshipCount( ANY_LABEL, type, (int) endLabelId, 1 );
}
}
private DoubleLongRegister counts( CountsKey key )
{
DoubleLongRegister count = counts.get( key );
if ( count == null )
{
count = Registers.newDoubleLongRegister( DEFAULT_FIRST_VALUE, DEFAULT_SECOND_VALUE );
counts.put( key, count );
}
return count;
}
private static class CommandCollector extends CountsVisitor.Adapter
{
private final Collection<Command> commands;
CommandCollector( Collection<Command> commands )
{
this.commands = commands;
}
@Override
public void visitNodeCount( int labelId, long count )
{
if ( count != 0 )
{ // Only add commands for counts that actually change
commands.add( new Command.NodeCountsCommand().init( labelId, count ) );
}
}
@Override
public void visitRelationshipCount( int startLabelId, int typeId, int endLabelId, long count )
{
if ( count != 0 )
{ // Only add commands for counts that actually change
commands.add( new Command.RelationshipCountsCommand().init( startLabelId, typeId, endLabelId, count ) );
}
}
}
private static class Verifier implements CountsVisitor
{
private final Map<CountsKey, DoubleLongRegister> counts;
private final List<Difference> differences = new ArrayList<>();
Verifier( Map<CountsKey, DoubleLongRegister> counts )
{
this.counts = new HashMap<>( counts );
}
@Override
public void visitNodeCount( int labelId, long count )
{
verify( nodeKey( labelId ), 0, count );
}
@Override
public void visitRelationshipCount( int startLabelId, int typeId, int endLabelId, long count )
{
verify( relationshipKey( startLabelId, typeId, endLabelId ), 0, count );
}
@Override
public void visitIndexStatistics( int labelId, int propertyKeyId, long updates, long size )
{
verify( indexStatisticsKey( labelId, propertyKeyId ), updates, size );
}
@Override
public void visitIndexSample( int labelId, int propertyKeyId, long unique, long size )
{
verify( indexSampleKey( labelId, propertyKeyId ), unique, size );
}
private void verify( CountsKey key, long actualFirst, long actualSecond )
{
DoubleLongRegister expected = counts.remove( key );
if ( expected == null )
{
if ( actualFirst != 0 || actualSecond != 0 )
{
differences.add( new Difference( key, 0, 0, actualFirst, actualSecond ) );
}
}
else {
long expectedFirst = expected.readFirst();
long expectedSecond = expected.readSecond();
if ( expectedFirst != actualFirst || expectedSecond != actualSecond )
{
differences.add( new Difference( key, expectedFirst, expectedSecond, actualFirst, actualSecond ) );
}
}
}
public List<Difference> differences()
{
for ( Map.Entry<CountsKey, DoubleLongRegister> entry : counts.entrySet() )
{
DoubleLongRegister value = entry.getValue();
differences.add( new Difference( entry.getKey(), value.readFirst(), value.readSecond(), 0, 0 ) );
}
counts.clear();
return differences;
}
}
}